Birla Institute of Technology And Science, Pilani Work-Integrated Learning Programmes Division First Semester 2011-2012 Course Handout

Course No. Course Title Instructor : IS ZC361 : Data Structures and Algorithms : Geeta Patil

Course Description Introduction to software design principles, modularity; ADTs, Data structures and algorithms; Algorithm analysis; Linear Data Structures stacks, arrays, lists, queues; Prefix, infix and post fix expressions; Recursion; Set operations; Hashing; Binary and other trees, traversal algorithms; Huffman codes; Search trees, priority queues, heaps and balanced trees; Sorting techniques; Graphs and digraphs; Algorithmic design techniques; Data structures for external storage, multi way search trees and B trees.

Scope and Objectives Providing a sound conceptual understanding of the fundamental concepts of Data Structures and efficient implementation of various algorithms, keeping the data abstraction and modularity principles in mind. Emphasize the concepts and constructs rather than on language features. The practical implementation aspects of the algorithms, the detailed analysis and synthesis of the same in the light of space-time tradeoff.

Prescribed Text Book: T1. Goodrich, Michael T & Roberto Tamassia, and Algorithm Design: Foundations, Analysis & Internet Examples, Wiley Student Edition, 2002.

Reference Books: R1. R2. R3. Mark Allen Weiss: Data Structures and Algorithms Analysis in C, Pearson, 2000 Cormen T.H. et al., Introduction to Algorithms, 2nd Ed., PHI 2001. Sanjay Dasgupta, Christos P., Umest Vazirani, Algorithms, TMH, 2008.

IS ZC361 (Course Handout) Plan of Self-Study Learning Objectives Lecture No. 1. To learn the nature and significance of complexity classes 2. 3.

First Semester 2011-2012

Page 2

Topic Mathematical Review- Analyzing the algorithms, Complexity estimates; Asymptotic Notation Case Studies Amortization, Experimentation Stacks & Queues

Chapter Reference to Textbook T1-Ch.1: 1.1-1.3

T1-Ch.1: 1.4-1.6 T1-Ch.2: 2.1

4.

5. 6. 7. 8. 9. 10. 11. 12.

To learn about linear data structures stacks and queues, implementation and application. To learn about linear data structures linked list , implementation and application. To learn the representation of non linear data structure, operations performed on it and its application.

Linked Lists

T1-Ch.2: 2.2

To learn different algorithms for sorting their design, efficiency and limitations.

Graphs & Trees, Tree Traversal Binary Search Tree & Operations on Binary Search Tree AVL Trees & Operations on AVL Tree Hash Tables Insertion Sort & Merge Sort

T1-Ch.2: 2.3 T1-Ch.3: 3.1-3.2 T1-Ch.3: 3.2 T1-Ch.2: 2.5 T1-Ch.2: 2.5 & T1Ch.4: 4.1 T1-Ch.2: 2.4 T1-Ch.4: 4.1-4.4

13. 14. 15. 16. 17. 18. 19. 20.

21. 22.

Heaps, & Heap sort Quick Sort, Lower Bounds on Sorting Bucket Sort, Radix Sort, T1-Ch.4: 4.5-4.7 Comparison of Sorting Algorithms Syllabus for Mid-Semester Test (Closed Book): Topics in Lecture No. 1 to 12 To learn algorithm design Algorithm Design Techniques-Divide and T1-Ch.5: 5.1 techniques, their applications Conquer Technique and limitations; Algorithm Design Techniques-Greedy T1-Ch.5: 5.2 Approach Algorithm Design Techniques-Dynamic T1-Ch.5: 5.3 Programming To learn the use of graphs for Longest Common Subsequence T1-Ch.9: 9.4 capturing non-linear relations Graphs, Graph ADT, Data Structures for T1-Ch.6: 6.1-6.2 and to learn the design of Graphs algorithms for computing Graph Traversals T1-Ch.6: 6.3 properties of those relations. Directed Graphs T1-Ch.6: 6.4 Weighted Graphs- Single Source Shortest T1-Ch.7: 7.1.1-7.1.2 Paths Dijkstras and Bellman-Fords Algorithms Minimum Spanning Trees : Kruskals T1-Ch.7: 7.3 Algorithm Prims Algorithm T1-Ch.7: 7.3 Syllabus for Comprehensive Exam (Open Book): All topics given in Plan of Self Study

IS ZC361 (Course Handout) Evaluation Scheme: EC No. EC-1 EC-2 EC-3 Evaluation Component & Type of Examination Assignment/Quiz Mid-Semester Test (Closed Book)* Comprehensive Exam (Open Book)*

First Semester 2011-2012

Page 3

Duration TBA 2 Hours 3 Hours

Weightage 10% 30% 60%

Day, Date, Session,Time TBA Sunday, 04/09/2011 (AN)* 2 PM 4 PM Sunday, 30/10/2011 (AN)* 2 PM 5 PM

* Legend: AN: AfterNoon Session; FN: ForeNoon Session Closed Book Test: No reference material of any kind will be permitted inside the exam hall. Open Book Exam: Use of any printed / written reference material (books and notebooks) will be permitted inside the exam hall. Loose sheets of paper will not be permitted. Computers of any kind will not be allowed inside the exam hall. Use of calculators will be allowed in all exams. No exchange of any material will be allowed.

Note: It shall be the responsibility of the individual student to be regular in maintaining the self study schedule as given in the course handout, attend the online/on demand lectures as per details that would be put up in the BITS WILP website www.bits-pilani.ac.in/dlp-home and take all the prescribed components of the evaluation such as Mid Semester Test and Comprehensive Examination according to the Evaluation Scheme given in the respective Course Handout. If the student is unable to appear for the Regular Test/Examination due to genuine exigencies, the student must refer to the procedure for applying for Make-up Test/Examination, which will be available through the Important Information link on the BITS WILP website on the date of the Regular Test/Examination. The Make-up Tests/Exams will be conducted only at selected exam centers on the dates to be announced later.
Instructor-in-Charge