CS295 - Discrete Structures
Fall 2008 Lectures
Loyola College >
Department of Computer Science >
CS 295 >
Lecture Notes
Lecture 1: Symbolic Logic
Lecture 2: Conditional Statements
Lecture 3: Arguments
Lecture 4: Predicate Calculus
Lecture 5: Predicate Calculus (con't)
Lecture 6: Sequences and Series
Lecture 7: Mathematical Induction
Lecture 8: Proving Loop Invarients
Lecture 9: Sets
Lecture 10: Properties of Sets
Lecture 11: Sets and Boolean Algebras
Lecture 12: Paradoxes
Lecture 13: Simple Probability
Lecture 14: More Probability
Lecture 15: Functions
Lecture 16: More on Functions
Lecture 17: Sizes of Sets
Lecture 18: Finite State Automata
Lecture 19: NFAs and DFAs
Lecture 20: Recurrence Relations
Lecture 21: 2nd-Order Linear Homgenous Recurrence Relations with Constant Coefficients
Lecture 22: SOLHrrCC con't
Lecture 23: Time Effiency of Algorithms
Lecture 24: Proving a Function is O(g(x))
Lecture 25: Time Effiency of Algorithms (con't)
Lecture 26: Graph Theory (updated: 12/4/08)
Lecture 27: Graph Theory (con't)