Syllabus

Week 1

1/07:

Lecture 1: Data Definitions in Java Designing Data: Simple classes, classes with containment Lecture 2: Data Definitions: Unions Designing unions of classes; self-reference

1/09:

Lecture 3: Methods for simple classes Methods for simple classes and classes with containment Lecture 4: Methods for unions Methods for unions of classes and classes with self-reference

1/10:

Lecture 5: Methods for self-referential lists Designing methods for complex class hierarchies Lecture 6: Accumulator methods More complicated methods for self-referential data

Lab:

Lab 1 Data definitions in Java; Eclipse IDE; Handins homework server

Week 2

1/14:

Lecture 7: Accumulator methods, continued (continued) Methods with accumulators

1/16:

Lecture 8: Practice Design Recap: designing methods and wish lists for a larger problem

1/17:

Lecture 9: Abstract classes and inheritance Abstract classes and inheritance

Lab:

Lab 2 Designing methods in Java: classes, containment, unions, self-reference

Week 3

1/21:

No class: MLK Day

1/23:

Lecture 10: Customizing constructors for correctness and convenience Customizing constructors for correctness and convenience

1/24:

Lecture 11: Defining sameness for complex data, part 1 Sameness of data values

Lab:

Lab 3 Designing methods for self-referential data

Week 4

1/28:

Lecture 12: Defining sameness for complex data, part 2 More of the same

1/30:

Lecture 13: Abstracting over behavior Overview of world programming; Function objects Lecture 14: Abstractions over more than one argument More function objects

1/31:

Lecture 15: Abstracting over types Generics

Lab:

Lab 4 Practice with abstract classes and constructors

Week 5

2/04:

Lecture 16: Visitors Visitors

2/06:

Lecture 17: Mutation Creating cyclic data, mutation

2/07:

Lecture 18: Mutation inside structures Testing mutation methods, indirect cycles

Lab:

Lab 5 Functional world games

Week 6

2/11:

Lecture 19: Mutation, aliasing and testing Aliasing and equality, revisited

2/13:

Lecture 20: Mutable data structures Removing items from lists, mutable lists

2/14:

Lecture 21: ArrayLists Direct-access data structures: ArrayList; swapping two items, mapping over ArrayLists, for-each loops Lecture 23: For-each loops and Counted-for loops For-each loops and counted-for loops

Lab:

Lab 6 Working with function objects

Midterm 1 – Tuesday: 6:00--9:00PM
CG 097

Week 7

2/18:

No class: Presidents’ Day

2/20:

Lecture 22: ArrayLists ArrayLists and binary search; for-each loops; working with indices Lecture 23: For-each loops and Counted-for loops For-each loops and counted-for loops

2/21:

Design: handin server data model

Lab:

Lab 7 Generics and Visitors

Week 8

2/25:

Lecture 24: While loops While-loops

2/27:

Lecture 25: Iterator and Iterable Iterators and Iterables

2/28:

Lecture 26: Hashing and Equality HashMap, equals

Lab:

Work on Tower Defense

Week 9

3/04:

No class: Spring break

3/06:

No class: Spring break

3/07:

No class: Spring break

Week 10

3/11:

Lecture 27: Introduction to Big-O Analysis Big Oh: searching and sorting; insertion sort and selection sort

3/13:

Lecture 28: Quicksort and Mergesort Big Oh: searching and sorting; quicksort and merge sort

3/14:

Lecture 29: Priority Queues and Heapsort Big Oh: searching and sorting; HeapSort -- Priority Queue

Lab:

Lab 8 Working with mutable and cyclic data

Week 11

3/18:

Lecture 30: Breadth-first search and Depth-first search on graphs Graph algorithms: breadth-first search, depth-first search Lecture 31: Dijkstra’s Algorithm for single-source shortest paths Graph algorithms: Dijkstra's algorithm, and comparison with BFS/DFS

3/20:

Design: thinking playfully and creatively about algorithms

3/21:

Lecture 32 Minimum spanning trees: Prim's and Kruskal's algorithms

Lab:

Lab 9 Loyd's 15 puzzle: working with ArrayLists, loops and imperative worlds

Week 12

3/25:

Lecture 36: Dynamic Programming Dynamic programming: Solving recursive problems faster

3/27:

Scope in Java: access modifiers and packages

3/28:

Scope in Python

Lab:

Lab 10 Practice implementing iterators

Midterm 2 – Tuesday: 6:00--9:00PM
CG 097

Week 13

4/01:

Java: Streams

4/03:

Java: Visilibity

4/04:

Java: Packages, JUnit, etc

Lab:

Lab 11 Heapsort, stress tests

Week 14

4/08:

Lecture 37 Slack

4/10:

Lecture 38 Slack

4/11:

Lecture 39 Slack

Lab:

Lab 12 TBD

Week 15

4/15:

No class: Patriots’ Day

Lab:

Lab 13 TBD