MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 6 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. |
A deadlock free solution to the dining philosophers problem ____________ |
| A. | necessarily eliminates the possibility of starvation |
| B. | does not necessarily eliminate the possibility of starvation |
| C. | eliminates any possibility of any kind of problem further |
| D. | none of the mentioned |
| Answer» C. eliminates any possibility of any kind of problem further | |
| 2. |
The dining philosophers problem will occur in case of ____________ |
| A. | 5 philosophers and 5 chopsticks |
| B. | 4 philosophers and 5 chopsticks |
| C. | 3 philosophers and 5 chopsticks |
| D. | 6 philosophers and 5 chopsticks |
| Answer» B. 4 philosophers and 5 chopsticks | |
| 3. |
To ensure difficulties do not arise in the readers writers problem _______ are given exclusive access to the shared object. |
| A. | readers |
| B. | writers |
| C. | readers and writers |
| D. | none of the mentioned |
| Answer» C. readers and writers | |
| 4. |
In the bounded buffer problem ____________ |
| A. | there is only one buffer |
| B. | there are n buffers ( n being greater than one but finite) |
| C. | there are infinite buffers |
| D. | the buffer size is bounded |
| Answer» C. there are infinite buffers | |
| 5. |
In the bounded buffer problem, there are the empty and full semaphores that ____________ |
| A. | count the number of empty and full buffers |
| B. | count the number of empty and full memory spaces |
| C. | count the number of empty and full queues |
| D. | none of the mentioned |
| Answer» B. count the number of empty and full memory spaces | |
| 6. |
The bounded buffer problem is also known as ____________ |
| A. | Readers Writers problem |
| B. | Dining Philosophers problem |
| C. | Producer Consumer problem |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |