Mutex vs binary semaphore difference in FreeRTOS - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to create a mutex in FreeRTOS.

FreeRTOS

SemaphoreHandle_t xMutex = xSemaphoreCreate[1]();

Drag options to blanks, or click blank then click option'

AMutex

BBinary

CCounting

DRecursiveMutex

Attempts:

3 left

💡 Hint

Common Mistakes

Using xSemaphoreCreateBinary() instead of xSemaphoreCreateMutex()

In FreeRTOS, a mutex is created using xSemaphoreCreateMutex().

2fill in blank

medium

Complete the code to take a binary semaphore in FreeRTOS.

FreeRTOS

if(xSemaphoreTake(xBinarySemaphore, [1])) {
    // Critical section
}

Drag options to blanks, or click blank then click option'

A1000

B0

CportMAX_DELAY

DpdFALSE

Attempts:

3 left

💡 Hint

Common Mistakes

Using 0 which means no wait and may cause failure.

Using portMAX_DELAY makes the task wait indefinitely to take the semaphore.

3fill in blank

hard

Fix the error in the code to release a mutex in FreeRTOS.

FreeRTOS

xSemaphore[1](xMutex);

Drag options to blanks, or click blank then click option'

AGive

BTake

CCreate

DDelete

Attempts:

3 left

💡 Hint

Common Mistakes

Using xSemaphoreTake() instead of xSemaphoreGive()

To release a mutex, use xSemaphoreGive().

4fill in blank

hard

Fill both blanks to create and take a binary semaphore.

FreeRTOS

SemaphoreHandle_t xBinarySemaphore = xSemaphoreCreate[1]();
if(xSemaphore[2](xBinarySemaphore, portMAX_DELAY)) {
    // Access shared resource
}

Drag options to blanks, or click blank then click option'

ABinary

BGive

CTake

DMutex

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'Mutex' to create a binary semaphore

Using 'Give' instead of 'Take' to acquire semaphore

Binary semaphore is created with xSemaphoreCreateBinary() and taken with xSemaphoreTake().

5fill in blank

hard

Fill all three blanks to create a mutex, take it, and then give it back.

FreeRTOS

SemaphoreHandle_t xMutex = xSemaphoreCreate[1]();
if(xSemaphore[2](xMutex, portMAX_DELAY)) {
    // Critical section
    xSemaphore[3](xMutex);
}

Drag options to blanks, or click blank then click option'

AMutex

BTake

CGive

DBinary

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'Binary' instead of 'Mutex' for creation

Mixing up 'Give' and 'Take' functions

Create a mutex with xSemaphoreCreateMutex(), take it with xSemaphoreTake(), and release it with xSemaphoreGive().

Practice

1. Which of the following best describes the main difference between a mutex and a binary semaphore in FreeRTOS?

easy

A. Binary semaphores have ownership; mutexes do not.

B. Mutexes have ownership and priority inheritance; binary semaphores do not.

C. Mutexes are used only for signaling; binary semaphores are for exclusive access.

D. There is no difference; both behave exactly the same.

Solution

1. Step 1: Understand ownership concept

   Mutexes have ownership, meaning the task that locks it must unlock it. Binary semaphores do not have ownership.

2. Step 2: Understand priority inheritance

   Mutexes support priority inheritance to avoid priority inversion; binary semaphores do not.

3. Final Answer:

   Mutexes have ownership and priority inheritance; binary semaphores do not. -> Option B

4. Quick Check:

   Ownership + priority inheritance = Mutex [OK]

Hint: Mutex = ownership + priority; binary semaphore = simple flag [OK]

Common Mistakes:

• Thinking binary semaphores have ownership
• Confusing signaling role of binary semaphores
• Assuming mutexes do not support priority inheritance

2. Which of the following is the correct way to create a mutex in FreeRTOS?

easy

A. xSemaphoreCreateMutex()

B. xQueueCreateMutex()

C. xSemaphoreCreateBinary()

D. xMutexCreateSemaphore()

Solution

1. Step 1: Recall FreeRTOS API for mutex creation

   The function to create a mutex is xSemaphoreCreateMutex().

2. Step 2: Verify other options

   xSemaphoreCreateBinary() creates a binary semaphore, not a mutex. The other options are invalid API calls.

3. Final Answer:

   xSemaphoreCreateMutex() -> Option A

4. Quick Check:

   Mutex creation function = xSemaphoreCreateMutex() [OK]

Hint: Mutex creation always uses xSemaphoreCreateMutex() [OK]

Common Mistakes:

• Using xSemaphoreCreateBinary() for mutex
• Confusing queue creation functions with mutex
• Inventing non-existent API functions

3. Consider the following FreeRTOS code snippet:

SemaphoreHandle_t xMutex = xSemaphoreCreateMutex();
if (xSemaphoreTake(xMutex, 0) == pdTRUE) {
    // Critical section
    xSemaphoreGive(xMutex);
    printf("Mutex taken and released\n");
} else {
    printf("Failed to take mutex\n");
}

What will be the output when this code runs?

medium

A. Mutex taken and released

B. Failed to take mutex

C. Compilation error

D. No output

Solution

1. Step 1: Analyze mutex creation and take

   The mutex is created successfully. The call to xSemaphoreTake with zero block time tries to take the mutex immediately. Since it is free, it succeeds.

2. Step 2: Check critical section and release

   The mutex is given back with xSemaphoreGive, and the message "Mutex taken and released" is printed.

3. Final Answer:

   Mutex taken and released -> Option A

4. Quick Check:

   Mutex free at start, take succeeds, prints message [OK]

Hint: Mutex initially free, immediate take succeeds [OK]

Common Mistakes:

• Assuming take fails with zero block time
• Confusing mutex with binary semaphore behavior
• Expecting compilation errors from correct API usage

4. Identify the error in the following FreeRTOS code using a binary semaphore:

SemaphoreHandle_t xBinarySemaphore = xSemaphoreCreateBinary();
xSemaphoreGive(xBinarySemaphore);
if (xSemaphoreTake(xBinarySemaphore, portMAX_DELAY) == pdTRUE) {
    // Critical section
    xSemaphoreGive(xBinarySemaphore);
    xSemaphoreGive(xBinarySemaphore);
}

medium

A. Semaphore handle is not initialized.

B. Taking the semaphore with portMAX_DELAY is invalid.

C. Binary semaphore must be created with xSemaphoreCreateMutex().

D. Giving the semaphore twice causes incorrect behavior.

Solution

1. Step 1: Understand binary semaphore usage

   Binary semaphores act like flags with max count 1. Giving twice without taking in between can cause logic errors.

2. Step 2: Analyze the code's semaphore give calls

   The code gives the semaphore twice without an intervening take, which can lead to unexpected behavior or overflow.

3. Final Answer:

   Giving the semaphore twice causes incorrect behavior. -> Option D

4. Quick Check:

   Binary semaphore max count = 1, double give is wrong [OK]

Hint: Binary semaphore max count 1, don't give twice without take [OK]

Common Mistakes:

• Thinking portMAX_DELAY is invalid
• Confusing binary semaphore with mutex creation
• Ignoring semaphore initialization

5. You have two tasks: Task A (high priority) and Task B (low priority). Both need exclusive access to a shared resource. Which synchronization method should you use to avoid priority inversion and why? A) Use a mutex because it supports priority inheritance. B) Use a binary semaphore because it is simpler. C) Use a counting semaphore to allow multiple accesses. D) Use no synchronization to improve performance.

hard

A. Use a counting semaphore to allow multiple accesses.

B. Use a binary semaphore because it is simpler.

C. Use a mutex because it supports priority inheritance.

D. Use no synchronization to improve performance.

Solution

1. Step 1: Identify need for exclusive access with priority handling

   Both tasks need exclusive access, so synchronization is required. Priority inversion can occur if a low priority task holds the resource.

2. Step 2: Choose synchronization with priority inheritance

   Mutexes provide priority inheritance, temporarily boosting the low priority task's priority to avoid blocking the high priority task.

3. Final Answer:

   Use a mutex because it supports priority inheritance. -> Option C

4. Quick Check:

   Priority inversion avoidance = mutex [OK]

Hint: Use mutex for priority inheritance and exclusive access [OK]

Common Mistakes:

• Choosing binary semaphore ignoring priority inversion
• Using counting semaphore for exclusive access
• Skipping synchronization to save time