CS 61B Section Materials, Spring 2016
Data Structures
Data Structures
Extra Worksheets (for Practice):
Note: If you're looking for the official Discussion sheets, they're on the course site.
Note 2: There was a typo in 5A of the Practice Midterm II solutions. Apologies: this has been fixed.
- Week 1: Basic Java (solutions)
- Week 2: Scope, Pass by Value, Static (solutions)
- Week 3: Linked Lists, Arrays (solutions)
- Week 4: Practice Midterm (solutions)
- Week 7: Asymptotic Analyses (solutions)
- Week 9: Practice Midterm II (solutions)
- Week 11: Graphs! (Coming Soon)
- Discussion 1: Basic Java
- Discussion 2: Scope, Pass by Value, Static
- Discussion 3: Linked Lists, Arrays
- Discussion 4: Inheritance (Notes I used while presenting- maybe they'll help make sense of your own?)
- Discussion 6: Immutability and Encapsulation
- Discussion 8: Asymptotics II
- Discussion 9: Hashing
- Discussion 11: Graphs!
- CORRECTION for Discussion 11, Question 3 on Topoligcal Sorting.
- Discussion 12: More Graphs!
- Discussion 14: CS 172 Handout on Kolmogorov Complexity (For fun. Includes stuff about incompressible strings I mentioned in section. Same disclaimer as CS 170 textbook applies.)
Here is a link to the Spotify Playlist I use during Berkeley Time.
Here is a pdf of the CS 170 (Algorithms) book. This is way above the level you need to know for the algorithms in this class. That said, it's a wonderful book that does a really good job introducing concepts, and you might find it useful as a supplement in some cases (don't get too bogged down in things you may not understand though).
This course used to be taught in Spring by a fantastic Professor named Jonathan Shewchuck. Here is a link to the course webpage from the last time he taught. Note that what he covered is really different in places from what we will cover (less focus on testing code, etc.). His lecture notes are very clear and well-written however, so if you want yet another possible supplement, they may be useful to you. Just like the 170 book though, don't freak out if you see something we didn't cover or that is at a higher level than what is expected of you.
Here is a visualization of some of the sorting algorithms we'll learn later this term. Also handy if you'd like to experience what an acid trip feels like. Seizure Warning!