BCA Semester 4 – Operating System – Unit 5: Memory Management (7Hrs.)

Given references to the following pages by a program 0, 9, 0, 1, 8, 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3. How many page faults will occur if the program has three page frames for each of the following algorithms?
a) FIFO
b) LRU

Write short notes on any TWO :
a) Producer Consumer problem
b) Coalescing and Compaction
c) Ubuntu

Define the terms page fault and thrashing. Consider the following page reference string: 1, 3, 5, 1, 7, 1, 5, 5, 1, 4, 2, 7, 6, 3, 4, 1. How many page faults would occur for each of the following page replacement algorithms assuming 3 page frames?a) FIFO page replacementb) LRU page replacementc) Optimal page replacement

What is thrashing? Explain three memory management requirements?

Given five memory partition of 100KB, 500KB, 200KB, 300KB and 600KB (in order). How would the first fit, best fit and worst fit algorithm place processes of size 212KB, 417KB,112KB, and 426KB (in order) in fixed-size partition? Which algorithm makes the most efficient use of memory?

How second chance page replacement algorithm differ from FIFO page replacement policy? Explain the concept of belay’s anomaly with suitable example.

Given memory partitions of 200k, 600k, 300k, 400k, and 700k (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 315k, 527k, 202k, and 548k (in order)? Which algorithm makes the most efficient use of memory?

How paging can be used for memory management? Also differentiate it with segmentation.

What are page faults and thrashing? Explain demand paging with protection bit.

What is Belady's Anomaly in page replacement Algorithm? Explain with example. Consider the following page reference string:$7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1$