CS61B HOMEWORK 6

Week Lab Homework 25 August No lab. You might also consider skimming the reference documents for this lab before coming to lab though this is not required: There is no standard format required for your results, and there is no required number of data points. Testing was “by hand”, controlled from the makefile, rather than using JUnit. Project 2 slides here. The one thing of interest here is the more sophisticated compression function mentioned in the spec.

Project 3 slides here. As references, you might find the following resources useful:. So, testing with String keys and relying on the default hashCode methods will not make the utility of the more sophisticated compression function apparent. Getting started video available here. Packages and building large programs. Record your results in speedTest. Slides for videos here.

CS 61B Labs and Homework, Fall

Look closely at LinkedListStringSet to see how this class achieves the ability to be instantiated as an initially empty set.

You are commenting using your Twitter account.

cs61b homework 6

For example, it might insert “cow”, “cox”, “coy”, “coz”, “cpa”, “cpb”, Week Lab Homework 25 August No lab. The one thing of interest here is the more sophisticated compression function mentioned in the spec.

CS 61B Labs and Homework

Homweork references, you might find the following resources useful:. You might also consider skimming the reference documents for this lab before coming to lab though this is not required: Our submission software enforces some of these guidelines automatically, using the style61b programwhich you can also run separately.

  BRUNEL UNIVERSITY LATE COURSEWORK SUBMISSION

Debugging and linked data structures. This makes them easy to print or look at in a debugger.

Basic Java Syntax Due: All of the above, and the dependencies: Implement HashTableChained The one thing of interest here is the more sophisticated compression function mentioned in the spec. Notify me of new comments via email. It works by asking the user for an input size N, then generates N strings of length 10 and inserts them into the set.

cs61b homework 6

Please report errors in the labs to your TA, or, if working from home, simply mail to cs61b cs. Testing was “by hand”, controlled from the makefile, rather than using JUnit. Things were a bit different then.

For this assignment, you’ll create a BST based implementation of the StringSet interface, which provides an abstraction for sets that contain Strings. To keep things simple, your set will only allow put and contains operations. To implement the interface, you’ll be working completely from scratch, with no skeleton code.

Berkeley CS61B homework 6

Packages and building large programs. Notify me of new posts via email. Getting started video here. Basic Java Syntax part 2 Optional.

  BUSINESS PLAN ZORGHOTEL

By continuing to use this website, you agree to their use. Slides for videos here. So, testing with String keys and relying on the default hashCode methods will not make the utility of the more sophisticated compression function apparent. Some tests will behave equally well with either function, some will show significant improvement with the more sophisticated one. If you homeworkk anthing interesting hopefully you xs61bthen you should explain this interesting thing.

Berkeley CS61B homework 6 | Got-fu?

Emacs documentationSimple Unix usageVersion control with the ‘hw’ command. The Iterator and Iterable interfaces. Instead of inserting random strings, it should insert strings in increasing lexicographic order.

You get to re-use the solution of hw5 here to act as the Chained part of the Chained Hash Table. To find out more, including how to control cookies, see here: Try it out and see how your data structure scales with N compared to the naive and industrial strength implementations.