Distributed Computing MCQ's




Question 91 :
What is common problem found in distributed system ?


  1. Process Synchronization
  2. Communication synchronization
  3. Deadlock problem
  4. Power failure
  

Question 92 :
DNS is an example of


  1. Continuous Consistency
  2. Causal Consistency
  3. Sequential Consistency
  4. Eventual Consistency
  

Question 93 :
Inter Process Communication takes place via


  1. Shared memory and message passing
  2. Decentralized memory and message passing
  3. Shared memory and message replicating
  4. Decentralized memory and message replicating
  

Question 94 :
Raymond’s Tree-Based Algorithm exchanges only ______- messages under light load .


  1. O(Nlog2 N)
  2. O(log N)
  3. O(NlogN)
  4. O(logN)
  

Question 95 :
If file system is growing without affecting performance of the system then this Union feature is called as?


  1. portable
  2. robust
  3. Scalability
  

Question 96 :
The ability of distributed system to hide the fact is known as?


  1. Openness
  2. Scalability
  3. transparency
  4. Homogeneity
  

Question 97 :
Hide that a resource is replicated is known as___________transparency


  1. Replication
  2. Location
  3. Migration
  4. Relocation
  

Question 98 :
_______________ algorithm requires clients to periodically synchronize with central time server.


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

Question 99 :
What is interprocess communication?


  1. communication within the process
  2. communication between two process
  3. communication between two threads of same process
  4. Comunication of process
  

Question 100 :
A DFS is executed as a part of


  1. System specific program
  2. operating system
  3. File system
  4. Application program
  

Question 101 :
In distributed file system,XDR stands for?


  1. external data request
  2. External device request
  3. external data recovery
  4. External data representation
  

Question 102 :
Which of the following conditions is not requied to solve the critical section problem?


  1. Mutual Exclusion
  2. Progress
  3. Bounded Waiting
  4. Sharing
  

Question 103 :
Message passing provides a mechanism to allow processes to communicate and to synchronize their actions _______.


  1. By sharing the same address space
  2. without sharing the same address space
  3. by sharing the same process number and Process Identifier
  4. By sharing network
  

Question 104 :
For proper synchronization in distributed systems _____


  1. prevention from the deadlock is must
  2. prevention from the starvation is must
  3. prevention from the deadlock - starvation is must
  4. prevention from deadlock is not necessary
  

Question 105 :
Replication model in which one copy is master and other copies are slaves is __________.


  1. Master-Slave
  2. Client -Server
  3. Peer-to-peer
  4. Permanent or
  

Question 106 :
The Ricart - Agrawala distributed mutual exclusion algorithm is:


  1. More efficient and more fault tolerant than a centralized algorithm.
  2. More efficient but less fault tolerant than a centralized algorithm
  3. Less efficient but more fault tolerant than a centralized algorithm
  4. Less efficient and less fault tolerant than a centralized algorithm
  

Question 107 :
The middleware cannot deliver a message due to a


  1. Transmission interrupt
  2. Message failure
  3. Invalid Recipt
  4. Missing Field
  

Question 108 :
A gateway for the server side object.


  1. skeleton
  2. stub
  3. remote
  4. server
  

Question 109 :
In global google system index of links is also maintained to keep track of


  1. links to a given site
  2. links of user
  3. links to programs
  4. links of user queries
  

Question 110 :
What is common problem found in distributed system ?


  1. Process Synchronization
  2. Communication synchronization
  3. Deadlock problem
  4. Power failure
  

Question 111 :
Which algorithm requires 1 to ∞ messages to enter and leave a critical region?


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

Question 112 :
What is the advantage of caching in remote file access?


  1. Reduced network traffic by retaining recently accessed disk blocks
  2. Faster network access
  3. Copies of data creates backup automatically
  4. Faster backup
  

Question 113 :
A middleware layer between the stub skeleton and transport.


  1. remote layer
  2. instruction layer
  3. reference layer
  4. remote reference layer
  

Question 114 :
What are characteristic of Network Operating Systems?


  1. Users are aware of multiplicity of machines
  2. They are transparent
  3. They are coherent
  4. Users are unaware of multiplicity of machines
  

Question 115 :
Presenting a singular, globalview, even while local changes are applied to the replicated data is defined as_________.


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

Question 116 :
The NFS client module caches the results of ____________- operations in order to reduce the number of requests transmitted to servers.


  1. svmlink,rmdir, read and write
  2. rmdir,read,lookup and write
  3. read, write, getattr, lookup and readdir
  4. Lookup, getattr, readdir, and rmdir
  

Question 117 :
___________ is a set of technologies for copying and distributing data and database objects from one database to another.


  1. Replication
  2. Database Mirroring
  3. Log Shipping
  4. Consistency
  

Question 118 :
What are the characteristics of data migration?


  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 limited portion of data
  

Question 119 :
Amoeba is belongs to which unit data transfer model used for file accessing in DFS


  1. File Level Transfer Mode
  2. Byte Level Transfer Model
  3. Record Level Transfer Model
  4. Block Level Transfer Model
  

Question 120 :
The name of a file doesn't need to be changed when the file's physical storage location changes is a feature of ____________


  1. Naming
  2. Location independence
  3. Location transparency
  4. Location dependence
  
Pages