Schedule
Important Notice: This is intended to be an overview of the material to be covered in the course, it is subject to change at any time.
| Week | Dates | Topics | Readings | Homework | Lab |
| 1 | T 1/17, R 1/19 | Introductions, Review , Recursion, Dynamic Arrays, Lists |
Chap. 1 | H1 Out | No Lab |
| 2 | T 1/24, R 1/26 | Linked Lists, Mathematical Review, Big O Notation | 3.1-3.2 | Introduction | |
| 3 | T 1/31, R 2/2 | Asymptotic Analysis, Big O Notation, Abstract Data Types, Stacks, Queues | 2.1-2.4 | H1 Due 1/30, H2 Out |
Linked Lists |
| 4 | T 2/7, R 2/9 | Stacks, Queues | 3.3-3.4 | Stacks | |
| 5 | T 2/14, R 2/16 | Trees, Tree Traversals, Binary Search
Trees, Randomized BST, Balanced Trees, 234 Trees Note: 2/17 is the last day to DROP classes (without a 'W' grade) |
Chap. 4 | H2 Due 2/13, H3 Out |
Queues |
| 6 | T 2/21 | |
Trees | ||
| R 2/23 | SkipLists | 10.4.2, 12.3 | |||
| 7 | T 2/28 | In Class Review | H3 Due 2/27, H4 Out |
Review | |
| R 3/2 | Midterm | ||||
| T 3/7, R 3/9 | |||||
| 8 | T 3/14, R 3/16 | Review Midterm Heaps, Elementary Sorting, Heapsort Note: 3/17 is the last day to DROP classes (with a 'W' grade) |
Chap. 6, 7.5 | H5 Out | Review of Midterm |
| 9 | T 3/21, R 3/23 | Quicksort, Quicksort anaylsis | 7.7 | H4 Due 3/20 | Sorting |
| 10 | T 3/28, R 3/30 | Graphs, Graph Traversals, Depth First Search, Breadth First Search | Chap. 9 | H5 Due 3/27, H6 Out |
Sorting |
| 11 | T 4/4, R 4/6 | Minimum Spanning Trees | Graphs | ||
| 12 | T 4/11, R 4/13 | ShortestPath | H6 Due 4/10, H7 Out |
Graphs | |
| 13 | T 4/18, R 4/20 | Hashing | Chap. 5 b | Hashing | |
| 14 | T 4/25, R 4/27 | Final Review | H7 Due 4/24 | Extra Review | |
| W 5/3 | Final Exam 2:00 - 4:00PM |