I will send description file and other files to solve this plz. help m

ID: 3621941 • Letter: #

Question

I will send description file and other files to solve this
plz. help me up
description(formula is wrong in there)
The possible grades for this project are 30, 25, 20, 15, 10 or 0 points. Grading based on instructor analysis of your program. Your program must input 0 to 20 integers from a user-specified input file and store those integers in a onedimensional array. When opening the input file, the user must continue to enter a file name until they enter a file name correctly or type ctrl-c to exit. If more than 20 integers exist in the input file, the first 20 only are read. After reading in the values, the program prints out the number of values read and those values. Your program then should sort the integers into descending order (largest to smallest) – a possible sorting algorithm (from smallest to largest) is described on the next page. Once sorted, the integers should be printed to standard output. Finally, your program must compute the sum, average, variance, and standard deviation of the values as shown in the sample solution. Use the equations below to compute the required statistics. The program needs to handle the case where there are no values in the input file (empty input file). You will need to type cast to double data types to avoid integer division. Output statistic values to 2 decimal places. Assume all values in the files are integers.
Arithmetic Sum: the formula 1 Arithmetic Mean:     n i i sum avg x n n x x 1 1 Variance:      n i i avg x x n 1 ( )2 1 1 var Standard Deviation:   var Note:   n i i x 1 is a summation symbol that indicates to sum all X values. If the values of X are stored in an array, then i x corresponds to the array element x[i 1] . In the above equations, n represents the number of integers read from the input file. Your program’s output (all messages output) must match that produced by the provided sample solution. All messages output starting with ####> are optional. If your program can produce that output correctly, you will receive +5 additional points. To get the additional points, the program must correctly handle all input files contained in P12_in.zip. You may run the sample solution Project_12_solution by typing the following at a command prompt in a terminal window: /home/work/cpe112/Executables/Project_12/Project_12_solution Provided sample input files: are zipped in the file P12_in.zip be sure to read the README.txt file included in the zip file <Project 12 Directions> On Project 12, you may only use concepts presented in Chapters 1 - 12 of your textbook!! Using your favorite text editor, type your solution and save it as a file named Program_12.cpp within your CPE112_FALL10/Project_12 directory. If there are syntax errors, correct them and compile again. Once your program successfully compiles, run it and verify that the output for your modified program matches the output from the solution executable – Project_12_solution. < Project 12 Design Requirements > Your solution must include at least 4 functions in addition to the function main(). The following is one possible method that will sort a list of numbers Ascending Sort Algorithm - similar to the sorting algorithm required in the program (Elements highlighted in gray have not been sorted yet.) Example: 18 16 4 23 2 A[0] A[1] A[2] A[3] A[4] Step 1: Of the unsorted elements in array A, find the index of the smallest element. In this example, the value 2 is stored in A[4] Step 2: Swap the element currently in position 0 with the element in position 4 2 16 4 23 18 A[0] A[1] A[2] A[3] A[4] Step 3: Of the unsorted elements in array A, find the index of the smallest element. In this example, the value 4 is stored in A[2] Step 4: Swap the element currently in position 1 with the element in position 2 2 4 16 23 18 A[0] A[1] A[2] A[3] A[4] Step 5: Of the unsorted elements in array A, find the index of the smallest element. In this example, the value 16 is stored in A[2] Step 6: Swap the element currently in position 2 with the element in position 2 2 4 16 23 18 A[0] A[1] A[2] A[3] A[4] Step 7: Of the unsorted elements in array A, find the index of the smallest element. In this example, the value 18 is stored in A[4] Step 8: Swap the element currently in position 3 with the element in position 4 2 4 16 18 23 A[0] A[1] A[2] A[3] A[4] Step 7: Of the unsorted elements in array A, find the index of the smallest element. In this example, the value 23 is stored in A[4] Step 8: Swap the element currently in position 4 with the element in position 4 2 4 16 18 23 A[0] A[1] A[2] A[3] A[4] Note that there are two basic operations that are repeated until all the elements are sorted: - Locating the “smallest” of the unsorted elements - Swapping the position of smallest unsorted element with that of the first unsorted element Each of these operations can be implemented as a separate function. Descending Sort Algorithm – what is required in the program Instead of locating the smallest unsorted element and moving it to the lead position, locate the largest unsorted element and move it to the lead position using a swap function. The code that finds the “largest” unsorted element is easily implemented as a function.

Explanation / Answer

Dear, Please post remaining questions on another post #include #include using namespace std; int main() { int num[20],temp; ifstream instream; instream.open("input.txt",ios::in); if(!instream) { coutnumber; num[i]=number; while(instream != NULL) { i++; instream>>number; // read data from file num[i]=number; } int size=i; for ( int i = 0; i

Navigate

I understand up to the very last step (step 10) of the solution for problem 1

I wrote a balance-symbol checker which checks for the following pairs of symb

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

<p>I will send description file and other files to solve this</p> <p>plz. help m

Question

Explanation / Answer

Related Questions

Navigate