Question
A process references the page sequence: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2. Using the LRU (Least Recently Used) page replacement algorithm with 3 page frames, how many page faults occur?
More IT Operating System Questions
- What does Section 66A of IT Act define?
- In a backtracking algorithm, what happens when a partial solution is found to violate a constraint?
- Which functional dependency does not holds in given relation and why?
- Which of the following is a disadvantage of a static (array-based) queue compared to a dynamic (linked list-based) queue?
- An insert(root, value) function for a Binary Search Tree (BST) is implemented recursively. After inserting several elements, a search(root, value) function...
- Consider a graph with vertices A, B, C, D and edges with weights: (A,B)=1, (A,C)=7, (A,D)=10, (B,C)=3, (C,D)=4, (D,E)=2. (Assume E is another vertex). If y...
- In Unix, a file has permissions rwxr-x---. Which command changes its permissions to rw-r-----?
- The Binary equivalent of the Gray code 1011 will be:
- Which access specifier allows data to be accessed only within the class?
- What is the primary goal of analyzing an algorithm's space complexity?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)