A school has five classes (called Class 1, Class 2 etc) and they are selling boxes of cookies for a fundraiser. Your program accepts input (class number followed by number of boxes sold)…there are ten lines of input. Method getInput will collect this input and load and return an array of length 5, so that the total number of boxes sold by Class 1 is in the first element, the total for Class 2 is in element 1 etc. Method printOutput then outputs the result. In java ple

A school has five classes (called Class 1, Class 2 etc) and they are selling boxes of cookies for a fundraiser. Your program accepts input (class number followed by number of boxes sold)…there are ten lines of input. Method getInput will collect this input and load and return an array of length 5, so that the total number of boxes sold by Class 1 is in the first element, the total for Class 2 is in element 1 etc. Method printOutput then outputs the result. In java ple

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

Suppose that you are playing a card game whose goal is to collect exactly k cards with a total value of t. Write a solution that can determine if it is possible for a given collection of cards whose values are given in the array values. For example, if the array contained the values <10,5,7,2>, k = 3, and t = 12, you would return false because no three values add to 12. However, if t = 14, you would return true, since 5 + 7 + 2 = 14. So I considered this to be a form of groupSum recursion, so I try to implement it in recursion form. However, since the passing parameters are not the incrementing level index but 'k' that is the limit number of the numbers we can choose from the array, I cannot use passing index through recursion to search from the start of the array toward the end of the values.length(the length of the array). would there be any method I can use to increment and search along the array using k, the number of numbers we can add into the total(t) instead of the…
Write a program that declares an array of 15 integers and reads the values from the user. Make sure that the user doesn’t enter a value greater than 10 (if the user enters a value not in the allowed range, discard that value and read another to put into the array). Now tell the number that occur maximum number of times in the array. For example for the following 7 has maximum occurrence. 4,7,3,3,2,7,1,5,7,9,9,9,7,8,10 Use both linear and binary search.
FOR JAVA // Question is the first one, try to solve it by using the second question. Repeat the second question, but if there are multiple occurrences of the number, your program must return the largest index instead of the small- est. Write a method that takes a one dimensional integer array and an integer, and returns the index of the integer in the array. If the integer is not in the array, your program must return -1. If there are multiple occurrences of that number, your program must return the smallest index.
FOR JAVA Write a method that takes a one dimensional integer array and an integer, and returns the index of the integer in the array. If the integer is not in the array, your program must return -1. If there are multiple occurrences of that number, your program must return the smallest index.
The rotateLeft method takes an array of integers, and an integer number of places, and returns a new copy of the array that contains a "rotated" version of the input array. Rotation means that elements have been shifted leftwards by that number of places, moving elements off one end of the array and onto the other end. For example, [11, 12, 13, 14, 15] rotated left by 2 places results in [13, 14, 15, 11, 12].
FOR JAVA Write a method that takes a one dimensional integer array and an integer, and returns the index of the integer in the array. If the integer is not in the array, your program must return -1. If there are multiple occurrences of that number, your program must return the smallest index. Repeat the second question, but if there are multiple occurrences of the number, your program must return the largest index instead of the small- est.
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…
You are given an int variable k, an int array zipcodeList that has been declared and initialized, an int variable nZips that contains the number of elements in zipcodeList, and a bool variable duplicates. Write some code that assigns true to duplicates if there are two adjacent elements in the array that have the same value, and that assigns false to duplicates otherwise. Use only k, zipcodeList, nZips, and duplicates. duplicates = false; for (k=0; !duplicates && k<nZips-1; k++)if (zipcodeList[k] == zipcodeList[k+1]) duplicates = true;
Write a test program that creates two hexagons (5) and (10) and compares them using method compareTo(). Also, create array of four comparable hexagons with side value (4), (6), (10) and (2). Pass the array as parameter to method max. You should get the following result. Comparing two Hexagons -1 Max hexagon with biggest number of sides is 10.0
In Java Write a program that counts the number of occurrences of lowercase and uppercase vowels inentered lines of text. Use a two-dimensional array to store the vowel counts. The array’s firstcolumn holds the counts for the lowercase vowels, and the second column holds the counts forthe uppercase vowels.The user indicates the end of the input by pressing enter by itself. At that point, your programshould print, for each vowel, the total number of lowercase occurrences, the total number ofuppercase occurrences, and the total number of combined occurrences.Here are some implementation requirements:1. Use two separate files – one for a main driver method and one for a VowelCounter classthat keeps track of vowel counts.2. main – Repeatedly prompt the user to enter a line of text or press enter by itself to quit.Note that the stdIn.nextLine() method returns the empty string ("") if the user pressesenter by itself. For each entered line of text, call the processLine method. When the…
JAVA complete a method that swaps the first and second half of an array of integers. For example, if the array contains the values 1 4 9 16 25 36then after calling the method, it should contain the values16 25 36 1 4 9If the array contains an odd number of elements, leave the middle element in place. For example, 1 4 9 16 25 36 45becomes25 36 45 16 1 4 9
Write a program that reads a list of integers, and outputs the two smallest integers in the list, in ascending order. The input begins with an integer indicating the number of integers that follow. You can assume that the list will have at least 2 integers and less than 20 integers. Ex: If the input is: 5 10 5 3 21 2 the output is: 2 3 To achieve the above, first read the integers into an array. Hint: Make sure to initialize the second smallest and smallest integers properly.