Public static int[] sortthisarray-new int[{45, 78, 92, 21, 62, 8, 2, 81, 9, 25, 98}; if you have a method that selects the best pivots for quicksort (do not use the default pivot selection method), indicate what pivots would be selected and provide the values in sort thisarray (provided above) once the final position for a pivot has been determined. problem 8: public static int 1001); sort thisarray = new int[]{1001, 1101, 11101, , 0011, 0111, perform binary radix sort (ascending order) on sortthisarray, provided above, by listing the contents of the array after each bucketization. problem 9: explain why the time complexity for merge sort o(nlogn)? using the recurrent expression for merge sort in your explanation. problem 10: perform counting sort on an array containing the following numbers: 1, 6, 7, 8, 2, 6, 7,9, 9, 3, 8, 5, 0, 1, 4 (from index 0 to 14). the numbers are integers that can take values between 0 and 9 inclusively. indicate where in the final sorted array each number will end up. the 1 in index 0 should end up in a different index than the 1 in index 13.

Click on this link toopens a new window. bring up a flowchart in a new browser window. based on this flowchart, would a d-link 3347 gateway with an xbox 360 multiplayer problem be in scope or out of scope

The processing of data in a computer involves the interplay between its various hardware components.

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?