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 !!!
@jayachandra6773 жыл бұрын
Everything is so hard until you find a video by Neso Academy. Thanks a lot!
@preciousliseli3 жыл бұрын
Honestly!!!👏🏻😂🔥
@AvikNayak_2 жыл бұрын
Everything becomes hard because of professor's poor explanation.
@anshumansharma22512 жыл бұрын
@@AvikNayak_ i always wonder how can they became professors?
@user-md3lt7tx5fАй бұрын
Man you are the best, i wasted my time for hours until i found your video
@NikitaNair4 сағат бұрын
OH MY GODDDD literally nobody has explained this so well :)
@trywellwashington75064 жыл бұрын
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 ...
@vladcristea83782 жыл бұрын
A comment you wrote 1 year ago helped a total stranger from the other part of the globe at 1 am in the morning
@jaydeepdas9754 Жыл бұрын
damn that thing i didnt got it
@virgarg9653 Жыл бұрын
@@vladcristea8378 same happened with me today at exactly 1am in India
@epsv1132 ай бұрын
thank you man ,hope your doing good
@Xavierpng4 жыл бұрын
Tomorrow is my os exam - bscit 🤗 i hope u will upload full course for other people
@Xavierpng4 жыл бұрын
@@nesoacademy thanks 🤘😁
@Tkdanso3 жыл бұрын
Same here. I find this playlist very helpful thanks guys.
@jrMichael-ut9lv3 ай бұрын
Tomorrow is also mine Bscit and i am here now
@vinayaksharma-ys3ip3 жыл бұрын
Just took a moment to applaud the hard work that has been put in making this awesome video!! Thanks a ton!!!💯👍🙏
@programminginfo34033 жыл бұрын
I will never forget your contribution and efforts🙏🙏. Congratulation for getting golden button play 👏👏. You deserve it.
@mrityunjaypandey91238 ай бұрын
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.
@mohanalane34157 ай бұрын
yes even i thought same and if u watch gate smashers he explains 1st way so don't know which method is correct as different answers are coming
@adediranoreoluwa9834 Жыл бұрын
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.
@ganeshk444 жыл бұрын
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.
@georgosfyssas7397 Жыл бұрын
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!
@t2gamerz43 ай бұрын
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.
@vedantdesai29817 ай бұрын
the clock and alarm concept really helped understanding the algorithm clearly 👍🏻
@randomvideos63553 жыл бұрын
Very Clear explanation Big thumps up for you sir
@mahimabisht64702 жыл бұрын
i cannot understand why p1 came after p3 in gantt chart
@hasan_eke Жыл бұрын
because till time 2 there was no process to put in ready queue, therefore scheduler put the p1 after p3 to complete the job, however at time 3 p4 has arrived and it had to be put in behind the p1 and it kept going like that.
@ShahbazKhan-pf3oo9 ай бұрын
Because p1 gets preempted at time 2ms and at that time p4 hasn't arrived (p4 arrives at 3ms) so p1 enters the ready queue and is placed after p3 and then at 3ms p4 arrives and is placed after p1..
@lyrical_kumaun.3 ай бұрын
Dimag kharab ho gya bhyiii
@FawadAbdullah-cd8fk3 ай бұрын
@@lyrical_kumaun.Mera kal paper ha aur ye ni aata baki sab aata😂
@aleksandarristoski27772 ай бұрын
@@ShahbazKhan-pf3oo te obozhavam
@mengasrivani50273 жыл бұрын
Thank you very much sir... In this pandamic situation these lecture help me a lot...
@prernagarg58923 жыл бұрын
Nice explanation , it's clear my doubt Sir
@noobgameplay21 Жыл бұрын
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?
@dianacarolinavertizdelvall68362 жыл бұрын
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?
@t2gamerz43 ай бұрын
this video is better than sir Faisal Cheema's 1.5 hour lecture.
@Santosh-xh9il Жыл бұрын
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
@ayushiyadav13 ай бұрын
19:42 thanks a lot, crystal clear.
@dontwanna67594 жыл бұрын
sir you are angel !!!!!!!!!!!!!
@mhamadslyman6089 ай бұрын
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
@sweetmelon33653 жыл бұрын
thanks a lot, helped me understand for my project
@saumyadeepsaha929211 ай бұрын
@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
@linguafranca78343 жыл бұрын
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.?
@ShamSundarK3 ай бұрын
Thank you sir you are just amazing
@koderkids72603 жыл бұрын
Great explained !!
@shahadalrawi67446 ай бұрын
You are a legend!
@divyaagarwal30912 жыл бұрын
Awesome explanation
@md.obaidarahmani604 Жыл бұрын
best explanation
@janetmajekodunmi3965 Жыл бұрын
why wouldn't the gantt chart order be p1, p2, p3, p4 instead of p1, p2, p3, p1 at @8:06?
@ShivamSharma-vw5zg3 жыл бұрын
Average Waiting time = 5.8 ms Average Turn-around time = 8.6 ms Is it correct ?
@shivamrawat42893 жыл бұрын
yes, it is as also i got the same ans.
@PradeepYadav-fg2yg2 жыл бұрын
yes even i got the same answer
@letmecodefirst78922 жыл бұрын
Same here
@unzi876 Жыл бұрын
how did you find it can you write the steps
@bavenraj15622 жыл бұрын
My lecturer got PhD but u teach far better than him. 🤝
@badrinarayanan622710 ай бұрын
Amazing sir
@firozs19233 жыл бұрын
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
@soujanyaas90743 жыл бұрын
Best one
@abbasramees42382 жыл бұрын
what if there is a priority with round robin, should I consider it? I have got that kind of question in an exams
@imaneousalah2 жыл бұрын
Thank you so much sir
@orekisato91452 жыл бұрын
whats happens when there is no time quantum given?
@divyanshtripathi4280Ай бұрын
Why P1 come after P3??
@dhanushsivajaya13563 жыл бұрын
Thankyou sir
@user-vn3dg9lp2g3 жыл бұрын
your tutorial did not completed
@abolirandhir52423 жыл бұрын
What if the arrival time start from 1 ms
@m.andrafadhillah85162 жыл бұрын
Welp im here to say thank u very much
@abigailbitrus9785 Жыл бұрын
Make a video for FCFS in I/O requirements
@nidhinhari83974 жыл бұрын
Sir Upload all videos... please
@Robdbank3 жыл бұрын
My os exams is today 😥
@ChandanG94805 Жыл бұрын
super
@frontmanplays80842 жыл бұрын
I will send one question would you tell me the answer