Fall 2017 CS220 (48876) Tu/Thurs Class Schedule
| Day |
Date |
Description |
Reading Assignment |
| Tuesday |
08/29/17 |
Introduction, Ch. 3.1 Algorithms |
Chapter 3.1
|
| Thursday |
08/31/17 |
3.2 Growth of Functions |
Chapter 3.2
|
| Tuesday |
09/05/17 |
3.3 Complexity of Algorithms |
Chapter 3.3 |
| Thursday |
09/07/17 |
3.3 Complexity of Algorithms |
Review the entire chapter for Quiz1
|
| Tuesday |
09/12/17 |
4.1 Divisibility and Modular Arithmetic, Quiz 1 |
Chapter 4.1 |
| Thursday |
09/14/17 |
4.2 Integer Representations and Algorithms |
Chapter 4.2
|
| Tuesday |
09/19/17 |
4.3 Primes and Greatest Common Divisors |
Chapter 4.3 |
| Tuesday |
09/26/16 |
4.4 Solving Congruences |
Chapter 4.4 and the previous sections for quiz 2. |
| Thursday |
09/28/17 |
Review for Midterm 1 and quiz |
Study for Midterm 1 |
| Tuesday |
10/03/17 |
Midterm 1 |
Study chapter 5, section 5.1 |
| Thursday |
10/05/17 |
5.1 Mathematical Induction |
Study Section 5.2 |
| Tuesday | >
10/10/17 |
5.2 Strong Induction |
Study Section 5.3 |
| Thursday |
10/12/17 |
5.3 Recursive Definitions and Structural Induction |
Study Section 5.3 |
| Tuesday |
10/17/17 |
5.3 Recursive Definitions and Structural Induction |
Section 5.4 |
| Thursday |
10/19/17 |
5.4 Recursive Algorithms |
section 5.4 |
| Tuesday | >
10/24/17 |
5.4 Recursive Algorithms, Merge Sort Algorithm |
Review Chapter 5 and prepare for your quiz 3 |
| Thursday |
10/26/17 |
8.1 Applications of Recurrence Relations and quiz 3 |
Study Sections 8.1 and 8.2 |
| Tuesday |
10/31/17 |
8.2 Solving Linear Homoheneous Recurrence Relations |
Study section 8.3 |
| Thursday |
11/02/17 |
8.3 Divide and Conquer Algorithms and Recurrence Relations |
Review all three sections and prepare for quiz 4 |
| Tuesday |
11/07/17 |
Review for Midterm 2 and quiz 4 |
Review all material we covered since midterm 1 for mideterm 2 |
| Thursday |
11/09/17 |
Midterm 2 |
Chapter 10, Section 10.1 |
| Tuesday |
11/14/17 |
10.1 Graphs and Grapgh Model |
Section 10.2 |
| Thursday |
11/16/17 |
10.2 Graph Terminology and Special Types of Grapghs |
Section 10.4 |
| Tuesday |
11/28/17 |
10.4 Connectivity |
Section 10.5 |
| Thursday |
11/30/17 |
10.5 Euler and Hamilton Paths |
Section 10.6 |
| Tuesday |
12/05/17 |
10.6 Shortest Path Problems |
Section 10.6
|
| Thursday |
12/07/17 |
10.6 Shortest-Path Problems |
Section 10.6
|
| Tuesday |
12/12/17 |
Review for Final Exam and Quiz 5 |
Study all the chapters we covered in the semester for the final exam.
|
| Tuesday |
12/19/17 |
Final Exam (11:00 am - 1:00 pm) |