Most
Springer publications are available online at SpringerLink
through the University of Manitoba Library.


Introductions, asymptotic notations,
selection
Introduction: slides1 and handouts1
slides2 and handouts2
slides3 and handouts3
slides4 and handouts4
slides5 and handouts5
Selection: slides and handouts
assignment 1
solutions for
assignment 1
Balanced search
trees, skip lists, heaps, disjoint sets, amortized
analusis
Binary Search Trees:
slides
and handouts
assignment 2
solutions
for assignment 2
Skip lists: slides and handouts
Binomial heaps: slides and handouts
assignment 3
solutions
for assignment 3
Amortized analysis:
slides
and handouts
Sample
Midterm
Solutions
for the midterm
Disjoint Sets: slides and handouts
assignment 4
solutions
for assignment 4
Lower bounds,
decision problems, NPcompleteness & polynomial
reduction, satisfiability problem, complexity classes
Lower Bounds: slides and handouts
Complexity: slides and handouts
assignment
5
solutions
for assignment 5
Approximation algorithms, graph
algorithms
Approximation
Algorithms: slides
and handouts
assignment 6
solutions for assignment
6