problem 1: prepare brief notes on the given:
b) Page fault frequency
c) Sharing in virtual memory
problem 2: Distinguish between the given:
a) Dirty page and clean page
b) Logical Address and Physical Address
c) Spatial and temporal locality of reference
d) Segmentation and paging
problem 3: What is the common disadvantage of all the real memory management methods? How is it overcome in the virtual memory management schemes?
problem 4: What additional hardware do we need for implementing the demand paging and demand segmentation?
problem 5: Show that the LRU page replacement policy possesses the stack property.
problem 6: Distinguish between the internal and external fragmentation.
problem 7: What do you mean by the term thrashing? Illustrate the factors causing it?
problem 8: Compare the FIFO page replacement policy with the LRU page replacement on the basis of overhead.
problem 9: What do you mean by the term Belady’s anomaly? Show that page replacement algorithm that possesses the stack property can’t suffer from the Belady’s anomaly.