Peterson’s Solution 

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!!

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

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

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

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

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

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!!

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

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!

The explanation is simply fabulous

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

Very well explanation, easy to understand

best tutorials..loved watching them...extremely helpful.

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

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

So well explained 👏👏

Thank you Neso Academy for the amazing explanation ❤️

The topics are explained so well.

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.

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

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

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

the explanation!!! truly amazing

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

Awesome explanation sir.

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

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

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

Best explanation ❤. Thank you sir

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

Thank you so much for the informative video!

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

amazing explanation sir

Your teaching is next level

Very helpful, thank you.

Thank you so much. Well explained.

Nicely explained 💯🙏🏻❤️

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

JazakAllah😇

Thank you ❤ for the beautiful lecture

Thanks a lot for the clear explanation

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

Well Explained. Thanks a lot!

Excellent explanation

awesome explanation !!

Thank you very much

Awesome Explanation

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

Very clear, thank u

Thankyou so much sir

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

Thank you sir!!

Thankyou so much...

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

Really helpful thanks bro

Thank you so much

Thank you sir

Sir upload the video of control system

tré tré bonne explication😍😍

Awesome explaination..

beautiful, thank you!

Thank you very much 🙏

Allah sizden razı olsun

Thank You

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?

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 💜💜

Thank you!

Thanks ❣️

what a clear explanation

well explained👍👍👍

OMG I understood it! Thank you!

tks alot

Best explanation than the book 😍

Thanks ❤❤

well explained !

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?

thanks man !

tq soooooooooooooooooooooooooooooooooooooooooooooooooooo much you helped me lot

thanks

omg finally i understand, thx neso

holy this is amazing, THANKS ALOT

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

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

thanks a lot ❤

you guys are life savers😭😭

Superb

Just amazing one

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

Will neso academy upload electrical machines topic?

Wonder explanation...

bestest explanation ever on youtube🤩

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

Mind blowing!!!!

Thank you, well-explained! Be humble! 😅

"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.

thank you so muchhhhh

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.

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

Neso Academy: a name, a guarantee

Good course,but suggested to use numbers or iterations for I and j in the explanation of the Peterson's solution,more of theory might feel boring