UC Berkeley CS 61B Data Structures, Spring 2018
- More details about Project 3 please see this repo
- Lecture Code
- proj0: Basic Java Syntaxes
- proj1a: Linked List Deque(Double Ended Queue), Array Deque
- proj1b: Test Driven Development, Interface
- proj1gold: Randomized Testing, JUnit Message Generation
- proj2: Pseudo Random Generation, Interaction
- proj3: Graph, Trie, K-d Tree, A* algorithm, Heroku Deployment
- hw1: Packages, Interfaces, Generics, Exceptions, Iteration
- hw2: Percolation Simulation with Disjoint Set
- hw3: HashCode
- hw4: A* search algorithm
- hw5: Seam Carving
- lab3: Debug, JUnit Test, Naked Linked List
- lab9: Tree Maps, Hash Maps
- lab10: Binary Min-Heap
- lab11: BFS, DFS, Cycle Check, A*
- lab12: Merge Sort, Quick Sort
- lab13: Counting Sort, Radix Sorts
- lab14: Fractal Sound