1. What is a sporadic task in real-time systems?
(A) A task that executes at regular intervals
(B) A task that has no execution time
(C) A task that occurs irregularly but with a known minimum inter-arrival time
(D) A task that executes continuously
2. The minimum time between two successive arrivals of a sporadic task is called:
(A) Deadline
(B) Period
(C) Execution time
(D) Minimum inter-arrival time
3. Sporadic tasks differ from aperiodic tasks because:
(A) Aperiodic tasks always have fixed periods
(B) Sporadic tasks have no deadlines
(C) Sporadic tasks occur regularly
(D) Sporadic tasks have a known minimum inter-arrival time
4. Sporadic tasks are often handled using:
(A) Cyclic executive scheduling
(B) RMS only
(C) Sporadic servers
(D) LLF only
5. Sporadic tasks may compete for CPU with:
(A) Batch jobs only
(B) Background tasks only
(C) Periodic tasks
(D) Disk I/O only
6. Which of the following is TRUE about sporadic tasks?
(A) Their arrivals are irregular but bounded
(B) They execute at fixed intervals
(C) They never preempt other tasks
(D) They have no deadlines
7. Sporadic tasks are typically found in:
(A) Cyclic execution systems
(B) Batch processing systems
(C) Non-preemptive background tasks
(D) Event-driven control systems
8. A sporadic server is used to:
(A) Execute periodic tasks
(B) Guarantee CPU time for sporadic tasks
(C) Reduce task execution time
(D) Handle only aperiodic tasks
9. The deadline of a sporadic task is usually:
(A) Equal to the task period
(B) Ignored
(C) Relative to its arrival time
(D) Always infinite
10. Which parameter is critical for scheduling sporadic tasks?
(A) Task ID only
(B) Execution time and minimum inter-arrival time
(C) Memory size
(D) Disk speed
11. Sporadic tasks are similar to aperiodic tasks but:
(A) Are always periodic
(B) Never execute
(C) Have predictable minimum inter-arrival constraints
(D) Execute only once
12. Handling sporadic tasks is important in:
(A) Non-preemptive systems only
(B) Hard real-time systems
(C) Batch systems only
(D) Background systems only
13. Which scheduling algorithm can be adapted to handle sporadic tasks?
(A) RMS without modification
(B) EDF with sporadic servers
(C) Cyclic executive only
(D) Round-robin only
14. A sporadic task may preempt:
(A) Lower priority periodic or aperiodic tasks
(B) CPU idle time only
(C) Background tasks only
(D) Tasks with infinite execution time only
15. A sporadic task that arrives too frequently may cause:
(A) CPU idle time to increase
(B) Deadline misses of other tasks
(C) Execution time reduction
(D) Periodic task acceleration
16. Which statement about sporadic tasks is TRUE?
(A) They have no execution time
(B) They are predictable but irregular
(C) They always execute periodically
(D) Their deadlines are always ignored
17. Sporadic tasks are mainly handled in:
(A) Non-preemptive systems
(B) Batch systems only
(C) Event-driven real-time systems
(D) Round-robin systems
18. Minimum inter-arrival time helps in:
(A) Increasing execution time
(B) Ignoring deadlines
(C) Determining CPU capacity required for sporadic tasks
(D) Reducing task periods
19. A sporadic server allows:
(A) Infinite execution without constraints
(B) Bounded response times for sporadic tasks
(C) Only periodic task scheduling
(D) CPU to remain idle always
20. Sporadic tasks are important because:
(A) They handle irregular but time-critical events in real-time systems
(B) They execute at fixed intervals only
(C) They are non-preemptive
(D) They are only background tasks