Syllabus

Week 1

1/06:

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/08:

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/09:

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/13:

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

1/15:

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

1/16:

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/20:

No class: MLK Day

1/22:

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

1/23:

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

Lab:

Lab 3 Practice white-box and black-box testing

Week 4

1/27:

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

1/29:

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

1/30:

Lecture 15: Abstracting over types Generics

Lab:

Lab 4 Designing sameness methods; functional world games

Week 5

2/03:

Lecture 16: Visitors Visitors Midterm 1: 6:00--9:00PM 20 WVF

2/05:

Exam review, additional practice with generics

2/06:

Lecture 17: Mutation Creating cyclic data, mutation

Lab:

Lab 5

Week 6

2/10:

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

2/12:

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

2/13:

Lecture 20: Mutable data structures Removing items from lists, mutable lists Lecture 21: ArrayLists Direct-access data structures: ArrayList; swapping two items, mapping over ArrayLists, for-each loops

Lab:

Lab 6 Working with mutable and cyclic data

Week 7

2/17:

No class: Presidents’ Day

2/19:

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

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

Lab:

Work on Centipede

Week 8

2/24:

Lecture 24: While loops While-loops

2/26:

Lecture 25: Iterator and Iterable Iterators and Iterables

2/27:

Design: Handin server data model

Lab:

Lab 7

Week 9

3/02:

No class: Spring break

3/04:

No class: Spring break

3/05:

No class: Spring break

Week 10

3/09:

Lecture 26: Hashing and Equality HashMap, equals

3/11:

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

3/12:

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

Lab:

Lab 8

Week 11

3/16:

No class: moving out

3/18:

Lecture 30: Breadth-first search and Depth-first search on graphs Graph algorithms: breadth-first search, depth-first search

3/19:

Lecture 31: Dijkstra’s Algorithm for single-source shortest paths Graph algorithms: Dijkstra's algorithm, and comparison with BFS/DFS

Lab:

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

Week 12

3/23:

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

3/25:

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

3/26:

Design: thinking playfully and creatively about algorithms

Lab:

Lab 10 Practice implementing iterators

Week 13

3/30:

Lecture 35: Dynamic Programming Dynamic programming: Solving recursive problems faster Midterm 2: 12:00--11:00PM 20 WVF

4/01:

Scope in Java: access modifiers and packages

4/02:

Scope in Python

Lab:

Lab 11 Heapsort, stress tests

Week 14

4/06:

Java: Streams

4/08:

Lecture 33 Design choices in object-oriented languages: JavaScript

4/09:

Lecture 34: Implementing Objects Implementing Objects

Lab:

Lab 12 TBD

Week 15

4/13:

Lecture 36 Wrap-up

Lab:

Lab 13 TBD