Scribd
Upload
14 views1 page

Assignments

The document outlines several assignments related to computer memory management and file systems. It covers topics such as memory fragmentation, virtual memory concepts, memory allocation algorithms, page replacement policies, file allocation mechanisms, and disk scheduling techniques. Each assignment includes specific questions that require detailed explanations and calculations.

Uploaded by

Priyadarshini Badgujar
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
14 views1 page

Assignments

The document outlines several assignments related to computer memory management and file systems. It covers topics such as memory fragmentation, virtual memory concepts, memory allocation algorithms, page replacement policies, file allocation mechanisms, and disk scheduling techniques. Each assignment includes specific questions that require detailed explanations and calculations.

Uploaded by

Priyadarshini Badgujar
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

Assignment 4

1. Explain different types of memory fragmentation.


2. Explain virtual memory concept with respect to paging, segmentation and TLB.
3. Given a Memory partition of 100 K, 500K, 200K,300K and 600K in order, how
would each of the First-fit, Best-fit and Worst-fit algorithms place the processes of
212K, 417K, 112K and 426K in order? Which algorithm makes the most efficient
use of memory.
4. Calculate number of page faults and page hits for the page replacement policies
FIFO, Optimal and LRU for given reference string 6 0 5 2 0 3 0 4 2 3 0 3 2 5 2 0 5
6 0 5. Frame size=3.
5. Explain Thrashing.

Assignment 5
1. Explain different File allocation Mechanism and their advantages.
2. Explain File management in UNIX.

Assignment 6
1. Explain interrupt driven IO and discuss the advantages of interrupt driven IO over
programmed IO.
2. Explain disk scheduling techniques.
3. Suppose that a disk has 5000 cylinders, numbered 0 to 4999. The drive is
currently serving a request at cylinder 143, and the previous request was at
cylinder 125. The queue of pending requests in FIFO is ordered as
80,1470,913,1777,948,1022,1750,130. What is the total distance that the disk arm
moves for by applying the following algorithms.
1) FCFS 2) SSTF 3) LOOK 4) SCAN 5) C-SCAN 6) C-LOOK

You might also like