| Chapter 19, sections 3 and 4 (Strip Patterns). |
|
|
Quiz 10 |
Chapter 19, section 3 (Strip Patterns). Click here for a great worksheet about strip patterns, with the exact same examples we're following in class. |
|
| Chapter 19, section 3 (Rosette Patterns). |
|
|
| Chapter 19, sections 1 and 2 (Golden Rectangles and Spirals, Symmetry and Preserving the Pattern). |
|
|
Quiz 9 |
Chapter 19, section 1 (The Golden Ratio) |
|
| Chapter 19, section 1 (Spirals, Phyllotaxis, Fibonacci Numbers) |
|
|
| Chapter 16, section 4 (Soundex, Birth Date) |
|
|
Quiz 8 |
Chapter 16, sections 3 an 4 (Postnet Code, Soundex Algorithm) |
|
| Chapter 16, sections 1, 2 and 3 (ISBN examples, the ZIP code and the Postnet code). |
|
|
| Chapter 16, section 1 (UPC, Bank Routing Numbers, Codabar, ISBN). |
|
|
| Review session for the second exam. We also talked about Chapter 16, section 1 (Plane Tickets, Car Rentals and UPS and FedEx Parcels... all the same scheme). |
|
|
| Chapter 16, section 1 (Money Orders, Travelers Checks). Note: This material will not be tested in the second exam. |
|
|
Quiz 7 |
Chapter 9, section 4 (Approval Voting). |
|
| Chapter 9, sections 2 and 3 (Pareto Condition, Arrow's Impossibility). |
|
|
| Chapter 9, section 2 (Monotonicity, Hare System). |
|
|
Quiz 6 |
Chapter 9, section 2 (IIA, Sequential Pairwise Voting) |
|
| Chapter 9, section 2 (CWC, Borda Count). |
|
|
| Chapter 9, sections 1 and 2 (Plurality Voting). |
|
|
Quiz 5 |
Chapter 3, section 5 (Colorings and Chromatic number). |
|
| Chapter 3, sections 4 and 5 (Conflict Graphs and Coloring). |
|
|
| Chapter 3, section 4 (Bin Packing Heuristics). |
|
|
| Review Session for the first exam. We also started to talk about Chapter 3, section 4 (Bin Packing). | ||
| Chapter 3, section 3 (Decreasing-Time-List Algorithm). |
|
|
Quiz 4 |
Chapter 3, section 2 and 3 (Independent Tasks). |
|
| Chapter 3, section 2 (Critical-Path Scheduling). |
|
|
| Chapter 3, section 1 (List Processing Algorithm). |
|
|
Quiz 3 |
Chapter 3, section 1 (Scheduling Tasks: Assumptions and Goals). |
|
| Chapter 2, section 4 (Critical Path Analysis). |
|
|
| Chapter 2, section 3. |
|
|
Quiz 2 |
Chapter 2, section 3 (Minimum Cost Spanning Trees). |
|
| Chapter 2, sections 2 and 3 (Nearest-Neighbor and Sorted-Edges). |
|
|
Quiz 1 |
Chapter 2, section 1 (The Fundamental Principle of Counting). |
|
| Chapter 2, section 1. |
|
|
| Chapter 1, sections 3 and 4. |
|
|
| Chapter 1, sections 1 and 2. |
|
|
| First day of classes. The syllabus was handed out. | . | |
| Exercises from Chapter 19: 20, 26, 28. | |||
| Exercises from Chapter 16: 48a, 49a (These two problems will be worth 5 points each: 2 for trying + 3 for doing it right), 66, 68, and determine the Soundex codes for Urlacher and Berrian (show each step, 5 points each name). | |||
| Exercises from Chapter 16: 1, 5, 8, 14 (These problems will be worth only 5 points each: 2 for trying + 3 for doing it right). | |||
| Writing Project. See the description here. You have two weeks to do this, but it's important that in the meantime you work on the practice problems to prepare yourself for the second exam. | |||
| Exercises from Chapter 3: Use NFD, FFD and WFD for #46, 63c, 70. | |||
| Exercises from Chapter 3: 36a, b, c, 38. | |||
| Exercises from Chapter 3: 4a, b, c, (do part d for extra credit!), 9, 26, 34. | |||
| Exercises from Chapter 2: 54, 55 (explain your answer in full detail), 68. | |||
| Exercises from Chapter 2: 6, 10, 24, 42c. | |||
| Exercises from Chapter 1: 21, 22, 34, 38, 50. | |||