A tree with a cycle

Design & Analysis of Efficient Algorithms


Instructor: Eustrat Zhupa
Lecture time: TR 9:40 - 10:55
Classroom: Gavett 206
Course Description
This course covers greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness and linear programming is also included.
+ Syllabus
Schedule
Date Topic Notes
Thu, January 12, 2023 Greedy & Dynamic Programming  
Tue, January 17, 2023    
Thu, January 19, 2023    
Tue, January 24, 2023    
Thu, January 26, 2023    
Tue, January 31, 2023    
Thu, February 2, 2023    
Tue, February 7, 2023 Exam 1
 
Thu, February 9, 2023 Graphs  
Tue, February 14, 2023    
Thu, February 16, 2023    
Tue, February 21, 2023    
Thu, February 23, 2023    
Tue, February 28, 2023    
Thu, March 2, 2023    
Tue, March 7, 2023 Spring Break (no classes)  
Thu, March 9, 2023 Spring Break (no classes)  
Tue, March 14, 2023    
Thu, March 16, 2023    
Tue, March 21, 2023 Exam 2  
Thu, March 23, 2023    
Tue, March 28, 2023 Divide and Conquer, NP and other topics (if time permits)  
Thu, March 30, 2023    
Tue, April 4, 2023    
Thu, April 6, 2023    
Tue, April 11, 2023    
Thu, April 13, 2023    
Tue, April 18, 2023    
Thu, April 20, 2023    
Tue, April 25, 2023 Last Day of Classes  
TBD Final Exam  

Note: The schedule is subject to change at the discretion of the instructor.

+ General Rules