Computer Science · Operating Systems
एक प्रोसेस 5 पेजों A, B, C, D और E को इस क्रम में संदर्भित करता है: A, B, C, D, A, B, E, A, B, C, D, E। यदि उपयोग किया जाने वाला पेज रिप्लेसमेंट एल्गोरिदम FIFO (फर्स्ट-इन-फर्स्ट-आउट) है, तो 3 फ्रेम के शुरूआती खाली मेमोरी आवंटन के साथ होने वाले पेज फॉल्ट्स (page faults) की संख्या ज्ञात कीजिए।
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 110
- 29✓
- 38
- 47
सही उत्तर देखें
9
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Operating Systems MCQs →Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems