Handouts:
Labs:
Homework Assignments:
Assignment # |
Exercises |
Due Date |
1 |
1.1 #4; 1.2 #4, 9 | Fri 1-13-12 |
2 |
2.1 #5, 8, 9; 2.2 #2, 3 (no proof required), 4a, 5, 6b | Fri 1-20-12 |
3 |
2.3 #1a-f, 2, 4, 5, 9; 2.4 #1, 2, 4, 7 | Fri 1-27-12 |
4 |
3.1 #1, 2, 5, 6, 9b, 10 | Fri 2-3-12 |
5 |
3.2 #4, 5, 6, 9; 3.4 #4, 5, 8, 10 | Mon 2-13-12 |
6 |
4.1 #1, 3, 5, 6, 7, 8a; 4.3 #1, 2, 4 | Fri 2-17-12 |
7 |
4.4 #1, 4, 5 | Fri 3-24-12 |
8 |
5.1 #3, 4 (follow Figure 5.4); 5.2 #1 (follow Figure 5.5); 2, 4 (follow Figure 5.6) , 6, 7 plus an extra problem; see handout |
Fri 3-9-12 |
9 |
5.4 #1 (Note: Tell how many such objects there are for each question; repeat for an n-element set) 5.5 #1, 2, 4, 5b 6.1 #1, 2, 5, 6 |
Fri 3-16-12 |
10 |
6.4 #1, 2, 3, 5, 7, 8 7.3 #1 (assume insertion at the head of each list, as in Lab 8), 2, 7, 8 8.1 #1, 2, 3, 4, 5 |
Fri 3-23-12 |
11 |
9.4 #1, 3, 4 11.1 #3ab plus handout |
Fri 4-6-12 |
Reading Assignments:
| Week | Day | Assignment | Due Date |
| 1 | M | No Assignment -- will discuss 1.1 - 1.3 in class | |
| W | Read 1.4: Fundamental Data Structures | W 1/11 | |
| R | Read 2.1: Analysis Framework | R 1/12 | |
| F | Lab 1: Java Crash Course (HW 1 due) | F 1/13 | |
| 2 | M | Read 2.2: Asymptotic Notations | M 1/16 |
| W | Lab 2: Quadratic Class | ||
| R | Read 2.3: Mathematical Analysis of Non-Recursive Alg. | R 1/19 | |
| F | Lab 2: Finish Quadratic class (HW 2 due) | F 1/20 | |
| 3 | M | Read 2.4: Mathematical Analysis of Recursive Alg. | M 1/23 |
| W | Lab 3: Keyboard Input | ||
| R | Read 3.1: Selection Sort and Bubble Sort | R 1/26 | |
| F | Catch up day (HW 3 due) | F 1/27 | |
| 4 | M | Review for exam 1 |
|
| W | Exam 1, Through Homework #3 | ||
| R | Read 3.2: Sequential Search | R 2/2 | |
| F | Lab 4: Selection Sort & Bubble Sort (HW 4 due) | F 2/3 | |
| 5 | M | no class (illness) | M 2/6 |
| W | Read 3.4: Exhaustive Search | ||
| R | Read 4.1: Mergesort | R 2/9 | |
| F | Lab 5: Mergesort | F 2/10 | |
| 6 | M | Read 4.3: Binary Search (HW 5 due) | M 2/13 |
| W | Read 4.4: Binary Tree Traversals | W 2/15 | |
| R | No assignment -- catch up day | R 2/16 | |
| F | Lab 6: BinaryTree class(HW 6 due) | F 2/17 | |
| 7 | M | Review for exam 2 |
|
| W | Exam 2, though Homework #6 | ||
| R | Read 5.1: Insertion Sort | R 2/23 | |
| F | Lab 6: BinaryTree, cont. (hw 7 due) | F 2/24 | |
Winter Break |
|||
| 8 | M | Read 5.2: Depth-First and Breadth-First Search | M 3/5 |
| W | Read 5.5: Decrease-by-a-Constant-Factor | W 3/7 | |
| R | Read 6.1: Presorting | R 3/8 | |
| F | Lab 7: Russian Peasant Multiplication (hw 8 due) | F 3/9 | |
| 9 | M | Read 6.4: Heaps and Heapsort | M 3/12 |
| W | Read 7.3: Hashing | W 3/14 | |
| R | Read 8.1: Computing a Binomial Coefficient | R 3/15 | |
| F | Lab 8: Singly-Linked List (hw 9, lab due) | F 3/16 | |
| 10 | M | Read 9.1: Prim's Algorithm | M 3/19 |
| W | Lab 9: Record, SLList | W 3/21 | |
| R | Read 9.4: Huffman Trees | ||
| F | Lab 10: HashTable (hw 10 due) | F 3/23 | |
| 11 | M | Review for exam 3 |
M 3/26 |
| W | Review for exam 3 |
W 3/28 | |
| R | Exam 3, through Homework #10 |
R 3/29 | |
| F | Lab 10 continues | F 3/30 | |
| 12 | M | Read 11.1: Lower-Bound Arguments | M 4/2 |
| W | Lab 11: Heaps and Heapsort (Labs 9 & 10 due) | W 4/4 | |
| R | Read 11.2: Decision Trees | R 4/5 | |
| F | Lab 11 continues (hw 11 due) | F 4/6 | |
| 13 | M | Read 11.3: P, NP, and NP-complete Problems | M 4/9 |
| W | Lab 12: Binomial Coefficients | W 4/11 | |
| R | Review | R 4/12 | |
| F | Review or lab | F 4/13 | |
| 14 | Final Exam -- Weds 4/18, 2-5 PM, CFA 111 |