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!
DATE |
WEEK |
LEC |
TOPIC |
FILES |
1/16 |
1 |
1 |
Intro |
pdf |
1/17 |
1 |
2 |
Java Basics |
pdf code |
1/18 |
1 |
3 |
IO, Random, Loops, and Problem Solving |
pdf code |
|
1/23 |
2 |
4 |
Java Arrays and the Arrays class |
pdf code |
1/25 |
2 |
5 |
Classes, Objects and OOP |
pdf code |
|
1/30 |
3 |
6 |
File I/O, Exceptions, Array of Objects |
pdf code |
|
2/ 6 |
4 |
7 |
2d Arrays, ArrayLists, Efficiency (Big O) |
pdf code |
2/ 8 |
4 |
8 |
Inheritance |
pdf code |
|
2/13 |
5 |
9 |
Linked Lists (Intro) |
pdf code |
2/15 |
5 |
10 |
Implementing a generic Linked List class |
pdf code |
|
2/20 |
6 |
11 |
Implementing a generic Linked List class (part 2), Recursion |
pdf code |
|
2/27 |
7 |
|
Midterm review |
|
3/ 1 |
7 |
|
Midterm (14%) |
|
|
3/ 6 |
8 |
12 |
Interfaces (and JavaDoc) |
pdf code |
|
3/12-16 |
9 |
SPRING BREAK |
|
3/21 |
10 |
13 |
Iterators |
pdf code |
3/22 |
10 |
14 |
Stacks & Queues |
pdf |
|
3/27 |
11 |
15 |
Searching and Sorting |
pdf code |
3/29 |
11 |
16 |
Comparators, Intro to Trees, and Binary Search Trees |
pdf code |
|
4/ 3 |
12 |
17 |
Binary Search Tree Implementation |
pdf code |
|
4/10 |
13 |
18 |
BST (finalé), Priority Queues, and Heaps |
pdf |
4/12 |
13 |
19 |
Sets, Maps, and Hashing |
pdf code |
|
4/19-21 |
14 |
Spring Carnival |
|
4/24 |
15 |
20 |
Graphs |
pdf |
4/26 |
15 |
21 |
Inheritance, revisited |
pdf code |
|
5/ 3 |
16 |
22 |
Data Structures/Final Review |
handout |
|
5/10 |
17 |
|
Final (25%) — 1:00, GHC 4211 |
|