Lecture Schedule
Use any posted notes as support material for use in class to help you learn more effectively. You might want to print out or save a copy for yourself before class. Note that any handouts posted do NOT substitute for going to class. We will discuss much more than what you see in the slides below. You will need Adobe Acrobat Reader to view these files.
| DATE |
WEEK |
NUM |
TOPIC |
|
| 9/2 |
1 |
1 |
Intro |
pdf |
| 9/4 |
1 |
2 |
Java Review |
pdf code |
| 9/6 |
1 |
3 |
I/O, Random Numbers, & Problem Solving |
pdf code |
|
| 9/9 |
2 |
4 |
Arrays and Objects (Intro) |
pdf code |
| 9/11 |
2 |
5 |
Classes, Objects, and OOP |
pdf code |
|
| 9/16 |
3 |
6 |
Loose Ends (Arrays Class and File I/O) |
pdf code |
| 9/18 |
3 |
7 |
2-d Arrays and ArrayLists |
pdf code |
|
| 9/23 |
4 |
8 |
ArrayList Operations and Efficiency (O-notation) |
pdf |
| 9/25 |
4 |
9 |
Linked Lists (Intro) |
pdf code |
|
| 9/30 |
5 |
10 |
Implementing a generic Linked List class |
pdf code |
| 10/2 |
5 |
11 |
Implementing a generic Linked List class (continued) |
code |
|
| 10/7 |
6 |
12 |
Recursion |
pdf code |
| 10/9 |
6 |
13 |
Interfaces (and Javadoc) |
pdf code |
|
| 10/14 |
7 |
14 |
Iterators |
pdf code |
| 10/16 |
7 |
15 |
Stacks & Queues and Midterm review |
pdf |
| 10/18 |
7 |
|
Midterm (15%)
| |
|
| 10/21 |
8 |
16 |
Searching and Sorting (Quadratic) |
pdf code |
| 10/23 |
8 |
17 |
Sub-Quadratic Sorts |
pdf code |
|
| 11/4 |
9 |
18 |
Comparators and Trees (intro) |
pdf code |
| 11/8 |
9 |
19 |
Binary Search Trees |
pdf |
|
| 11/11 |
10 |
20 |
Implementing a generic Binary Search Tree class |
pdf code |
| 11/13 |
10 |
21 |
BST wrap-up and Priority Queues |
pdf |
|
| 11/20 |
11 |
22 |
Heaps and Heapsort |
pdf |
|
| 11/25 |
12 |
23 |
Sets & Maps (Intro) |
pdf |
| 11/27 |
12 |
24 |
Sets & Maps |
pdf code |
|
| 12/2 |
13 |
25 |
Hashing (and HashSets) |
pdf code |
| 12/4 |
13 |
26 |
Data Structure Summary/Review |
pdf handout |
|
| 12/9 |
14 |
27 |
Review of Final topics |
|
| 12/11 |
14 |
28 |
Continued Final Review |
|
