Striver, your DSA Sheet is absolutely phenomenal! It's been an invaluable resource for mastering data structures and algorithms. Looking forward to the remaining topics, especially the much-anticipated sections on strings and heaps. Thanks for all your hard work!
Given is burst time. You need to take average of wait time. And shortest burst time need to be executed first, hence sorting required else you might take bigger burst time first.
ig without shorting you can't impliment sjf because the requirement is smallest will be executed first and for the sake of chossing smallest sorting is necessary. correct me if i am wrong
We are calculating waiting time for other processes. If we don't sort, even the process with smaller execution time will have to wait longer which will violate the SJF scheduling algo
Commenting first : “Not only students but the experienced employees also go through the playlist.”
Striver, your DSA Sheet is absolutely phenomenal! It's been an invaluable resource for mastering data structures and algorithms. Looking forward to the remaining topics, especially the much-anticipated sections on strings and heaps. Thanks for all your hard work!
God bless! striver for the hardwork
Well explained !
studying sjf in os and then implementing it, sure is fun!
you are best ❤
correction : the loop should iterate from 0 to n - 2 and not n - 1
sir u are awesome
understood
Take love ❤❤❤
Can we expect Stack and Queue playlist by end of this month or next month ?
YES! ...........................................................................................
Thanks
awesome
thanks
Understood
Videos on string stack queue too please?
youre lecture are amazing keep it up and bro plz a to z sda sheet wali list hatana mat i request you bcoz it help us alot.
ty sir
Maza aaya
understood
In code I think calculation was wrong (order of writing statement)
The tc is O(nlogn) or we have to write state O(n) + O(nlogn) ?
O(nlogn) > O(n) so we can simply write O(nlogn) time complexity
🙏
please bring the string video first .A humble request from us
US
why do we need to sort the arrary rather sum of all elements present in the array and then take the average if(average is only asked)
Given is burst time. You need to take average of wait time. And shortest burst time need to be executed first, hence sorting required else you might take bigger burst time first.
4;30
Why do we need to sort here? Doesn't simply adding all the elements and dividing them by the size of the array give the same result?
ig without shorting you can't impliment sjf because the requirement is smallest will be executed first and for the sake of chossing smallest sorting is necessary. correct me if i am wrong
We are calculating waiting time for other processes. If we don't sort, even the process with smaller execution time will have to wait longer which will violate the SJF scheduling algo
that will make it FCFS and not SJF
I love u raj vikramaditya
First view❤
please bring the string video first .A humble request from us