Math 252
Discrete Mathematics for Computer Science
Spring 2019


[Webwork] [From Class] [Calendar] [Test Info] [Homework]

Mon Tue Wed Thu Fri
1/28


Snow Day
No Class


1/29




1/30


Snow Day
No Class


1/31




2/1
Graphs and Models
Rosen 10.1-10.2


2/4
Graphs
Rosen 10.1-10.2


2/5




2/6
Graph Representations
Graph Isomorphisms

Rosen 10.3


2/7




2/8
Paths in Graphs
Rosen 10.4-5


2/11
Euler Paths and Cycles
Euler’s Formula

Rosen 10.4-5


2/12




2/13
Planer Graphs
Rosen 10.7


2/14




2/15
Bipartite Graphs



2/18
Non-Planar Graphs



2/19




2/20
Graphs Wrap-Up



2/21




2/22
Basic Counting
Rosen 6.1


2/25
Basic Counting
Pigeonhole Principle

Rosen 6.1
Rosen 6.2



2/26




2/27
Permutations and Combinations
Rosen 6.3


2/28




3/1
Intro to Probability
Rosen 7.1, 7.2


3/4
Using Probability Rules



3/5




3/6
Test 1



3/7




3/8
More Probability
Rosen 7.1, 7.2


3/11
Condiditional Probability
Rosen 7.2


3/12




3/13
Bayes Theorem
Rosen 7.3


3/14




3/15
Conditional Probability
Random Variables




3/18


Spring Break

3/19


Spring Break

3/20


Spring Break

3/21


Spring Break

3/22


Spring Break

3/25
Random Variables
Binomial Distributions




3/26




3/27
Expected Value
Rosen 7.4


3/28




3/29
Grammars and Languages



4/1
NFA and DFA



4/2




4/3
Test 2



4/4




4/5
NFA and DFA



4/8
Regular Langauges



4/9


Advising
No Class


4/10


Advising
No Class


4/11




4/12
Regular Languages



4/15
Regular Expressions in Python



4/16




4/17
A language that isn’t regular



4/18




4/19


Good Friday
No Class


4/22


Easter Monday
No Class


4/23




4/24
Turing Machines



4/25




4/26
Turing Machines



4/29
Turing Machines



4/30




5/1
Turing Machine Variants
Halting Problem




5/2




5/3




5/6




5/7




5/8




5/9


Friday Class Schedule

5/10


Reading Recess

5/13




5/14




5/15
Final Exam B
1:30 pm




5/16
Final Exam A
9am