

MCQOPTIONS
Saved Bookmarks
This section includes 4 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_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 instance of each resource type |
D. | none of the mentioned |
Answer» B. with a single instance of each resource type | |
2. |
The data structures available in the Banker’s algorithm are :$# |
A. | Available |
B. | Need |
C. | Allocation |
D. | All of the mentioned |
Answer» D. All of the mentioned | |
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» E. | |
4. |
If no cycle exists in the resource allocation graph ? |
A. | then the system will not be in a safe state |
B. | then the system will be in a safe state |
C. | all of the mentioned |
D. | none of the mentioned |
Answer» B. then the system will be in a safe state | |