| Sep. 7, 9 |
For Friday: read section 1.1
For Monday: read section 1.2.1 |
|
| Sep. 12, 14, 16 | Ch. 1. Algorithm Analysis, cont. |
For Wednesday: read sections 1.2.2, 1.2.3
|
| Sep. 19, 21, 23 |
Ch. 2. Basic Data Structures:
|
Homework 3: R-1.6, R-1.19, C-1.3 (also give the amortized runtime per increment), C-1.25 (use
O(log n) testers), due 9/23 Homework 4: R-2.12, but use the list [2, 5, 16, 4, 10, 23], R-2.16, R-2.17, C-2.4, C-2.11, due 9/28 |
| Sep. 26, 28, 30 |
|
Homework 5: R-2.19, R-2.20, R-2.22, due 10/3 |
|
| Oct. 3, 5, 7 |
|
Read ch. 3 sections 1 and 3. |
Homework 6: R-3.8, R-3.11, R-3.12, due 10/7. |
| Oct. 10, 12, 14 |
|
Oct. 10: Read 4.1-4.6. |
| Oct. 17, 19, 21 |
|
Program 3: Read ch. 5. |
| Oct. 24, 28 |
|
|
| Oct. 31, Nov. 2, 4 |
|
Read ch. 6. Homework 10: R-6.2, R-6.6, R-6.7, R-6.8, C-6.13, due 11/9 Program 4: |
| Nov. 7, 9, 11 | Homework (uncollected): R-6.9, R-6.10, R-6.14, due 11/11/11 at 11:11:11.11 | |
| Nov. 14, 16, 18 |
|
Nov. 14: |
| Nov. 21, 23 | Heuristic search, philosophical issues |
|
| Nov. 28, 30, Dec. 2 | AI, cont. |
|
| Dec. 5, 7, 9 | |
Final Exam: Friday, December 16, 9:00 am
(