Class Date Topic Reading Assignments
1M 2/10 Introduction: exercise, slides B.1, B.2.1, B.3.3, B.3.4, Setup Introduction Form
1W 2/12 Java Control Structures: code (solutions), slides B.4, B.5 Lab 1 due M 2/17
1F 2/14 Lab 1 B.3.2 Homework 1 due Th 2/20
2M 2/17 Arrays: code, slides, practice (solutions) B.2.2
2W 2/19 Objects: code (solutions), slides (notes) 1.1 - 1.7 Lab 2 due M 2/24
2F 2/21 Lab 2 Homework 2 due Th 2/27
3M 2/24 Polymorphism: code (solutions), slides 1.8, 4, B.6, B.8
3W 2/26 Java Collections: code (solutions), annotated slides ArrayList, HashMap Lab 3 due M 3/3
3F 2/28 Lab 3 Homework 3 due Th 3/6
4M 3/3 Complexity: annotated slides 5.1
4W 3/5 Sorting: code, annotated slides 6.1 - 6.3 Lab 4 due M 3/10
4F 3/7 Lab 4 6.7 - 6.8 Homework 4 due Th 3/13
5M 3/10 Recursion: code, annotated slides 5.2.1
5W 3/12 More Sorting: code, annotated slides 6.4 - 6.5
5F 3/14 Optional lab to start Homework 5 Homework 5 due Th 3/27
Spring break
6M 3/24 Linked Lists 9.4
6W 3/26 More Linked Lists 9.5 - 9.6 Lab 5 due M 3/31
6F 3/28 Lab 5
7M 3/31 Stacks and Queues 10.1 - 10.2 Midterm (Programming portion)
7W 4/2 In-class Midterm (Study Guide) Lab 6 due M 4/7
7F 4/4 Lab 6 Homework 6 due Th 4/10
8M 4/7 Trees 12, 13
8W 4/9 Heaps, Priority Queues 13
8F 4/11 Attend the Spring Student Symposium Homework 7 due Th 4/17
9M 4/14 Binary Search Trees 14.1 - 14.4
9W 4/16 Balanced Trees 14.5 - 14.8 Lab 7 due M 4/21
9F 4/18 Lab 7 Homework 8 due Th 4/24
10M 4/21 Hash Tables I 15.1 - 15.3, 15.4.1
10W 4/23 Hash Tables II 15.4.2 Lab 8 due M 4/28
10F 4/25 Lab 8 Homework 9 due Th 5/1
11M 4/28 Graphs 16.1 - 16.3
11W 4/30 BFS and DFS Lab 9 due M 5/5
11F 5/2 Lab 9 Homework 10 due Th 5/8
12M 5/5 Repositories
12W 5/7 Testing Lab 10 due M 5/12
12F 5/9 Lab 10
13M 5/12 Office Hours (no class)
13W 5/14 Final Exam Study Guide
13F 5/16 Final Exam TBD Final Exam