I would like to say thank you so much. I suffer from the worst kind of ADHD. I have a very difficult time going from start to finish on anything.. Let alone a 50+ class on Operating Systems. Well here I am last class in the series. Thanks to the awesome way you guys lay everything out for your students. Your instruction is not only exciting, but very clear and concise. I am a fan for sure and look forward to not only starting, but finishing all of your computer science courses. Thanks for reuniting me to the word hope.. Sincerely, Aaron C. Hammock
Please post further videos on memory management and CPU cache...... As I'm getting addicted to your videos.... I don't like to study from my college faculties.... I just want to get Taught by You..... please share videos on data structures too like stacks, heaps, trees,etc...... Even i'm ready to pay for your courses now.....
10:28 this ques cleared a lot of misconceptions i had, thanks for bringing this problem solving session. Neso and the guy who' had taught this, both are incredible!! ❤🙏🤝
Respected Sir.Your way of teaching is best .Please Upload further detailed lectures on Memory management,Deadlock,file handling etc as soon as possible
These vedios are really Interesting. Please Make tutorials on the following Topics as soon as possible. 1.Intro to Synchronization 2.Intro to Deadlock 3.Intro to Memory Management Complete
? max thruput!=avg completion time. =least waiting time response time = time between user request from a program and the time the program does what's asked: relates to how quickly the cpu switches between tasks of different programs; rr has a steady interval of switching, fcfs varies with just how long it takes a process to finish up
can you please further explain the response time in RR and FCFS? Because I'm not really getting the concept of response time between these two scheduling algorithms.
Great series on os. However, its sad that we have to pay for the rest of the videos, especially when the goal of NESO Academy indicate: "We’re on a mission to provide high-quality education, we believe that the real world exists beyond the walls of costly institutions. Neso Academy is here to help you in all the possible ways." Would be great if the topics on process synch, deadlocks, main and virtual memory could be uploaded here.
Thank you for good knowledge of OS. Are you planning to share the next episodes: memory management (paging, virtual memory), concurrency in OS, CPU cache?
Isn’t the final answer incorrect? I think it should be FCFS since we have a proportionality on the waiting time, so it’s the first one to come in is going to be the highest priority
Upload further videos as soon as possible... I've asked for them a month ago and still videos haven't been uploaded... Please do something in this regard... I wanna study deadlock
I disagree sir, unless I am wrong, throughput, which is the number of tasks divided by the total time, will remain constant. What Shortest Job First scheduling minimizes is the average wait time, since it completely finishes the shortest jobs and thus short jobs do not sit around doing nothing waiting for longer jobs to finish first. But overall, I think no matter what scheduling algo is employed, to finish all given tasks it will always take the same amount of time to finish, thus throughput is the same
I would like to say thank you so much. I suffer from the worst kind of ADHD. I have a very difficult time going from start to finish on anything.. Let alone a 50+ class on Operating Systems. Well here I am last class in the series. Thanks to the awesome way you guys lay everything out for your students. Your instruction is not only exciting, but very clear and concise. I am a fan for sure and look forward to not only starting, but finishing all of your computer science courses. Thanks for reuniting me to the word hope..
Sincerely,
Aaron C. Hammock
Please post further videos on memory management and CPU cache...... As I'm getting addicted to your videos.... I don't like to study from my college faculties.... I just want to get Taught by You..... please share videos on data structures too like stacks, heaps, trees,etc...... Even i'm ready to pay for your courses now.....
Yes plz sir
Paid hai sir 😂
10:28 this ques cleared a lot of misconceptions i had, thanks for bringing this problem solving session. Neso and the guy who' had taught this, both are incredible!! ❤🙏🤝
Finally, I completed till here and learned a lot. Thanks for such a great playlist with an amazing teacher.
Thank you for these videos! They've been great help for my OS module.
Respected Sir.Your way of teaching is best .Please Upload further detailed lectures on Memory management,Deadlock,file handling etc as soon as possible
These vedios are really Interesting. Please Make tutorials on the following Topics as soon as possible.
1.Intro to Synchronization
2.Intro to Deadlock
3.Intro to Memory Management
Complete
Your explanations are so much clear and easy to understand, my all respect to you.
Respected Sir, your video lectures are very helpful and very easy to understand. Please continue uploading more videos on this subject. Thank You!!
please upload more videos on virtual memory,memory management ,file management etc..... plzz
Thank you very much Dear Sir For your effort and dedication.
Thank you soo much for such an informative playlist. Love your teaching style.
please upload further videos on OS.. i am really addicted to your videos...
Thank you so much for those amazing videos , well explained ,
Could you please upload more ??
Thank you so much for the effort , you saved my life !
Thank uu soo much sir. A big help
Thank You so much Sir for these really really helpful lectures...
Thank you, sir, I really enjoy watching your videos and your videos make OS easy for me to understand :)
please more of these problem solving videos, very helpful, thank you so much.
Please upload on memory management 🙏....and your videos helped me a lot :)
thank u sooo much sir for u'r healthy support to students like me, let God gift u with all u want..happy diwali sir...
thanks for uploading freely
Thank you sir for your efforts and wishing you a happy diwali
Great sir 👏
Please make some more videos on gate questions 🙏
Life savior..🎉
What textbook you recommend for the Operating system
Sir please upload more videos on this topic!
Thanks for the course!
Very helpful videos! Keep up the good work!
Sir, we are all waiting for you 😊
Congratulations fellow graduates of Scheduling Algorithms class
Thanks you sir.. It's very helpful.
? max thruput!=avg completion time. =least waiting time
response time = time between user request from a program and the time the program does what's asked: relates to how quickly the cpu switches between tasks of different programs; rr has a steady interval of switching, fcfs varies with just how long it takes a process to finish up
can you please further explain the response time in RR and FCFS? Because I'm not really getting the concept of response time between these two scheduling algorithms.
Great series on os. However, its sad that we have to pay for the rest of the videos, especially when the goal of NESO Academy indicate:
"We’re on a mission to provide high-quality education, we believe that the real world exists beyond the walls of costly institutions. Neso Academy is here to help you in all the possible ways."
Would be great if the topics on process synch, deadlocks, main and virtual memory could be uploaded here.
Sir plz upload all series as soon as possible..plzzz memory management i/o system file system 😢
Very helpfull
What about DBMS ? and Networking complete course ?
Thank you for good knowledge of OS. Are you planning to share the next episodes: memory management (paging, virtual memory), concurrency in OS, CPU cache?
@@nesoacademy and when??????????
Completed 🤩
Great! For the remaining chapters, install our app.
Already done!!😁
This is so good🥺
TYSM AND LYSM NESO.
Dear sir, Approximately one month gone, but no other lectures are upload about operating systems. When next lectures can upload.
Isn’t the final answer incorrect? I think it should be FCFS since we have a proportionality on the waiting time, so it’s the first one to come in is going to be the highest priority
Please upload the further topics.
Thanku so much sir🙏
Plz upload further vedioes on operating system
Plz upload c programming and data structures!
How can I get full course of operating system?
Please add Process Synchronization
In the question 4 the order of completion is [ P3 P1 P2]
but i dint know why was the ans [ P1 P3 P2]
can anyone please expain
yes the sequence shld be P1, P2, P3
thank you
Is this playlist completed ??
Sir,what about Deadlock videos
Sir please upload reaming topic s sir
Is this the last video??
Nice💖
isnt option c and d same?
Upload further videos as soon as possible... I've asked for them a month ago and still videos haven't been uploaded... Please do something in this regard... I wanna study deadlock
Next chapter is available on our android app.
@@nesoacademy sir plz don't ask for any money as it is bit difficult to pay for every chapter... This is my humble request
Thankyou sir
Who was watching these videos in 2x speed???????????????????
,🖐️
Can you upload the next vedios?
Sir upload vedios they are 205 vedios for os system
I disagree sir, unless I am wrong, throughput, which is the number of tasks divided by the total time, will remain constant. What Shortest Job First scheduling minimizes is the average wait time, since it completely finishes the shortest jobs and thus short jobs do not sit around doing nothing waiting for longer jobs to finish first. But overall, I think no matter what scheduling algo is employed, to finish all given tasks it will always take the same amount of time to finish, thus throughput is the same
i think the problem is assuming there are indefinite amount of processes and, within the limited time frame , SJF can get most jobs done
11:11
Awesome