Scribd
Upload
29 views1 page

Assignment 4 - OS Nepalaya

The document discusses memory management techniques used in operating systems including memory hierarchy, virtual memory, page replacement algorithms like FIFO and LRU, physical vs virtual addresses, segmentation, paging, demand paging, and page faults.

Uploaded by

Manish Budhathoki
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views1 page

Assignment 4 - OS Nepalaya

The document discusses memory management techniques used in operating systems including memory hierarchy, virtual memory, page replacement algorithms like FIFO and LRU, physical vs virtual addresses, segmentation, paging, demand paging, and page faults.

Uploaded by

Manish Budhathoki
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Deadline 30th June 2023

Unit 5: Memory Management

1. Explain the memory hierarchy in memory management.


2. What are the major activities of an operating system in regard to memory management?
3. Define memory management. Explain different memory management strategies.
4. What are the different partition selection algorithms used in memory management? Explain
with example.
5. Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the
First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 112K, and 426K (in
order)? Which algorithm makes the most efficient use of memory?
6. What is the difference between a physical address and a virtual address?
7. Why are segmentation and paging sometimes combined into one scheme?
8. Under what circumstances do page faults occur? Describe the actions taken by the operating
system when a page fault occurs
9. Define page replacement. Discuss FIFO page replacement system with example.
10. What do you understand by principle of optimality? Explain any two page replacement
algorithms.
11. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the following replacement algorithms, assuming three,
frames? Remember all frames are initially empty,
a) LRU replacement b) FIFO replacement c) Optimal replacement
12. Give references to the following pages by a program: 1, 2, 3, 2, 1, 5, 2, 1, 6, 2, 5, 6, 3, 1, 3, 6, 1, 2,
4, 3. How many page faults will occur if the program has three page frames available to it and use
LRU, FIFO and Optimal Page replacement algorithms?
13. What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing,
what can the system do to eliminate this problem
14. What is memory fragmentation? Explain demand paging in virtual memory.
15. What do you understand by virtual memory? Explain about TLB in detail.
16. What is Cache memory? Differentiate between paging and segmentation.
17. What are the difference between a page and page frame? Discuss demand paging in virtual
memory.
18. What do you mean by Coalescing and Compaction?
19. Explain segmentation with paging in detail with suitable example.

You might also like