Data Structures
R. Inkulu at cse.iitg

Overview      [CLRS]: 5-14, 23-29, 43-50; [note] Elementary data structures Analysis techniques Balanced search trees Priority queues Disjoint-sets Hashing More randomized dictionaries Graphs Digital search

Comparison-based sorting Distribution-based sorting Selection Worst-case lower bounds

* [CLRS]: Introduction to Algorithms by Cormen, Leiserson, Riverst, and Stein, Third Edition.
* [HSA]: Fundamentals of Data Structures in C by Horowitz, Sahni, and Anderson-Freed, Second Edition.

* Additional resources are provided where needed.

* For the lab part, slides from the course on C Programming are accessible from here.
* For geometric data structures, see the course on computational geometry.

* Prereq denotes that this topic is typically taught in a prereq course.
* AR stands for additional reading (no lecture delivered but included in syllabus).
* EP stands for a problem of importance but it is given as part of an exam.
* NS says that it is not part of the syllabus although it was taught.