What are the differences between mutexes and semaphores, and how do they relate to deadlocks?

What are the differences between mutexes and semaphores?

Mutexes are used for mutual exclusion, allowing only one thread to access a resource at a time, while semaphores can allow multiple threads to access a resource up to a certain limit.

Can you explain how deadlocks occur in this context?

Deadlocks happen when two or more threads are waiting for each other to release resources, causing them to be stuck indefinitely.

How can we prevent deadlocks when using mutexes and semaphores?

Deadlocks can be prevented by using techniques like resource ordering, timeout mechanisms, or by implementing a deadlock detection algorithm.

Are there any real-world examples of deadlocks?

Yes, a common example is when two processes each hold a resource the other needs, leading to a standstill.