Ok so we have we are asked if we can give , you have to remember that this is a matrix not the numbers 1,532 and 750. We compare 1 with 0, 5 with 7, 3 with 5 and 2 with 0. If we look at it like this, we see that we cannot actually allocate the amounts required. Hope that explains it =).
I'll watch it again but yes i think I know what you mean as i thought it was the whole numbers at first but then the last few sets kind of threw that out of the window. I'll get a grasp of it, thanks :-)
I like how you didn't skip any of the steps! Even though I skipped past some of the arithmetic I knew, if I were confused all the examples would have helped!! Also, bravo.
I usually don't comment on videos, but this was well explained and simplified the steps nicely. I was struggling to find out what to do with my available and need and it ended up helping me understand it well. Thank you.
Bro I have operating system exam tomorrow and this video really saved me 😭 thanks and i would appreciate if you can share more knowledge about os. Love the way you explain
During the steps in 3:06 where you caclulated the need, is is possible for any values in the max matrix for any process be smaller than the values in the allocation matrix for the same process?
In case the PX (processes I guess) have a priority, you should check if it is possible to acomodate the allocation request after the next new available, instead of checking it at the end of the PX sequence. This will give you a different sequence based on PX priorities.
popping in because I have assignment due in three hours and I haven't listened to a word in the lecture Thanks! I know nothing about the context but I can now do my assignment sheet no problem.
Hey, I have a Question is that possible that Allocation value can be bigger than Max value e.g. P1 - A(column) - Allocation = 2 and P1- A Max = 1? Is yes, then what would be the value for the Need?
what happens if there is a follow up question that p4 has requested additional resources determine if this can be granted immediately, is it the same method as you have shown using new available from P1?
@@ComputerScienceExplained Thanks, when I searched my question on UA-cam there is a separate request algorithm simmilar to what you have shown that is used to update the resource table and then uses bankers algorithm from there to determine new sequence. Are you aware of this, or is that just another method?
This would be impossible. The banker's algorithm requires you to know ahead the maximum amount of resources will be used by the process. In your case, it means that we predict the wrong maximum amount of resources required by that process. This is actually the disadvantage of banker's algorithm as you cannot have a process that is "dynamic" in the sense you dont know how much it will require the resources
Thank you for your great video, however I wonder why they do not check available with need from random P ? why we start at P0 ? If it is stupid question Iam sorry :( @Slaven P
yea.. Sure.. The Last Available Resources Will be Equal to The Total number Of Resources! Since All Process Done Processing and Release Every Resource they have!
Why don't you go back to processes 1 and check again after u allocate from p2. What happens if you just keep getting more and more process, p1 wont have another chance and will starve.
We can add allocated to available if the process work is done. That can be done by having any array work[] and check for every process i if work[i] == true;
Thank you for your amazing tutorial. What I noticed is that you adding the allocation to the available. That only can be done when a process is done working. when you compared needed to available you added allocation to available and that make no sense. As I learned we compare only to know if we can allocate .
At 6:04 why is P1 False ? It is less than (or equal to) 0750 is it not ? I kno I'm missing something here ..... please help ...
Ok so we have we are asked if we can give , you have to remember that this is a matrix not the numbers 1,532 and 750. We compare 1 with 0, 5 with 7, 3 with 5 and 2 with 0. If we look at it like this, we see that we cannot actually allocate the amounts required. Hope that explains it =).
I'll watch it again but yes i think I know what you mean as i thought it was the whole numbers at first but then the last few sets kind of threw that out of the window. I'll get a grasp of it, thanks :-)
No problem =)
@@ComputerScienceExplained nice tutorial atleast you should have mentioned that
I was confused as well lol
I like how you didn't skip any of the steps! Even though I skipped past some of the arithmetic I knew, if I were confused all the examples would have helped!! Also, bravo.
After 7 years as i give os , very helpful video surely recommend!
I usually don't comment on videos, but this was well explained and simplified the steps nicely. I was struggling to find out what to do with my available and need and it ended up helping me understand it well. Thank you.
You’re welcome
thank you so much, I study BSc computer science and this helped
Finally a real English video rather than a Indian English one.
You are a savior. Thanks
You explain better than my professor ! Keep up the good work
thanks bro... today is my Exam and this video has helped me for last hour preparation
i have no clue how my professor made it seem so complicated when in reality its that fucking simple wow. thank you very much!
Clear and simple, thank you for explaining very clearly and well.
You, sir, saved me a lot of headaches today. I'll drink to that
This was so helpful and well explained. Thank you!
Bro I have operating system exam tomorrow and this video really saved me 😭 thanks and i would appreciate if you can share more knowledge about os. Love the way you explain
Awesome work, much better than all Indians all together
Finally explanation video on OS without an annoying Indian accent...
lol... same feeling mate
looooooooooooooooooooooooool
Looooool
Much worse than an Indian accent. Nasty sounds
True haha
Very good video!
Thx so much for the explanation in detail!
Really nice video, clear and concise, thanks!
Great explanation.Thanks
Thank you sir for the helpful video!
Thanks for the Tutorial sir, It helped me understand this algorithm. Stay safe :)
Thanks for the video.
During the steps in 3:06 where you caclulated the need, is is possible for any values in the max matrix for any process be smaller than the values in the allocation matrix for the same process?
The most clear explanation, Thank you!
Great explanation
when we doing step 2, must we do the P0 firstly? Can I start with with other, say, like P3 first?
Excellent top notch video, very easy to understand in simple language, thanks a lot. Thanks🙏🙏🙏🙏 made me easy to understand bankers algorithm
In case the PX (processes I guess) have a priority, you should check if it is possible to acomodate the allocation request after the next new available, instead of checking it at the end of the PX sequence. This will give you a different sequence based on PX priorities.
This will require original PX sequence is sorted by priority
Thank you very much !!
You saved me for my final today!
Happy to hear that.
Mine's tomorrow, but me too!
Hey, why we skip Allocation p1 (1000) in 6:14 ?
Dijkstra was a fucking algorithm god, next to you buddy, thank you so much for this video
Well explained thank you
Good job! Thanks!
Really nice and quick explanation!
Thanks for the vid really helpfull!
thanks a lot,very good explanation
Where do those original numbers in the matrix come from? At 3:06
Those will generally be provided.
popping in because I have assignment due in three hours and I haven't listened to a word in the lecture
Thanks! I know nothing about the context but I can now do my assignment sheet no problem.
Thanks. It's really helpful.
Thank you mr computer
Yo mah dude. Sick af tut👏🏼👏🏼
question: what if Max - Allocation in step 1 already is not possible with my given numbers... what then???
Thanks man !
sat before an exam watching this thinking this guy is a god lmao
good!Explain very well
exam in 8 hours, thx mate
Thanks 🙏
Could you do an example where it is not safe? My final is next monday and it is only on deadlock avoidance RAG and bankers algorithm.
Thanks for this! Very helpful tutorial 🙂
What about the unsafe sequence? Do we just reverse the condition when comparing with the need and the available from true to false?
Hey, I have a Question is that possible that Allocation value can be bigger than Max value e.g. P1 - A(column) - Allocation = 2 and P1- A Max = 1? Is yes, then what would be the value for the Need?
Great video!!
how did it become false in the second case.... help me out
Because 7 is not less than 5 and 5 is not less than 3. We have to compare the respective bits while doing 0750
Thanks for the help!! Awesome to the point video.
what happens if there is a follow up question that p4 has requested additional resources determine if this can be granted immediately, is it the same method as you have shown using new available from P1?
Correct, the algorithm does not differ.
@@ComputerScienceExplained Thanks, when I searched my question on UA-cam there is a separate request algorithm simmilar to what you have shown that is used to update the resource table and then uses bankers algorithm from there to determine new sequence. Are you aware of this, or is that just another method?
Can't say I recall it off the top of my head but you're welcome to post it in here for anyone interested =).
thx this video, so helpful
Sry but how did 1520 come from i mean is it a dynamic number it is concluded ? in one word how did available come from "? thank you
thanks alot !!! really helps
how did you find current available ? 1520 ?
What if in Step one we have a negative result? for example: - How to do in this case to generate the Need Matrix?
This would be impossible. The banker's algorithm requires you to know ahead the maximum amount of resources will be used by the process. In your case, it means that we predict the wrong maximum amount of resources required by that process. This is actually the disadvantage of banker's algorithm as you cannot have a process that is "dynamic" in the sense you dont know how much it will require the resources
@@ActualDayZGod thank you bro, regards from Russia :)
@@robertoenriquechavezrodrig731 :)👍
why does your allocation numbers switch with allocation numbers when you are calculating the availability
Thanks Slaven!
THANKS!
based on the problem given, how to determine which one is a maximum or an allocation?
So i didnt have to recalculate P1, after P4🤔
and this guy knows how to fish....win win
Thank you!
Thank you for your great video, however I wonder why they do not check available with need from random P ? why we start at P0 ? If it is stupid question Iam sorry :( @Slaven P
my question doesn't have available, how do i get it?
i am in doubt here. ok, shouldnt the last available matrix be equal to the total allocation ?
PLZ help clear my doubt
yea.. Sure.. The Last Available Resources Will be Equal to The Total number Of Resources!
Since All Process Done Processing and Release Every Resource they have!
Why don't you go back to processes 1 and check again after u allocate from p2. What happens if you just keep getting more and more process, p1 wont have another chance and will starve.
what if it was still lesser than P1 so the comparison stayed false what would we say ?
good question
Im confused, P0, 0000
You are comparing the digits individually, so 7
Awesome bro, thank you GameChaser :)
can you explain why p1 is false before my final tomorrow?
THANK YOU!!!
on what program you made this video
thank you very much
Thanks, really helpful!
thanks sir!!!
superb.
Thank you!!!!!!!!!
new available = available - need(requested) if true. Adding allocated to the available is wrong LOL
We can add allocated to available if the process work is done. That can be done by having any array work[] and check for every process i if work[i] == true;
Seems you're not understanding the algorithm. I encourage you to study a bit more and revisit the video at a later time.
@@ComputerScienceExplained
Need := Max - Allocation
Check that Request[i]
Thank you for your amazing tutorial.
What I noticed is that you adding the allocation to the available. That only can be done when a process is done working. when you compared needed to available you added allocation to available and that make no sense. As I learned we compare only to know if we can allocate .
Please clear the point how is p1 not less than 1532
Hi, please check pinned comment. Pay close attention to the language used (number, matrix, matrices)
Slaven P thankyou so much sir...it helped me
nice
Tks Bro !!
thanks :)
No problem =)
tapaswini singh hii
Can we say that ABCD are our resources?
Is that answer 2 14 12 12 is right i m get other answer...
thanks
so... we're gonna go ahead and go ahead to be gonna to go ahead
thx for nice accent
ti meriti un bacino
the pluggg
put on 1.25 speed
interesting
Kindly revise; Isn't the correct Safe state = [P0, P2, P1, P3, P4]?
Kindly rewatch. No, it isn’t.
Go Ospreys
SOOOOOOOOOOOOU