CMPS2120 "Discrete Structures" 
Spring 2017 #32665 
syllabus  textbook  notes  scores  

Week  Topic  Readings  Assignments 
1 
propositional logic & logical connectives truth tables & logical equivalences converse, inverse, contrapositive normal forms (conjunctive and disjunctive) 
Chapter 1 notes 
hw1 quiz1 
2 
predicate logic with quantifiers single and nested quantifiers predicate logic operations 
Chapt 1.4 
hw2 quiz2 
3 
inference rules to analyze arguments syllogisms and fallacies 
Chapt 1.6 
quiz3 
4 
the structure of formal proofs proof by direct, counter example proof by contradiction, cases 
Chapt 1.7 
hw4 quiz4 
5 
sets and the power set Venn diagrams and tables, Cartesian product set operations complement, union, intersection, difference cardinality and countability 
Chapter 2 
hw5 Quiz5 
6 
functions surjection, injection, inverse, composition sequences & summations 
Chapter 2.3 
Quiz6 scores answers hw6 
7 
algorithms and algorithm analysis function growth & bigoh notation 
Chapter 3 
hw7 quiz7 scores 
8 
integer division, modulo primes and greatest common divisor 
Chapter4  hw8 
9 
positional number systems binary, octal, hexadecimal conversions & operations 
Chapter4 notes1 notes2 

10 
Standard, strong, structural induction Proving recursive algorithms by induction 
Chapter5 notes 
hw10 quiz10 
11 
Basic combinatorics Sum and product rule, rule of falling powers Inclusion/exclusion and pigeonhole principles Permutations and combinations Binomial coefficients and Pascal's triangle 
Chapter6 notes 
hw11 quiz11 scores quiz11 retry 
12 
Introduction to discrete probability Complements and unions of events 
Chapter7 
retry quiz11 homework12 quiz12 
13 
Properties of relations Reflexivity, symmetry, transitivity Relation composition 
Chapter9 

14 
Recursive definitions Solving recurrence relations 

15 
Zerobased counting systems Boolean circuits 

Final Exam: Friday May 12, 2:00pm  4:30pm 