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

The scheduler admits a process using __________

• A. Two phase locking protocol
• B. Admission control algorithm
• C. Busy wait polling
• 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

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

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

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

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

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?

• A. 0.9
• B. 0.74
• C. 0.94
• D. 0.8

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. Can the processes be scheduled without missing the deadlines?

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

Frame Relay is cheaper than other _____

• A. Lans
• B. Wans
• C. Mans
• D. Multipoint networks