We define a hole at arr[x][y] in a 2d integer array as any element in the array where directly adjacent elements are stricly larger than arr[x][y]. you can assume that a hole will always exist, the input array will always be valid, and that the area surrounding the 2d integer array is of infinte height design an algorithm that takes in a 2d int array and returns the value of any hole.

10. when you create a pivottable, you need to specify where to find the data for the pivottable. is it true

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?

Match the function to its purpose. fast worth 50pts.