Schedule

This schedule is subjected to change as the term progresses.

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

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