Description: This is the course on Data Structures and Algorithms taught during Semester-I-2022-23 at IIT Delhi. The (tentative) topics that will be covered in the course are graph algorithms, greedy algorithms, divide and conquer, dynamic programming, backtracking, network flow, and computational intractability. Here (PDF) is a short description.

Lecture and discussion:

Instructor	Ragesh Jaiswal (rjaiswal@cse.iitd.ac.in)
Lecture time	M, Th 8:00-9:20

Textbook:
- Algorithms by Dasgupta, Papadimitriou, and Vazirani.
- Algorithm Design by Jon Kleinberg and Eva Tardos.

Grading: The grading information is given in the table below.

Grading component	#	Total weight
Homework (May include programming exercises)	5	20% (Best 4 out of 5)
Quiz	5	20% (Best 4 out of 5)
Minor	1	20%
Final	1	35%
Comprehension quiz	15~20	5%

Comprehension quizzes are ungraded quizzes that students are supposed to take for a better understanding of the material.