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
@@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
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.
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 .
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
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....
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
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.
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
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.
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.
