CS311H Discrete Mathematics for Computer Science
Readings and Videos
Readings and videos assignments should be completed before the
corresponding class meeting.
Tuesday, August 25
Introduction to CS311H
Readings
Videos
↑ Back to top
Thursday, August 27
Propositional Logic
Readings
- Rosen Ch 1 Sections 1.1, 1.2
Videos
Postcondition
For each of the following Logical Operators: not, and, or, implies,
biconditional, you must know
- the symbols
- the different ways these operators show up in the English language
- the truth tables
- operator precedence
↑ Back to top
Tuesday, September 1
Propositional Logic and Proofs
Readings
- Rosen Ch 1 Sections 1.6.1 through 1.6.6
Videos
Postcondition
After the readings/videos, you must know how to
- Prove a theorem using truth tables.
- Prove a theorem using equivalence-style proof.
- Prove a theorem using the rules of inference.
- operator precedence
↑ Back to top
Thursday, September 3
First-Order Logic
Readings
- Rosen Ch 1 Sections 1.4 and 1.5
Videos
↑ Back to top
Tuesday, September 8
First-Order Logic Proofs
For this lecture, please go through both readings and videos. The videos
talk about some nuances of quantifiers.
Readings
Videos
Postcondition
After doing the readings and watching the videos, you must know
- when the order of nested quantifiers matter.
- why the order of nested quantifiers matter.
- how to use universal instatiation and generalization.
- how to use existential instatiation and generalization.
- how to use instantiate and generalize nested quantifiers.
↑ Back to top
Thursday, September 10
Proof Methods and Techniques
There are no videos for this day, just readings.
Readings
Videos
Postcondition
No list of postconditions. Read the chapter.
↑ Back to top
Tuesday, September 15
Proof Methods and Techniques (contd.)
Readings
Videos
Postcondition
After doing either of the readings, you must know
- Develop a proof using indirect proof techniques such as proof by
contrapositive and proof by contradiction.
- Recognize and develop a proof for theorems that are biconditional in
nature.
- Recognize and develop a constructive existence proof.
- Recognize a non-constructive existence proof.
- Recognize and develop a uniqueness proof.
↑ Back to top
Thursday, September 17
Number Theory
Readings
Videos
↑ Back to top
Tuesday, September 22
Sets
Readings
- Rosen Ch 2 Sections 2.1 and 2.2
Videos
Postcondition
After doing the readings or watching the videos, you must be able to
-
Identify sets.
-
Represent sets in roster and set-builder form and convert between the two.
-
Given specific sets, identify if a set is a subset (or proper subset) of another set.
-
Differentiate the difference between a subset and proper subset.
-
List the elements in the intersection of sets, union of sets, difference of sets, and the complement of a set.
-
Construct a power set of a set.
↑ Back to top
Thursday, October 8
Cardinality of Sets
Readings
Videos
↑ Back to top
Tuesday, October 13
Recursively-defined Sets/Functions
Readings
Videos
↑ Back to top
Thursday, October 15
Principle of Mathematical Induction
Readings
Videos
↑ Back to top
Tuesday, October 20
Strong Induction
Readings
Videos
↑ Back to top
Thursday, October 22
Structural Induction
Readings
Videos
↑ Back to top
Tuesday, November 3
Introduction to Graphs
Readings
Videos
↑ Back to top
Tuesday, November 10
Connectivity and Paths
Readings
Videos
↑ Back to top
Thursday, November 12
Euler and Hamilton Circuits; Trees
Readings
Videos
↑ Back to top
Tuesday, November 17
Planar Graphs; Euler's Formula
Readings
Videos
↑ Back to top
Thursday, November 19
Graph Coloring
Readings
Videos
↑ Back to top
Tuesday, December 1
Algorithm Complexity; Solving Recurrences
Readings
Videos
↑ Back to top
Thursday, December 3
Program Correctness
Readings
Videos
↑ Back to top