Scribd
Upload
18 views1 page

Os Assignmenr

Uploaded by

dusravalorant
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
18 views1 page

Os Assignmenr

Uploaded by

dusravalorant
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

B.

Tech CSE, SE and CC


Assignment 2 (2023-24)
Semester – 4th
Subject Name:Operating System
1. Calculate how many page faults will occur for the following algorithms applied on
given reference string with three-page frames. 1 2 3 2 1 5 2 1 6 2 5 6 3 1 3 6 1 2
4 3, i) FIFO ii) Optimal Page Replacement iii) LRU page replacement
2. Explain how segmentation is achieved using hardware?
3. Explain link list method and bitmap method for dynamic memory management.
4. Write in detail about memory partitioning with fixed and dynamic partitioning with
example.
5. What is physical address and logical address? How the mapping is done in between
them
6. Explain in detail about DMA.
7. Consider a typical disk that rotates at 15000 rotations per minute (RPM) and has a
transfer rate of 50 × 106 bytes/sec. If the average seek time of the disk is twice the
average rotational delay and the controller’s transfer time is 10 times the disk transfer
time, the average time (in milliseconds) to read or write a 512-byte sector of the disk
is
8. Explain techniques for performing I/O and describe eexternal devices that engage in
I/O with computer systems.
9. What is the need of file system? Explain various operations associated with files.
10. Describe file sharing system and describe some of the difficulties while involving
users to share file.
11. Describe the file system architecture
12. Suppose a disk drive has 200 cylinders. The drive is currently serving request at 50.
The queue of pending request in FIFO order is 82,170,43,140,24,16,190. Starting
from the current head position what is the total distance that the disk arm moves to
satisfy the entire pending request for each of the following disk scheduling algorithm
i) SSTF ii) LOOK iii) C-LOOK iv) SCAN

(Subject Teacher)
Ms. Snehal Kathale
Ms. Roshni Patel

NOTE: Submit Assignment before Submission date.


Submission Date: 04/04/2024

You might also like