Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for resource-allocation
149
votes
6
answers
1
GATE CSE 2010 | Question: 46
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: $\text{if} (i\%2==0) \{$ $\quad\text{if} (i<n) \text{ request } R_i;$ ... which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as fol...
go_editor
29.0k
views
go_editor
asked
Sep 30, 2014
Operating System
gatecse-2010
operating-system
resource-allocation
normal
+
–
49
votes
10
answers
2
GATE CSE 2015 Set 2 | Question: 23
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could l...
go_editor
33.8k
views
go_editor
asked
Feb 12, 2015
Operating System
gatecse-2015-set2
operating-system
resource-allocation
easy
+
–
67
votes
10
answers
3
GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used....
Kathleen
33.7k
views
Kathleen
asked
Sep 22, 2014
Operating System
gatecse-2009
operating-system
resource-allocation
normal
+
–
44
votes
5
answers
4
GATE CSE 2014 Set 1 | Question: 31
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ and $P2.$ The table given below presents the current system state. ... be permitted. Only REQ2 can be permitted. Both REQ1 and REQ2 can be permitted. Neither REQ1 nor REQ2 can be permitted.
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ a...
go_editor
21.9k
views
go_editor
asked
Sep 26, 2014
Operating System
gatecse-2014-set1
operating-system
resource-allocation
normal
+
–
34
votes
4
answers
5
GATE CSE 1994 | Question: 28
Consider the resource allocation graph in the figure. Find if the system is in a deadlock state Otherwise, find a safe sequence
Consider the resource allocation graph in the figure.Find if the system is in a deadlock stateOtherwise, find a safe sequence
Kathleen
19.6k
views
Kathleen
asked
Oct 5, 2014
Operating System
gate1994
operating-system
resource-allocation
normal
descriptive
+
–
12
votes
3
answers
6
GATE CSE 2022 | Question: 16
Which of the following statements is/are $\text{TRUE}$ with respect to deadlocks? Circular wait is a necessary condition for the formation of deadlock. In a system where each resource has more than one instance, a cycle in its wait-for graph ... the resource-allocation graph of a system, if every edge is an assignment edge, then the system is not in deadlock state.
Which of the following statements is/are $\text{TRUE}$ with respect to deadlocks?Circular wait is a necessary condition for the formation of deadlock.In a system where ea...
Arjun
12.1k
views
Arjun
asked
Feb 15, 2022
Operating System
gatecse-2022
operating-system
resource-allocation
multiple-selects
1-mark
+
–
45
votes
6
answers
7
GATE CSE 2005 | Question: 71
Suppose $n$ processes, $P_1, \dots P_n$ share $m$ identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process $P_i$ is $s_i$, where $s_i > 0$. Which one of the following is a sufficient condition for ensuring that deadlock ... $\displaystyle{\sum_{i=1}^n} \: s_i < (m \times n)$
Suppose $n$ processes, $P_1, \dots P_n$ share $m$ identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process ...
Kathleen
16.5k
views
Kathleen
asked
Sep 22, 2014
Operating System
gatecse-2005
operating-system
resource-allocation
normal
+
–
57
votes
8
answers
8
GATE CSE 2013 | Question: 16
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation (i.e., $wait$) on semaphores $a$, $b,$ and $c$; process $Y$ executes the $P$ operation on semaphores $b$, $c,$ and $d$; process ... $X:$ $P(a)P(b)P(c)$ $Y:$ $P(c)P(b)P(d)$ $Z:$ $P(c)P(d)P(a)$
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation...
Arjun
17.0k
views
Arjun
asked
Sep 23, 2014
Operating System
gatecse-2013
operating-system
resource-allocation
normal
+
–
54
votes
4
answers
9
GATE CSE 2008 | Question: 65
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes? In deadlock prevention, the request for resources is always granted if the resulting state is safe In deadlock avoidance, the request ... safe Deadlock avoidance is less restrictive than deadlock prevention Deadlock avoidance requires knowledge of resource requirements apriori..
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?In deadlock prevention, the request for resources is always granted if the result...
Kathleen
23.7k
views
Kathleen
asked
Sep 12, 2014
Operating System
gatecse-2008
operating-system
easy
resource-allocation
+
–
23
votes
5
answers
10
GATE CSE 1993 | Question: 7.9, UGCNET-Dec2012-III: 41
Consider a system having $m$ resources of the same type. These resources are shared by $3$ processes $A, B$, and $C$ which have peak demands of $3, 4$, and $6$ respectively. For what value of $m$ deadlock will not occur? $7$ $9$ $10$ $13$ $15$
Consider a system having $m$ resources of the same type. These resources are shared by $3$ processes $A, B$, and $C$ which have peak demands of $3, 4$, and $6$ respective...
Kathleen
26.4k
views
Kathleen
asked
Sep 29, 2014
Operating System
gate1993
operating-system
resource-allocation
normal
ugcnetcse-dec2012-paper3
multiple-selects
+
–
30
votes
2
answers
11
GATE CSE 2000 | Question: 2.23
Which of the following is not a valid deadlock prevention scheme? Release all resources before requesting a new resource. Number the resources uniquely and never request a lower numbered resource than the last one requested. Never request a resource after releasing any resource. Request and all required resources be allocated before execution.
Which of the following is not a valid deadlock prevention scheme?Release all resources before requesting a new resource.Number the resources uniquely and never request a ...
Kathleen
22.1k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2000
operating-system
resource-allocation
normal
+
–
28
votes
7
answers
12
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} &...
Arjun
13.5k
views
Arjun
asked
Feb 14, 2017
Operating System
gatecse-2017-set2
operating-system
resource-allocation
normal
+
–
58
votes
2
answers
13
GATE CSE 2006 | Question: 66
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances of $R$ are occupied. Further, for all $i$, process $i$ has placed a request for an additional $y_i$ instances while ... $ \max(x_{p},x_{q})>1$ $ \min(x_{p},x_{q})>1$
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances ...
Rucha Shelke
16.3k
views
Rucha Shelke
asked
Sep 26, 2014
Operating System
gatecse-2006
operating-system
resource-allocation
normal
+
–
25
votes
2
answers
14
GATE CSE 2007 | Question: 57
A single processor system has three resource types $X, Y$ and $Z$, which are shared by three processes. There are $5$ units of each resource type. Consider the following scenario, where the column alloc denotes the number of units of each resource type allocated to each ... $P0$ $P1$ $P2$ None of the above, since the system is in a deadlock
A single processor system has three resource types $X, Y$ and $Z$, which are shared by three processes. There are $5$ units of each resource type. Consider the following ...
Kathleen
10.9k
views
Kathleen
asked
Sep 21, 2014
Operating System
gatecse-2007
operating-system
resource-allocation
normal
+
–
3
votes
1
answer
15
GO Classes 2023 | IIITH Mock Test 1 | Question: 30
A $\text{10-unit}$ ...
A $\text{10-unit}$ heap of memory uses an allocation algorithm in which a block is allocated at the left end of the leftmost block in which it fits. Which of the followin...
GO Classes
482
views
GO Classes
asked
Mar 26, 2023
Operating System
goclasses2023-iiith-mock-1
goclasses
operating-system
memory-management
resource-allocation
1-mark
+
–
0
votes
1
answer
16
Safe State | Deadlock Avoidance | Bankers Algorithm | OS | MSQ
MSQ Which of the following statements is/are TRUE? If safe state exists, deadlock can be avoided if resources are allocated properly If safe state exists, deadlock is never possible in future Unsafe state always leads to ... safe state exists, deadlock is possible, if resources are poorly allocated Unsafe state may lead to a deadlock
MSQ Which of the following statements is/are TRUE?If safe state exists, deadlock can be avoided if resources are allocated properlyIf safe state exists, deadlock is never...
Souvik33
957
views
Souvik33
asked
Nov 19, 2022
Operating System
deadlock-prevention-avoidance-detection
operating-system
resource-allocation
normal
+
–
0
votes
3
answers
17
NIELIT 2017 DEC Scientist B - Section B: 21
A system has $3$ processes sharing $4$ resources. If each process needs a maximum of $2$ units then, deadlock Can never occur Has to occur May occur None of the options
A system has $3$ processes sharing $4$ resources. If each process needs a maximum of $2$ units then, deadlockCan never occurHas to occurMay occurNone of the options
admin
1.1k
views
admin
asked
Mar 30, 2020
Operating System
nielit2017dec-scientistb
operating-system
resource-allocation
+
–
2
votes
1
answer
18
Modified GATE CSE 2017 Set 2 | Question: 33 (MSQ Version)
** MSQ ** A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below: Which of the following best describes the system? Safe state P3 → P2 → P1 and P3 ... never possible as safe states are present Deadlock is possible in future, even tough we have safe state as of now
MSQ A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below: Which of the following best descri...
Souvik33
870
views
Souvik33
asked
Nov 19, 2022
Operating System
operating-system
resource-allocation
normal
multiple-selects
+
–
1
votes
2
answers
19
#MadeEasy
consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, R, and S having peak demands of 3,6, a, and b respectively. How many ordered pairs (a,b) are possible, such that the system is deadlock free?
consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, R, and S having peak demands of 3,6, a, and b respectively. How ma...
Dknights
765
views
Dknights
asked
Dec 5, 2022
Operating System
operating-system
resource-allocation
made-easy-test-series
deadlock-prevention-avoidance-detection
+
–
0
votes
2
answers
20
Zeal Testseries
I’m getting 2 as the answer, but the correct one given by them is 5. Somebody please confirm.
I’m getting 2 as the answer, but the correct one given by them is 5.Somebody please confirm.
DAWID15
720
views
DAWID15
asked
Dec 19, 2022
Operating System
zeal
test-series
operating-system
resource-allocation
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register