Thank you soooooooooooooo much neso academy for your playlist on operating system. I follow the book of Galvin and these topics are exactly organized in the way like that of the book.. It has become so easy to follow ,that i cannot even explain.......... HAPPIEEEEEE :)
Brother hands-off to your explanation it's very interesting and very understandable manner the way your explanation is very very satisfies every candidate is needed. Am happy to listen your class and satisfies with great explanation.... Good growing brother all the very best for vedios and to your carrier...
### First Come First Served (FCFS) - simplest algorithm - FIFO (first in first out) queue - new process enters queue, its PCB is linked onto tail - waiting time is long - fcfs scheduling algorithm is nonpreemptive (if cpu has been allocated, process keeps the cpu until release) - problematic for time-sharing systems (each user cannot get a share of the cpu) | Process | Burst Time ms | |---------|---------------| | p1 | 24 | | p2 | 3 | | p3 | 3 | waiting times: - p1 = 0 ms - p2 = 24 ms - p3 = 27 ms - average = (0+24+27)/3 = 17 ms change order to p2 -> p3 -> p1: waiting times: - p1 = 6 ms - p2 = 0 ms - p3 = 3 ms - average = (6+0+3)/3 = 3 ms
I’m so happy to have found this channel. Your videos are easy to follow, with human-friendly explanations. Thank you!
haha human friendly lol
@@gourav1163 😅
I observed that even my lecturer took the screenshot of ur video to explain it clearly.
Same to us
Same twye the notes are also same😢
You're such a good teacher, it blows me away.
Thank u Sir for providing a simpler and better understanding of these tough subjects. Keep up the good work.
calculation of the waiting time has always confused me,but after watching this,I'm now okay.Thank you so much for this.
AM ALSO OKAY
Thank you soooooooooooooo much neso academy for your playlist on operating system. I follow the book of Galvin and these topics are exactly organized in the way like that of the book.. It has become so easy to follow
,that i cannot even explain.......... HAPPIEEEEEE :)
This is one of the best channels ion UA-cam. thank you so much for this sir.
I've learnt half of my curriculum with the help of your videos! Thanks you! ❤❤❤❤❤❤❤
Thank you so much for this channel. You’re doing an amazing job
Thank you! You are my that friend who teaches before exams.
He's mine
Brother hands-off to your explanation it's very interesting and very understandable manner the way your explanation is very very satisfies every candidate is needed. Am happy to listen your class and satisfies with great explanation.... Good growing brother all the very best for vedios and to your carrier...
Quickly understandable sir🤗🤗
Thanky so much , Seriously You are a life saver..🙏🏼
Hi Neso Academy, ur explanation is amazing. Pls upload remaining topics of this subject as well.
Thanks for giving such type of contents😊
Your videos are impeccable sir 🙏
so good undestanding
Ur videos are like life saver for us big big thanks ❤️
thanku so much for thses wonderful lectures
So beautifully explained
### First Come First Served (FCFS)
- simplest algorithm
- FIFO (first in first out) queue
- new process enters queue, its PCB is linked onto tail
- waiting time is long
- fcfs scheduling algorithm is nonpreemptive (if cpu has been allocated, process keeps the cpu until release)
- problematic for time-sharing systems (each user cannot get a share of the cpu)
| Process | Burst Time ms |
|---------|---------------|
| p1 | 24 |
| p2 | 3 |
| p3 | 3 |
waiting times:
- p1 = 0 ms
- p2 = 24 ms
- p3 = 27 ms
- average = (0+24+27)/3 = 17 ms
change order to p2 -> p3 -> p1:
waiting times:
- p1 = 6 ms
- p2 = 0 ms
- p3 = 3 ms
- average = (6+0+3)/3 = 3 ms
thank you very much sir for this video
This video really helped. Thankyou 😁
Lots of thanks for teaching sooooo nicely and simple
Good work it is sir😍
Stunning explanation
Thank you very much brother💐💐💐
thank you very much sir,very great job.
I love your videos 👍👍
It was very helpful for me
great explanation! Loved it!!
Thanks to explain in short but in detail
Very helpful channel 👆👆👆🙏💯
6:29 Full volume replay
😂😂
thanks oll of the lecture education for this video
Professor in my college watch your videos too. He also pronounces it with same accent 'Gand chart'
Dude😭
Best channel ! Thank you so much !
Very good explaination
another level nice one
Thank you so much
Thank you 🙏
Thank you so much Sir
thank you
Is burst time you shown in this video example includes both the time for I/0 burst and CPU Burst?
It is very usefull because in my class time i am always in od so this is my class room😂
Plzz make videos on Data Structure and Algorithm plzzz
important notes:
The average waiting time under the FCFS policiy , however is quite long
why the arival time of the process is not mentioned on the table? please do comment on this query
Thank u sir
Pls can you clear that waiting time of p3 is 6 in 2nd gant chart u said how it comes?
The best
Thankyou sir
Gantt chat 😂😂😂😂
yes clear
Is it possible that you guys to upload the last few chapters?
Does arrival time specify which process comes first ?
Yeah
♥♥
Gantt Chart?😂
gooooooood
What is gantt chart
when you upload remaining scheduling alogorithem........
gantt chart???
6:29 I'm sorry what? 💀
thank you my professor sucks
pano makuha yung arrival time thankyou po
Please Sir implemented on C++ code easy method Please
🙏🥺🥺😌😅🔥❤
5
Shoutout me