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 8/23/2004)

1. Mathematical Preliminaries (28 pages of Powerpoint slides, pages 16 and 17 updated on 8/26/2004), and summation formulas (posted 8/20/2004)

2. Computational Complexity (20 pages of Powerpoint slides posted 8/20/2004); Chapter 5 (particularly pages 104 - 113) of Professor Wilf's text is a very readbale reference on NP

3. Divide-and-Conquer (22 pages of Word file posted 8/20/2004, updated 10/7/2004, page 11 updated 0/19/2004)

4. Heaps (18 pages of Powerpoint slides, pages 1-14 posted 10/19/2004; page 5 slightly revised 11/02/2004; pages 15-18 added 11/04/2004, page 16 slightly revised 11/05/2004)

5. Disjoint Sets (Union-Find Algorithms), Selection (13 pages of hand-written notes in pdf format, 256K, posted 11/04/2004)

6. Greedy Algorithms (28 pages of Powerpoint slides posted 9/21/2004)

7. Dynamic Programming (18 pages of Powerpoint slides) and additional DP examples (posted 9/21/2004)

8. Backtracking, Branch-and-Bound Techniques