Slides

• Lecture 1: Intro, circular arrays powerpoint pdf
• Lecture 2: Asymptotic Analysis powerpoint pdf
• Lecture 3: Min Priority Queues, Heaps powerpoint pdf
• Lecture 4: More Heaps, More algorithm analysis powerpoint pdf
• Lecture 5&6: Recurrences powerpoint pdf
• Lecture 7: Introduction to Dictionaries powerpoint pdf
• Lecture 8: AVL Trees powerpoint pdf
• Lecture 9: Hash Tables 1: hash functions, separate chaining powerpoint pdf
• Lecture 10: Hash Tables 2: open addressing powerpoint pdf
• Lecture 11: B-Trees powerpoint pdf
• Lecture 12: Comparison Sorts powerpoint pdf
• Lecture 13: Non-Comparison Sorts powerpoint pdf
• Lecture 14: Parallelism 1 powerpoint pdf
• Lecture 15: Parallelism 2 powerpoint pdf
• Lecture 16: P3 Algorithms powerpoint pdf
• Lecture 17: Two Pass Parallel Algorithms powerpoint pdf
• Lecture 18: Concurrency powerpoint pdf
• Lecture 19: Graphs powerpoint pdf
• Lecture 20: Shortest Paths powerpoint pdf
• Lecture 21: Minimum Spanning Trees powerpoint pdf
• Lecture 22: More Graph Algorithms powerpoint pdf
• Lecture 23-24: P vs. NP powerpoint pdf

Slides are heavily influenced by (and occaionally outright copied from) slides by Ruth Anderson, Evan McCarty, Kasey Champion, and Ben Jones.