Discrete Structures
Lecture videos
Math 221, Warford
Math 221, Cupp
Lecture 1:
Mathematical Induction, Inequalities
Lecture 2:
Informal Proofs, Inductive Definitions
Lecture 3:
The Fibonacci Numbers
Lecture 4:
Binary Trees, Formal Specifications
Lecture 5:
Formal Specifications, Rigid Variables
Lecture 6:
Formal Specifications, Arrays
Lecture 7:
A Theory of Programs
Lecture 8:
Guarded Command Language (GCL)
Lecture 9:
The Assignment Statement
Lecture 10:
Program Correctness, Program Derivation
Lecture 11:
Program Derivation, Invariants
Lecture 12:
The Alternative Statement
Lecture 13:
The Alternative Statement, Review
Lecture 14:
Review
Lecture 15:
The Correctness of Loops I
Lecture 16:
The Correctness of Loops II
Lecture 17:
Relations
Lecture 18:
Operations on Relations
Lecture 19:
Relation Product
Lecture 20:
Classes of Relations, Closure
Lecture 21:
Closure, Equivalence Relations
Lecture 22:
Equivalence Relations, Partitions
Lecture 23:
Functions
Lecture 24:
Inverse Functions
Lecture 25:
Review
Lecture 26:
Order Relations
Lecture 27:
More on Posets
Lecture 28:
Relational Databases
Lecture 29:
Growth of Functions
Lecture 30:
Growth of Functions, Min & Max
Lecture 31:
A Theory of Integers
Lecture 32:
Division, GCD, LCM
Lecture 33:
Euclid's Algorithm
Lecture 34:
Rules of Counting
Lecture 35:
Combinatorics, Graphs
Lecture 36:
Paths and Circuits
Lecture 37:
Euler and Hamiltonian Circuits, Dijkstra's Shortest-Path Algorithm
Lecture 38:
Review I
Lecture 39:
Review II