Time Left - 15:00 mins
GATE CS 2022 : Operating System-3 (App update required to attempt this test)
Attempt now to get your rank among 293 students!
Question 1
If the quantum time of round robin algorithm is very large, then it is equivalent to:
Question 2
Disk requests come to a disk driver for cylinders in the order 176, 79, 34, 60, 92, 11, 41 and 114. The initial head is positioned at 50 and the direction is moving from left to right. What is the The total head movement (in number of cylinders) incurred while servicing these requests, if LOOK scheduling is used?
Question 3
Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is <cylinder no., surface no., sector no.>. A file of size 42797 KB is stored in the disk and the starting disk location of the file is <1200, 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?
Question 4
A counting semaphore S is initialized to 10. Then, 6 P operations and 4 V operations are performed on S. What is the final value of S?
Question 5
Consider the following proposed solution to dining Philosophers problem to avoid deadlock. Consider the binary semaphore lock is initialized to 1
Which of the following is correct?
Question 6
Consider the following set of processes, with the arrival times and the CPU-burst times gives in milliseconds.
Let X be the total waiting time of P2 using Shortest Remaining time first and Y be the completion time of P2 Then find the value of X+Y is ______________?
- 293 attempts
- 1 upvote
- 2 comments
Jun 12GATE & PSU CS
