round robin

Consider four processes P, Q, R and S scheduled on a CPU as per round robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time t =...

Which of the following statement(s) is/are correct in the context of CPU scheduling?

Three processes $$A, B$$ and $$C$$ each execute a loop of $$100$$ iterations. In each iteration of the loop, a process performs a single computation that requires $${t_c}\,\,CPU$$...

Consider the $$3$$ processes, $$P1,$$ $$P2$$ and $$P3$$ shown in the table. Process Arrival Time Time Units Required P1 0 5 P2 1 7 P3 3 4 The completion order of the $$3$$ processe...

Which of the following statements are true? $${\rm I}.$$ Shortest remaining time first scheduling may cause starvation $${\rm II}.$$ Preemptive scheduling may cause starvation $${\...

A uni-processor computer system only has two processes, both of which alternate $$10$$ $$ms$$ $$CPU$$ bursts with $$90$$ $$ms$$ $${\rm I}/O$$ bursts. Both the processes were create...

Consider $$n$$ processes sharing the $$CPU$$ in a round-robin fashion. Assuming that each process switch takes $$s$$ seconds, what must be the quantum size $$q$$ such that the over...

Four jobs to be executed on a single processor system arrive at time $${0^ + }$$ in the order $$A, B, C, D.$$ their burst $$CPU$$ time requirements are $$4, 1, 8, 1$$ time units re...

Which scheduling policy is most suitable for a time-shared operating systems?

Assume that the following jobs are to be executed on a single processor system. Job Id CPU Burst Time p 4 q 1 r 8 s 1 t 2 The jobs are assumed to have arrived at time $${0^ + }$$ a...