Solved MCQ of CPU Scheduling of Real-Time Systems.
If we want to schedule the processes, they are considered as?
(A). Â infinitely long
(B). Â periodic
(C). Â heavyweight
(D). Â lightweight
(E). None of these
MCQ Answer:Â B
Suppose the period of a process is ‘p’, then the rate of the task is?
(A). Â p2
(B). Â 2*p
(C). Â 1/p
(D). Â p
(E). None of these
MCQ Answer:Â C
Suppose that we have a process P1 has a period of 50 and we have a CENTRAL PROCESSING UNIT burst of t1 = 25, P2 has a period of 80, and a CENTRAL PROCESSING UNIT burst of 35. The total CENTRAL PROCESSING UNIT utilization is :
(A). Â 0.90
(B). Â 0.74
(C). Â 0.94
(D). Â 0.80
(E). None of these
MCQ Answer:Â C
T shares of time are allocated among all processes out of N shares in which of the following scheduling algorithm?
(A). Â rate monotonic
(B). Â proportional share
(C). the earliest deadline first
(D). Â None of these
(E). None of these
MCQ Answer:Â B
Which of the following scheduling algorithm schedules periodic tasks using a static priority policy by considering the priorities?
(A). the earliest deadline first
(B). Â rate monotonic
(C). Â first cum first served
(D). Â priority
(E). None of these
MCQ Answer:Â B
The scheduler permits a process using which of the following?
(A). Â two-phase locking protocol
(B). Â admission control algorithm
(C). Â busy-wait polling
(D). Â None of these
(E). None of these
MCQ Answer:Â C
In the case of rate monotonic scheduling, a process with a shorter period is assigned which of the following priority?
(A). Â a higher
(B). Â a lower
(C). Â higher & lower
(D). Â None of these
(E). None of these
MCQ Answer:Â A
There are two processes processes1 and processes2, 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 these tasks fulfill their deadline using Rate monotonic scheduling?
(A). Â yes
(B). Â no
(C). Â maybe
(D). Â None of these
(E). None of these
MCQ Answer:Â A
Practically, if we want to use the EDF algorithm, it is impossible to achieve 100% utilization and its possible due to Which of the following?
(A). Â the cost of context switching
(B). Â interrupt handling
(C). Â power consumption
(D). Â all of the mentioned
(E). None of these
MCQ Answer:Â A
Read More MCQs on Real-time Systems