In this video, we dive deep into the intriguing "Deadlock Varsity Question." Whether you're a computer science student preparing for exams or a professional brushing up on concepts, this video will help you understand the complexities of deadlock in operating systems. We'll explore the conditions that lead to deadlocks, how to prevent them, and real-world examples to solidify your understanding. Don't forget to like, share, and subscribe for more content on challenging computer science topics!
---------------------------------------------
#Chapter4
#Deadlock
#QuestionOnDeadlock
Question: A system is having 3 processes each requires 2 units of resources R. The minimum number of units of R requires such that no deadlock will occur?
Answer:

4 resources
We need 4 resources of R because then in worst condition when all the processes request for resource we can give one resource to every process and still one resource will be remaining.
If we give that resource to any process than it will get terminate because one process require only two resources and when they get that their execution will be complete.
Now we have two free resources and two processes that need two resources and hence they will also get executed and thus no deadlock will occur.
If we take 3 resource than deadlock will occur and we are not taking 5 or 6 because we need to find minimum number of resources
#Deadlock #ComputerScience #TechEducation #LearnWithUs #TechTutorials
#OperatingSystem #OS #asadnomanee #banglalecture #CSE
#Lecturelia #MBSTU #MBSTU_CSE
#lecturelia #banglatutorial #bangla