

MCQOPTIONS
Saved Bookmarks
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. |
To avoid deadlock ____________ |
A. | there must be a fixed number of resources to allocate |
B. | resource allocation must be done only once |
C. | all deadlocked processes must be aborted |
D. | inversion technique can be used |
Answer» B. resource allocation must be done only once | |
2. |
A problem encountered in multitasking when a process is perpetually denied necessary resources is called ____________ |
A. | deadlock |
B. | starvation |
C. | inversion |
D. | aging |
Answer» C. inversion | |
3. |
What is the drawback of banker’s algorithm? |
A. | in advance processes rarely know how much resource they will need |
B. | the number of processes changes as time progresses |
C. | resource once available can disappear |
D. | all of the mentioned |
Answer» E. | |
4. |
The circular wait condition can be prevented by ____________ |
A. | defining a linear ordering of resource types |
B. | using thread |
C. | using pipes |
D. | all of the mentioned |
Answer» B. using thread | |
5. |
A system is in the safe state if ____________ |
A. | the system can allocate resources to each process in some order and still avoid a deadlock |
B. | there exist a safe sequence |
C. | all of the mentioned |
D. | none of the mentioned |
Answer» B. there exist a safe sequence | |
6. |
TO_AVOID_DEADLOCK?$ |
A. | there must be a fixed number of resources to allocate |
B. | resource allocation must be done only once |
C. | all deadlocked processes must be aborted |
D. | inversion technique can be used |
Answer» B. resource allocation must be done only once | |
7. |
What is the drawback of banker’s algorithm?$ |
A. | in advance processes rarely know that how much resource they will need |
B. | the number of processes changes as time progresses |
C. | resource once available can disappear |
D. | all of the mentioned |
Answer» E. | |