Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged deadlock-prevention-avoidance-detection
2
votes
1
answer
1
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 37
Suppose that an operating system provides two functions, block() which puts the calling process on the blocked queue, and wakeup(P) which moves process P to the ready queue if it is currently on the blocked queue. ... alternation printing ABABAB . A and B will always run forever with strick alternation printing BABABA . None of these
Suppose that an operating system provides two functions, block() which puts the calling process on the blocked queue, and wakeup(P) which moves process P to the ready que...
GO Classes
406
views
GO Classes
asked
Feb 5
Operating System
goclasses2024-mockgate-14
operating-system
process-synchronization
deadlock-prevention-avoidance-detection
2-marks
+
–
0
votes
0
answers
2
UGC NET CSE | June 2008 | Part 2 | Question: 40
A computer has $6$ tape drives with ' $n$ ' processes competing for them. Each process may need two drives. For which values of ' $n$ ' is the system deadlock free? $1$ $2$ $3$ $6$
A computer has $6$ tape drives with ' $n$ ' processes competing for them. Each process may need two drives. For which values of ' $n$ ' is the system deadlock free?$1$$2$...
admin
57
views
admin
asked
Jan 6
Others
ugcnetcse-june2008-paper2
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
3
syncronization
Consider two processes P1, P2 that access shared binary semaphore variables – S1, S2, S3. Given below is the concurrent execution of these process – here deadlock is possible or not and why? Assume, initially S1 = 1, S2 = 1 and S3 = 1.
Consider two processes P1, P2 that access shared binary semaphore variables – S1, S2, S3. Given below is the concurrent execution of these process –here deadlock is ...
24aaaa23
525
views
24aaaa23
asked
Oct 1, 2023
Operating System
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
+
–
0
votes
2
answers
4
deadlocks and threads operating system
A system has 5 process and 3 resources (A, B, C). The maximum count of resources are (10, 5, 7). Consider the following table of resource allocation. MAX (A B C) Allocated (A B C) P0 7 5 3 0 1 0 P1 3 2 2 2 0 0 P2 9 0 2 3 0 2 P3 2 ... these is a safe sequence in Question 13? P1, P3, P4 , P0, P2 only P2, P4, P3, P1, P0 only Both a and b None are safe sequences
A system has 5 process and 3 resources (A, B, C). The maximum count of resources are (10, 5, 7). Consider the following table of resource allocation. MAX(A B C)Alloc...
roopkathaaa
1.4k
views
roopkathaaa
asked
Sep 2, 2023
Operating System
threads
operating-system
deadlock-prevention-avoidance-detection
minimal-state-automata
made-easy-test-series
+
–
0
votes
1
answer
5
deadlocks and threads operating system
State true or false. Deadlock detection is possible using the allocation and request matrices alone. A way to recover from deadlock is to take away the resource from one of the processes or to kill the process itself. Banker's algorithm is ... deadlocks by analyzing the unsafe states. True, True, False False, True, True True, False, True False, True, False
State true or false.Deadlock detection is possible using the allocation and request matrices alone.A way to recover from deadlock is to take away the resource from one of...
roopkathaaa
803
views
roopkathaaa
asked
Sep 2, 2023
Operating System
operating-system
threads
deadlock-prevention-avoidance-detection
made-easy-test-series
minimal-state-automata
+
–
0
votes
1
answer
6
daedlocks and threads operating system
Suppose we want to synchronize two concurrent process P and Q using binary semaphore S and T. Process P: Process Q: while(1){ while(1){ W: Y: print 0'; print 1'; print 0'; print 1'; X: Z: } Synchronization statements can be inserted only at points W,X,Y,Z. Which of the ... S = T= 1 d. W : P(S) X : V(S) Y : P(T) Z: V(T) and initially S = 1 and T= 0
Suppose we want to synchronize two concurrent process P and Q using binary semaphore S and T.Process P: Process Q: while(1){ ...
roopkathaaa
285
views
roopkathaaa
asked
Sep 2, 2023
Operating System
operating-system
threads
deadlock-prevention-avoidance-detection
made-easy-test-series
+
–
0
votes
1
answer
7
deadlocks and threads operating system
Which of the following is false about User threads? User threads can switch fast since it does not involve kernel. User threads are lightweight since they do not require system calls. Kernel is not aware of the behavior of every user threads i.e. if it is blocking or runnable. None of these
Which of the following is false about User threads? User threads can switch fast since it does not involve kernel. User threads are lightweight since they do not require ...
roopkathaaa
255
views
roopkathaaa
asked
Sep 2, 2023
Operating System
operating-system
threads
deadlock-prevention-avoidance-detection
+
–
0
votes
2
answers
8
What's the standard technique to test if the algorithm satisfies mutual exclusion, progress and bounded waiting or not?
Sorry if this is a stupid question. But it really intrigued me. Same resources at different algorithms are telling different ways to test these stuffs.Here's an algorith...
shivajikobardan
726
views
shivajikobardan
asked
Jul 22, 2023
Operating System
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
critical-section
mutual-exclusion
+
–
0
votes
1
answer
9
Operating System
How c came into picture.
How c came into picture.
Overflow04
315
views
Overflow04
asked
Dec 31, 2022
Operating System
operating-system
counting
deadlock-prevention-avoidance-detection
test-series
+
–
2
votes
2
answers
10
Self Doubt
Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??
Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??
Sunnidhya Roy
645
views
Sunnidhya Roy
asked
Dec 30, 2022
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
1
votes
1
answer
11
Made Easy Mock -1
TusharKumar
393
views
TusharKumar
asked
Dec 29, 2022
Operating System
operating-system
numerical-answers
deadlock-prevention-avoidance-detection
made-easy-test-series
+
–
0
votes
0
answers
12
Made Easy Test Series Question on DeadLock
Q: Consider a system having 22 resources of same type. These resources are shared by 4 processes P,Q,R and S having peak demands of 3, 6, a and b. How many ordered pairs (a,b) are possible such that the system is deadlock free? According to me ... for a process be 0? In that case a-1 or b-1 will become -1 which will impact the inequality. So is this valid?
Q: Consider a system having 22 resources of same type. These resources are shared by 4 processes P,Q,R and S having peak demands of 3, 6, a and b. How many ordered pairs ...
Sunnidhya Roy
492
views
Sunnidhya Roy
asked
Dec 27, 2022
Operating System
made-easy-test-series
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
13
Deadlock prevention techniques | Wait-Die | Wound-Wait
MSQ Which among the following is/are TRUE regarding the deadlock prevention techniques: Wound-wait is premptive Wait-die is non-premptive Starvation is possible in wound-wait Starvation does not occur in wait-die
MSQ Which among the following is/are TRUE regarding the deadlock prevention techniques:Wound-wait is premptiveWait-die is non-premptiveStarvation is possible in wound-wai...
Souvik33
340
views
Souvik33
asked
Dec 19, 2022
Databases
databases
deadlock-prevention-avoidance-detection
operating-system
multiple-selects
+
–
1
votes
2
answers
14
#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
766
views
Dknights
asked
Dec 5, 2022
Operating System
operating-system
resource-allocation
made-easy-test-series
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
15
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
958
views
Souvik33
asked
Nov 19, 2022
Operating System
deadlock-prevention-avoidance-detection
operating-system
resource-allocation
normal
+
–
0
votes
0
answers
16
Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root a=2. a. If user A as public key YA=9 what is as private key XA? b. If user B has public key YB= 3 what is the shared secret key K?
Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root a=2. If user A as public key YA=9 what is as private key XA? If user B has public key YB= 3...
JustPakYt
1.2k
views
JustPakYt
asked
Nov 13, 2022
Computer Networks
computer-networks
network-security
deadlock-prevention-avoidance-detection
counting
+
–
Page:
1
2
3
4
5
6
...
11
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register