Handouts:
Labs:
Reading & Homework Assignments
Identifier
|
Assignment | Due 10 AM on...
|
Reading 1.4 |
Read Section 1.4 and write a 1-page summary. | Wed 1/9 |
Reading 2.1 |
Read Section 2.1. You don't have to write a summary. Instead, answer these questions. | Thu 1/10 |
Hwk #1
|
1.1 #4; 1.2 #4, 9 | Fri 1/11
|
Reading 2.2 |
Read Section 2.2. You don't have to write a summary. Instead, answer these questions. | Mon 1/14 |
Reading 2.3 |
Read Section 2.3. You don't have to write a summary. Instead, answer these questions | Thu 1/17 |
Hwk #2
|
2.1 #5, 8, 9; 2.2 #2, 3 (no proof required), 4a, 5, 6b | Fri 1/18
|
Reading 2.4 |
Read Section 2.4. You don't have to write a summary. Instead, answer these questions | Mon 1/21 |
Reading 3.1 |
Read Section 3.1 and answer these questions. | Thu 1/24 |
Reading 3.2 |
Read Section 3.2 and answer these questions. | Fri 1/25 |
Hwk #3 |
2.3 #1a-f, 2, 4, 5, 9; 2.4 #1, 2, 4, 7 | Fri 1/25 |
Reading 3.4 |
Read Section 3.4 and answer these questions. | Thu 1/31 |
Hwk #4 |
3.1 #1, 2, 5, 6, 9b, 10; 3.2 #4, 5, 6, 9 | Fri 2/1 |
Reading 4.1 |
Read Section 4.1 and answer these questions. | Mon 2/4 |
Reading 4.2 |
Read Section 4.2 <nothing to turn in> | Thu 2/7 |
Hwk #5 |
3.4 #4, 5, 8; 4.1 #1, 3, 5, 6, 7, 8a; Optional Extra Credit: 3.4 #10b | Mon 2/11 |
Reading 4.4 |
Read Section 4.4 and answer these questions. | Thu 2/14 |
Reading 5.1 |
Read Section 5.1 and answer these questions. | Fri 2/15 |
Reading 5.2 |
Read Section 5.2 and answer these questions. | Thu 2/21 |
Reading 5.5 |
Read Section 5.5 <nothing to turn in> | Fri 2/22 |
Hwk #6 |
4.2 #1, 8; 4.4 #1, 4, 5; 5.1 #3, 4 (follow Figure 5.4) | Fri 2/22 |
Reading 6.1 |
Read Section 6.1 and answer these questions. | Mon 3/4 |
Reading 6.4 |
Read Section 6.4 and answer these questions. | Thu 3/7 |
Hwk #7 |
5.2 #2, 6, 7; 5.5 #1, 3, 4, 6; 6.1 #1, 2, 3, 6 | Fri 3/8 |
Reading 7.3 |
Read Section 7.3 and answer these questions. | Mon 3/11 |
Reading 8.1 |
Read Section 8.1 and answer these questions. | Thu 3/14 |
Reading 9.1 |
Read Section 9.1 and answer these questions. | Fri 3/15 |
Hwk #8 |
6.4 #1, 2, 3, 5, 7, 8; 7.3 #1 (assume insertion at the head of each list), 2, 7, 8 |
Fri 3/15 |
Reading 9.2 |
Read Section 9.2 and answer these qusetions. | Mon 3/18 |
Reading 9.3 |
Read Section 9.3 <no questions > | Thu 3/21 |
Hwk #9 |
8.1 #2a, 4, 5a; 9.1 #1, 7b (START with vertex c. Show all work!) 9.2 #1 (Show all work!); 2 (explain!) |
Fri 3/22 |
Reading 11.1 |
Read Section 11.1 <questions to answer > | Mon 3/25 |
Reading 11.2 |
Read Section 11.2 <questions to answer > | Mon 4/1 |
Reading 11.3 |
Read Section 11.3 < no questions > | Thu 4/4 |
Hwk #10 |
9.3 #1b (efficiently!), 2a (show in full detail as on p.325, including a list of the shortest paths), 4ab (justify); 11.1 #3ab (explain); 11.2 #2abc, 4; write Java code for #4 |
Fri 4/5 |
| Tentative Schedule for Winter 2013 | |||
| Note: Reading notes are due for each reading assignment at the beginning of class. | |||
| Week | Day | Reading Assignment | Homework |
| 1 | M 1/7 | No Assignment -- will discuss 1.1 - 1.3 in class | |
| W | Read 1.4: Fundamental Data Structures | ||
| R | Read 2.1: Analysis Framework | ||
| F | Lab: Java Crash Course | hw due 1.1 - 1.4 | |
| 2 | M 1/14 | Read 2.2: Asymptotic Notations | |
| W | Lab: Quadratic Class | ||
| R | Read 2.3: Mathematical Analysis of Non-Recursive Alg. | ||
| F | Lab: Quadratic Class, continued | hw due 2.1, 2.2 | |
| 3 | M 1/21 | Read 2.4: Mathematical Analysis of Recursive Alg. | |
| W | Lab: Anagram Checker | ||
| R | Read 3.1: Selection Sort and Bubble Sort | ||
| F | Read 3.2: Sequential Search | hw due 2.3, 2.4 | |
| 4 | M 1/28 | No Assignment -- review for exam 1 | |
| W | Exam 1, Thru 2.3 | ||
| R | Read 3.4: Exhaustive Search | ||
| F | Lab: Selection Sort | hw due 3.1, 3.2 | |
| 5 | M 2/4 | Read 4.1: Mergesort | |
| W | Lab: Mergesort | ||
| R | More on Mergesort | ||
| F | Lab: Mergesort | ||
| 6 | M 2/11 | Read 4.2: Quicksort | hw due 3.4, 4.1 |
| W | Lab: Quicksort | ||
| R | Read 4.4: Binary Tree Traversals | ||
| F | Read 5.1: Insertion Sort | ||
| 7 | M 2/18 | No Assignment -- review for exam 2 | |
| W | Exam 2, Thru Section 4.1 | ||
| R | Read 5.2: Depth-first and Breadth-first Search | ||
| F | Read 5.5: Decrease-by-a-Constant-Factor | hw due 4.2, 4.4, 5.1 | |
| 8 | M 3/4 | Read 6.1: Presorting | |
| W | Lab: Binary Trees | ||
| R | Read 6.4: Heaps and Heapsort | ||
| F | Lab: Binary Trees, cont. | hw due 5.2, 5.5, 6.1 | |
| 9 | M 3/11 | Read 7.3: Hashing | |
| W | Lab: Heaps | ||
| R | Read 8.1: Computing a Binomial Coefficient | ||
| F | Read 9.1: Prim's Algorithm | hw due 6.4, 7.3 | |
| 10 | M 3/18 | Read 9.2: Kruskal's Algorithm | |
| W | Lab: Hashing | ||
| R | Read 9.3: Djikstra's Algorithm | ||
| F | *** no class *** | ||
| 11 | M 3/25 | Read 11.1: Lower-Bound Arguments | hw due 8.1, 9.1, 9.2 |
| W | Lab: Hashing, cont. | ||
| R | No Assignment -- review for exam 3 | ||
| F | Exam 3, thru Chapter 8 | ||
| 12 | M 4/1 | Read 11.2: Decision Trees | |
| W | Lab: Graphs | ||
| R | Read 11.3: P, NP, and NP-complete Problems | ||
| F | Lab: Graphs | hw due 9.3, 11.1, 11.2 | |
| 13 | M 4/8 | No assignment -- catch up day or lab | |
| W | Lab: Graphs | ||
| R | No assignment -- review | ||
| F | No assignment -- review | ||
| 14 | exam week | Final Exam | |