CIS121 Spring 2013
Lectures
| Date | Description | Reading | Slides | Code / Notes |
|---|---|---|---|---|
| Jan 15 | Welcome | Slides | ||
| Jan 17 | Analysis, models of computation, Big-Oh notation | Slides | ||
| Jan 22 | More analysis, Big-Theta, recurrence relations | Slides | ||
| Jan 29 | Maximum Contiguous Subsequence Sum | Slides | ||
| Feb 05 | Stacks, Queues, Lists | Slides | Book Slides | |
| Feb 07 | Priority Queues, Pt.1 | Slides | Book Slides | |
| Feb 14 | Trees, Priority Queues Pt.2, Tree Traversal, Iterators | Slides | ||
| Feb 26 | Graphs, DFS, BFS | Slides | Book Slides | |
| Mar 14 | Minimum Spanning Trees | Book Slides | ||
| Mar 21 | Shortest Paths | Slides | Directed Graphs Shortest Paths | |
| Mar 28 | Sorting Algorithms | Basic Sorting Mergesort Quicksort |
||
| April 9 | Tries, Data Compression | Tries Data Compression |
||
| April 16 | Hash Tables | Slides | Symbol Tables Hash Tables |
|
| April 23 | Balanced Search Trees | Slides | Book Slides |