Chapter 27, Problem 27.11PE

Program Plan Intro

Set operations in MyHashSet

Program Plan:

• Include a class name named “Exercise_11”.
  • Import util package.
  • Declare the main() method.
  • Declare constructor.
  • Create array for string names.
  • Take user inputs and add into respective arrays.
  • Create new Hashset.
  • Add elements from set1 into set2.
  • Remove all elements present in set1 from set 2.
  • Retain elements present in set2 and set1.
  • Check if set1 and set2 contains same elements.
  • Close the main() method.
  • Close the class.
• Include a static class “MyHashSet”.
  • Define the default hash table size. Must be a power of 2.
  • Define the maximum hash table size. 1 << 30 is same as 2^30.
  • Declare current hash table capacity. Capacity is a power of 2.
  • Define default load factor.
  • Specify a load factor threshold used in the hash table.
  • Declare a Hash table that is an array with each cell that is a linked list.
  • Declare a constructor to Construct a set with the default capacity and load factor.
  • Declare a constructor to Construct a set with the specific capacity and load factor.
  • Declare an override method that Remove all elements from this set.
  • Declare an override method that Return true if the element is in the set.
  • Declare an override method that adds an element to the set.
  • Create a linked list for the bucket if it is not created.
  • Declare an override method that Remove the element from the set.
  • Declare an override method that Return the number of elements in the set.
  • Declare an override method to return the number of iterators.