CS F364: Design and Analysis of Algorithms

Instructor: Tulasimohan Molli
Term: May – July 2026
Venue: BITS Pilani Hyderabad Campus

Syllabus

• Analysis of algorithms: asymptotic notation, recurrences, master theorem.
• Divide and conquer, sorting, order statistics, median finding.
• Dynamic programming: matrix chain, LCS, optimal BST.
• Greedy algorithms: activity selection, Huffman codes, MST.
• Graph algorithms: BFS, DFS, topological sort, strongly connected components.
• Shortest paths: Bellman-Ford, Dijkstra, Floyd-Warshall.
• Maximum flow: Ford-Fulkerson, min-cut, bipartite matching.
• Amortized analysis: aggregate, accounting, potential methods.
• NP-completeness: P, NP, reductions, Cook-Levin theorem.
• Approximation algorithms: vertex cover, TSP, set cover.

Textbooks

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, 4th ed., MIT Press, 2022
• Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005
• Sanjoy Dasgupta, Christos Papadimitriou, and Umesh Vazirani, Algorithms, McGraw-Hill, 2006
• Michael Sipser, Introduction to the Theory of Computation, 3rd ed., Cengage, 2012

Lectures

• In‑class Evaluation: 10% (10‑15 min surprise quizzes)
• Assignments (2): 20% (Take‑home + viva)
• Midterm Exam: 30% (90 min (closed book))
• Comprehensive Exam: 40% (3 h (closed book))

Tulasimohan MolliFull site