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 :)
### 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
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...
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.
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 u Sir for providing a simpler and better understanding of these tough subjects. Keep up the good work.
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 TH-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
### 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
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...
Hi Neso Academy, ur explanation is amazing. Pls upload remaining topics of this subject as well.
Thank you! You are my that friend who teaches before exams.
He's mine
Quickly understandable sir🤗🤗
Thanky so much , Seriously You are a life saver..🙏🏼
Ur videos are like life saver for us big big thanks ❤️
so good undestanding
Your videos are impeccable sir 🙏
So beautifully explained
thanku so much for thses wonderful lectures
6:29 Full volume replay
😂😂
Thanks for giving such type of contents😊
thank you very much sir for this video
Lots of thanks for teaching sooooo nicely and simple
Stunning explanation
This video really helped. Thankyou 😁
thank you very much sir,very great job.
Thank you very much brother💐💐💐
It was very helpful for me
Good work it is sir😍
Thanks to explain in short but in detail
great explanation! Loved it!!
Professor in my college watch your videos too. He also pronounces it with same accent 'Gand chart'
Dude😭
thanks oll of the lecture education for this video
I love your videos 👍👍
Best channel ! Thank you so much !
Very good explaination
Thank you so much Sir
Very helpful channel 👆👆👆🙏💯
Does arrival time specify which process comes first ?
Thank you so much
Thank you 🙏
Pls can you clear that waiting time of p3 is 6 in 2nd gant chart u said how it comes?
thank you
Plzz make videos on Data Structure and Algorithm plzzz
another level nice one
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
It is very usefull because in my class time i am always in od so this is my class room😂
Is burst time you shown in this video example includes both the time for I/0 burst and CPU Burst?
Thankyou sir
Is it possible that you guys to upload the last few chapters?
Thank u sir
The best
Gantt chat 😂😂😂😂
yes clear
What is gantt chart
when you upload remaining scheduling alogorithem........
Gantt Chart?😂
gantt chart???
pano makuha yung arrival time thankyou po
gooooooood
♥♥
6:29 I'm sorry what? 💀
Please Sir implemented on C++ code easy method Please
thank you my professor sucks
5
🙏🥺🥺😌😅🔥❤
Shoutout me