EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
6th Edition
ISBN: 8220102010314
Author: Horstmann
Publisher: YUZU
Question
Book Icon
Chapter 18, Problem 9PE
Program Plan Intro

HashSet

Program plan:

Filename: “HashSet.java”

This code snippet creates a class “HashSet”. In the code,

  • Import the required packages.
  • Define a class “HashSet”.
    • Declare an array list “buckets”.
    • Define an integer “size”.
    • Define the constructor “HashSet()”.
      • Define the array list “buckets”.
      • Iterate a “for” loop,
        • Add “null” to the “bucket”.
      • Set “size” equal to “0”.
    • Define a method “contains”.
      • Define a variable “h” by calling “hashCode()” using “x”.
      • If the value of “h” is less than 0,
        • Set “h” equal to “-h”.
      • Find the reminder of “h” and size of the “buckets”.
      • Create a node “current” by getting element from “bucket”.
      • Iterate a “while” loop,
        • If the “data” part of node “current” is not equal to “x”.
          • Return “true”.
            • Set “current” equal to link of “current”.
      • Return the value “false”.
    • Define the method “add()”.
      • Define a variable “h” by calling “hashCode()” using “x”.
      • If the value of “h” is less than 0,
        • Set “h” equal to “-h”.
      • Find the reminder of “h” and size of the “buckets”.
      • Create a node “current” by getting element from “bucket”.
      • Iterate a “while” loop,
        • If the “data” part of node “current” is not equal to “x”.
          • Return “true”.
            • Set “current” equal to link of “current”.
      • Return the value “false”.
      • Create a new node “newNode”.
      • Set “data” of “newNode” equal to “x”.
      • Set “next” of “newNode” equal to element at “h” of “bucket”.
      • Set “newNode” at position “h” of the bucket.
      • Increment the “size” by 1.
      • Return “true”.
    • Define the method “remove()”.
      • Define a variable “h” by calling “hashCode()” using “x”.
      • If the value of “h” is less than 0,
        • Set “h” equal to “-h”.
      • Find the reminder of “h” and size of the “buckets”.
      • Create a node “previous”.
      • Create a node “current” by getting element from “bucket”.
      • Iterate a “while” loop,
        • If the “data” part of node “current” is not equal to “x”.
          • If “previous” equal to “null”,
            • Set “next” of “current” to “h”.
          • Else,
            • Set the “next” of “current” to “next” of “previous”.
          • Decrement “size” by 1.
          • Return “true”.
              • Set “previous” equal to “current”.
              • Set “current.next” to “current”.
      • Return “false”.
    • Define the method “Iterator”.
      • Create new “HashSetIterator” and return the value.
    • Define the method “size()”.
      • Return “size”.
    • Define a class “Node”.
      • Create a variable “data” of type “E”.
      • Create a variable “next”.
    • Define a class “HashSetIterator”.
      • Declare the class members.
      • Define the constructor “HashSetIterator()”.
        • Set the values of class members.
      • Define a method “hasNext()”.
        • If “current” and “current.next” are not equal to null,
          • Return true.
              • Iterate a “for” loop,
                • If element at “b” of “buckets” is not equal to “null”,
                  • Return “true”.
              • Return “false”.
      • Define a method “next()” with return type “E”.
        • Set “previous” equal to “current”.
        • Set “previousBucket” equal to “bucket”.
        • If “current” and “current.next” are not equal to null,
          • Increment “bucket” by 1.
          • Iterate a “while” loop,
            • Increment “bucket” by 1.
                • If “bucket” less than size of the “bucket”.
                  • Set the value of “current”.
                • Else,
                  • Throw an exception
              • Else,
                • Set “current” equal to “current.next”.
              • Return “data” of “current”.
      • Define a method “remove()”.
        • If “previous” and “previous.next” are not equal to null,
          • Set “previous.next” equal to “current.next”.
              • If “previousBucket” is less than “bucket”,
                • Set “bucket” equal to “current.next”.
              • Else,
                • Throw an exception.
              • Set “current” equal to “previous”.
              • Set “bucket” equal to “previousBucket”.

Filename: “HashSetDemo.java”

This code snippet creates a class “HashSetDemo”. In the code,

  • Import the required packages.
  • Define a class “HashSetDemo”.
    • Define the “main” method.
    • Define a “HashSet” “names”.
    • Add values to “names” using “add()”.
    • Create an “Iterator” named “iter”.
    • Iterate a “while” loop,
      • Print values of “names”.

Blurred answer
Students have asked these similar questions
What are the major threats of using the internet? How do you use it? How do children use it? How canwe secure it? Provide four references with your answer. Two of the refernces can be from an article and the other two from websites.
Assume that a string of name & surname is saved in S. The alphabetical characters in S can be in lowercase and/or uppercase letters. Name and surname are assumed to be separated by a space character and the string ends with a full stop "." character. Write an assembly language program that will copy the name to NAME in lowercase and the surname to SNAME in uppercase letters. Assume that name and/or surname cannot exceed 20 characters. The program should be general and work with every possible string with name & surname. However, you can consider the data segment definition given below in your program. .DATA S DB 'Mahmoud Obaid." NAME DB 20 DUP(?) SNAME DB 20 DUP(?) Hint: Uppercase characters are ordered between 'A' (41H) and 'Z' (5AH) and lowercase characters are ordered between 'a' (61H) and 'z' (7AH) in the in the ASCII Code table. For lowercase letters, bit 5 (d5) of the ASCII code is 1 where for uppercase letters it is 0. For example, Letter 'h' Binary ASCII 01101000 68H 'H'…
What did you find most interesting or surprising about the scientist Lavoiser?
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