“GroupHolder” class Program Plan: Import required package. Define “Main” class. Define “GroupHolder” class Create an array list “items” from “GroupHolder” class. Method definition for “findGroupNodeFor” Declare variable using “GroupNode” type. Set node “n” to “null”. Set “found” to “false”. Check condition using “while” loop Compute next node. If “n” equal to “s”, then set “found” to “true”. If found, then returns the value of “n”. Otherwise, returns null. Method definition of “addItem”. Call “findGroupNodeFor” method and store it to a variable “n”. If “n” is null, then add it to “items”. Method definition for “getRepresentative”. Call “findGroupNodeFor” method and store it to a variable “n”. Check condition using “while” loop. Set node to link value at node Finally returns the data at node. Method definition of “getAllRepresentatives”. Create an array list. Add data to “items”. Finally returns the result. Method definition of “inSameGroup”. Assign representative for string “s1” and store result to “r1”. Assign representative for string “s2” and store result to “r2”. Returns result. Method definition of “union” Assign representative for string “s1” and store result to “r1”. Assign representative for string “s2” and store result to “r2”. Check condition. Find group node for “r1” and “r2”. Create “GroupNode” class. Declare required variables. Create constructor for “GroupNode” class. Create parameterized for “GroupNode” class. Define main function. Create object “g” from “GroupHolder” class. Add item to “g” by calling the method “addItem”. Display groups by calling the method “getAllRepresentatives”. Join groups by calling the method “union”. Display groups after performing unions operations. Check “a” and “e” is in same group by calling method “inSameGroup”. Check “a” and “f” is in same group by calling method “inSameGroup”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 10PP

Program Plan Intro

“GroupHolder” class

Program Plan:

Import required package.

Define “Main” class.

Define “GroupHolder” class

Create an array list “items” from “GroupHolder” class.

Method definition for “findGroupNodeFor”

Declare variable using “GroupNode” type.

Set node “n” to “null”.

Set “found” to “false”.

Check condition using “while” loop

Compute next node.

If “n” equal to “s”, then set “found” to “true”.

If found, then returns the value of “n”.

Otherwise, returns null.

Method definition of “addItem”.

Call “findGroupNodeFor” method and store it to a variable “n”.

If “n” is null, then add it to “items”.

Method definition for “getRepresentative”.

Call “findGroupNodeFor” method and store it to a variable “n”.

Check condition using “while” loop.

Set node to link value at node

Finally returns the data at node.

Method definition of “getAllRepresentatives”.

Create an array list.

Add data to “items”.

Finally returns the result.

Method definition of “inSameGroup”.

Assign representative for string “s1” and store result to “r1”.

Assign representative for string “s2” and store result to “r2”.

Returns result.

Method definition of “union”

Assign representative for string “s1” and store result to “r1”.

Assign representative for string “s2” and store result to “r2”.

Check condition.

Find group node for “r1” and “r2”.

Create “GroupNode” class.

Declare required variables.

Create constructor for “GroupNode” class.

Create parameterized for “GroupNode” class.

Define main function.

Create object “g” from “GroupHolder” class.

Add item to “g” by calling the method “addItem”.

Display groups by calling the method “getAllRepresentatives”.

Join groups by calling the method “union”.

Display groups after performing unions operations.

Check “a” and “e” is in same group by calling method “inSameGroup”.

Check “a” and “f” is in same group by calling method “inSameGroup”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

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…

2. 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…

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]