Real-Time Systems CPU Scheduling MCQs

By: Prof. Fazal Rehman Shamil

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

 

Computer Science Repeated MCQs Book Download