|
Week
|
Topics
|
Study Metarials
|
|
1
|
Mathematical induction and well-ordering
|
R1- Chapter: 5.1, 5.2
|
|
2
|
Recursive definitions
|
R1- Chapter: 5.3
|
|
3
|
Recursive algorithms
|
R1- Chapter: 5.4
|
|
4
|
Program correctness
|
R1- Chapter: 5.6
|
|
5
|
Applications of recurrence relations
|
R1- Chapter: 8.1
|
|
6
|
Solving linear recurrence relations
|
R1- Chapter: 8.2
|
|
7
|
Divide-and-conquer algorithms and recurrence relations
|
R1- Chapter: 8.3
|
|
8
|
Generating functions
|
R1- Chapter: 8.4
|
|
9
|
Inclusion?exclusion
|
R1- Chapter: 8.5
|
|
10
|
Applications of inclusion?exclusion
|
R1- Chapter: 8.6
|
|
11
|
Languages and grammars
|
R1- Chapter: 13.1
|
|
12
|
Finite-state machines with output
|
R1- Chapter: 13.2
|
|
13
|
Finite-State Machines with no output
|
R1- Chapter: 13.3
|
|
14
|
Language Recognition
|
R1- Chapter: 13.4
|