CMPU-241-51

Lecture notes will be posted here in pdf format.

1. Introduction (Chapters 1 and 2): 1/22/09 and 1/27/09
   Lectures 1 and 2 (pdf)
   Lectures 1 and 2 (ppt)
   
2. Asymptotic Analysis (Chapter 3): 1/29/09
   Lecture 3 (pdf)
   Lecture 3 (ppt)
   Proof of correctness for Selection-Sort (pdf):
   
3. Recurrences (Chapter 4): 2/3/09
   Lecture 4 (pdf)
   Lecture 4 (ppt)
   
4. Comparison-based Sorting Algorithms - Heap-Sort (Chapter 6): 2/5/09
   Lecture 5 (pdf)
   Lecture 5 (ppt)
   Read Chapters 6 through 8 for next week.
5. Quick-Sort - (Chapter 7): 2/17/09
   Quick-Sort (pdf)
   Quick-Sort (ppt)
   
6. Non-comparison-based sorting algorithms - (Chapter 8): 2/19/09
   NCB Sorts (pdf)
   NCB Sorts (ppt)
   Read Chapter 9 for next class.
7. Medians and order statistics- (Chapter 9): 2/24/09
   Selection Problem (pdf)
   Selection Problem (ppt)
   Read Chapter 12 for next class.
8. Exam 1 Solutions: exam1Sol.pdf
9. Binary Search Trees - (Chapter 12): 2/24 & 2/26/09
   Binary Search Trees (pdf)
   Binary Search Trees (ppt)
10. Balanced Binary Search Trees - (Chapter 13.1 and material not in book): 3/3/09
    Balanced BSTs (pdf)
    Balanced BSTs (ppt)
11. Dynamic Programming (Part 1) - (Chapter 15): 3/26/09
    Intro to dynamic programming (pdf)
    Intro to dynamic programming (ppt)
12. Dynamic Programming (Part 2) - (Chapter 15): 3/31/09
    More DP problems (pdf)
    More DP problems (ppt)
13. Greedy Algorithms - (Chapter 16): 4/2/09
    Knapsack problem (pdf)
    Knapsack problem (ppt)
14. Graph Algorithms - (Chapter 22): 4/7/09
    Breadth-First and Depth-First Search (pdf)
    Breadth-First and Depth-First Search (ppt)
15. Exam 2 Solutions:
16. Minimum Spanning Tree Algorithms - (Chapter 23): 4/9/09
    MST Algorithms (pdf)
    MST Algorithms (ppt)
17. Single-Source-Shortest-Path Algorithms - (Chapter 24): 4/14, 4/16, 4/21
    SSSP Algorithms (pdf)
    SSSP Algorithms (ppt)
18. Introduction to Complexity Classes - (Chapter 34): 4/23, 4/28
    NP-Completeness (pdf)
    NP-Completeness (revised) (ppt)
19. More on NP-Completeness - 4/30
    Proving problems are NPC (pdf)
    Proving problems are NPC (ppt)