[/caption]Introduction to Algorithms and Data Structures
Instructor:David H Laidlaw
Download slides from here
Lecture Topics | PPT | |
| Introduction and Seam Carving | ||
| Analysis of Algorithms | ||
| Operation Counting, Big-O, and Induction | ||
| More Induction, Expanding Stack Array, and Hashing | ||
| Binary Search Analysis, Stacks and Queues, and Hashing | ||
| More Hashing and Induction, Dictionary, Priority Queue, and Heaps | ||
| Drunken Paine, Dictionary, Jumble, Priority Queues, and Heaps | ||
| Heaps, Traversal, and Memory | ||
| Binary Trees and Counting Memory | ||
| Graphs, DAGs, Topological Sort | ||
| Selection and Master Theorem | ||
| More Master Theorem, Quicksort, Comparison Sorting, and Radix Sort | ||
| Convex Hull | ||
| Midterm Review | ||
| More Graphs | ||
| Bellman-Ford | ||
| Prim, Kruskal, Minimum Spanning Trees | ||
| Union Find | ||
| Cuts Graphs and Beyond | ||
| Tree Properties, Applications |
