Big Java, Binder Ready Version: Early Objects
Big Java, Binder Ready Version: Early Objects
6th Edition
ISBN: 9781119056447
Author: Cay S. Horstmann
Publisher: WILEY
Question
Book Icon
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.

Blurred answer
Students have asked these similar questions
this module is java 731 , follow all instructions and make sure the outputs are like what they expect and make sure the code is 100% correct . include all comments , layout and structure to be perfect too, thanks.    Question 1:  E-Hailing Bicycle Management System Case Study:An e-hailing company that rents out bicycles needs a system to manage its bicycles, users, and borrowing process. Each user can borrow up to 2 bicycles at a time, specifically for families with children 18 years or below. The system must track the bicycles (name, make, type, and availability) and users (name, ID, and borrowed bicycles). The company also wants to ensure that the system uses a multidimensional array to store information about the bicycles. Requirements: Add and View Bicycles: Borrow Bicycles: Return Bicycles Display Borrowed Bicycles and Search for a bicycle Create a menu-driven program to implement the above. Sample Output: Add Bicycle View All Bicycles Borrow Bicycle Return…
Add a method called transfer () to the BankAccount class, that takes in an amount and destinationAccount as input and transfer the funds from current account to destination account. This method should return the balance of the current account after the transfer, also should check for the sufficient balance in current account before proceeding the transfer and if there is insufficient balance return an error message "Insufficient balance". Modify the BankAccount Test class, so that it calls the transfer () method and prints the balance after transfer. Make sure that the transfer() method updates the balance of both the current account and the destination account.
• Create a public method called deposit() that takes in an amount of type double as input and adds the amount to the current balance. This method should also return the updated balance. • Create another public method called withdraw() that takes in an amount of type double as input, checks if the withdrawal amount is less than the current balance, and if so, subtracts the amount from the balance. If the withdrawal amount is greater than the current balance, the method should return an error message "Insufficient balance". • Create a public method getAccountInfo() that returns the account information in the format "Account Number: xxxxx, Account Holder: John Doe, Account Type: SAVINGS/CHECKING, Balance: $xxxX.XX". • Finally, create a constructor method that takes in the account number, account holder name, initial balance and account type as input and initializes the corresponding instance variables. In the BankAccount class, make sure to use the private access modifier for the instance…

Chapter 16 Solutions

Big Java, Binder Ready Version: Early Objects

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education