Distributed Computing MCQ's




Question 991 :
What is close group in group communication?

  1. Only members can send messages to the group as a whole
  2. processes that are not members (clients) can send message to the group.
  3. the idea of groups is to support replicated servers
  4. processes that are not members (clients) but close to the group can send message to the group.
  

Question 992 :
Internet provides _______ for remote login.

  1. telnet
  2. http
  3. ftp
  4. RPC
  

Question 993 :
A message broker acts as an application-level gateway in a ________

  1. Message-queuing system.
  2. RPC
  3. IPC
  4. Message Streaming System
  

Question 994 :
In context of HDFS file system, Point out the wrong statement.

  1. Replication Factor can be configured at a cluster level (Default is set to 3) and also at a file level
  2. Block Report from each DataNode contains a list of all the blocks that are stored on that DataNode
  3. User data is stored on the local file system of DataNodes
  4. DataNode is aware of the files to which the blocks stored on it belong to
  

Question 995 :
Staleness deviations relate to the _________ a replica was updated.

  1. First time
  2. Most recent time
  3. last time
  4. previous time
  

Question 996 :
____ is software architecture used to build a distributed system from a network connected by high speed network.

  1. DOS
  2. NOS
  3. Middleware
  4. Operating system
  

Question 997 :
Andrew File system was designed by ___________.

  1. Mr. Peter Andrew
  2. Professor M. Satyanarayanan
  3. Professor James Andrew
  4. Google
  

Question 998 :
In distributed information systems ______ is responssible for executing several transactions concurrently over the network without any conflict.

  1. Enterprise application integration
  2. Transaction processing system
  3. Computational Grid
  4. Collaborative Grid
  

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

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

Question 1000 :
_________ is an object acting as a gateway for the client side.

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

Question 1001 :
Which of the following algorithm is Non- Token Based Algorithm for Mutual Exclusion

  1. Singhal‘s Heurastic Algorithm
  2. Bully Algorithm
  3. Maekawa‘s Algorithm
  4. Raymond‘s Tree based Algorithm
  

Question 1002 :
_____ is the key technique that is needed to achieve fault tolerance.

  1. Availability
  2. Redundancy
  3. Scalability
  4. Heterogeneity
  

Question 1003 :
In which model, there is no distinction between the client - server process.

  1. clent-server model
  2. Master-slave model
  3. P2P Model
  4. fault model
  

Question 1004 :
A thread shares its resources(like data section, code section, open files, signals) with ___________

  1. other process similar to the one that the thread belongs to
  2. other threads that belong to similar processes
  3. other threads that belong to the same process
  4. different threads that belong to the different process
  

Question 1005 :
Machine that places the request to access the data is generally called as __________.

  1. Server Machine
  2. Client Machine
  3. Request Machine
  4. Database server
  

Question 1006 :
IPv6 address is

  1. 32 bits
  2. 48 bits
  3. 128 bits
  4. 16 bits
  

Question 1007 :
Logical extension of computation migration is ___________

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

Question 1008 :
Only one node can be in possession of the privilege (called the privileged node) at any time, except when the privilege is in transit from one node to another in the form of a PRIVILEGE message. This is true for which mutual exclusion algorithm?

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

Question 1009 :
In which file system mapreduce function is used?

  1. AFS
  2. NFS
  3. HDFS
  4. None of the above
  

Question 1010 :
The client stub is called by the __.

  1. server
  2. client
  3. host
  4. client and server
  

Question 1011 :
_____________ manage the name spaces and binds an object to its location.

  1. Name Server
  2. Name agent
  3. Context
  4. Name resolution
  

Question 1012 :
Which application-level protocol plays a crucial role in carrying out the data definition and manipulation in addition to X-500 features?

  1. TCP
  2. LDAP
  3. FTP
  4. UDP
  

Question 1013 :
Which of the following disadvantages follows the single coordinator approach?

  1. Bottleneck
  2. Slow response
  3. Deadlock
  4. One request per second
  

Question 1014 :
A distributed database is which of the following?

  1. A single logical database that is spread to multiple locations and is interconnected by a network
  2. A loose collection of file that is spread to multiple locations and is interconnected by a network
  3. A single logical database that is limited to one location.
  4. A loose collection of file that is limited to one location.
  

Question 1015 :
In physical clocks, the clock tick can be produced by the following-

  1. Interrupt
  2. Signal
  3. Monitors
  4. registers
  

Question 1016 :
In distributed systems, transaction coordinator

  1. starts the execution of transaction
  2. breaks the transaction into number of sub transactions
  3. coordinates the termination of the transaction
  4. all of the mentioned
  

Question 1017 :
Scheduuling of threads done by

  1. input
  2. output
  3. operating system
  4. memory
  
Pages