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). e. 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.

Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter6: Arrays
Section: Chapter Questions
Problem 5GZ
icon
Related questions
Question

C++

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).
e. 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.
Transcribed Image Text: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). e. 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.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Array
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT