Totaled columns. (Ending of sentence on attachment) please assist with Java code. Please attachment screenshot of successful output. Use a two-dimensional array to solve thefollowing problem. A company has foursalespeople (1 to 4) who sell five differentproducts (1 to 5). Once a day, each salespersonpasses in a slip for each different type of productsold. Each slip contains the following:1. a) The salesperson numbers2. b) The product numbers3. c) The total dollar value of that product soldthat dayThus, each salesperson passes in between 0 to 5sales slips per day. Assume that the informationfrom all of the slips for last week is available.Write a program that will read all this informationfor last's week sales and summarize the totalsales by salesperson by product. All totals shouldbe stored in the two-dimensionalarray sales. After processing all the informationfor last week, print the results in tabular formatwith each of the columns representing aparticular salesperson and each of the rowsrepresenting a particular product. Cross totaleach row to get the total sales of each product forlast week; cross total each column to get the totalsales by salesperson for last week. Your tabularprintout should include these cross totals to theright of the totaled rows and to the bottom of the

se a two- imensiona array to so vet e following problem. A company has four salespeople (1 to 4) who…

Answered: otaled columns. (Ending of sentence on…

otaled columns. (Ending of sentence on attachment) please assist with Java code. Please attachment screenshot of successful output.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Use a two-dimensional array to solve the following problem: A company has four salespeople (1 to 4) who sell five different products (1 to 5). Once a day, each salesperson passes in a slip for each type of product sold. Each slip contains the following: The salesperson numbers The product numbers The total ringgit value of that product sold that day Thus, each salesperson passes in between 0 and 5 sales slips per day. Assume that the information from all the slips for last month is available. Write a Cpp program that will read all this information for last month’s sales and summarize the total sales by salesperson and by product. All totals should be stored in the two-dimensional array sales. After processing all the information for last month, display the results in tabular format, with each column representing a salesperson each row representing a particular product. Cross-total each row to get the total sales of each product for last month. Cross-total each column to get the…
2. Use a two-dimensional (double-subscripted) array to solve the following problem: A company has four salespeople who sell five different products. Let each salesperson represent a row of your array and each product a column. You now have a 4 x 5 array. Once a day, each salesperson submits a slip for each different type of product he or she sold. Each slip contains: The salesperson’s number (1 to 4) (use this to get row subscript) The product number (1 to 5) (use this to get column subscript) The total dollar value of that product sold that day Thus, each salesperson submits from 0 to 5 sales slips per day (0, if they made no sales that day; and 5, if they sold every product that day). Your program will read a file that contains the information from all of the sales slips for the last month. Read until EOF. The file is named "productSales.txt". You need to create this file with at least 10 entries. Remember that the first number is the salesperson, the second number is the product,…
Suppose an array A contains 8 elements as follows: 77,33,X,11,88,Y,6, 15 Where: element X = last two digits of your roll number (e.g., if your roll number is 19106018, then X is 18; if your roll number is 19106001, then X is 1) element Y = last two digits of the number obtained by squaring X (c.g., squarc of X = 18 is 324,50 Y is 24; squarc of X =1 is I,s0 Y is 1). Write an algorithm for insertion sort and step by step ap algorithm on the above example array A.
Problem 3: Use a one dimensional array to solve the following problem: Read in 10 numbers, each of which is between 10 and 100. As each number is read, print it only if it’s not a duplicate of a number that has already been read. Provide for the “worst case,” in which all 10 numbers are different. Use the smallest possible array to solve the problem.
You are given an array A[1 : n] which includes the scores of n players in a game. They areranked in the following way: Rank of a player is an integer r if there are exactly r −1 distinct scores strictlysmaller than the score of this player (irrespective of the number of players). Question: Suppose you are additionally given an array B[1 : m] with the score of m new players. Design andanalyze an algorithm that given both arrays A and B, can find the rank of each player B inside thearray A, i.e., for each B[i], determines what would be the rank of B[i] in the array consisting of allelements of A plus B[i]. Your algorithm should run in O((n + m) ·log n) time.
Given two d-dimensional MBRs, E1 = (x1min, x1max; x2min, x2max; …; xdmin, xdmax) and E2 = (y1min, y1max; y2min, y2max; …; ydmin, ydmax) (note: both E1 and E2 are represented by an array in the code), please give the pseudo code to check whether or not two MBRs are intersecting with each other. If yes, please return true; otherwise, return false.
You have been given an array A of size N and an integer K. This array consists of N integers ranging from 1 to 10^7. Each element in this array is said to have a Special Weight. The special weight of an element a[i] is a[i]%K. You now need to sort this array in Non-Increasing order of the weight of each element, i.e the element with the highest weight should appear first, then the element with the second highest weight and so on. In case two elements have the same weight, the one with the lower value should appear in the output first. Input Format: The first line consists of two space separated integers N and K. The next line consists of N space separated integers denoting the elements of array A. Output Format: Print N space separated integers denoting the elements of the array in the order in which they are required. Constraints: 1≤N≤10^5 1≤A[i]≤10^7 1≤K≤10^7 Note: You need to print the value of each element and not their weight. SAMPLE INPUT 5 21 2 3 4 5 SAMPLE OUTPUT 1 3 5 2 4…
In a one-dimensional array, one-year average daily temperature information of the city of Karabük is kept. The average daily temperature information is between -25 and 35 degrees. Accordingly, write a function that takes this array as a parameter and finds the number of temperatures between [-25, -10), [-10, 5), [5, 20) and [20, 35] values and prints it to the screen in that order. Sample Output ( Example Output ): [-25, -10) : 13 [-10, 5) : 93 [5, 20) : 117 [20, 35] : 142
H3. Let S = [x1, x2, x3, ...xn], where n ≥ 5. How many ways can you choose five of the values in the array S, given that x1 = x2 = x3 and all other xi are distinct? The order of the chosen elements does not matter
Suppoce we're given numpy arrays of names and scores, where each row in the scores array lists the midterm and final scores for that respective student. For example, Carol has a 75 on the midterm and 99 on the final. names = np. array([ "Alice" "Bob". "Carol","Derek ","Erin"]) Scores = np.array([ [95, 98], [82, 88], [75, 99], [80, 90], 85, 82 ]]) Write function avgMidtermNoC that takes ve parameters names and score arrays, and returns the average score on the midterm, exduding anyone who's name starta with C.
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses were broken into on the same night. Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police. Example 1: Input: nums = [2,3,2] Output: 3 Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses.
Use a one-dimensional array to solve the following problem. Read in 20 numbers, each of which is between 10 and 100, inclusive. As each number is read, validate it and store it in the array only if it is not a duplicate of a number already read. After reading all the values, display only the unique values that the user entered. Provide for the “worst case” in which all 20 numbers are different. Use the smallest possible array to solve this problem.