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.
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
查看答案
Semaphores are mostly used to implement ____________
A. System calls
B. IPC mechanisms
C. System protection
D. None of the mentioned
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
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
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