(A) Shortest seek time first DS algorithm
(B) First come first served DS algorithm
(C) C-LOOK DS algorithm
(D) SCAN DS algorithm
Tag: Operating System Mcq With Answers PDF
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
Situation when the system is spending a major portion of its time in serving the page fault but the actual processing done is very negligible?
(A) Processing
(B) Fragmenting
(C) Thrashing
(D) None of the above
Page replacement algorithm that replace the page that has not been used for the longest period of time is?
(A) Least recently used page replacement algorithm
(B) Optimal page replacement algorithm
(C) First in first out page replacement algorithm
(D) None of the above