CS 341 Home Page
Algorithms
Home
People
Resources
Marking
Assignments
Exams
Schedule
Course Description
This course covers the basics of Algorithms: how to design algorithms,
how to analyze and improve their efficiency, and how to know when no
further improvements are likely.
After a brief review of aymptotic notation and basic analysis of algorithms,
the course covers some fundamental algorithmic paradigms: greedy algorithms,
divide-and-conquer, and dynamic programming.
We then discuss exploration of graphs, and finally turn to
lower bounds, NP-completeness, and approximation
algorithms.
Announcements
Office hours for the week of Dec. 13-17 are as follows:
-
Tuesday Dec. 14:
9:30-10:30 Howard Cheng, DC 2302G
2:30-3:30 Dale Schuurmans, DC1310
-
Wednesday Dec. 15:
10-11 Howard Cheng, DC 2302G
2-3 Anna Lubiw, DC 2120
3:30-5:30 Ming Wei-Wang, DC 3115
-
Thursday Dec. 16:
10-4, Adam Storm, DC 3545
2:30-3:30 Dale Scuurmans, DC 1310
-
Friday Dec. 17:
12-2 Andrew Ford, DC2130
2-3 Anna Lubiw, DC 2120
This page is maintained by the
CS 341 course personnel.