UC Berkeley CS61B Spring 2018 - Data Structures

Class codes and assignments of UC-Berkeley cs61b Course page

Projects

Folder	Title
proj0	NBody
[x] proj1a	LinkedListDeque ArrayListDeque
[x] proj1b	Testing Data Structures
proj2	Build Your own Game
proj3	BearMaps

Folder	Title	Concepts
[x] hw0	A Java Crash Course (Optional)	Java practice
[x] hw1	Java Syntax and Sound Synthesis	Java practice
[x] hw2	Percolation	Disjoint sets
hw3	8 Puzzle	A* Search
hw4	Hashing	Priority queues
hw5	Seam Carving	Dynamic Programming
hw6	Boggle	Tries, Search
hw7	Compression	Tries, Compression

Folder	Title	Concepts
[x] lab1	javac, java, Git	Compilation, version control systems, Git, submission process
[x] lab2	IDEs	IntelliJ, debuggers, pass-by-value, IntLists, destructive vs. non-destructive
[x] lab3	Testing, Debugging	JUnit, unit testing, debugging, style checker
[x] lab6	Disjoint Sets	Union Find, Weighted Quick Union
[x] lab9	Hash Maps	Hashing, Hash Maps
[x] lab10	Heap Min PQ	Heaps, Priority Queues
[x] lab11	Graphs	BFS, DFS, Dijkstra’s algorithm, and A* algorithm
lab12	Merge and Quick Sort	Merge sort, Quicksort
lab13	Radix Sort	Radix sort
lab14	Fractal Sound	Make music with bitwise operations
lab15	Hug Life	Ecosystem simulation