Session 10

Why are locks not enough in some situations?

• They can't always guarantee mutual exclusion.

• They don't allow threads to communicate about changes in the state.

• We can only use one lock at a time.

• They are too boring.

A semaphore and a barrier are functionally the same.

• True

• False

How do we prevent processes from "overtaking" other processes in a reusable barrier? (without breaking it)

• By taking "if (count==n)" out of the mutex

• This is not possible with just semaphores

• By using a two-phase barrier

• By using fewer than n processes

A Java ReentrantLock has a monitor associated with it.

• True

• False

Which of these is not a thread state in Java?

• TERMINATED

• TIMED_WAIT

• BLOCKED

• LOCKED

When a thread is in the WAITING state and receives a notify, it goes into which state?

• RUNNABLE

• BLOCKED

• RUNNING

• READY

Only one thread at a time can own an object's monitor (in Java).

• True

• False