Distributed Computing MCQ's




Question 121 :
In __________ critical section requests are executed in the increasing order of timestamps i.e a request with smaller timestamp will be given permission to execute critical section first than a request with larger timestamp.

  1. Cristian’s algorithm
  2. Berkeley algorithm
  3. Lamport algorithm
  4. Election algorithm
  

Question 122 :
The NFS protocol __________ concurrency control mechanisms.

  1. provides
  2. does not provide
  3. may provide
  4. may not provide at some time
  

Question 123 :
The segment of code in which the process may change common variables, update tables, write into files is known as ____________

  1. program
  2. critical section
  3. non – critical section
  4. synchronizing
  

Question 124 :
_______of data is a major fault tolerance method in distributed system

  1. Replication
  2. recovery
  3. concurrency
  4. Consistency
  

Question 125 :
What is not a major goal for building distributed systems?

  1. Resource sharing
  2. Computation speedup
  3. Reliability
  4. Simplicity
  

Question 126 :
If two event a and b are parallel, then ____________.

  1. a and b monotonic
  2. C = C
  3. C > C
  4. C < C
  

Question 127 :
Recart-Agrawala Algorithm is

  1. Election Algorithm
  2. Clock synchronization Algorithm
  3. Mutual Exclusion Algorithm
  4. Event ordering
  

Question 128 :
When the event for which a thread is blocked occurs?

  1. thread moves to the ready queue
  2. thread remains blocked
  3. thread completes
  4. a new thread is provided
  

Question 129 :
___________defined a relation called happens-before

  1. Berkeley
  2. Lamport
  3. Vector
  4. Cristian
  

Question 130 :
Select the message which is not used in Centralized algorithm of Mutual Exclusion

  1. Release
  2. Request
  3. Hello
  4. Reply
  

Question 131 :
A file appears to the file server as an ordered sequence of records in

  1. Unstructured files
  2. Structured files
  3. Immutable files
  4. Mutable files
  

Question 132 :
In GFS(Google file System) files are divided into _______chunks

  1. Variable Size
  2. Fixed Size
  3. Variable and Fixed size
  4. Not variable not fixed size
  

Question 133 :
Which of the following variables denote the state of site in Singhals dynamic information structure algorithm

  1. Requesting, Executing, and My_ priority
  2. Requesting, Responsing and My_priority
  3. Requesting, Responsing and Blocked
  4. Requesting, Executing and Blocked
  

Question 134 :
In RPC system, which of the following failure may not occur

  1. The client cannot locate server
  2. The client crashes after sending a request
  3. The server crashs after receiving a request
  4. The request message from the client to the server is obtained
  

Question 135 :
Which of the below element is usually not there in the header?

  1. Sequence number
  2. Structural information
  3. Address
  4. File mode(Read/ Write)
  

Question 136 :
Virtualization that creates one single address space architecture is called ______.

  1. Loosely coupled
  2. Peer-to-Peer
  3. Space-based
  4. Tightly coupled
  

Question 137 :
The maximum number of messages required per CS execution in Maekawa's algorithm for deadlock handling is

  1. 4√N
  2. √N
  3. 5√N
  4. 2√N
  

Question 138 :
which of the following is not basic requirements of Mutual Exclusion Algorithms

  1. Safety property
  2. Liveness property
  3. Fairness
  4. System throughput
  

Question 139 :
Which of the following is a disadvantage of replication?

  1. Reduced network traffic
  2. If the database fails at one site, a copy can be located at another site.
  3. Each site must have the same storage capacity.
  4. Each transaction may proceed without coordination across the network.
  

Question 140 :
Among the following option which is not main focus of Distributed System

  1. Availability
  2. Reliability
  3. Scientific Performance
  4. Resource sharing
  

Question 141 :
Which of the following is NOT type of distributed systems

  1. Distributed computing system
  2. Pervasive system
  3. Distributed Information System
  4. Parallel System
  

Question 142 :
The effect of a write operation by a process on data item x will always be seen by a successive read operation on x by the same process.

  1. Read-your-writes
  2. Monotonic-writes
  3. Monotonic-Reads
  4. Writes-follow-reads
  

Question 143 :
Which among below is not a technique commonly used for scaling in Distributed System

  1. Hiding Communication Latency
  2. Hide Performance
  3. Hide Distribution
  4. Hide Replication
  

Question 144 :
Which of the following are the problems of token ring algorithms

  1. Lost token, coordinator crash
  2. Coordinator crash, low efficiency
  3. process crash, low efficiency
  4. Lost token, process crash
  

Question 145 :
________________ provides programmers a familiar programming model by extending the local procedure call to a distributed environment

  1. Distributed environment
  2. Permanent procedure call
  3. Process and file
  4. Remote procedure call
  

Question 146 :
RPC allows a computer program to cause a subroutine to execute in _________

  1. Its own address space
  2. Another address space
  3. Both its own address space and another address space
  4. Applications address space
  

Question 147 :
Which of the following variable wait within the to enable a process

  1. a condition is defined by a condition variable
  2. objects Boolean objects can be used by condition variables
  3. semaphore must be used
  4. all of the mentioned
  

Question 148 :
Which is not desirable feature of a good distributed system

  1. User mobility
  2. Performance
  3. Data Intergrity
  4. Homogeneity
  

Question 149 :
The data consistency models in the descending order of their strictness in consistency are _____.

  1. Linearizability, Sequential, Casual, FIFO
  2. FIFO,Casual,Sequential,Linearizability
  3. Casual,Sequential,Linearizability,FIFO
  4. Sequential,Casual,FIFO,Linearizability
  

Question 150 :
What are not the characteristics of a DFS?

  1. login transparency and access transparency
  2. Files need not contain information about their physical location
  3. No Multiplicity of users
  4. No Multiplicity if files
  
Pages