Register

Recent questions tagged resource-allocation

0 votes
1 answer
31
Resource allocation
User Avatar
4 votes
2 answers
35
made easy test series
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of ‘N’ is
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 reso...
User Avatar
0 votes
1 answer
37
MadeEasy Test Series: Operating System - Resource Allocation
https://gateoverflow.in/?qa=blob&qa_blobid=16406706223773445572 someone plz help how to detect deadlock in this type of question??
https://gateoverflow.in/?qa=blob&qa_blobid=16406706223773445572someone plz help how to detect deadlock in this type of question??
User Avatar
28 votes
7 answers
40
GATE CSE 2017 Set 2 | Question: 33
A system shares $9$ ... describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked
A system shares $9$ tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below:$$\begin{array}{ccc} \textbf{Process} &...
User Avatar
3 votes
2 answers
42
Deadlocks
Consider a system with processes P0, P1,P2, . . . . P99, P100, each process requires maximum of 4 resources. System has allocated 2 resources to each process. The minimum number of resources should release such that above system is deadlock free is _____
Consider a system with processes P0, P1,P2, . . . . P99, P100, each process requires maximum of 4 resources. System has allocated 2 resources to each process. The minimu...
User Avatar
2 votes
1 answer
47
GATE Overflow | Operating Systems | Test 1 | Question: 20
An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is ____ (assume no other resource requirement)
An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is ____ (assum...
User Avatar
2 votes
2 answers
48
GATE Overflow | Operating Systems | Test 1 | Question: 12
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is - $e^-{15}$ $e^{-5}$ $1 - e^{-5}$ $1-e^{-10}$
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is -$e^-...
User Avatar
4 votes
3 answers
50
UGC NET CSE | June 2012 | Part 2 | Question: 31
Resources are allocated to the process on non-sharable basis is mutual exclusion hold and wait no pre-emption circular wait
Resources are allocated to the process on non-sharable basis ismutual exclusionhold and waitno pre-emptioncircular wait
User Avatar
14 votes
5 answers
51
ISRO2016-46
With single resource, deadlock occurs if there are more than two processes competing for that resources if there are only two processes competing for that resources if there is a single process competing for that resources none of these
With single resource, deadlock occursif there are more than two processes competing for that resourcesif there are only two processes competing for that resourcesif there...
User Avatar
9 votes
7 answers
52
ISRO2016-47
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then Deadlock can never occur Deadlock may occur Deadlock has to occur None of these
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, thenDeadlock can never occurDeadlock may occurDeadlock has to occurNone of these...
User Avatar
9 votes
3 answers
53
ISRO2014-68
What is the minimum number of resources required to ensure that deadlock will never occur, if there are currently three processes $P_1, P_2$ and $P_3$ running in a system whose maximum demand for the resources of same type are 3, 4, and 5 respectively. 3 7 9 10
What is the minimum number of resources required to ensure that deadlock will never occur, if there are currently three processes $P_1, P_2$ and $P_3$ running in a system...
User Avatar
12 votes
4 answers
56
ISRO2015-32
In a lottery scheduler with 40 tickets, how we will distribute the tickets among 4 processes $P_1, P_2, P_3$ and $P_4$ such that each process gets 10%, 5%, 60% and 25% respectively? $P_1$ $P_2$ $P_3$ $P_4$ A 12 4 70 30 B 7 5 20 10 C 4 2 24 10 D 8 5 30 40
In a lottery scheduler with 40 tickets, how we will distribute the tickets among 4 processes $P_1, P_2, P_3$ and $P_4$ such that each process gets 10%, 5%, 60% and 25% re...
User Avatar
8 votes
2 answers
57
ISRO2007-40
Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of ‘m’ that ensures that deadlock will never occur is 11 12 13 14
Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively...
User Avatar
7 votes
2 answers
58
ISRO2009-16
Consider a system having "n" resources of same type. These resources are shared by 3 processes, A, B, C. These have peak demands of 3, 4, and 6 respectively. For what value of "n" deadlock won't occur 15 9 10 13
Consider a system having "n" resources of same type. These resources are shared by 3 processes, A, B, C. These have peak demands of 3, 4, and 6 respectively. For what val...
User Avatar
16 votes
1 answer
59
ISI2013-PCB-CS-5b
A system has $4$ processes $A$, $B$, $C$, $D$ and $5$ allocatable resources $R_1, \: R_2,\: R_3, \: R_4,\: R_5$ ... $0, \: 0,\: X,\: 1,\: 1$. What is the minimum value of $X$ for which this is a safe state? Justify your answer.
A system has $4$ processes $A$, $B$, $C$, $D$ and $5$ allocatable resources $R_1, \: R_2,\: R_3, \: R_4,\: R_5$. The maximum resource requirement for each process and its...
User Avatar
Page: