• recategorized by
1,463 views

2 Answers

2 2 votes
Access time = seek time + rotational latency

if rotational latency is not given we take rotational latency as half the rotation time.

Given, 30 rotation in 1 second => 1 rotation in 1/30 second

so rotational latency = (1/30)*(1/2) = 1/60 second = 1000/60 ms = 16.67 ms

seek time = 30 ms

access time = 30 + 16.67 = 46.67 = 47 ms approximately,

Option (D) is the answer.
Answer:
Position:
Show:

Related questions

1 1 vote
6 6 answers
2.7k
2.7k views
admin asked Apr 2, 2020
2,734 views
The file manager is responsible fornaming filessaving filesdeleting filesall of these
4 4 votes
4 4 answers
2.0k
2.0k views
admin asked Apr 2, 2020
2,024 views
In real-time operating systems, which of the following is the most suitable scheduling scheme?round-robinfirst-come-first-servedpreemptiverandom scheduling
3 3 votes
2 2 answers
1.8k
1.8k views
admin asked Apr 2, 2020
1,824 views
If there are $32$ segments, each of size $1$ K byte, then the logical address should have$13 \text{ bits}$$14 \text{ bits}$$15 \text{ bits}$$16 \text{ bits}$
0 0 votes
1 1 answer
2.3k
2.3k views
admin asked Apr 2, 2020
2,253 views
The advantage of better testing in software development is in waterfall modelprototypingiterativeall of these