Skip to main content
Link
Menu
Expand
(external link)
Document
Search
Copy
Copied
CS 61BL SU26
Calendar
Policies
Exam Policies
Lateness Policy
Misconduct Resolution
Incomplete Grades
Resources
61B Assignment Workflow
61B Style Guide
Design Doc Guide
Exam Archive
Exam Study Tips
Using Ed
Using Git
Using IntelliJ
Using the Debugger
Using the Soda Lab Machines
Staff
Labs
Lab 01: Java & Git
FAQ
Linux/Unix
Mac OS
Windows
Lab 02: Conditionals, Loops, Array Preview
FAQ
Lab 03: Intro to Objects and Primitives
FAQ
Lab 04: Debugging & Test-Driven Development
FAQ
Lab 05: Intro to Linked Lists
FAQ
Lab 06: Linked List Enhancements
FAQ
Lab 07: Abstract Data Types & Inheritance
FAQ
Lab 08: Comparison, Iteration, and Exceptions
FAQ
Lab 09: Runtime Analysis
FAQ
Lab 10: Trees and Traversals
FAQ
Lab 11: Binary Search Trees
FAQ
Lab 12: Balanced Search Trees
FAQ
Lab 14: Graphs
FAQ
Lab 15: Hashing
FAQ
Lab 16: Heaps and Priority Queues
FAQ
Lab 17: Disjoint Sets
FAQ
Lab 18: Build Your Own World Introduction
FAQ
Lab 19: Shortest Path Trees
FAQ
Lab 20: Minimum Spanning Trees
FAQ
Projects
Project 0: 2048
FAQ
Project 1A: LinkedListDeque61B
FAQ - Project 1A: Linked List Deque 61B
Project 1B: ArrayDeque61B
FAQ - Project 1B: Array Deque 61B
Project 2
Project 2A: NGrams
Project 2B: Wordnet
Design
Data
Testing
Above and Beyond
Project 3
Project 3A: BYOW (World Generation)
Project 3B: BYOW (Interactivity)
Partnerships
Design
Ambition Features
Checkoffs
Common Bugs
Partnership Guide
Troubleshooting
Git WTFS
IntelliJ WTFS
Search CS 61BL Summer 2026
Dark Mode
Ed
Gradescope
Beacon
Extensions
Support 💜
Feedback + Kudos
Labs
Lab 19: Shortest Path Trees
FAQ
Nothing at the moment!
Nothing at the moment!
