Thank you for your valuable feedback. Please subscribe our channel to get updates on latest videos. th-cam.com/users/techguidershome?sub_confirmation=1
The way you explain is awesome , i don't have to put a lot of effort to understand what you teach . I wish your channel become most popular for the subjects you teach .
Thank you for your valuable feedback... Please subscribe our channel to get updates on latest videos. th-cam.com/users/techguidershome?sub_confirmation=1
Thank you for your valuable feedback... Please subscribe our channel to get updates on latest videos. th-cam.com/users/techguidershome?sub_confirmation=1
Thank you for your valuable feedback... Please subscribe our channel to get updates on latest videos. th-cam.com/users/techguidershome?sub_confirmation=1
I have a doubt. Before introducing choosing array you said this algorithm violates mutual exclusion condition in one particular situation when the process got preempted after num is calculated to another process and another process also starts execution and that will also get the same token number and enters into the critical section but while it's in the cs it's preempted and process1 got the control and goes into the cs evenif another process(pid2) is already there in the cs. So my qn is after introducing choosing array what if the process gets preemption after executing choosing [i]= F rather than after executing num[i ]? Will it now hold mutual exclusion condition? I don't think so...
process got preempted after choosing=F means that process already has chosen its token,not in the midst of choosing token.The other process will thus get a different token.
Such lectures needs appreciation....... voice seems to be a little noisy at start, but later on when addicted to it, becomes clear.......
Thank you for your valuable feedback.
Please subscribe our channel to get updates on latest videos.
th-cam.com/users/techguidershome?sub_confirmation=1
The way you explain is awesome , i don't have to put a lot of effort to understand what you teach . I wish your channel become most popular for the subjects you teach .
Thanks a lot for your valuable feedback :) do share the videos
great teaching style you better this better than other algorithm videos. thankyou
I was having difficulty understanding this topic. Very very well explained. This surely is a masterpiece.
Thank you 🙂 for the feedback..Please do subscribe and share the videos
So sad to know you still don't have enough sub...Thank you so much for these lectures...The quality is excellent and you deserve much more
Thanks a lot for your valuable feedback 🙂
Now I become your fan mam :::: your voice and the way you explain this one it become easy now thanku so much ..
Thank you for your valuable feedback 👍 please do consider subscribing the channel and sharing videos in your circle ☺️
@@TechGuiders sure mam
@@TechGuiders sure mam
Madam , Thank you very much....This is the video which I understood very clearly on process synchronization
Thank you for your valuable feedback...
Please subscribe our channel to get updates on latest videos.
th-cam.com/users/techguidershome?sub_confirmation=1
Thank you mam for your hardwork for us😍😍😍.....clear explanation.thanking you for taking the lecture in english.
Thank u for your valuable feedback :)
This is best video.No one is explaining in detail about choosing.tha ks
this video should have more views than this.., Other videos on youtube about this algorithm are not good as this one.,
Crct..
Thank you for your valuable feedback...
Please subscribe our channel to get updates on latest videos.
th-cam.com/users/techguidershome?sub_confirmation=1
Thank you for your great work Mam , Great explanation.. Respect to you ...
Thank you 🙂 for the valuable feedback..Please do subscribe and share the videos
Great presentation..
great explantion
Madam...I have a doubt..Which book is preferable for Operating Systems ?
I do refer Silberschatz-operating system concepts
Thank you so much, it hepled a lot👍
Thank you for your valuable feedback...
Please subscribe our channel to get updates on latest videos.
th-cam.com/users/techguidershome?sub_confirmation=1
Best explantion mam
Is this algorithm same for distributed systems
I have a doubt. Before introducing choosing array you said this algorithm violates mutual exclusion condition in one particular situation when the process got preempted after num is calculated to another process and another process also starts execution and that will also get the same token number and enters into the critical section but while it's in the cs it's preempted and process1 got the control and goes into the cs evenif another process(pid2) is already there in the cs. So my qn is after introducing choosing array what if the process gets preemption after executing choosing [i]= F rather than after executing num[i ]? Will it now hold mutual exclusion condition? I don't think so...
process got preempted after choosing=F means that process already has chosen its token,not in the midst of choosing token.The other process will thus get a different token.
@@TechGuiders exactly. Thank you so much!. Actually preemption happens before token is provided. That's the point here. 👍
Can I ask why we have to different than 0 for the num[j]? Thank you and hope to hear answer from you soon.
i didnt get the question actually...is it about initialising num[j] with 0?If so,the
algorithm should be changed according to
yes it can be any value its upto the programmer whatever value you choose.
best :)
cheers to the first comment !!!
cheers to the second comment !!!
jabra fan
R u from Kerala professor
yes..me from kerala :)
Ur explanation was very good thank u ma'am.
Me too from kerala
thank u :)
Please subscribe our channel to get updates on latest videos.
th-cam.com/users/techguidershome?sub_confirmation=1
❤