| Data Structures | |||||||
| Schedule: Subject To Change | |||||||
| # | Day | Date | Reading | Topics | Due at midnight following class | ||
| 1 | F | 1/4 | Introduction | ||||
| 2 | M | 1/7 | 1.3.2-1.4.4.1 | Lists | Object-orientation warmup | ||
| 3 | W | 1/9 | 7.2-7.2.2.3 | Lists | History design | ||
| 4 | F | 1/11 | 7.2-7.2.2.3 | Lists | |||
| 5 | M | 1/14 | 4.2-4.3.2 | Lists / Efficiency of algorithms | History | ||
| 6 | W | 1/16 | 4.2-4.3.2 | Efficiency of algorithms | Rolodex design | ||
| 7 | F | 1/18 | Lab: using a debugger | Complexity | |||
| 8 | M | 1/21 | 2.2-2.3.2 | Stacks | |||
| 9 | W | 1/23 | 2.4-2.4.3 | Queues | Rolodex | ||
| 10 | F | 1/25 | 3.2-3.4.2 | Recursion / searching | Back/forward design | ||
| 11 | M | 1/28 | 3.2-3.4.2 | Recursion / searching | |||
| 12 | W | 1/30 | Searching / backtracking | Back/forward+recursion | |||
| 13 | F | 2/1 | 4.4-4.4.6 | Backtracking / Sorting | Sudoku design | ||
| M | 2/4 | BREAK | |||||
| 14 | W | 2/6 | Exam 1 | ||||
| 15 | F | 2/8 | 4.4-4.4.6 | Exam review / Sorting | |||
| 16 | M | 2/11 | 4.4-4.4.6 | Sorting | Sudoku | ||
| 17 | W | 2/13 | Sets and Maps | Sorting problems | |||
| 18 | F | 2/15 | 5.2-5.4.2,5.5.2 | Trees and traversal | Word Freq design | ||
| 19 | M | 2/18 | 5.6-5.6.3 | Binary search trees | |||
| 20 | W | 2/20 | 5.7 | Heaps and priority queues | Word Frequency | ||
| 21 | F | 2/22 | 4.3.3-4.3.3.4 | Hash tables | Relevant design | ||
| 22 | M | 2/25 | 4.3.3-4.3.3.4 | Hash tables | |||
| 23 | W | 2/27 | 4.3.3-4.3.3.4 | Hash tables | Relevant | ||
| 24 | F | 2/29 | Wikipedia entry | AVL Trees | Caching design | ||
| 25 | M | 3/3 | 6.1-6.3 | Graphs and implementations | |||
| 26 | W | 3/5 | 6.4-6.4.2.2 | Traversing graphs, skip lists | Caching | ||
| 27 | F | 3/7 | 7.4 | Skip lists, tries | |||
| 28 | M | 3/10 | Exam 2 | ||||
| final assignment due: Saturday, March 15, 2:30 pm | Maze | ||||||