Syllabus
Week 1
1/08:
Lecture 1: Data Definitions in Java
Designing Data: Simple classes, classes with containment
1/10:
Lecture 2: Data Definitions: Unions
Designing unions of classes; self-reference
1/11:
Lecture 3: Methods for simple classes
Methods for simple classes and classes with containment
Lab:
Lab 1
Data definitions in Java; Eclipse IDE; Handins homework server
Week 2
1/15:
No class: MLK Day
1/17:
Lecture 4: Methods for unions
Methods for unions of classes and classes with self-reference
1/18:
Lecture 5: Methods for self-referential lists
Designing methods for complex class hierarchies
Lab:
Lab 2
Designing methods in Java: classes, containment, unions, self-reference
Week 3
1/22:
Lecture 6: Accumulator methods
More complicated methods for self-referential data
1/24:
Lecture 7: Accumulator methods, continued
(continued) Methods with accumulators
1/25:
Lecture 8: Practice Design
Recap: designing methods and wish lists for a larger problem
Lab:
Lab 3
Designing methods for self-referential data
Week 4
1/29:
Lecture 9: Abstract classes and inheritance
Abstract classes and inheritance
1/31:
Lecture 10: Customizing constructors for correctness and convenience
Customizing constructors for correctness and convenience
2/01:
Lecture 11: Defining sameness for complex data, part 1
Sameness of data values
Lab:
Lab 4
Practice with abstract classes and constructors
Week 5
2/05:
Lecture 12: Defining sameness for complex data, part 2
More of the same
2/07:
Lecture 13: Abstracting over behavior
Overview of world programming; Function objects
2/08:
Lecture 14: Abstractions over more than one argument
More function objects
Lab:
Lab 5
Functional world games
Week 6
2/12:
2/14:
Lecture 16: Visitors
Visitors
2/15:
Practice
Lab:
Lab 6
Working with function objectsMidterm 1: 6:00--9:00PM
TBD
Week 7
2/19:
No class: Presidents’ Day
2/21:
Lecture 17: Mutation
Creating cyclic data, mutation
2/22:
Lecture 18: Mutation inside structures
Testing mutation methods, indirect cycles
Lab:
Lab 7
Generics and Visitors
Week 8
2/26:
Lecture 19: Mutation, aliasing and testing
Aliasing and equality, revisited
2/28:
Lecture 20: Mutable data structures
Removing items from lists, mutable lists
3/01:
Lecture 21: ArrayLists
Direct-access data structures: ArrayList; swapping two items, mapping over ArrayLists, for-each loops
Lab:
Lab 8
Working with mutable and cyclic data
Week 9
3/05:
No class: Spring break
3/07:
No class: Spring break
3/08:
No class: Spring break
Week 10
3/12:
Lecture 22: ArrayLists
ArrayLists and binary search; for-each loops; working with indices
3/14:
Lecture 23: For-each loops and Counted-for loops
For-each loops and counted-for loops
3/15:
Lecture 24: While loops
While-loops
Lab:
No lab this week: snow day
Week 11
3/19:
Lecture 25: Iterator and Iterable
Iterators and Iterables
3/21:
More practice with iterators
3/22:
Lecture 26: Hashing and Equality
HashMap, equals
Lab:
Lab 10
Practice implementing iterators
Week 12
3/26:
Lecture 27: Introduction to Big-O Analysis
Big Oh: searching and sorting; insertion sort and selection sort
3/28:
Lecture 28: Quicksort and Mergesort
Big Oh: searching and sorting; quicksort and merge sort
3/29:
Lecture 29: Priority Queues and Heapsort
Big Oh: searching and sorting; HeapSort -- Priority Queue
Lab:
Lab 9
Loyd's 15 puzzle: working with ArrayLists, loops and imperative worldsMidterm 2: 6:00--9:00PM
RI200, ISEC102, SN168, SN108
Week 13
4/02:
Practice with Iterators
4/04:
Lecture 30: Breadth-first search and Depth-first search on graphs
Graph algorithms: breadth-first search, depth-first search
4/05:
Exam review
Lab:
Lab 11
Heapsort, stress tests
Week 14
4/09:
Lecture 31: Dijkstra’s Algorithm for single-source shortest paths
Graph algorithms: Dijkstra's algorithm, and comparison with BFS/DFS
4/11:
Lecture 32
Minimum spanning trees: Prim's and Kruskal's algorithms
4/12:
Lecture 33
Design choices in object-oriented languages: JavaScript
Lab:
Lab 12
TBD
Week 15
4/16:
No class: Patriots’ Day
4/18:
Lecture 34: Implementing Objects
Implementing Objects
Lab:
No lab this week