EECS 203 Spring 2016 Schedule
Week Day
Tuesday
Wednesday
Thursday
Tuesday
Wednesday
Thursday
Tuesday
Wednesday
Thursday
Tuesday
Wednesday
Thursday
Tuesday
Wednesday
Thursday
Tuesday
Wednesday
Thursday
Tuesday
Wednesday
Thursday
Thursday
1
2
3
4
5
6
7
Date
May 3
May 4
May 5
May 10
May 11
May 12
May 17
May 18
May 19
May 24
May 25
May 26
May 31
Jun 1
Jun 2
Jun 7
Jun 8
Jun 9
Jun 14
Jun 15
Jun 16
Jun 23
Topic
Introduction; Propositional Logic and it's Applications
Propositional Equivalences; Predicates and Quantifiers
Nested Quantifiers; Start on Proof Techniques
Proof Methods and Strategies
Sets and Set Operations; Start Functions
Finish Functions; Sequences and Summations
Sequences, Cardinality of Infinate Sets
Algorithms and Growth of Functions
Start on Number theory
More number theory
Mathematical Induction
Cryptography
MIDTERM (Covers Chapters 1, 2, 3, 4, 5.1-5.2)
Strong Induction, Counting
Permutations and Combinations; Binomial Coefficients
Generalized Permutations and Combinations
Discrete Probability and Beyes's Theorem
Recurance Relations
Divide-and-comquer Algorithims; Relations
Representing Relations
Graphs and Connectivity
No early finals will be given.
Reading
1.1, 1.2
1.3, 1.4
1.5, 1.6
1.7, 1.8
2.1-2.3
2.3-2.5
3.1-3.3
3.1-3.3
4.1-4.3
4.3-4.5
5.1-5.2
4.5-4.6
HW/Quiz
HW1
GA1
Quiz1
HW2
GA2
Quiz2
HW3
GA3
Quiz3
HW4
Midterm
5.2,6.1-6.3 GA4
6.3, 6.4
HW5
6.5, 6.6
GA5
7.1-7.3
Quiz4
8.1-8.2
HW6
8.3, 9.1
GA6
9.3, 9.5
Quiz5
10.1-10.3 HW7
4-6pm
Final
Warning: This is a rough guess about the amount of time we will spend on various topics. Homeworks, quizzes,
and exams will be as listed above, but readings and exact topics should be taken with a grain of salt.