CS604 Quiz 1 by Arsal Shani and Aina Malik

1. A state is _________ if the system can allocate resources for each process in some order and still avoid a deadlock. None Unsafe

• Safe pg#134

2. ___________ algorithm is used in Deadlock avoidance. Bakery

• Banker’s Google

Safe sequence

3. Typically monitor, a high level synchronization tool is characterized by ___________ and ________. Single, wait Global variable, local variable

• Local data, programmer defined operator pg#122

Local variables, semaphores

CS604 Operating System · QUIZ No 01 SPRING 2021 · MCS FAMILY GROUP TEAM · BY: ARSAL SHANI & AINA MALIK & Family Team

4. The integer value of ___________ semaphores can not be greater than 1.

• Binary pg#114

Counting Mutex

5. Banker’s algorithm is used for ______________. Deadlock removal

• Deadlock avoidance Google

Deadlock detection

6. Possible side effects of ___________ deadlocks are low device utilization and reduced system throughput. Ignoring

• Preventing Google

Recovering Avoiding

7. Preventing the condition of __________ to happen, deadlocks can be prevented to happen.

Monitors Critical region

• Circular wait pg#134

8. The process of holding at least one resource and waiting to acquire additional resources that are currently being held by other processes is known as __________.

• Hold and wait pg#128

Circular wait

9. The ________________________ requires that once a writer is ready, that writer performs its write as soon as possible. In other words, if a writer is waiting to access the object, no new readers may start reading. third readers-writers problem fourth readers-writers problem first readers-writers problem

• second readers-writers problem pg#116

10. Binary semaphore whose integer value cannot be can be _________ simpler to implement. <=1 >=1 <1

• >1 pg#114

11. The condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set, is termed as ____________.