CS2852
Schedule
Day-by day class materials
See the code and slides from the webpage. The code examples are numbered by week and class of week. For example, code/class2_1_XXX
is the code example from Week 2, Day 1 (That is, Monday of Week 2).
Schedule
Week | Day | Topics | Reading | Lab |
---|---|---|---|---|
1 03/10-03/14 |
1 | Introduction Collection and List interfaces |
1, 2.1 | Lab 1: Benchmarking |
2 | Array-Based Lists, ArrayList review | 2.2-2.3, A.8, skim A, B, C | ||
3 | Generics in Java and ArrayList Exercise | |||
2 03/17-03/21 |
1 | Algorithm Efficiency and Big-Oh | 2.4 | Lab 2 |
2 | Linked Lists | 2.5-2.6 | ||
3 | Iterators
Notes from Dr. Hasker's lecture on Iterators |
2.7 | ||
3 03/24-03/28 |
1 | LinkedList Exercise | 2.8 | Lab 3 |
2 | LinkedList Exercise cont... | |||
3 | Java Collection Framework and Testing | 2.9-2.11 | ||
4 03/31-04/04 |
1 | Review | Lab 4 | |
2 | Exam I | |||
3 | Stacks | 3.1-3.4 | ||
5 04/07-04/11 |
1 | Queues | 4.1-4.3, 4.5 | Lab 5 |
2 | Recursion | 5.1-5.2 | ||
3 | Recursion Exercise | 5.3, 5.5 | ||
6 04/14-04/28 |
1 | Class Exercise | Lab 6 | |
2 | Trees and Tree Traversals | 6.1-6.2 | ||
3 | Binary Trees and Binary Search Trees | 6.3-6.4 | ||
7 04/21-04/25 |
1 | Binary Search Tree Exercise | Lab 7 | |
2 | Review | |||
3 | Exam II | |||
8 04/28-05/02 |
1 | Sets and Maps | 7.1-7.2 | Lab 8 |
2 | Hash Tables | 7.3-7.4 | ||
3 | Hashing and Collision Handling | 7.5-7.6 | ||
9 05/05-05/09 |
1 | Tree Rotations and AVL trees | 9.1-9.2 | Lab 9 |
2 | Red-Black Trees | 9.3 | ||
3 | Shallow/Deep copies and Cloning | |||
10 05/12-05/16 |
1 | Algorithm Analysis revisited | In lab activity | |
2 | How to Pick a Data Structure | |||
3 | Review for Final | |||
11 05/19-05/23 |
Common Final Exam, TBD |
Acknowledgement
The original version of this schedule comes from Dr. Taylor.