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
查看答案
All processes share a semaphore variablemutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward.Suppose a process executes in the following manner.In this situation :
A. a deadlock will occur
B. processes will starve to enter critical section
C. several processes maybe executing in their critical section
D. all of the mentioned
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned.Which of the following statements describes properties achieved?
A. Mutual exclusion but not progress
B. Progress but not mutual exclusion
C. Neither mutual exclusion nor progress
D. Both mutual exclusion and progress
A monitor is a type of ____________
A. semaphore
B. low level synchronization construct
C. high level synchronization construct
D. none of the mentioned
The monitor construct ensures that ____________
A. only one process can be active at a time within the monitor
B. n number of processes can be active at a time within the monitor (n being greater than 1)
C. the queue has only one process in it at a time
D. all of the mentioned