(A) SCAN
(B) LOOK
(C) C-SCAN
(D) C-LOOK
In __ policy when the last track has been visited in one direction the arm is returned to the opposite end of the disk without visiting any request and the scan begins again.
(A) SCAN
(B) Circular SCAN
(C) Shortest seek time first
(D) First in First Out
In __ disk scheduling request having shortest seek time are executed first.
(A) Shortest seek time first DS algorithm
(B) First come first served DS algorithm
(C) C-LOOK DS algorithm
(D) SCAN DS algorithm
Whenever a process needs I/O to or from a disk it issues a?
(A) A special procedure
(B) System call to the operating system
(C) System call to the CPU
(D) All of the above
Transfer time is?
(A) The time taken to transfer the data
(B) The time taken to access the data
(C) The time taken to rotate the head
(D) None of the above
Disk scheduling is done so as?
(A) To reduce the total rotational time of any request
(B) To increase the total seek time of any request
(C) To reduce the total seek time of any request
(D) None of the above
Amount of time taken by the desired sector to rotate itself to the position from where it can access the R/W head is called?
(A) Transfer time
(B) Seek time
(C) Rotational delay
(D) None of the above
Amount of time taken by the read/write head of disc to move from one part of disc to another is called?
(A) Seek time
(B) Rotational delay
(C) Transfer time
(D) None of the above