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

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

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

error: Content is protected !!