Computer Programming MCQs » Algorithms & Data Structures
In priority scheduling algorithm ……?
A. Cpu is allocated to the process with the highest priority
B. Cpu is allocated to the process with the lowest priority
C. Equal-priority processes, cannot be scheduled
D. None of these
Read more about this MCQ
In multilevel feedback scheduling algorithm?
A. Process can move to a different classified ready queue
B. Classification of the ready queue is permanent
C. Processes are not classified into groups
D. None of the mentioned
Read more about this MCQ
The aim of creating page replacement algorithms is to?
A. Replace pages faster
B. Increase the page fault rate
C. Decrease the pay, fault rate
D. To allocate multiple pages to processes
Read more about this MCQ
A FIFO replacement algorithm associates with each page the?
A. Time it was brought into memory
B. Size of the page in memory
C. Page after and before it
D. All of these
Read more about this MCQ
Optimal page …….. replacement algorithm?
A. Replace the page that has not been used for a long lime
B. Replace the page that has been used for a long time
C. Replace the page-that will not be used for a long time
D. None of these
Read more about this MCQ
The optimal page-replacement algorithm is difficult to implement, because?
A. It requires a lot of information
B. It requires future knowledge of the reference string
C. It is too complex
D. It is extremely expensive
Read more about this MCQ
LRU page – replacement algorithm associates with each page the …….?
A. Time it was brought into memory
B. The time of that pages last use
C. Page after and before it
D. All of these
Read more about this MCQ