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