Peterson's Solution is the only solution modern computer architectures can deal with

the critical section problem

True

False

Question $2(1$ point$)$

A spinlock is a locking mechanism that continuously uses the CPU while waiting for

access to the lock.

True

False

Question $3(1$ point$)$

We use the mutex locks to protect critical sections and thus prevent race conditions.

A process must acquire the lock before entering a critical section; it releases the lock

when it exits the critical section

True

False

Question $4(1$ point$)$

Deadlock and starvation are two terms that mean the exact same thing

True

False

Question $5(1$ point$)$

A critical section is a section of code responsible for changing data that must only be

executed by one thread or process at a time to avoid a race condition

True

False