Day | Date | Activity | Assignment (due one week from assignment date, unless otherwise stated) | |
Tue | 1/18 | Welcome, Masked Students! | Read Section 1.1 (Statements, Symbolic Representations, and Tautologies), while working on highlight worksheet 1.1 as you go along. Homework: p. 16--, #2, 9, 11(d,e), 15(c,d,e), 17(b,c), 19, 23, 41(a,c), 47, 48, 49, 57 (due 1/26, midnight -- submit as a single pdf on Canvas.) | |
Thu | 1/20 | Section 1.1 | Read Section 1.2 (Propositional Logic), while working on highlight worksheet 1.2 as you go along. Homework problems, p. 35--, #6, 11, 12, 15, 18, 20, 27, 35, 37, 44, 45, 49, 55, 56 (use statement letters I, K, J, O, H). (Due Monday, 1/31, at midnight.) | |
Tue | 1/25 | Section 1.2 | Read Section 1.3 (Quantifiers, Predicates, and Validity), while working on highlight worksheet 1.3 as you go along. Homework problems, p. 50--, #1, 5, 8, 9(a,b), 13(b,f,j), 17, 21(a,f), 22(a-d), 25(a-d), 27(a,b), 24(a-c), 34(a,c), 36(a,c) (due Wednesday, 2/2, at midnight.) | |
Thu | 1/27 | Section 1.3 | Read Section 1.4 (Predicate Logic), while working on highlight worksheet 1.4 as you go along. Homework problems, p. 69--, #7, 9, 10, 13, 15, 18, 22, 23, 26, 28, 31, 34, 42 (due Wednesday, 2/9, at midnight) | |
Tue | 2/1 | Section 1.4 | Read Section 2.1 (Proof Techniques), while working on highlight worksheet 2.1 as you go along. Homework problems, p. 107--, #4, 10, 15, 19, 20, 32, 44, 61, 66, 71, 74 (due Monday, 2/14, at midnight) | |
Thu | 2/3 | Snow Day -- school closed |   | |
Tue | 2/8 | Section 2.1 | Read Section 2.2 (Induction), while working on highlight worksheet 2.2 as you go along. Homework problems, pp. 123--, 4, 7, 16, 22, 27, 28, 31, 32, 41, 50, 61, 55, 56 (due Wednesday, 2/23, at midnight) | |
Thu | 2/10 | Section 2.2 | Prepare for exam.... | |
Tue | 2/15 | Review |   | |
Thu | 2/17 | Exam 1 | Read Section 3.1 (Recursive Definitions), while working on highlight worksheet 3.1 as you go along. Homework problems, pp. 171--, #1, 3, 6, 16, 18, 21, 24, 26, 42, 50, 58 (due Monday, 2/28) | |
Tue | 2/22 | Section 3.1 | Read Section 3.2 (Recurrence Relations), while working on highlight worksheet 3.2 as you go along. Homework problems, pp. 197--, #1, 6, 12, 15, 21, 23, 24, 41, 48 (due Monday, 3/14) | |
Thu | 2/24 | Section 3.2 | Please read Section 3.3 (Analysis of Algorithms), while working on highlight worksheet
3.3 as you go along. Homework problems, pp. 214--, #9, 10, 13, 14, 38, 40 (due Wednesday, 3/16)
If you need to revise your project (or if, for any reason, you have not received approval for your project), please resubmit on Canvas. |
|
Tue | 3/1 | Section 3.3 |   | |
Thu | 3/3 | Section 3.3, encore: the Euclidean Algorithm | Please read Section 4.1 (Sets), while working on the highlight worksheet. Homework problems, pp. 239--, #2, 4, 6, 8, 13, 18, 26, 29, 32, 33, 35 (due Monday, 3/21) | |
Tue | 3/8 | Spring Break | ||
Thu | 3/10 | Spring Break | ||
Tue | 3/15 | Section 4.1 | Project proposals are due. For next time, please read Section 6.1 (Graphs and Their Representations), while working on the highlight worksheet. Homework problems, pp. 498--, #3, 5, 8, 15, 16, 20, 24, 28, 41, 44, 55, 59, 64 (due Monday, 3/28 -- revised) | |
Thu | 3/17 | Section 6.1 | For next time, please read Section 6.2 (Trees and Their Representations), while working on the highlight worksheet. Homework problems, pp. 521, #2, 5, 8, 11, 12; 16, 17 (note the upshot of part b!), 18; 20, 23, 24; 29, 30; 34, 36; 55, 56 (due Wednesday, 3/30 -- revised) | |
Tue | 3/22 | Section 6.1, cont. |   | |
Thu | 3/24 | Section 6.2 | Please read Section 6.3 (Decision Trees), while working on the highlight worksheet. Homework problems, pp. 536--, #2, 4, 6, 8, 10, 12 (don't worry about capitalization), 16, 17, (due Monday, 4/4). | |
Tue | 3/29 | Section 6.3 | Please read Section 7.2 (Euler Paths and Hamiltonian Circuits), while working on the highlight worksheet. Homework problems, pp. 577--, #1-5, 9, 11, 16, 23, 24, 31, 33, 34 (due Monday, 4/11) | |
Thu | 3/31 | Section 7.2 |   | |
Tue | 4/5 | Review |   | |
Thu | 4/7 | Exam 2 | Please read Section 7.3 (Shortest Paths and Minimal Spanning Trees), while working on the highlight worksheet. Homework problems, pp. 591--, #1, 5, 10, 11, 14, 16, 17, 18, 21, 22, 27, 28 (due Wednesday, 4/20) | |
Tue | 4/12 | Section 7.3 | Please read Section 7.4 (Traversal Algorithms), while working on the highlight worksheet. Homework problems, pp. 604--, #2, 5, 9, 10, 12, 15, 19, 20, 29, 30, 36 (due Friday, 4/22) | |
Thu | 4/14 | Section 7.4 | Please read Section 8.1 (Boolean Algebra Structure), while working on the highlight worksheet. Homework problems, pp. 631--, #1, 3, 9(a,b,c), 10(a,c,d), 12, 15 (due Monday, 4/25) | |
Tue | 4/19 | Section 8.1 | Please read Section 8.2 (Logic Networks), while working on the highlight worksheet. Homework problems, pp. 655-, #1, 3, 4, 6, 8, 11, 14, 18, 22, 23, 29, 30, 33 (due Wednesday, 4/27) | |
Thu | 4/21 | Section 8.2 | Please read Section 8.3 (Minimization), while working on the highlight worksheet. Homework problems, pp. 678--, #2, 3, 6, 8, 9, 14, 17, 21, 22, 26, 28 (due Monday, 5/2) | |
Tue | 4/26 | Section 8.3 | Please read 9.3 (Finite State Machines), while working on the highlight worksheet. Homework problems: pp. 750--, #1, 2, 3, 6, 8, 11, 12, 14, 20 (due Wednesday, 5/4) | |
Thu | 4/28 | Section 9.3 |   | |
Tue | 5/3 | Section 9.3 | Homework: more 9.3 problems: pp. 750--, #22, 24, 25a, 26a, 26c, 27a, 28a, 34, 38, 46, 66 (draw the two state graphs -- new and improved), 68 (draw both graphs). This homework is optional, and due at the time of the final (it will replace a weaker one, if you choose to do it -- but it's good prep for the final). | |
Thu | 5/5 | Review |   | |
Tue | 5/10 | Rest |   | |
Thu | 5/12 | Final Exam (4:40-6:40) |   |