CS604 Final Term Quiz 3 File 2 July 2023 by Miss Mehwish

We also provide Past papers for Mids. and Finals

Cross Check your answers before submitting directly from the file. We are not responsible for 100% correction as human error exists

Q1. In order to remove the problem like busy waiting, some high-level synchronization constructs are defined. What are they?

1. Critical regions
2. Monitors

Correct options: a) Critical regions, b) Monitors

Q2. Deadlock _______ provides a set of methods for ensuring that at least one of the necessary conditions cannot hold.

1. Avoidance
2. Prevention
3. Handling

Correct option: b) Prevention

Q3. _______ is an integer variable accessible through wait and signal which are atomic operations. Options:

1. Semaphore
2. Signal
3. Busy waiting
4. Mutex

Correct option: a) Semaphore

Q4. Binary semaphore whose integer value cannot be can be ____________ simpler to implement. Options:

1. <= 1
2. < 1
3. >= 1
4. > 1

Correct option: A) <= 1 &lt;= 1

Q5. Semaphores are used to synchronize ________ processes.

1. Tough
2. Running
3. Parallel
4. Concurrent

Correct option: d) Concurrent

Q6. In Resource Allocation Graph, a _________ Pi ---> Rj indicates that process Pi may request resource Rj at some time in the future.

1. Assignment edge
2. Claim edge
3. Allocation edge

Correct option: b) Claim edge

Q7. The problem of Deadlocks can be solved by __________ method(s).

1. Allowing deadlock to occur, then detect and recover
2. Deadlock prevention
3. Deadlock avoidance
4. All of the given

Correct option: d) All of the given

Q8. Deadlock detection and recovery technique is exactly similar to deadlock avoidance technique to handle deadlock in the system.

1. True
2. False

Correct option: b) False

Q9. Banker's algorithm is used for ________________.

1. Deadlock avoidance
2. Deadlock prevention
3. Deadlock removal

Correct option: a) Deadlock avoidance

10. Deadlock can be dealt with ____________ ways.