Distributed Computing MCQ

Question 151 : What do you mean by RPC?

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

Question 152 : Logical extension of computation migration is

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

Question 153 : In RPC, array is passed from client to server using

  1. Call by value
  2. call by reference
  3. call-by-copy/restore
  4. None of the above

Question 154 : Match the following Priority Assignment Policy: List – I 1. Selfih Rule 2. Altruistic Rule 3. Intermediate Rule List – II i. Priorities of processes are dependent on the number of local and remote processes at connected node ii. Remote processes are given higher priority over local processes iii. Local processes are given higher priority over remote processes

  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 155 : In______computing, underlying hardware consists of a collection of similar workstations or PCs closely connected by means of a high-speed local-area network and each node runs the same operating system.

  1. mobile computing
  2. cloud computing
  3. cluster computing
  4. Peer-to-peer computing

Question 156 : 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}. Tasks T1 are assigned to node n1 and tasks T2,T3,T4 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 T1-> 0, 6, 4, 0 T2-> 6, 0, 8, 10 T3-> 4, 8, 0, 0 T4=> 0, 10, 0, 0

  1. 18
  2. 22
  3. 15
  4. 10

Question 157 : Characteristics of distributed system that allows variety of devices to be part of it is also called

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

Question 158 : In Erasure correction approach a missing packet is constructed from

  1. other successfully delivered packets
  2. last delivered packet
  3. first packet
  4. retransmitting packets

Question 159 : Which cache location gives Maximum performance gain for file systems

  1. Server’s main memory
  2. Client’s main memory
  3. Server’s Disk
  4. Client’s disk

Question 160 : When a file appear to the file server as an ordered sequence of records then mention file model to which it belongs.

  1. Structured File Model
  2. Unstructured File Model
  3. Mutable File Model
  4. Immutable File Model

Question 161 : File caching is done _____________.

  1. To made file available
  2. To make faster access
  3. For transparent access
  4. For Mobile access

Question 162 : 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 163 : OSI has ___ layers.

  1. 4
  2. 5
  3. 6
  4. 7

Question 164 : The Ricart & Agrawala distributed mutual exclusion algorithm is:

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

Question 165 : 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 166 : _______is the ability of system to provide a service, even in the presence of errors

  1. Replication
  2. Fault tolerance
  3. concurrency
  4. Consistency

Question 167 : In which the access takes place when different processes try to access the same data concurrently and the outcome of the execution depends on the specific order, is called

  1. dynamic condition
  2. race condition
  3. essential condition
  4. critical condition

Question 168 : The type of communication where the sender is blocked until its message is stored in a local buffer at the receiving host, or actually delivered to the receiver.

  1. Transient communication
  2. Persistent communication
  3. Synchronous communication
  4. Asynchronous communication

Question 169 : In Cristian algorithm the time sever is ____

  1. Passive
  2. Active
  3. Some internal passive some interval active
  4. None of the mentioned

Question 170 : Which one of the following is not shared by threads?

  1. program counter
  2. stack register
  3. program counter and stack
  4. register

Question 171 : A type of consistency model in which shared data can be counted on to be consistent only after a synchronization is done

  1. Weak consistency
  2. Sequential consistency
  3. Casual consistency
  4. Strict consistency

Question 172 : A type of middleware that allows for between the built-in applications and the real-time OS?

  1. Firmware
  2. Embedded Middleware
  3. Database middleware
  4. Portals

Question 173 : Preemptive Shortest Job First scheduling is sometimes called ___

  1. Fast SJF scheduling
  2. EDF scheduling – Earliest Deadline First
  3. HRRN scheduling – Highest Response Ratio Next
  4. SRTN scheduling – Shortest Remaining Time Next

Question 174 : The method(s) that is/are used for backward recovery in distributed computing is ______.

  1. Checkpoint
  2. Message Logging
  3. Checkpoint and message logging
  4. Recovery Point

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

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

Question 176 : Which of the following is not an advantage of multiprocessor systems

  1. Increased throughput
  2. Economy of scale
  3. Increased reliability
  4. Optimise the program size

Question 177 : Suppose that two processes detect the demise of the coordinator simultaneously and both decide to hold an election using the bully algorithm. What happens?

  1. Each of the higher-numbered processes will get two ELECTION messages, but will ignore the first one. The election will proceed as usual
  2. Each of the lower-numbered processes will get two ELECTION messages, but will ignore the first one. The election will proceed as usual
  3. Each of the lower-numbered processes will get two ELECTION messages, but will ignore the second one. The election will proceed as usual
  4. Each of the higher-numbered processes will get two ELECTION messages, but will ignore the second one. The election will proceed as usual

Question 178 : Which mutual exclusion algorithm works when the membership of the group is unknown?

  1. Centralized.
  2. Ricart-Agrawala.
  3. Lamport.
  4. Token Ring.

Question 179 : What are not the characteristics of a DFS?

  1. login transparency and access transparency
  2. Files need not contain information about their physical location
  3. No Multiplicity of users
  4. No Multiplicity if files

Question 180 : 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 181 : What are the advantages of file replication?

  1. Improves availability &performance
  2. Decreases performance
  3. Improves consistency
  4. Improves speed

Question 182 : A system is fault tolerant if it can continue to operate in the __________________

  1. presence of failures
  2. absence of failures
  3. presence of replication
  4. absence of replication

Question 183 : When high priority task is indirectly preempted by medium priority the scenario is called

  1. priority inversion
  2. priority removal
  3. priority exchange
  4. priority modification

Question 184 : If a server was executing along running RPC computation and during the execution it comes to know that a clent has crashed then such calls are called as_______.

  1. Duplicate call
  2. Extra call
  3. Orphan RPC call
  4. Orphan RMI call

Question 185 : In Casual consistency model all processes shared accesses in

  1. random order
  2. same order
  3. sequential order
  4. specific order

Question 186 : Which one of the following is a distributed file system?

  1. andrew file system
  2. server file system
  3. newer network
  4. dc file system

Question 187 : ______ cover the case of dealing with arbitrary failures by process Q, yet these failures are benign: they cannot do any harm.

  1. Fail-stop failures
  2. Fail-noisy failures
  3. fail-silent failures
  4. Fail-safe failures

Question 188 : The ----------- of distributed system is determined primarily by the degree to which new resource- sharing services can be added and be made available for use by a variety of client programs

  1. Openness
  2. Resource Sharing
  3. Transparency
  4. Scalability

Question 189 : System that provides access to the resources irrespective of their location is called ______

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

Question 190 : The Raymond's algorithm doesn’t provide which of the following guarantees:

  1. mutual exclusion is guaranteed
  2. deadlock is impossible
  3. starvation is impossible.
  4. The delay is impossible

Question 191 : When resources have multiple instances ________ is used for deadlock Avoidance.

  1. Bankers algorithm
  2. Resource Allocation Graph
  3. Semaphores
  4. All of these

Question 192 : Which of the following is an transport layer protocol?

  1. DNS
  2. TCP
  3. RMI
  4. SONET

Question 193 : Arbitrary failure may ouccur in form of

  1. duplicate message
  2. protocol
  3. reliable communication
  4. address spacde

Question 194 : 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. 03:15:00
  2. 04:15:00
  3. 05:15:00
  4. 06:15:00

Question 195 : Which Consistency is used to guarantee that users of a network newsgroup see a posting of a reaction to an article only after they have seen the original article

  1. Read-your-writes
  2. Monotonic-writes
  3. Monotonic-Reads
  4. Writes-follow-reads

Question 196 : In Suzuki Kasami algorithm, __________ is guaranteed because there is only one token in the system and a site holds the token during the CS execution.

  1. Mutual Exclusion
  2. Performance
  3. Stability
  4. Scalability

Question 197 : Which of the given statements is false?

  1. Message Passing Interface(MPI) provides buffering service.
  2. Socket programming provides transient asynchronous communication.
  3. Message Passing Interface(MPI) is more advanced than socket programming
  4. Message Passing Interface(MPI) provides transient asynchronous communication.

Question 198 : Two clocks are said to be synchronized at a particular instance of time if the difference in time values of the two clocks is less than some specified constant. The difference in time values of two clocks is called ___________

  1. Clock Frequency
  2. Clock drift
  3. Clock skew
  4. Clock Ticks

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

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

Question 200 : 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