Your explanations are excellent! Your videos have been used as additional material in my university as well, and thanks to that my colleagues and I have managed to completely understand and implement CPU scheduling. Thank you!
I just seen your video tutorial ........and it was really effective for everybody when they need.and the think is i never blv that is you are a bangladeshi........ really unique Accent of english...........thnxs ...........
Mifta, you are awesome. I wish that you were my professor. Also, you have the best videos for Systems programming on RUclips!! Great job and thank you.
Straightforward explanation from you. SJF (Non preemptive) made easier. However, she did not show us how to calculate throughput, if anyone knows please assist. Learning all the way from Zimbabwe.
Please Make Subject Wise Playlist. It's Very Difficult to find all the videos. Very well explained, subscribed. Please make subject wise playlist. Thank you.
such an awsum video lec on SJF(Non preemption)..understood finally the gantt chart thnx a lot mam..hoping u upload another such vid on RR scheduling algorithm
Additional Information: TAT = Completion Time(CT) - AT and WT = TAT - BT. And by the way, completion time is the time which the process has finally ended. And these formulae are also applicable in all type of Scheduling policy
Mifta Mam Thank you sooo much for this video.. but there's a one question in my mind is waiting time is completion time minus arrival time this equation is given in my book. then tell me what is the right answer? your equation right or mine..
believe me you even explaining much better than our OS teacher , you just saved me from exams thank you so much
thanks to you I understood one month of class in just one day, awesome thanks
Your explanations are excellent! Your videos have been used as additional material in my university as well, and thanks to that my colleagues and I have managed to completely understand and implement CPU scheduling. Thank you!
i can't describe how much amaze i am by how good your explanation is, thank you
awesome awesome awesome!!!!! it took my tutor 2 weeks to help me get this lesson and thanks to you I've learnt it in 8 minutes... thanks a lot...
all your scheduling algorithms are really helpful! thank you and keep it up!!🤘👌👌
I just seen your video tutorial ........and it was really effective for everybody when they need.and the think is i never blv that is you are a bangladeshi........ really unique Accent of english...........thnxs ...........
Thank you mam this is awesome tutorial. I have exam tomorrow. I didn.t understand this topic now it's clear. Keep uploading all the lectures.
Thank you soooo much. Very clear. Makes me want to learn more...
Thanks for your useful lecture, I searched to get lecture as you explained here too easily, ❤️
i was getting bored to learn this sums but your teaching skills made me look all the sum awesome
Tomorrow is my exam, never attended any class, but your videos made everything crystal clear. U r just Boss Apu.
Mifta, you are awesome. I wish that you were my professor. Also, you have the best videos for Systems programming on RUclips!! Great job and thank you.
awesome explanation by u mam, allmost cover each and every concept of non preemptive shortest job first
Short and simple. Thank you very much
great teacher and sweet nerdy voice. hahahahahahahaha. 😎
Straightforward explanation from you. SJF (Non preemptive) made easier. However, she did not show us how to calculate throughput, if anyone knows please assist. Learning all the way from Zimbabwe.
you are amazing! thank you so much!
Very Informative. Thank you.
Please Make Subject Wise Playlist. It's Very Difficult to find all the videos. Very well explained, subscribed. Please make subject wise playlist. Thank you.
i wish u were the teacher in our class ..
nice nice, you just made it look simple and easy to understand, thank you :)
Its really helpful to the new learners
very nice mam!!...............
thank you sooo...... much
such an awsum video lec on SJF(Non preemption)..understood finally the gantt chart thnx a lot mam..hoping u upload another such vid on RR scheduling algorithm
Yes, will be uploading RR algorithm simulation soon.
tysm mifta mam..
What are the equipment and software you use for making the videos?
+mifta What are the equipment and software you use for making the videos?
VERY iMORESIVE & eASY TO UNDERSTAND pRESENTATION,,, ILIKE Ittt...
clearly explained....keep up the standards...
in the first example y did u consider p3 instead of p5
helpful and ur voice is much more modulated...mam
Awesome tutorial! Thanks! :)
And finally i understand about SJF!
Thanks
you explaint beautiful better than my teacher.
Thank you.Easy to understand.
I like the way u say "Fully"
thanks a lot!!! u just saved me from a retake
wow the best way to explain thank you so much 😊😊😊
Thank you!! Perfect teaching!!!
that was very clear and simple, thanks
you really saved us!!! thank u!!! :)
thank u mam u r awesme..... thnks for xplaining clearly
nice explanation, thank you very much
thankz u so much your english is simple and understandable👍🏻
wonderful explination
Additional Information: TAT = Completion Time(CT) - AT and WT = TAT - BT. And by the way, completion time is the time which the process has finally ended. And these formulae are also applicable in all type of Scheduling policy
any idea of response time?
thank you :) really perfect !
Thank you so much! blessings
Thanks a lot frm u I cleared the my doughts about this problem
Really Nice One, Sister !!!
thank you very much mam ....very clear and nice explanation....
thankyou so much, this is so helpful !
Great job! Mamdam.
Very helpful. Thank you !
Thanks.
Why you took P2 ? P4 is the most recent process !
Not about what is most recent, its about which has the shortest batch time
1:28 its not seconds, its units of time because cpu runs alot faster than we think it is all the time!
Great .. Thanks mam
very helpful toturial.
great explanation!
Mifta Mam Thank you sooo much for this video.. but there's a one question in my mind is waiting time is completion time minus arrival time this equation is given in my book.
then tell me what is the right answer?
your equation right or mine..
thnk u sooo much ma'am...really d best explanatn :)
+miss pooja how sweet
it takes 75 mints for our os teacher to explain that Thank you ...
Thanks so much!!!! Your awesome!!!
that's a great video, ^_^
can I get the name of the application your using, please !
thanks understand this topic with in few Mints.
Q2} how to start suppose burst time p3 , p4 same
it would be great if you creat an example of Highest Response Ratio First algorythm
why did u take P1 always first... even he have more BT ? plz explain
thanks
Because at 0(time units) there is no other process in the ready queue so it has the shortest time remaining
thank you so much!!! u save me😭😭
devru madam neevu 🙌🙏
Thank you for this. :)
THAKS SO MUCH ,IT VERY CLREAR
many thanks for this video
great job, thanks
What are the equipment and software you use for making the videos?
Dhonnobad :)
You had me at "je" :)
thanks a lot :)
thanks a lot apuu :)
thank you that was perfect
Thanks mam :) it helps a lot :)
Thanks so much
Are You Mifta Sintaha From Bangladesh school Academia?
mam plz upload all the topic of os.
But why do we start with P1?
if two arrival have zero time how do we check
Thank you so much
Thank you!
I admire your voice
TAT = WT + BT
is this formula correct to calculate TAT?
+ownerofhell100 yep it is correct
nice video thx ;)
Mam ! will you please help me ?
I have doubt in question , kindly please help me ?
Crystal clear :)
suppose p1 arrive time 4 and p3 is 0 how to start
I dont understand its not the SJF that my teacher teach me. You suppose to start with P5 because BT is 1
You can't start with P5 because it doesn't join the ready queue until 7(time units)
Thank alot mam.
Thhhhhhhhhhhhhhhhaaank you :D
Ty :)
I want know how u taked p3 before p5
And the p5 smallest than p3
Exactlyy
She have to giv itss answer😠😠😠
love the voice
Thanks sweet heart :)
Thanks apu