adplus-dvertising
frame-decoration

Question

Algorithm of disk scheduling which selects the request with the least seek time from the current head positions is

a.

SSTF scheduling

b.

FCFS scheduling

c.

SCAN scheduling

d.

LOOK scheduling

Posted under IT Fundamentals

Answer: (a).SSTF scheduling

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Algorithm of disk scheduling which selects the request with the least seek time from the current head positions is

Similar Questions

Discover Related MCQs

Q. Replacement of a bad block generally is not automatic because

Q. Storage which has a smallest storage capacity is

Q. As a storage media, advantage of CD-ROM is

Q. One terabyte is equals to

Q. During the recovery cycle from a faliure one

Q. Term which is used for the disk content that is recorded at the time of manufacturing and cannot be changed or erased by user is

Q. Program is required for the process of writing to CD-RWs is known as

Q. Type of device which is 3.5 inch floppy drive is nothing but

Q. Process of dividing the disk into tracks and sectors is called

Q. Most common type of storage device is

Q. A piece of data that can be transferred between CPU and backup storage is called

Q. In fixed head discs, sum of rotational delay and transfer time is equals to

Q. Backing store that has short access time and consists of no moving parts is classified as

Q. Unit used to store contents as backup of data for later disc failure is called as

Q. In hard discs, collection of seek time, transfer time and rotational delay is equal to

Q. Example of serial access store is

Q. Type of disc which has storage capacity of 40 megabytes to several megabytes is classified as

Q. Serial or direct access occurs in

Q. 'laser discs' and 'compact discs' are classified as

Q. Group of track place vertically on to one another is classified as