Lectures: COMPSCI 320 Semester 2, City Campus

Final lecture recordings will also be uploaded to Canvas.

• Week 1-2 (mjd). Course introduction, sample algorithm design, and review of CS220.
• Week 3-4 (Ninh). Divide-and-conquer algorithms.
• Week 5-6 (mjd). Greedy algorithms.
• Midterm test Tuesday, 17-Sept-2019. 6.30pm
• Week 7-8 (Ninh). Randomized algorithms.
• Week 9-10 (mjd). Dynamic programming.
• Week 11-12 (mjd). Introduction to NP-completeness.