| Lectures | Textbook Section | On-Line Resources |
| 1/2 - W1a: No Class | ||
| 1/4 - W1b: Overview, development process, first program | 1.3-1.5, 2.1-2.5, 2.8, 12.1-12.3 | Notes |
| 1/6 - W1c: Recursion: Function calls, operators, if statements | 3.1-3.5, 4.1-4.3 | Conditionals, Recursion, |
| 1/9 - W2a: Control - if/else, if/else if, switch, | 4.4, 4.7, 4.8, 4.9 | More conditionals, |
| 1/11 - W2b: Iteration | 5.1-5.10 | Tutorial, Notes |
| 1/13 - W2c: Arrays | 7.1-7.3, 7.7-7.8 | Notes |
| 1/16 - W3a: Martin Luther King, Jr | ||
| 1/18 - W3b: Pointers 1: functions, in, out parameters | 6.1-6.5 | Video, Sec 1, Sec 2: pgs1-9, 17-22 |
|
1/20 - W3c:
strings
END OF MATERIAL FOR EXAM 1 | 8.1-8.4 | Notes |
| 1/23 - W4a: Pointers 2: Arrays of pointers, command-line args, | 8.5, 12.7 | |
| 1/25- W4b: Structs | Chap 10 | |
| 1/27 - W4c: Exam 1: basic programs, pointers, arrays, strings | ||
| 1/30 - W5a: Pointers 3: Dynamic memory allocation, Linked Structures | 13.1-13.4 | Memory: pgs 24-31 Linked list basics |
| 2/1 - W5b: Modifying Linked Lists | ||
| 2/3 - W5c: Stacks/Queues | 13.5,13.6 | |
| 2/6 - W6a: More lists | 13.7 | |
| 2/8 - W6b: Trees | 13.8 | Binary Trees |
| 2/10 - W6c: College Break | ||
|
2/13 - W7a:
Binary Search Trees
END OF MATERIAL FOR EXAM 2 | ||
| 2/15 - W7b: Heaps | ||
| 2/17 - W7c: Binary/hex/octal, Bitwise ops | ||
| 2/20 - W8a: Bitwise operations | ||
| 2/22 - W8b: Exam 2: Linked Lists, Trees, Heaps, Advanced Types | ||
| 2/24 - W8c: Sorting | ||
| 2/27 - W9a: Array-based Trees | ||
| 3/1 - W9b: Hash Tables | ||
| 3/3 - W9c: Hash Tables | ||
| 3/6 - W10a: Graphs | ||
|
3/8 - W10b:
Graphs
END OF MATERIAL FOR EXAM 2 | ||
| 3/10 - W10c: College Reading Period | ||
| Monday, 3/13 - 7-9pm, Kent 102 Final Exam: Complexity, Bases, Bitwise ops, Sorting, Hash Tables, Graphs |