How Duolingo Plans to Reach 100M Users

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Massachusetts Institute of Technology

Advanced Data Structures

Massachusetts Institute of Technology via MIT OpenCourseWare

Start learning Write review
CodeSignal Ad

Learn the Skills Netflix, Meta, and Capital One Actually Hire For

Learn More → GetSmarter Ad

MIT Sloan: Lead AI Adoption Across Your Organization — Not Just Pilot It

Learn More →

Overview

Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course covers major results and current directions of research in data structure. Acknowledgments --------------- Thanks to videographers Martin Demaine and Justin Zhang.

Syllabus

1. Persistent Data Structures.
2. Retroactive Data Structures.
3. Geometric Structures I.
4. Geometric Structures II.
5. Dynamic Optimality I.
6. Dynamic Optimality II.
7. Memory Hierarchy Models.
8. Cache-Oblivious Structures I.
9. Cache-Oblivious Structures II.
10. Dictionaries.
11. Integer Models.
12. Fusion Trees.
13. Integer Lower Bounds.
14. Sorting in Linear Time.
15. Static Trees.
16. Strings.
17. Succinct Structures I.
18. Succinct Structures II.
19. Dynamic Graphs I.
20. Dynamic Graphs II.
21. Dynamic Connectivity Lower Bound.
22. History of Memory Models.

Taught by

Prof. Erik Demaine

Tags

Reviews

5.0 rating, based on 1 Class Central review

Start your review of Advanced Data Structures

  • Profile image for Vishal Sharma
    Vishal Sharma
    This course is an incredible deep dive into the theoretical and practical aspects of data structures. Professor Erik Demaine makes complex topics—like retroactivity, persistence, and dynamic optimality—feel accessible yet intellectually rigorous. I particularly appreciated the focus on cache-oblivious algorithms, which changed how I think about memory efficiency in modern hardware. It is definitely a challenging 'advanced' course, so having a strong background in basic algorithms is a must, but the payoff in mental models is worth the effort. Highly recommended for anyone looking to go beyond the standard BSTs and Hash Maps."
Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.