Optimal Page Replacement Algorithm Multiple choice Questions and Answers (MCQs)

DOWNLOAD FREE PDF <<CLICK HERE>>

Optimal Page Replacement Algorithm Multiple choice Questions and Answers (MCQs)

Congratulations - you have completed Optimal Page Replacement Algorithm Multiple choice Questions and Answers (MCQs).

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%


Your answers are highlighted below.
Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
..... has the lowest fault rate of all the page replacement algorithms.
A
Optimal page replacement algorithm
B
LRU replacement algorithm
C
FIFO
D
Counting based
Question 1 Explanation: 
Optimal page replacement algorithm has the lowest fault rate as it has the knowledge of all the pages beforehand.

Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Optimal page replacement algorithm is also called as .....
A
LIFO
B
NRU
C
Clairvoyant replacement algorithm
D
Page buffering
Question 2 Explanation: 
Optimal page replacement algorithm is also called a Clairvoyant replacement algorithm or Belady's optimal replacement algorithm.

Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?
A
Oldest page
B
Newest page
C
Frequently occurred page in the future
D
Not frequently occurred page in the future
Question 3 Explanation: 
The page which doesn't occur more frequently in the future is chosen to be replaced with the page in the frame.

Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
A page that is not going to be used for the next 7 seconds will be swapped out over a page that is going to be used within the next 0.7 seconds.
A
True
B
False
Question 4 Explanation: 
In an optimal page replacement algorithm, the page that is to be used later in the future is swapped out over a page that is to be used immediately.

Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Analysis of the optimal paging problem has been done through.....
A
Deterministic algorithm
B
Online algorithm
C
Euclid algorithm
D
Optimal algorithm
Question 5 Explanation: 
Analysis of the optimal paging algorithm is done through an online algorithm. Efficiency is calculated through amortized analysis.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results
There are 5 questions to complete.

DOWNLOAD FREE PDF <<CLICK HERE>>