Distributed Computing MCQ



Question 951 : Which of the following is not a variable defined in Raymond's tree based algorithm:

  1. Holder
  2. Using
  3. Privilege
  4. Asked
  

Question 952 : NTP is __________ layer protocol.

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

Question 953 : Berkely’s and Christian’s clock synchronization methods are type of _______.

  1. Logical clock synchronization method
  2. Physical clock Synchronization method
  3. Scalar clock synchronization method
  4. Vector clock synchronization method
  

Question 954 : Process synchronization can be done on which of the following levels

  1. hardware
  2. software
  3. both hardware and software
  4. one of the mentioned
  

Question 955 : What are the characteristics of process migr

  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 an entire process or parts of it at same site
  

Question 956 : A receiver generally has its own local buffer where messages can be stored when the receiver is not executing in____

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

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

  1. Singhal‘s Heurastic Algorithm
  2. Suzuki-Kasami‘s Broadcast Algorithms
  3. Maekawa‘s Algorithm
  4. Raymond‘s Tree based Algorithm
  

Question 958 : In distributed file system, DNS stands for?

  1. Domain Name System
  2. Domain Name Server
  3. Directory name service
  4. Disk name system
  

Question 959 : Difference in precision between a prefect reference clock and a physical clock is known as________

  1. Clock drift rate
  2. Drift
  3. Skew
  4. Clock synchronization
  

Question 960 : When calling the socket primitive, the caller creates a new communication end point for a specific _________ protocol

  1. Transport
  2. Application
  3. UDP
  4. Socet
  

Question 961 : Berkeley socket is used for ____

  1. connection-less communication
  2. connection-oriented communication
  3. group communication
  4. Causal communication
  

Question 962 : 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 963 : What is Server Load Balancing (SLB)?

  1. SLB distributes servers to a group of clients and ensures that clients are not sent to failed servers.
  2. SLB distributes clients to a group of servers and ensures that clients are not sent to failed servers.
  3. SLB distributes servers to a group of clients and ensures that tasks are not sent to failed servers.
  4. SLB distributes servers to a group of clients and ensures that tasks are sent to failed servers.
  

Question 964 : The Ricart Agarwala mutual exclusion algorithm requires _______ messages per Critical Section invocation

  1. (N - 1)
  2. 3(N - 1)
  3. 2(N - 1)
  4. 5(N - 1)
  

Question 965 : In which technique, processes are reassigned at the runtime depending upon the situation that is the load will be transferred from heavily loaded nodes to the lightly loaded nodes.

  1. Task assignmnet
  2. Static load balancing
  3. Dynamic load balancing
  4. Hybrid technique.
  

Question 966 : RPC stands for

  1. Remote process communication
  2. Remote Procedure Call
  3. Reliable Process communication
  4. Reliable Procedure communication
  

Question 967 : All methods in a remote interface must be declared to throw the ------------to deal with unexpected network failure

  1. object
  2. exception
  3. method
  4. function
  

Question 968 : Load balancing is the way of distributing _______across a set of processors, which is connected to a______.

  1. Load units, network
  2. Task, network
  3. Process, LAN
  4. Task, LAN
  

Question 969 : The address of the next instruction to be executed by the current process is provided by the __________

  1. Program counter
  2. CPU registers
  3. Process stack
  4. Pipe
  

Question 970 : NFS file System uses ______Mechanism

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

Question 971 : In socket programming, client sends request to the server using which primitive?

  1. Socket
  2. Connect
  3. Send
  4. Receive
  

Question 972 : An object acting as a gateway for the client side.

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

Question 973 : A client gets a timestamp of 4:12:30.500 from a time server. The elapsed time between the request and response was 20 msec (0.020 sec). The current time on the client is 4:12:30.510. Using Cristian’s algorithm, what is the time set to on the client?

  1. 04:12:30
  2. 04:12:30
  3. 04:12:32
  4. 04:12:32
  

Question 974 : A paradigm of multiple autonomous computers, having a private memory, communicating through a computer network, is known as

  1. Distributed computing
  2. Cloud computing
  3. Centralized computing
  4. Parallel computing
  

Question 975 : 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 976 : Using extra equipments or processed either in hardware or software is______.

  1. Information redundancy
  2. Time redundancy
  3. Physical redundancy
  4. Data Redundancy
  

Question 977 : Channel omission failure is

  1. loss of messages occurs between the sending process and the outgoing message buffer.
  2. loss of messages occurs between the incoming message buffer and the receiving process.
  3. loss of messages occurs between the incoming buffer and the outgoing buffer
  4. loss of messages occurs between the incoming buffer and the system.
  

Question 978 : Which of the following is true in case of the NFS server?

  1. They are stateless
  2. They save the current state of the request
  3. They are stateful
  4. They save previous state
  

Question 979 : DNS stands for?

  1. Domain Network System
  2. Domain name System
  3. Direct Network System
  4. Direct Name System
  

Question 980 : In global google system offering application-level software over the Internet as

  1. web application
  2. user application
  3. link application
  4. system application
  

Question 981 : In RMI, the objects are passed by _____.

  1. Value
  2. Reference
  3. Value and Reference
  4. object
  

Question 982 : In ____________ all processes see only those memory reference operations in the correct order that are potentially causally related

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

Question 983 : Amazon SQS is an example of _______.

  1. RPC
  2. RMI
  3. Group communication
  4. Message Queuing System
  

Question 984 : RPC is a _________.

  1. synchronous operation
  2. asynchronous operation
  3. time independent operation
  4. channel specific operation
  

Question 985 : 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 986 : The transparency that enables multiple instances of resources to be used, is called

  1. Replication transparency
  2. Scaling transparency
  3. Concurrency transparency
  4. Performance transparency
  

Question 987 : _____is unit of allocation and _____is unit of execution

  1. Process,Thread
  2. Thread,Process
  3. Procedure,process
  4. Method,Thread
  

Question 988 : Load estimation policy is to be considered in designing ______.

  1. Co-operative algorithm
  2. Load balancing algorithm
  3. Probabilistic algorithm
  4. Static scheduling algorithm
  

Question 989 : Hide that a resource may move to another location which type of transparency is this?

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

Question 990 : 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 991 : In a distributed file system, when a file’s physical storage location changes ___________

  1. File name needs to be changed
  2. File name need not to be changed
  3. File’s host name needs to be changed
  4. File’s local name needs to be changed
  

Question 992 : Logical extension of computation migration is ___________

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

Question 993 : __________replicas are used only to improve access time on data

  1. Client initiated
  2. Server initiated
  3. Permanent
  4. Dynamic
  

Question 994 : Match the following: List – I 1. Threads 2. Single-threaded process 3. Finite-state machine List – II i. Parallelism, Non-Blocking system calls ii. Parallelism, Blocking System calls iii. No parallelism, Blocking system calls

  1. 1. (ii), 2. (iii), 3. (i)
  2. 1. (iii), 2. (i), 3. (ii)
  3. 1. (i), 2. (ii), 3. (iii)
  4. 1. (iii), 2. (ii), 3. (i)
  

Question 995 : Distributed Computing Environment (DCE), is a true _____________ system in that it is designed to execute as a layer of abstraction between existing (network) operating systems and distributed applications.

  1. Multiprocessing
  2. Middleware
  3. Top Level
  4. Operating
  

Question 996 : What are the advantages of token(with rings) passing approach ? i) One processor as coordinator which handles all requests ii) No starvation if the ring is unidirectional iii) There are many messages passed per section entered if few users want to get in section iv) One processor as coordinator which handles all requests v) Only one message/entry if everyone wants to get in

  1. i
  2. ii and iii
  3. i, ii and iii
  4. i, ii and iv
  

Question 997 : 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 998 : The collection of protocols used in a particular system is called a protocol suite or

  1. Protocol collector
  2. Protocol list
  3. Protocol stack
  4. Protocol queue
  

Question 999 : Logical extension of computation migration is

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

Question 1000 : Once failure has occurred in many cases it is important to ______critical processes to a known state in order to resume processing

  1. start
  2. stop
  3. recover
  4. pause