Answer: Provided in the explanation section
Explanation:
The question to this problem says;
Question:
I am sorting data that is stored over a network connection. Based on the properties of that connection, it is extremely expensive to "swap" two elements. But looping over the elements and looking at their values is very inexpensive. I want to minimize swaps above all other factors. Choose the sorting algorithm we studied that will perform the best:
ANSWER
1. Merge Sort
Because merge sort uses additional memory instead of swapping the elements.
2. Merge Sort and Quick Sort both can be used with multi processor.
cheers i hope this helps !!!
Answer:
a) Speedup gain is 1.428 times.
b) Speedup gain is 1.81 times.
Explanation:
in order to calculate the speedup again of an application that has a 60 percent parallel component using Anklahls Law is speedup which state that:
Where S is the portion of the application that must be performed serially, and N is the number of processing cores.
(a) For N = 2 processing cores, and a 60%, then S = 40% or 0.4
Thus, the speedup is:
Speedup gain is 1.428 times.
(b) For N = 4 processing cores and a 60%, then S = 40% or 0.4
Thus, the speedup is:
Speedup gain is 1.81 times.
The answer is Benching.
Benching and sloping are methods used to protect employees working in excavations from cave–ins. Benches are cuts in the slope that provides protection by removing material at an angle to its floor. They give the slope a stair-step appearance with emphasis on the angles; the flatter the angle, the more the protection. Benches are split into two groups: simple and multiple.
This is very true unity is what u said and it is the definition of this
