Time Left - 15:00 mins

GATE 2023 Operating System Quiz 39

Attempt now to get your rank among 144 students!

Question 1

Which of the following is not the disk scheduling algorithm?

Question 2

Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63 moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is _______.

Question 3

Which of the following scheduling algorithms is both preemptive and nonpreemptive?

I. SJF

II. Priority

III. FCFS

IV. RR

Question 4

A disk queue having request for Input to blocks on cylinders is 18,69,107,32,Head is initially positioned at cylinder number 51. Total number of movements require is ____ if FCFS disk scheduling algorithm is used.

Question 5

Consider the following track requests in the disk queue:
95, 180, 34, 119, 11, 123, 62, 64
The C-scan scheduling algorithm is used and the read/write head is positioned at location 50. If tracks are numbered from 0 to 199 and head moving toward smaller track number on its servicing pass, then total seek time needed with 2 msec time to move from one track to another while servicing these requests is ________ msec. [Assume moving from one end to another end will take 10 msec]

Question 6

Consider a disk system with 100 cylinders. The requests to access the cylinders occur in following sequence-

4, 34, 10, 7, 19, 73, 2, 15, 6, 20

Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first policy is used?

  • 144 attempts
  • 0 upvotes
  • 1 comment
Oct 4GATE & PSU CS