Chapter 16, Problem 20PE

Program Plan Intro

Implementation of hash set using MAD method

Program plan:

• In a file “HashSet.java”, import necessary packages, and create a class “HashSet”,
  • Declare the array of “Node” type.
  • Declare the necessary variables.
  • Create a random number.
  • Define the constructor to create a hash table.
    • Create an array and set the current size to “0”.
    • Compute the value for “p”.
    • Execute a loop,
      • Increment the value of “p”.
    • Compute the value for “a”, and “b”.
  • Define the method “isPrime()” to test whether the value passed is prime or not.,
  • Define the method “contains()”,
    • Assign the hash code.
    • Check whether the value is less than “0”,
      • If it is true, assign the negative value.
    • Update the hash value.
    • Assign the bucket value to the current node.
    • Execute loop till array becomes null,
      • Check the condition,
        • Return true.
        • • Assign the current value.
    • Returns false.
  • Define the method “add()” to add the element to the set,
    • Get the hash code.
    • Check whether the value is less than “0”,
      • If it is true, assign the negative value.
    • Update the hash code.
    • Assign the bucket value at the hash code to the current node.
    • Execute a loop,
      • Check the condition,
        • Return false.
        • • Assign the next value to the current node.
    • Create a new node.
    • Assign the value to new node value.
    • Assign the value to the next node.
    • Assign the new node value to the bucket.
    • Increment the size.
    • Return true.
  • Define the method “remove()” to remove the object from the set,
    • Get the hash code.
    • Check whether the value is less than “0”,
      • If it is true, assign the negative value.
    • Update the hash code.
    • Assign the hash code value to the current node.
    • Set null to the previous node.
    • Execute a loop,
      • Check the condition,
        • Check whether the previous node contains null value,
        • • If it is true, assign the next node value to the bucket.
        • Otherwise,
        • • Assign the next of the current node value to the next of the previous node value.
        • Decrement the size.
        • Return true.
        • • • Assign the current node value to the previous node value.
            • Assign the next of the current node value to the current node.
    • Return false.
  • Define the method “iterator ()” to return an iterator that traverse the set elements,
    • Return the object of “HashSetIterator”.
  • Define the method “size ()” to return the size of the set.
  • Create a class “Node”,
    • Declare the object for “Object”.
    • Declare the object of “Node”.
  • Define the method “toString()”,
    • Declare the string variable.
    • Create a loop,
      • Concatenate with “[“.
      • Assign the bucket value to the current node.
      • Execute a loop,
        • Check the condition,
          • If it is true, update the resultant string.
        • Otherwise,
          • Update the resultant string with space.
      • Concatenate the string with “]” and “\n”.
    • Returns the resultant string.
• Create a class “HashSetIterator” that implements an interface “Iterator”,
  • Declare the necessary variables.
  • Define the constructor to create a hash set that point to the first element of the hash set.
  • Define the method “hasNext()”,
    • Check whether the current node and the next of the current node is not null,
      • If it is true, returns true.
      • • • Execute a loop,
            • Check whether the bucket contains not null value,
              • If it is true, returns true.
          • Returns false.
  • Define the method “next()”,
    • Check the condition,
      • Assign the next node value to the current node value.
    • Otherwise,
      • Execute the following statement,
        • Increment the index.
        • Check the condition,
          • Throws an exception “NoSuchElementException”.
        • Assign the value.
      • Check the condition at the end of the loop.
    • Return the current node value.
  • Define the method “remove()”,
    • Throw an exception “UnsupportedOperationException”.
• In a file “HashSetTest.java”, import necessary package, and create a class “HashSetTest”,
  • Define the “main()” method,
    • Create an object for “HashSet”.
    • Add the element “Harry” to the set.
    • Add the element “sue” to the set.
    • Add the element “Nina” to the set.
    • Add the element “Susannah” to the set.
    • Add the element “Larry” to the set.
    • Add the element “Eve” to the set.
    • Add the element “Sarah” to the set.
    • Add the element “Adam” to the set.
    • Add the element “Tony” to the set.
    • Add the element “Katherine” to the set.
    • Add the element “Juliet” to the set.
    • Add the element “Romeo” to the set.
    • Print the structure of the hash table.