COMP 172: Discrete Structures, Spring 2016

Administrivia

Resources

Schedule

Date Topic Required Reading Notes Assignments Out Slides
1/13 Propositions, truth tables 2.1
1/15 Conditional statements 2.2 Homework 1, due 1/25
1/18 MLK Day
1/20 Valid and invalid arguments 2.3
1/22 Snow day
1/25 Propositional logic proofs Homework 2, due 1/29
1/27 Conditional worlds Read two articles above
1/29 More conditional worlds, practice Homework 3, due 2/3
2/1 Quantifiers 3.1
2/3 Negations of quantified statements 3.2
2/5 Multiple quantifiers 3.3 Homework 4, due 2/10
2/8 Rules of inference for quantified statements 3.4
2/10 Proofs with quantified statements
2/12 Language of informal proofs, even and odd 4.1 Homework 5, due 2/17
2/15 More proofs with even and odd
2/17 Definitions of rational and divides 4.2, 4.3
2/19 More divides, unique prime factorization theorem 4.3 Homework 6, due 2/24
2/22 Quotient-remainder theorem 4.4
2/24 Proof by contradiction and contraposition 4.5
2/26 Chapter 4 wrapup; review 4.6
2/29 Sequences and series 5.1
3/2 Induction I 5.2 Homework 7, due 3/16
3/4 (Prof away at conference)
3/7 Spring break
3/9 Spring break
3/11 Spring break
3/14 Induction II 5.3
3/16 Strong induction I 5.4
3/18 Strong induction II 5.5
3/21 Induction practice Homework 8, due 3/28
3/23 Sets I 6.1
3/25 Easter break
3/28 Sets II 6.2
3/30 Sets III 6.3
4/1 Sets catchup Homework 9, due 4/6
4/4 Functions 7.1
4/6 1-1 and onto 7.2
4/8 Function composition 7.3
4/11 Catchup and test review
4/13 Intro to counting and probability 9.1
4/15 Multiplication rule 9.2
4/18 Addition rule 9.3 Homework 10, due 4/22
4/20 Combinations 9.5
4/22 Finish combinations, start pigeonhole principle 9.4
4/25 Finish pigeonhole principle Homework 11, due 4/29 at 5pm
4/27 Relations 8.1-8.3
4/29 URCAS