Distributed Computing MCQ's




Question 811 :
The sender-initiated policy is preferable at _______________ system loads. However, the receiver-initiated policy is preferable at _______________ system loads.

  1. Light to moderate, moderate
  2. Light to moderate, high
  3. Light to high, moderate
  4. Light to moderate, light
  

Question 812 :
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 813 :
RAYMOND'S TREE BASED ALGORITHM is an ___

  1. Non- token based algorithm.
  2. Token based algorithm.
  3. Centralized Based algorithm
  4. physical clock synchronization algorithm.
  

Question 814 :
Which is not possible in distributed file system?

  1. File replication
  2. Migration
  3. Client interface
  4. Remote access
  

Question 815 :
In ________________________ each node periodically sends a message to the time server.

  1. Passive Time Server Centralized Algorithm
  2. Active Time Server Centralized Algorithm
  3. Global Averaging Distributed Algorithms
  4. Localized Averaging Distributed Algorithms
  

Question 816 :
In which Mutual Exclusion algorithm each requests for critical section contains a sequence number.

  1. Raymond‘s Tree based Algorithm
  2. Lamport Algorithm
  3. Bully Algorithm
  4. Suzuki-Kasami‘s Broadcast Algorithms
  

Question 817 :
What are characteristics of process 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. Acees is done like local resources
  

Question 818 :
A client's clock reads 3:20:00. The server's clock reads 3:10:00 when they synchronize using the Berkeley algorithm. Assume message delays are negligible. What is the time at the client after synchronization?

  1. 0.135416667
  2. 0.177083333
  3. 0.21875
  4. 0.260416667
  

Question 819 :
In ________________receivers never acknowledge the successful delivery of multicast message but instead report only when missing the message.

  1. Basic reliable multicasting
  2. Non-hierarchical feedback control
  3. Hierarchical feedback control
  4. Atomic multicast
  

Question 820 :
NTP is __________ layer protocol.

  1. Application
  2. session
  3. transport
  4. physical
  

Question 821 :
File services should be provided across different operating systems and hardware platforms is called as _____.

  1. Openness
  2. Scalability
  3. Reliability
  4. Heterogeneity
  

Question 822 :
Select correct option for the message(Mi) transmission case Mi must be delivered before mj if Ti < Tj

  1. Absolute Ordering
  2. Consistent Ordering
  3. Causal Ordering
  4. total ordering
  

Question 823 :
What do you mean by RPC?

  1. Relay Procedure call
  2. Remote Process Call
  3. Remote Procedure call
  4. Remote Process Cell
  

Question 824 :
________ consistency is that write operations by the same process are performed in the correct order everywhere.

  1. Weak
  2. Strict
  3. Eventual
  4. FIFO
  

Question 825 :
____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 826 :
What are the characteristics of fully distributed approach ? I. When responses are received from all processes, then process can enter its Critical Section II. When process exits its critical section, the process sends reply messages to all its deferred requests. III. It requires request, reply and release per critical section entry IV. One processor as coordinator which handles all requests

  1. I
  2. I and III
  3. III and IV
  4. I and II
  

Question 827 :
What is global scheduling algorithms?

  1. priori knowledge of resources
  2. Dynamic in nature
  3. not scalable
  4. not stable
  

Question 828 :
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 829 :
What is process?

  1. program in main memory
  2. Program in cache memory
  3. program in execution
  4. Program in secondary memory
  

Question 830 :
A bully election algorithm:

  1. picks the first process to respond to an election request.
  2. relies on majority vote to pick the winning process.
  3. assigns the role of coordinator to the processs holding the token at the time of election.
  4. picks the process with the largest ID.
  

Question 831 :
A system with m CPUs and n processes has the following case m>n in case of task assignment approch how scheduling will takes place ?

  1. There is a need to schedule the processes on CPUs and several processes may be assigned to each CPU
  2. Some CPUs may remain idle or work on processes allocated earlier
  3. Each process is allocated to one CPU
  4. This kind of senario does not exist
  

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

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

Question 833 :
____ 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 834 :
If one thread opens a file with read privileges then ___________

  1. other threads in the another process can also read from that file
  2. other threads in the same process can also read from that file
  3. any other thread can not read from that file
  4. all of the mentioned
  

Question 835 :
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 836 :
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 837 :
__________ is computing form where heterogeneity is key advantage.

  1. Cluster computing
  2. High performance computing
  3. Grid computing
  4. Cluster - grid computing
  

Question 838 :
If an old process wants a resource held by a young process, the old one will wait happens in _______

  1. Wait-die
  2. Wound-wait
  3. Both
  4. None of the mentioned
  

Question 839 :
The value in the counter register is ____________ by 1 for each oscillation of the quartz crystal.

  1. Decremented
  2. Incremented
  3. Doubled
  4. None of the mentioned
  

Question 840 :
Message‐queuing (MQ) systems supports

  1. Transient Synchronous communication
  2. Transient asynchronous communication
  3. Persistent synchronous communication
  4. Persistent asynchronous communication
  
Pages