ISRO Scientist or Engineer Computer Science 2009
For the following questions answer them individually
Consider three CPU-intensive processes, which require 10,20 and 30 time units and arrive at times 0,2, and 6, respectively. How many context switches are neededif the operating system implements a shortest remaining timefirst scheduling algorithm? Do not count the context switchesat time zero and at the end
Consider a system having “n” resources of same type. These resources are shared by 3 processes A, B, C. These have peak demands of 3, 4 and 6 respectively. For what value of “n” deadlock won’t occur
Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below.
(Smaller the number, higher the priority.)
if the CPU scheduling policy is priority scheduling without pre-emption, the average waiting time will be
The range of integers that can be represented by an n-bit 2’s compiement number system is
The switching expression corresponding to $$f(A, B, C, D) = \sum (1, 4, 5, 9, 11, 12)$$ is
Consider the following boolean function of four variables $$f(w, x, y, z) = \sum (1, 3, 4, 6, 9, 11, 12, 14)$$, The function is
