00:01 Discussing the problem with first come first serve scheduling algorithm 02:16 Preparation of Gantt chart for 5 processes 04:29 Process arrival and execution time analysis 06:46 Determining CPU scheduling based on process arrival times and IDs. 08:54 Turnaround time is the time taken for a process to complete its execution 11:00 Waiting time is the time a process spends waiting to get the CPU. 13:13 Calculation of turnaround and waiting time for processes 15:17 Calculating average turnaround and waiting time 17:19 Average turnaround time is 8 units, and average waiting time is 4.4 units
at 11:00 I think it is more intuitive to think of the waiting time's formula as the scheduled time(being the time it got to use the CPU) minus the arrival time.
You are right, but it won't work in case of pre-emptive algorithm, so your formula is actually for calculating response time, which is same as wait time in case of non pre-emptive.
Nice Series really keep going , i was asking if u can share videos about deadlock because i found it a bit hard to understand by myself & thanks in advance .
In layman Turnaround time is.... Process ke ready queue mein aane se, fully execute/termination tak ka time And waiting time is ready queue mein aane se, running state/cpu allocate hone tak ka time is waiting....
@@rishabmudliar1058 our prof once said if you have the same arrival time then check the burst time and choose the one with fewer bt so it can finish faster. I don't know what's the correct one ngl
In my opinion the inventors would have done better to distinguish the names between instants and intervals:someting like Turn Around Time INTERVAL and Waiting Time INTERVAL Anyway you explained it clearly,it was a pleasure to follow your videos.Thanks.
its simple when u stand in a queue lets say bank queue, firstly your entire work will be done by the depositer, if you are depositing an amount, then only other person will come and get his/her work done, once you're done. thats all about nonpreemptive because, here the process will execute until its totally executed. hope u understood
Cuz after the burst time for P3 no process where present in the queue so if there will be a arrival time like 1,2 after the process P3 in the queue it will be put in there but here its is idle that is no process is waiting in the queue so we can look for the next arrival time after 3 or 3 in the table. In here we only have 4 so there will be a missing unit of time in between 3 to 4 so we r using the shaded regin.
Calculate average waiting time and turnaround time of the following given process(use FCFS scaduling algorithm)and represent by Gantt chart Process burst time P1 5 P2 24 P3 16 P4 10 P5 3
its simple when u stand in a queue lets say bank queue, firstly your entire work will be done by the depositer, if you are depositing an amount, then only other person will come and get his/her work done, once you're done. thats all about nonpreemptive because, here the process will execute until its totally executed. hope u understood
First of all , thanks alot for this amazin tutorials Secondly i think there is a mistake calculating Turnaround Time How is Turnaround = Completion-arrival ? and at the same time Turnaround = wating + burst ?? if we apply the first equation Turnaround will be always equal to burst time but the second it is diferrrent ?? i hope an answer for this since i think the second equation is correct.
Draw cantt chart and calculate the average waiting time and average turnaround time fo processes using FCFC and SJF (non -primptice. Process p,p2,p3,p4 , burst times 10 ,5,7,3 , arrival time 0, 1,2,3 Sie please answer mi
Arrival time is Time taken for the process to reach the "ready state" right? not the time when the process can use cpu i.e "running state". If that the case, the Gantt chart is actually concerning about time of the process when it is reaching "ready state" not "running state". Meaning, ready state is still part of ready queue of job queue i.e it still cannot use cpu at that time.
@@58_vikassingh32 see the arrival time..................it arrived at 6 but after idle the process P1 came at 4 so (6-4) = 2. This is the diff from 9 and 7.
@@hemiacetal1331 @Rishab Mudliar what if arriving time is starting from 1 ...( question me arriving time 0 nhi diya hai to gantt chart me kaha se likhe ...)
clearing such a Big topic in short time is really Talent of U
00:01 Discussing the problem with first come first serve scheduling algorithm
02:16 Preparation of Gantt chart for 5 processes
04:29 Process arrival and execution time analysis
06:46 Determining CPU scheduling based on process arrival times and IDs.
08:54 Turnaround time is the time taken for a process to complete its execution
11:00 Waiting time is the time a process spends waiting to get the CPU.
13:13 Calculation of turnaround and waiting time for processes
15:17 Calculating average turnaround and waiting time
17:19 Average turnaround time is 8 units, and average waiting time is 4.4 units
Very helpful video. It helped me solve an exam excercise. Thank you my friend. Liked.
Teaching was a god level that's why I love neso academy ❤
Bro... I seen evry youtober video but they said but not completely so u explained us the right way of getting crrect marks .well done
This help me on my final exam. Thank very much.
Thankyou so much! You explained it very well so we can understand easily
Amazing video it cleared all my doubts😊
Very nice explanation. Which understand properly thank you so much for sharing it.
thank youuuuuu, it helps me to understand a lot.
thanks a lot neso academy for providing such easy explanations
at 11:00 I think it is more intuitive to think of the waiting time's formula as the scheduled time(being the time it got to use the CPU) minus the arrival time.
You are right, but it won't work in case of pre-emptive algorithm, so your formula is actually for calculating response time, which is same as wait time in case of non pre-emptive.
Nice sir in your teaching is good i am easily understand
perfect and precise... thank you sir
Thanks alot . There explanation is very simple and easy to understand.
Nice Series really keep going , i was asking if u can share videos about deadlock because i found it a bit hard to understand by myself & thanks in advance .
Very educative❤❤❤
I dont know why it is called burst time but not just execution time lol
Because whenever CPU starts to execute, the clock frequency increases like a burst. So it's simply called burst time.
execution time = burst time+waiting time
Burst Time is the Time for which the process needs to be in the running state. It's not execution time
Coz it's a time taken to complete their exucation
Burst time: Time required by a process for CPU execution.
so best ever learning video FCFS
In layman
Turnaround time is.... Process ke ready queue mein aane se, fully execute/termination tak ka time
And waiting time is ready queue mein aane se, running state/cpu allocate hone tak ka time is waiting....
usefull video sir thank you very much❤
very nice explanation sirji!
Awesome content!!🔥🔥
YOU ARE THE BEST!!!!!!!!
yes, clear. thanks a lot! ❤
Nice thanks for this video
great lesson
Sooo grateful!
Thanks a lot!!!
Thank you sir❤❤❤✊✊✊
sir in making the gantt chart when we have to choose between p2 and p4, we should take the p4 1st bcz it result to less average waiting time
i have the same thought
@@akkir6707 in FCFS if arrival time is same we select the process_id with lower id so p2 instead of p4
@@rishabmudliar1058 our prof once said if you have the same arrival time then check the burst time and choose the one with fewer bt so it can finish faster. I don't know what's the correct one ngl
@@akkir6707 that could be for sjf ig
@@akkir6707 for fcfs we go this way
One of the best
thanks for video, please upload these to ur website. PLS
In my opinion the inventors would have done better to distinguish the names between instants and intervals:someting like Turn Around Time INTERVAL and Waiting Time INTERVAL
Anyway you explained it clearly,it was a pleasure to follow your videos.Thanks.
Thank you very much sir
thank you so much!
1-2 saal pahley ye video series rahta tow mera OS mein badhiya no. rahta
this is so helpful
Clear explained
Thank You So Much😊
Thank you so much for help Sir.
great video well explained thank you
Simply awesome
Thank you so much
Thank you sooooooooooo much
Thank you sir
Plz share video about deadlock avoidence
Great one.
What about RT (Response Time)?
It is preemptive or non preemptive? How will we know that?
its simple when u stand in a queue lets say bank queue, firstly your entire work will be done by the depositer, if you are depositing an amount, then only other person will come and get his/her work done, once you're done. thats all about nonpreemptive because, here the process will execute until its totally executed. hope u understood
Thank you
Thankyou sir
Great video
is this a type of preemptive on fcfs?
Very helpful
thanks
Thank you...
Tq sir to explain this
Thanking you sir
Sir, why should P5 must wait for 9 units of time... Since it came late and ntg to do with P1? Pls clarify my doubt
@Omkar Jadhav Thank you sir😇
Sir possible of getting -ve in waiting time
God bless you
Tomorrow is my exam
I don't understand why there's a shaded box in the Gantt chart...Can someone explain?
Cuz after the burst time for P3 no process where present in the queue so if there will be a arrival time like 1,2 after the process P3 in the queue it will be put in there but here its is idle that is no process is waiting in the queue so we can look for the next arrival time after 3 or 3 in the table. In here we only have 4 so there will be a missing unit of time in between 3 to 4 so we r using the shaded regin.
How do you calculate throughput
It is calculated by dividing number of processes by Schedule Length.
ie. no of processes / Schedule Length
This question is premptive or non premptive
sir how did u find 19 total while me i got 18 for the total sum of the bursttime
Do you have SPF or Shortest-Process-First video?
By the way thank you for this video it helps me a lot.
Is this non preemptive or preemptive?
Non preemptive
Calculate average waiting time and turnaround time of the following given process(use FCFS scaduling algorithm)and represent by Gantt chart
Process burst time
P1 5
P2 24
P3 16
P4 10
P5 3
Answer
is it ok if i let p4 to be first since it has less burst time than p2?
No, First Come First Serve means the process with the least arrival time comes first which is P3 {0}
what if you have an arrival time of 1 first instead of 0?
Then the interval between 0 and 1 is idle and the process enters the ready queue at t=1
@@retroelx3014 i already finished the course lol but thank you so much for this, it's a heads up for those who didn't know yet, cheers
Is this preemptive or non preemptive
its simple when u stand in a queue lets say bank queue, firstly your entire work will be done by the depositer, if you are depositing an amount, then only other person will come and get his/her work done, once you're done. thats all about nonpreemptive because, here the process will execute until its totally executed. hope u understood
Sir is ka FCFS ka code C++ bhi dy dy
please
First of all , thanks alot for this amazin tutorials
Secondly i think there is a mistake calculating Turnaround Time
How is Turnaround = Completion-arrival ?
and at the same time Turnaround = wating + burst ??
if we apply the first equation Turnaround will be always equal to burst time but the second it is diferrrent
??
i hope an answer for this since i think the second equation is correct.
edit : i am sorry it is my mistake , i forgot that we suppose that all processes arrive at time 0 , so both equations are right (-:
what is the name of the background music lol.... btw your videos are awsome .
Draw cantt chart and calculate the average waiting time and average turnaround time fo processes using FCFC and SJF (non -primptice. Process p,p2,p3,p4 , burst times 10 ,5,7,3 , arrival time 0, 1,2,3 Sie please answer mi
Best ❤️
I'm still confused
@Dustin Josue ok
😂
Arrival time is
Time taken for the process to reach the "ready state" right?
not the time when the process can use cpu i.e "running state".
If that the case, the Gantt chart is
actually concerning about time of the process when it is reaching "ready state" not "running state".
Meaning, ready state is still part of ready queue of job queue i.e it still cannot use cpu at that time.
what is about the waiting time formula?. It gives a waiting time of P2=7 but it should be 9 (5+4)?.Please help me out
@@58_vikassingh32 see the arrival time..................it arrived at 6 but after idle the process P1 came at 4 so (6-4) = 2. This is the diff from 9 and 7.
No, arrival time is the time at which a process enters the ready queue for the first time so it's an absolute value, not an amount of time.
@@hemiacetal1331 @Rishab Mudliar what if arriving time is starting from 1 ...( question me arriving time 0 nhi diya hai to gantt chart me kaha se likhe ...)
Avg waiting time = 5.4 units
2:18 🤣🤣🤣🤣🤣🤣
😂😂😂😂😂
Bade harami ho beta😂
😂😂😂😂😂😂
😂🤣🤣🤣
😂
sir can u just put videos from syllabus fast as we have exams to give!!
Bro they too have to earn
nice
Thanky🐵u
2:09
Why dont you complete the whole subject?
We have already completed it as per the GATE syllabus. Please install our Android app to access the complete course.
❤❤❤❤❤
Some one please reply me, what if the table has an another coloumn named priority? Which process need to taken first?
this is FCFS, which process come to ready queue first will be executed first so priority has nothing to with this scenario
your video is error waiting time =start time-arrival time
I have my exam in 30 min
appreciate to u
Great video but the video is too long you repeat same thing over and over again.
Nope!
u don't get the idle time
Gantt chart
💙
Bhai Hindi mein padhya kr
Thank you
thank you so much
Thank you!