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

Course No. Course Title : IS ZC361 : Data Structures and Algorithms

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)

Second Semester 2010-2011

Page 2

Plan of Self-Study Week Topic Chapter Reference to No. Textbook 1. Mathematical Review- Analyzing the algorithms, Complexity T1-Ch.1: 1.1-1.3 estimates; Asymptotic Notation 2. Case Studies, Amortization, Experimentation T1-Ch.1: 1.4-1.6 3. Linear Data Structures T1-Ch.2: 2.1-2.2 4. Trees T1-Ch.2: 2.3 5. Heaps, Priority Queues, Dictionaries and Hashing T1-Ch.2: 2.4-2.5 6. Merge Sort, Set ADT, Quick Sort, Lower Bounds on Sorting T1-Ch.4: 4.1-4.4 7. Bucket Sort, Radix Sort, Comparison of Sorting Algorithms, T1-Ch.4: 4.5-4.7 Selection Problem 8. Ordered Dictionaries, BST and AVL Trees T1-Ch.3: 3.1-3.2 Syllabus for Mid-Semester Test (Closed Book): Topics in Week No. 1 to 8 9. Bounded Depth Search Trees, Splay Trees and Skip Lists T1-Ch.3: 3.3-3.5 10. Algorithm Design Techniques-Greedy Approach and Divide and Conquer T1-Ch.5: 5.1-5.2 Technique 11. Dynamic Programming T1-Ch.5: 5.3 12. Graphs, Graph ADT, Data Structures for Graphs T1-Ch.6 13. Graph Traversals and Directed Graphs T1-Ch.6: 6.3-6.4 14. Weighted Graphs- Single Source Shortest Paths Dijkstras and Bellman T1-Ch.7: 7.1.1-7.1.2 Fords Algorithms 15. Minimum Spanning Trees T1-Ch.7: 7.3 16. Text Processing Algorithms and Tries T1-Ch.9: 9.1-9.2 Syllabus for Comprehensive Exam (Open Book): All topics given in Plan of Self Study

Evaluation Scheme: EC Evaluation Component & No. Type of Examination EC-1 Mid-Semester Test (Closed Book)* EC-2 Comprehensive Exam (Open Book)*

Duration Weightage Day, Date, Session,Time

2 Hours 3 Hours 40% 60% Sunday, 06/02/2011 (AN)* 2 PM 4 PM Sunday, 03/04/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 centres on the dates to be announced later.

Instructor-in-Charge