Peterson’s Solution

[@anirudh7137]

Hands down the best explanation of Peter's Solution. The concept of 'humbly giving the other turn' made it much more clear.

[@amasaadi382]

%100 agree

[@ishvendra3395]

I am doing a paid course and I couldn't understand their explanation so I came here and wow this explanation is soo better xD .. Neso academy rocks!!

[@mArjunyadav]

what is the course for? Can u share it?

[@srishylesh2935]

yes. same qn

[@anonymousguy9263]

@@mArjunyadav doesn't matter Neso academy has far good content for a free cost.. We like everything free if it is available anywhere..

[@ChaitanyaRacharla]

@@anonymousguy9263 Lol no bro it ain't free, you gotta pay for the chapters further

[@anonymousguy9263]

@@ChaitanyaRacharla yes ı know and ı paıd for ıt.. It ıs very nominal..

[@chandrachurmukherjeejucse5816]

The best lecture on Peterson's solution that I have watched till now 🔥

[@gatecseaspirant-dk9ze]

then you had watched all the wrong lectures till now..... Man did not explain how to check M.E., progress and B.W... he just read the code

[@GTBBwastaken]

I was sceptic about watching this video due to its length. However, very good and thorough explanation. I came up with this real life example when both processes want to enter their critical section: 1. You and your friend both want to enter a bus. 2. You insist your friend that he/she enters first. 3. But your friend is insisting that you enter first. 4. Not to cause any delay, you enter first. 5. Your friend enters after you. P.S. Happens to me many times in real life. I want to let people go first and they insist that I go first. So, to not delay any further I go first.

[@aniketkulkarni3013]

No one has been able to explain this algorithm in depth. Thank you so much; I am truly grateful for your help.🙌🙏

[@mostafatarekadam8861]

Thank you I understand it clearly now, the key is to draw the two processes and trace the instructions

[@TheRkmutube]

Your videos are amazingly simple and easy to understand and most importantly your humble variable 😀 first of its own kind man!!

[@AyaNori]

I think the while loop is supposed to be while(flag[j] && turn=j); instead of turn=[j] since j is an int, not an array. but anyway, I agree with everyone! you're videos have helped me so much!!

[@franklinmaradiaga2401]

WOWWWW, what can i say... This is hands down the absolute best explanation of Peterson's Solution!!! My book was def not enough to get it, and I just didn't even try to understand it, but with ur video, I feel like I understood all of the algorithm!

[@Oberon621]

These videos are excellent. I like to watch these first and then glide through the textbook after.

[@sayonislam7222]

Peterson's solution be like - "Pehle aap jaiye, nhi nhi pehle aap, " 😅😂

[@Emaaaaaas]

😂🎁

[@Mr_ll_7o7_ll]

Quick understanding: as both process wants to enter first turn value is set to j in left hand part And in the right hand part turn is set to I So now turn has i value Left hand part becomes false (left hand while loop become false) So p0 Is executed and the right hand part the while condition is true(as turn is set to I)it keeps on looping and doesn't let p1 (pj) enter the critical section after completing p1 in the LHS part i = false is set Then now in the RHS the while condition becomes false and j can enter critical section

[@begumonal]

well explained, made me pass my exam. thank you so much for the great content.

[@SonuGupta-wj6dg]

it's 3:30 am . I've exam at 11 and this video can't be more awesome than it is😎

[@radaefilms3150]

I'm in the same position dude

[@SonuGupta-wj6dg]

@@radaefilms3150 hold on 😂

[@areejaasna]

@@SonuGupta-wj6dg lol guess who join the squad :"")

[@heutras]

bois you forgot about me

[@radaefilms3150]

@@heutras 😂😂😂 na were in this together how'd ur exam go

[@akshatsrivastava2007]

Thankyou Very much Clear and lucid Explanation Able to understand easily..😊

[@kubraoztiryaki5876]

the best video i've ever watched about peterson's solution. i think you used feynman technique in a good way :)

[@darshilvshah]

The explanation is simply fabulous

[@srisangeeth4131]

Most clear explanation of Peterson solution ,Thanks for the video👍👍

[@sameensultana1737]

The topics are explained so well.

[@shashankh3]

the explanation!!! truly amazing

[@prakhar266]

this was the best video on Peerson's Solution. Thanks man

[@meghanareddy2197]

So well explained 👏👏

[@wizardop2100]

Best explanation ❤. Thank you sir

[@TamilazhaganS-x7v]

Very much satisfied with the answer. Thanks for the flawless explanation.

[@Anuparna_Gangopadhyay]

Your explanation is very good sir❤ & it's very much helpful

[@sakshisomani7558]

Your teaching is next level

[@rohitkandula8493]

💫💫✨✨Better explnation than our college🔥🔥🔥🔥🔥🔥

[@rayvinlai7268]

Thanks,the explanation of semicolon after while helps me a lot

[@mich1970]

This is so well made, ty so much. I understood it perfectly

[@wendymcdonald7351]

Thank you for the OS save! Could not understand this via the textbook.

[@AbhishekRaj-on3xi]

Thank you Neso Academy for the amazing explanation ❤️

[@tanvirhasanmonir1627]

Very well explanation, easy to understand

[@Haleemasultan1]

loved the explanation .

[@learning_new]

Well explanation sir... really you are God gifted one❤️

[@taniyabhagat4315]

bestest explanation ever on youtube🤩

[@rohitkandula8493]

From 12:42 watch for detail explanation ~~~🫶🔥🔥

[@datanerden1057]

Great video! But there is a mistake in the example of the solution. In the while loop, it says turn == [i], but it should be turn == i. The same for process i, where it should be turn == j, not turn == [j].

[@twoPointers123]

maturity when you realise it is not humble just pretend to be humble 💀💀💀💀💀💀💀💀💀💀💀💀💀💀🥲🥲🥲🥲🥲🥲🥲🥲🥲🥲

[@swadheenta.957VBTS]

you are amazing sir really . thank you soo much. you deserve to be honoured by best teacher of india. i really want to recommend for this honour . thank you 💜💜

[@SkyV77]

[@iovewhalien2191]

thank you so much for this video, I could not understand my textbook at all. you explained this so clearly, I understood it right away!

[@rumiNITPatna]

thank u so much for such a wonderful explanation.

[@msatyabhaskarasrinivasacha5874]

Neso academy zindabad....long live neso academy🎉🎉🎉

[@cloudjumper725]

The problem I can see with this is that it is uses critical section to solve cs problem itself. By defenition: cs - segment of code, which is present in every process, in which the process may be changing data stored in shared memory. turn variable is shared, so, by defenition it is a critical section and executing them concurently leads to race condition but it does not affect it because value is assigned anyway so one of the procesess will enter and pass execution to the next one after exiting cs

[@CodeMode9313]

its the best explaination ...to the exceution ..thank u so much

[@arthiannamalla5028]

I was literally waiting for this....thank you so much

[@elijahparker1789]

Thank you so much for this video. It's amazing how bad college professors can be at explaining something

[@yashraikwar5412]

Nicely explained 💯🙏🏻❤️

[@kavyakavya7258]

Really awesome class thank you so much sir for this good class 🙏😊

[@paragggoyal1552]

i cried during the video, it should have required 5 minutes not 20 minutes. sorry this might not be the popular opinion but it is true for me. also, telling the process vs telling the proof are completely different things.

[@zishuning]

Very clear, thank u

[@reenaantony4984]

Thank you ❤ for the beautiful lecture

[@sreegeeta5897]

thanks for the explanation

[@ShravanthiK-wj3vb]

I'm hving exm after 3hours I'm seeing urs i grt understood

[@장현정-x8f]

Thank you for making me understand ! Even in Korea, I'm watching this ~~ ;)

[@sanjuvikasini1598]

Thank you so much for the informative video!

[@btcdivine]

Excellent explanation

[@dinushachathuranga7657]

Thanks a lot for the clear explanation

[@manthankhandale23]

Well Explained. Thanks a lot!

[@danielleananga7743]

you guys are life savers😭😭

[@iosifpuha6114]

Neso Academy: a name, a guarantee

[@peterlearnsCS]

Thank you, well-explained! Be humble! 😅

[@lydiaarabi4811]

tré tré bonne explication😍😍

[@kautukraj]

Very helpful, thank you.

[@divyaagarwal3091]

Awesome Explanation

[@fiona2678]

Awesome explanation sir.

[@anaranyabose]

Best explanation than the book 😍

[@michelecorc]

omg finally i understand, thx neso

[@laluyadav1828]

Really helpful thanks bro

[@saurabhbhargava6290]

"flag(j/I)" is sufficient. " turn == " is redundant. Also both processes can get stuck at while if both flags are true which can happen when both processes execute simultaneously. It works only when P1 and P2 are in queue.

[@sameermeshram3062]

Sir upload the video of control system

[@l6e6i6n]

when Pi writes its flag value it is possible that Pj could also be attempting to read from that value in that instant of execution if Pi's write is not atomic then could'nt this cause another race condition on Pi's flag value such that Pj reads a half written/corrupt value

[@thongtranlequoc688]

I prefer "interested" instead of "flag"

[@bpravalika-2924]

amazing explanation sir

[@nojoodothmanal-ghamdi1026]

OMG I understood it! Thank you!

[@ankushladani496]

Awesome explaination..

[@muhidshaikh6446]

well explained👍👍👍

[@Asim_Usama]

JazakAllah😇

[@nileshtiwari7499]

awesome explanation !!

[@divyaagarwal3091]

Thankyou so much sir

[@Hutero]

holy this is amazing, THANKS ALOT

[@siddiquabegum-l2v]

tq soooooooooooooooooooooooooooooooooooooooooooooooooooo much you helped me lot

[@pawloaspaja289]

Thank you so much. Well explained.

[@wassup102]

Thank you sir

[@ShmuelIntayeb]

but how can i know who is the last one to modify the turn variable? (who will be the first one to enter the critical section) does the processor just choose one of them randomly?

[@कशिशदीक्षित]

Thankyou so much...

[@ankursharma8973]

my teacher took 4 hours of lectures and i didn't get crap. she must watch this video

[@chitradey3708]

Thanks ❤❤

[@stockoverflowrecursive]

I want to ask that how can you make sure the updation of variable flag[] and turn is synchronized? If they are not been synchronized, this solution doesn't work right? Anyone can explain this?

[@ajaykumarmodugu9155]

Thank you very much

[@ahmetkarakartal9563]

Allah sizden razı olsun

[@ninjanape]

beautiful, thank you!

[@MinakshiBiradar-m7s]

Just amazing one

[@__.solitary]

Thanks ❣️

[@diwang4572]

Thank you sir!!

[@dianafarhat9479]

Can you please explain why the solution doesn't work on modern computer architectures?

[@AlanSchooll]

This algorithm is strange, providing the solution that shared resources cannot access by more then one process at a time, based on variables that are shared and accessed by both processes at the same time, variables such as flag and turn.

[@samerbehery7799]

Thank You

[@konscomputertutorials7473]

what a clear explanation

[@عبدالرحمنخالد-ش4ت6ي]

thanks a lot ❤

[@Nameiscantsay]

Why don't KZbin has 4x speed?