“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

For any element in keysList with a value greater than 100, print the corresponding value in itemsList, followed by a space. Ex: If keysList = {42, 105, 101, 100} and itemsList = {10, 20, 30, 40}, print: 20 30 Since keysList.at(1) and keysList.at(2) have values greater than 100, the value of itemsList.at(1) and itemsList.at(2) are printed. #include <iostream>#include <vector>using namespace std; int main() {const int SIZE_LIST = 4;vector<int> keysList(SIZE_LIST);vector<int> itemsList(SIZE_LIST);unsigned int i; for (i = 0; i < keysList.size(); ++i) {cin >> keysList.at(i);} for (i = 0; i < itemsList.size(); ++i) {cin >> itemsList.at(i);} /* Your solution goes here */ cout << endl; return 0;} Please help me with this problem using c++.

How is a map different from other Java data structures? A Each data element connects to the next element in the map. B It's a data structure that stores data pairs: keys and their associated values. C Each data element can connect to multiple related elements in a map. D It's a data structure that keeps its data sorted.

Please solve this question in JAVA| Write a Java program that asks the user to enter items until the user chooses to stop, stores them into links (nodes), and chains the links together into a linked list. You will need to make the following changes: • Your linked list should store information about Customers' Transactions that contain three fields: customer name (string), customer number (int), and transaction description (string). • Instead of putting all of your code inside the main source code file, you should create the following functions: 1. addToStart(Item x) 2. addToEnd(Item x) 3. insertAt(Item x, int n) 4. remove(int customer_number) 5. reverse) 6. printList) Instead of simply asking the user if they want to add a new link, your main program should offer the user a menu of options: 1. Add a new link to the end 2. Add a new link to the beginning 3. Insert an element at index n into the list. 4. Remove a link from the list 5. Reverse the list 6. Print out the entire list 7. Quit…