BIG JAVA: LATE OBJECTS
2nd Edition
ISBN: 9781119626220
Author: Horstmann
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Question
Chapter 16, Problem 19PE
Program Plan Intro
Implementation of “remove()” operation
Program plan:
- In a file “HashSet.java”, import necessary packages, 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.
- Check the condition,
- Returns false.
- If it is true, assign the negative 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.
- Check the condition,
- 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.
- If it is true, assign the negative value.
- 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.
- Otherwise,
- If it is true, assign the next node value to the bucket.
- Check whether the previous node contains null value,
- Assign the current node value to the previous node value.
- Assign the next of the current node value to the current node.
- Check the condition,
- Return false.
- If it is true, assign the negative value.
- 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” that implements the 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.
- Check whether the bucket contains not null value,
- Returns false.
- Execute a loop,
- Check whether the current node and the next of the current node is not null,
- Define the method “next()”,
- Check whether the current node is not null value,
- If it is true, assign the current node value to the previous.
- Check whether the next reference of the current node is not null,
-
- Assign the next node value to the current node value.
-
-
- Otherwise,
- Call the method “moveToNext_Bucket()”.
- Otherwise,
-
-
- Assign the next node value to the current node value.
- Otherwise,
- Call the method “moveToNext_Bucket()”.
- Set the Boolean value to true.
- Return the current node value.
- Check whether the current node is not null value,
- Define the method “moveToNext_Bucket()”,
- Execute the following statement,
- Increment the index.
- Check the condition,
-
- Throw an exception “NoSuchElementException”.
-
-
- Assign the value.
-
-
- Throw an exception “NoSuchElementException”.
- Check the condition at the end of the loop.
- Execute the following statement,
- Define the method “remove()”,
- Execute for the Boolean value,
- Throw an exception “UnsupportedOperationException”.
- Check whether the previous is null value,
- Set the current node to null
- Set the index to “-1”.
- Call the method “removeFirst()”.
- Otherwise,
- Assign the current node value to the object variable.
- Assign the previous to the current node value.
- Call the method “remove()”.
- Decrement the size.
- Set the previous to null.
- Set the Boolean variable to false.
- Execute for the Boolean value,
- Define the method “removeFirst()”,
- Create a loop,
- Check whether the bucket contains not null value,
-
- If it is true, assign the next value to the bucket.
- Return nothing.
- Create a loop,
- Define the method “remove” with an argument of object parameter,
- Get the hash code.
- Check whether the hash code is less than “0”,
- If it is true, assign the negative value.
- Update the hash code.
- Set the bucket index.
- Create a node.
- Set the value to null.
- Execute a loop,
- Check the condition,
- Check whether the previous is null,
- If it is true, assign the next of the current node to the bucket.
- Otherwise, assign the next of the current node to the next of the previous node.
- Returns nothing.
- Check whether the previous is null,
- Assign the current node to the previous node.
- Set the current element.
- Check the condition,
- 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 “Tony” to the set.
- Create an iterator.
- Print the actual output.
- Execute a loop,
- Print the actual output.
- Print the symbol “]”.
- Print the expected output.
- Create an iterator.
- Call the method “next()”.
- Call the method “next()”.
- Call the method “remove()”.
- Create an iterator.
- Print the actual output.
- Execute a loop,
- Print the actual output.
- Print the symbol “]”.
- Print the expected output.
- Define the “main()” method,
Expert Solution & Answer

Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Please original work
In the progression from raw data to actionable knowledge, business analysts play a crucial role in transforming and interpreting data to support strategic decision-making.
What do you think are the most important skills a business analyst needs to effectively navigate the transition from data to information and then to knowledge?
How can organizations ensure that analysts are equipped to extract meaningful insights that drive informed decisions? Share examples or insights from your own experiences or studies.
Please cite in text references and add weblinks
Research enterprise network services commonly performed by Linux servers. Choose 3 and describe their function, as well as why they are typically set up on Linux machines.
The term color tone refers to the "temperature" of a photo.
Question 17Select one:
True
False
Chapter 16 Solutions
BIG JAVA: LATE OBJECTS
Ch. 16.1 - Prob. 1SCCh. 16.1 - Prob. 2SCCh. 16.1 - Prob. 3SCCh. 16.1 - Prob. 4SCCh. 16.1 - Prob. 5SCCh. 16.1 - Prob. 6SCCh. 16.1 - Prob. 7SCCh. 16.2 - Prob. 8SCCh. 16.2 - Prob. 9SCCh. 16.2 - Prob. 10SC
Ch. 16.2 - Prob. 11SCCh. 16.2 - Prob. 12SCCh. 16.3 - Prob. 13SCCh. 16.3 - Prob. 14SCCh. 16.3 - Prob. 15SCCh. 16.3 - Prob. 16SCCh. 16.3 - Prob. 17SCCh. 16.3 - Prob. 18SCCh. 16.4 - Prob. 19SCCh. 16.4 - Prob. 20SCCh. 16.4 - Prob. 21SCCh. 16.4 - Prob. 22SCCh. 16.4 - Prob. 23SCCh. 16.4 - Prob. 24SCCh. 16 - Prob. 1RECh. 16 - Prob. 2RECh. 16 - Prob. 3RECh. 16 - Prob. 4RECh. 16 - Prob. 5RECh. 16 - Prob. 6RECh. 16 - Prob. 7RECh. 16 - Prob. 8RECh. 16 - Prob. 9RECh. 16 - Prob. 10RECh. 16 - Prob. 11RECh. 16 - Prob. 12RECh. 16 - Prob. 13RECh. 16 - Prob. 14RECh. 16 - Prob. 15RECh. 16 - Prob. 16RECh. 16 - Prob. 17RECh. 16 - Prob. 18RECh. 16 - Prob. 19RECh. 16 - Prob. 20RECh. 16 - Prob. 21RECh. 16 - Prob. 22RECh. 16 - Prob. 23RECh. 16 - Prob. 24RECh. 16 - Prob. 25RECh. 16 - Prob. 26RECh. 16 - Prob. 1PECh. 16 - Prob. 2PECh. 16 - Prob. 3PECh. 16 - Prob. 4PECh. 16 - Prob. 5PECh. 16 - Prob. 6PECh. 16 - Prob. 7PECh. 16 - Prob. 8PECh. 16 - Prob. 9PECh. 16 - Prob. 10PECh. 16 - Prob. 11PECh. 16 - Prob. 12PECh. 16 - Prob. 13PECh. 16 - Prob. 14PECh. 16 - Prob. 15PECh. 16 - Prob. 16PECh. 16 - Prob. 17PECh. 16 - Prob. 18PECh. 16 - Prob. 19PECh. 16 - Prob. 20PECh. 16 - Prob. 21PECh. 16 - Prob. 1PPCh. 16 - Prob. 2PPCh. 16 - Prob. 3PPCh. 16 - Prob. 4PPCh. 16 - Prob. 5PPCh. 16 - Prob. 6PPCh. 16 - Prob. 7PPCh. 16 - Prob. 8PPCh. 16 - Prob. 9PPCh. 16 - Prob. 10PPCh. 16 - Prob. 11PPCh. 16 - Prob. 12PPCh. 16 - Prob. 13PPCh. 16 - Prob. 14PPCh. 16 - Prob. 15PPCh. 16 - Prob. 16PPCh. 16 - Prob. 17PP
Knowledge Booster
Similar questions
- You cannot add 3-dimensional effects to a shape. Question 18Select one: True Falsearrow_forwardWhich gallery shows available shapes for WordArt text? Question 10Select one: a. Transform b. Shape Styles c. Themes d. WordArt Stylesarrow_forwardWhen you press [Shift][Ctrl] while dragging a corner sizing handle on a graphic, the graphic is ____. Question 9Select one: a. resized while keeping the center position fixed and maintaining its proportions b. resized proportionally c. re-positioned diagonally d. resized diagonally while changing proportionallyarrow_forward
- What is the term used to describe trimming away part of a graphic to expose only some of it? Question 8Select one: a. Resizing b. Hiding c. Cropping d. Scalingarrow_forwardTo insert a SmartArt graphic in a document, click the SmartArt button in the _____ group on the Insert tab. Question 6Select one: a. Text b. Shapes c. Illustrations d. Pagesarrow_forwardBriefly define and discuss the following classes of problems: P, NP, NP-Complete, co-NP, NC, P-Complete.arrow_forward
- A3Q3.c - You are to write a C program that implements the following disk scheduling algorithms: a. FCFS [10 marks] b. SCAN [10 marks] c. C-SCAN [10 marks] d. SSTF [10 marks] e. LOOK [10 marks] f. C-LOOK [10 marks] • Your program will service a disk with 300 cylinders numbered 0 to 299. • • • • The program will service the requests (a list of 20 cylinder numbers) given in the file request.bin. This file contains (4 byte) integer values representing requests ranging from 0-299. Your program will take the initial position of the disk head as the first command line argument and the direction of the head as the second command line argument. It will then output the requests in the order in which they are serviced, and the total amount of head movements required by each algorithm. In particular, your program needs to do the following: Your program should take two command line arguments a) First command line argument - initial position of the disk head (an integer value) b) Second command line…arrow_forward2. The memory management has contiguous memory allocation, dynamic partitions, and paging. Compare the internal fragmentation and external fragmentation for these three approaches. [2 marks] 3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2), Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks] 1) Total # of pages ? 2) Total # of frames ? 3) Number of bits to represent logical address? 4) Number of bits to represent offset ? 5) Number of bits to represent physical address? 6) Number of bits to represent a page number? 7) Number of bits to represent a frame number / 4. What is translation look-aside buffers (TLBS)? Why we need them to implement the page table? [2 marks] 5. Why we need shared pages for multiple processes? Give one example to show the benefits. [2 marks] 6. How to implement the virtual memory by using page out and page in? Explain with an example. [2 marks] 7. We have a reference string of referenced page…arrow_forward8. 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]arrow_forward
- Is developed App in play store much easier than in app store because i look app like human anonymus and like walter labs prioritize iphone app store first is it difficult to developed app on play store ? And btw i want to move to iphone anroid suckarrow_forwardQ12- A three phase transformer 3300/400 V,has D/Y connected and working on 50Hz. The line current on the primary side is 12A and secondary has a balanced load at 0.8 lagging p.f. Determine the i) Secondary phase voltage ii) Line current iii) Output power Ans. (230.95 V, 99.11 A, 54.94 kW)arrow_forwardmake corrections of this program based on the errors shown. this is CIS 227 .arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education