Distributed Computing MCQ

Question 51 : When a process is splited into pieces, it is called as-

  1. Tasks
  2. Program
  3. Processors
  4. Routines

Question 52 : Which of the following algorithms is less sensitive to crashes.

  1. Centralized
  2. Decentralized
  3. Distributed
  4. Token ring

Question 53 : A middleware layer between the stub skeleton and transport.

  1. remote layer
  2. instruction layer
  3. reference layer
  4. remote reference layer

Question 54 : In ----- Any read on a data item x returns a value corresponding to the results of the most recent write on x

  1. Strict consistency
  2. Linear consistency
  3. Sequential consistency
  4. parallel consistency

Question 55 : In Singal's algorithm, the manner In which cardinality decreases, leads to a ___ pattern, topologically.

  1. mesh
  2. ring
  3. stepwise
  4. staircase

Question 56 : What are characteristics of Naming and Name resolution ?

  1. name systems in the network
  2. address messages with the process-id
  3. virtual circuit
  4. message switching

Question 57 : Distributed Mutual Exclusion Algorithm does not use

  1. Coordinator process
  2. Token
  3. Logical clock for event ordering
  4. Request and Reply messages

Question 58 : Maekawa's algorithm doesn’t require ____ to handle deadlocks

  1. FAILED message
  2. INQUIRE message
  3. PRIORITY message
  4. YIELD message

Question 59 : Which Distributed System Model deals with Communication?

  1. Security Model
  2. Fault Model
  3. Interaction Model
  4. Architecture Model

Question 60 : Processes do not communicate with each other and creates their own check points.

  1. User Triggered
  2. Uncoordinated check points
  3. Coordinated check points
  4. Message based check pointing.

Question 61 : 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 62 : 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 63 : What are the characteristics of processor in distributed system?

  1. They are same in size
  2. They are manufactured with single purpose
  3. They vary in size and function
  4. They are same in function

Question 64 : ___algorithm for coordinator election assumes that no process can fail during the election procedure until the new coordinator has been selected.

  1. bully algorithm
  2. Ring algorithm
  3. Lamport algorithm
  4. Suzuki Kasami algorithm

Question 65 : _____ implies that the user need not be aware whether the resource is in volatile memory or on the disk.

  1. Relocation Transparency
  2. Location Transparency
  3. Migration Transparency
  4. Persistence Transparency

Question 66 : Which of the following is not comes under Dependability

  1. Availability
  2. Reliability
  3. Maintainability
  4. Redundancy

Question 67 : Network operating system runs on ______

  1. Server of the network
  2. Every system in the network
  3. Both server and every system in the network
  4. Neigher on server nor on every sysyem in the network

Question 68 : In the instruction ADD A, B, the answer gets stored in ___________

  1. B
  2. A
  3. Buffer
  4. C

Question 69 : Which mutual exclusion algorithm is useful when the membership of the group is unknown?

  1. Centralized
  2. Lamport’s.
  3. Token ring
  4. Decentralized Algorithm

Question 70 : An architecture where clients first communicate the server for data then format and display it to the users, is known as ___________

  1. Client/Server architecture
  2. Three-tier architecture
  3. Two-tier architecture
  4. Peer-to-Peer architecture

Question 71 : The characteristics of NFS protocol are i. Search for file within directory ii.Read a set of directory entries iii. Manipulate links and directories From given options, which one is true?

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

Question 72 : What is key idea to select coordinator in Bully Algorithm?

  1. Select process with highest ID
  2. Select process with lowest ID
  3. Any process who identified that coordinator is failed
  4. Random

Question 73 : ________consistency is fine if clients always access the same replica.

  1. Data-centric
  2. Client centric
  3. Eventual
  4. Entry

Question 74 : 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 75 : Writes by a single process are seen by all other processes in the order in which they were issued; however, writes from different processes may be seen in different orders by different processes.”, above statement defines which consistency model?

  1. Causal Consistency Model
  2. FIFO consistency Model
  3. Sequential Consistency Model
  4. Strict consistency Model

Question 76 : Session file sharing semantics are suitable for caching

  1. complete folder
  2. complete file
  3. One byte
  4. one block

Question 77 : What is WPA?

  1. wi-fi protected access
  2. wired protected access
  3. wired process access
  4. wi-fi process access

Question 78 : In RMI, packing and unpacking of data into message in done by -

  1. client and server
  2. stub
  3. skeleton
  4. stub and skeleton

Question 79 : Server checking whether file is updated in cache or not before using it is known as_____.

  1. Client Validation
  2. Server Validation
  3. Client updating
  4. Server Updating

Question 80 : The technique that increases the system’s productivity.

  1. multiprogramming
  2. multitasking
  3. multiprocessing
  4. single-programming

Question 81 : You are synchronizing your clock from a time server using NTP and observe the following times: [4 points] a. timestamp at client when the message leaves the client: 6:22:15.100 b. timestamp at which the server receives the message: 7:05:10.700 c. timestamp at which the server sends the reply: 7:05:10.710 d. timestamp at client when the message is received at client: 6:22:15.250 To what value do you set the client's clock?

  1. 07:05:11
  2. 08:05:11
  3. 09:05:11
  4. 10:05:11

Question 82 : X.500 is a series of ________________ covering electronic directory services.

  1. system standards
  2. networking standards
  3. computer networking standards
  4. operating system standards

Question 83 : In Suzuki-Kasami's mutual exclusion algorithm, synchronization delay is ______. (T is time unit)

  1. 0 or T
  2. 1 or 2T
  3. 3T
  4. 4T

Question 84 : What is true about asynchronous communication

  1. in asynchronous communication most of the time there is no reply from the reciever end
  2. Sender and reciver process need to be active at the time of communication
  3. it uses procedure calling at the server's side
  4. in asynchronous communication there is always a reply from the reciever end

Question 85 : Replication should be used when which of the following exist?

  1. When transmission speeds and capacity in a network prohibit frequent refreshing of large tables.
  2. When using many nodes with different operating systems and DBMSs and database designs.
  3. The application's data can be somewhat out-of-date.
  4. When using some nodes with selected operating system.

Question 86 : In X.500 the user interface program for access to one or more DSAs is a ___________________.

  1. Directory User Agent
  2. System User Agent
  3. Network User Agent
  4. World User Agent

Question 87 : Match the following State Information Exchange Policy: List – I 1. Periodic Broadcast 2. Broadcast when the state will change 3. On Demand Exchange List – II i. A node broadcast its state information request message when it change its state to overloaded or underloaded region ii. Each node broadcast its state information after the lapse of every t unite of time iii. A node broadcast its state information when it is in overloaded or underloaded region

  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 88 : With multiprogramming ______ is used productively.

  1. time
  2. space
  3. money
  4. ready

Question 89 : 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,T2,T3 are assigned to node n1 and tasks 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, 16, 44, 0 T2->16, 0, 48, 90 T3-> 44, 48, 0, 0 T4-> 0, 90, 0, 0

  1. 90
  2. 60
  3. 95
  4. 56

Question 90 : In distributed systems, what will the transaction coordinator do?

  1. starts the execution of transaction
  2. breaks the transaction into number of sub transactions
  3. coordinates the termination of the transaction
  4. all of the mentioned

Question 91 : Which multicast delivers messages so that potential causality between different messages is preserved

  1. Unordered multicasts
  2. FIFO-ordered multicasts
  3. Causally-ordered multicasts
  4. Totally-ordered multicasts

Question 92 : If timestamps of two events are same, then the events are ____

  1. concurrent
  2. non-concurrent
  3. monotonic
  4. non-monotonic

Question 93 : 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 94 : What are the characteristics of tightly coupled system ? i) Different clock ii) Use communication links iii) Same clockiv) Distributed systems

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

Question 95 : Which communication model uses the queuing model?

  1. RPC
  2. RMIu
  3. MOM
  4. MPI

Question 96 : A layer which is the binary data protocol layer.

  1. stub layer
  2. skeleton layer
  3. remote layer
  4. transport protocol

Question 97 : A thread shares its resources(like data section, code section, open files, signals) with ___________

  1. other process similar to the one that the thread belongs to
  2. other threads that belong to similar processes
  3. other threads that belong to the same process
  4. different threads that belong to the different process

Question 98 : How is access to resources of various machines is done?

  1. Remote logging using ssh or telnet
  2. Zone are configured for automatic access
  3. FTP is not used
  4. FTP is used

Question 99 : Which policy determines when it will be necessary to transfer the process from one node to another?

  1. Selection policy
  2. Transfer policy
  3. Location policy
  4. Information policy

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

  1. Andrew File System
  2. Network File System
  3. Hadoop Distributed File System
  4. Fast File System