Computer Distributed Computing (CDC) MCQ's




Question 331 :
A DFS should provide following services____.

  1. Transparency, User mobility, Performance, Simplicity and ease of use.
  2. Opacity,User mobility, Performance, Simplicity and ease of use.
  3. Immobility ,Transparency,Performance,Simplicity and ease of use.
  4. Opacity,User mobility, Performance, difficult to use.
  

Question 332 :
The difference in the time value of two Clocks is called_______

  1. Clock drift
  2. Clock skew
  3. Clock synchronization
  4. Difference clock
  

Question 333 :
Every remote object has a remote interface that specifies which of its

  1. Methods can be invoked remotely
  2. Parameters can be used remotely
  3. Methods can be invoked locally
  4. Parameters can be invoked locally
  

Question 334 :
Suppose that two processes detect the demise of the coordinator simultaneously and both decide to hold an election using the bully algorithm. What happens?

  1. Each of the higher-numbered processes will get two ELECTION messages, but will ignore the first one. The election will proceed as usual
  2. Each of the lower-numbered processes will get two ELECTION messages, but will ignore the first one. The election will proceed as usual
  3. Each of the lower-numbered processes will get two ELECTION messages, but will ignore the second one. The election will proceed as usual
  4. Each of the higher-numbered processes will get two ELECTION messages, but will ignore the second one. The election will proceed as usual
  

Question 335 :
________________is token based algorithm

  1. Richart Agrawala
  2. Maekawa
  3. Lamport’s
  4. Raymond Tree
  

Question 336 :
in NFS which funtion is used for creating new file?

  1. open()
  2. create()
  3. develope()
  4. null()
  

Question 337 :
__________replicas are used only to improve access time on data

  1. Client initiated
  2. Server initiated
  3. Permanent
  4. Dynamic
  

Question 338 :
Which of the following is the Logical Clock Synchronization algorithm

  1. Berkley's Algorithm
  2. Cristian's Algorithm
  3. Lamport's Algorithm
  4. Bully Algorithm
  

Question 339 :
____lends itself to implementation in distributed systems as well as in shared-memory multiprocessor and uni-processor system.

  1. monitor
  2. message passing
  3. strong semaphore
  4. binary semaphore
  

Question 340 :
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. None of the mentioned
  

Question 341 :
Single point failure is observed in this type of process resilence group.

  1. Hierarchical Group
  2. flat group
  3. IETF group
  4. Collected process Group
  

Question 342 :
What are the three popular semantic modes?

  1. Unix, Coherent - Session semantics
  2. Unix, Transaction - Session semantics
  3. Coherent, Transaction - Session semantics
  4. Session, Coherent semantics
  

Question 343 :
Which of the following properties hold true for quorums in a cotorie

  1. Intersection property and Union property
  2. Intersection property and Minimality property
  3. Minimality property and Union property
  4. Intersection property and Monotonicity property
  

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

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

Question 345 :
The computer clock differs from the real time clock is known as ____

  1. Quartz crystal
  2. Clock drift
  3. Clock skew
  4. None of the mentioned
  

Question 346 :
The dynamic replication algorithm takes into account

  1. to reduce load on server
  2. files on server can be migrated anywhere
  3. schedule process migration
  4. resource sharing
  

Question 347 :
Which of the following is correct about migration transparency?

  1. Local and remote objects should be accessed in a uniform way
  2. Objects are referred by logical names which hide the physical location of the objects
  3. Movement of object from one system to the other is invisible to user
  4. Sharing of objects without interference
  

Question 348 :
Distributed pervasive system is also known as

  1. Ubiquitous computing
  2. User Interface design
  3. Graphical User interface
  4. peer to peer system
  

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

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

Question 350 :
The mount mechanism ________ a transitive property.

  1. exhibits
  2. does not exhibit
  3. may exhibit
  4. executes
  

Question 351 :
With the launch of Google App Engine, Google went beyond _____________.

  1. software as a service
  2. service provider
  3. quality as a service
  4. data as a service
  

Question 352 :
Rate at which requests for the CR get executed is known as

  1. Synchronization delay
  2. System throughput
  3. Message complexity
  4. Response time
  

Question 353 :
client-centric consistency provides guarantees for a __________ concerning the consistency of accesses to a data store by that client.

  1. Single Client
  2. Multiple Client
  3. Single Server
  4. Multiple Server
  

Question 354 :
Load sharing algorithms employ the load estimation policy to measure load of a node. In sender initiated policy,

  1. Lightly loaded nodes search for heavily loaded nodes
  2. Heavily loaded nodes search for heavily loaded nodes
  3. Heavily loaded nodes search for lighlty loaded nodes
  4. Lightly loaded nodes search for lighlty loaded nodes
  

Question 355 :
______ algorithm works fine with low latency algorithm.

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

Question 356 :
____ defines the way in which the components of the system interact with each other - mapped onto an underlying network of component.

  1. Interaction model
  2. Fault model
  3. Architectural model
  4. Security model
  

Question 357 :
Synchronization tool is?

  1. thread
  2. pipe
  3. semaphore
  4. socket
  

Question 358 :
Remote write protocol supports all write operations

  1. Need to be forwarded to local server
  2. Need to be forwarded to multiple servers.
  3. Need to be forwarded to any server
  4. Need to be forwarded to a fixed single server.
  

Question 359 :
This is not the type of the solution adopted to kill the orphnas when client crashes in failure semantics of the RPC.

  1. extermination
  2. expiration
  3. reincarnation
  4. shut down the client
  

Question 360 :
What is not a major reason for building distributed systems ?

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