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
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 better benchmark results, what is the expected improvement in the I/O performance …
Using a larger block size in a fixed block size file system leads to
Consider a disk with the tracks numbered from to rotating at rpm. The number of sectors per track is and the time to move the head between two successive tracks is millisecond.
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 …
Which of the following requires a device driver?
Raid configurations of the disks are used to provide
Which of the following disk scheduling strategies is likely to give the best throughput?
Formatting for a floppy disk refers to
Which of the following is an example of a spooled device?
A program reads and processes consecutive records from a sequential file stored on device without using any file system facilities. Given the following Size of each record bytes Access time of msecs Data transfer rate of bytes/second CPU time to process each record msecs What is …
The correct matching for the following pairs is: …
Which of the following is an example of spooled device?
The root directory of a disk should be placed
