| 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: Classes [WEB] |
Dynamic Arrays |
Sections 3.1 and 6.1 |
| 02/09 |
Stacks |
L03: [WEB] |
Queues and Deques |
Chapter 5 |
| 02/16 |
Priority Queues and Binary Heaps |
no lab (presidents day make up) |
Midterm 1 |
Chapter 8 |
| 02/23 |
|
|
|
|
| 03/02 |
|
|
|
|
| 03/09 |
|
|
|
|
| 03/16 |
no class (spring break) |
no lab (spring break) |
no class (spring break) |
|
| 03/23 |
|
|
|
|
| 03/30 |
|
|
Midterm 2 |
|
| 04/06 |
|
|
|
|
| 04/13 |
|
|
|
|
| 04/20 |
|
|
|
|
| 04/27 |
|
|
no class |
|