Memory management

Questions

1.What are the requirements for management of memory?

2.What is relocation?

3.What is the difference between page and frames?

4.What advantage does the segmentation system pose over paging system?

5.Explain problem of fragmentation.

6.Explain address translation in paging.

7.Explain with a diagram the concept of a translation look aside buffer. 

8.Explain with a neat diagram memory management in windows 2000.   

9.Describe the following memory allocation strategies:

(i)      First fit            (ii)        Best fit            (iii)          Worst fit  

10.Why the paging is necessary? Explain the paging hardware with TLB with the help of suitable diagram.

11.describe how address translation takes place with the help of neat diagrams in:

(i)      Paging            (ii)        Segmentation   

12.Explain the concept of paging with neat diagram.   

13.Explain internal and external fragmentation.   

14.Discuss various data structure involved in UNIX memory management.    

15.Differentiate the contiguous and non-contiguous memory allocation.

16.Explain in detail various partitioning memory management.

17.A process references page in the following order 5, 6, 7, 8, 5, 6, 9, 5, 6, 7, 8, 9 .Use the FIFO and LRU page replacement algorithm to find out the number of page faults for this reference string using 3 page frames. Repeat for 4 page frames. Analyze the difference in the result.      

18.Describe the following:

(i)      Principle of locality      (ii)       Thrashing     

19.Explain the following terms in brief:

(i)      Working set model      (ii)      Thrashing      (iii)       Lazy swapper    

20.Write short note on virtual memory management.    

21.What is page fault rate? Explain with example.     

22.Given the following page reference string: 1, 2, 3, 2, 5, 6, 3, 4, 6, 3, 7, 3, 1, 6, 3, 4, 5, 3, 2, 4, 3, 4, 5,1 Number of page frames are 4. Show the page trace and calculate the number of page frames for the following page replacement policies

(i)       LRU              (ii)         Optimal         (iii)        FIFO

Also explain Betady’s anomaly  

23.Draw schematic of virtual memory.

24.Explain Belady’s anomaly and the measures to prevent it.

25.What is working set model and how it is used in page replacement?

16.Discuss the concept “Locality of reference”.

27.Explain the following terms in brief:

(i)  Working set model         (ii)    Thrashing            (iii)    Lazy swapper