Computer Distributed Computing (CDC) MCQ's




Question 241 :
Channel omission failure is

  1. loss of messages occurs between the sending process and the outgoing message buffer.
  2. loss of messages occurs between the incoming message buffer and the receiving process.
  3. loss of messages occurs between the incoming buffer and the outgoing buffer
  4. loss of messages occurs between the incoming buffer and the system.
  

Question 242 :
A system in which the components of an information system are distributed to multiple locations in a computer network is known as

  1. database system
  2. networked system
  3. distributed system
  4. communication system
  

Question 243 :
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 244 :
What are the characteristics of fully distributed approach ? I. When responses are received from all processes, then process can enter its Critical Section II. When process exits its critical section, the process sends reply messages to all its deferred requests. III. It requires request, reply and release per critical section entry IV. One processor as coordinator which handles all requests

  1. I
  2. I and III
  3. III and IV
  4. I and II
  

Question 245 :
Which set of events is concurrent (all events are concurrent with each other)?

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

Question 246 :
Which of the following is an example of election algorithm.

  1. Berkley Algorithm:
  2. Bully Algorithm.
  3. Cristian’s Algorithm
  4. LAMPORT’S
  

Question 247 :
In GFS, Chunk replicas are created for three reasons: ___________________

  1. chunk creation, re-replication, and rebalancing
  2. chunk deletion, re-replication, and rebalancing
  3. chunk creation, re-replication, and resharing
  4. chunk creation, chunk deletion, and rebalancing
  

Question 248 :
Data replication, where the same data is stored

  1. on single storage device
  2. on multiple storage devices
  3. on storage area network
  4. on distributed environment
  

Question 249 :
When a cache entry is modified, the new value is immediately set to server for updating master copy of file which cache update policy does this feature belong .

  1. Write through cache
  2. Delayed Write
  3. Instant Write
  4. Periodic Write
  

Question 250 :
______hides differences in data representation and the way an object can be accessed

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

Question 251 :
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 252 :
Another layer between distributed and network operating system is _________ operating system

  1. Middleware
  2. Interprocess
  3. Firmware
  4. Application
  

Question 253 :
The NFS servers

  1. are stateless
  2. save the current state of the request
  3. maybe stateless
  4. statefull
  

Question 254 :
MPI and sockets are examples of

  1. Message oriented transient communication
  2. message oriented persistent communication
  3. Mobile Oriented Communication
  4. Object oriented permanent Communication
  

Question 255 :
The time interval between critical region (CR)exit - new entry by any process is called ................

  1. System throughput
  2. Message complexity
  3. Synchronization delay
  4. Response time
  

Question 256 :
What will happen in the single level directory?

  1. All files are contained in different directories all at the same level
  2. All files are contained in the same directory
  3. Depends on the operating system
  4. Depends on hardare
  

Question 257 :
In which pipeline ,the data between adjacent stages is controlled by handshaking protocol.

  1. Blocking pipeline
  2. Non-blocking pipeline
  3. Asynchronous pipeline
  4. Synchronous pipeline
  

Question 258 :
What is common problem found in distributed system ?

  1. Process Synchronization
  2. Communication synchronization
  3. Deadlock problem
  4. Power failure
  

Question 259 :
Message passing provides a mechanism to allow processes to communicate and to synchronize their actions ________

  1. By sharing the same address space
  2. without sharing the same address space
  3. by sharing the same process number and Process Identifier
  4. By sharing port number
  

Question 260 :
Select NON-token-based algorithm from the options below.

  1. Suzuki–Kasami’s Broadcast Algorithm
  2. Singhal’s Heuristic Algorithm
  3. Raymond’s Tree-Based Algorithm
  4. Ricart–Agrawala Algorithm
  

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

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

Question 262 :
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. none of the mentioned
  

Question 263 :
The ______ is used to provide security to the shared resources, processes - channels used for their interactions.

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

Question 264 :
What is the other name for object middleware?

  1. Object request interface
  2. Object Request broker
  3. Object enabled broker
  4. Object enabled interface
  

Question 265 :
In which type of failures we assume that communication links are nonfaulty, but that process P cannot distinguish crash failures from omission failures

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

Question 266 :
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 267 :
If an old process wants a resource held by a young process, the old one will wait happens in _______

  1. Wait-die
  2. Wound-wait
  3. Both
  4. wait-wound-wait
  

Question 268 :
The process initiated by a method invocation, which may result in further invocations on methods in other objects is called

  1. A creation
  2. An action
  3. A reaction
  4. An invitation
  

Question 269 :
In mutual exclusion algorithm, number of messages per Critical Section invocation should be_________.

  1. minimized
  2. Maximized
  3. Remain same
  4. monotonic
  

Question 270 :
What is common problem found in distributed system ?

  1. Process Synchronization
  2. Communication synchronization
  3. Deadlock problem
  4. Power failure
  
Pages