Register

Gate Made Easy Mock Test

494 views
1 votes
1 votes
Consider a disk system with 200 cylinders. {0-199} the requests to access the cylinders occur in the following sequence: 3, 33, 9, 6, 18, 72, 1, 14, 5, 19.
Assuming that the head is currently at cylinder 50, and it takes 1 ms to move from one cylinder to adjacent one. Which of the following policy will take second highest time to satisfy all the request?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.4k
views
1 answers
1 votes
harveen singh asked Oct 1, 2016
1,376 views
Gate Made Easy Mock Test
A system uses optimal policy for a page replacement. It has 4 page frames with no pages loaded to begin with. Consider the following scenarioCase-1: ... order.The difference in the number of faults occurred in both case are _________.
User Avatar
441
views
1 answers
1 votes
TusharKumar asked Dec 29, 2022
441 views
Made Easy Mock -1
User Avatar
538
views
0 answers
0 votes
Gate Fever asked Jan 21, 2019
538 views
made easy mock 2
consider a disk having 10 platters with 2 recording surfaces each surface contains 80 tracks and each track contains 400 sectors with 1 sector capacity of 4KB.The capacity of 1 cylinder is ____? i was getting 400*4 KB = 1600 KBam i wrong ?
User Avatar
2.9k
views
4 answers
2 votes
Nashreen Sultana asked Jan 23, 2017
2,944 views
made-easy mock test2
Which of the following statement is true related to synchronization mechanism?a) If any solution is satisfying the progress condition, then it will not have any ... waiting is always satisfied if there are only two processes.d) None.
User Avatar
Link Copied!