'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

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

Operating System MCQ with Answers

For more MCQ's Click Here

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

6) The methods for dealing with the deadlock problem is

Answer is:

all of these

Explanation:

The methods for dealing with the deadlock problem is
* Use a protocol to make sure that the system never enters in to the deadlock state.
* Allow the system to enter a deadlock state and then recover.
* Ignore the problem, and pretend that deadlocks never occur in the system. The UNIX operating system uses this solution.

7) A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then

Answer is:

deadlock can never occur

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then

8) The file structure that redefines its first record at a base of zero uses the term

Answer is:

relative organization

Operating System MCQ with Answers

For more MCQ's Click Here

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

deadlock can never occur

Operating System MCQ with Answers

Related Operating System MCQ with Answers

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

11

6) The methods for dealing with the deadlock problem is

all of these

7) A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then

deadlock can never occur

8) The file structure that redefines its first record at a base of zero uses the term

relative organization

Operating System MCQ with Answers