Chapter 7. pc#11. array operations write a program with an array that is initialized with test data. use double for the type of the array. the program should also have the following methods: • gettotal. this method should accept a one-dimensional array as its argument and return the total of the values in the array. • getaverage. this method should accept a one-dimensional array as its argument and return the average of the values in the array. • gethighest. this method should accept a one-dimensional array as its argument and return the highest value in the array. • getlowest. this method should accept a one-dimensional array as its argument and return the lowest value in the array. demonstrate each of the methods in the program. the program should read the file name from command line. use 3 decimal digits for formatting.

Which number on the image above correctly indicates the name of a folder in this url? a.1b.2c.3d.4

Barbara is interested in pursuing a career in the science and math pathway. which qualifications will her reach that goal? a.an advanced knowledge of physics and math b.an advanced knowledge of engineering and math c. an advanced knowledge of physics and robotics an d. advanced knowledge of machinery and math

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?