Realtime Operating System
Preemptive, priority based scheduling guarantees ____________

A. Hard real time functionality
B. Soft real time functionality
C. Protection of memory
D. None of the mentioned

Real time systems must have ____________

A. Preemptive kernels
B. Non preemptive kernels
C. Preemptive kernels or non preemptive kernels
D. Neither preemptive nor non preemptive kernels

What is Event latency?

A. The amount of time an event takes to occur from when the system started
B. The amount of time from the event occurrence till the system stops
C. The amount of time from event occurrence till the event crashes
D. The amount of time that elapses from when an event occurs to when it is serviced.

Interrupt latency refers to the period of time ____________

A. From the occurrence of an event to the arrival of an interrupt
B. From the occurrence of an event to the servicing of an interrupt
C. From arrival of an interrupt to the start of the interrupt service routine
D. None of the mentioned

Real time systems need to __________ the interrupt latency.

A. Minimize
B. Maximize
C. Not bother about
D. None of the mentioned

The most effective technique to keep dispatch latency low is to ____________

A. Provide non preemptive kernels
B. Provide preemptive kernels
C. Make it user programmed
D. Run less number of processes at a time

Priority inversion is solved by use of _____________

A. Priority inheritance protocol
B. Two phase lock protocol
C. Time protocol
D. All of the mentioned

In a real time system the computer results ____________

A. Must be produced within a specific deadline period
B. May be produced at any time
C. May be correct
D. All of the mentioned