| Mon | Tue | Wed | Thu | Fri |
|---|---|---|---|---|
|
1/10 Graphs and Models Rosen 10.1-10.2 |
1/11 |
1/12 Graphs Rosen 10.1-10.2 |
1/13 |
1/14 Graph Representations Rosen 10.3 |
|
1/17 Graph Isomorphisms Graph Invariants Rosen 10.3 |
1/18 |
1/19 Paths in Graphs Rosen 10.4-5 |
1/20 |
1/21 Euler Paths and Cycles Euler’s Formula Connected Components Rosen 10.4-5 |
|
1/24 Bipartite Graphs Rosen 10.2 |
1/25 |
1/26 Planar and Non-planar Graphs Rosen 10.7 |
1/27 |
1/28 Graphs Wrap-Up |
|
1/31 Basic Counting Rosen 6.1 |
2/1 |
2/2 Basic Counting Pigeonhole Principle Rosen 6.1 Rosen 6.2 |
2/3 |
2/4 Division Principle Permutations and Combinations Rosen 6.3 |
|
2/7 Countint Wrap-Up Donut problems |
2/8 |
2/9 Test 1 |
2/10 |
2/11 Intro to Probability Rosen 7.1, 7.2 |
|
2/14 More Probability Rosen 7.1, 7.2 |
2/15 |
2/16 Conditional Probability Rosen 7.2 |
2/17 |
2/18 “Bayes Rule” Rosen 7.3 |
|
2/21 Random Variables Binomial Distributions |
2/22 |
2/23 Expected Value Rosen 7.4 |
2/24 |
2/25 E is Linear Rosen 6-7 |
|
2/28 Spring Break |
3/1 Spring Break |
3/2 Spring Break |
3/3 Spring Break |
3/4 Spring Break |
|
3/7 Probability Wrap-Up |
3/8 |
3/9 Grammars and Languages |
3/10 |
3/11 Types of Grammars |
|
3/14 Test 2 |
3/15 |
3/16 Automata |
3/17 |
3/18 Nondeterminsim |
|
3/21 Nondeterminsim |
3/22 Advising Day |
3/23 Advising Day |
3/24 |
3/25 DFA vs NFA Regular Expressions and Languages |
|
3/28 Regular Expression -> NFA |
3/29 |
3/30 Regular Grammars and Automata |
3/31 |
4/1 Regular Grammars and Automata |
|
4/4 DFA -> regex |
4/5 |
4/6 Turing Machines |
4/7 |
4/8 Turing Machines |
|
4/11 A language that isn’t regular |
4/12 |
4/13 Test 3 |
4/14 |
4/15 Good Friday No Classes |
|
4/18 Easter Monday No Classes |
4/19 |
4/20 Python Regular expressions |
4/21 Friday Class Schedule |
4/22 Study Day |
|
4/25 |
4/26 |
4/27 Final Exam @ 1:30 (Section B) |
4/28 Final Exam @ 9:00 (Section A) |