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
查看答案
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
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