Scribd
Upload
3 views1 page

Operating Systems 2nd Assignment (1)

The document is an assignment on operating systems covering topics such as deadlock, memory management, and resource allocation. It includes questions on fragmentation, paging, semaphores, and specific problems related to process management and page replacement algorithms. Additionally, it provides a scenario for calculating the Need Matrix and safe sequence for given processes and resources.

Uploaded by

chiranjit.bairagya456
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
3 views1 page

Operating Systems 2nd Assignment (1)

The document is an assignment on operating systems covering topics such as deadlock, memory management, and resource allocation. It includes questions on fragmentation, paging, semaphores, and specific problems related to process management and page replacement algorithms. Additionally, it provides a scenario for calculating the Need Matrix and safe sequence for given processes and resources.

Uploaded by

chiranjit.bairagya456
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

OPERATING SYSTEMS

2ND ASSIGNMENT

1.​ What is Deadlock?


2.​ What are the necessary conditions for deadlock?
3.​ Write short note on : a) Fragmentation
b) Paging
c) Semaphore
d) Reader-Writers Problem
e) RAID
4.​ What do you mean by logical address space and physical address space?
5.​ What do you mean by Swapping?
6.​ What is memory management? Why is memory management important?
7.​ Let there be five processes (P1 to P5) and three resource types A,B and C.
Resource A has 10 instances, B has 5 instances and C has 7 instances. Suppose
that at time 𝑇0 , the following snapshot of the system has been taken:

Allocation ​ ​ ​ Max​ ​ ​ Available


A B C​ ​ A B C A B C

P1​ 0 1 0​ ​ 7 5 3​ ​ 3 3 2

P2​ 2 0 0​ ​ 3 2 2

P3​ 3 0 2 ​ 9 0 2

P4 ​ 2 1 1​ ​ 2 2 2

P5 ​ 0 0 2​ 4 3 3

Find the Need Matrix. Find the safe sequence.

8.​ How many page faults and page hit occur for the following page replacement
algorithm?
a)​ FIFO
or
b)​ LRU
​ Reference String: 7,0,1,2,0,3,0,4,2,3,0,3,1,2,0

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy