Site menu:

CS 341 - Algorithms - Winter 2016

Section 2: Wednesdays and Fridays, 11:30-12:50, MC 1056.
Section 4: Wednesdays and Fridays, 4:00-5:20, MC 2038.
Instructor: Lap Chi Lau
Office hours: Mondays, 10am-12pm, DC 3120.

The main focus is to learn basic techniques to design and analyze efficient algorithms through the study of various classical algorithms. Towards the end, we will also present the notion of NP-completeness and prove that many natural problems are "hard" using polynomial time reductions. The specific topics include:

References: Course notes will be provided. We will mostly use the problems discussed in the following three books.