The schedule below shows the tentative dates for all class topics, readings, and major assignments (MPs and SoLAs). You should complete all assigned readings by 10 p.m. on the night before the class in which they are listed. You should complete all lab writeups before the next class session. You can find the full list of due dates on Gradescope.

Due dates for major assignments will not change. However, the particular topics we cover each day may change as we discover that we need more (or less) time on each topic.

If the title of a class session is blue, you should be able to click on it to view the eboard for that class session.

If you view this page with JavaScript enabled you can jump to the current week on the schedule, and you should see the next day of class highlighted in the schedule below.

Week 0 : Getting Started
Aug 25
class 1

Getting started

We begin the course by exploring some key ideas.

Topics: Course goals. Course structure. Academic honesty. ADTs and data structures. Designing a stack ADT (an exercise). A bit about OOP.

  • Syllabus
  • Schedule
  • No lab
Week 1 : Getting started with Java
Aug 28
class 2

Programming in the small with Java

We consider some basic issues of Java programming.

Topics: From C to Java. The structure of a Java program. Compiling and running Java programs. Strings in Java. Numeric types in Java. Arrays in Java. Basic output in Java. Basic input in Java.

Aug 30
class 3

Practice with ADT design

We practice designing an ADT and considering its implementation.

Topics: About technical interviews. ADTs and other TLAs. A design exercise.

  • No reading
  • No lab

Sep 1
class 4

Pause for breath

Because of unexpected matters, we pause to work on the first mini-project.

  • No reading
  • No lab
Week 2 : More fun with Java
Sep 4
class 5

Getting started with Java development

We consider tools for developing programs in Java, particularly the Microsoft VSCode integrated development environment (IDE) and the Git version control system.

Topics: IDEs. VSCode basics. Version control. Git basics.

Sep 6
class 6

Objects and classes

We consider Java’s approach to objects, the primary building block of object-oriented programming. We also explore Java’s classes and how one might model them.

Topics: Object basics. Modeling objects with classes. An exercise.

Sep 8
class 7

Object semantics

We consider some underlying issues in the design and implementation of objects in Java. We explore some ways to represent objects visually.

Topics: References. The stack and the heap. Representing objects.

Week 3 : Polymorphism
Sep 11
class 8

Expandable arrays, revisited

We continue considering our continued example of expandable arrays.

  • No reading
  • No lab

Sep 13
class 9

Interfaces and subtype polymorphism

We consider interfaces, which serve as specifications of expected behavior for classes. We also explore how interfaces support one form of polymorphism, a key aspect of object-oriented programming.

Topics: Interfaces. The building blocks of OOP. Subtype polymorphism.

Sep 15
class 10

Generics and parametric polymorphism

We continue our explortation of polymorphism by considering a second type of polymorphism, parametric polymorphism, and its realization in Java’s generics.

Topics: Subtype polymorphism, revisited. Parametric polymorphism. Java generics. Generic classes. Generic interfaces. Generic methods. Generics and arrays.

Week 4 : Other object concepts
Sep 18
class 11

Unit testing and debugging

We return to concepts of unit testing and habits of debugging that you first learned in CSC 151. We also introduce the concept of test-driven development, common among agile developers.

Topics: A few thoughts on testing. An example. Test-driven development. Why use debuggers. Debugging vs. print statements. Debugging in VSCode.

Sep 20
class 12

Exceptional programming

We introduce exceptions and consider their use.

Topics: Exceptions. Object-oriented design.

Sep 22
class 13


We consider inheritance, the third core aspect of object-oriented design.

Topics: Inheritance basics. Inheritance and polymorphism. Compile time vs. run time.

Week 5 : Design patterns
Sep 25
class 14

List ADTs

We consider lists and ways to think about them. We practice ADT design.

Topics: The design of ADTs, revisited. Scheme lists. Broader concepts of lists. Java lists. Implementing lists.

  • No reading
  • No lab

Sep 27
class 15

Linear structures

We consider linear structures, such as queues and stacks. We explore ways in which arrays and simple linked objects can be used to implement linear structures.

Topics: Linear structures. Stacks. Queues. Priority queues. Other linear structures. Implementing linear structures with arrays. Implementing linear structures as linked structures.

Sep 29
class 16

Array-based linear structures

We explore ways in which arrays can be used to implement linear structures.

Topics: Detour: Wrappers. Implementing linear structures with arrays. Array-based queues. Priority queues and their implementation.

Week 6 : Analyzing algorithms
Oct 2
class 17


We consider iterators, a standard mechanism for accessing the elements of a collection. We explore the use of Java’s anonymous inner classes to build iterators.

Topics: Iterators. Iterating array-based structures. Iterating linked linear structures. Named iterators. Anonymous inner classes.

Oct 4
class 18

Analyzing algorithms

We consider ways to analyze the resource use of algorithms, including formal notation for describing that use.

Topics: Comparing algorithms. Empirical analysis. Asymptotic analysis. Counting steps. Big-O, formalized. Implications of Big-O.

  • CLRS 2.1
  • CLRS 2.2
  • No lab

Oct 6
class 19

Analyzing recursive algorithms

We consider techniques for analyzing recursive algorithms.

Topics: Iterative analysis, revisited. Recurrence relations. Approaches to recurrence relations.

  • CLRS 2.3
  • CLRS 3
  • No lab
Week 7 : Miscellaneous
Oct 9
class 20

Anonymous functions

We consider Java’s support for anonymous functions.

Topics: Anonymous functions reviewed. Anonymous functions in Java. Functional interfaces. Priority queues, revisited. Sorted lists.

Oct 11
class 21

Pause for breah

We take a day to review various topics.

  • No reading
  • No lab

Oct 13
class 22


We consider the problem of searching a collection and techniques for searching various kinds of collections.

Topics: Modeling the problem of searching. Sequential search. Predicates. Binary search. Comparators. Testing binary search.

Fall Break
Week 8 : Sorting
Oct 23
class 23


We return to the problem of sorting a list or array.

Topics: The problem of sorting. Testing sorting algorithms. Insertion sort. Selection sort. Generic sorts.

Oct 25
class 24

Merge sort

We consider the classic merge sort algorithm.

Topics: Lower bounds on sorting. Divide-and-conquer algorithms. An introduction to merge sort. Analyzing merge sort.

Oct 27
class 25


We consider the classic Quicksort algorithm.

Topics: A quick introduction to Quicksort. Partitioning. Partitioning with invariants. Key ideas from Quicksort.

Week 9 : Lists, revisited
Oct 30
class 26

Ethical considerations

We consider our responsibilities as programming professionals.

Topics: Professional ethics..

Nov 1
class 27

Array-based lists

We return to the list ADT and explore how to implement lists using arrays.

Topics: A simple list interface. The java.util.List interface. The java.util.ListIterator interace.

Nov 3
class 28

Doubly-linked lists

We explore more sophisticated versions of the linked-list data structure

Topics: Linked lists, reviewed. Doubly-linked lists. Circularly-linked lists. Other list issues.

Week 10 : Miscellaneous
Nov 6
class 29

Sorting competition

We compare the sorting algorithms from the latest mini-projects.

  • No reading
  • No lab

Nov 8
class 30

Trees and tree traversal

We introduce the tree structure and mechanisms for iterating trees.

Topics: Representing hierarchical information. Tree terminology. Depth-first and breadth-first traversal. Recursive depth-first traversal. Iterative breadth-first traversal. Iterative depth-first traversal. Pre-order, in-order, and post-order traversals.

Nov 10
class 31

Binary search trees I

We consider binary search trees, one of the standard implementations of the Map abstract data type.

Topics: The structure of binary search trees. Organizing binary search trees. Adding elements to BSTs.

Week 11 : Binary search trees
Nov 13
class 32

Binary search trees II

We continue our exploration of binary search trees.

Topics: Deletion in BSTs.

  • No reading

Nov 15
class 33

Probing in hash tables

We explore one of the two primary collision-resolution mechansims in hash tables.

Topics: Collisions. Linear probing. Quadratic probing.

Nov 17
class 34

Hash tables

We consider hash tables, one of the most powerful implementations of the Map abstract data type. We also explore the issue of hash functions.

Topics: Integer maps. From objects to integers. Handling collisions. Rebuilding hash tables. Hash functions.

  • No reading
  • No lab
Week 12 : Hash tables
Nov 20
class 35

Chaining in hash tables

We explore the second of two primary collision-resolution mechanisms in hash tables.

Topics: Buckets and chaining.

  • No reading

Nov 22
class 36

Priority queues, heaps, and heap sort

We return to the subject of priority queues and consider heaps, one of the more efficient ways to represent priority queues.

Topics: Priority queues, revisited. The heap structure. Adding elements to heaps. Removing elements from heaps. Storing trees in arrays.

  • No lab
Thanksgiving Break
Week 13 : Graphs
Nov 27
class 37

Priority queues, heaps, and heap sort, continiued

We explore the implementation of heaps.

Topics: Heaps. Heapsort.

  • CLRS Chapter 6 (Heapsort)

Nov 29
class 38

A graph ADT

We consider a graph abstract data type and some common implementations of graphs.

Topics: Modeling problems with graphs. Graph terminology. Weighted graphs. Directed graphs. Implementing graphs with adjacency matrices. Implementing graphs with adjacency lists. Implementing graphs with edge tables.

  • CLRS B.4
  • No lab

Dec 1
class 39

Traversing graphs

We consider the problem of visiting all the nodes in a graph, expanding the approaches we used for trees.

Topics: Review of tree traversal. Breadth-first traversal. Depth-first traversal.

Week 14 : Wrapup
Dec 4
class 40

Minimum spanning trees

We consider how to build minimum spanning trees in graphs

Topics: Minimum spanning trees. Strategies for building minimum spanning trees. Kruskal’s algorithm. Prim’s algorithm. Greed as an approach to algorithm design.

Dec 6
class 41

Shortest paths in graphs

We consider the problem of finding the shortest path between two nodes in a graph

Topics: The shortest path problem. Shortest paths in unweighted graphs. Shortest paths in weighted graphs. Dijkstra’s algorithm.

Dec 8
class 42


We conclude the course.

Topics: The subject matter(s) of the course. Looking ahead. Course evaluation.

  • No reading
  • No lab
Finals Week
Dec 15
  • All remaining LAs
  • All remaining MP redos (optional, by 5pm)
Winter Break