C++ you have to you use #include <random> also included a sample output has too match the layoutThank you The array is being filled with random numbers ...The randomization process is done,here are the current values in the array46494579534313864721147190532486801855128353126295957099241262400528113The maximum grade is: 99The maximum grade is located at the index 60 (1) 1 (2)5 (0)6 (0)10 (0)11 (0)15 (0)16 (0)20 (0)21 (1)25 (0)26 (0)30 (1)31 (0)35 (1)40 (1)45 (1)50 (0)1417304827The minimum grade is: 0The minimum grade is located at the index 31The average of all grades in this class is: 43.5The average of non-zero grades in this class is: 44.3878Grades are being counted ...Here are the frequencies of all grades:4 (1)9 (0)14 (1)19 (0)24 (2)(0)36 (0)41 (0)46 (1)51 (0)55 (1) 56 (0)60 (0)61 (0)65 (0)66 (0)70 (1)71 (1)2 (0) 3 (1)7 (0)8 (1)12 (4)13 (2)17 (1)18 (2)22 (0)27 (1)32 (0)37 (0)42 (0)47 (1)52 (1)57 (0)62 (2)67 (1)971272 (0)75 (0)76 (0)77 (1)80 (1)81 (1)82 (0)85 (0)86 (2)87 (0)90 (1) 91 (0)92 (0)95 (2) 96 (0) 97 (1)100 (0)67181277823 (0)28 (1)33 (0)38 (0)43 (1)48 (1)(0)39 (0)44 (0)49 (1)54 (0)59 (0)53 (2)58 (0)63 (0)64 (0)68 (0)69 (0)73 (0)74 (0)78 (0)79 (1)83 (0)84 (0)88 (0) 89 (0)93 (0)(0)98 (0) 99 (1)Finding the the mode of grades (the most frequent)The highest frequency is: 4The mode of grades:The grade (12) is the most frequent grade. Create an integer array of size 50, name this array as “examArr". This array stores thegrades of an exam.Initialize all elements in “examArr” with the value 0.Fill "examArr" with random integers in the range [0, 100].Display the contents of "examArr", 5 elements per line.Display a summary report for "examArr" showing the following information:a. The maximum value in “examArr", and the location of the maximum number (theindex/subscript of the maximum). If the maximum value is repeated, report thefirst location of the maximum value.b. The minimum value in "examArr", and the location of the minimum number. Ifthe minimum value is repeated, report the first location of the minimum value.c. The average value of all numbers in "examArr".d. The average value of non-zero numbers in “examArr" (i.e. exclude all zeros in thearray, if any).e. The frequency of each possible grade (i.e. how many students got the samegrade).f. The mode of grades (i.e. the highest occurring grade (most frequent)). If there aremore one grade, display all of them.

We have to create a c++ program which generates 50 random integers and tells a summary report…

Create an integer array of size 50, name this array as "examArr". This array stores the grades of an exam. Initialize all elements in "examArr" with the value 0. Fill "examArr" with random integers in the range [0, 100]. Display the contents of "examArr", 5 elements per line. Display a summary report for "examArr" showing the following information: a. The maximum value in "examArr", and the location of the maximum number (the index/subscript of the maximum). If the maximum value is repeated, report the first location of the maximum value. b. The minimum value in “examArr", and the location of the minimum number. If the minimum value is repeated, report the first location of the minimum value. c. The average value of all numbers in "examArr". d. The average value of non-zero numbers in "examArr" (i.e. exclude all zeros in the array, if any). The frequency of each possible grade (i.e. how many students got the same grade). f. The mode of grades (i.e. the highest occurring grade (most frequent)). If there are more one grade, display all of them. e.

Create an integer array of size 50, name this array as "examArr". This array stores the grades of an exam. Initialize all elements in "examArr" with the value 0. Fill "examArr" with random integers in the range [0, 100]. Display the contents of "examArr", 5 elements per line. Display a summary report for "examArr" showing the following information: a. The maximum value in "examArr", and the location of the maximum number (the index/subscript of the maximum). If the maximum value is repeated, report the first location of the maximum value. b. The minimum value in “examArr", and the location of the minimum number. If the minimum value is repeated, report the first location of the minimum value. c. The average value of all numbers in "examArr". d. The average value of non-zero numbers in "examArr" (i.e. exclude all zeros in the array, if any). The frequency of each possible grade (i.e. how many students got the same grade). f. The mode of grades (i.e. the highest occurring grade (most frequent)). If there are more one grade, display all of them. e.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

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…
In java language using arrays This method examines the two-dimensional array of integersidentified by the first parameter, whose length (number of rows,also the number of students) is the second parameter, while thethree columns in the array represent the scores for threedifferent tests.The test scores for each student (one row of three grades) arecombined to find the average score for each student. The integerreturned is the number of students with a test average less than 70. @param numStudents, the number of students who took the three tests@param theArray, a 2-D array of integer scores@return, the number of test averages below a score of 70*/public static int testAverage(double[][] theArray, int numStudents){int NUM_TESTS = 3; // your work here // loop though theArray, computing each student's average // your work here// return count of averages below 70.0 // your work here
Write a program that randomly fills in 0s and 1sinto an n-by-n matrix, prints the matrix, and finds the rows and columns with themost 1s. Here is a sample run of the program: Enter the array size n: 4 ↵EnterThe random array is0011001111011010The largest row index: 2The largest column index: 2, 3
Given an ArrayList of integers, return an ArrayList where all the odds are before the evens in the order that they occur. public ArrayList<Integer> solution(ArrayList<Integer> nums) {ArrayList<Integer> finalList = new ArrayList<>();int index = 0;for (int i = 0; i < nums.size(); i++) {if (nums.get(i) % 2 == 1) {finalList.add(index, nums.get(i));index++;} elsefinalList.add(nums.get(i));}return finalList;} This is my failing code. for [1.-3.3] where [1,3,-3] is being returned
input an unsorted array A of n number and an integer k with 1<= k <= n. output an array B of size k that contains the k largest numbers in A with B[1] >= B2....>=[k] index of the array starts from 1 1. write algorothim pseudocode. analyze the bestcase .k . analyze the worse case of k.
. Implement a program that randomly generates 10 integers from -100 to 100, stores them in a 1D array, and finds their maximum value. Calculate the execution time of finding a maximum. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. Implement a Java program that will populate a 5x5 matrix with randomly generated integers from 0 to 100. (1) print your matrix in a table form. (2) modify your code to multiply all even numbers by 10 and print the matrix. Your output of questions (1) and (2) should match the format of the following sample outputs:
Write a program that reads from the user an array with one dimension n and then find the largest even and smallest negative element numbers.
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].
Write a program that has an double array intArray[] that has N elements and is initialized with values start from 0 and incremented by 1 and then multiplied by 2. Your task is to print the address of the odd index and its value. [Note: you can define the value of N at least 10 or more] PLEASE DO NOT USE ANY INDEX TO ACCESS ELEMENTS OF THE ARRAY. Sample Output:Elements of intArray:0 24 6 8 10 12 14 16 18The address of index 1 is: Ox7ffebe1108c4 and the vlaue holds is 2The address of index 3 is: 0x7ffebe1108cc and the vlaue holds isThe address of index 5 is: 0x7ffebe1108d4 and the vlaue holds is 10The address of index 7 is: 0x7ffebe1108dc and the vlaue holds is 14The address of index 9 is: 0x7ffebe1108e4 and the vlaue holds is 18
import math array = [4, 5, 6, 7, 8, 9, 33, 24, 15, 11] print("Original array") print(array) print() # Get no. of elements n = len(array) s = math.floor((n-1)/2) e = math.floor(n/2) # while loop while (s >= 0 and e <= n-1): # swap the numbers array[s], array[e] = array[e], array[s] s = s-1 e = e+1 # now array is reversed print("Reversed array") print(array) Check this code and ,using time measurements, test your algorithm and plot a graph that shows its growth rate when variating the size.
Write a Java class to perform the following: 1. Write a method to search the following array using a linear search, ( target elements: 11, 55, 17.). (count the number of comparisons needed). {06, 02, 04, 07, 11, 09, 50, 62, 43, 32, 13, 75, 01, 46, 88, 17} 2. Write a method to sort the array using Selection Sort. (count the number of comparisons needed) 3, Write a method to sort the array using Bubble Sort. (count the number of comparisons needed) 4, Search he sorted array using a binary search (recursive) for the same set of target elements. (count the number of comparisons needed)
Given a list of scores and a passing score, you are asked to find out the numberof scores which are equal to or higher than the passing score, the lowest score, andthe highest score. For examples, if the list of scores is as follows: 46, 58, 55, 43,89, 93, 77, 82, 99, 64; and if the passing score is 60, then the answers should be 6,43 and 99. Implement the above task using MIPS. Initialize the array of scores inmemory using any integer values between 0 and 100. The passing score should beobtained from user’s input and the answer must be printed out.