Lectures

Full coursepack

Unit 1: Getting Started

1-1: Course Overview; Computational Problem Solving

notes

1-2: Programming in Java

notes

HelloWorld.java

1-3: Procedural Decomposition: Using Methods to Write Better Programs

notes

code

Unit 1 Practice Test

Unit 2: Imperative Programming I

2-1: Primitive Data, Variables, and Expressions; Simple Conditional Execution

notes

code

2-2: Definite Loops

notes

code

Star Wars text-based animation

Unit 2 Practice Test

Unit 3: Imperative Programming II

3-1: Methods with Parameters and Return Values

notes

code

3-2: Using Objects from Existing Classes

notes

code

3-3: Conditional Execution

notes

code

3-4: Indefinite Loops and Boolean Expressions

notes

code

Unit 3 Practice Test

Unit 4: Processing Collections of Data

4-1: Arrays

notes

code

4-2: File Processing

notes

code

4-3: Recursion

notes

code

Unit 4 Practice Test

Unit 5: Object-Oriented Programming

5-1: Classes as Blueprints: How to Define New Types of Objects

notes

code

5-2: Inheritance and Polymorphism

notes

code

Unit 5 Practice Test

Unit 6: Foundations of Data Structures

6-1: Abstract Data Types

notes

code

6-2: Recursion Revisited; Recursive Backtracking

notes

code

Unit 6 Practice Test

Unit 7: Sorting and Algorithm Analysis

7-1: Fundamentals

notes

code

7-2: Divide-and-Conquer Algorithms; Distributive Sorting

notes

code

Unit 7 Practice Test

Unit 8: Sequences

8-1: Linked Lists

notes

StringNode.java

two simpler versions of StringNode that can be traced using Java Tutor:

• one tracing a call to toUpperCase
• one tracing calls to copy and deleteChar

8-2: Lists, Stacks, and Queues

notes, completed slides on list efficiency

code

Unit 8 Practice Test

Unit 9: Trees and Hash Tables

9-1: Binary Trees and Huffman Encoding

notes

code

9-2: Search Trees

notes

code

9-3: Heaps and Priority Queues

notes

code

9-4: Hash Tables

notes

code

Unit 9 Practice Test

Unit 10: Graphs

notes

code

Unit 10 Practice Test

Last updated on June 20, 2026.