30 30 votes Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will always decrease the number of page faults always increase the number of page faults sometimes increase the number of page faults never affect the number of page faults Operating System gatecse-2001 operating-system page-replacement normal + – Kathleen 12.6k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Mitali gupta commented Aug 30, 2020 reply Follow flag Consider the following reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 Case-1: If the system has 3 frames, the given reference string on using FIFO page replacement algorithm yields a total of 9 page faults. The diagram below illustrates the pattern of the page faults occurring in the example. Case-2: If the system has 4 frames, the given reference string on using FIFO page replacement algorithm yields a total of 10 page faults. The diagram below illustrates the pattern of the page faults occurring in the example. It can be seen from the above example that on increasing the number of frames while using the FIFO page replacement algorithm, the number of page faults increased from 9 to 10. Source : https://www.geeksforgeeks.org/beladys-anomaly-in-page-replacement-algorithms/ 4 4 replyShare ankit3009 commented Dec 11, 2021 reply Follow flag Belady’s anomaly : More physical memory doesn’t always mean fewer faults. 6 6 replyShare chidambareswar23 commented Dec 31, 2025 reply Follow flag Source: Galvin 9th edition, chapter 9(9.4.2) 1 1 replyShare Please log in or register to add a comment.
Best answer 38 38 votes Answer is (C). Belady anomaly is the name given to the phenomenon in which increasing the number of page frames results in an increase in the number of page faults for certain memory access patterns. This phenomenon is commonly experienced when using the First in First Out (FIFO) page replacement algorithm dheerajkhanna answered Jul 3, 2016 • edited Jun 28, 2018 by kenzou dheerajkhanna comment Share Follow 0 reply Please log in or register to add a comment.
17 17 votes ans is C. Belady's anomaly. jayendra answered Dec 31, 2014 jayendra comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Due to belady's anomaly, the Increase in number of frames does not always implies Less page faults in memory. It occurs in FIFO and FIFO Based replacement techniques which are Non stack based algorithms. Ans is (C). Other algorithms which shows belady's anomaly are : 1. Random Page replacement 2. Second chance LRU approximation when all of the Reference bits are 1. Krish_Vg answered Dec 12, 2025 Krish_Vg comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Its belady's anamoly. Here by increasing the no of page frames we expect the page fault to decrease but it actually increases. this happens extensively in FIFO but not in optimal, lru, lfu etc.. Hope u all like this answer Kesavan_guru_prasath answered Jul 8 Kesavan_guru_prasath comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes As usual we know that increases of page frames the page faults rate decreases but in FIFO suffers from belady anamoly , so sometimes it increases the page fault along the increases of the frames . Anirban_Bhattacharya answered Jul 31 Anirban_Bhattacharya comment Share Follow 0 reply Please log in or register to add a comment.