“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

Please no AI! Or if you do use AI, Check the work please! Thank you!

(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…

(Dynamic Programming.) A group of friends is visiting a number of attractions located along a highway, starting at kilometre 0, placed at distances ɑ1 < A2 < ···