1. If we want to schedule the processes, they are considered as?
(E) None of these
(A) infinitely long
(B) lightweight
(C) heavyweight
(D) periodic
2. Suppose the period of a process is ‘p’, then the rate of the task is?
(E) None of these
(A) p²
(B) 2*p
(C) p
(D) 1/p
3. Suppose that we have a process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is:
(E) None of these
(A) 0.90
(B) 0.74
(C) 0.80
(D) 0.94
4. T shares of time are allocated among all processes out of N shares in which of the following scheduling algorithm?
(E) None of these
(A) rate monotonic
(B) the earliest deadline first
(C) proportional share
(D) None of these
5. Which of the following scheduling algorithm schedules periodic tasks using a static priority policy by considering the priorities?
(E) None of these
(A) the earliest deadline first
(B) rate monotonic
(C) first cum first served
(D) priority
6. The scheduler permits a process using which of the following?
(E) None of these
(A) two-phase locking protocol
(B) busy-wait polling
(C) admission control algorithm
(D) None of these
7. In the case of rate monotonic scheduling, a process with a shorter period is assigned which of the following priority?
(E) None of these
(A) higher & lower
(B) a lower
(C) a higher
(D) None of these
8. There are two processes, P1 and P2, whose periods are 50 and 100 respectively. P1 is allotted higher priority than P2. The processing times are t1 = 20 for P1 and t2 = 35 for P2. Is it feasible to schedule these tasks so that they fulfill their deadlines using Rate Monotonic Scheduling?
(E) None of these
(A) None of these
(B) no
(C) maybe
(D) yes
9. Practically, if we want to use the EDF algorithm, it is impossible to achieve 100% utilization. This is possible due to which of the following?
(E) None of these
(A) power consumption
(B) interrupt handling
(C) the cost of context switching
(D) all of the mentioned