University home »
Faculty of Science »
Department of Computer Science »
Courses » COMPSCI 320 S2C » Lectures »
Computer Science
Lectures: COMPSCI 320 Semester 2, City Campus
Approximate Lecture Schedule for 2012
-
Week 1. Course introduction,
Why Study Algorithms?, and
review
asymptotic
analysis.
Recommended reading: Chapters 1 and 2 of textbook.
Week 2. Continue review of CompSci
220: Fundamentals of
graph theory.
Recommended reading: Chapter 3.
Week 3-4. Greedy algorithms. Demonstration:
interval scheduling.
Recommended reading: Chapter 4.
Week 5-6. Divide-and-conquer
algorithms: slides,
Recommended reading: Chapter 5.
Week 7-8. Dynamic programming: lecture
slides.
Recommended reading: Chapter 6.
Week 9-10. Maximum network flow: lecture slides (corrected) for
sections 7.1, 7.2, 7.3 in pdf
and lecture slides for sections
7.5, 7.6, 7.7, 7.8, 7.10, 7.11, 7.12
in pdf.
Recommended reading: Chapter 7.
Week 11-12. Introduction to NP-completeness and problem
reductions (slides).
Required reading: Sections 8.1 through 8.5. Recommended reading: Sections 8.6,
8.7, 8.8 and 8.10.
Why only UA access?
These lecture notes must be accessed via an University Intranet Computer due to
the University's CLL Copyright
Agreement; note
-
Related Programmes
