If a set of processes cannot be scheduled by rate monotonic scheduling algorithm, then __________

A. They can be scheduled by edf algorithm
B. They cannot be scheduled by edf algorithm
C. They cannot be scheduled by any other algorithm
D. None of the mentioned

There are two processes P1 and P2, whose periods are 50 and 100 respectively. P1 is assigned higher priority than P2. The processing times are t1 = 20 for P1 and t2 = 35 for P2. Is it possible to schedule these tasks so that each meets its deadline using Rate monotonic scheduling?

A. Yes
B. No
C. Maybe
D. None of the mentioned

In rate monotonic scheduling, a process with a shorter period is assigned __________

A. A higher priority
B. A lower priority
C. Higher & lower priority
D. None of the mentioned

Rate monotonic scheduling assumes that the __________

A. Processing time of a periodic process is same for each cpu burst
B. Processing time of a periodic process is different for each cpu burst
C. Periods of all processes is the same
D. None of the mentioned

The ____________ scheduling algorithm schedules periodic tasks using a static priority policy with preemption.

A. Earliest deadline first
B. Rate monotonic
C. First cum first served
D. Priority

The scheduler admits a process using __________

A. Two phase locking protocol
B. Admission control algorithm
C. Busy wait polling
D. None of the mentioned

If the period of a process is ‘p’, then what is the rate of the task?

A. P2
B. 2*p
C. 1/p
D. P

To schedule the processes, they are considered _________

A. Infinitely long
B. Periodic
C. Heavy weight
D. Light weight

What is Response time?

A. The total time taken from the submission time till the completion time
B. The total time taken from the submission time till the first response is produced
C. The total time taken from submission time till the response is output
D. None of the mentioned

What is Waiting time?

A. The total time in the blocked and waiting queues
B. The total time spent in the ready queue
C. The total time spent in the running queue
D. The total time from the completion till the submission of a process