Schedule

Week 1

1/24: Lecture 1: The Essence of ObjectsDesigning Data: Simple classes, classes with containment

1/26: Lecture 2: Unions of ObjectsDesigning unions of classes; self-reference

1/29: Lecture 3: Cancelled

Week 2

1/31: Lecture 4: Classes of Objects: Data Definitions

2/2: Lecture 5: Classes of Objects: Interface Definitions

2/5: Lecture 6: Interface Design: Independent and Extensible

Lab 1: Simple Data Definitions with ClassSimple Data definitions and methods in Class

Week 3

2/7: Lecture 7: Parametric Interface Definitions and Methods

2/9: Lecture 8: Introducing Java: Syntax and Semantics

2/12: Lecture 9: Union, Interfaces, and Lists in Java

Week 4

2/14: Lecture 10: Testing in Java

2/16: Lecture 11: Parametric Interfaces in Java

2/19: Lecture 12: Computations on Many Structural Arguments: Double Dispatch

Week 5

2/21: Lecture 13: Parameterized Types and Double Dispatch; Abstracting Values

2/23: Lecture 14: Abstracting Computation with Function Objects

2/26: Lecture 15: Function Objects & Parameterized Types; Anonymous Classes & Lambda

Week 6

2/28: Lecture 16: The Fundamental List Abstraction: Fold

3/2: Lecture 17: University Closed: Wind

3/5: Lecture 18: Midterm Review

Week 7

3/7: Midterm 1 

3/9: Lecture 19: Properties of Equality: Reflexive, Symmetric, Transitive, and Total

3/12: Lecture 20: Structural Equality with Double Dispatch; Abstracting and Overridding

Week 8

3/14: Lecture 21: More Double Dispatch

3/16: Lecture 22: Optional, Maps, Sets, and Lifting Default Code to Abstract Classes

3/19: No Class: Spring break 

Week 9

3/21: No Class: Spring break 

3/23: No Class: Spring break 

3/26: Lecture 23: The Visitor Pattern

Week 10

3/28: Lecture 24: Implementing Visitors; Bank Accounts

3/30: Lecture 25: Imperatives: Implicit Communication via Side-Effects

4/2: Lecture 26: Aside: List Exercises

Week 11

4/4: Lecture 27: Imperatives: Cyclic Data

4/6: Lecture 28: Imperatives: Methods over Cylic Data

4/9: Lecture 29: BSTs, Maps, The Law of HashCode, and Comparable vs Comparators

Week 12

4/11: Lecture 30: Random access and ArrayLists

4/13: Lecture 31: Implementing Hash Tables

4/16: Lecture 32: Resizing Hash Tables

Week 13

4/18: Lecture 33: Simple Iterators

4/20: Lecture 34: List Iterators and Iterator Combinators

4/23: Lecture 35: List Iterators and Iterator Combinators

Week 14

4/25: Midterm 2 

4/27: Lecture 36: Zippers

4/30: Lecture 37: Naive Tree Iterators

Week 15

5/2: Lecture 38: Efficient Pre-Order Tree Iterators

5/4: Lecture 39: Drills

5/7: Lecture 40: Drill Solutions

Week 16

5/9: Lecture 41: Wrap-up