CPSC 413 Design and Analysis of Algorithms I (Winter 2001)

Lecture times: Lecture Section 03: Monday, Wednesday, Friday 1:00-1:50pm Lecture Section 04: Monday, Wednesday, Friday 12:00-12:50pm

L01 Instructor: Richard Cleve, MS 628, 220-3535, cleve@cpsc.ucalgary.ca
His course website: http://www.cpsc.ucalgary.ca/~cleve/courses/413/01/
Office hours: Wednesdays, 3:00-4:50pm, or by appointment (which can be made in person or by email).

Teaching Assistants:
Arthur Fischer fischera@cpsc.ucalgary.ca His course website: http://www.cpsc.ucalgary.ca/~fischera/413/
Jing Yu jing@cpsc.ucalgary.ca

Calendar description: 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.

Announcements: Please see the following corrections to the hardcopy solutions to the Winter 2000 Final Exam [ PostScript] [ PDF]

Quizzes

Material from the course in Winter 2000