Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged deadlock-prevention-avoidance-detection
1
votes
2
answers
61
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 5
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It will result in deadlock situation immediately be granted immediately be rejected be granted as soon as it is released by $A$
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It willresult in deadlock situationimmediately be grantedimmedi...
admin
944
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-it
databases
transaction-and-concurrency
deadlock-prevention-avoidance-detection
+
–
2
votes
2
answers
62
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$
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. ...
admin
975
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-it
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
1
votes
1
answer
63
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 34
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It will result in deadlock situation immediately be granted immediately be rejected be granted as soon as it is released by $A$
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It willresult in deadlock situationimmediately be grantedimmedi...
admin
1.8k
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-cs
databases
transaction-and-concurrency
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
64
NIELIT 2016 DEC Scientist B (IT) - Section B: 48
The Banker's algorithm is used: to rectify deadlock. to prevent deadlock. to detect deadlock. to detect and solve deadlock.
The Banker's algorithm is used:to rectify deadlock.to prevent deadlock.to detect deadlock.to detect and solve deadlock.
admin
1.2k
views
admin
asked
Mar 31, 2020
Operating System
nielit2016dec-scientistb-it
operating-system
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
5
votes
1
answer
65
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
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 de...
admin
3.1k
views
admin
asked
Mar 31, 2020
Operating System
nielit2016dec-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
66
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$
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 o...
admin
848
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
67
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$
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 fol...
admin
942
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
1
votes
3
answers
68
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$
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 nev...
admin
3.1k
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
1
votes
2
answers
69
UGC NET CSE | December 2005 | Part 2 | Question: 40
Banker's algorithm is used for __________ purpose : Deadlock avoidance Deadlock removal Deadlock prevention Deadlock continuations
Banker's algorithm is used for __________ purpose :Deadlock avoidanceDeadlock removalDeadlock preventionDeadlock continuations
go_editor
842
views
go_editor
asked
Mar 27, 2020
Operating System
ugcnetcse-dec2005-paper2
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
2
votes
2
answers
70
ISRO2020-29
An aid to determine the deadlock occurrence is resource allocation graph starvation graph inversion graph none of the above
An aid to determine the deadlock occurrence isresource allocation graphstarvation graphinversion graphnone of the above
Satbir
2.2k
views
Satbir
asked
Jan 13, 2020
Operating System
isro-2020
operating-system
deadlock-prevention-avoidance-detection
easy
+
–
2
votes
1
answer
71
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 44 (Page No. 470)
In certain countries, when two people meet they bow to each other. The protocol is that one of them bows first and stays down until the other one bows. If they bow at the same time, they will both stay bowed forever. Write a program that does not deadlock.
In certain countries, when two people meet they bow to each other. The protocol is that one of them bows first and stays down until the other one bows. If they bow at the...
admin
682
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
0
answers
72
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.
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 num...
admin
809
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
resource-allocation
descriptive
+
–
0
votes
0
answers
73
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 42 (Page No. 470)
Write a program to implement the deadlock detection algorithm with multiple resources of each type. Your program should read from a file the following inputs: the number of processes, the number of resource types, the ... . In case there is, the program should print out the identities of all processes that are deadlocked.
Write a program to implement the deadlock detection algorithm with multiple resources of each type. Your program should read from a file the following inputs: the number ...
admin
339
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
0
answers
74
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 41 (Page No. 470)
Program a simulation of the banker’s algorithm. Your program should cycle through each of the bank clients asking for a request and evaluating whether it is safe or unsafe. Output a log of requests and decisions to a file.
Program a simulation of the banker’s algorithm. Your program should cycle through each of the bank clients asking for a request and evaluating whether it is safe or uns...
admin
408
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
bankers-algorithm
descriptive
+
–
0
votes
0
answers
75
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 40 (Page No. 469)
Repeat the previous problem, but now avoid starvation. When a baboon that wants to cross to the east arrives at the rope and finds baboons crossing to the west, he waits until the rope is empty, but no more westward-moving baboons are allowed to start until at least one baboon has crossed the other way.
Repeat the previous problem, but now avoid starvation. When a baboon that wants to cross to the east arrives at the rope and finds baboons crossing to the west, he waits ...
admin
314
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
starvation
descriptive
+
–
0
votes
0
answers
76
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 39 (Page No. 469)
A student majoring in anthropology and minoring in computer science has embarked on a research project to see if African baboons can be taught about deadlocks. He locates a deep canyon and fastens a rope across ... . Do not worry about a series of eastward-moving baboons holding up the westward-moving baboons indefinitely.
A student majoring in anthropology and minoring in computer science has embarked on a research project to see if African baboons can be taught about deadlocks. He locates...
admin
565
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
semaphore
descriptive
+
–
0
votes
0
answers
77
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 38 (Page No. 469)
Cinderella and the Prince are getting divorced. To divide their property, they have agreed on the following algorithm. Every morning, each one may send a letter to the other's lawyer requesting one item of ... vacation, the computers are still negotiating. Why? Is deadlock possible? Is starvation possible? Discuss your answer.
Cinderella and the Prince are getting divorced. To divide their property, they have agreed on the following algorithm. Every morning, each one may send a letter to the ot...
admin
647
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
0
answers
78
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 37 (Page No. 469)
A program contains an error in the order of cooperation and competition mechanisms, resulting in a consumer process locking a mutex (mutual exclusion semaphore) before it blocks on an empty buffer. The producer process ... the producer. Is this a resource deadlock or a communication deadlock? Suggest methods for its control.
A program contains an error in the order of cooperation and competition mechanisms, resulting in a consumer process locking a mutex (mutual exclusion semaphore) before it...
admin
241
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
0
answers
79
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 36 (Page No. 468 - 469)
Local Area Networks utilize a media access method called CSMA/CD, in which stations sharing a bus can sense the medium and detect transmissions as well as collisions. In the Ethernet protocol, stations requesting the ... or a livelock? Can you suggest a solution to this anomaly? Can starvation occur with this scenario?
Local Area Networks utilize a media access method called CSMA/CD, in which stations sharing a bus can sense the medium and detect transmissions as well as collisions. In ...
admin
223
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
0
answers
80
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 35 (Page No. 468)
Assume two processes are issuing a seek command to reposition the mechanism to access the disk and enable a read command. Each process is interrupted before executing its read, and discovers that the other has moved the ... . Is this a resource deadlock or a livelock? What methods would you recommend to handle the anomaly?
Assume two processes are issuing a seek command to reposition the mechanism to access the disk and enable a read command. Each process is interrupted before executing its...
admin
206
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
1
answer
81
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 34 (Page No. 468)
Explain the differences between deadlock, livelock, and starvation.
Explain the differences between deadlock, livelock, and starvation.
admin
460
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
0
answers
82
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 33 (Page No. 468)
Main memory units are preempted in swapping and virtual memory systems. The processor is preempted in time-sharing environments. Do you think that these preemption methods were developed to handle resource deadlock or for other purposes? How high is their overhead?
Main memory units are preempted in swapping and virtual memory systems. The processor is preempted in time-sharing environments. Do you think that these preemption method...
admin
240
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
0
answers
83
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 32 (Page No. 468)
A computer science student assigned to work on deadlocks thinks of the following brilliant way to eliminate deadlocks. When a process requests a resource, it specifies a time limit. If the process blocks because the resource ... allowed to run again. If you were the professor, what grade would you give this proposal and why?
A computer science student assigned to work on deadlocks thinks of the following brilliant way to eliminate deadlocks. When a process requests a resource, it specifies a ...
admin
339
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
2
answers
84
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 31 (Page No. 468)
One way to prevent deadlocks is to eliminate the hold-and-wait condition. In the text it was proposed that before asking for a new resource, a process must first release whatever resources it already holds ( ... new resource but lose some of the existing ones to competing processes. Propose an improvement to this scheme.
One way to prevent deadlocks is to eliminate the hold-and-wait condition. In the text it was proposed that before asking for a new resource, a process must first release ...
admin
707
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
1
answer
85
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 30 (Page No. 468)
In an electronic funds transfer system, there are hundreds of identical processes that work as follows. Each process reads an input line specifying an amount of money, the account to be credited, and the account to be ... , solutions that lock one account and then release it immediately if the other is locked are not allowed.)
In an electronic funds transfer system, there are hundreds of identical processes that work as follows. Each process reads an input line specifying an amount of money, th...
admin
539
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
1
answer
86
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 29 (Page No. 468)
A distributed system using mailboxes has two $IPC$ primitives, send and receive. The latter primitive specifies a process to receive from and blocks if no message from that process is available, even though ... no shared resources, but processes need to communicate frequently about other matters. Is deadlock possible? Discuss.
A distributed system using mailboxes has two $IPC$ primitives, send and receive. The latter primitive specifies a process to receive from and blocks if no message from th...
admin
775
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
1
answer
87
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 28 (Page No. 468)
Two processes, $A$ and $B,$ each need three records, $1, 2,$ and $3,$ in a database. If $A$ asks for them in the order $1, 2, 3,$ and $B$ asks for them in the same order, deadlock ... or six possible combinations in which each process can request them. What fraction of all the combinations is guaranteed to be deadlock free?
Two processes, $A$ and $B,$ each need three records, $1, 2,$ and $3,$ in a database. If $A$ asks for them in the order $1, 2, 3,$ and $B$ asks for them in the same order,...
admin
533
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
2
votes
0
answers
88
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 27 (Page No. 467)
One way to eliminate circular wait is to have rule saying that a process is entitled only to a single resource at any moment. Give an example to show that this restriction is unacceptable in many cases.
One way to eliminate circular wait is to have rule saying that a process is entitled only to a single resource at any moment. Give an example to show that this restrictio...
admin
321
views
admin
asked
Oct 30, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
11
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register