Answer:
5
Explanation:
2⁵ = 32, so that fits.
In general, to calculate the number of bits without guessing, you can take the 2 log of the number and then round up:
rounded up gives 5.
First four tasks = 8 seconds
Next four tasks = 8 seconds
Last two tasks = 8 seconds
The total number of seconds to perform all tasks is 24 seconds.
The throughput, which would be the number of tasks per second, is calculated by taking the number of tasks and dividing by the number of seconds:
10 tasks / 24 seconds = 5/12 or 0.4167 tasks per second
Answer:
ok, no because this site is for hw
Explanation:
Answer:
To obtain substantial performance enhancements, we must exploit ILP across multiple basic blocks.
Explanation:
Answer:
Time Complexity of Problem - O(n)
Explanation:
When n= 1024 time taken is t. on a particular computer.
When computer is 8 times faster in same time t , n can be equal to 8192. It means on increasing processing speed input grows linearly.
When computer is 8 times slow then with same time t , n will be 128 which is (1/8)th time 1024.
It means with increase in processing speed by x factor time taken will decrease by (1/x) factor. Or input size can be increased by x times. This signifies that time taken by program grows linearly with input size n. Therefore time complexity of problem will be O(n).
If we double the speed of original machine then we can solve problems of size 2n in time t.
