Detailed Lecture
Schedule:
|
# |
Date |
Homework
Assigned or Started |
Textbook
Reading |
Content/Activity |
|
1 |
Jan
21 (W) |
Class
Introduction, foreshadowing activity |
||
|
2 |
|
|
Java
refresher, JGRASP catch-up and review |
|
|
3 |
Jan
26 (M) |
|
Chapters 2 |
The
Bag Collection |
|
4 |
Jan
28 (W) |
|
The
Bag Collection |
|
|
5 |
|
|
Introduction
to data structures |
|
|
6 |
Feb
2(M) |
|
|
Developing
a collection |
|
7 |
Feb
4 (W) |
|
Implementing
an iterator |
|
|
8 |
Feb
6(F) |
|
|
Linked
structures |
|
9 |
Feb
9 (M) |
|
|
Multiple
implementations |
|
10 |
Feb
11 (W) |
|
|
Working with Java collections |
|
11 |
Feb
13 (F) |
|
|
|
|
12 |
Feb
18 (W) |
|
|
Review
for Exam 1 |
|
13 |
Feb
20 (F) |
|
|
Exam
1 |
|
14 |
Feb
23 (M) |
|
Chapter 4 |
Recursion
and backtracking |
|
15 |
Feb
25 (W) |
|
|
Sorting and searching |
|
16 |
Feb
27 (F) |
|
|
Sorting and searching |
|
17 |
Mar
1 (M) |
|
Chapter 5 |
Linear collections: stack |
|
18 |
|
|
Linear collections: stack |
|
|
19 |
Mar
5 (F) |
|
|
|
|
20 |
Mar
8 (M) |
|
|
Linear
collections: stack |
|
21 |
|
Chapter 6 |
Stack
applications |
|
|
22 |
Mar
12 (F) |
|
|
Stack
applications |
|
23 |
Mar
22 (M) |
|
|
Linear
collections: queue |
|
24 |
Mar
24 (W) |
|
Chapter 7 |
Linear
collections: queue |
|
25 |
Mar
26 (M) |
|
|
Queue Applications |
|
26 |
Mar
29 (M) |
|
|
Review
for Exam 2 |
|
27 |
Mar
31 (W) |
|
|
Exam
2 |
|
28 |
April
1 (F) |
|
|
Catch-up |
|
29 |
April
5 (M) |
|
|
|
|
30 |
April
7 (W) |
|
|
|
|
31 |
April
8 (TH) |
|
|
List iterator |
|
32 |
April
12 (M) |
|
|
Hierarchical
collections: trees |
|
33 |
April
14 (W) |
|
|
Parsing expressions |
|
34 |
April
16(F) |
|
|
|
|
35 |
April
19 (M) |
|
|
Binary
search trees |
|
36 |
April
21 (W) |
|
|
Heaps |
|
37 |
April
23(F) |
|
|
Unordered
collections |
|
38 |
April
26 (M) |
|
|
Review for Exam 3 |
|
39 |
April
28 (W) |
|
|
Exam 3 |
|
40 |
April
30(F) |
|
|
Unordered
collections |
|
41 |
May
3 (M) |
|
|
Hashing |
|
42 |
May
5 (W) |
|
|
Course
review & critique |
Detailed LAB Schedule:
|
Week
|
Dates |
Project
Started |
Project
Due date |
Content/Activity |
|
1 |
1/21,23 |
|
|
|
|
2 |
1/26,28,30 |
Project
1 |
1/30 |
Object
Arrays |
|
3 |
2/2,4,6 |
Project
2 |
2/13 |
Modify
the LinkedBag Collection |
|
|
2/9,11,13 |
|
|
|
|
4 |
2/18,20 |
Project
3 |
2/27 |
Recursion |
|
5 |
2/23,25,27 |
|
|
|
|
6 |
3/1,3,5 |
Project
4 |
|
Searching and Sorting |
|
7 |
3/8,10,12 |
Project
5 |
3/12 |
|
|
8 |
|
|
|
|
|
9 |
3/22,24,26 |
Project
6 |
Queues |
|
|
10 |
3/29,31,4/1 |
|
|
Exam
2 return & discuss |
|
11 |
4/5,7,8 |
Project
7 |
4/28 |
Expression
parser |
|
13 |
4/12,14,16 |
Project
8 |
5/3 |
2-3
Tree |
|
14 |
4/19,21,23 |
Project
9 |
5/10 |
Unordered
collection/hashing |
|
|
|
|
|
*
Students with
completed projects may opt-out of these labs |
Opting-out: Some lab periods
(see table above) may be opted-out under the following conditions.
By Thursday, 3:00pm students must submit the completed project for that
week. If I am able, I will briefly
check the assignment and, if complete, will return by e-mail a confirmation
granting permission to opt-out of lab. Only if this permission is granted in
advance will attendance at Friday’s lab period not be required.
Because I will only check the project briefly, the granting of
permission to opt-out does not imply that all requirements of the project have
been met and that full credit will necessarily be awarded.