Resource Allocation – Real-time Systems MCQs

20 min
Score: 0
Attempted: 0/20
Subscribe

1. What is the main goal of resource allocation in real-time systems?
(A) To ignore timing constraints
(B) To store data for offline analysis
(C) To perform batch-only processing
(D) To assign system resources like CPU, memory, and I/O to tasks efficiently and predictably

2. A common challenge in resource allocation is:
(A) Avoiding deadlocks when multiple tasks request the same resources
(B) CPU idle exclusively
(C) Disk batch-only operations
(D) Memory-only storage

3. Priority inversion occurs when:
(A) A higher-priority task is blocked by a lower-priority task holding a required resource
(B) CPU idle exclusively
(C) Disk batch-only tasks
(D) Memory-only operations

4. Priority inheritance protocol helps in resource allocation by:
(A) Memory-only techniques
(B) CPU idle exclusively
(C) Disk batch-only methods
(D) Temporarily raising the priority of a task holding a critical resource

5. Priority ceiling protocol prevents:
(A) Memory-only conflicts
(B) CPU idle exclusively
(C) Disk batch-only errors
(D) Deadlocks and unbounded priority inversion

6. Mutual exclusion in resource allocation ensures:
(A) Memory-only access
(B) CPU idle exclusively
(C) Disk batch-only access
(D) Only one task accesses a shared resource at a time

7. A shared resource in real-time systems can include:
(A) Disk batch-only storage
(B) CPU idle exclusively
(C) CPU, memory, I/O devices, or communication channels
(D) Memory-only arrays

8. Deadlock occurs when:
(A) Disk batch-only tasks
(B) CPU idle exclusively
(C) Two or more tasks wait indefinitely for resources held by each other
(D) Memory-only operations

9. Resource allocation strategies include:
(A) Disk batch-only strategies
(B) CPU idle exclusively
(C) Static allocation, dynamic allocation, and priority-based allocation
(D) Memory-only techniques

10. Static resource allocation:
(A) CPU idle exclusively
(B) Assigns resources to tasks before execution starts
(C) Disk batch-only allocation
(D) Memory-only allocation

11. Dynamic resource allocation:
(A) Assigns resources to tasks during runtime based on availability and priority
(B) CPU idle exclusively
(C) Disk batch-only allocation
(D) Memory-only allocation

12. Resource sharing protocols are used to:
(A) Memory-only management
(B) CPU idle exclusively
(C) Disk batch-only operations
(D) Avoid priority inversion and ensure timely task execution

13. Banker’s algorithm in real-time systems is used to:
(A) Disk batch-only safety checks
(B) CPU idle exclusively
(C) Prevent deadlocks by checking resource allocation safety
(D) Memory-only allocation

14. Resource allocation affects real-time system performance by:
(A) Influencing task schedulability, response time, and throughput
(B) CPU idle exclusively
(C) Disk batch-only performance
(D) Memory-only efficiency

15. In multiprocessor real-time systems, resource allocation must also consider:
(A) CPU idle exclusively
(B) Shared resources and inter-processor communication
(C) Disk batch-only transfers
(D) Memory-only tasks

16. Resource contention occurs when:
(A) Disk batch-only conflicts
(B) CPU idle exclusively
(C) Multiple tasks attempt to access the same resource simultaneously
(D) Memory-only contention

17. Semaphore-based mechanisms in resource allocation help to:
(A) Control access to shared resources and prevent race conditions
(B) CPU idle exclusively
(C) Disk batch-only locking
(D) Memory-only signaling

18. Real-time systems often use priority-based resource allocation to:
(A) Disk batch-only allocation
(B) CPU idle exclusively
(C) Ensure high-priority tasks meet their deadlines
(D) Memory-only prioritization

19. Resource allocation in hard real-time systems must guarantee:
(A) Timely access to critical resources under all circumstances
(B) CPU idle exclusively
(C) Disk batch-only access
(D) Memory-only access

20. The main advantage of efficient resource allocation in real-time systems is:
(A) Disk batch-only efficiency
(B) CPU idle exclusively
(C) Avoidance of deadlocks, reduced priority inversion, and timely task execution
(D) Memory-only optimization