## MATH130: Schedule and Homework

Syllabus | Schedule and Homework
Below is a tentative schedule listing homework assignments and indicating what sections of the text will be covered on what dates. Quizzes and in-class assignments may also be linked to this schedule.
This page may be revised as the semester progresses.

 Date Material Covered 9/5 1.1: Propositions and Truth Tables 9/10, 9/12 11.1: Binary Circuits 1.2:  If/Then and Logical Equivalence 1.3:  Propositional Functions and Quantifiers (∀, ∃) 1.5:  Arguments, Methods of Proof 9/17, 9/19 Assignment 1 due 9/17 1.7:  Induction Senior Convocation 9/19 9/24, 9/26 Assignment 2 due 9/24 1.7, 2.1:  Basic Set Operations 10/1, 10/3 Quiz 1, 10/1 2.2:  Functions:  Floor, Ceiling, Modulus 10/8, 10/10 Columbus Day, 10/8 2.3:  Sequences and Strings; ∑, ∏ Assignment 3 due 10/10 10/15, 10/17 Quiz 2, 10/15 3.1, 3.2, 3.3:  Relations and Equivalence Relations Powerpoint Review of Chapter 3 5.1:  Primes and Divisors 10/22, 10/24 Assignment 4 due 10/22 Review of Sample Midterm Midterm, 10/24 10/29, 10/31 5.2:  Binary and Hexadecimal numbers; Algorithms (Color code test page) 5.3:  The Euclidean Algorithm 11/5, 11/7 Assignment 5 due 11/5 5.4: RSA Public-Key Encryption -- some examples 6.1: Counting: Multiplication and Addition Principles 11/12, 11/14 Veteran's Day, 11/12 Quiz 3, 11/14 11/19, 11/21 Assignment 6 due 11/121 6.2, 6.6: Permutations and Combinations 11/26, 11/28 6.8: The Pigeonhole Principle 8.1:  Graphs 12/3, 12/5 Assignment 7 due 12/3 Quiz 4, 12/5 Course evaluations, 12/5 8.2:  Paths and Cycles 8.3:  Hamiltonian Cycles and the Traveling Salesman 8.4:  Dijkstra's Algorithm (Shortest Path) 12/10, 12/12 Assignment 8 due 12/10 9.1-9.3:  Trees and Spanning Trees 9.4:  Minimal Spanning Trees -- Prim's Algorithm Review for Final Sample Final 12/19 Final Exam, 11:00-1:00

MATH130