Operating System
Q42.
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 respectively. The completion time of A under round robin scheduling with time slice of one time unit isQ44.
If the time-slice used in the round-robin scheduling policy is more than the maximum time required to execute any process, then the policy willQ45.
Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order P_1,P_2,P_3,P_4. If the time quantum for RR is 4 ms, then the absolute value of the difference between the average turnaround times (in ms) of SJF and RR (round off to 2 decimal places is_______Q48.
Consider the following snapshot of a system running n concurrent processes. Process i is holding X_i instances of a resource R, 1\leq i\leq n. Assume that all instances of R are currently in use. Further, for all i, process i can place a request for at most Y_i additional instances of R while holding the X_i instances it already has. Of the n processes, there are exactly two processes p and q such that Y_p=Y_q=0. Which one of the following conditions guarantees that no other process apart from p and q can complete execution?Q49.
Consider a system having m resources of the same type. These resources are shared by 3 processes A,B,C, which have peak time demands of 3,4,6 respectively. The minimum value of m that ensures that deadlock will never occur is: