I am soooo glad you give the hardest example unlike the other tutorials their examples are easy af, my professor doesn't give those kind of examples on quizzes
To calculate WT we can simply subtract the time it has finished to the sum of burst time and arrival time. for p3 it would be 21-(7+2)=12. I find this easy. thanks for this tutorial, really helped. :)
The good thing about these presentations is yet unknown to people, Voice is normal at Normal speed , 1.25 , 1.5 and even 2.x and in this the lecture time is reduced to half but yet is completely understood. Very nice.
An easier way to explain the calculation of Waiting Time(W.T) is : 1) Calculate all the completion time(C.T) for example for P5 it is 29 for P3 it is 21 and for P7 it is 15 2)calculate the Turn Around Time(T.A.T) which is : T.A.T=C.T - A.T 3)now for the Waiting Time (W.T) : W.T=T.A.T - B.T here is an example : for process P1 : C.T = 9 (As P1 process is completed at 9 unit of time ) A.T = 8 T.A.T=C.T - A.T T.A.T=9-8 =1 W.T=T.A.T - B.T W.T=1-1 =0 and accordingly you can do the calculation for rest of the processes. p.s this might look lengthy but it clears the concept
thanks a lot mam and really if a person is able to understand this question he will be able to do other sjf preemptive question on his own this tutorial is really helpful please upload some more tutorial
Thanks for the tutorial first, and I was thinking the explanation was about SRTF which is preemptive version of SJF that is nonepreemptive, am i right?
if any process appear more than 2 times, then last visiting time - 1st finish - 2nd finish? or 3rd visiting time - 2nd last finishing time + 2nd visiting time - 1st finishing time?
tutorial is really helpful..... but there is more easier way to find Waiting Time. Waiting Time= (last response time - arrival time - amount of time spend to execute a process).
i follow your videos last few day's. And those was very helpful. now i got a problem in preemptive priority sjf algorithm. i cann't understood it clearly. much confused. i know u have a video on preemptive sjf, but not onto preemptive priority sjf. i cann't understand about it to see other videos. tomorrow will be my exam on operating system, but now i am not clear about it. so plz dear, if u can made it as early as possible then it will be very helpful for me.
9 years later someone is here to say thank you😊❤
There's an easier way to find the waiting time..we first calculate the turned around time
Turn Around Time = Terminate Time - Arrival Time
I mean by (terminate time) is the ending time of each proccess..
here it's
P1 = 9 - 8 = 1
P2 = 7 - 5 = 2
P3 = 21 - 2 = 19
P4 = 11 - 4 = 7
P5 = 29 -2 = 27
P6 = 6 - 4 = 2
P7 = 15 - 3 = 12
Now, we can find the waiting time using the TurnAroundTime :
Waiting Time = TurnAround Time - BurstTime
P1 = 1 - 1 = 0 P5 = 27 - 8 = 19
P2 = 2 - 1 = 1 P6 = 2 - 2 = 0
P3 = 19 - 7 = 12 P7 = 12 - 5 = 7
P4 = 7- 3 = 4
TYSM!! I FOUND THIS METHOD EASY...:)
Waiting Time= TT-Process Time
Life saver. Thanks. :D
Nice! In my brain, this is the easiest way to look at it:
WT = FinishTime - (AT + BT)
tat= completion time - arrival time
Thank you Mifta for the simple yet elegant detail on your visuals on your tutorials and the clear explanation as well! Keep it up! :)
The first video that made sense for calculating Waiting Time! Thank you :)
I am soooo glad you give the hardest example unlike the other tutorials their examples are easy af, my professor doesn't give those kind of examples on quizzes
Great explanation, Thanks a lot and keep producing more of these Tutorials. I love your blackboard as its reminds me of first year at school.
To calculate WT we can simply subtract the time it has finished to the sum of burst time and arrival time.
for p3 it would be 21-(7+2)=12.
I find this easy.
thanks for this tutorial, really helped. :)
Way easier!
6 years later its still helpful to many people. Thank you
It actually helps. Thanks for keeping it as understandable as possible.
Really thank you, helped me alot, best video on RUclips, btw watched them all.
thanks a lot mam...i watched almost 5 videos to learn dis thing but none of them had better explanation. loved it...keep it up 😊
This was the best example... Thank you so much.. I understood the concept in one go.
Wow this explanation made alot of sense. Thanks you saved me from getting this wrong on my exam!
The good thing about these presentations is yet unknown to people, Voice is normal at Normal speed , 1.25 , 1.5 and even 2.x and in this the lecture time is reduced to half but yet is completely understood. Very nice.
I have been poor with the scheduling algorithms earlier. Not now ! Thank you so much for the video.
kya kamaal ka tutorial banaya behna ne ....Allaah aapko khushamded rakkkhe ..ameen .....bohut e mehertupurn sa learning process tha.
Really very helpful.Thanks a lot for the videos.We will be expecting more videos from you.
Thanks so much for your explanation. Best teacher
Are you from Bangladesh ? me too. Proud of you. We find very few tutor from our country. You are doing a great job !
ur voice is heaven on earth !! thanx a lot !!
ohh u save my life !!! it really helps me to understand better.
thank u so much ma'am..u r such an awesome tutor...i got it so easily...thanks a lot
Thanks alot Its quit difficult to teach this everyone. Thanks alot once again
thank you so much! this is so helping me in understanding the lesson :D
Thank you! You made it very easy to understand.
Thank you your explanation was excellent
thank you maam .......i actualy tried it hard by myself to learn ...cud complete it only by learning4m this vdo
nice video its very clear keep up thegood work thanks
perfect explanation with just ! effective voice
An easier way to explain the calculation of Waiting Time(W.T) is :
1) Calculate all the completion time(C.T) for example for P5 it is 29 for P3 it is 21 and for P7 it is 15
2)calculate the Turn Around Time(T.A.T) which is :
T.A.T=C.T - A.T
3)now for the Waiting Time (W.T) :
W.T=T.A.T - B.T
here is an example :
for process P1 :
C.T = 9 (As P1 process is completed at 9 unit of time )
A.T = 8
T.A.T=C.T - A.T
T.A.T=9-8
=1
W.T=T.A.T - B.T
W.T=1-1
=0
and accordingly you can do the calculation for rest of the processes.
p.s this might look lengthy but it clears the concept
thanks a lot mam and really if a person is able to understand this question he will be able to do other sjf preemptive question on his own this tutorial is really helpful please upload some more tutorial
thank you so much for all your Videos . there are very helpful
It really helps alot thank you ma'am for such a great video
This was very helpful, thanks :)
excellent teacher no mistakes at all :)
this was really helpful. THANKS ALOT !!!
i will see many videos but sjf is dont understand finally i understand completely after watching this video....ty
Oh my g! i really know how to do it! thank you :)
wow you are really wonderful. Your Tutorial is very exiting. I so much like it.
Awesome apu =D apnar english ascent ta joss :)
Thanks for your tutorial.
thank you for the explanation ! are you wearing bangles or some chain? coz there is some jingling background noise getting in with your explanation
Thanks your explanation was good .. :)
Thanks a bunch. The tutorial was helpful.
Thanks ma'am ur tutorial is really helpful..
Thank u mam and ur voice is awesome
Good example. Great explanation.
:-}
Thank you. I understood very well.
thank you very much :)
god bless you
thnx alot mam.. this helped me alot for my exams ...clear explanation
Thanx... mam... I completely understand... Thnaxx alot..
This is really helpful for me...
thank you very much!!! better explanation than my book lol
thank you very much!!! you save my life. . :D
this channel saved me.
thanks.... really enjoyed
Thnk you...very helpful video :)
love u mam great explanation 🙌
Thank you so much! 😊
thanks.... its easy to understand :)
Amazing 🎉
Thanks for the video
really very good thanks
Very Helpful!
u da real mvp
Very helpful...thank you
nice.. it is very helpful to undersand ,
Have you posted any videos on finding next cpu burst time?
mam if quantum time is not given then what to do? how to solve it
you are the best
thank you so much!!!
please what if you have 2 processes that have the same burst time and arrival time? Which one is taken into account first?
greet work ,thx Mifta Sintaha
Thanks for the tutorial first, and I was thinking the explanation was about SRTF which is preemptive version of SJF that is nonepreemptive, am i right?
Now I understand sjf preemptive
Excellent
Thank you for this
this is amazing
Thank you !!!!!
Thanks a lot :D
Thanks a lot.
Thanks !
Thank you!
saved 5 marks............. thanks a lotttttttttt. :)
very helpful!
what if a proccess arrives thrice in the gnatt chart, then how will i find the waiting time?
zalim.....thak u so mch
Thank you! :*
if any process appear more than 2 times, then last visiting time - 1st finish - 2nd finish?
or
3rd visiting time - 2nd last finishing time + 2nd visiting time - 1st finishing time?
Please make tutorial videos for Preemptive Priority, Deadline, MLFQ, MLQ ,Round Robin with Overhead please :) Thank you..
wt if the processes appear more than twice? how should we calculate the waiting time? please help :(
Thanks a Lot!! mam!
Amazzzzzzzinggg :)
Helpful .. Thnx :)
Thank u Ma'am... :)
if two arrival have zero time how do we check
ty :)
thank you
tutorial is really helpful..... but there is more easier way to find Waiting Time.
Waiting Time= (last response time - arrival time - amount of time spend to execute a process).
Piyush Kumar Your way of finding the WT is longer than the one explained in above video.... I have been calculating according the example...
Great!
Is there any video or example about Slack Stealing Algorithm.
Thanks
i follow your videos last few day's. And those was very helpful. now i got a problem in preemptive priority sjf algorithm. i cann't understood it clearly. much confused. i know u have a video on preemptive sjf, but not onto preemptive priority sjf. i cann't understand about it to see other videos. tomorrow will be my exam on operating system, but now i am not clear about it. so plz dear, if u can made it as early as possible then it will be very helpful for me.
what happen if the AT was given 2.000 and another 2.001 and 3.001? How long will it process??