4. Deadlock avoidance | #Bankers algorithm | #Safetyalgorithm | Operating system

preview_player
Показать описание
This video explains on deadlock avoidance using Banker's algorithm in operating system.
#bankersalgorithm, #deadlockavoidance, #safetyalgorithm, #operatingsystem, #deadlockavoidance,#deadlock,#operatingsystems,#bankersalgorithm,#safetyalgorithm,#maximumresources,#maximumneed,#availableresources,#needmatrix,#safestate,#unsafestate,#safesequence,#allocationvector,#deadlock avoidance,#bankers algorithm,#operating system,#deadlock prevention,#deadlock avoidance in os,#what is deadlock,#bankers safety algorithm,#deadlockdetection,#write about deadlock conditions and bankers' algorithm in detail
Рекомендации по теме
Комментарии
Автор

Thanks, I have an exam in two days and your clear explanation helped me to understand how to calculate safety algorithm.

MohamedHassan-tkbq
Автор

I understand thanks you akka🤓 I hear it.😊

nikhilffxd
Автор

Mam can u please upload the Automata theory and compiler design video

komalap
Автор

Excellent Explanation of the topic! Thank you so much mam, you made the question look easy for me...

AllanSJoseph
Автор

The solution is weight for this problem but what if while checking p1 p2 p3 is safe or not if p1 is safe and p2 is not safe then p3 is safe then again coming to p2 after updating the work value if need<=work condition fails here for this then is it unsafe or else...

narmadharevanth