Question 1

Lockstep synchronization does not ________.

Accepted Answer

A)  occur when threads must enter and leave their critical sections in strict alternation 
B)  improve the efficiency of a process by forcing threads to operate at the same speed 
C)  force faster threads to operate at the same speed as slower threads 
D)  occur as a result of using a single variable to govern access to threads' critical sections 
A)  occur when threads must enter and leave their critical sections in strict alternation 
B)  improve the efficiency of a process by forcing threads to operate at the same speed 
C)  force faster threads to operate at the same speed as slower threads 
D)  occur as a result of using a single variable to govern access to threads' critical sections

Question 2

Preventing more than one thread from accessing a shared variable simultaneously is known as ________ access to the shared variable.

Accepted Answer

A)  excluding 
B)  synchronizing 
C)  serializing 
D)  protecting 
A)  excluding 
B)  synchronizing 
C)  serializing 
D)  protecting

Question 3

Many system architectures support a(n) ________ instruction that enables a thread to exchange the values of two variables atomically.

Accepted Answer

A)  swap 
B)  test-and-set 
C)  semaphore 
D)  switch 
A)  swap 
B)  test-and-set 
C)  semaphore 
D)  switch

Question 4

Which of the following statements about Lamport's Bakery Algorithm is false?

Accepted Answer

A)  Lamport's algorithm allows multiple threads to obtain the same ticket number. 
B)  The thread possessing the ticket with the highest numerical value can enter its critical section. 
C)  Lamport's algorithm enforces mutual exclusion. 
D)  A thread's ticket number is reset when the thread exits its critical section. 
A)  Lamport's algorithm allows multiple threads to obtain the same ticket number. 
B)  The thread possessing the ticket with the highest numerical value can enter its critical section. 
C)  Lamport's algorithm enforces mutual exclusion. 
D)  A thread's ticket number is reset when the thread exits its critical section.

Question 5

Which of the following statements about semaphores is false?

Accepted Answer

A)  A thread performs the P operation after it enters its critical section. 
B)  A thread performs the V operation before exiting its critical section. 
C)  Initializing a semaphore sets the value of a protected variable to indicate that no thread is executing its critical section. 
D)  Initializing a semaphore creates a queue that stores references to threads waiting to enter their critical sections protected by that semaphore. 
A)  A thread performs the P operation after it enters its critical section. 
B)  A thread performs the V operation before exiting its critical section. 
C)  Initializing a semaphore sets the value of a protected variable to indicate that no thread is executing its critical section. 
D)  Initializing a semaphore creates a queue that stores references to threads waiting to enter their critical sections protected by that semaphore.

Question 6

The constructs that encapsulate a thread's critical section are sometimes called ________.

Accepted Answer

A)  critical section primitives 
B)  synchronism delimiters 
C)  mutual exclusion primitives 
D)  protection delimiters 
A)  critical section primitives 
B)  synchronism delimiters 
C)  mutual exclusion primitives 
D)  protection delimiters

Lockstep synchronization does not ________.

Preventing more than one thread from accessing a shared variable simultaneously is known as ________ access to the shared variable.

Many system architectures support a(n) ________ instruction that enables a thread to exchange the values of two variables atomically.

Which of the following statements about Lamport's Bakery Algorithm is false?

Which of the following statements about semaphores is false?

The constructs that encapsulate a thread's critical section are sometimes called ________.

Exploring Operating Systems and Distributed Computing: a Comprehensive Overview

Understanding Computer Systems and Programming Concepts

Understanding Processes and Threads in Operating Systems

Exploring Semaphores and Multithreading in Operating Systems

Concurrency and Deadlock in Database Systems: Exploring Monitor Implementation and Thread Synchronization in Java

Operating System Scheduling and Deadlock Prevention: a Comprehensive Guide

Understanding Processor Scheduling and Memory Management in Operating Systems

Memory Management in Operating Systems: Segmentation, Paging, and Strategies for Efficiency

Memory Management and Address Translation in Operating Systems

Memory Management and Page Replacement Strategies in Operating Systems

Disk Storage and Raid Technology

Understanding File Systems and Database Systems: a Comprehensive Overview

Exploring Performance Evaluation and Benchmarking in Computer Systems

Understanding Multiprocessor Organizations and System Performance

Understanding the Layers of the TCP/IP Protocol Stack

Understanding Distributed Systems and Operating Systems

Exploring Distributed File Systems and Grid Computing With NFS, AFS, Coda, and JXTA

Security Threats and Solutions in Cryptography and Access Control

Exploring the Linux Operating Systems Features and Functionality

In-Depth Analysis of Windows XP

Filters

Exam 5: Exploring Thread Synchronization and Mutual Exclusion in Java

Lockstep synchronization does not ________.

Preventing more than one thread from accessing a shared variable simultaneously is known as ________ access to the shared variable.

Many system architectures support a(n) ________ instruction that enables a thread to exchange the values of two variables atomically.

Which of the following statements about Lamport's Bakery Algorithm is false?

Which of the following statements about semaphores is false?

The constructs that encapsulate a thread's critical section are sometimes called ________.

Exploring Operating Systems and Distributed Computing: a Comprehensive Overview

Understanding Computer Systems and Programming Concepts

Understanding Processes and Threads in Operating Systems

Exploring Semaphores and Multithreading in Operating Systems

Concurrency and Deadlock in Database Systems: Exploring Monitor Implementation and Thread Synchronization in Java

Operating System Scheduling and Deadlock Prevention: a Comprehensive Guide

Understanding Processor Scheduling and Memory Management in Operating Systems

Memory Management in Operating Systems: Segmentation, Paging, and Strategies for Efficiency

Memory Management and Address Translation in Operating Systems

Memory Management and Page Replacement Strategies in Operating Systems

Disk Storage and Raid Technology

Understanding File Systems and Database Systems: a Comprehensive Overview

Exploring Performance Evaluation and Benchmarking in Computer Systems

Understanding Multiprocessor Organizations and System Performance

Understanding the Layers of the TCP/IP Protocol Stack

Understanding Distributed Systems and Operating Systems

Exploring Distributed File Systems and Grid Computing With NFS, AFS, Coda, and JXTA

Security Threats and Solutions in Cryptography and Access Control

Exploring the Linux Operating Systems Features and Functionality

In-Depth Analysis of Windows XP

Filters