Sep. 6, 8  Ch. 1. Algorithm Analysis 
For Friday: read section 1.1
For Monday: read section 1.2.1 Homework 1, due Wednesday, 9/13 
Sep. 11, 13, 15  Ch. 1. Algorithm Analysis, cont. 
For Wednesday: read sections 1.2.2, 1.2.3
Homework 2, due 9/18 Program 1: Log Log, due 9/22 
Sep. 18, 20, 22  Ch. 2. Basic Data Structures: Stacks, Queues, and Trees, Priority Queues and Heaps 
Homework 3: R1.6, R1.8, R1.19, C1.3 (also give the amortized runtime per increment), C1.25 (use
O(log n) testers), due 9/22 Read 2.4, (priority queues and heaps), 2.5 (dictionaries and hash tables). Homework 4: R2.12, but use the list [2, 5, 16, 4, 10, 23], R2.16, R2.17, C2.4, C2.11, due 9/27 
Sep. 25, 27, 29 
Ch. 2.5. Dictionaries and Hash
Tables.
Sept. 25: no class 
Homework 5: R2.19, R2.20, R2.22, due 10/2 Program 2: Babble, due 10/13 [resources] 
Oct. 2, 4, 6  Ch. 3. Search Trees. 
Read ch. 3 sections 1 and 3. 
Oct. 9, 11, 13  Ch. 4. Sorting, Sets, and Selection. 
Oct. 9: Test 1.
Homework 6: R3.8, R3.11, R3.12, due 10/16. Read 4.14.6. 
Oct. 16, 18, 20  Ch. 5. Fundamental Algorithm Design Techniques. 
Homework 7, due Friday, 10/20
Program 3: Fractal, due 11/3 Read ch. 5. [resources, ex 1 2 3] 
Oct. 23, 27 
Ch. 5, cont. Dynamic programming. 
Homework 8, due 11/1 
Oct. 30, Nov. 1, 3  Ch. 6. Graph Algorithms. 
Read ch. 6. Homework 9, due Monday, 11/6 
Nov. 6, 8, 10  Ch. 6. Graph algorithms cont.
Ch. 7. Weighted graphs, shortest paths. 
Program 4: Bingo, due 11/20.
[resources] Homework 10: R6.6, R6.7, R6.8, C6.13, due 11/10 
Nov. 13, 15, 17 
Ch. 7, Cont. AI. Intelligent systems search techniques. Minimax search. 
Nov. 13: Homework 11, due Monday, 11/27 
Nov. 20  Heuristic search. 

Nov. 27, 29, Dec. 1  AI, cont. 

Dec. 4, 6, 8   
Dec. 11  Mankalah tournament 