(10pts) True or False. Please write True or False. Do not write T or F. Peterson

Question

(10pts) True or False. Please write True or False. Do not write T or F.

Peterson’s algorithm ensures that two processes cannot enter CS at the same time.

A process calling semwait(S) will always be blocked.

Wait-die is an instance of preventing deadlock via removing circular wait.

In dining philosopher problem with 5 philosophers, upto 3 philosophers can eat at a time.

In reader/writer problem, only one reader can read at a time.

In producer consumer solution, one producer and one consumer can access the buffer at a time.

The critical section solution we studied in class with test-and-set instruction uses busy waiting.

Using two level paging reduces the overall size of the page table.

Round robin is a non-preemptive scheduling policy.

Round robin favors CPU-bound processes.

Explanation / Answer

1. True

2. False

3. True

4. True

5. False

6. False

7. True

8. True

9. False

10. True

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

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