1,911 views
1 1 vote
Is Most Recently Used (MRU) Page replacement algorithm a 'Stack Algorithm' i.e. it doesn't suffer from Belady's Anomaly ?

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
0 0 answers
2.7k
2.7k views
Akriti sood asked Mar 24, 2017
2,699 views
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
0 0 votes
0 0 answers
2.0k
2.0k views
Meenakshi Sharma asked Nov 13, 2016
2,046 views
someone please post infix to prefix and infix to post fix ( with using stack and without using stack ) accurate and authentic algorithm also please tell the procedure t...
2 2 votes
1 1 answer
862
862 views
sh!va asked Dec 6, 2016
862 views
Consider the code snippets:i)void foo(){ while(1) int *i= new int;} ii)void foo(){ foo();} Choose the ocrrect statements:A. Both shows stack overflowB. Both show...
0 0 votes
1 1 answer
819
819 views
sh!va asked Dec 6, 2016
819 views
Interview Question:1) How size of a stack and heap memory for a proces is decided?2) I wrote a program with no data or instructions. How text, data, stack ,heap will be a...