Scribd
Upload
20 views2 pages

Assignment 4

OS assignments

Uploaded by

manoj.shinde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views2 pages

Assignment 4

OS assignments

Uploaded by

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

Assignment No- 04

Subject- Operating System


1 Write a short note on memory management.
2 Explain contiguous memory management technique.
3 Write a short note on Belady’s anomaly.
4 Differentiate paging and segmentation.
5 Explain the placement algorithm with suitable example.
6 Explain FIFO with suitable example.
7 Explain LRU with suitable example.
8 Explain Optimal page replacement algorithm with suitable example.
9 Write a short note on virtual memory.
1
Explain thrashing with suitable example. And also explain method to avoid thrashing.
0
11 Explain non-contiguous memory management technique.
1 Explain internal fragmentation, external fragmentation & compaction with suitable
2 example.
1
Why are segmentation and paging sometimes combined into one scheme?
3
1
What is copy-on write feature and under what circumstances it is beneficial?
4
1
Explain the purpose of paging the page table?
5
1
What is the main function of the memory-management unit?
6
1
Write short on: a. multiprogramming with fixed & variable partition.
7
1
What is virtual memory? How it is implemented
8
1
What is demand paging? Explain it with address translation mechanism used. What are its
9
2
Explain hierarchical page table and inverted page table.
0
2 Explain static partitioned allocation with partition sizes 300,150, 100, 200, 20. Assuming
1 first fit method indicate the memory status after memory request for sizes 80, 180, 280,
380, 30
2
Write short note on: Relocation problem for multiprogramming with fixed partitions.
2
2 Consider the following reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. Assume there
3 are three frames. Apply LRU replacement algorithm to the reference sting above and find
out how many page faults are produced. Illustrate the LRU page replacement algorithm in
detail and also two feasible implementation of the LRU algorithm
2
Explain about Swapping.
4
2
Discuss the procedure for page fault in demand paging.
5
2
Explain Page Replacement Strategies.
6
2 Explain the difference between logical and physical addresses?
7
2
What do you meant by thrashing?
8
2
Distinguish between page and segment.
9
3
How the problem of external fragmentation can be solved.
0
3
What you mean by compaction? In which situation is it applied.
1
3
What are the major problems to implement Demand Paging?
2
3
Define Secondary Memory.
3
3 Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2,
4 3, 6. Identify the no.of page faults would occur for the following replacement algorithms,
assuming one, two, three, four, five, six, or seven frames? Remember all frames are
initially empty, so your first unique pages will all cost one fault each. a.LRU replacement b.
FIFO replacement c.Optimal replacement
3 What do you mean by Best Fit placement algorithm explain with the help of suitable
5 example?
3 What do you mean by First Fit placement algorithm explain with the help of suitable
6 example?
3 What do you mean by Worst Fit placement algorithm explain with the help of suitable
7 example?
3 What do you mean by Next Fit placement algorithm explain with the help of suitable
8 example?
3
Explain in briefly and compare, fixed and dynamic memory partitioning schemes.
9
4 Consider the following page reference string: 1,2,3,2,5,6,3,4,6,3,7,3,1,5,3,6,3,4,2,4,3,4,5,1
0 Indicate page faults and calculate total number of page faults and successful ratio for FIFO,
optimal and LRU algorithms. Assume there are four frames and initially all the frames are
empty.

You might also like