# Berkeley CS61B homework 6

Course: Berkeley’s CS 61B: Data Structures. Homework 6: Hash Tables, Hash Functions, Compression Functions Homework 6 (mirror) is due before lecture 25: …

Course: Berkeley’s CS 61B: Data Structures. Homework 6: Hash Tables, Hash Functions, Compression Functions Homework 6 (mirror) is due before lecture 25: …

Course: Berkeley’s CS 61B: Data Structures. Homework 5: Safer doubly linked lists and sets Homework 5 (mirror) is due before lecture 19: …

Course: Berkeley’s CS 61B: Data Structures. Homework 4: Doubly linked lists and inheritance Homework 4 (mirror) is due before lecture 16: Game …

Course: Berkeley’s CS 61B: Data Structures. Lab 5: Practice with Java Inheritance and Java Interfaces Lab 5 (mirror) gives you needed insight into …

Course: Berkeley’s CS 61B: Data Structures. Project 1: Sharks and Fish Project 1 (mirror) is due before lecture 14. For project 1 you …

Course: Berkeley’s CS 61B: Data Structures. Homework 3 Homework 3 (mirror) is due before lecture 9. Goal: get your feet wet with …

Course: Berkeley’s CS 61B: Data Structures. Homework 2 Homework 2 (mirror) is due before lecture 6. One problem about Date manipulations. […] Your task …

Course: Berkeley’s CS 61B: Data Structures. Homework 1 Homework 1 (mirror) is due before Lecture 4. Two introductory problems about String manipulations. …

Pascal’s Triangle is mentioned in Berkeley’s CS61B lecture 5 (around ~39:00 and up). I just watched it and it inspired …

Berkeley’s CS61B as taught by Prof. Jonathan Shewchuk: Fall 2006 Course Site: http://www.cs.berkeley.edu/~jrs/61bf06/ Video Lectures (Fall 2006): http://www.youtube.com/playlist?list=PL4BBB74C7D2A1049C&feature=plcp This course comes with Lecture …