Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
Question
Book Icon
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.

Blurred answer
Students have asked these similar questions
Why is Linux popular? What would make someone choose a Linux OS over others? What makes a server? How is a server different from a workstation? What considerations do you have to keep in mind when choosing between physical, hybrid, or virtual server and what are the reasons to choose a virtual installation over the other options?
Objective  you will: 1. Implement a Binary Search Tree (BST) from scratch, including the Big Five (Rule of Five)  2. Implement the TreeSort algorithm using a in-order traversal to store sorted elements in a vector. 3. Compare the performance of TreeSort with C++'s std::sort on large datasets. Part 1: Understanding TreeSort How TreeSort Works TreeSort is a comparison-based sorting algorithm that leverages a Binary Search Tree (BST): 1. Insert all elements into a BST (logically sorting them). 2. Traverse the BST in-order to extract elements in sorted order. 3. Store the sorted elements in a vector.  Time Complexity Operation                                Average Case     Worst Case (Unbalanced Tree)Insertion                                     0(1log n)                0 (n)Traversal (Pre-order)                  0(n)                       0 (n)Overall Complexity                  0(n log n)                 0(n^2) (degenerated tree) Note: To improve performance, you could use a…
I need help fixing the minor issue where the text isn't in the proper place, and to ensure that the frequency cutoff is at the right place. My code: % Define frequency range for the plot f = logspace(1, 5, 500); % Frequency range from 10 Hz to 100 kHz w = 2 * pi * f; % Angular frequency   % Parameters for the filters - let's adjust these to get more reasonable cutoffs R = 1e3; % Resistance in ohms (1 kΩ) C = 1e-6; % Capacitance in farads (1 μF)   % For bandpass, we need appropriate L value for desired cutoffs L = 0.1; % Inductance in henries - adjusted for better bandpass response   % Calculate cutoff frequencies first to verify they're in desired range f_cutoff_RC = 1 / (2 * pi * R * C); f_resonance = 1 / (2 * pi * sqrt(L * C)); Q_factor = (1/R) * sqrt(L/C); f_lower_cutoff = f_resonance / (sqrt(1 + 1/(4*Q_factor^2)) + 1/(2*Q_factor)); f_upper_cutoff = f_resonance / (sqrt(1 + 1/(4*Q_factor^2)) - 1/(2*Q_factor));   % Transfer functions % Low-pass filter (RC) H_low = 1 ./ (1 + 1i * w *…

Chapter 16 Solutions

Big Java Late 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