Distributed Computing MCQ's




Question 481 :
Which are the two complementary deadlock-prevention schemes using time stamps ?


  1. The wait-die - wound-wait scheme
  2. The wait-n-watch scheme
  3. The wound-wait scheme
  4. The wait-wound - wound-wait scheme
  

Question 482 :
The network Time protocol (NTP) which is widely used for clock synchronization on the Internet uses the ___________ method. The design of NTP invloves a ________ of time servers.


  1. Differential Delay, Binary tree
  2. Offset delay estimation, Hierarchical tree
  3. NTP time stamps, Quorum
  4. Physical clock delay, hierarchical tree
  

Question 483 :
Which Consistency is used to guarantee that users of a network newsgroup see a posting of a reaction to an article only after they have seen the original article


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

Question 484 :
A distributed system is defined as a collection of autonomous computers linked by a network with software designed to produce an integrated computing facility.


  1. TRUE
  2. FALSE
  

Question 485 :
Asymmetric multiprocessing systems of the computer system use


  1. master relationship
  2. slave relationship
  3. master slave relationship
  4. serial processing
  

Question 486 :
From the following which is not a type of Communication


  1. Persistent and transient communication
  2. Synchronous and asynchronous communication
  3. Persistent synchronous and persistent asynchronous communication
  4. Non persistent communication
  

Question 487 :
All techniques of Fault tolerance must rely on ______.


  1. Integrity
  2. Dependability
  3. Redundancy
  4. Synchronization
  

Question 488 :
Which one is not the property of QoS in stream oriented communication


  1. Required bit rate
  2. Maximum delay
  3. maximum and minimum end to end delay`
  4. File size
  

Question 489 :
What are the characteristics of process migr


  1. transfer data by entire file or immediate portion required
  2. transfer the computation rather than the data
  3. execute an entire process or parts of it at different sites
  4. execute an entire process or parts of it at same site
  

Question 490 :
_______is the ability of system to provide a service, even in the presence of errors


  1. Replication
  2. Fault tolerance
  3. concurrency
  4. Consistency
  

Question 491 :
State which of the following holds true in File Service Interface i)It enables users to access files in distributed systen ii)File accessing models decide how the users request for file access is serviced iii)It creates and manages directories ,adding and deleting files from directories


  1. i only
  2. i and iii only
  3. ii and iii only
  4. i and ii only
  

Question 492 :
The mount mechanism ________ a transitive property.


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

Question 493 :
Distributed pervasive system is also known as


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

Question 494 :
map and reduce are____


  1. libraries
  2. functions
  3. file system
  4. OS
  

Question 495 :
Which is NOT the characteristic of a DFS?


  1. reliability
  2. Scalability
  3. Transperency
  4. Upgradation
  

Question 496 :
Which of the following is NOT a Significant Consequence of Distributed Systems.


  1. Concurrency of components
  2. Lack of global clock
  3. Independent failures of components
  4. Scalability
  

Question 497 :
Multithreading is also called as ____________


  1. Concurrency
  2. Simultaneity
  3. Crosscurrent
  4. Recurrent
  

Question 498 :
The basic idea of RMI is to


  1. Call an method on remote machine while hiding message passing to programmer.
  2. Call a method on remote machine while not hiding message passing to programmer.
  3. Call a method on the same machine while hiding message passing to programmer.
  4. Call a method on the same machine.
  

Question 499 :
When a process is splited into pieces, it is called as-


  1. Tasks
  2. Program
  3. Processors
  4. Routines
  

Question 500 :
What are the characteristics of processor in distributed system?


  1. They are same in size
  2. They are manufactured with single purpose
  3. They vary in size and function
  4. They are same in function
  

Question 501 :
Client Initiated Replicas are used


  1. to improve load balancing
  2. to improve resource sharing
  3. to improve access time to data
  4. to improve the performance
  

Question 502 :
What is ‘Aging’?


  1. keeping track of cache contents
  2. keeping track of what pages are currently residing in memory
  3. keeping track of how many times a given page is referenced
  4. increasing the priority of jobs to ensure termination in a finite ti
  

Question 503 :
Advantage of Data-caching model over the Remote service model


  1. Reduces network traffic
  2. Contention for the file servers
  3. Increased performance
  4. Contention for Network
  

Question 504 :
Which of the following for Mutual exclusion can be provided by the


  1. mutex locks
  2. binary semaphores
  3. both mutex locks and binary semaphores
  4. none of the mentioned
  

Question 505 :
What are the advantages of file replication ?


  1. Improves availability -performance
  2. Decreases performance
  3. They are consistent
  4. Improves speed
  

Question 506 :
A software that lies between the OS and the applications running on it.


  1. system software
  2. middleware
  3. utility software
  4. Application software
  

Question 507 :
Writes that are potentially casually related must be seen by all processes in the same order. Concurrent writes may be seen in a different order on different machines is the necessary condition in ______


  1. FIFO consistency
  2. LRU consistency
  3. Optimal consistency
  4. Casual consistency
  

Question 508 :
Storing a separate copy of the database at multiple locations is which of the following?


  1. Data Replication
  2. Horizontal Partitioning
  3. Vertical Partitioning
  4. Horizontal and Vertical Partitioning
  

Question 509 :
Which of the following algortihm uses active time daemon for clock Synchronization


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

Question 510 :
The Lamport’s mutual exclusion algorithm requires _______ messages per Critical Section invocation


  1. (N - 1)
  2. 3(N - 1)
  3. 2(N - 1)
  4. 5(N - 1)
  
Pages