Distributed Computing MCQ's




Question 901 :
The Ricart–Agrawala algorithm assumes that the communication channels are ___

  1. LIFO
  2. busy
  3. FIFO
  4. blocked
  

Question 902 :
In which technique of cache updation -Files are modified and in parallel cache memory is also updated ?

  1. Write through
  2. Read any write all
  3. Write back
  4. Quorum based protocol
  

Question 903 :
A process that is based on IPC mechanism which executes on different systems and can communicate with other processes using message based communication, is called _______.

  1. Local Procedure Call
  2. Inter Process Communication
  3. Remote Procedure Call
  4. Remote Machine Invocation
  

Question 904 :
Centralize algorithm has one basic disadvantage.

  1. Single point failure
  2. Many process
  3. Not fair
  4. deadlock
  

Question 905 :
The holding (H) parameter in Raymond’s tree-based algorithm represents the process/node is _______.

  1. Holding token
  2. Executing critical region
  3. Holding information about node having path to token node
  4. Holding REQUEST messages for deferred replies
  

Question 906 :
What are the characteristics of a distributed file system?

  1. Its users, servers and storage devices are dispersed
  2. Service activity is not carried out across the network
  3. They have single centralized data repository
  4. There are multiple dependent storage devices
  

Question 907 :
If a ® b and b ® c then a ® c. This property is :

  1. Transitivity
  2. Reflexivity
  3. concurrency
  4. Irreflexivity
  

Question 908 :
The current directory contains, most of the files that are _____________

  1. of current interest to the user
  2. stored currently in the system
  3. not used in the system
  4. not of current interest to the system
  

Question 909 :
A system in which the components of an information system are distributed to multiple locations in a computer network is known as

  1. database system
  2. networked system
  3. distributed system
  4. communication system
  

Question 910 :
All communication in distributed systems is based on sending and receiving (low level) messages because of

  1. The absence of shared memory
  2. The presence of heterogeneity
  3. The absence of synchronization
  4. The presence of complexities
  

Question 911 :
Election algorithms assumes that ___________ in distributed system

  1. a unique priority number is associated with each active process in system
  2. there is no priority number associated with any process
  3. priority of the processes is not required
  4. Based on IP address
  

Question 912 :
An identifier that can be used throughout a distributed system to refer to a particular unique remote object is

  1. Remote object procedure
  2. Remote object reference
  3. Remote object syntax
  4. Remote object index
  

Question 913 :
The ring election algorithm works by:

  1. Having all nodes in a ring of processors send a message to a coordinator who will elect the leader.
  2. Sending a token around a set of nodes. Whoever has the token is the coordinator.
  3. Sending a message around all available nodes and choosing the first one on the resultant list.
  4. Building a list of all live nodes and choosing the largest numbered node in the list.
  

Question 914 :
For HDFS file system, Point out the correct statement.

  1. Each incoming file is broken into 32 MB by default
  2. Data blocks are replicated across different nodes in the cluster to ensure a low degree of fault tolerance
  3. DataNode is the slave/worker node and holds the user data in the form of Data Blocks
  4. Data blocks are replicated across different nodes in the cluster to ensure a low degree of fault tolerance
  

Question 915 :
The capability of a system to adapt the increased service load is called ___________

  1. scalability
  2. tolerance
  3. capacity
  4. polling
  

Question 916 :
When a cache entry is modified, the new value is immediately set to server for updating master copy of file which cache update policy does this feature belong .

  1. Write through cache
  2. Delayed Write
  3. Instant Write
  4. Periodic Write
  

Question 917 :
Which of the following is an example of election algorithm.

  1. Berkley Algorithm:
  2. Bully Algorithm.
  3. Cristian’s Algorithm
  4. LAMPORT’S
  

Question 918 :
In HDFS file System, A ________ serves as the master and there is only one NameNode per cluster

  1. Data Node
  2. NameNode
  3. Replication
  4. Data block
  

Question 919 :
A type of recovery mechanism which bring the system into a correct state, from which it can then continue to execute

  1. Backward
  2. Forward
  3. Middle
  4. Front
  

Question 920 :
What will happen in the single level directory?

  1. All files are contained in different directories all at the same level
  2. All files are contained in the same directory
  3. Depends on the operating system
  4. Depends on hardare
  

Question 921 :
The local operating system on the server machine passes the incoming packets to the ________.

  1. server stub
  2. client stub
  3. client operating system
  4. client process
  

Question 922 :
Which of the following statements is true?

  1. happens before is a transitive relation
  2. happens before is a symmetric relation
  3. happens before is a reflexive relation
  4. happens before is a complex relation
  

Question 923 :
In the token passing approach of distributed systems, processes are organized in a ring structure _____

  1. logically
  2. physically
  3. both logically and physically
  4. none of the mentioned
  

Question 924 :
Mapping of network file system protocol to local file system is done by ____________

  1. network file system
  2. local file system
  3. volume manager
  4. remote mirror
  

Question 925 :
Middleware called __________ for connecting independent systems together and makes them work together.

  1. Homogeneous
  2. Glue-code
  3. Heterogeneous
  4. Concurrent
  

Question 926 :
Write the event of following notations:M ~C (~P)

  1. A crash occurs after sending the completion message and printing the text.
  2. A crash happens after sending the completion message, but before the text could be printed.
  3. A crash happens before the server could do anything.
  4. The text printed, after which a crash occurs before the completion message could be sent.
  

Question 927 :
A process can enter into its critical section _______

  1. anytime
  2. when it receives a reply message from its parent process
  3. when it receives a reply message from all other processes in the system
  4. none of the mentioned
  

Question 928 :
what is the task of RPCRuntime ?

  1. It is responsible for marshaling
  2. It is responsible for retransmission
  3. It is responsible for handling exception
  4. It is responsible for syntactic transparency
  

Question 929 :
Communication layer is forced to deliver incoming messages from the same process in the same order as they have sent is called as____________.

  1. Unoredered multicast
  2. FIFO ordered multicast
  3. Casually ordered multicast
  4. Totally ordered multicasts
  

Question 930 :
____ change the state of thread from suspen

  1. run()
  2. yield()
  3. destroy()
  4. start()
  
Pages