|
0
|
A/C: 1/18
B: 1/19
|
- Course overview and introduction
- Java basics
- No labs this week
|
|
1
|
A/C: 1/23, 1/25
B: 1/22, 1/24,
1/26
|
- Control structures, methods, and data types
- Arrays; memory management
|
|
2
|
A/C: 1/30, 2/1
B: 1/29, 1/31,
2/2
|
- Object-oriented programming
- Abstract data types
- 1/31: last day to add a class
- Problem Set 1 due on 1/30
|
|
3
|
A/C: 2/6, 2/8
B: 2/5, 2/7, 2/9
|
- Recursion and backtracking
- Problem Set 2 due on 2/6
|
|
4
|
A/C: 2/13, 2/15
B: 2/12, 2/14,
2/16
|
- Sorting and algorithm analysis
- Problem Set 3 due on 2/13
|
|
5
|
A/C: 2/22
B: 2/21, 2/23
|
- Sorting and algorithm analysis (cont.)
- No lectures on 2/19 or 2/20 (Presidents’ Day)
- 2/22: last day to drop without a ‘W’
- Midterm 1 on 2/21 from 6:30-7:45 pm
|
|
6
|
A/C: 2/27, 3/1
B: 2/26, 2/28,
3/2
|
- Linked lists
- Problem Set 4 due on 2/27
|
|
|
Spring break
|
|
7
|
A/C: 3/13, 3/15
B: 3/12, 3/14,
3/16
|
- Lists, stacks, and queues
- Iterators
|
|
8
|
A/C: 3/20, 3/22
B: 3/19, 3/21,
3/23
|
- Lists, stacks, and queues (cont.)
- Problem Set 5 due on 3/20
|
|
9
|
A/C: 3/27, 3/29
B: 3/26, 3/28,
3/30
|
- Binary trees
- 3/30: last day to drop with a ‘W’
- Midterm 2 on 3/28 from 6:50-7:45 pm
|
|
10
|
A/C: 4/3, 4/5
B: 4/2, 4/4,
4/6
|
- Binary search trees
- Problem Set 6 due on 4/3
|
|
11
|
A/C: 4/10, 4/12
B: 4/9, 4/11,
4/13
|
- Balanced search trees
- Heaps and priority queues
|
|
12
|
A/C: 4/17, 4/19
B: 4/18, 4/20
|
- Heaps and priority queues (cont.)
- B: No lecture on 4/16 (Patriots’ Day)
- Problem Set 7 due on 4/17
|
|
13
|
A/C: 4/24, 4/26
B: 4/23, 4/25,
4/27
|
|
|
14
|
A/C: 5/1
B: 4/30, 5/2
|
- Wrap-up
- Problem Set 8 due on 5/1
- 5/3-5/6: Study period
|
|
15
|
|
- Final exam: May 10, 9-11 a.m.
|