Mutex locks in Operating Systems - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a mutex lock?

A mutex lock is a tool used in programming to make sure that only one thread or process can access a shared resource at a time. It helps prevent conflicts and errors.

beginner

Why do we use mutex locks in operating systems?

We use mutex locks to avoid problems when multiple threads try to use the same resource at the same time. This keeps data safe and programs running smoothly.

intermediate

What happens if a thread tries to lock a mutex that is already locked?

The thread will wait (or block) until the mutex becomes available. This means it pauses its work to avoid conflicts.

intermediate

Explain the difference between a mutex and a semaphore.

A mutex allows only one thread to access a resource at a time, while a semaphore can allow multiple threads up to a set limit. Mutexes are for exclusive access; semaphores can control access to multiple resources.

advanced

What is a deadlock in the context of mutex locks?

A deadlock happens when two or more threads wait forever because each is holding a mutex the other needs. This stops the program from making progress.

What does a mutex lock ensure?

A Only one thread accesses a resource at a time

B Multiple threads access a resource simultaneously

C Threads run faster

D Resources are duplicated

A mutex lock ensures exclusive access to a resource by one thread at a time.

What happens if a thread tries to lock a mutex that is already locked?

A It skips the lock

B It waits until the mutex is free

C It crashes the program

D It locks it anyway

The thread waits (blocks) until the mutex becomes available to avoid conflicts.

Which problem can occur if mutex locks are not managed properly?

A Deadlock

B Faster execution

C Memory increase

D Automatic unlocking

Deadlock happens when threads wait forever for each other's locked mutexes.

How is a mutex different from a semaphore?

A Mutex allows multiple threads; semaphore allows one

B Mutex is faster than semaphore

C Mutex is used only in hardware

D Mutex allows one thread; semaphore can allow multiple

Mutex allows exclusive access to one thread; semaphore can allow multiple threads up to a limit.

Why are mutex locks important in operating systems?

A To increase memory size

B To speed up the CPU

C To prevent data conflicts between threads

D To allow unlimited access to resources

Mutex locks prevent multiple threads from changing shared data at the same time, avoiding conflicts.

Describe what a mutex lock is and why it is used in operating systems.

Think about how multiple people sharing one key to a room would need to take turns.

Explain what deadlock means in the context of mutex locks and how it affects programs.

Imagine two people each holding a key the other needs and neither can proceed.

Practice

1. What is the main purpose of a mutex lock in operating systems?

easy

A. To store data permanently on the disk

B. To speed up the execution of multiple processes simultaneously

C. To allow only one process to access a shared resource at a time

D. To create multiple copies of a resource for each process

Solution

1. Step 1: Understand the role of mutex locks

   Mutex locks are used to control access to shared resources so that only one process can use the resource at a time.

2. Step 2: Identify the correct purpose

   The main goal is to prevent conflicts and errors by ensuring exclusive access, which matches To allow only one process to access a shared resource at a time.

3. Final Answer:

   To allow only one process to access a shared resource at a time -> Option C

4. Quick Check:

   Mutex = exclusive access [OK]

Hint: Mutex means one user at a time [OK]

Common Mistakes:

• Thinking mutex speeds up all processes
• Confusing mutex with data storage
• Believing mutex duplicates resources

2. Which of the following is the correct sequence when using a mutex lock?

easy

A. Acquire the lock, use the resource, then release the lock

B. Release the lock, use the resource, then acquire the lock

C. Use the resource, acquire the lock, then release the lock

D. Use the resource, release the lock, then acquire the lock

Solution

1. Step 1: Recall the correct mutex usage order

   To safely use a shared resource, a process must first acquire the mutex lock before accessing it.

2. Step 2: Complete the sequence

   After using the resource, the process must release the lock so others can access it. This matches Acquire the lock, use the resource, then release the lock.

3. Final Answer:

   Acquire the lock, use the resource, then release the lock -> Option A

4. Quick Check:

   Acquire -> Use -> Release [OK]

Hint: Always lock before use, unlock after [OK]

Common Mistakes:

• Releasing before acquiring
• Using resource without locking
• Locking after using resource

3. Consider this pseudocode using a mutex lock:

mutex.lock()
shared_counter = shared_counter + 1
mutex.unlock()

If two threads run this code simultaneously starting with shared_counter = 5, what is the final value of shared_counter?

medium

A. 6

B. 5

C. Error

D. 7

Solution

1. Step 1: Understand mutex effect on shared_counter

   The mutex lock ensures only one thread increments the counter at a time, preventing race conditions.

2. Step 2: Calculate final value after two increments

   Starting at 5, each thread adds 1 safely, so final value is 5 + 2 = 7.

3. Final Answer:

   7 -> Option D

4. Quick Check:

   Mutex prevents race, count increments twice [OK]

Hint: Mutex ensures both increments count [OK]

Common Mistakes:

• Assuming only one increment happens
• Ignoring mutex effect causing race
• Expecting an error without reason

4. A programmer wrote this code snippet:

mutex.unlock()
use_shared_resource()
mutex.lock()

What is the main problem with this code?

medium

A. The mutex is unlocked before it is locked

B. The code will cause a deadlock

C. The mutex is locked twice without unlocking

D. There is no problem; the code is correct

Solution

1. Step 1: Analyze the order of mutex operations

   The code calls mutex.unlock() before any mutex.lock(), which is incorrect because you cannot release a lock you don't hold.

2. Step 2: Identify the error

   This misuse can cause runtime errors or undefined behavior, matching The mutex is unlocked before it is locked.

3. Final Answer:

   The mutex is unlocked before it is locked -> Option A

4. Quick Check:

   Unlock before lock is wrong [OK]

Hint: Lock first, unlock later; never reverse [OK]

Common Mistakes:

• Unlocking before locking
• Ignoring lock before resource use
• Assuming double lock is okay

5. In a system with multiple threads, which scenario best shows why mutex locks are essential?

hard

A. Two threads perform calculations independently without sharing data

B. Two threads write to the same file simultaneously without locking, causing data corruption

C. A single thread writes to a file without any other threads running

D. Two threads read different files at the same time without any locks

Solution

1. Step 1: Identify when mutex locks are needed

   Mutex locks are essential when multiple threads access and modify the same shared resource to avoid conflicts.

2. Step 2: Match scenario with mutex necessity

   Two threads write to the same file simultaneously without locking, causing data corruption describes simultaneous writes causing corruption, which mutex locks prevent by serializing access.

3. Final Answer:

   Two threads write to the same file simultaneously without locking, causing data corruption -> Option B

4. Quick Check:

   Shared write needs mutex [OK]

Hint: Mutex needed when sharing writable resource [OK]

Common Mistakes:

• Thinking mutex needed for independent reads
• Assuming single thread needs mutex
• Confusing calculation with shared resource access