![[linked structure]](images/image001.gif) |
Data
Structures |
|
|
Data
Structures |
SYLLABUS, SUBJECT TO CHANGE
| # | Date | Topic | Reading | Programs | Lab | ||
| 1 | 1/23 | W | Introduction | Syllabus | |||
| 2 | 1/25 | F | Good Practices | Coding Standard | Good Practices Project | 1 | Warmup |
| 3 | 1/28 | M | Introduction to Classes | Ch. 2.1-2.4 | due: Thu 1/31 | ||
| 4 | 1/30 | W | Introduction to Classes | ||||
| 5 | 2/1 | F | Introduction to Big-O | Ch. 2.6 | Classes Project I | 2 | Classes |
| 6 | 2/4 | M | Classes: Overloading Operators | Handout | due: Thu 2/7 | ||
| 7 | 2/6 | W | Classes: Overloading Operators | ||||
| 2/8 | F | SNOW DAY | Classes Project II | 3 | Operators (missed) | ||
| 8 | 2/11 | M | Introduction to Pointers | Ch. 3.3 | due: Thu 2/21 | ||
| 9 | 2/13 | W | An Array-Based List | Ch. 3.1-3.2 | (Rooms) | ||
| 10 | 2/15 | F | More Pointers & Dynamic Memory | Ch. 3.3 cont'd | 4 | Pointer practice | |
| 11 | 2/19 | T | Linked Lists | Ch. 3.4-3.5 | |||
| 12 | 2/20 | W | Linked Lists | ||||
| 13 | 2/22 | F | Templates and the STL | Ch. 6.1 | Linked List Project | 5 | STL lists |
| 14 | 2/25 | M | Advanced Linked Lists | Ch. 4.1-4.4 | due: Thu 3/7 | ||
| 15 | 2/27 | W | Stacks | Ch. 5.1-5.2 | (Things) | ||
| 16 | 3/1 | F | Stacks | 6 | STL stacks | ||
| 17 | 3/4 | M | Queues | Ch. 5.3-5.4 | |||
| 18 | 3/6 | W | Queues | ||||
| 3/8 | F | SNOW DAY | 7 | STL queues | |||
| 19 | 3/11 | M | Recursion | Ch. 7.1-7.9 | |||
| 20 | 3/13 | W | Midterm Review | ||||
| 21 | 3/15 | F | MIDTERM | ||||
| 22 | 3/18 | M | Recursion | Stacks Project | |||
| 23 | 3/20 | W | Recursion | due: Thu 4/11 | |||
| 3/22 | F | ENJOY | (Solitaire) | ||||
| 3/25 | M | OUR | |||||
| 3/27 | W | EXTENDED | |||||
| 3/29 | F | SPRING | |||||
| 4/1 | M | BREAK | |||||
| 24 | 4/3 | W | Trees | Ch. 8 | |||
| 25 | 4/5 | F | Trees | 8 | Recursion practice | ||
| 26 | 4/8 | M | Binary Search Trees | ||||
| 27 | 4/10 | W | Binary Search Trees | ||||
| 28 | 4/12 | F | Heaps | Ch. 9.1-9.2 | Trees Project | 9 | BSTs practice |
| 29 | 4/15 | M | Heaps | due: Thu 4/18 | |||
| 30 | 4/17 | W | Graphs | Ch. 9.3 | (20 Questions) | ||
| 31 | 4/19 | F | Graphs | Graphs Project | 10 | Graphs | |
| 32 | 4/22 | M | Graphs | due: Thu 4/25 | |||
| 33 | 4/24 | W | Searching | Ch. 10.2 | |||
| 34 | 4/26 | F | Hashing | Ch. 10.3 | Hashing Project | 11 | Searching practice |
| 35 | 4/29 | M | Sorting: Intro, Bub, Ins, Sel | Ch. 10.1 | due: Thu 5/2 | ||
| 36 | 5/1 | W | Sorting: Merge and Quicksort | ||||
| 37 | 5/3 | F | Sorting: Heapsort | 12 | Sorting practice | ||
| 38 | 5/6 | M | Review for Final Exam | FINAL: Thu May 9, 11:30am | |||