Schedule

This schedule is subjected to change as the term progresses.

Week	Dates	Chapter	Topic	Homework and Quizzes
1	8/26 (T) 8/28 (R)	Ch. 0 Ch. 1.1-1.4	Introduction Textual substitution, Equality
2	9/2 9/4	Ch. 1.5 - 1.6 Ch. 2, 3.1	Leibniz' rule Boolean expressions	Homework 1 Due
3	9/9 9/11	Ch. 3.2 - 3.3	Equivalence, Negation, Inequivalence	Homework 2 Due
4	9/16 9/18 9/21	Ch. 3.4 Ch. 3.5	Disjunction Conjunction	Homework 3 Due
5	9/22 (M) 9/23 9/25	Ch. 3.6	Implication	Quiz 1 - 3:30-5:00pm, Swords 333 Homework 4 Due
6	9/30 10/2	Ch. 4.1	Proving Implications	Homework 5 Due
7	10/7 10/9	Ch. 4.2 Ch. 5.1	More Proof Techniques Propositional Calculus for Logic Problems
8	10/14 10/16		Fall Break
9	10/21 10/23	Ch. 5.1 Ch. 5.2	Word Problems Combinational Digital Circuits	Homework 6 Due
10	10/28 10/29 (W) 10/30	Ch. 8.1 - 8.2 Ch. 8.3 - 8.4	Types, Predicates, Quantifiers: Existential and Universal Series Sums, Rules for Summations	Quiz 2 - 3:30-5:00pm, Swords 333
11	11/4 11/6	Ch. 9.1 - 9.2 Ch. 9.3	Introduction to Predicate Calculus English to Predicate Logic	Homework 7 Due
12	11/11 11/13	Ch. 11.1 - 11.3 Ch. 14.1 - 14.3	Sets and Set Operation Relations and Fucntions	Homework 8 Due
13	11/18 11/20	Ch. 16.1 Ch. 16.2	Counting 1 Counting 2	Homework 9 Due
14	11/25 11/27	Ch. 16.3	Counting 3 Thanksgiving Break	Quiz 3 - 3:30-5:00pm, Swords 333
15	12/2 12/4 12/5	Ch. 17.1 - 17.2	Recurrence Relations Final Exam Review Last day of Class	Homework 10 Due
Final Exam - Dec. 13th and 8:30am - 10:30am, Swords 328

Ting Gu--tgu@holycross.edu
Computer Science 135--Discrete Structures