CS604 Final Term Quiz 3 13 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. 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:

1. Hold and wait
2. Circular wait
3. No preemption

Correct option: a) Hold and wait

Q2. The problem of Deadlocks can be solved by __________ method(s). Options:

1. Deadlock avoidance
2. Deadlock prevention
3. All of the given

Correct option: c) All of the given

Q3. Possible side effects of __________ deadlocks are low device utilization and reduced system throughput.

1. Recovering
2. Preventing
3. Ignoring

Correct option: c) Ignoring

Q4. The integer value of _________ semaphores cannot be greater than 1. Options:

1. Counting
2. Binary
3. Bounded buffer

Correct option: b) Binary

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

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

Correct option: d) Request edge

Q6. A dashed line is used to represent a __________ in Resource Allocation Graph. Options:

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

Correct option: b) Claim edge

Q7. Deadlock can be dealt with __________ ways.

1. 6
2. 4
3. 2
4. 3

Correct option: b) 4

Q8. The integer value of __________ semaphores can range over an unrestricted integer domain. Options:

1. Mutex
2. Binary
3. Counting
4. Bounded buffer

Correct option: c) Counting

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

1. Prevention
2. Handling
3. Avoidance
4. Recovery

Correct option: a) Prevention