Course Content:

Self adjusting data structures: amortized analysis, self adjusting lists, self adjusting binary search trees, splay trees and related conjectures [10 lectures]

Randomized data structures: pairwise independence, perfect hashing, cuckoo hashing, applications [12 lectures]

Dynamic data structures: Link-cut trees, Euler tour trees, dynamic connectivity and lower bounds [12 lectures]

External memory data structures, geometric data structures, succinct data structures [8 lectures]

Textbooks

  1. Data Structures and Network Algorithms by Robert E. Tarjan, SIAM, 1983. ISBN: 978-1107669376
  2. Open Data Structures by Pat Morin, Athabasca University Press, 2013. ISBN: 978-1927356388

References

  1. This course is modeled along the Advanced Data Structures courses https://ocw.mit.edu/courses/6-851-advanced-data-structures-spring-2012/ and https://courses.csail.mit.edu/6.851/spring21/ at MIT.

Past Offerings

Course Metadata

Item Details
Course Title Advanced Data Structures
Course Code CS5023
Course Credits 3-0-0-3
Course Category PME
Proposing Faculty Venkatesh Raman (Faculty, IMSc Chennai) and Krithika Ramaswamy
Approved on Senate 30 of IIT Palakkad
Course status New