Q63 Recall that Beladys anomaly is that the pages fault rate may increase as the number of allocated frames increases Now consider the following statements gate computer science 2017
The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
Hey! Want to work with us? Our youtube channel See our Jd Want to apply? Do it today

Use Me  ?

New searches
GATE-Computer-Science-Engineering-2017-->View question


Q.63) Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements: -gate computer science 2017

S1: Random page replacement algorithm (where
    a page chosen at random is replaced) 
    suffers from Belady’s anomaly.

S2: LRU page replacement algorithm suffers
    from Belady’s anomaly .
Which of the following is CORRECT ?

A) S1 is true, S2 is true
B) S1 is true, S2 is false
C) S1 is false , S2 is true
D) S1 is false, S2 is false


By:satyashiromani

Taged users:
|satyashiromani|aksingh1818|batsam22|Umang|Aparna-Dasgupta|Shikhil|ThreeRed|deepuckraj|Manisha12|milan-ransingh|nitin-ganvir|mukesh-Mandloi|Anirudh|Abhash-hit-sharna|plakhe|Raazsingh96791gmail-Com|pallaviaithaln|vivek25|Ashok-pramanik|vaishnavi-Deshpande|Oshal-Borkar|Samira|Tanu|Amogh|Ashwath-Shetty|pankaj|leo|Aaditi|madachod|tichaona-garaidenga

Likes:
|aksingh1818

Dislikes:
Be first to dislike this question

Talk about thisDelete|Like|Dislike|


Answers

B) S1 is true, S2 is false

Explanation: 
Belady’s anomaly proves that it is possible to have more page faults when increasing the number of page frames while using the First in First Out (FIFO) page replacement algorithm. For example, if we consider reference string 3 2 1 0 3 2 4 3 2 1 0 4 and 3 slots, we get 9 total page faults, but if we increase slots to 4, we get 10 page faults. 

S1: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady’s anomaly. -> Random page replacement algorithm can be any including FIFO so its true 

S2: LRU page replacement algorithm suffers from Belady’s anomaly . -> LRU does'nt suffer from Belady’s anomaly . 

Therefore, option B is correct

This explanation is contributed by Satya Shiromani

deepuckraj

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

Can you help us to add better answer here? Please see this



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!