Course Content

Other Courses

Tribhuvan university BIT BIT Curriculum Operating Systems Old Questions Model Question

Operating Systems - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

6. Consider the following set of processes, with the length of CPU burst time given in milliseconds.

        

        The processed are assumed to have arrived in the order A, B, C and D all at time 0. What is the turnaround time and waiting time for the scheduling algorithms, RR(quantum = 5) and Priority Algorithm 

5 marks
Asked in Model Question

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...