วีดีโอ

Non-genuine Windows product. Buy a original windows and Activate it.

Thank you so much mam, your diagrammatic explanations gives us Intitutive understanding of the algorithm 😍, lot of love from Tamilnadu ❤

bhagwan aapka bhala karega..subah k 4 baje parh rha hu..10 baje exam hai..u hv no idea the life saving stuff u're providing in such a simplistic manner...gareeb ki dua lagegi aapko...wish u and ur family the best of fortunes!

Hello mam kese ho aap. Thanks for this video Tomorrow is my exam 😅

Just reading the entire thing thats it nothing more than that like why the lamport introduced why the j and c are concurrent event 🤧🤧🤧 useless teaching

Ma'am when are you uploading the 2-phase and 3-phase commit video??

When a process receives an election message, it compares the identifier in the message with its own. If the arrived identifier is greater, then it forwards the message to its neighbour. If the arrived identifier is smaller and the receiver is not a participant, then it substitutes its own identifier in the message and forwards it; but it does not forward the message if it is already a participant. On forwarding an election message in any case, the process marks itself as a participant.

thanks ma'am

Can you please upload video of char functions in sql

Thank You Ma'am🙏💖💙

mam please complete distributed system playlist

mam please complete distributed system playlist

mam please complete distributed system playlist

mam please complete distributed system playlist

mam please complete distributed system playlist

select POWER(6,-3)....>>output is '0'.....not what you have shown on the screen mam...plz check Itried it & got 0

what is critical section? think I missed that part

How can I trust you're an accual professor?

Hello Dr. Rujutaja, I have watched most of your DS videos. I now understood the concepts. Can you consider doing videos on Analysis and Design of Algorithms?

thanks

fantastic

super simple, well done

if you dont know how to tech student than dont waste time of student.

How N-1 is guaranteed? even P2 can make a request, so performance becomes 3N. Isn't it?

U r explaining the same

Lamport and ricart algorithm looks like same

the conclusion "THE BIGGEST GUY WINS" Hence, the "BULLY algorithm" wow

Thank you didi

great explanation , thankyou

nice explanation

❤

❤

pro tip: play at 2x

Simple explain ❤

Thank you so much Rutuja ma'am.

very helpful

If we don't have a causal path, then we don't know which event happen before. How is this useful?

Crisp and clear explanation Mam. Thank You

great

❤

One of the best explainer i had ever seen ❤, thanks mam for this valueable content

Awesome

Just before a day of exam❤

Good explanation, i get questions in the exam , i can easily write content of 2-3 pages

I can now write 3 pages for this😂

It was very helpful ma'am, Thank you so much❤

Euuu nusta raddaaa 🔥🔥😂😂

Sapla ki vishay 🗿🗿

Good explanation ❤

🙌