Preemptive SJF | CPU Scheduling Algorithm [Hindi] 

Thanks for your valuable feedback..

Thanks for your valuable feedback...

first take 0.0 bcus we are takinh the least number first

Thanks for your valuable feedback.. Also share below link with your friends to let them know about the channel. ru-vid.com

Aj mra OS ka ppr tha, r ALHAMDULILLAH I'm 110% sure mra ye qstn blkl theek hua h 😊 ALLAH BLESS U

yes definitely you will receive good marks in OS..best of luck...

Thanks for your valuable feedback.

Nhi

Thank you for your valuable feedback...

Thanks for your valuable feedback

Thanks for your valuable feedback

Thanks for your valuable feedback...

p6 ke baat sare process ready higye isliye burst time jitna hye utna hie add krdiya

Hi, Waiting time ka formula: Turn around time - Burst time Sir ne jo previous question krwaya tha aap usme yhi formula use kro ans same hi aayega

Or Turn around time ka formula: Process Complition time - arrival time

Welcome

Thanks for your valuable feedback... Also share below link with your friends to let them know about the channel. ru-vid.com

formula agal hota hye, ye wala formula bhi hye waiting time ko-- waiting time= start time - arrival time + new start time - old finished time

@@surjitkabla8191 toh hum koi bhi use kr skte h kya?

@@unknownman1 koi bhi nhi wo formula diya hye wo ya fir turnaround time - arrivl time

Time Quantum hai matlab voh round robin algorithm ka hai

Thanks for your valuable feedback..I will definitely try to upload...

Thanks for your valuable feedback.

You have to follow the sequence of processes. You have to select the process which arrives first.....In below Example P1 and P2 has same arrival time, but you will schedule P1 first because it has arrived first: process Arrival time P1 0 P2 0 P3 1

Easy Engineering Studies.. in this firstly p1 will come.. it will go up to 1ms after that at time 1 p3 is arriving.. it will go up to 1 ms again.. then at time 2 there is no process.. and process p2 is not completed.. then what should we do in this case..?

Answer is wrong. it is not fcfs. if arrival time is same we need to check burst time if burst time is also same then we shall check process ids

Thanks for your valuable feedback... Also share below link with your friends to let them know about the channel. ru-vid.com

Thanks for your valuable feedback..

Thanks for your valuable feedback

Thanks for your valuable feedback

Thanks for your valuable feedback...

if not mentioned in question, solve always by non preemptive method.

thank you very much sir

Ans same atta hey optional formula hai

@@pratikjoshi9147 waiting time of P2 is coming 8ms and for P3 it is coming 3ms from previous method

@@shreyashvardhan2827 try this formula; waiting time = start time - arrival time + new start time - old finished time

Thanks for your feedback... Also share below link with your friends to help me get more Subscribers for my Channel ru-vid.com

Easy Engineering Studies My friends count understand youer languge .. Plz if you can speak english or arabic .. Thanks

Thanks for your feedback..

AT always be given.

Thanks for your valuable feedback