Schedule
Monday |
Wednesday |
Friday |
|
January 7 |
9 (Wednesday) Introduction (notes) Brief review (notes) Reading: Chapters 1-6, 7.7, 8, 9.1-9.9, 9.11
|
10 (Thursday) APT Introduction Brief review, continued
|
11 Lab 1 – Compile (mini-lecture notes) APT 1 assigned Reading: Chapter 7.1 and optionally Appendix F |
14 Reading: Chapter 14.1-14.2 Lab 1 due |
16 Linked lists, part 1 (notes) (worksheet)
|
18 Project 1 – Personality Test assigned APT 1 due |
|
21 Martin Luther King Jr. Day |
23 Linked lists, part 2 (notes) (worksheet) Reading: Chapter 14.4-14.6 Lab 2 due |
25 APT 2 assigned Project 1 due |
|
28 Stacks and queues (notes) (worksheet) Reading: Chapters 12.1 – 12.3, 14.3 Lab 3 due |
30 Selection sort; Introduction to Analysis of Algorithms (notes) (worksheet) Reading: Chapter 11 |
February 1 Lab 4 – Analysis of Algorithms Project 2 – Mazes assigned APT 2 due |
|
4 Recursion – basics, function call stack, examples (notes) (worksheet) Lab 4 due |
6 Recursion – thinking recursively, backtracking, minimax (notes) (worksheet) |
8 APT 3 assigned Project 2 due |
|
11 Analysis of recursive algorithms, binary search, merge sort (notes) (worksheet) Lab 5 due |
13 Midterm review (review slides) |
15 |
|
18 President’s Day |
20 Midterm 1 (in class) |
22 (Optional) Programming contest – fun & prizes! |
|
25 Sets (notes) Reading: Chapter 15.1 – 15.2 Lab 6 due |
27 Reading: Chapter 15.3 |
March 1 |
|
4 Hashtables (notes) Lab 7 due |
6 Go over midterms |
8 Project 3 – Evil Hangman assigned APT 3 due |
|
11 Dynamic allocation of memory (notes) (worksheet) Reading: Chapter 7 Lab 8 due |
13 S N O W – No class |
15 Project 3 due |
|
18 Reading: Chapter 13.1 Lab 9 due |
20 Operator overloading (notes) Reading: Chapter 13.2 |
22 Project 4 - Markov assigned Extra Credit APT assigned APT 4 due
|
|
25 SPRING BREAK |
27
|
29
|
|
April 1 Reading: Chapter 13.3 Lab 10 due |
3 Reading: Chapter 16 (16.5 is optional) |
5 |
|
8 Binary Trees (notes) (worksheet)
|
10 CLASS CANCELED Project 4 due |
12 E-Days |
|
15 Midterm review (review slides) Lab 11 due |
17 Midterm 2 (in class) |
19 (Optional) Programming contest – fun & prizes! Project 5 - Animal (20 questions) assigned |
|
22 Binary Search Trees (notes) (worksheet) Reading: Chapter 10 |
24 Inheritance (notes) |
26 Extra credit APT due |
|
29 Graphs (notes) |
May 1 Final Exam Review (notes) Project 5 due |
3 Dead Day |