Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged resource-allocation
6
votes
4
answers
61
ISRO-2013-57
Which of the following is not a necessary condition for deadlock? Mutual exclusion Reentrancy Hold and wait No pre-emption
makhdoom ghaya
asked
in
Operating System
May 2, 2016
by
makhdoom ghaya
3.2k
views
isro2013
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
2
votes
5
answers
62
Resource allocation in packet switching and circuit switching
Resource Reservation is a feature of: A. Circuit Switching B. Packet Switching C. Both (A) and (B) D. None of these PS: In virtual packet switching resouce allocation is done during setup, while in datagram packet switching, there is no allocation. http://www.slideshare.net/mukeshnt/chap-8-switching
Purple
asked
in
Computer Networks
Jan 28, 2016
by
Purple
5.1k
views
network-switching
resource-allocation
computer-networks
3
votes
2
answers
63
Deciding system safe condition from resource allocation graph
Please mention the algorithm(or reference link) as well.
shikharV
asked
in
Operating System
Nov 27, 2015
by
shikharV
1.1k
views
operating-system
resource-allocation
41
votes
4
answers
64
GATE CSE 1997 | Question: 75
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the system) is assigned a unique timestamp are when it starts. The timestamps are monotonically increasing with time. Let us denote ... , show how. If not prove it. Can a process P ever starve? If yes, show how. If not prove it.
go_editor
asked
in
Operating System
Oct 14, 2015
by
go_editor
7.6k
views
gate1997
operating-system
resource-allocation
normal
descriptive
3
votes
3
answers
65
why is the below state although being unsafe not leading to deadlock ?
I got the state to be unsafe since Available is (1,1) which can't satisfy the need of any process so why is not deadlock ?
radha gogia
asked
in
Operating System
Oct 14, 2015
by
radha gogia
828
views
resource-allocation
10
votes
3
answers
66
ISRO2008-62
In which of the following four necessary conditions for deadlock processes claim exclusive control of the resources they require? no preemption mutual exclusion circular wait hold and wait
ajit
asked
in
Operating System
Sep 20, 2015
by
ajit
6.7k
views
isro2008
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
1
vote
1
answer
67
Please solve this
Jarvis
asked
in
Operating System
Jun 16, 2015
by
Jarvis
480
views
operating-system
deadlock-prevention-avoidance-detection
resource-allocation
40
votes
4
answers
68
GATE CSE 2015 Set 3 | Question: 52
Consider the following policies for preventing deadlock in a system with mutually exclusive resources. Process should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released. The resources are numbered uniquely, ... and (III) but not (I) or (IV) Any one of (I), (II), (III) and (IV)
go_editor
asked
in
Operating System
Feb 16, 2015
by
go_editor
12.5k
views
gatecse-2015-set3
operating-system
resource-allocation
normal
49
votes
10
answers
69
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$
go_editor
asked
in
Operating System
Feb 12, 2015
by
go_editor
34.0k
views
gatecse-2015-set2
operating-system
resource-allocation
easy
37
votes
3
answers
70
GATE IT 2005 | Question: 62
Two shared resources $R_1$ and $R_2$ are used by processes $P_1$ and $P_2$. Each process has a certain priority for accessing each resource. Let $T_{ij}$ denote the priority of $P_i$ for accessing $R_j$. A process $P_i$ can snatch a resource $R_k$ from process $P_j$ ... that $P_1$ and $P_2$ can never deadlock? (I) and (IV) (II) and (III) (I) and (II) None of the above
Ishrat Jahan
asked
in
Operating System
Nov 3, 2014
by
Ishrat Jahan
8.7k
views
gateit-2005
operating-system
resource-allocation
normal
26
votes
3
answers
71
GATE IT 2008 | Question: 54
An operating system implements a policy that requires a process to release all resources before making a request for another resource. Select the TRUE statement from the following: Both starvation and deadlock can occur Starvation can occur but deadlock cannot occur Starvation cannot occur but deadlock can occur Neither starvation nor deadlock can occur
Ishrat Jahan
asked
in
Operating System
Oct 28, 2014
by
Ishrat Jahan
15.6k
views
gateit-2008
operating-system
resource-allocation
normal
22
votes
3
answers
72
GATE CSE 1996 | Question: 22
A computer system uses the Banker's Algorithm to deal with deadlocks. Its current state is shown in the table below, where $P0$, $P1$, $P2$ are processes, and $R0$, $R1$, $R2$ ... the system can be in this state What will the system do on a request by process $P0$ for one unit of resource type $R1$?
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
8.9k
views
gate1996
operating-system
resource-allocation
normal
descriptive
34
votes
4
answers
73
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
Kathleen
asked
in
Operating System
Oct 5, 2014
by
Kathleen
19.6k
views
gate1994
operating-system
resource-allocation
normal
descriptive
149
votes
6
answers
74
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$
go_editor
asked
in
Operating System
Sep 30, 2014
by
go_editor
29.1k
views
gatecse-2010
operating-system
resource-allocation
normal
23
votes
5
answers
75
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$
Kathleen
asked
in
Operating System
Sep 29, 2014
by
Kathleen
26.5k
views
gate1993
operating-system
resource-allocation
normal
ugcnetcse-dec2012-paper3
multiple-selects
25
votes
6
answers
76
GATE CSE 1997 | Question: 6.7
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 $3$ $5$ $4$ $6$
Kathleen
asked
in
Operating System
Sep 29, 2014
by
Kathleen
17.5k
views
gate1997
operating-system
resource-allocation
normal
22
votes
5
answers
77
GATE CSE 2014 Set 3 | Question: 31
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 _________.
go_editor
asked
in
Operating System
Sep 28, 2014
by
go_editor
13.5k
views
gatecse-2014-set3
operating-system
resource-allocation
numerical-answers
easy
58
votes
2
answers
78
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$
Rucha Shelke
asked
in
Operating System
Sep 26, 2014
by
Rucha Shelke
16.4k
views
gatecse-2006
operating-system
resource-allocation
normal
44
votes
5
answers
79
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.
go_editor
asked
in
Operating System
Sep 26, 2014
by
go_editor
22.0k
views
gatecse-2014-set1
operating-system
resource-allocation
normal
29
votes
4
answers
80
GATE CSE 1998 | Question: 1.32
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $6$ $5$ $4$ $3$
Kathleen
asked
in
Operating System
Sep 25, 2014
by
Kathleen
14.0k
views
gate1998
operating-system
resource-allocation
normal
57
votes
8
answers
81
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)$
Arjun
asked
in
Operating System
Sep 23, 2014
by
Arjun
17.1k
views
gatecse-2013
operating-system
resource-allocation
normal
45
votes
6
answers
82
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)$
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
16.6k
views
gatecse-2005
operating-system
resource-allocation
normal
67
votes
10
answers
83
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
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
33.9k
views
gatecse-2009
operating-system
resource-allocation
normal
25
votes
2
answers
84
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
Kathleen
asked
in
Operating System
Sep 21, 2014
by
Kathleen
10.9k
views
gatecse-2007
operating-system
resource-allocation
normal
35
votes
3
answers
85
GATE CSE 2001 | Question: 19
Two concurrent processes $P1$ and $P2$ want to use resources $R1$ and $R2$ in a mutually exclusive manner. Initially, $R1$ and $R2$ ... . Exchange the statements $Q1$ and $Q3$ and statements $Q2$ and $Q4$. Is mutual exclusion guaranteed now? Can deadlock occur?
Kathleen
asked
in
Operating System
Sep 14, 2014
by
Kathleen
5.5k
views
gatecse-2001
operating-system
resource-allocation
normal
descriptive
30
votes
2
answers
86
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.
Kathleen
asked
in
Operating System
Sep 14, 2014
by
Kathleen
22.1k
views
gatecse-2000
operating-system
resource-allocation
normal
24
votes
4
answers
87
GATE CSE 1992 | Question: 02-xi
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guaranteed to be deadlock-free is: $2$ $3$ $4$ $1$
Kathleen
asked
in
Operating System
Sep 13, 2014
by
Kathleen
5.4k
views
gate1992
operating-system
resource-allocation
normal
multiple-selects
54
votes
4
answers
88
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..
Kathleen
asked
in
Operating System
Sep 12, 2014
by
Kathleen
23.8k
views
gatecse-2008
operating-system
easy
resource-allocation
Page:
« prev
1
2
3
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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 Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged resource-allocation
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...