Techniques for the analysis of algorithms, including counting, summation, recurrences, and asymptotic relations; techniques for the design of efficient algorithms, including greedy methods, divide and conquer, and dynamic programming; examples of their application; an introduction to tractable and intractable problems.
This course may not be repeated for credit.
Notes
- Students who have credit for Computer Science 319 instead of Computer Science 331 should contact the department for instructions on how to enrol in this course.
Prerequisite(s)
- Computer Science 331; and 313 or 351; and Mathematics 211 or 213; and 3 units from Mathematics 249, 265 or 275.
Sections
| LEC 1 | MWF 10:00 - 10:50
| | Peter Hoyer | | |
| LEC 2 | MWF 08:00 - 08:50
| | Peter Hoyer | | |
| TUT 1 | TR 11:00 - 11:50
| | | | |
| TUT 2 | WF 12:00 - 12:50
| | | | |
| TUT 3 | MW 16:00 - 16:50
| | | | |
| TUT 4 | TR 16:00 - 16:50
| | | | |
| TUT 5 | MW 15:00 - 15:50
| | | | |
| TUT 6 | WF 09:00 - 09:50
| | | | |
| TUT 7 | WF 10:00 - 10:50
| | | | |
| TUT 8 | WF 11:00 - 11:50
| | | | |
| TUT 9 | TR 09:00 - 09:50
| | | | |
| TUT 10 | TR 10:00 - 10:50
| | | | |
| TUT 11 | TR 15:00 - 15:50
| | | | |
| TUT 12 | MW 13:00 - 13:50
| | | | |
| TUT 13 | MW 14:00 - 14:50
| | | | |