Distributed Computing MCQ's




Question 391 :
Two clocks are said to be synchronized at a particular instance of time if the difference in time values of the two clocks is less than some specified constant. The difference in time values of two clocks is called ___________

  1. Clock Frequency
  2. Clock drift
  3. Clock skew
  4. Clock Ticks
  

Question 392 :
The time in which the remote updating is reflected locally is called as _________.

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

Question 393 :
___algorithm for coordinator election assumes that no process can fail during the election procedure until the new coordinator has been selected.

  1. bully algorithm
  2. Ring algorithm
  3. Lamport algorithm
  4. Suzuki Kasami algorithm
  

Question 394 :
A process is selected from the ______ queue by the ________ scheduler, to be executed.

  1. blocked, short term
  2. wait, long term
  3. ready, short term
  4. ready, long term
  

Question 395 :
Which of the following algorithms is less sensitive to crashes.

  1. Centralized
  2. Decentralized
  3. Distributed
  4. Token ring
  

Question 396 :
Server checking whether file is updated in cache or not before using it is known as_____.

  1. Client Validation
  2. Server Validation
  3. Client updating
  4. Server Updating
  

Question 397 :
If a process is executing in its critical section, ________

  1. any other process can also execute in its critical section
  2. no other process can execute in its critical section
  3. one more process can execute in its critical section
  4. two more process can execute in its critical section
  

Question 398 :
In which algorithm, One process is elected as the coordinator.

  1. Distributed mutual exclusion algorithm
  2. Centralized mutual exclusion algorithm
  3. Token ring algorithm
  4. Lamport algorithm
  

Question 399 :
Which policy used in load balancing algorithm

  1. standard policy
  2. variant policy
  3. location policy
  4. random policy
  

Question 400 :
A type of the fault which occurs once and only the replacement/repair of a faulty component will allow the Distributed System to function normally

  1. Transient Fault
  2. Intermittent Fault
  3. Permanent Fault
  4. Temporary fault
  

Question 401 :
A socket uses ____________ to transmit data between the sender and the reciever.

  1. IPC
  2. IMC
  3. IBC
  4. API
  

Question 402 :
A Client centric consistency model which states A write operation by a process on a data item x is completed before any successive write operation on x by the same process.

  1. Monotonic Reads
  2. Monotonic Writes
  3. Read your writes
  4. Writes your Reads
  

Question 403 :
Method invocations between objects in the same process are

  1. Static method invocations
  2. Dynamic method invocations
  3. Local method invocations
  4. Temporal method invocations
  

Question 404 :
________consistency is fine if clients always access the same replica.

  1. Data-centric
  2. Client centric
  3. Eventual
  4. Entry
  

Question 405 :
_______consistency provides consistency gurantees for a single client with respect to the data stored by that client

  1. Data-centric
  2. Client centric
  3. Eventual
  4. Entry
  

Question 406 :
Transient communication done by_____ layer

  1. Network
  2. Transport
  3. Physical
  4. Session
  

Question 407 :
Middleware is an application that logically lives (mostly) in the

  1. application layer
  2. Transport layer
  3. IP packet
  4. Presentation packet
  

Question 408 :
In distributed systems, a logical clock is associated with ______________

  1. each instruction
  2. each process
  3. each register
  4. Many registers
  

Question 409 :
In which the access takes place when different processes try to access the same data concurrently and the outcome of the execution depends on the specific order, is called

  1. dynamic condition
  2. race condition
  3. essential condition
  4. critical condition
  

Question 410 :
In the Bully algorithm, process which is elected as the coordinator is the one having –

  1. Highest process ID
  2. Lowest process ID
  3. Highest timestamp value
  4. Lowest Timestamp value
  

Question 411 :
MPI and sockets are examples of

  1. Message oriented transient communication
  2. message oriented persistent communication
  3. Mobile Oriented Communication
  4. Object oriented permanent Communication
  

Question 412 :
The main advantage of centralized system for clock synchronization is _____

  1. Time is fixed
  2. Time is unambiguous
  3. There is no time delay
  4. There is no jitter
  

Question 413 :
Select which is not type of group communication

  1. One to One Communication
  2. Many to One Communication
  3. Many to Many Communication
  4. One to Many Communication
  

Question 414 :
If a system goes down for one millisecond every hour, then how much availability it has?

  1. 99.09 percent
  2. 99.9999 percent
  3. 00.99 percent
  4. 99.3 percent
  

Question 415 :
The difference between logical and physical clocks ?

  1. Logical clocks measure the time of day and Physical clocks are used to mark relationships among events in a distributed system.
  2. Both are the same
  3. Physical clocks measure the time of day and Logical clocks are used to mark relationships among events in a distributed system.
  4. Physical clock and logical clock do not work in distributed system
  

Question 416 :
Increasing the speedup for parallel processor which law is suitable

  1. Amdhals law
  2. Flynns law
  3. Minsky conjecture
  4. Moores Law
  

Question 417 :
_____ model consist of multiple work stations coupled with powerful servers with extra hardware to store the file system s and other software like databases

  1. Workstation model
  2. Workstation -server model
  3. Processor-pool model
  4. Client-server model
  

Question 418 :
The absence of _____________consistency is sometimes experienced when updating Web documents and subsequently viewing the effects.

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

Question 419 :
Which one of the following is not true about GFS?

  1. Cluster Based Architecture
  2. Client Caching
  3. End users do not interact
  4. Server Replication
  

Question 420 :
Backward error recovery requires

  1. Grouping
  2. Assurance
  3. checkpointing
  4. Validation
  
Pages