Home / Engineering / Operating System (OS) / Question

M

Mr. Dubey • 51.43K Points
Coach 

Q.) There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called

(A) queue algorithms
(B) stack algorithms
(C) string algorithms
(D) none of the mentioned
Correct answer : Option (B) - stack algorithms

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Operating System (OS)

Q. Which term defines all the complete bipartite graph that are trees?

Q. _____ refers to how sharply an ondividual colour pixel on a monitor appears

Q. Sensors Primary Functions ..........

Q. The decimal number 10 is represented in its BCD form as

Q. Lower and upper limits are present in which chart?

Q. 4 COST MONITORING

Q. If a1, a2, a3 are attributes in a relation and S is another relation, which of the following is an incorrect specification of an integrity constraint?

Q. In File Transfer Protocol, data transfer cannot be done in __________

Q. Punched cards were first introduced by

Q. From the options below, which suits best for MODEM?