A tree with a cycle

Design & Analysis of Algorithms (Spring 2021)
(under construction)


Instructor: Eustrat Zhupa
Lecture time: TR 3:25 - 4:40
Classroom: Online
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.
Schedule
Date Topic Reading Notes
Tue, February 2, 2021 Greedy & Dynamic Programming
   
Thu, February 4, 2021      
Tue, February 9, 2021      
Thu, February 11, 2021      
Tue, February 16, 2021      
Thu, February 18, 2021      
Tue, February 23, 2021     02/26 Last day for students to add or drop a class.
Thu, February 25, 2021     First Examination
Tue, March 2, 2021 Graphs   03/01 Last day to declare S/F for courses for Fall 2020 for undergraduates in Arts, Sciences and Engineering.
Thu, March 4, 2021      HW1 (due 3/7)
Tue, March 9, 2021      
Thu, March 11, 2021      
Tue, March 16, 2021      
Thu, March 18, 2021      
Tue, March 23, 2021      
Thu, March 25, 2021      
Tue, March 30, 2021     Study Break Day (no lecture)
Thu, April 1, 2021     Second Examination
Tue, April 6, 2021      
Thu, April 8, 2021     HW2 (due 4/11)
Tue, April 13, 2021 Divide and Conquer, LP, NP, additional problems if time permits.    
Thu, April 15, 2021      
Tue, April 20, 2021      
Thu, April 22, 2021      
Tue, April 27, 2021      
Thu, April 29, 2021      HW3 (due 5/2)
Tue, May 4, 2021      
Thu, May 6, 2021     Class ends.
       
       
TBD Final Exam (UR Official)  
Note  The schedule reflects the lecture dates, dates of exams and the 'no lecture' days (in yellow). The ordering and list of topics is subject to change at the discretion of the instructor.
+ General Rules