MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The content of the matrix Need is ____________ |
| A. | Allocation Available |
| B. | Max Available |
| C. | Max Allocation |
| D. | Allocation Max |
| Answer» D. Allocation Max | |
| 2. |
The data structures available in the Banker s algorithm are ____________ |
| A. | Available |
| B. | Need |
| C. | Allocation |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
The Banker s algorithm is _____________ than the resource allocation graph algorithm. |
| A. | less efficient |
| B. | more efficient |
| C. | equal |
| D. | none of the mentioned |
| Answer» B. more efficient | |
| 4. |
The resource allocation graph is not applicable to a resource allocation system ____________ |
| A. | with multiple instances of each resource type |
| B. | with a single instance of each resource type |
| C. | single & multiple instances of each resource type |
| D. | none of the mentioned |
| Answer» B. with a single instance of each resource type | |
| 5. |
All unsafe states are ____________ |
| A. | deadlocks |
| B. | not deadlocks |
| C. | fatal |
| D. | none of the mentioned |
| Answer» C. fatal | |
| 6. |
A system is in a safe state only if there exists a ____________ |
| A. | safe allocation |
| B. | safe resource |
| C. | safe sequence |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 7. |
A state is safe, if ____________ |
| A. | the system does not crash due to deadlock occurrence |
| B. | the system can allocate resources to each process in some order and still avoid a deadlock |
| C. | the state keeps the system protected and safe |
| D. | all of the mentioned |
| Answer» C. the state keeps the system protected and safe | |