Question 1

__________ guarantees that when multiple messages are sent between processes, the messages will arrive in the order they were sent.

Accepted Answer

A)  Atomic broadcast 
B)  FIFO broadcast 
C)  Totally ordered broadcast 
D)  Causal broadcast 
A)  Atomic broadcast 
B)  FIFO broadcast 
C)  Totally ordered broadcast 
D)  Causal broadcast B

Question 2

Which of the following statements about wound-wait and wait-die deadlock prevention strategies is true?

Accepted Answer

A)  The wound-wait deadlock prevention strategy prevents deadlock by denying the wait-for condition. 
B)  The wait-die deadlock prevention strategy breaks deadlock by denying the no-preemption condition. 
C)  In the wound-wait strategy, as a process ages, it will wait less often. 
D)  In the wait-die strategy, as a process ages, it will wait less often. 
A)  The wound-wait deadlock prevention strategy prevents deadlock by denying the wait-for condition. 
B)  The wait-die deadlock prevention strategy breaks deadlock by denying the no-preemption condition. 
C)  In the wound-wait strategy, as a process ages, it will wait less often. 
D)  In the wait-die strategy, as a process ages, it will wait less often. D

Question 3

Which of the following statements about the Sprite distributed operation system is false?

Accepted Answer

A)  Sprite uses process migration to balance the workload of the system. 
B)  Sprite uses explicit acknowledgements to ensure that messages are delivered reliably. 
C)  Location-independent calls produce the same result for all workstations. 
D)  The Sprite file system caches files on both the server and client. 
A)  Sprite uses process migration to balance the workload of the system. 
B)  Sprite uses explicit acknowledgements to ensure that messages are delivered reliably. 
C)  Location-independent calls produce the same result for all workstations. 
D)  The Sprite file system caches files on both the server and client. B

Question 4

Which of the following statements about the Amoeba distributed operation system is true?

Accepted Answer

A)  Each Amoeba user is assigned to a particular workstation for the duration of the session. 
B)  Amoeba does not provide location transparency. 
C)  Amoeba uses implicit acknowledgement to ensure that messages are delivered reliably. 
D)  Files stored by the bullet server cannot be modified after being created. 
A)  Each Amoeba user is assigned to a particular workstation for the duration of the session. 
B)  Amoeba does not provide location transparency. 
C)  Amoeba uses implicit acknowledgement to ensure that messages are delivered reliably. 
D)  Files stored by the bullet server cannot be modified after being created.

Question 5

A __________ ensures that all events are ordered and that causality is preserved.

Accepted Answer

A)  causal ordering 
B)  partial ordering 
C)  total ordering 
D)  logical ordering 
A)  causal ordering 
B)  partial ordering 
C)  total ordering 
D)  logical ordering

Question 6

The __________ is not one of the three layers of RMI architecture.

Accepted Answer

A)  presentation layer 
B)  stub/skeleton layer 
C)  remote reference layer 
D)  transport layer 
A)  presentation layer 
B)  stub/skeleton layer 
C)  remote reference layer 
D)  transport layer

Question 7

__________ allows a distributed system to grow without affecting the existing applications and users.

Accepted Answer

A)  Transparency 
B)  Scalability 
C)  Reliability 
D)  all of the above 
A)  Transparency 
B)  Scalability 
C)  Reliability 
D)  all of the above

Question 8

Agrawala and Ricart's distributed mutual exclusion algorithm __________.

Accepted Answer

A)  assumes that communication between processes is reliable 
B)  assumes that processes do not fail 
C)  requires that a process first send a request message to all other processes in the system and receive a response from each of them before that process can enter its critical section 
D)  all of the above 
A)  assumes that communication between processes is reliable 
B)  assumes that processes do not fail 
C)  requires that a process first send a request message to all other processes in the system and receive a response from each of them before that process can enter its critical section 
D)  all of the above

Question 9

__________ is not one of the eight types of transparency a distributed system can provide.

Accepted Answer

A)  access tranparency 
B)  failure tranparency 
C)  security tranparency 
D)  transaction tranparency 
A)  access tranparency 
B)  failure tranparency 
C)  security tranparency 
D)  transaction tranparency

Question 10

Middleware helps provide __________.

Accepted Answer

A)  portability 
B)  transparency 
C)  interoperability 
D)  all of the above 
A)  portability 
B)  transparency 
C)  interoperability 
D)  all of the above

Question 11

In distributed systems_________ make(s) it difficult to determine the order in which events occur.

Accepted Answer

A)  unpredictable communication delays 
B)  temporal transparency 
C)  process migration 
D)  the absence of middleware 
A)  unpredictable communication delays 
B)  temporal transparency 
C)  process migration 
D)  the absence of middleware

Question 12

Order the distributed deadlock detection strategies with the least fault tolerant first.

Accepted Answer

A)  central, hierarchical, distributed 
B)  hierarchical, central, distributed 
C)  central, distributed, hierarchy 
D)  distributed, hierarchical, central 
A)  central, hierarchical, distributed 
B)  hierarchical, central, distributed 
C)  central, distributed, hierarchy 
D)  distributed, hierarchical, central

Question 13

_________ moves a copy of a process to another machine without destroying the original process.

Accepted Answer

A)  Process migration 
B)  Process cloning 
C)  Process distribution 
D)  none of the above 
A)  Process migration 
B)  Process cloning 
C)  Process distribution 
D)  none of the above

Question 14

Which of the following statements is false?

Accepted Answer

A)  Distributed systems improve the capacity and reliability of a single machine. 
B)  Users of a distributed operating system are given the impression that they are interacting with just one machine. 
C)  Distributed systems divide resources among a group of machines and let multiple users share the resources. 
D)  Distributed systems are easy to implement. 
A)  Distributed systems improve the capacity and reliability of a single machine. 
B)  Users of a distributed operating system are given the impression that they are interacting with just one machine. 
C)  Distributed systems divide resources among a group of machines and let multiple users share the resources. 
D)  Distributed systems are easy to implement.

Question 15

A phantom deadlock __________.

Accepted Answer

A)  is an example of resource deadlock 
B)  occurs in the presence of circular waits for communication signals 
C)  occurs when a process that holds a shared resource fails 
D)  none of the above. 
A)  is an example of resource deadlock 
B)  occurs in the presence of circular waits for communication signals 
C)  occurs when a process that holds a shared resource fails 
D)  none of the above.

Question 16

Network operating systems__________.

Accepted Answer

A)  access remote resources transparently 
B)  are easier to implement than distributed operating systems 
C)  manage resources located in multiple networked computers 
D)  none of the above 
A)  access remote resources transparently 
B)  are easier to implement than distributed operating systems 
C)  manage resources located in multiple networked computers 
D)  none of the above

Question 17

_________ is an open standard designed to enable interoperation among programs in heterogeneous as well as homogeneous systems.

Accepted Answer

A)  RPC 
B)  RMI 
C)  CORBA 
D)  DCOM 
A)  RPC 
B)  RMI 
C)  CORBA 
D)  DCOM

Question 18

In RPC, packaging procedure arguments along with the procedure name into a message for transmission over a network is performed by __________.

Accepted Answer

A)  packaging 
B)  marshaling 
C)  the client stub only 
D)  the server stub only 
A)  packaging 
B)  marshaling 
C)  the client stub only 
D)  the server stub only

Question 19

Operating systems provide persistence transparency by __________.

Accepted Answer

A)  hiding the location of resources 
B)  hiding the fact that multiple copies of a resource are available 
C)  hiding the location where the resource is stored 
D)  hiding the movement of components among computers in a distributed system 
A)  hiding the location of resources 
B)  hiding the fact that multiple copies of a resource are available 
C)  hiding the location where the resource is stored 
D)  hiding the movement of components among computers in a distributed system

Question 20

In a transaction wait-for graph (TWFG), each node represents a __________ and each arrow represents a __________.

Accepted Answer

A)  process, resource 
B)  resource, resource allocation 
C)  process, requested resource being held by another process 
D)  resource, deadlock 
A)  process, resource 
B)  resource, resource allocation 
C)  process, requested resource being held by another process 
D)  resource, deadlock

Exam 17: Understanding Distributed Systems and Operating Systems

__________ guarantees that when multiple messages are sent between processes, the messages will arrive in the order they were sent.

Which of the following statements about wound-wait and wait-die deadlock prevention strategies is true?

Which of the following statements about the Sprite distributed operation system is false?

Which of the following statements about the Amoeba distributed operation system is true?

A __________ ensures that all events are ordered and that causality is preserved.

The __________ is not one of the three layers of RMI architecture.

__________ allows a distributed system to grow without affecting the existing applications and users.

Agrawala and Ricart's distributed mutual exclusion algorithm __________.

__________ is not one of the eight types of transparency a distributed system can provide.

Middleware helps provide __________.

In distributed systems_________ make(s) it difficult to determine the order in which events occur.

Order the distributed deadlock detection strategies with the least fault tolerant first.

_________ moves a copy of a process to another machine without destroying the original process.

Which of the following statements is false?

A phantom deadlock __________.

Network operating systems__________.

_________ is an open standard designed to enable interoperation among programs in heterogeneous as well as homogeneous systems.

In RPC, packaging procedure arguments along with the procedure name into a message for transmission over a network is performed by __________.

Operating systems provide persistence transparency by __________.

In a transaction wait-for graph (TWFG), each node represents a __________ and each arrow represents a __________.

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

Exploring Thread Synchronization and Mutual Exclusion in Java

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

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

In a transaction wait-for graph (TWFG), each node represents a and each arrow represents a .