CMPS-2120 "Discrete Structures" Spring 2017   #32665
```homework-13
```

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
quiz-1
2 predicate logic with quantifiers
single and nested quantifiers
predicate logic operations
Chapt 1.4
hw2
quiz-2
3 inference rules to analyze arguments
syllogisms and fallacies
Chapt 1.6
quiz-3
4 the structure of formal proofs
proof by direct, counter example
proof by contradiction, cases
Chapt 1.7
hw4
quiz-4
5 sets and the power set
Venn diagrams and tables, Cartesian product
set operations
complement, union, intersection, difference
cardinality and countability
Chapter 2
hw5
Quiz-5
6 functions
surjection, injection, inverse, composition
sequences & summations
Chapter 2.3 Quiz6 scores
hw6
7 algorithms and algorithm analysis
function growth & big-oh notation
Chapter 3 hw7
quiz-7
scores
8 integer division, modulo
primes and greatest common divisor
Chapter-4 hw8
9 positional number systems
conversions & operations
Chapter-4
notes1
notes2
10 Standard, strong, structural induction
Proving recursive algorithms by induction
Chapter-5
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
Chapter-6
notes
hw11
quiz-11 scores
quiz-11 retry
12 Introduction to discrete probability
Complements and unions of events
Chapter-7
retry quiz-11
homework-12
quiz-12
13 Properties of relations
Reflexivity, symmetry, transitivity
Relation composition
Chapter-9
14 Recursive definitions
Solving recurrence relations
15 Zero-based counting systems
Boolean circuits
Final Exam: Friday May 12, 2:00pm - 4:30pm