When the scheduler overlooks a process that is runnable, this situation is calle

ID: 3861170 • Letter: W

Question

When the scheduler overlooks a process that is runnable, this situation is called

(A) Deadlock

(B) Livelock

(D) Starvation

(E) None of the above

---

Which of the following statement regarding concurrency is correct?

(A) a single processor multiprogramming system, processes are interleaved in time to yield the appearance of simultaneous execution.

(B) The solution to the concurrency problem is to control access to the shared resources.

(C) In a uniprocessor system, the reason to cause the concurrency problem is that an interrupt can stop instruction execution anywhere in a process.

(D) In a multiprocessor system, one or more processors may be executing the same global variables at the same time.

(E) All of the above

---

Which of the following condition will cause the final result depending on the order of execution of instructions?

(A) Deadlock

(B) Livelock

(D) Race

Which of the following is a hardware approach to mutual exclusion?

(A) Interrupt disabling

(B) Compare and Swap instruction

(D) Exchange instruction

Which of the following statement regarding semaphore is true?

(A) A binary semaphore may be initialized to any nonnegative integer value.

(B) Mutex must be unlocked by the same process that locks it.

(D) A semaphore that does not specify the order in which processes are removed from the waiting queue is a weak semaphore.

(E) All of theabove

Ans 1 - D) Starvation

Ans 2 - E) All of the above

Ans 3 - C) Mutual Exclusion

Ans 4 - B) Compare and swap instruction

Ans 5 - E) All of the above

Regards,

Vinay Singh

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.