OS | Process Management | FCFS example | Ravindrababu Ravula | Free GATE CS Classes
ฝัง
- เผยแพร่เมื่อ 5 ก.พ. 2025
- For Course Registration Visit: ravindrababura...
. For Any Queries, You can contact RBR on LinkedIn: / ravindrababu-ravula
Telegram: t.me/ravindrab...
Instagram: / ravindrababu_ravula_rbr
- - วิทยาศาสตร์และเทคโนโลยี
Thank you sir i cleared by compiler construction course by watching your tutorials .. now its time for Operating System :P
Ravidrababu, tussi chaa gaye ho....bahut help aaya aapke khatir
No student is waiting for the teacher. Teacher is waiting for the students... So true and funny😅😅😅😅
you are the great teacher. aapki jay ho
i m a big fan of ur teaching sir. great
m really a big fan of u sir..u teach with such an ease....wonderful teaching
Thankyou, easily explained.
you make me better at this. Thanks sir.
You are amazing. Wish I had money to register your course.
great....... keep it up sir.
Good explanation sir ...can u take UGC NET cs topics?
I have one doubt How is it multiprogrmming if every process is running one by one ?
No student is waiting for the teacher example shows up
Me : Dayumnnnnnnnnnnnnnnnnn 🤣🤣🤣
sir ,how do we find the average waiting time if only burst times are given
sir, running time and burst time is the same thing right?
Thanks sir
How can we find burst time?
Ravindra Sir,,, Great
Thank you
good explination.everyone can understand easily.thanku sir
Bro the arrival is after the burst time bro teach us to understand the fcfs by the arrival time in between the burst time please it is very difficult bro
thanku so much sir
what if AT is 0 in every process ? Any opinions?
Thanks Sir:-))
Kisi k pass ho plz comments mai paste kar dena
Sir tell me it is necessary to know the arrival time
Sir wat if the burst time for pno 2 is 7
sir how many context switches are there in this example ???
One dougnt bro..if the any process have arriving time that process doesn't have any waiting time??
In Non-preemptive scheduling, If CPU is not busy then new process will have 0 waiting time as it will start getting processed as soon as it arrives.
Thank you sir
sir , what is throughput ?
Sir i want your material notes about which you were saying in first video of this series.
thank you sir
👌
Thank you,
Thanks😥😥😥😥😥❤️❤️❤️
Sir iska program ya algorithm kha milegi..
sir ,actually waiting time is the time for which the process waits in ready queue and arrival time is the time at which the process reaches to the ready queue
completion time=termination time-arrival time
therefore for the process, p2 completion time should be=4-3=1
before t=3 the process p2 is not even present in the ready queue,it has arrived at t=3 and soon it gets a chance for running ,therefore, its completion time should be equal to the burst time only,
it's wrong
Sir hindi me bhi video banayevna plz
sir aap fcfs pahale clear karo
thanks
why did you say 5 o clock??
5 of the clock. Clock is a relative term here. Which is the CPU clock, I guess.
Your accent is already too difficult to understand. Plus you write the words only with the initials. Please make your accent better or write it completely.
confused concepts
m really a big fan of u sir..u teach with such an ease....wonderful teaching
thank you sir
Thanks😥😥😥😥😥❤️❤️❤️