Question: import java.io.*; import java.util.*; public class MyHashSet { private int numBuckets; private Node[] buckets; // YOU MUST DESIGN THIS CLASS FOR PROJECT private int[] bucketSizes;
import java.io.*;
import java.util.*;
public class MyHashSet
{
private int numBuckets;
private Node[] buckets; // YOU MUST DESIGN THIS CLASS FOR PROJECT
private int[] bucketSizes;
private int idealBucketSize;
private int size; // # keys stored in set
public MyHashSet( int numBuckets, int idealBucketSize )
{ size=0;
this.numBuckets = numBuckets;
this.idealBucketSize = idealBucketSize;
bucketSizes = new int[numBuckets]; // OF KEYS IN EACH [i] BUCKET
}
public MyHashSet(int numBuckets)
{
size=0;
this.numBuckets = numBuckets;
buckets = new Node[numBuckets];
}
// KEYS ARE -NOT- REALLY BEING ADDED IN THIS LAB. JUST HASHED, AND BUCKET COUNTER INCREMENTED
public boolean add( String key )
{
int h = hashOf( key, numBuckets ); // h MUST BE IN [0..numBuckets-1]
++bucketSizes[h];
++size;
return true;
}
// RETURNS INT IN RANGE [0..numBuckets-1]
private int hashOf( String key, int numBuckets ) // h MUST BE IN [0..numBuckets-1]
{
return Math.abs(key.hashCode()) % numBuckets; // REPLACE WITH YOUR ALGORITHM
}
public void printStats()
{
System.out.format("#OfBucket: %d idealBucketSize: %d #OfKeysHashed: %d ", bucketSizes.length, idealBucketSize, size() );
if (bucketSizes.length
if (bucketSizes.length
int minBucketSize=bucketSizes[0], maxBucketSize=bucketSizes[0];
for (int i=0 ; i { if (bucketSizes.length if ( bucketSizes[i] > maxBucketSize ) maxBucketSize=bucketSizes[i]; else if ( bucketSizes[i] minBucketSize=bucketSizes[i]; } if (bucketSizes.length System.out.format("minBucketSize %dmaxBucketSize %d ",minBucketSize,maxBucketSize); System.out.format("stdDev %4.2fvar %4.2f ",stdDev(bucketSizes),variance(bucketSizes) ); } // Function for calculating variance double variance(int a[]) { int sum = 0; for (int i = 0; i sum += a[i]; double mean = (double)sum / (double)a.length; double sqDiff = 0.0; for (int i = 0; i sqDiff += (a[i] - mean) * (a[i] - mean); return sqDiff / a.length; } double stdDev(int a[]) { return Math.sqrt(variance(a)); } public int size() { return size; } } //END MYGRAPH CLASS I need help. is giving me this error MyHashSet.java:7: error: cannot find symbol private Node[] buckets; // YOU MUST DESIGN THIS CLASS FOR PROJECT ^ symbol:class Node location: class MyHashSet MyHashSet.java:22: error: cannot find symbol buckets = new Node[numBuckets]; ^ symbol:class Node location: class MyHashSet 2 errors I'm try to get this output![import java.io.*;import java.util.*; public class MyHashSet{ private int numBuckets; private Node[] buckets;](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/10/670fd5b5dc0c5_997670fd5b5bcd01.jpg)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
