- Instructions Part 1 The Input Data Is In An Input File Named Scores Txt The Data Is Structured As Follows Add Na 1 (69.6 KiB) Viewed 90 times
. Instructions: Part 1. The input data is in an input file named "scores.txt”. The data is structured as follows (add names last, after your program works correctly in processing the numeric scores): Whole name of the first skateboarder (a string, with first name followed by last name, separated by one space) First judge's score (each is a floating point value) Second judge's score and so on ... for a total of five scores Whole name of the second skateboarder First judge's score for the second skateboarder Second judge's score and so on... . . The number of skateboarders included in the file is unknown. As you have found in previous attempts to determine the final score of each skateboarder, the processing task was very difficult without being able to save the scores for one competitor before reading in the scores for the next. In this lab, you will be improving your program by using arrays to save each skateboarder's scores, and then defining separate functions to perform the processing of the scores. Next steps: Define an array to store the scores for each skateboarder, and modify your loop to save each score read from the data file into the array. Define three separate user-defined functions to perform the separate tasks of identifying the minimum and maximum scores, and computing the average. These functions should take the array of scores for one skateboarder and the integer number of scores to process in this case, the array length) as parameters. You may design your program in one of two ways: You may have each of these functions called separately from main, or you may design your program to have the function computing the average responsible for calling each of the other functions to obtain the minimum and maximum values to subtract before computing the average. .
Extra credit options (extra credit for any of the following): Extra credit option: Initially, define the function to compute the maximum score as a stub function, without implementing the algorithm inside the function and instead returning a specific value. The use of stub functions allows incremental program development: it is possible to test function calls without having every function completely developed, and supports simultaneous development by multiple programmers. (Capture a test of this function before adding the final detail inside; see Testing section below.) The fact that the number of skateboarders included in the file unknown at the beginning of the program presents difficulties with static memory allocation for the array: you may declare the array too small for the number of competitors with data in the file, or you may waste memory by making it too large. Implement dynamic memory allocation using the C malloc function. How would you increase the memory allocated if necessary? Add the code to determine the winning skateboarder (the one with the highest average score). Display both the winning score and the name of the winner. . Part 2. Testing: Test your program and include screenshots of the results for the following situations: a complete "scores.txt" data file with data for at least three skateboarders the results of calling a stub function for extra credit: the identification of the winning skateboarder and winning score . .