Computer Distributed Computing (CDC) MCQ's




Question 181 :
Distributed OS functions on the ________ principle

  1. File Foundation
  2. Single system image
  3. Multi system image
  4. Networking image
  

Question 182 :
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 183 :
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 184 :
To what extent inconsistencies can be tolerated depends highly on the usage of a

  1. replication
  2. duplication
  3. resource
  4. data
  

Question 185 :
Consider the following set of processes, the length of the CPU burst time given in milliseconds. P1 - 6, p2 - 8, p3 -7, p4 - 3. Assuming the above process being scheduled with the SJF scheduling algorithm.

  1. The waiting time for process P1 is 3ms
  2. The waiting time for process P1 is 0ms
  3. The waiting time for process P1 is 16ms
  4. The waiting time for process P1 is 9ms
  

Question 186 :
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. Binding agent
  

Question 187 :
_____ transparency hides that a resource may move to the another location.

  1. Access transparency
  2. Migration transparency
  3. Replication transparency
  4. Failure transparency
  

Question 188 :
Following is not need of fault tolerance in distributed system.

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

Question 189 :
Middleware communication protocols support -

  1. High-level communication services
  2. Multi-level Communication Services
  3. Remote Procedure Call
  4. Interprocess communication
  

Question 190 :
DIT in Domain Name Space stands for

  1. Direct Information Transparency
  2. Directory Implicit Transfer
  3. Direct Information Token
  4. Directory Information Tree
  

Question 191 :
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 192 :
A client calls a remote procedure, the client will block until a reply is returned called as

  1. Conventional procedure calls
  2. Interprocess communication
  3. Remote Procedure Call
  4. Message Binding
  

Question 193 :
The ____- control the assignment of resources to processes

  1. task manager
  2. resource manager
  3. process manager
  4. object manager
  

Question 194 :
____________ files are read only.

  1. Mutable
  2. Immutable
  3. Setup
  4. Recursive
  

Question 195 :
if ts OP1(x) < ts OP2(y), then operation OP1(x) should Precede OP(y) in this sequence belongs to ____

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

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

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

Question 197 :
In which model, there is no distinction between the client - server process.

  1. clent-server model
  2. Master-slave model
  3. P2P Model
  4. fault model
  

Question 198 :
Which are the two complementary deadlock-prevention schemes using timestamps?

  1. The wait-die - wound-wait scheme
  2. The wait-n-watch scheme
  3. The wound-wait scheme
  4. The wait-wound - wound-wait scheme
  

Question 199 :
Which event is concurrent with the vector clock (2, 8, 4)?

  1. (3,9,5)
  2. (3,8,4)
  3. (1,7,3)
  4. (4,8,2)
  

Question 200 :
MPI_bsend is equivalent to _____.

  1. One way RPC
  2. Two wayRPC
  3. Synchronous RPC
  4. Asynchronous RPC
  

Question 201 :
Type of grid computing is

  1. Collaborative Grid
  2. System Grid
  3. Process Grid
  4. Channel grid
  

Question 202 :
Andrew File system was designed by ___________.

  1. Mr. Peter Andrew
  2. Professor M. Satyanarayanan
  3. Professor James Andrew
  4. Google
  

Question 203 :
The _____ model is required in order to build systems with predictable behavior in case of fault

  1. Interaction model
  2. Fault model
  3. Architectural model
  4. Security model
  

Question 204 :
NFS file System uses ______Mechanism

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

Question 205 :
Using extra equipments or processed either in hardware or software is______.

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

Question 206 :
Following is not a agreement to ensure consistency.

  1. 2PC
  2. 3PC
  3. Paxos
  4. P2P
  

Question 207 :
A single NFS write procedure ____________

  1. can be atomic
  2. is atomic
  3. is non atomic
  4. is automatic
  

Question 208 :
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 209 :
What are the characteristics of data 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 an entire process or parts of it at same site
  

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

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