Distributed Computing MCQ's




Question 241 :
What is UTC ?


  1. Universal Centralized Time
  2. Unique Coordinated Time
  3. Universal Coordinated Time
  4. Unique Centralized Time
  

Question 242 :
__________is the problem that occurs when high priority processes keep executing and low priority processes get blocked for indefinite time


  1. Deadlock
  2. Starvation
  3. Fairness
  4. monotonic
  

Question 243 :
In Suzuki-Kasami's mutual exclusion algorithm, synchronization delay is ______. (T is time unit)


  1. 0 or T
  2. 1 or 2T
  3. 3T
  4. 4T
  

Question 244 :
The local operating system on the server machine passes the incoming packets to the _________


  1. server stub
  2. client stub
  3. client operating system
  4. Binding agent
  

Question 245 :
In GFS, Chunk replicas are created for three reasons: ___________________


  1. chunk creation, re-replication, and rebalancing
  2. chunk deletion, re-replication, and rebalancing
  3. chunk creation, re-replication, and resharing
  4. chunk creation, chunk deletion, and rebalancing
  

Question 246 :
Distributed system have significant characteristics of


  1. 2 types
  2. 3 types
  3. 4 types
  4. 5 types
  

Question 247 :
Basis for communication in middleware based operating system is________.


  1. Files
  2. Model specific
  3. Messages
  4. Shared memory
  

Question 248 :
In case of good process migration mechanism, _______________ means failure of any node other than the one on which the process is running should not affect the execution of process.


  1. Robustness
  2. Efficiency
  3. Transparent
  4. Interference
  

Question 249 :
____are used for signaling among processes and can be readily used to enforce a mutual exclusion discipline.


  1. Semaphores
  2. Messages
  3. Monitors
  4. Addressing
  

Question 250 :
In distributed file system, a file is uniquely identified by _________________


  1. host name
  2. local name
  3. the combination of host name and local name
  4. Priority number
  

Question 251 :
The method and time to access data and replica is defined as___________.


  1. Concurrency
  2. Consistency
  3. Availability
  4. Isolation
  

Question 252 :
Storing file in________ makes it permanently available


  1. Secondary Memory
  2. RAM
  3. Register
  4. DRAM
  

Question 253 :
Lamport algorithm requires ____messages per Critical Section invocation and the synchronization delay in the algorithm is ___


  1. 3(N-1), T
  2. 3(N-1), 2T
  3. 3(N), T-1
  4. 3(N), 2(T-1)
  

Question 254 :
Which layer is the layer closest to the transmission medium ?


  1. Physical
  2. Data link
  3. Network
  4. Transport
  

Question 255 :
A shared-memory system is said to support the __________ model if the value returned by a read operation on a memory address is always the same as the value written by the most recent write operation to that address.


  1. causal consistency
  2. strict consistency
  3. sequential consistency
  4. FIFO consistency
  

Question 256 :
What is a Iterative server


  1. Its handles request and give response to client
  2. Server does not handle request
  3. its uses concurrent server
  4. Its not handles request and give response to client
  

Question 257 :
Distributed syatem consists of set of resour


  1. cPrinter
  2. Processor
  3. CD
  4. Processes
  

Question 258 :
A typical _________ program creates some remote objects, makes references to these objects accessible, and waits for clients to invoke methods on these objects.


  1. Server
  2. Client
  3. Thread
  4. Concurrent
  

Question 259 :
A sequentially consistent memory provides __________ semantics because all the processes sharing a memory location always see exactly the same contents stored in it.


  1. n-copy
  2. double copy
  3. one-copy/single-copy
  4. Three copy
  

Question 260 :
When high priority task is indirectly preempted by medium priority the scenario is called


  1. priority inversion
  2. priority removal
  3. priority exchange
  4. priority modification
  

Question 261 :
Deterministic and probabilistic algorithms are the types of _____________.


  1. Static Load balancing algorithm
  2. Dynamic Load balancing algorithm
  3. Distributed
  4. Centralized
  

Question 262 :
In weak consistency____-


  1. one operation on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  2. Two operations on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  3. All operations on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  4. No operation on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  

Question 263 :
When high priority task is indirectly preempted by medium priority the scenario is called


  1. priority inversion
  2. priority removal
  3. priority exchange
  4. priority modification
  

Question 264 :
A 'glue' between client and server parts of application.


  1. Middleware
  2. Firmware
  3. Package
  4. System Software
  

Question 265 :
The variable that assures local copies are consistent with remote ones is________.


  1. Release
  2. Acquire
  3. Read
  4. Write
  

Question 266 :
What is the advantage of a vector clock over Lamport's logical clock?


  1. Catch causality
  2. avoid deadlock
  3. avoid linear relationship
  4. set nonlinear relationship
  

Question 267 :
Logical extension of computation migration is


  1. process migration
  2. system migration
  3. thread migration
  4. data migration
  

Question 268 :
______ determines to which node a selected process needs to be transferred.


  1. Storage policy
  2. Selection policy
  3. Transfer policy
  4. Location policy
  

Question 269 :
UTC stands for


  1. Unique Cordinated Time
  2. Unique Time Coordination
  3. Universal Total Coordination
  4. Universal Coordinated Time
  

Question 270 :
Uni processor computing is known as


  1. Centralized Computing
  2. Parallel Computing
  3. Distributed Computing
  4. Grid Computing
  
Pages