5/7
Lecture 1: Data Definitions in Java
Lecture 2: Data Definitions: Unions

5/8
Lecture 3: Methods for simple classes
Lecture 4: Methods for unions

5/9
Lecture 4: Methods for unions
Lecture 5: Methods for self-referential lists
Lab 2

5/10
Lecture 5: Methods for self-referential lists
Lecture 6: Accumulator methods

5/14
Lecture 6: Accumulator methods
Lecture 7: Accumulator methods, continued
Lab 3

5/15
Lecture 7: Accumulator methods, continued
Lecture 8: Practice Design

5/16
Lecture 9: Abstract classes and inheritance
Lecture 10: Customizing constructors for correctness and convenience
Lab 4

5/17
Lecture 10: Customizing constructors for correctness and convenience
Lecture 11: Defining sameness for complex data, part 1

5/21
Lecture 11: Defining sameness for complex data, part 1
Lecture 12: Defining sameness for complex data, part 2
Lab 5

5/22
Lecture 13: Abstracting over behavior
Lecture 14: Abstractions over more than one argument

5/23
Lecture 14: Abstractions over more than one argument
Lecture 15: Abstracting over types
Lab 6

5/24 Exam 1

5/28 Memorial Day, No class

5/29
Lecture 16: Visitors

5/30
Lecture 17: Mutation
Lecture 18: Mutation inside structures
Lab 7

5/31
Lecture 19: Mutation, aliasing and testing

6/4
Lecture 19: Mutation, aliasing and testing
Lecture 20: Mutable data structures
Lab 8

6/5
Lecture 21: ArrayLists
Lecture 22: ArrayLists

6/6
Lecture 22: ArrayLists
Lecture 23: For-each loops and Counted-for loops
Lab 9

6/7
Lecture 24: While loops
Lecture 25: Iterator and Iterable

6/11
Lecture 26: Hashing and Equality
Lab 10

6/12
In-class exam review
Lecture 27: Introduction to Big-O Analysis

6/13
Lecture 28: Quicksort and Mergesort
Lecture 29: Priority Queues and Heapsort
Lab: Exam Review

6/14 Exam 2

6/18
Lecture 29: Priority Queues and Heapsort
Lab 11

6/19
Lecture 30: Breadth-first search and Depth-first search on graphs

6/20
Lecture 32

6/21
Lecture 34: Implementing Objects