CPSC 212 -- Data Structures and Algorithms

Syllabus

Sep. 7, 9 Ch. 1. Algorithm Analysis For Friday: read section 1.1
For Monday: read section 1.2.1
Homework 1, due Wednesday, 9/14  
Sep. 12, 14, 16 Ch. 1. Algorithm Analysis, cont. For Wednesday: read sections 1.2.2, 1.2.3 Homework 2, due 9/19
Program 1: Log Log, due 9/23  
Sep. 19, 21, 23 Ch. 2. Basic Data Structures: Stacks, Queues, and Trees, Priority Queues and Heaps 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 Ch. 2.5. Dictionaries and Hash Tables.
Homework 5: R-2.19, R-2.20, R-2.22, due 10/3
Program 2: Babble, due 10/14 [resources]  
Oct. 3, 5, 7 Ch. 3. Search Trees. 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 Ch. 4. Sorting, Sets, and Selection. Oct. 10: Test 1.
Read 4.1-4.6.
Homework 7, due Wednesday, 10/19  
Oct. 17, 19, 21 Ch. 5. Fundamental Algorithm Design Techniques. Program 3: Fractal Ferns, due 10/31 [resources, ex1 - ex2]
Read ch. 5.
Homework 8, due Friday, 10/28  
Oct. 24, 28 Ch. 5, cont. Dynamic programming.
 
Oct. 31, Nov. 2, 4 Ch. 6. Graph Algorithms. Read ch. 6.
Homework 9, due Friday, 11/4
Homework 10: R-6.2, R-6.6, R-6.7, R-6.8, C-6.13, due 11/9
Program 4: Bingo, due 11/21. [resources]  
Nov. 7, 9, 11 Ch. 6. Graph algorithms cont.
Ch. 7. Weighted graphs, shortest paths.
Homework (uncollected): R-6.9, R-6.10, R-6.14, due 11/11/11 at 11:11:11.11  
Nov. 14, 16, 18 AI. Intelligent systems search techniques. Minimax search. Nov. 14: Test 2.
Homework 11, due Wednesday, 11/23
 
Nov. 21, 23 AI, cont. Intelligent systems search techniques. Minimax search.
Heuristic search, philosophical issues
Program 5: Mankalah, due 12/7 [resources]
 
Nov. 28, 30, Dec. 2 AI, cont.
Ch. 9. Text processing. Parallel algorithms.
Homework 12, due Friday, 12/2
Homework 13, due Wednesday, 12/7
 
Dec. 5, 7, 9 Ch. 9, cont.  

Final Exam: Friday, December 16, 9:00 am (review sheet)