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

Good mrng, please solve this trying to follow this criteria. (use Keil) Abstract describing the requirements and goals of the assignment. List file with no errors or warnings. Brief description of your implementation design and code. Debugging screen shots for different scenarios with your reference and comments. Conclusion (and please give me the code without errors, make sure it is working)

#include <stdio.h> #include <stdlib.h> #include <unistd.h> int global_var = 42; // int* function(int *a) { int local_var = 10; // *a = *a + local_var; int *local_pointer = (int *)malloc (size of (int) * 64); // Allocated array with 64 integers return local_pinter; } int main() { int local_main[1024*1024*1024*1024*1024] = {0}; // initialize an array and set all items as 0 int *heap_var = (int *)malloc(size of(int) * 16); // Allocated array with 16 integers *heap_var = 100; function(heap_var); printf(“the value is %d\n”, *heap_var); free(heap_var); // release the memory return 0; } 1) draw the memory layout of the created process, which should include text, data, heap and stack [2 marks]. 2) Indicate which section the variables are allocated [2 marks]: global_var local_var, local_pointer local_main heap_var, *heap_var (the data that it points to) 3) Does this code have memory leaking (heap memory is not released)? [2 marks] 4) The…

8. List three HDD scheduling algorithms. [2 marks] 9. True or False? The NVM has the same scheduling algorithms with HDD. Explain why? [2 marks] 10. Why the modern mouses use polling to detect movements instead of interrupts? [2 marks] 11. What is thrashing? How does it happen? [2 marks] 12. Given a reference string of page numbers 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 and 4 frames show how the page replacement algorithms work, and how many page faults? [6 marks], 1) FIFO algorithm? [2 marks] 2) Optimal algorithm? [2 marks] 3) LRU algorithm? [2 marks] 13. List at least three file systems that you know. [2 marks] 14. In C programming, how the seek to a specific position in the file by offset? [2 marks]