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

Lecture times: Monday, Wednesday, Friday 1:00-1:50pm

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

Teaching Assistant: Arthur Fischer fischera@cpsc.ucalgary.ca
His course website: http://cyanide.math.ucalgary.ca/413/

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: None currently.

Quizzes and Midterm

Assignments:

Assignment 1 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]

Assignment 2 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]

Assignment 3 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]

Assignment 4 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]

Assignment 5 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]

Assignment 6 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]

Assignment 7 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]

Assignment 8 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]

Assignment 9 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]

Assignment 10 [ PostScript] [ PDF] Solutions [ PostScript] [ PDF]