| 01/19 |
no class |
L00: Introduction to CSC 212 [PDF] |
Analysis of algorithms (part 1) [PDF] |
Chapters 1, 2 |
| 01/26 |
Analysis of algorithms (part 2) [PDF] |
L01: Benchmarking algorithms [WEB] |
Big-O Notation [PDF] |
Chapter 4 |
| 02/02 |
Big-O Notation (cont'd) |
L02: Memory Management [WEB] |
Dynamic Arrays [PDF] |
Sections 3.1 and 6.1 |
| 02/09 |
Dynamic Arrays (cont'd) |
L03: Dynamic Arrays [WEB] |
Stacks [PDF] |
Chapter 5 |
| 02/16 |
Queues and Deques [PDF] |
no lab (presidents day make up) |
Midterm 1 |
Chapter 5 |
| 02/23 |
no class (blizzard) |
no lab (blizzard) |
Priority Queues (online) [PDF] |
Chapter 8 |
| 03/02 |
Binary Heaps [PDF] |
L04: Priority Queues [WEB] |
Binary Heaps (cont'd) |
Chapter 8 |
| 03/09 |
Linked Lists [PDF] |
L05: Linked Lists [WEB] |
Recursion [PDF] |
Chapter 3 |
| 03/16 |
no class (spring break) |
no lab (spring break) |
no class (spring break) |
|
| 03/23 |
Recursion (Analysis) [PDF] |
L06: Recursion [WEB] |
Merge Sort [PDF] |
Section 11.1 |
| 03/30 |
Binary Search Trees (part 1) [PDF] |
L07: Sets and Maps [WEB] |
Midterm 2 |
Chapter 7 |
| 04/06 |
Binary Search Trees (part 2) [PDF] |
L08: Binary Search Trees [WEB] |
Binary Search Trees (cont'd) |
Section 10.1 |
| 04/13 |
Balanced Trees (part 1) [PDF] |
L09: Autocomplete [WEB] |
Balanced Trees (part 2) [PDF] |
Sections 10.4, 10.5 |
| 04/20 |
Hash Tables (part 1) [PDF] |
L10: Hashing [WEB] |
Hash Tables (part 2) [PDF] |
Chapter 9 |
| 04/27 |
Graph Representation |
L11: Graph Traversals |
no class |
Sections 13.1, 13.2, 13.3 |