Project: Project 5 The rest of the documentation. Create a list of random numbers store the numbers in an array and in a file the user will determine the number of numbers and the range of the random numbers when the program executes Keep one array with the original numbers and Another array with the sorted numbers Search for another random number in each array Keep track of the number of times in each search that we make a comparison. Calculate the average number of comparisons made when searching the unsorted list with searching the sorted list Display the results. Test: initially start with a small data size and make sure the program works Then when you have evidence that the program works then turn off the print data and create a very large data array--make sure that the random numbers are appropriate to the size of the data array. Computer science Java

When making changes to optimize part of a processor, it is often the case that speeding up one type of instruction comes at the cost of slowing down something else. for example, if we put in a complicated fast floating-point unit, that takes space, and something might have to be moved farther away from the middle to accommodate it, adding an extra cycle in delay to reach that unit. the basic amdahl's law equation does not take into account this trade-off. a. if the new fast floating-point unit speeds up floating-point operations by, on average, 2ă—, and floating-point operations take 20% of the original program's execution time, what is the overall speedup (ignoring the penalty to any other instructions)? b. now assume that speeding up the floating-point unit slowed down data cache accesses, resulting in a 1.5ă— slowdown (or 2/3 speedup). data cache accesses consume 10% of the execution time. what is the overall speedup now? c. after implementing the new floating-point operations, what percentage of execution time is spent on floating-point operations? what percentage is spent on data cache accesses?