Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > 'm'processes share 'n'resourc...
Start Learning for Free
'm' processes share 'n' resources of the 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 set up deadlock
- a)Has to occur
- b)May occur
- c)Can never occur
- d)None of the these
Correct answer is option 'C'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
'm'processes share 'n'resources of the same type. The ...
Assume m = 5 and n = 10
That means, 5 processes are sharing 10 resources and worst case will be if everyone is demanding equal number of cases.
So, for deadlock to be there every process must be holding 2 resources and seeking 1 more resource. This will make total demand to 15, which is nothing but 10 + 5 (m + n).
However, as given maximum demand is always less than (m + n), so we can say there will never be a deadlock.
That means, 5 processes are sharing 10 resources and worst case will be if everyone is demanding equal number of cases.
So, for deadlock to be there every process must be holding 2 resources and seeking 1 more resource. This will make total demand to 15, which is nothing but 10 + 5 (m + n).
However, as given maximum demand is always less than (m + n), so we can say there will never be a deadlock.
Most Upvoted Answer
'm'processes share 'n'resources of the same type. The ...
Introduction:
Deadlock is a situation in which two or more processes are unable to proceed because each is waiting for the other to release a resource. In the given scenario, multiple processes are sharing the same type of resources, where the maximum need of each process does not exceed 'n' and the sum of all their maximum needs is always less than 'm * n'.
Explanation:
The maximum need of each process does not exceed 'n' implies that each process requires a maximum of 'n' resources. The sum of all their maximum needs is always less than 'm * n' implies that the total number of available resources is greater than the maximum needs of all the processes combined.
Example:
Let's consider an example to understand this better. Suppose we have 'm' processes and 'n' resources of the same type. Each process requires a maximum of 'n' resources.
- Process 1 requires 'n' resources.
- Process 2 requires 'n' resources.
- Process 3 requires 'n' resources.
- ...
- Process m requires 'n' resources.
In this case, the sum of all the maximum needs of the processes will be 'm * n'.
If the total number of available resources is greater than 'm * n', then deadlock can never occur because there will always be enough resources for all the processes to complete their execution.
If the total number of available resources is equal to 'm * n', then deadlock may occur if the resources are not managed properly. However, in the given scenario, it is mentioned that the sum of all their maximum needs is always less than 'm * n', which means there will always be some resources available for other processes to use.
Conclusion:
Based on the given conditions, deadlock can never occur in this setup because the maximum needs of each process do not exceed the available resources, and the sum of all their maximum needs is always less than the total number of available resources. Therefore, option 'C' is the correct answer.
Deadlock is a situation in which two or more processes are unable to proceed because each is waiting for the other to release a resource. In the given scenario, multiple processes are sharing the same type of resources, where the maximum need of each process does not exceed 'n' and the sum of all their maximum needs is always less than 'm * n'.
Explanation:
The maximum need of each process does not exceed 'n' implies that each process requires a maximum of 'n' resources. The sum of all their maximum needs is always less than 'm * n' implies that the total number of available resources is greater than the maximum needs of all the processes combined.
Example:
Let's consider an example to understand this better. Suppose we have 'm' processes and 'n' resources of the same type. Each process requires a maximum of 'n' resources.
- Process 1 requires 'n' resources.
- Process 2 requires 'n' resources.
- Process 3 requires 'n' resources.
- ...
- Process m requires 'n' resources.
In this case, the sum of all the maximum needs of the processes will be 'm * n'.
If the total number of available resources is greater than 'm * n', then deadlock can never occur because there will always be enough resources for all the processes to complete their execution.
If the total number of available resources is equal to 'm * n', then deadlock may occur if the resources are not managed properly. However, in the given scenario, it is mentioned that the sum of all their maximum needs is always less than 'm * n', which means there will always be some resources available for other processes to use.
Conclusion:
Based on the given conditions, deadlock can never occur in this setup because the maximum needs of each process do not exceed the available resources, and the sum of all their maximum needs is always less than the total number of available resources. Therefore, option 'C' is the correct answer.
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
'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. Can you explain this answer?
Question Description
'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. 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 'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. 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 'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. Can you explain this answer?.
'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. 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 'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. 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 'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. Can you explain this answer?.
Solutions for 'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. 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 'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. Can you explain this answer?, a detailed solution for 'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. Can you explain this answer? has been provided alongside types of 'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice 'm'processes share 'n'resources of the same type. The maximum need of each process does not exceed 'n'and the sum all their maximumneeds is always less than m + n. In this set up deadlocka)Has to occurb)May occurc)Can never occurd)None of the theseCorrect answer is option 'C'. 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