📝 Frames Allocation algorithms

Q1. What does the valid‑invalid bit in a page‑table entry indicate?

💡 Difficulty: easy | ✅ Correct: A

Q2. A process accesses pages 0,2,4,2,0,5 sequentially. The system has 3 free frames and uses demand paging. How many page faults will occur?

💡 Difficulty: medium | ✅ Correct: B

Q3. Consider a system with 8 frames and a reference string \\( \\langle 1,2,3,4,1,2,5,1,2,3,4,5 \\rangle \\). Using the Clock algorithm with reference bits initially 0, how many page faults occur?

💡 Difficulty: hard | ✅ Correct: B