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
3
votes
1
answer
1
GO Classes 2023 | IIITH Mock Test 1 | Question: 30
A $\text{10-unit}$ ...
GO Classes
asked
in
Operating System
Mar 26, 2023
by
GO Classes
449
views
goclasses2023-iiith-mock-1
goclasses
operating-system
memory-management
resource-allocation
1-mark
0
votes
2
answers
2
Zeal Testseries
I’m getting 2 as the answer, but the correct one given by them is 5. Somebody please confirm.
DAWID15
asked
in
Operating System
Dec 19, 2022
by
DAWID15
712
views
zeal
test-series
operating-system
resource-allocation
1
vote
2
answers
3
#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?
Dknights
asked
in
Operating System
Dec 5, 2022
by
Dknights
743
views
operating-system
resource-allocation
made-easy-test-series
deadlock-prevention-avoidance-detection
0
votes
1
answer
4
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
Souvik33
asked
in
Operating System
Nov 20, 2022
by
Souvik33
935
views
deadlock-prevention-avoidance-detection
operating-system
resource-allocation
normal
2
votes
1
answer
5
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
Souvik33
asked
in
Operating System
Nov 19, 2022
by
Souvik33
858
views
operating-system
resource-allocation
normal
multiple-selects
1
vote
0
answers
6
Deadlocks
Definition of a set of deadlocked Processes: “A set of processes is deadlocked if each process in the set is waiting for an event that only another process in the set can cause.” P1, P2, and P3 have caused deadlock but every process including P4 is in the deadlocked set of processes, isn’t it?
lolalo
asked
in
Operating System
Aug 19, 2022
by
lolalo
554
views
operating-system
deadlock-prevention-avoidance-detection
resource-allocation
12
votes
3
answers
7
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.
Arjun
asked
in
Operating System
Feb 15, 2022
by
Arjun
12.0k
views
gatecse-2022
operating-system
resource-allocation
multiple-selects
1-mark
2
votes
2
answers
8
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 15
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$
Lakshman Bhaiya
asked
in
Operating System
Apr 1, 2020
by
Lakshman Bhaiya
966
views
nielit2017oct-assistanta-it
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
5
votes
1
answer
9
NIELIT 2016 DEC Scientist B (CS) - Section B: 56
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
Lakshman Bhaiya
asked
in
Operating System
Mar 31, 2020
by
Lakshman Bhaiya
3.0k
views
nielit2016dec-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
0
votes
1
answer
10
NIELIT 2017 July Scientist B (CS) - Section B: 36
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$ ... $ \max(X_{p},X_{q})>1$ $ \min(X_{p},X_{q})>1$
Lakshman Bhaiya
asked
in
Operating System
Mar 30, 2020
by
Lakshman Bhaiya
843
views
nielit2017july-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
0
votes
1
answer
11
NIELIT 2017 July Scientist B (CS) - Section B: 37
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 ... following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
Lakshman Bhaiya
asked
in
Operating System
Mar 30, 2020
by
Lakshman Bhaiya
931
views
nielit2017july-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
1
vote
3
answers
12
NIELIT 2017 July Scientist B (CS) - Section B: 38
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$
Lakshman Bhaiya
asked
in
Operating System
Mar 30, 2020
by
Lakshman Bhaiya
3.1k
views
nielit2017july-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
0
votes
3
answers
13
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
Lakshman Bhaiya
asked
in
Operating System
Mar 30, 2020
by
Lakshman Bhaiya
1.1k
views
nielit2017dec-scientistb
operating-system
resource-allocation
0
votes
0
answers
14
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 43 (Page No. 470)
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. ... system. In case there is, the program should print out the identities of all processes that are deadlocked.
Lakshman Bhaiya
asked
in
Operating System
Oct 30, 2019
by
Lakshman Bhaiya
805
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
resource-allocation
descriptive
0
votes
1
answer
15
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 9 (Page No. 466)
Fig. 6-3 shows the concept of a resource graph. Do illegal graphs exist, that is, graphs that structurally violate the model we have used of resource usage? If so, give an example of one.
Lakshman Bhaiya
asked
in
Operating System
Oct 30, 2019
by
Lakshman Bhaiya
515
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
resource-allocation
descriptive
0
votes
2
answers
16
MadeEasy Workbook: Operating System - Resource Allocation
Jyoti Kumari97
asked
in
Operating System
Jan 14, 2019
by
Jyoti Kumari97
915
views
operating-system
resource-allocation
made-easy-booklet
0
votes
1
answer
17
MadeEasy Workbook: Operating System - Resource Allocation
A. X=40,Y=20 B.X=50,Y=10 C.X=30,Y=20 D. X=20,Y=30
Jyoti Kumari97
asked
in
Operating System
Jan 14, 2019
by
Jyoti Kumari97
611
views
operating-system
resource-allocation
made-easy-booklet
3
votes
4
answers
18
MadeEasy Test Series: Operating System - Resource Allocation
Shankar Kakde
asked
in
Operating System
Jan 9, 2019
by
Shankar Kakde
1.2k
views
test-series
made-easy-test-series
deadlock-prevention-avoidance-detection
resource-allocation
1
vote
1
answer
19
Deadlocks
Hardik Vagadia
asked
in
Operating System
Jan 9, 2019
by
Hardik Vagadia
618
views
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
1
vote
1
answer
20
GATE Overflow | Mock GATE | Test 1 | Question: 63
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$
Ruturaj Mohanty
asked
in
Operating System
Dec 27, 2018
by
Ruturaj Mohanty
671
views
go-mockgate-1
operating-system
deadlock-prevention-avoidance-detection
resource-allocation
0
votes
1
answer
21
MadeEasy Test Series: Operating System - Resource Allocation
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______
Lakshman Bhaiya
asked
in
Operating System
Dec 22, 2018
by
Lakshman Bhaiya
2.8k
views
made-easy-test-series
operating-system
resource-allocation
0
votes
1
answer
22
MadeEasy Test Series: Operating System - Resource Allocation
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 ... Similar to https://gateoverflow.in/220031/deadlock. It seems many answers are possible and no proper explanation is present.
Gupta731
asked
in
Operating System
Nov 27, 2018
by
Gupta731
1.0k
views
made-easy-test-series
operating-system
resource-allocation
0
votes
0
answers
23
please solve this Q
kallu singh
asked
in
Operating System
Nov 16, 2018
by
kallu singh
235
views
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
0
votes
1
answer
24
MadeEasy Subject Test 2019: Operating System - Resource Allocation
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.
Satbir
asked
in
Operating System
Nov 1, 2018
by
Satbir
1.5k
views
operating-system
resource-allocation
made-easy-test-series
2
votes
1
answer
25
DRDO2009: Operating System - Resource Allocation
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 ... section D: deadlock avoidance schemes required information concerning which resource a process will request and used during its lifetime
mobashshir
asked
in
Operating System
Aug 15, 2018
by
mobashshir
2.3k
views
drdo2009
operating-system
resource-allocation
Page:
1
2
3
next »
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
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions tagged resource-allocation
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation