7 hours left till my final exam of computer architecture & operating system subject, thank you for helping me to understand it properly. Greeting from NEU, Vietnam.
Wow TQ so much sir,ur explanation is so simple and easily understandable,most underrated channel,keep doing vds sir,u will reach one million subscribers surely
Thank you so so much for your clearly explanation it really help me to understand round robin scheduling algorithm. more power one love. From Engr Kabiru
Sir..thank you for this video..and i get knowledge on this problem But i have a question....that is. Assume the following workload in a system: Process Arrival Time Burst Time P1 5 5 P2 4 6 P3 3 7 P4 1 9 P5 2 2 P6 6 3 Draw a Gantt chart illustrating the execution of these jobs using Round robin scheduling algorithm and also Calculate the average waiting time and average turnaround time Plz..plz..solve the problem
Then execute the jobs in sequential order based on time quantum. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
RR always preemptive scheduling algorithm only. once time quantum completed then that process execution will be preempted and cpu starts executing next process.