I'm at video 51 of the Operating Systems playlist and I just have to stop and say how grateful I am for this. This man does not miss a beat in his explanations. THANK YOU !!!

Everything is so hard until you find a video by Neso Academy. Thanks a lot!

6:25 tricky part: a pre-empted process gets behind a new process arriving at the same time that the first process is pre-empted ...

Man you are the best, i wasted my time for hours until i found your video

Just took a moment to applaud the hard work that has been put in making this awesome video!! Thanks a ton!!!💯👍🙏

Tomorrow is my os exam - bscit 🤗 i hope u will upload full course for other people

Oh my good God! This is so amazing. How you managed to perfectly explain this scheduling is just awesome! A big kudos, I must say, to Naso Academy.

Your videos are amazing for computer science students like myself taking courses in concurrent programming and operating systems. Thanks for all the help with your videos!

I will never forget your contribution and efforts🙏🙏. Congratulation for getting golden button play 👏👏. You deserve it.

I'm struggling with process synchronisation and concurrency. I'm waiting for lectures on those topics. Not comprehensive but a little introductory with little explanation can really help me me out. By the way, in upcoming march, I will apply for interview at Neso Academy for Compiler Design Course.

In a typical round-robin scheduling system, the decision of whether to place the preempted process or the newly arrived process first at the back of the queue depends on the specific implementation of the scheduling algorithm. There isn't a universally standardized rule for this, and different operating systems or schedulers may handle this situation differently. Here are two possible scenarios: Place Preempted Process First: The preempted process could be placed back in the queue before the newly arrived process. This means that the preempted process, which was already in the middle of its execution, gets another chance to continue from where it left off before the newly arrived process gets its turn. Place Newly Arrived Process First: The newly arrived process could be placed in the queue before the preempted process. This means that the system prioritizes the new arrival, allowing it to start execution before the preempted process gets another turn. in this lecture, they have taught for 2nd scenario only.

the clock and alarm concept really helped understanding the algorithm clearly 👍🏻

6:25 Important vip part: a pre-empted process gets behind a new process arriving at the same time that the first process is pre-empted.

Very Clear explanation Big thumps up for you sir

Thank you very much sir... In this pandamic situation these lecture help me a lot...

Great explained !!

thanks a lot, helped me understand for my project

Hi, great video! thanks a lot. I have a question about round robin, why does it use a circular queue? can it be implemented using regular queue?

Nice explanation , it's clear my doubt Sir

Awesome explanation

Thank you sir you are just amazing

Sir? I have a question? That I've done by myself first but without the ready queue. Means I've got arrangement as p1,p3,p4,p1,p1,p2,p5,p2, p5 Is it correct if we don't follow the ready queue.?

idk if I dont have enough sleep or if im too fckng dumb that I am not able to fully understand the subject. anyways, after P3 why P1 go in next instead of P4?

19:42 thanks a lot, crystal clear.

after executing p1 in the first time p1 get a ready queue at time 2 and p3 gets ready queue at time 2 so the arrival time of p1 and p3 is the same so we execute p1 because the pid of p1 is 1 less than the pid of 3 which is 3

Thank you so much sir

You are a legend!

sir you are angel !!!!!!!!!!!!!

@Neso Academy 11:57 one thing I didn't understand that when p1 arrives the remaining time quantum was only 1unit due to process p3 voluntary releases itself from the CPU as it's execution is over. So it should execute for only 1 ms after it would again be preempted. Please clear my doubt

best explanation

Thanks sir ..

Amazing sir

i cannot understand why p1 came after p3 in gantt chart

Sir..thank you for this video..and i get knowledge on this problem But i have a question....that is. Assume the following workload in a system: Process Arrival Time Burst Time P1 5 5 P2 4 6 P3 3 7 P4 1 9 P5 2 2 P6 6 3 Draw a Gantt chart illustrating the execution of these jobs using Round robin scheduling algorithm and also Calculate the average waiting time and average turnaround time Plz..plz..solve the problem

what if there is a priority with round robin, should I consider it? I have got that kind of question in an exams

this video is better than sir Faisal Cheema's 1.5 hour lecture.

Hello sir.... I want all the PPT's of OS of your lecture . How can I get. I have exams to come need to prepare. Please do reply

Best one

Welp im here to say thank u very much

whats happens when there is no time quantum given?

why wouldn't the gantt chart order be p1, p2, p3, p4 instead of p1, p2, p3, p1 at @8:06?

Sir Upload all videos... please

Make a video for FCFS in I/O requirements

super

Why P1 come after P3??

Is this playlist enough for gate cse sir?

What if the arrival time start from 1 ms

💥

My os exams is today 😥

your tutorial did not completed

avg=8.5

I will send one question would you tell me the answer

My lecturer got PhD but u teach far better than him. 🤝

Average Waiting time = 5.8 ms Average Turn-around time = 8.6 ms Is it correct ?

Kumalaala kumalala savesta

wala q maintindihan,, auko n maging bobo

Punyita wala ako maintindihan 6al

Thankyou sir