Question: 11 Suppose we have the following processes inside the memory: P3, P3, P4, P4, P3, P2, P4, P1, P2, P2, P4, P4, P2, P1 show

11 Suppose we have the following processes inside the memory: P3, P3, P4, P4, P3, P2, P4, P1, P2, P2, P4, P4, P2, P1 show the result of replacement algorithms: 1)Least Recently Used (LRU). 2)Least Frequently Used (LFU). 3)FIFO (2 Points) Note: Assume the process denote for some instructions in memory like (ADD 200H) assume the last process entered is P3 (most left Enter your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
