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

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Operating System (OS)

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

💬 Discuss

✅ Correct Answer: (B) stack algorithms

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

840

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate