Understanding Round Robin CPU Scheduling with Python | Operating Systems

Step into the world of Round Robin CPU Scheduling, a dynamic algorithm used in operating systems! This method allows each process a fixed time slice for execution, cycling through tasks in a circular order. In this video, we'll comprehensively dissect the Round Robin algorithm, employing Python to illustrate its functionality. You'll witness its implementation, grasp its concepts, and explore its practical applications through hands-on coding examples. Join us to understand how Round Robin efficiently allocates CPU time, ensuring fair execution for all processes and enhancing system responsiveness.

Please consider hitting the subscribe button if this helps you!
I will see you in the next video :D

#operatingsystems #sjf #pythonimplementation

[shasvatvijay]

Sir I watched this before my exam and the same question came in my lab exam. I'm grateful for you sir .🙏

[vigneshwaranr]

You are a great inspiration to me, sir. Love your videos, sir.

[palomaraissa]

Thank you so much, your explanation is very good and clear. This helped very much!

[monaadel]

Thank you for the video it really helps. But I am confused, from time interval [0-2] we have p3 and p1 available so they should be in the ready queue and the p4 will be executed after them because the p5 hasn't yet arrived how we will execute it before p4. My gantt chart looks as follows p4, p3, p1, p4, p5, p3, p2, p1, p5, p3, p1, p3

[ftrsynx]

Mam i saw this before my exam today and I did really well mam😊. I like ur teaching very much❤

[syri]

Hello, I have a question
I have used your example and was able to write a python code which corresponds to the output

However, I used the code for other examples and their answers were different from my output.

I understood this was because of the way they implemented the queue.

So if I take your example, in the gantt chatt, the order would not be p4, p3, p1, p5, 02 ect.

It is p4, p3, p1, p4

So p4 gets added to the queue after its execution (p3 and p2 already in the queue since time is 2) before p5 is added at time 4

I was wondering if both ways are valid because I have a coursework on this

[vijayveerasekaran]

Thank you so much sir.... I am watching this video with my exams in 30 mins

[SDAssasin]

Helped me big time man cant thank this tutorial enoguh

[kushp]

Hi, how would I implement a context switch into your code?

[mmammadov]

Hey. Thanks for the video.

Let’s suppose we have 3 processes - A, B, C, whose arrival and burst times are as like (19, 29), (23, 23), and (29, 19), respectively. Take time quantum as 5.

At time 29, will A get executed first or C? Would appreciate explanation

[sanjaibalajee]

Thank you ma’am. Now I believe I’ll pass my systems paper

[randomboredguy]

Sir I do MBBS and I'm in my 2nd year but I still watch your videos even though I don't have this course
You are the best teacher 😍

[sabarishh]

Thalapathy fans sarbaga indha video nalla reach aga vazhthukal 🔥

[theroamingdude]

very informative and insightful sir! can I know when the next video will be out?

[ankit]

Who else watching this video 10 mins before their exam like here