PART – A (2 MARKS)
1. Define CPU scheduling.
2. What is preemptive and non preemptive scheduling?
3. What is a Dispatcher?
4. What is dispatch latency?
5. What are the various scheduling criteria for CPU scheduling?
6. Define throughput.
7. What is turnaround time?
8. Define race condition.
9. What is critical section problem?
10. What are the requirements that a solution to the critical section problem must satisfy?
11. Define entry section and exit section.
12. Give two hardware instructions and their definitions which can be used for implementing mutual exclusion.
13. What is a semaphore?
14. Define busy waiting and spin lock.
15. Define deadlock.
16. What is the sequence in which resources may be utilized?
17. What are conditions under which a deadlock situation may arise?
18. What is a resource-allocation graph?
19. Define request edge and assignment edge.
20. What are the methods for handling deadlocks?
21. Define deadlock prevention.
22. Define deadlock avoidance.
23. What are a safe state and an unsafe state?
24. What is banker’s algorithm?
No comments:
Post a Comment