GATE Overflow Test Series | Operating Systems | Test 2 | Question: 1

Question

In a stack page replacement algorithm, the set of pages in a $k$-frame memory is always a subset of pages in a _________ frame memory (Mark all the appropriate choices)

• A. $k-1$
• B. $k+1$
• C. $k+2$
• D. $k(k+1)$

Answer 1

A page replacement algorithm is said to satisfy the inclusion property or is called a stack algorithm if the set of pages in a $k$-frame memory is always a subset of the pages in a $(k + 1)$ frame memory.

i.e., $k\subseteq (k+1)$

Then, $k \subseteq (k+2)$ and $k \subseteq k(k+1)$ is also true.

So, the correct answer is $B; C;D.$

Ref: http://faculty.salina.k-state.edu/tim/ossg/Memory/virt_mem/page_replace.html

Answer 2

Options B,C and D are true.