|
|
|
- Lecture slides will be posted the day before class.
- Inked slides (marked notes during
class) are available live and archived. Follow these instructions for
using the system. The password you need to add the "CSE 21 Summer II 2006"
classroom is "summer".
- Important note: don't count on those online inked slides
always being available: technical glitches can and do occur, so take notes
yourself during class.
- You are responsible for the contents covered:
- in lectures
- in the textbook chapter: 6, 8, 9, 11
The following schedule is an approximate plan and is subject to changes and updates:
|
Day
|
topic
|
Book chapter
|
|
Lecture 1, Aug 7, Mon
|
Counting:
Addition / multiplication rules, Inclusion /
exclusion
|
6.2, 6.3
|
|
Lecture 2, Aug 9, Wed
|
(quiz1) Combination / permutation, with repetition
|
6.2, 6.4, 6.5
|
|
Lecture 3, Aug 10, Thu
|
(quiz2) Permutation / Combination with repetition, Binomial theorem
|
6.5, 6.6, 6.7
|
|
Discussions
|
|
|
|
Lecture 4, Aug 14, Mon
|
(quiz3) Binomial theorem
|
6.6, 6.7
|
|
Lecture 5, Aug 16, Wed
|
(quiz4)Probability
|
6.1, 6.8
|
|
Lecture 6, Aug 17, Thu
|
(quiz5)Probability
|
6.9
|
|
Discussions
|
|
|
|
Lecture 7, Aug 21, Mon
|
(midterm1) Recursion
|
8.1
|
|
Lecture 8, Aug 23, Wed
|
(quiz6)
|
8.2, 8.3
|
|
Lecture 9, Aug 24, Thu
|
(quiz7)
|
8.4
|
|
Discussions
|
|
|
|
Lecture 10, Aug 28, Mon
|
(quiz8)Efficiency of algorithms
|
9.1, 9.2
|
|
Lecture 11, Aug 30, Wed
|
(quiz9)
|
9.3, 9.4, 9.5
|
|
Lecture 12, Aug 31, Thu
|
(midterm2)Graph Theory
|
11.1, 11.4
|
|
Discussions
|
|
|
|
No class Sep 4, Mon
|
|
|
|
Lecture 13, Sep 6, Wed
|
(quiz10)Graph theory
|
11.2
|
|
Lecture 14, Sep 7, Thu
|
(quiz11)Graph theory
|
11.5, 11.6
|
|
Discussions
|
|
|
|
Final, Sep 9, Sat
|
|
|
|