Operating System MCQ with Answers

Operating System MCQ with Answers

1) With a single resource, deadlock occurs

Answer is:

none of these

Explanation:

.

With a single resource, deadlock occurs

2) A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then

Answer is:

all of these

Explanation:

A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then
* deadlocked state is unsafe
* unsafe state may lead to a deadlock situation
* deadlocked state is a subset of unsafe state

3) A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is

Answer is:

2

A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is

4) 'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up

Answer is:

deadlock can never occur

'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up

5) Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is

Answer is:

11

Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is