| # | Date | Topic | Detailed Notes |
Brookshear Reading |
Decker/Hirschfield Reading |
|---|---|---|---|---|---|
| 1 | Tue, Jan 15 | Introduction, Historical Perspective | notes | Ch. 0 | Mod. 1; p. 235-237 |
| 2 | Thu, Jan 17 | Algorithms | notes | Ch. 0.1, 4.1-4.2 | |
| 3 | Tue, Jan 22 | Bits, Memory & Information | notes | Ch. 1.1-1.4; pp. 63-65 | pp. 206-207 |
| 4 | Thu, Jan 24 | Representing Numbers, Arithmetic | notes | pp. 24-25, 38-42 and Ch. 1.5 | pp. 203-206 and middle of p. 248 |
| 5 | Tue, Jan 29 | Logic Gates | notes | pp. 18-20 | Mod. 7.1-7.2 |
| 6 | Thu, Jan 31 | More with Gates and Circuits | notes | pp. 20-23 | Mod. 7.3 |
| 7 | Tue, Feb 5 | Machine Architecture | notes | Ch. 2.1-2.3 | pp. 207-214, Mod. 7.4 |
| 8 | Thu, Feb 7 | Assembly Language Programming | notes | pp. 207-214, Mod. 7.4 | |
| 9 | Tue, Feb 12 | Programming Languages, Program Translation |
notes | pp. 226-229, 243-246, 255-262 | Mod. 6.1, pp. 216-218, Mod. 6.4 |
| 10 | Thu, Feb 14 | Parsing Arithmetic Expressions | notes | pp. 255-262 | Mod. 6.4 |
| 11 | Tue, Feb 19 | Midterm1 | |||
| 12 | Thu, Feb 21 | Software Engineering | notes | Ch. 6.1-6.2, pp. 248-249 | |
| 13 | Tue, Feb 26 | Operating Systems | notes | Ch. 3.1, 3.3 | |
| 14 | Thu, Feb 28 | Operating Systems, Deadlock Guest Lecturer: William Honig |
notes | Ch. 3.4 | |
| Tue, Mar 5 | SPRING BREAK - NO CLASS | ||||
| Thu, Mar 7 | |||||
| 15 | Tue, Mar 12 | Algorithms: Iteration and Recursion (Case Study: Searching) |
notes | pp. 184-190, Ch. 4.5, parts of pp. 206-211, 248-251, 333 |
|
| 16 | Thu, Mar 14 | Algorithms: Iteration and Recursion (Case Study: Sorting) |
notes | Various (see notes) | |
| 17 | Tue, Mar 19 | Data Structures, Linked Lists | notes | p. 321, Ch. 7.1-7.2 (skip second half of p. 326 and all of p. 331) |
|
| 18 | Thu, Mar 21 | Data Structures, Binary Trees | notes | Ch. 7.5 | |
| 19 | Tue, Mar 26 | Relational Databases | notes | Ch. 9.1, pp. 404-409 | |
| 20 | Thu, Mar 28 | Relational Databases | notes | pp. 409-417 | |
| 21 | Tue, Apr 2 | Midterm2 | |||
| 22 | Thu, Apr 4 | Relational Databases | notes | ||
| 23 | Tue, Apr 9 | Artificial Intelligence Overview |
notes | Ch. 10.1, 10.7 | Mod. 9.1-9.3, 9.5 |
| 24 | Thu, Apr 11 | Artificial Intelligence Reasoning |
notes | bottom of p. 440, Ch. 10.3 | |
| 25 | Tue, Apr 16 | Artificial Intelligence Natural Language Processing |
notes | pp. 473-475 | pp. 305-309 |
| 26 | Thu, Apr 18 | Turing Machines | notes | Optionally Ch. 11.2 | pp. 269-277 |
| 27 | Tue, Apr 23 | More with Turing Machines | notes | Review pp. 271-277 | |
| 28 | Thu, Apr 25 | Limits of Computation | notes | Optionally Ch. 11.3-11.4 | pp. 278-290 |
| Tue, Apr 30 | STUDY DAYS - NO CLASS | ||||
| Tue, May 7 | FINAL EXAM 8:00-10:00AM | ||||