Question
Download Solution PDFSuppose for a process P, reference to pages in order are 1, 2, 4, 5, 2, 1, 2, 4. Assume that main memory can accommodate 3 pages and the main memory has already pages 1 and 2 in the order 1 - first, 2 - second. At this moment, assume FIFO Page Replacement Algorithm is used then the number of page faults that occur to complete the execution of process P is
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFPage Replacement Algorithm: FIFO
Reference to pages: 1, 2, 4, 5, 2, 1, 2, 4.
Page 1 and 2 are present in order: 1 and 2 in page frame:
|
1 |
2 |
4 |
5 |
2 |
1 |
2 |
4 |
|
1 |
1 |
1 |
5 |
5 |
5 |
5 |
4 |
|
2 |
2 |
2 |
2 |
2 |
1 |
1 |
1 |
|
|
|
4 |
4 |
4 |
4 |
2 |
2 |
|
H |
H |
M |
M |
H |
M |
M |
M |
Miss = page fault = 5
Important Points
M → miss
H → hit
Last updated on Jul 7, 2025
-> The UGC NET Answer Key 2025 June was released on the official website ugcnet.nta.ac.in on 06th July 2025.
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.