This program will calculate the refined average of a list of numbers. Refined average means from a list of numbers we will exclude the minimum and maximum number and calculate the average of the rest of the items. If we have [1, 20, 30, 40, 100] then the refined average will be an average of 20, 30, 40 (exclude the max 100 and min 1) which is 30.00. For this problem you are not allowed to use any array. So whenever a number is taken input , immediately necessary processing needs to be done. At first the program inputs the number of items. Then Implement the following two functions: • getNextNumber() - This will input a number and immediately do all the necessary calculations to find the refined average. Don't use any array. All the items are integers between 0 & 100. • getRefinedAverage() - This will return the refined average and all the items are taken. The output should be 2 digits after decimal. If you want you may create more functions.

This program will calculate the refined average of a list of numbers. Refined average means from a list of numbers we will exclude the minimum and maximum number and calculate the average of the rest of the items. If we have [1, 20, 30, 40, 100] then the refined average will be an average of 20, 30, 40 (exclude the max 100 and min 1) which is 30.00. For this problem you are not allowed to use any array. So whenever a number is taken input , immediately necessary processing needs to be done. At first the program inputs the number of items. Then Implement the following two functions: • getNextNumber() - This will input a number and immediately do all the necessary calculations to find the refined average. Don't use any array. All the items are integers between 0 & 100. • getRefinedAverage() - This will return the refined average and all the items are taken. The output should be 2 digits after decimal. If you want you may create more functions.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

A positive integer greater than 1 is said to be prime if it has no divisors other than 1 and itself. Write a program that asks the user to input an integer greater than 1, then display all of the prime numbers that less than or equal to the number entered. The program should work as follows: • Once the user has entered a number, the program should display an array with all of the integers from 2 up through the value entered. • The program should then use a loop to step through the array. The loop should pass each element to a method that displays the element whether it is prime number. Your result should look like, for example: Enter an integer greater than 1: 9 2, 3, 4, 5, 6, 7, 8, 9 2 is prime 3 is prime 4 is not prime 5 is prime 6 is not prime 7 is prime 8 is not prime 9 is not prime Using java programming
An election is contested by 5 candidates. The candidates are numbered 1 to 5and the voting is done by marking the candidate number on the ballot paper.Write a program to read the ballots and count the votes cast for each candidateusing an array variable count. In case, a number read is outside the range 1 to 5,the ballot should be considered as a 'spoilt ballot' and the program should alsocount the number of spoilt ballots.
initialise a variable named Min and set its value equal to first item of array. start a for loop to iterate through every element of marks array. check if item<Min. if 4 is true: set Min = item, else continue after the loop will finish, Min variable will have lowest marks For total marks for all the students. initialise a variable named Sum and set its value equal to zero. start a for loop to iterate through every element of marks array. for every iteration, do sum = sum+item after the loop will finish, sum variable will have total marks of all students The overall average. initialise a variable named Sum and set its value equal to zero. initialise another variable count =0. start a for loop to iterate through every element of marks array. for every iteration, do sum = sum+item, and increase count by 1. after the loop will finish, sum variable will have total marks of all students and count will have total count of marks. 5. to calculate average, do average = sum/count.
Perfect number, is defined as a positive integer which is equal to the sum of all its proper divisors. For example ,the smallest perfect number is 6, which is the sum of 1, 2, and 3. Other perfect include numbers are 28, 496, and 8,128. Write a function perfect_number(n1,n2),which find perfect number between the given input of n1 and n2 and returns them in an array . Note: the input numbers n1 and n2 are to be included in the interval, while searching for the perfect numbers The input arguments: - n1 : an integer variable ,giving us the start of the range of the interval - n2: an integer variable ,giving us the end of the range of the interval The output arguments: output:An array that holds all the perfect numbers in the given interval for example: n1=1; n2=30; We then pass this to the function output perfect_number(n1,n2) This results in the output: output=6,28
Write a program that reads student scores into an array, gets the best score, and then assigns grades based on the following scheme: • Grade is A if score is • Grade is B if score is • Grade is C if score is • Grade is D if score is • Grade is F otherwise. best - 10 best - 20; best - 30; best - 40; The program prompts the user to enter the total number of students, then prompts the user to enter all of the scores, and concludes by displaying the grades
In C++ Programming Lanaguage write a program that simulates the rolling of two dice. The sum of the two values should then be calculated. Your program should roll the two dice 36,000,000 times. Use a one-dimensional array to tally the numbers of times each possible sum appears and print it. Also, determine if the totals are reasonable (i.e., there are six ways to roll a 7, so approximately one-sixth of all the rolls should be 7). [Hint: what is the minimum and maximum sum obtained when you roll a die? Some sums are more frequent than the others.]
In statistics the mode of a set of values is the value that occurs most often. Write a program that determines how many pieces of pie most people eat in a year. Set up an integer array that can hold responses from 30 people. For each person, enter the number of pieces they say they eat in a year. Then write a function that ﬁnds the mode of these 30 values. This will be the number of pie slices eaten by the most people. The function that ﬁnds and returns the mode should accept two arguments, an array of integers, and a value indicating how many elements are in the array.
A lottery ticket buyer purchases ten tickets a week, always playing the same ten five-digit "lucky" combinations. Write a program that initializes an array with these numbers and then lets the player enter this week's winning five-digit number. The program should perform a linear search through the list of the player's numbers and report whether or not one of the tickets is a winner this week. Here are the numbers: 13579 26791 26792 33445 55555 62483 77777 79422 85647 93121
You have an array with non-repeating elements. You need to find the second maximum number Input: 7 9 5 4 7 1 3 0 Output: 7 Note: 9 is the maximum. But you need to find the second largest '7' number from the array
Write code that loops through the array myVals. Each iteration: If myVals[i] is less than smallestNum, assign smallestNum with myVals[i]. Remember to assign smallestNum with some value before the loop.
A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example:d=2arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d: the amount to rotate by 2. int arr[n]: the array to rotate Returns 1. int[n]: the rotated array Input Format: The first line contains two space-separated integers that denote n, the number of integers, and d, the number of left rotations to perform.The second line contains n space-separated integers that describe arr[]. Constraints: 1. 1<=n<=10^5 2. 1<=d<=n 3. 1<=a[i]<=10^6
Part-A: Consider first ten letters of your name and for each letter encode with an integer number. For example: If “Ahmed Naser” are the first ten letters from your name, then the array of integers will be {0, 7, 12, 4, 3,13,0,18,4,17}. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 a b c d e f g h i j k l m n o p q r s t u v w x y z Using the created array, demonstrate below sorting algorithms. It is very important that in each demonstration includes all intermediate arrays in obtaining the final sorted output. Bubble Sort Selection Sort Insertion Sort Shell Sort Merge Sort Quick Sort