Question

1. When the scheduler overlooks a process that is runnable, this situation is called (A) Deadlock (B) Livelock (C)
Race (D) Starvation (E) This situation cannot happen.
2. Which of the following condition will cause the final result depending on the order of execution of instructions?
(A) Deadlock (B) Livelock (C) Mutual Exclusion (D) Race (E) Starvation
3. Which of the following is not a hardware approach to mutual exclusion? (A) Interrupt disabling (B) Compare
and Swap instruction (C) Spin waiting (D) Exchange instruction (E) Semaphores
4. Which of the following statement regarding semaphore is untrue? (A) A binary semaphore may be initialized
to any nonnegative integer value. (B) Mutex must be unlocked by the same process that locks it. (C) Both
semWait and semSignal are atomic. (D) A semaphore that does not specify the order in which processes are
removed from the waiting queue is a weak semaphore. (E) None of the above.
5. A programming-language construct that provides equivalent functionality to that of semaphores is called (A)
Monitor (B) Broadcast (C) Message (D) Addressing (E) None of the above

Answer 1