CS F211 / MAC F242 Data Structures and Algorithms
Jan–May 2026

• Students
  • CS Single degree 2nd year 2nd semester
  • CS + X, Dual degree 3rd year 2nd semester
  • Math and Computing, 2nd year 2nd semester
• Staff
  • Aniket Basu Roy (Instructor-in-Charge)
  • Girija Deepak Limaye (Instructor)
  • Siddharth Gupta (Lab Instructor)
  • Teaching assistants (TBA)

Click here to join the course Zulip chat or scan the QR code below.

Click here to visit the course webpage or scan the QR code below.

"THE PROCESS of preparing programs for a digital computer is especially attractive, not only because it can be economically and scientifically rewarding, but also because it can be an aesthetic experience much like composing poetry or music."

— The Art of Computer Programming, Donald E. Knuth

1. Foundations
   • What and Why
   • Growth of Functions. Asymptotic Notations
   • Recurrences
   • Probabilistic Analysis and Randomized Algorithms
2. Sorting and Order Statistics
   • Heapsort
   • Quicksort
   • Lower Bounds to Comparision based Sorting. Linear time Sorting
   • Medians and Order Statistics
3. Data Structures
   • Stacks, Queues, Deques, Linked Lists
   • Hash Tables
   • Binary Search Trees
   • Height-Balanced Trees
4. Graph Algorithms
   • Representation of Graphs
   • Graph Traversals
   • Minimum Spanning Trees
   • Single-Source Shortest Paths
   • All-Pairs Shortest Paths
   • Maximum Flow

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to algorithms (4th ed.). MIT Press.
2. Dasgupta, S., Papadimitriou, C. H., & Vazirani, U. V. (2006). Algorithms. McGraw-Hill.
3. Kleinberg, J., & Tardos, E. (2006). Algorithm design. Pearson/Addison-Wesley.
4. Knuth, D. E. (1997). The Art of Computer Programming, Vol. 1: Fundamental Algorithms (3rd ed.). Addison-Wesley.

• To be uploaded after the approval of the DCA.