Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Which of the following is not true with respe...
Start Learning for Free
Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?
- a)In deadlock prevention, the request for resources is always granted if resulting state is safe
- b)In deadlock avoidance, the request for resources is always granted, if the resulting state is safe
- c)Deadlock avoidance requires knowledge of resource requirements a priori
- d)Deadlock prevention is more restrictive than deadlock avoidance
Correct answer is option 'A'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Which of the following is not true with respect to deadlock prevention...
Deadlock Prevention: Deadlocks can be prevented by preventing at least one of the four required
conditions:
1. Mutual Exclusion – not required for sharable resources; must hold for non-sharable resources.
2. Hold and Wait – must guarantee that whenever a process requests a resource, it does not hold any other resources. Require process to request and be allocated all its sources before it begins execution, or allow process to request resources only when the process has none. Low resource utilization; starvation possible. Restrain the ways request can be made.
3. No Pre-emption – If a process that is holding some resources requests another resource that cannot be immediately allocated to it, and then all resources currently being held are released. Pre-empted resources are added to the list of resources for which the process is waiting. Process will be restarted only when it can regain its old resources, as well as the new ones that it is requesting.
4. Circular Wait – impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration.
Most Upvoted Answer
Which of the following is not true with respect to deadlock prevention...
Deadlock Prevention and Deadlock Avoidance Schemes
Deadlock prevention and deadlock avoidance are two different strategies used to handle the problem of deadlock in operating systems. While both aim to prevent or avoid deadlocks, they have different approaches and requirements. Let's examine each option and determine which one is not true.
a) In deadlock prevention, the request for resources is always granted if the resulting state is safe
This statement is not true. Deadlock prevention aims to prevent the occurrence of deadlocks by ensuring that the system is always in a safe state. In this approach, requests for resources may be denied even if the resulting state is safe. The goal is to avoid the possibility of future deadlocks by ensuring that the system always remains in a safe state.
b) In deadlock avoidance, the request for resources is always granted if the resulting state is safe
This statement is true. Deadlock avoidance, also known as bankers algorithm, uses a careful resource allocation strategy to ensure that the system remains in a safe state. If a resource request can be granted without leading to a deadlock, it is allowed. This approach requires knowledge of resource requirements a priori and performs a resource allocation check before granting the request.
c) Deadlock avoidance requires knowledge of resource requirements a priori
This statement is true. Deadlock avoidance requires knowledge of resource requirements a priori, meaning that the system needs to know in advance the maximum number of resources that a process may need during its execution. This information is used to determine if a resource request can be granted without leading to a deadlock. The system uses algorithms like the bankers algorithm to allocate resources in a way that avoids deadlocks.
d) Deadlock prevention is more restrictive than deadlock avoidance
This statement is true. Deadlock prevention is more restrictive than deadlock avoidance. Deadlock prevention aims to prevent the occurrence of deadlocks by denying resource requests if granting them may lead to a deadlock. This approach can be overly restrictive and may result in resource underutilization. On the other hand, deadlock avoidance allows resource requests to be granted if they do not lead to a deadlock, resulting in better resource utilization.
In conclusion, option 'a' is not true because in deadlock prevention, the request for resources is not always granted even if the resulting state is safe.
Deadlock prevention and deadlock avoidance are two different strategies used to handle the problem of deadlock in operating systems. While both aim to prevent or avoid deadlocks, they have different approaches and requirements. Let's examine each option and determine which one is not true.
a) In deadlock prevention, the request for resources is always granted if the resulting state is safe
This statement is not true. Deadlock prevention aims to prevent the occurrence of deadlocks by ensuring that the system is always in a safe state. In this approach, requests for resources may be denied even if the resulting state is safe. The goal is to avoid the possibility of future deadlocks by ensuring that the system always remains in a safe state.
b) In deadlock avoidance, the request for resources is always granted if the resulting state is safe
This statement is true. Deadlock avoidance, also known as bankers algorithm, uses a careful resource allocation strategy to ensure that the system remains in a safe state. If a resource request can be granted without leading to a deadlock, it is allowed. This approach requires knowledge of resource requirements a priori and performs a resource allocation check before granting the request.
c) Deadlock avoidance requires knowledge of resource requirements a priori
This statement is true. Deadlock avoidance requires knowledge of resource requirements a priori, meaning that the system needs to know in advance the maximum number of resources that a process may need during its execution. This information is used to determine if a resource request can be granted without leading to a deadlock. The system uses algorithms like the bankers algorithm to allocate resources in a way that avoids deadlocks.
d) Deadlock prevention is more restrictive than deadlock avoidance
This statement is true. Deadlock prevention is more restrictive than deadlock avoidance. Deadlock prevention aims to prevent the occurrence of deadlocks by denying resource requests if granting them may lead to a deadlock. This approach can be overly restrictive and may result in resource underutilization. On the other hand, deadlock avoidance allows resource requests to be granted if they do not lead to a deadlock, resulting in better resource utilization.
In conclusion, option 'a' is not true because in deadlock prevention, the request for resources is not always granted even if the resulting state is safe.
Free Test
FREE
| Start Free Test |
Community Answer
Which of the following is not true with respect to deadlock prevention...
Deadlock Prevention: Deadlocks can be prevented by preventing at least one of the four required
conditions:
1. Mutual Exclusion – not required for sharable resources; must hold for non-sharable resources.
2. Hold and Wait – must guarantee that whenever a process requests a resource, it does not hold any other resources. Require process to request and be allocated all its sources before it begins execution, or allow process to request resources only when the process has none. Low resource utilization; starvation possible. Restrain the ways request can be made.
3. No Pre-emption – If a process that is holding some resources requests another resource that cannot be immediately allocated to it, and then all resources currently being held are released. Pre-empted resources are added to the list of resources for which the process is waiting. Process will be restarted only when it can regain its old resources, as well as the new ones that it is requesting.
4. Circular Wait – impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer?
Question Description
Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer?.
Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer?.
Solutions for Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?a)In deadlock prevention, the request for resources is always granted if resulting state is safeb)In deadlock avoidance, the request for resources is always granted, if the resulting state is safec)Deadlock avoidance requires knowledge of resource requirements a priorid)Deadlock prevention is more restrictive than deadlock avoidanceCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup