Deadlocks in Operating Systems Quiz

Which initialization of the semaphores would print the sequence BCABCABCA.......?

• S1 = 1, S2 = 0, S3 = 0

• S1 = 1, S2 = 1, S3 = 1

• S1 = 0, S2 = 0, S3 = 1

• S1 = 0, S2 = 1, S3 = 0

Which of the following statements is/are TRUE with respect to deadlocks?

• Deadlocks can occur in a system with multiple processes.

• Deadlocks can always be avoided.

• Deadlocks cannot occur in single-threaded applications.

• Deadlocks can be resolved by resource preemption.

What is the largest value of K that will always avoid deadlock in a system with 3 processes sharing 4 instances of the same resource type?

• 1

• 3

• 2

• 4

In a system with 6 identical resources and N processes competing for them, which value of N could lead to a deadlock?

• 3

• 6

• 5

• 4

What is the maximum value of n for a system with 6 tape drives to be deadlock free if each process may need 2 drives?

• 5

• 4

• 3

• 2

Which of the following outcomes is/are possible when threads T1 and T2 execute concurrently?

• x = 2, x = 1

• x = 1, x = 2

• x = 1, x = 1

• x = 2, x = 2

If five threads execute the function parop concurrently, which of the following program behaviors is/are possible?

• Counter increments to 4

• Counter increments to 5

• Counter increments to 2

• Counter increments to 3

Which condition guarantees that no other process apart from p and q can complete execution?

• Y_p = Y_q = 0

• Y_q > 0

• Y_p + Y_q < n

• Y_p > 0

Which of the following policies can be used for preventing deadlock?

• Processes should acquire all resources at the beginning.

• Resources can be released at any time.

• Resources can be requested in any order.

• Processes can hold resources indefinitely.

Which one of the following is TRUE regarding the Producer-Consumer problem using semaphores?

• The buffer can overflow.

• The consumer can consume without waiting.

• The producer must wait if the buffer is full.

• The producer can produce without waiting.