What principle states that 'eventually, something good happens' in concurrent programming?

'Liveness' principle

Which of the following statements about deadlock is true? A) It can occur with two threads only B) It can involve complex interdependencies C) It guarantees resource availability D) It is always avoidable

B) It can involve complex interdependencies

Riddle: I can be blocked, yet I hold resources and wait, creating a cycle that seals my fate. What am I?

Deadlock

True or False: 'Mutual exclusion' ensures that multiple threads can access shared data simultaneously.

False. 'Mutual exclusion' ensures that only one thread can access the data at a time.

In a Resource Allocation Graph (RAG), how is a process represented?

As a process vertex, typically depicted as a circle.

Fill in the blanks: The two key principles governing concurrent processes are _____ and _____.

'safety' and 'liveness'

What is the main purpose of the Banker’s algorithm in operating systems?

To avoid deadlock by testing for safe states before resource allocation.

Which of the following is NOT a method for handling deadlock? A) Prevention B) Detection C) Ignoring D) Elimination

D) Elimination

Fill in the blanks: In the case of multiple instances of resources, a cycle in a Resource Allocation Graph is a _____ condition for deadlock, but not a _____ condition.

Necessary; sufficient

True or False: Co-routines are fully concurrent and do not require explicit control transfers.

False. Co-routines are only pseudo-concurrent and require explicit transfers of control.