Distributed Computing MCQ's




Question 211 :
_________ class contains an implementation of a proxy.

  1. client
  2. server
  3. RMI
  4. object
  

Question 212 :
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 213 :
Absolute time ordering of all shared accesses matters in

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

Question 214 :
An additional time that is used to deliver the service of a system or multiple executions of an operation is ______.

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

Question 215 :
Arbitrary failure may ouccur in form of

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

Question 216 :
Communication channels may suffer through

  1. protocol
  2. transport
  3. arbitrary failures
  4. reliable communication
  

Question 217 :
What of the following system is not multi-processor system?

  1. A system with multiple CPU, each CPU contains a single core.
  2. A system with a single CPU that has two core.
  3. A system with multiple CPU, each CPU contains two cores.
  4. A system with a single CPU that has a single core.
  

Question 218 :
A group server is responsible for_______ - ________ groups

  1. clean and deduct
  2. program and make funtional
  3. create and destroy
  4. advance and fail
  

Question 219 :
What is the disadvantage of the two level directory structure?

  1. it does not solve the name collision problem
  2. it solves the name collision problem
  3. it does not isolate users from one another
  4. it isolates users from one another
  

Question 220 :
The file once created can not be changed is called ___________

  1. Rigid file
  2. REX file
  3. Immutable file
  4. Robust file
  

Question 221 :
The protocols defined by X.500 include

  1. DISP,DOP
  2. TCP,IP
  3. ISO,OSI
  4. IP
  

Question 222 :
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 223 :
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 224 :
Which of the following two operations are provided by the IPC f

  1. write - delete message
  2. delete - receive message
  3. send - delete message
  4. receive - send message
  

Question 225 :
For proper synchronization in distributed systems _____

  1. prevention from the deadlock is must
  2. prevention from the starvation is must
  3. prevention from the deadlock - starvation is must
  4. none of the mentioned
  

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

  1. Bankers algorithm
  2. Resource Allocation Graph
  3. Semaphores
  4. Phishing
  

Question 227 :
If a and b are two events within the same process and a occurs before b, then clock of a is always _______then clock of b

  1. lesser
  2. greater
  3. equal
  4. Cant say
  

Question 228 :
A bully election algorithm:

  1. picks the first process to respond to an election request.
  2. relies on majority vote to pick the winning process.
  3. assigns the role of coordinator to the processs holding the token at the time of election.
  4. picks the process with the largest ID.
  

Question 229 :
Which of the following technique is not used for scheduling processes in Distributed System?

  1. Load balancing approach
  2. Task assignment approach
  3. Load sharing approach
  4. FCFS approach
  

Question 230 :
Berkeley socket is used for ____

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

Question 231 :
Message passing system allows processes to __________

  1. communicate with one another without resorting to shared dat
  2. communicate with one another by resorting to shared data
  3. share data
  4. name the recipient or sender of the message
  

Question 232 :
Agreement algorithms have which assumptions________.

  1. Synchronous
  2. Communication delay is bounded or not
  3. Message delivery is ordered or not
  4. Asynchronous
  

Question 233 :
How the processes are organized in a ring structure, in case of token passing approach of distributed systems?

  1. Logically
  2. Physically
  3. Both logically and physically
  4. Randomly
  

Question 234 :
Which failures Response lies outside a specified time interval

  1. Timing Failure
  2. Omission failure
  3. Crash Failure
  4. Arbitrary Failure
  

Question 235 :
A process is already split into pieces, called________________.

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

Question 236 :
A centralized mutual exclusion algorithm requires ___ messages per entry/exit

  1. 1
  2. 2
  3. 3
  4. 4
  

Question 237 :
An RPC (remote procedure call) is initiated by the _____.

  1. server
  2. client
  3. client after the sever
  4. a third party
  

Question 238 :
Which layer is the layer closest to the transmission medium ?

  1. Physical
  2. Data link
  3. Network
  4. Transport
  

Question 239 :
In Cristian algorithm the time sever is ____

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

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

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