Question 1

A monitor is an abstract data type that is based on semaphore implementation.

Accepted Answer

A) True 
 B)False

Question 2

The value of a counting semaphore can range only between 0 and 1.

Accepted Answer

A) True 
 B)False

Question 3

CAS-based synchronization is always faster than traditional synchronization.

Accepted Answer

A) True 
 B)False

Question 4

Assume the binary variable lock is initialized to be 0, which of the following can be an implementation of the entry section to solve the critical-section problem?

Accepted Answer

A)  while (compare and swap(&lock, 0, 1) != 0), do nothing; 
B)  while (test and set(&lock)), do nothing; 
C)  both A and B 
D)  none of the above 
A)  while (compare and swap(&lock, 0, 1) != 0), do nothing; 
B)  while (test and set(&lock)), do nothing; 
C)  both A and B 
D)  none of the above

Question 5

Race conditions can result in corrupted values of shared data.

Accepted Answer

A) True 
 B)False

Question 6

Which of the following are efforts to towards developing scalable, efficient tools that address the demands of concurrent programming?

Accepted Answer

A)  designing compilers that generate more efficient code 
B)  developing languages that provide support for concurrent programming 
C)  improving the performance of existing libraries and APIs 
D)  all of the above 
A)  designing compilers that generate more efficient code 
B)  developing languages that provide support for concurrent programming 
C)  improving the performance of existing libraries and APIs 
D)  all of the above

Question 7

A mutex lock is released immediately after entering a critical section.

Accepted Answer

A) True 
 B)False

Question 8

What three conditions must be satisfied in order to solve the critical section problem?

Accepted Answer

In a solution to the critical section pr

Question 9

Which of the following is true for race condition?

Accepted Answer

A)  race condition occurs where several processes access and manipulate the same data concurrently 
B)  when race condition occurs, the outcome of the execution depends on the particular order in which the access takes place 
C)  both of the above 
D)  none of the above 
A)  race condition occurs where several processes access and manipulate the same data concurrently 
B)  when race condition occurs, the outcome of the execution depends on the particular order in which the access takes place 
C)  both of the above 
D)  none of the above

Question 10

Which of the following may cause a liveness failure?

Accepted Answer

A)  an infinite loop 
B)  a busy waiting loop 
C)  a deadlock 
D)  all of the above 
A)  an infinite loop 
B)  a busy waiting loop 
C)  a deadlock 
D)  all of the above

Question 11

What is the difference between a semaphore and conditional variable?

Accepted Answer

If no process is suspended, then the sig

Question 12

Peterson's solution works on modern computer architectures.

Accepted Answer

A) True 
 B)False

Question 13

What is meant by "short duration"?

Accepted Answer

Given that waiting on a lock requires tw

Question 14

Which of the following actions should be performed among cooperating processes?

Accepted Answer

A)  process synchronization 
B)  coordination 
C)  both of the above 
D)  none of the above 
A)  process synchronization 
B)  coordination 
C)  both of the above 
D)  none of the above

Question 15

When the mutex lock is implemented based on a binary semaphore, it should be initialized to be 0.

Accepted Answer

A) True 
 B)False

Question 16

Every object in Java has associated with it a single lock.

Accepted Answer

A) True 
 B)False

Question 17

Explain how semaphore implementation overcomes the busy waiting problem of mutex lock.

Accepted Answer

When a process executes the wait() opera

Question 18

Which of the following is NOT true?

Accepted Answer

A)  Since semaphore and mutex lock are tools for synchronization, process that have used semaphores or mutex locks should not cause deadlocks 
B)  Semaphores and mutex locks may be shared resources that difference processes contend for, and hence deadlocks may occur 
C)  a set of processes is in a deadlocked state when every process in the set is waiting for an event that can be caused only by another process in the set 
D)  all of the above 
A)  Since semaphore and mutex lock are tools for synchronization, process that have used semaphores or mutex locks should not cause deadlocks 
B)  Semaphores and mutex locks may be shared resources that difference processes contend for, and hence deadlocks may occur 
C)  a set of processes is in a deadlocked state when every process in the set is waiting for an event that can be caused only by another process in the set 
D)  all of the above

Question 19

The preemptive kernel is more suitable for real-time programming than non-preemptive kernel.

Accepted Answer

A) True 
 B)False

Question 20

The counting semaphore is initialized to ___________.

Accepted Answer

A)  0 
B)  1 
C)  the number of resources available 
D)  none of the above 
A)  0 
B)  1 
C)  the number of resources available 
D)  none of the above

A monitor is an abstract data type that is based on semaphore implementation.

The value of a counting semaphore can range only between 0 and 1.

CAS-based synchronization is always faster than traditional synchronization.

Assume the binary variable lock is initialized to be 0, which of the following can be an implementation of the entry section to solve the critical-section problem?

Race conditions can result in corrupted values of shared data.

Which of the following are efforts to towards developing scalable, efficient tools that address the demands of concurrent programming?

A mutex lock is released immediately after entering a critical section.

What three conditions must be satisfied in order to solve the critical section problem?

Which of the following is true for race condition?

Which of the following may cause a liveness failure?

What is the difference between a semaphore and conditional variable?

Peterson's solution works on modern computer architectures.

What is meant by "short duration"?

Which of the following actions should be performed among cooperating processes?

When the mutex lock is implemented based on a binary semaphore, it should be initialized to be 0.

Every object in Java has associated with it a single lock.

Explain how semaphore implementation overcomes the busy waiting problem of mutex lock.

Which of the following is NOT true?

The preemptive kernel is more suitable for real-time programming than non-preemptive kernel.

The counting semaphore is initialized to ___________.

Introduction

Operating-System Structures

Processes

Threads Concurrency

Cpu Scheduling

Synchronization Examples

Deadlocks

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters

Exam 6: Synchronization Tools

A monitor is an abstract data type that is based on semaphore implementation.

The value of a counting semaphore can range only between 0 and 1.

CAS-based synchronization is always faster than traditional synchronization.

Assume the binary variable lock is initialized to be 0, which of the following can be an implementation of the entry section to solve the critical-section problem?

Race conditions can result in corrupted values of shared data.

Which of the following are efforts to towards developing scalable, efficient tools that address the demands of concurrent programming?

A mutex lock is released immediately after entering a critical section.

What three conditions must be satisfied in order to solve the critical section problem?

Which of the following is true for race condition?

Which of the following may cause a liveness failure?

What is the difference between a semaphore and conditional variable?

Peterson's solution works on modern computer architectures.

What is meant by "short duration"?

Which of the following actions should be performed among cooperating processes?

When the mutex lock is implemented based on a binary semaphore, it should be initialized to be 0.

Every object in Java has associated with it a single lock.

Explain how semaphore implementation overcomes the busy waiting problem of mutex lock.

Which of the following is NOT true?

The preemptive kernel is more suitable for real-time programming than non-preemptive kernel.

The counting semaphore is initialized to ___________.

Introduction

Operating-System Structures

Processes

Threads Concurrency

Cpu Scheduling

Synchronization Examples

Deadlocks

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters