Computer Distributed Computing (CDC) MCQ's




Question 1 :
Brain of computer is ____________

  1. Control unit
  2. Arithmetic and Logic unit
  3. Central Processing Unit
  4. Memory
  

Question 2 :
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 3 :
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 4 :
OSI stands for __________

  1. open system interconnection
  2. operating system interface
  3. optical service implementation
  4. open service Internet
  

Question 5 :
In a distributed file system, _______ is mapping between logical and physical objects.

  1. client interfacing
  2. naming
  3. migration
  4. heterogeneity
  

Question 6 :
What is the mounting of file system?

  1. crating of a filesystem
  2. deleting a filesystem
  3. attaching portion of the file system into a directory structure
  4. removing the portion of the file system into a directory structure
  

Question 7 :
A typical __________ program obtains a remote reference to one or more remote objects on a server and then invokes methods on them.

  1. a) Server
  2. b) Client
  3. c) Thread
  4. d) Concurrent
  

Question 8 :
In a nutshell, what Birrell and Nelson suggested was allowing programs to call procedures located on other machines related to

  1. RPC
  2. IPC
  3. PROTOCOL
  4. BINDING
  

Question 9 :
Maekawa’s algorithm is a ___________ mutual exclusion algorithm.

  1. Token-based
  2. Voting-based
  3. Non-token based
  4. Tree-based
  

Question 10 :
In physical clocks, the clock tick can be produced by the following-

  1. Interrupt
  2. Signal
  3. Monitors
  4. registers
  

Question 11 :
The local operating system on the server machine passes the incoming packets to the ___________

  1. Server stub
  2. Client stub
  3. Client operating system
  4. Client process
  

Question 12 :
A message broker acts as an application-level gateway in a ________

  1. Message-queuing system.
  2. RPC
  3. IPC
  4. Message Streaming System
  

Question 13 :
Mapping of file is managed by ____________

  1. file metadata
  2. page table
  3. virtual memory
  4. file system
  

Question 14 :
Which of the following do not belong to queues for processes?

  1. Job Queue
  2. PCB queue
  3. Device Queue
  4. Ready Queue
  

Question 15 :
IPv6 address is

  1. 32 bits
  2. 48 bits
  3. 128 bits
  4. 16 bits
  

Question 16 :
Lamport’s algorithm is used for __________synchronization

  1. Deadlock
  2. Physical Clock
  3. Logical Clock
  4. Election process
  

Question 17 :
Which of the following are models of middleware that are belong to distributed object technology.

  1. RPC - RMI
  2. RPC - CORBA
  3. MOM - RMI
  4. RMI - CORBA
  

Question 18 :
In the token passing approach of distributed systems, processes are organized in a ring structure _____

  1. logically
  2. physically
  3. both logically and physically
  4. Conceptually
  

Question 19 :
In distributed systems, transaction coordinator

  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 20 :
The strongest form of memory coherence model, having the most stringent consistency requirement

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

Question 21 :
Two types of subscriptions present for replication is _____________

  1. push and pull
  2. throw and pull
  3. push and throw
  4. Pull and throw
  

Question 22 :
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 23 :
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 24 :
The capability of a system to adapt the increased service load is called ___________

  1. scalability
  2. tolerance
  3. capacity
  4. polling
  

Question 25 :
Only one node can be in possession of the privilege (called the privileged node) at any time, except when the privilege is in transit from one node to another in the form of a PRIVILEGE message. This is true for which mutual exclusion algorithm?

  1. Richart Agrawala's algorithm
  2. Maekawa's algorithm
  3. Lamport’s algorithm
  4. Raymond Tree based algorithm
  

Question 26 :
Storing file in________ makes it permanently available

  1. Secondary Memory
  2. RAM
  3. Register
  4. DRAM
  

Question 27 :
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 28 :
The ___________ layer, which provides the interface that client and server application objects use to interact with each other.

  1. increasing
  2. count
  3. stub/skeleton
  4. bit
  

Question 29 :
What are the 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. execute limited portion of data
  

Question 30 :
What are the advantages of token(with rings) passing approach ?i) One processor as coordinator which handles all requestsii) No starvation if the ring is unidirectionaliii) 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
  
Pages