Answer:
Time taken to travel from one track to the next = 0.08ms
Initial track= 15 0
4 (15-4)*(0.08)= 0.88
40 (40-4)*(0.08)= 2.88
35 (40-35)*(0.08)= 0.4
11 (35-11)*(0.08)= 1.92
14 (14-11)*(0.08)= 0.24
7 (14-7)*(0.08)= 0.56
----------------------------------------------
Total seek time=0.88+2.88+0.4+1.92+0.24+0.56=6.88ms
Explanation:
We caculate the seek time for each request, and then add them together to find the total seek time. The final track number for the current request becomes the current track of next request, and this process is repeated till the last request is processed.
Answer:
The correct answer is C ( W * 5 )
Because machine (cpu) can only execute machine code(language).
Using the knowledge in computational language in C++ it is possible to write a code that Find the Average of the sum of prime numbers between 1 to any given number
<h3>Writting in C++ code:</h3>
<em />
<em>#include <iostream></em>
<em>using namespace std;</em>
<em>bool isPrime(int n){</em>
<em> for(int i = 2; i < n/2; i++){</em>
<em> if(n%i == 0){</em>
<em> return false;</em>
<em> }</em>
<em> }</em>
<em> return true;</em>
<em>}</em>
<em>int findPrimeSum(int n){</em>
<em> int sumVal = 0;</em>
<em> for(float i = 2; i <= n; i++){</em>
<em> if(isPrime(i))</em>
<em> sumVal += i;</em>
<em> }</em>
<em> return sumVal;</em>
<em>}</em>
<em>int main(){</em>
<em> int n = 15;</em>
<em> cout<<"The sum of prime number between 1 to "<<n<<" is "<<findPrimeSum(n);</em>
<em> return 0;</em>
<em>}</em>
See more about C++ code at brainly.com/question/19705654
#SPJ1