Section

The rate monotonic $($RM$)$ algorithm schedules processes according to a time interval known as a $$

a$.$ base unit

b$.$ priority

c$.$ quantum

d$.$ period

Answer: $$

The earliest deadline first $($EDF$)$ algorithm schedules processes according to the shortest remaining time until the process

a$.$ deadline

b$.$ start

c$.$ arrival time

d$.$ departure time

Answer: $$

The fraction of CPU time used by a process is expressed as $$

a$.$ the total CPU time over the deadline value

b$.$ the period value over the total CPU time

c$.$ the deadline value over the total CPU time

d$.$ the total CPU time over the period value

Answer: $$

When CPU utilization is $50\%,q,$ scheduling is likely to produce a feasible schedule.

a$.$ only RM

b$.$ only EDF

c$.$ both RM and EDF

d$.$ neither RM nor EDF

Answer: $$