consider following string of reference: 1,2,3,4,1,2,5,1,2,3,4,5. find the number of replacements (where an existing value is replaced by a new value because the buffer is full) incurred using least recently used (LRU) buffer replacement algorithm with 3 buffer frames.
a)7
b)2
c)8
d)10
Answers
Answered by
0
a)7 because it is smallest
Similar questions