Did you find a typo or bug in the lab? Was there something that was confusing or
unclear? Let us know how we can improve our labs by submitting problems.

Labs

Lab 1: Welcome to CS 61BL

Lab 2: Loops & Conditionals

Lab 3: Java Objects

Lab 4: Arrays, Objects, and Testing

Lab 5: Arrays & Collection Classes

Lab 6: Exceptions & Invariants

Lab 7: Inheritance, Interfaces, & Abstract Classes

Lab 8: Generics & Iterators

Lab 9: Midterm 1 Review

Lab 10: Git & Packages

Lab 11: Linked Lists & Algorithm Analysis

Lab 12: More Linked Lists; Destructive List Manipulation

Lab 13: Linked List Finale

Lab 14: Trees

Lab 15: More on Trees

Lab 16: Binary Search Trees

Lab 17: Trees Finale & Maps

Lab 18: Hashing Part 1

Lab 19: Hashing Part 2

Lab 20: Priority Queues & Binary Heaps

Lab 21: Midterm 2 Review

Lab 22: Project 2 Work Day

Lab 23: Graphs

Lab 24: Graph Algorithms & Applications

Lab 25: Sorting Part 1

Lab 26: Sorting Part 2

Lab 27: Balanced Search Trees

Lab 28: Bits

Lab 29: Final Exam Review

Lab 30: Bloom Filters (Homework 21 Part 2)

Lab 31: GUIs

Lab 2: Loops & Conditionals

Lab 3: Java Objects

Lab 4: Arrays, Objects, and Testing

Lab 5: Arrays & Collection Classes

Lab 6: Exceptions & Invariants

Lab 7: Inheritance, Interfaces, & Abstract Classes

Lab 8: Generics & Iterators

Lab 9: Midterm 1 Review

Lab 10: Git & Packages

Lab 11: Linked Lists & Algorithm Analysis

Lab 12: More Linked Lists; Destructive List Manipulation

Lab 13: Linked List Finale

Lab 14: Trees

Lab 15: More on Trees

Lab 16: Binary Search Trees

Lab 17: Trees Finale & Maps

Lab 18: Hashing Part 1

Lab 19: Hashing Part 2

Lab 20: Priority Queues & Binary Heaps

Lab 21: Midterm 2 Review

Lab 22: Project 2 Work Day

Lab 23: Graphs

Lab 24: Graph Algorithms & Applications

Lab 25: Sorting Part 1

Lab 26: Sorting Part 2

Lab 27: Balanced Search Trees

Lab 28: Bits

Lab 29: Final Exam Review

Lab 30: Bloom Filters (Homework 21 Part 2)

Lab 31: GUIs