$1.$Which of the following is a common synchronization problem that can occur in a multi$-$threaded environment?

Question $1$ options:

A$.$Race condition

B$.$Priority inversion

C$.$Deadlock

D$.$All of the above

$2.$What is a critical section?

Question $2$ options:

A$.$A section of code that is not important

B$.$A section of code that is executed only once

C$.$A section of code that can be executed concurrently

D$.$A section of code that must be executed atomically

$3.$Which of the following is not a common synchronization problem?

Question $3$ options:

A$.$Deadlock

B$.$Starvation

C$.$Race condition

D$.$Heap overflow

$4.$What is the difference between a mutex and a semaphore?

Question $4$ options:

A$.$A mutex allows only one process to access a shared resource at a time, while a semaphore can allow multiple processes to access the resource at the same time.

B$.$A mutex can be used for both mutual exclusion and synchronization, while a semaphore is used only for synchronization.

C$.$A mutex is a binary semaphore, while a semaphore can have any positive integer value.

D$.$There is no difference between a mutex and a semaphore.

$5.$Which synchronization problem occurs when multiple threads are trying to modify a shared resource at the same time?

Question $5$ options:

A$.$Deadlock

B$.$Race condition

C$.$Starvation

D$.$Buffer overflow