Implementation of hash set Program plan: In a file “HashSet.java”, import necessary package, and create a class “HashSet”, Declare the array of “Node” type. Declare the necessary variable. Define the constructor to create a hash table. Create an array and set the current size to “0”. 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 current node value. Execute loop till array becomes null, Check the condition, Return true. Assign the current value. 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 hash code value to the current node. Execute a loop, Check the condition, Return false. Assign the next value to the value in 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”. Create a class “HashSetIterator”, 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 “asNext()”, Check whether the next node contains null, If it is true, returns true. Check whether the current node and the next of the current node is not null, Assign the next of the current node value to the next node. Return true. Execute a loop, Check whether the bucket contains not null value, If it is true, assign the bucket value to the next node. Assign the value to the bucket. Returns true. Returns false. Define the method “next()”, Check the condition, Throw an exception “NoSuchElementException”. Assign the next node value to the current node value. Assign the null value to the next node. 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 fro “HashSet”. Add the element “Tom” to the set. Add the element “Jerry” to the set. Add the element “Nick” to the set. Add the element “James” to the set. Add the element “Johny” to the set. Add the element “David” to the set. Add the element “Else” to the set. Add the element “Joy” to the set. Add the element “Francis” to the set. Add the element “Jenny” to the set. Add the element “Casendra” to the set. Add the element “Juliet” to the set. Remove the element “Juliet” from the set. Remove the element “Jaen” from the set. Create Iterator. Execute a loop, Print the next element in the set.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 17PE

Program Plan Intro

Implementation of hash set

Program plan:

In a file “HashSet.java”, import necessary package, and create a class “HashSet”,

Declare the array of “Node” type.

Declare the necessary variable.

Define the constructor to create a hash table.

Create an array and set the current size to “0”.

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 current node value.

Execute loop till array becomes null,

Check the condition,

Return true.

Assign the current value.

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 hash code value to the current node.

Execute a loop,

Check the condition,

Return false.

Assign the next value to the value in 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”.

Create a class “HashSetIterator”,

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 “asNext()”,

Check whether the next node contains null,

If it is true, returns true.

Check whether the current node and the next of the current node is not null,

Assign the next of the current node value to the next node.

Return true.

Execute a loop,

Check whether the bucket contains not null value,

If it is true, assign the bucket value to the next node.

Assign the value to the bucket.

Returns true.

Returns false.

Define the method “next()”,

Check the condition,

Throw an exception “NoSuchElementException”.

Assign the next node value to the current node value.

Assign the null value to the next node.

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 fro “HashSet”.

Add the element “Tom” to the set.

Add the element “Jerry” to the set.

Add the element “Nick” to the set.

Add the element “James” to the set.

Add the element “Johny” to the set.

Add the element “David” to the set.

Add the element “Else” to the set.

Add the element “Joy” to the set.

Add the element “Francis” to the set.

Add the element “Jenny” to the set.

Add the element “Casendra” to the set.

Add the element “Juliet” to the set.

Remove the element “Juliet” from the set.

Remove the element “Jaen” from the set.

Create Iterator.

Execute a loop,

Print the next element in the set.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

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…

Create a BankAccount Test class that contains a main() method that instantiates an object of type BankAccount, with account number of 12345, account holder name of "John Doe", initial balance of $1000 and account type as SAVINGS . Then use the deposit() and withdraw() methods of the object to deposit $500 and withdraw $300. Finally, use the getAccountInfo() method to print the current account information. Use the getAccountInfo() method to verify that the deposit and withdrawal actions are performed correctly and that the account information is updated accordingly.