CSC 364H1Y - Summer 2004
Lecture Notes
These lecture notes have been created and used previously for CSC364
and CSC366. The notes will be modified for our course as well as for
any typos and possible new examples. Therefore, it is recommended that
you only print the notes for the topic that we are currently covering.
- Turing Machines (Week 1-2):
PS or PDF
- Computability (Week 3-4):
PS or PDF
- Greedy Algorithms (Weeks 5-6):
PS or PDF
- Dynamic Programming (Week 7):
PS or PDF
- Polynomial Time (Week 9):
PS or PDF
- NP and NP-Completeness (Week 10-12):
PS or PDF
Back to the course homepage.