Disk Scheduling 2 — Test 1
Page 1 of 2
Question 1
Whenever a process needs I/O to or from a disk it issues a ______________
0
System Administrator 2026
Question 2
If a process needs I/O to or from a disk, and if the drive or controller is busy then ____________
0
System Administrator 2026
Question 3
Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67 Considering FCFS (first cum first served) scheduling, the total number of head movements is, if the disk head is initially at 53 is?
0
System Administrator 2026
Question 4
Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67 Considering SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk head is initially at 53 is?
0
System Administrator 2026
Question 5
Random access in magnetic tapes is _________ compared to magnetic disks.
0
System Administrator 2026
Question 6
Magnetic tape drives can write data at a speed ________ disk drives.
0
System Administrator 2026
Question 7
On media that use constant linear velocity (CLV), the _____________ is uniform.
0
System Administrator 2026
Question 8
SSTF algorithm, like SJF __________ of some requests.
0
System Administrator 2026
Question 9
In the ______ algorithm, the disk arm starts at one end of the disk and moves toward the other end, servicing requests till the other end of the disk. At the other end, the direction is reversed and servicing continues.
0
System Administrator 2026
Question 10
In the _______ algorithm, the disk head moves from one end to the other, servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.
0
System Administrator 2026