search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Recent questions tagged resource-allocation

2 votes
2 answers
1
Consider a system having $’m’$ resources of the same type. These 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$
asked Apr 1, 2020 in Operating System Lakshman Patel RJIT 287 views
5 votes
1 answer
2
Consider a system with $m$ resources of same type being shared by $n$ processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only if The sum of all max needs is $< m+n$ The sum of all max needs is $>m+n$ Both of above None
asked Mar 31, 2020 in Operating System Lakshman Patel RJIT 513 views
0 votes
1 answer
3
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 holding the $X_i$ ... $ \max(X_{p},X_{q})>1$ $ \min(X_{p},X_{q})>1$
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 239 views
0 votes
0 answers
4
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: if(i%2==0){ if(i<n) request Ri; if(i+2<n) request Ri+2; } else{ if(i<n) request Rnβˆ’i; if(i+2<n) ... ; } In 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$
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 197 views
1 vote
3 answers
5
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________. $6$ $7$ $8$ $9$
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 500 views
0 votes
1 answer
6
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
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 308 views
0 votes
0 answers
7
Write a program that detects if there is a deadlock in the system by using a resource allocation graph. Your program should read from a file the following inputs: the number of processes and the number of resources. For each process if should read four numbers: the ... is a deadlock in the system. In case there is, the program should print out the identities of all processes that are deadlocked.
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 306 views
0 votes
1 answer
8
1 vote
1 answer
12
1 vote
1 answer
13
A system is having user processes $P_1, P_2, \dots , P_N$ each requiring $Q_N, Q_{N-1}, \dots , Q_1$ number of resource instances of resource $R$. The minimum number of resource instances of $R$ to guarantee that deadlock will not occur is $NQ_N - N+1$ $NQ_1 + N-1$ $(Q_1 + Q_2 + … + Q_N) + N – 1$ $(Q_1 + Q_2 + … + Q_N) + 1 – N$
asked Dec 27, 2018 in Operating System Ruturaj Mohanty 222 views
0 votes
1 answer
14
Consider a system which has $28$ instances of a resource $P$ such that $4+n$ processes share them,$4$ process request $5$ instances of $'P'.$ If $n$ process request $5$ instances of same resources what is the maximum value of $n$ such that system is in safe state______
asked Dec 22, 2018 in Operating System Lakshman Patel RJIT 1.2k views
0 votes
1 answer
15
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock-free ________. Answer 120. Similar to https://gateoverflow.in/220031/deadlock. It seems many answers are possible and no proper explanation is present.
asked Nov 27, 2018 in Operating System Gupta731 486 views
0 votes
1 answer
16
A system has 28 instances of resource P such that 4+n processes share them, 4 process request 5 instances of P. If n processes request 5 instances of same resource what is maximum value of n such that the system is in safe state.(ans=2).pls explain.
asked Nov 1, 2018 in Operating System Satbir 786 views
2 votes
1 answer
17
which of the following is true? a:resource preemption is allowed in deadlock can be avoided but cannot be prevented B: if the number of shared resources is greater than the number of process then deadlock can be prevented C: deadlock can ... enters the critical section D: deadlock avoidance schemes required information concerning which resource a process will request and used during its lifetime
asked Aug 15, 2018 in Operating System mobashshir 1.1k views
0 votes
1 answer
18
0 votes
1 answer
19
0 votes
0 answers
20
I have a Small Doubt whenever in questions of resource allocation suppose we have two independent request R1 and R2 so now and currently we are in safe state.Say I Fulfilled the request $R1$ so now when i will fulfill for $R2$ will i use the original table before ... or the tables after $R1$(Table refer to allocation,Max and Need ). I guess the table after allocation rt but still not confirmed ?
asked Mar 26, 2018 in Operating System Na462 317 views
4 votes
2 answers
22
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
asked Jan 14, 2018 in Operating System rohit vishkarma 566 views
1 vote
1 answer
23
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 _______.
asked Dec 30, 2017 in Operating System sunita24 390 views
0 votes
1 answer
24
2 votes
2 answers
25
System with 100 process and single resource R with 100 instances. Each process needs a minimum of one instances to complete. Deadlock is possible Starvation is possible Thrashing Deadlock is not possible
asked Nov 12, 2017 in Operating System hacker16 485 views
8 votes
3 answers
27
What problem is solved by Dijikstra banker' algorithm? Mutual exclusion Deadlock recovery Deadlock avoidance Cache coherence
asked May 7, 2017 in Operating System sh!va 3.7k views
24 votes
7 answers
28
A system shares $9$ ... of the following best describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked
asked Feb 14, 2017 in Operating System Arjun 7.5k views
3 votes
2 answers
30
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 _____
asked Jan 11, 2017 in Operating System Nithish 1.4k views
...