| Date | Topic | Assignment | |
|---|---|---|---|
| M | Jan 12 | Lab 0x0: Setup | |
| T | Jan 13 | Overview (Slides) (Handout) | |
| R | Jan 14 | Contracts (Slides) | |
| F | Jan 15 | Recitation 0x0: C0 basics | Quiz 0x0 |
| M | Jan 19 | Martin Luther King, Jr. Day | |
| T | Jan 20 | Integers (Slides) | Written 0x1 Due |
| R | Jan 22 | Arrays | Scavenger Hunt Due |
| F | Jan 23 | Recitation 0x1: Integers | Quiz 0x1 |
| M | Jan 26 | Lab 0x2: Integers | Written 0x2 Due |
| T | Jan 27 | Search (arrayutil.c0 handout) (Code) | |
| R | Jan 29 | Sorting (Code) | Pixels Due |
| F | Jan 30 | Recitation 0x2: Big-O | Quiz 0x2 |
| M | Feb 2 | Lab 0x3: Timing and Testing | Written 0x3 Due |
| T | Feb 3 | Binary Search (Code) | |
| R | Feb 5 | Quicksort (Code) | Images Due |
| F | Feb 6 | Recitation 0x3: Sorting | Quiz 0x3 |
| M | Feb 9 | Lab 0x4: Recursion | Written 0x4 Due |
| T | Feb 10 | Data Structures (Code) | |
| R | Feb 12 | Stacks and Queues (Code) | DosLingos Due |
| F | Feb 13 | Recitation 0x4: Stacks | Quiz 0x4 |
| M | Feb 16 | Lab 0x5: Clac | |
| T | Feb 17 | MIDTERM 1 | |
| R | Feb 19 | Linked Lists (Code) (Slides) | |
| F | Feb 20 | Recitation 0x5: Linked lists | |
| M | Feb 23 | Lab 0x6: Lists | Written 0x6 Due |
| T | Feb 24 | Amortized Analysis (Code) (Slides) | |
| R | Feb 26 | Hash Tables | Clac Due |
| F | Feb 27 | Recitation 0x6: Unbounded arrays | Quiz 0x6 |
| M | Mar 2 | Lab 0x7: Hashing | Written 0x7 Due |
| T | Mar 3 | Sets (Code) | |
| R | Mar 5 | Generic Data Structures (Code) | Editor Checkpoint |
| F | Mar 6 | Mid-semester break | |
| M | Mar 16 | Lab 0x8: Sets | Written 0x8 Due |
| T | Mar 17 | Binary Search Trees (Code) | |
| R | Mar 19 | AVL Trees (Code) (Slides) | Editor Due |
| F | Mar 20 | Recitation 0x8: AVL trees | Quiz 0x8 |
| M | Mar 23 | Lab 0x9: Trees | Written 0x9 Due |
| T | Mar 24 | Priority Queues | |
| R | Mar 26 | Restoring Invariants (Code) | Ropes Due |
| F | Mar 27 | Recitation 0x9: Heaps | Quiz 0x9 |
| M | Mar 30 | Lab 0xA: Heaps | |
| T | Mar 31 | MIDTERM 2 | |
| R | Apr 2 | Memory Management | |
| F | Apr 3 | Recitation 0xA: C Basics - SPECIAL LOCATION: CYERT 100A | |
| M | Apr 6 | Lab 0xB: Strings in C | Written 0xB Due |
| T | Apr 7 | Types in C | |
| R | Apr 9 | Tries (Code) | String Buffers Due |
| F | Apr 10 | Recitation 0xB: More C | Quiz 0xB |
| M | Apr 13 | Lab 0xC: Generic sort | Written 0xC Due |
| T | Apr 14 | Virtual Machines (Handout) (Code) | |
| R | Apr 16 | Carnival | Lights Out Due |
| F | Apr 17 | Carnival | |
| M | Apr 20 | Lab 0xD: Bomb | |
| T | Apr 21 | Graph Search (Code) | |
| R | Apr 23 | Spanning Trees | C0 Virtual Machine Checkpoint |
| F | Apr 24 | Recitation 0xD: The C0VM (Slides) | Quiz 0xC |
| M | Apr 27 | Lab 0xE: Graphs | Written 0xE Due |
| T | Apr 28 | Union-Find (Code) | |
| R | Apr 30 | A Tour of C | C0 Virtual Machine Due |
| F | May 1 | Recitation 0xE: Minimum Spanning Trees | Quiz 0xE |
| May 4 | FINAL EXAM, 5:30-8:30 p.m., location TBA | ||