search
Log In
0 votes
264 views
Q1)

Given a question with z Byte track size x Byte sector size and R rpm

IO time = seektime + latency time + transfer time .

How to calculate the last part ? transfer time ?

Q2 )
if no method to calculate sector size , then how do I calculate transfer time ? Given D Data Transfer Rate

Q3 )
if no method to calculate sector size , then how do I calculate transfer time ? NO Data Transfer Rate rate also given
in Operating System
edited by
264 views

Please log in or register to answer this question.

Related questions

3 votes
1 answer
1
2.4k views
A and B are the only two processes in the system. Both are in the ready state. A arrives before B but the difference in arrival time is negligible. A is a CPU bound process while B is a I/O bound process. The pseudocode for A and B are as follows: A: repeat ... b) Shortest Remaining Time First; Compute the turnaround time for A and B. Link: http://www.comp.nus.edu.sg/~ooiwt/cs2106/1112s1/tut05.pdf
asked Jul 25, 2017 in Operating System aishwarydewangan 2.4k views
2 votes
0 answers
3
649 views
Let n be the number of general registers in a CPU, m be the number of status registers, b be the number of store operations to save a single register, and K be the amount of time to perform a store instruction. How long does it take to perform a context switch ? (n+mb)K (n+m)b*K K + nb + mb Knb + m
asked Jul 9, 2016 in Operating System sh!va 649 views
0 votes
0 answers
4
472 views
Successful Search we assume that the probability of searching or finding an element at each location is same , then if we have n elements so probability is $1/n$... Also we might need to perform $1$ comparison or $2$ or $3$ or $4$ and so on .. ... calculating the time complexity for the array , is the order of elements defined in the array is fixed or it can vary ? Please explain precisely .
asked Jun 17, 2018 in Algorithms radha gogia 472 views
...