Session 13

If q is a Queue, this history is linearizable.

• True

• False

If q is a Stack, this history is linearizable.

• True

• False

If q is an Atomic Register, this history is linearizable.

• True

• False

A Java method declared as synchronized is lock-free.

• True

• False

A lock-free method always finishes in a bounded number of steps, independent of other threads.

• True

• False

A wait-free method always finishes in a finite number of steps, independent of other threads.

• True

• False

A lock and a semaphore that allows up to one thread in the critical section are semantically equivalent.

• True

• False

Two sequentially consistent histories are composable.

• True

• False