a) A process has been allocated 3-page frames of main memory. Assume that none of the...

Transcribed Image Text:

a) A process has been allocated 3-page frames of main memory. Assume that none of the pages of the processes are available in the memory initially. The process makes the following sequence of page reference: (reference string: A, B, A, C, G, D, E, F, C). Analyse the given scenario and provide a suitable diagram when: i. Least Recently Used (LRU) page replacement policy is used. (9 Marks) ii. First-In-First-Out (FIFO) page replacement policy is used. (9 Marks) iii. Optimal page replacement policy is used. (9 Marks) a) A process has been allocated 3-page frames of main memory. Assume that none of the pages of the processes are available in the memory initially. The process makes the following sequence of page reference: (reference string: A, B, A, C, G, D, E, F, C). Analyse the given scenario and provide a suitable diagram when: i. Least Recently Used (LRU) page replacement policy is used. (9 Marks) ii. First-In-First-Out (FIFO) page replacement policy is used. (9 Marks) iii. Optimal page replacement policy is used. (9 Marks)