Course Archives Theoretical Statistics and Mathematics Unit

Course: Data Structures and Algorithms Instructor: Kaushik Kumar Majumdar Room: Second floor auditorium Level: Undergraduate Time: Currently offered

Syllabus Past Exams Syllabus: Introduction to data structures, abstract data types, analysis of algorithms. Creation and manipulation of data structures: arrays, lists, stacks, queues, trees, heaps, hash tables, balanced trees, tries, graphs. Algorithms for sorting and searching, order statistics, depth-first and breadth-first search, shortest paths and minimum spanning tree Reference Texts: (a) T. Cormen, C. Leiserson, R. Rivest, C. Stein: Introduction to Algorithms. (b) S. Sahni:Data Structures, Algorithms and Applications in C++. (c) R. Sedgewick and P. Flajolet: Introduction to the Analysis of Algorithms. (d) R. Sedgewick: Algorithms. (e) A. Aho, J. Hopcroft and J. Ullmann: Introduction to Algorithms and Data Structures. (f) S. S. Skiena: The algorithm Design Manual Evaluation: Mid-term marks Assignment marks Final Exam marks Total 100 marks Top of the page Past Exams

Midterm Semestral Supplementary and Back Paper Top of the page

[ Semester Schedule ][ Statmath Unit ] [Indian Statistical Institute]