Program Plan: Under the namespace MuralsRevenue and in class MuralsRevenue create a main method. Inside main method perform the following tasks. Create two arraysinteriorMuralCustomers and exteriorMuralCustomers of type string of dimension 2 * interiorMurals and 2*exteriorMurals respectively. Use for loop to read in names of customers and their talent codes for interior murals. Store each name along first row of array interiorMuralCustomers and each mural code along the second row. Use do-while loop inside this for loop to read only the valid mural codes until a right mural code is entered for each customer. Do same procedure for exterior mural customers as well. Next create variablesLcount, Scount, Acount, Ccount and Ocount to store the number of customers in each category. Use for loop to scan through both interiorMuralsCustomer and ExteriorMuralCustomers array and increment the values of above variables as per found category. Finally ask the user for a mural style category and use another for loop to list names in customer belonging to this category. Program Description: The main purpose of the program is to modify the MuralsRevenue program from previous chapter to get entry for names of each customer for both interior and exterior murals. Then show number of murals for each category of mural codes and also name customers as per mural codes.

Question

Could you fix this? My marker has commented, What's missing? The input list is the link below. https://gmierzwinski.github.io/bishops/cs321/resources/CS321_Assignment_1_Input.txt result.put(true, dishwasherSum); result.put(false, sinkSum); return result; }}

Answer 1

Question

Chapter 6, Problem 2CP

Program Plan Intro

Program Plan:

Under the namespace MuralsRevenue and in class MuralsRevenue create a main method. Inside main method perform the following tasks.

Create two arraysinteriorMuralCustomers and exteriorMuralCustomers of type string of dimension 2 * interiorMurals and 2*exteriorMurals respectively.

Use for loop to read in names of customers and their talent codes for interior murals. Store each name along first row of array interiorMuralCustomers and each mural code along the second row. Use do-while loop inside this for loop to read only the valid mural codes until a right mural code is entered for each customer.

Do same procedure for exterior mural customers as well.

Next create variablesLcount, Scount, Acount, Ccount and Ocount to store the number of customers in each category.

Use for loop to scan through both interiorMuralsCustomer and ExteriorMuralCustomers array and increment the values of above variables as per found category.

Finally ask the user for a mural style category and use another for loop to list names in customer belonging to this category.

Program Description:

The main purpose of the program is to modify the MuralsRevenue program from previous chapter to get entry for names of each customer for both interior and exterior murals. Then show number of murals for each category of mural codes and also name customers as per mural codes.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Could you fix this? My marker has commented, What's missing? The input list is the link below. https://gmierzwinski.github.io/bishops/cs321/resources/CS321_Assignment_1_Input.txt result.put(true, dishwasherSum); result.put(false, sinkSum); return result; }}

PLEG136: Week 5 Portofolio Project Motion to Compel

B A E H Figure 1 K Questions 1. List the shortest paths between all node pairs. Indicate the number of shortest paths that pass through each edge. Explain how this information helps determine edge betweenness. 2. Compute the edge betweenness for each configuration of DFS. 3. Remove the edge(s) with the highest betweenness and redraw the graph. Recompute the edge betweenness centrality for the new graph. Explain how the network structure changes after removing the edge. 4. Iteratively remove edges until at least two communities form. Provide step-by-step calculations for each removal. Explain how edge betweenness changes dynamically during the process. 5. How many communities do you detect in the final step? Compare the detected communities with the original graph structure. Discuss whether the Girvan- Newman algorithm successfully captures meaningful subgroups. 6. If you were to use degree centrality instead of edge betweenness for community detection, how would the results change?