Banker's Algorithm in Operating Systems
HTML-код
- Опубликовано: 30 сен 2019
- For all-round preparation with more videos like this, join our all-new course CS Core Subjects today, visit: practice.geeksforgeeks.org/co...
Please Like, Comment and Share the Video among your friends.
Install our Android App:
play.google.com/store/apps/de...
If you wish, translate into local language and help us reach millions of other geeks:
ruclips.net/user/timedtext_cs_p...
Follow us on Facebook:
/ gfgvideos
And Twitter:
/ gfgvideos
Also, Subscribe if you haven't already! :)
Best explanation ive ever heard, finally got it. Thank you
Very well explains the 'Why' of each step. Excellent lecture!
Very well explained! Thank you.
Thank You Sir
Can it is possible for a process to request more resources then it's need in Banker Algorithm ? Does such request will considered valid or feasible, if safe sequence exists ?
Such as a process has allocation(2 1 3) and Max(6 3 2) if i generate need then i get a negative value. So what can i do?
In question paper they will give process, allocation,max need or We only Remember this sir ?
We need allocation and max need to check for safe state
👏👏👏👏👏👏👏
How do we calculate the number of resources?
It's given in the problem.
Sir, I want your all video on OS and Algorithms analysis.. please send me link on mail.