|
January 2011
Su Mo Tu We Th Fr Sa
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31
February 2011
Su Mo Tu We Th Fr Sa
1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28
March 2011
Su Mo Tu We Th Fr Sa
1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31
April 2011
Su Mo Tu We Th Fr Sa
1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
May 2011
Su Mo Tu We Th Fr Sa
1 2 3 4 5 6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31
|
|
CS 362 Spring 2011 Schedule - Ms. Katz
as of 1/18/2011 - tentative but test and exam dates firm
|
| Date |
Week |
Topic |
Reading |
| Jan 20 | 1 | Overview and Review | Preface through Chapter 1.3 |
| Jan 21 | | C++ vs. Java | Chapter 1.4 |
| |
| Jan 24 | 2 | C++ Parameter Passing | Chapter 1.5.2-1.5.6 (not pointers) |
| Jan 27 | | Big-3 Class Functions, ... | Chapter 1.5.5 |
| Jan 28 | | Templates and Separate Compilation | Chapter 1.6 and 1.7 |
| |
| Jan 31 | 3 | C++ Pointers | Chapter 1.5.1 |
| Feb 3 | | Linked Lists | Chapter 3.2.2 |
| Feb 4 | | Linked Lists | |
| |
| Feb 7 | 4 | Linked Lists | Chapter 3.2 |
| Feb 10 | | Software Development and Big-O | Chapter 2 |
| Feb 11 | | Big-O | |
| |
| Feb 14 | 5 | Algorithm Analysis | Chapter 2 |
| Feb 17 | | Algorithm Analysis | |
| Feb 18 | | Abstract Data Types | Chapter 3.1 |
| |
| Feb 21 | 6 | Test Review | |
| Feb 24 | | Test 1 - Chapters 1 through 3.2 |
| Feb 25 | | Stacks and Queues | Chapter 3.3 to 3.7 |
| |
| Feb 28 | 7 | Stacks and Queues | Chapter 3 |
| March 3 | | Trees | Chapter 4.1 |
| March 4 | | Binary Search Trees | Chapter 4.1 to 4.3 |
| |
| March 7-11 | | Spring Break - No Class | |
| |
| March 14 | 8 | Binary Search Trees | Chapter 4.1 to 4.3 |
| March 17 | | AVL trees | Chapter 4.4 and 4.6 |
| March 18 | | AVL trees | Chapter 4.4 and 4.6 |
| |
| March 21 | 9 | AVL and other trees | Chapter 4.7 and 12.2 |
| March 24 | | Sets and Maps | Chapter 4.8 |
| March 25 | | Abstract Data Types Revisited | |
| |
| March 28 | 10 | Hashing | Chapter 5.1 to 5.7 |
| March 31 | | Hashing and Heaps | Chapter 6.1 to 6.3 |
| April 1 | | Hashing and Heaps | Chapter 6.1 to 6.3 |
| |
| April 4 | 11 | Sorting | Chapter 7.1 to 7.5 |
| April 7 | | Test 2 - Chapters 3.3 through 6 |
| April 8 | | Sorting | Chapter 7.6 to 7.7 |
| |
| April 11 | 12 | Graphs | Chapter 9.1 to 9.3 |
| April 14 | | Graphs | |
| April 15 | | Graphs | |
| |
| April 18 | 13 | Graphs | Chapter 9.1 to 9.3 |
| April 21 | | Algorithm Design | Chapter 10 |
| April 22 | | Backtracking | Chapter 10.5 |
| |
| April 25 | 14 | Algorithm Design | Chapter 10 |
| April 28 | | Professional Ethics | handout |
| April 29 | | NP-Completeness? | Chapter 9.7 |
| |
| May 2 | 15 | Review | |
| May 5 | | Final Exam (2:45 - 4:45 pm - note afternoon time) |
|