Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for deadlock
83
votes
4
answers
1
GATE CSE 2017 Set 1 | Question: 42
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions $T_{1}$ and $T_{2}$ ... -free. The database system is starvation-free, but not deadlock-free. The database system is neither deadlock-free nor starvation-free.
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions ...
Arjun
27.1k
views
Arjun
asked
Feb 14, 2017
Databases
gatecse-2017-set1
databases
timestamp-ordering
deadlock-prevention-avoidance-detection
normal
+
–
11
votes
4
answers
2
Deadlock
A computer system has 6 tape drives 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 a) 1 b) 2 c) 3 d)4 Ans given is 2....But for 4 processes ... process...so continuing in this way we can allocate resources to each process without any deadlock...... Plz explain why answer given is b)
A computer system has 6 tape drives 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...
dhingrak
37.6k
views
dhingrak
asked
Dec 4, 2014
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
34
votes
5
answers
3
GATE CSE 2018 | Question: 24
Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested and releases only one at a time. The largest value of $K$ that will always avoid deadlock is ___
Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested a...
gatecse
21.9k
views
gatecse
asked
Feb 14, 2018
Operating System
gatecse-2018
operating-system
deadlock-prevention-avoidance-detection
easy
numerical-answers
1-mark
+
–
2
votes
4
answers
4
which of the following is not a necessary condition for deadlock?
which of the following is not a necessary condition for deadlock? a)Mutual exclusion b)Reentrancy c)Hold and Wait d)No pre-emption
which of the following is not a necessary condition for deadlock?a)Mutual exclusionb)Reentrancyc)Hold and Waitd)No pre-emption
ajit
39.5k
views
ajit
asked
Sep 17, 2015
Operating System
deadlock-prevention-avoidance-detection
+
–
5
votes
4
answers
5
'm' processes share 'n' resources of same type. The maximum need of each process does not exceed 'n' and the sum all their maximum needs is always less than m+n. In this setup deadlock can occur or not?
This is a question from Operating System concepts by Silberschatz, Gagne and Galvin. On very first go I could make that in such a situation deadlock can never occur. But ...
Prateek Dwivedi
31.9k
views
Prateek Dwivedi
asked
Jun 27, 2015
Operating System
deadlock-prevention-avoidance-detection
+
–
35
votes
2
answers
6
GATE CSE 2021 Set 2 | Question: 43
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock $(L)$. ... not occur The scheme may lead to live-lock The scheme may lead to starvation The scheme violates the mutual exclusion property
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and ...
Arjun
9.8k
views
Arjun
asked
Feb 18, 2021
Operating System
gatecse-2021-set2
multiple-selects
operating-system
deadlock-prevention-avoidance-detection
2-marks
+
–
2
votes
1
answer
7
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
507
views
GO Classes
asked
Feb 5
Operating System
goclasses2024-mockgate-14
operating-system
process-synchronization
deadlock-prevention-avoidance-detection
2-marks
+
–
0
votes
1
answer
8
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
587
views
24aaaa23
asked
Oct 1, 2023
Operating System
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
+
–
0
votes
0
answers
9
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
60
views
admin
asked
Jan 6
Others
ugcnetcse-june2008-paper2
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
10
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
377
views
Souvik33
asked
Dec 19, 2022
Databases
databases
deadlock-prevention-avoidance-detection
operating-system
multiple-selects
+
–
0
votes
2
answers
11
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.6k
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
12
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
267
views
roopkathaaa
asked
Sep 2, 2023
Operating System
operating-system
threads
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
13
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
302
views
roopkathaaa
asked
Sep 2, 2023
Operating System
operating-system
threads
deadlock-prevention-avoidance-detection
made-easy-test-series
+
–
0
votes
1
answer
14
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
839
views
roopkathaaa
asked
Sep 2, 2023
Operating System
operating-system
threads
deadlock-prevention-avoidance-detection
made-easy-test-series
minimal-state-automata
+
–
0
votes
2
answers
15
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
821
views
shivajikobardan
asked
Jul 22, 2023
Operating System
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
critical-section
mutual-exclusion
+
–
7
votes
6
answers
16
deadlock
If a process is in unsafe state, then: (a) It is in deadlock (b) It might successfully complete (c) It will lead to deadlock (d) None of the above
If a process is in unsafe state, then:(a) It is in deadlock (b) It might successfully complete(c) It will lead to deadlock (d) None of the above
Sunil8860
10.7k
views
Sunil8860
asked
Jul 16, 2017
Operating System
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
0
votes
1
answer
17
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
1.1k
views
Souvik33
asked
Nov 19, 2022
Operating System
deadlock-prevention-avoidance-detection
operating-system
resource-allocation
normal
+
–
52
votes
6
answers
18
GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...
Ishrat Jahan
13.5k
views
Ishrat Jahan
asked
Nov 2, 2014
Operating System
gateit-2004
operating-system
normal
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
19
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.4k
views
JustPakYt
asked
Nov 13, 2022
Computer Networks
computer-networks
network-security
deadlock-prevention-avoidance-detection
counting
+
–
1
votes
2
answers
20
#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
806
views
Dknights
asked
Dec 5, 2022
Operating System
operating-system
resource-allocation
made-easy-test-series
deadlock-prevention-avoidance-detection
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register