Distributed Computing MCQ's




Question 571 :
All transport-level communication services offer only

  1. Transient communication
  2. Intransient Communication
  3. Protocol
  4. Interfaces
  

Question 572 :
Cambridge file server 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 573 :
Whatapp service uses which type of communication-

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

Question 574 :
In the Singhal's algorithm, each request is assigned _____ which determines its priority

  1. a globally unique timestamp
  2. an interrupt
  3. a counter
  4. a quartz crystal
  

Question 575 :
HDFS works in a __________ fashion.

  1. master-master
  2. master-slave
  3. slave-slave
  4. None of the above
  

Question 576 :
How QoS of stream oriented communication is achieved using best-effort delivery service:IP.

  1. By forwarding packets based on giving highest prority to time sensitive packets.
  2. By dropping all the packets when congestion occurs.
  3. By buffering maximum data at the router
  4. By giving same priority to all data packets while forwarding.
  

Question 577 :
X.500 is a

  1. directory services
  2. naming services
  3. Replication services
  4. Consistency services
  

Question 578 :
Which transparency deals with providing efficient access to the system by hiding the implementation details.

  1. Location Tranparency
  2. Access Tranparency
  3. Network Tranparency
  4. Failure Tarnsparency
  

Question 579 :
Which of the following is/are the desirable features of global scheduling algorithm. i) Process tharshing must be prevented ii)Heuristic method used for decision making iii) Prior knowledge about the processes required

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

Question 580 :
Computation of data is done in which component of SIMD

  1. Local Memory
  2. Front end Controllers
  3. Processing element
  4. Processor array
  

Question 581 :
Message queuing systems is design for __________

  1. transient communication
  2. synchronous communication
  3. tightly coupled communication
  4. loosely coupled communication
  

Question 582 :
The difference between logical and physical clocks ?

  1. Logical clocks measure the time of day and Physical clocks are used to mark relationships among events in a distributed system.
  2. Both are the same
  3. Physical clocks measure the time of day and Logical clocks are used to mark relationships among events in a distributed system.
  4. None of the mentioned
  

Question 583 :
In NFS, all client-server communication is done through

  1. RPC
  2. RMI
  3. Message Oriented Communication
  4. Streams
  

Question 584 :
For which file transfer model, cache management is harder due to the variable-length data for different access requests.

  1. File-level transfer model
  2. Block-level transfer model
  3. Byte-level transfer model
  4. Record-level transfer model
  

Question 585 :
Which one of the following hides the location where in the network the file is stored?

  1. transparent distributed file system
  2. hidden distributed file system
  3. escaped distribution file system
  4. spy distributed file system
  

Question 586 :
In distributed systems, a logical clock is associated with

  1. each instruction
  2. each process
  3. each register
  4. none of the mentioned
  

Question 587 :
This model is similar to processor consistency model with an additional restriction of memory coherence.

  1. strict consistency
  2. PRAM consistency
  3. causal consistency
  4. FIFO consistency
  

Question 588 :
A problem with the ________ protocol is that when the coordinator has crashed, participants may not be able to reach a final decision.

  1. One-phase commit
  2. Three-phase commit
  3. Two-phase commit
  4. Virtual synchrony
  

Question 589 :
_____________ is a physical clock synchronization Algorithm

  1. Cristian
  2. vector
  3. Lamport
  4. Ring
  

Question 590 :
A distributed locking protocol by which a resource can be protected against simultaneous access by a collection of processes that are distributed across-

  1. Multiple Processors
  2. Multiple Machines
  3. Shared memory
  4. Remote Procedure Call
  

Question 591 :
NFS file System uses ______Mechanism

  1. RPC
  2. CORBA
  3. RMI
  4. None of the above
  

Question 592 :
For each critical section (CS) execution, Ricart-Agrawala algorithm requires ___________ messages per CS execution and the Synchronization delay in the algorithm is ____________.

  1. 3(N − 1), T
  2. 2(N − 1), T
  3. (N − 1), 2T
  4. (N − 1), T
  

Question 593 :
In global google sysytem The user can expect query result in

  1. 0.7 seconds
  2. 0.4 seconds
  3. 0.2 seconds
  4. 0.8 seconds
  

Question 594 :
The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________

  1. assigning ready processes to CPU
  2. assigning ready processes to waiting queue
  3. assigning running processes to blocked queue
  4. assigning new processes to cpu
  

Question 595 :
A request, at the risk of server duplicating execution is _________.

  1. Never Reissue
  2. Always Reissue
  3. Reissue a request on acknoledgment
  4. Reissue a request on no acknoledgment
  

Question 596 :
_____ transparency hides that a resource may move to the another location.

  1. Access transparency
  2. Migration transparency
  3. Replication transparency
  4. Failure transparency
  

Question 597 :
A server changes from the correct flow of control______.

  1. Crash Failure
  2. Byzantine failure
  3. Response Failure
  4. Timing Failure
  

Question 598 :
The file once created can not be changed is called ________

  1. immutable file
  2. mutex file
  3. mutable file
  4. Mutual exclusive file
  

Question 599 :
The remote method invocation [RMI] _______.

  1. allows a process to invoke memory on a remote object
  2. allows a thread to invoke a remote object
  3. allows a thread to invoke memory on a remote object
  4. allows a process to invoke a method on a remote object
  

Question 600 :
In the distributed system, the goal of the task assignment approach is to assign the tasks of a process to the nodes. Consider there are two nodes n1 and n2 and four tasks {T1, T2, T3, T4,T5,T6}. Tasks T1, T2 are assigned to node n1 and tasks T3,T4, T5, T6 are assigned to node n2.Comunication cost is as given in table below. Considering serial task assignment, the communication incur will be T1, T2, T3, T4,T5,T6 T1-> 0, 6, 4, 0, 0, 12 T2-> 6, 0, 8, 12, 3, 0 T3-> 4, 8, 0, 0, 11, 0 T4=> 0, 12, 0, 0, 5, 0 T5-> 0, 3, 11, 5 , 0, 0 T6=> 12, 0, 0, 0, 0, 0

  1. 38
  2. 58
  3. 39
  4. 50
  
Pages