Course Notes

Notes are in Microsoft Powerpoint or Word format. They can be read on any of the Windows computers in the UCF labs, or, if you're on another computer and don't have Powerpoint, you can get a free viewer from Microsoft.

0. Course Objectives (1 Powerpoint slide, posted 5/13/2005)

1. Mathematical Preliminaries (28 pages of Powerpoint slides) and summation formulas, posted 5/13/2005; rules for order notations (one page of Word file) posted 5/31/2005

2. Computational Complexity (20 pages of Powerpoint slides, posted 5/19/2005)

3. Divide and Conquer (22 pages of Word file, posted 6/05/2005)

4. Heaps (18 pages of Powerpoint slides, posted 6/23/2005)

5. Disjoint Sets (Union-Find Algorithms), Selection (13 pages of hand-written notes in a PDF file, posted 7/05/2005)

6. Greedy Algorithms (28 pages of Powerpoint slides, posted 7/05/2005)

7. Dynamic Programming (18 pages of Powerpoint slides, posted 7/05/2005); more examples (3 pages of a Word file posted 7/21/2005)

8. Backtracking, Branch-and-Bound Techniques (10 pages of Powerpoint slides, posted 7/05/2005)