Skip to content

GATE CS I/O Scheduling questions

Practise I/O Scheduling questions for GATE CS. Explore official PYQs and original topic-wise quizzes, check answers and view available solutions. Free, no sign-in.

Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.

13 on this page
Official PYQ2004Operating SystemI/O SchedulingMCQ · 1 mark
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give 50%50 \% better benchmark results, what is the expected improvement in the I/O performance …
Official PYQ2003Operating SystemI/O SchedulingMCQ · 1 mark
Using a larger block size in a fixed block size file system leads to
Official PYQ2001Operating SystemI/O SchedulingMCQ · 1 mark
Consider a disk with the 100100 tracks numbered from 00 to 9999 rotating at 30003000 rpm. The number of sectors per track is 100100 and the time to move the head between two successive tracks is 0.20.2 millisecond.
Official PYQ2001Operating SystemI/O SchedulingNAT · 1 mark
Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating system initiates the transfer between the disk and the memory sector-wise. Once the head has been placed on the right track, the disk reads a sector in a single scan. It reads bits from the …
Official PYQ2001Operating SystemI/O SchedulingMCQ · 1 mark
Which of the following requires a device driver?
Official PYQ1999Operating SystemI/O SchedulingMCQ · 1 mark
Raid configurations of the disks are used to provide
Official PYQ1999Operating SystemI/O SchedulingMCQ · 1 mark
Which of the following disk scheduling strategies is likely to give the best throughput?
Official PYQ1998Operating SystemI/O SchedulingMCQ · 1 mark
Formatting for a floppy disk refers to
Official PYQ1998Operating SystemI/O SchedulingMCQ · 1 mark
Which of the following is an example of a spooled device?
Official PYQ1997Operating SystemI/O SchedulingNAT · 1 mark
A program PP reads and processes 10001000 consecutive records from a sequential file FF stored on device DD without using any file system facilities. Given the following Size of each record =3200= 3200 bytes Access time of D=10D = 10 msecs Data transfer rate of D=800×103D = 800 \times 10^3 bytes/second CPU time to process each record =3= 3 msecs What is …
Official PYQ1997Operating SystemI/O SchedulingMCQ · 1 mark
The correct matching for the following pairs is: …
Official PYQ1996Operating SystemI/O SchedulingMCQ · 1 mark
Which of the following is an example of spooled device?
Official PYQ1993Operating SystemI/O SchedulingMCQ · 1 mark
The root directory of a disk should be placed