For the current semester materials, access them through NYU Brightspace.
Course Info and Resources
Slides
- Course Intro
- Java Programs Under The Hood
- Data Structures Overview, 1
- Data Structures Overview, 2
- Lists, 1
- Lists, 2
- Lists, 3
- Stacks and Queues
- Problem Solving
- Recursion, 1
- Recursion, 2v
- Graphs - Introduction
- Trees
- Binary Search Trees, 1
- Binary Search Trees, 2
- Hash Tables
- Balanced Binary Search Trees (optional)
- Priority Queues, Heaps, Heapsort (optional)
- Searching and Sorting
Labs
These are old copies of the labs. Actual weekly labs will be shared on Edstem each week.
- Lab 1, Remember Programming?
- Lab 2, Bullet Proof Programs / Input Validation
- Lab 4, Finding Code Responsible for Behavior (code reading)
- Lab 4,
ArrayList<E>- case study (code reading) - Lab 5, Iterating Over Things and the for-each Loop
- Lab 6, Magic Of Recursion
- Lab 7, Test Driven Development (TDD) and using JUnit Testing
- Lab 7a, Wring an Add Program
- Lab 8, Sorting Algorithms
- Lab 9, Binary Trees and Binary Search Trees
- Lab 10, Binary (Search) Trees
- Lab 11, BSTs, AVL Trees, and Binary Heaps
- Lab 12, How Many Words
- Lab 13, Graph practice