Distributed Computing MCQ's




Question 421 :
In Networking of Computing machine the overall power is

  1. Very less
  2. High
  3. Very high
  4. Average
  

Question 422 :
Many applications tolerate some amount of inconsistency and accept that the replicas eventually become consistent over a period of time. For example, DNS and web caches server. Which consistency model is useful in this scenario?

  1. Data-centric consistency model
  2. Client-centric consistency model
  3. Server Centric consistency
  4. Database-centric Consistency
  

Question 423 :
Cloud computing is type of

  1. Distributed embedded system
  2. Distributed information system
  3. Distributed Computing system
  4. Cluster computing
  

Question 424 :
The ______________ is used to store a constant value that is decided based on the frequency of oscillation of the quartz crystal.

  1. Counter register
  2. Quartz crystal
  3. Constant register
  4. None of the mentioned
  

Question 425 :
AFS has two unusual design characteristics:

  1. Reliability, Scalability
  2. Whole-file serving, Whole-file caching
  3. file serving, file catching
  4. security, file catching
  

Question 426 :
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 427 :
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 Identifier
  4. by sharing the same process number
  

Question 428 :
OSI stands for __________

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

Question 429 :
In RPC, while a server is processing the call, the client is blocked ____.

  1. unless the client sends an asynchronous request to the server
  2. unless the call processing is complete
  3. for the complete duration of the connection
  4. unless the server is disconnected
  

Question 430 :
What is DFS(Distributed File System)?

  1. is a file system that is distributed on multiple file servers or multiple locations
  2. is a file system that is distributed multiple times
  3. is a file system that is on centralized location
  4. is a file system that access any file
  

Question 431 :
Rate at which requests for the CR get executed is known as

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

Question 432 :
Characteristics of distributed system that allows variety of devices to be part of it is also called

  1. Heterogeneity
  2. Openness
  3. Scalability
  4. Security
  

Question 433 :
Logical extension of computation migration is ___________

  1. system migration
  2. process migration
  3. thread migration
  4. data migration
  

Question 434 :
What is NOT the characteristics of session semantics?

  1. Each client obtains a working copy from the server
  2. When file is closed, the modified file is copied to the file server
  3. The burden of coordinating file sharing is ignored by the system
  4. Easy to implement in a single processor system
  

Question 435 :
In ________________________ each node periodically sends a message to the time server.

  1. Passive Time Server Centralized Algorithm
  2. Active Time Server Centralized Algorithm
  3. Global Averaging Distributed Algorithms
  4. Localized Averaging Distributed Algorithms
  

Question 436 :
The placement of replica servers is

  1. optimization problem
  2. more of management issue
  3. consistency
  4. performance
  

Question 437 :
Fault tolerance in distributed systems is the method used for ___________.

  1. Heterogeneity
  2. Security
  3. Flexibility
  4. Reliability
  

Question 438 :
A client's clock reads 3:20:00. The server's clock reads 3:10:00 when they synchronize using Cristian's algorithm. Assume message delays are negligible. What is the time at the client after synchronization?

  1. 0.138888889
  2. 0.128472222
  3. 0.135416667
  4. 0.131944444
  

Question 439 :
In case of failure, a new transaction coordinator can be elected by _____

  1. Cristian's Algorithm
  2. Bully algorithm
  3. Both bully and Cristian's algorithm
  4. None of the mentioned
  

Question 440 :
The ____________ is used to keep track of the oscillations of the quartz crystal.

  1. Counter register
  2. Quartz crystal
  3. Constant register
  4. None of the mentioned
  

Question 441 :
IP packet is encapsulated in a

  1. data link layer
  2. physical layer
  3. network layer
  4. transport layer
  

Question 442 :
A ________ system enables a distributed system to behave like a virtual uniprocessor, even though the system operates on collection of machines

  1. DOS
  2. NOS
  3. Middleware
  4. Operating system
  

Question 443 :
UDP is an example of

  1. Persistent asynchronous communication
  2. Persistent synchronous communication
  3. Transient asynchronous communication
  4. Transient synchronous communication
  

Question 444 :
A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem.

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

Question 445 :
In Singhal's algorithm, the information structure at site consists of ___ sets

  1. request and inform
  2. request and reply
  3. inform and priority
  4. reply and priority
  

Question 446 :
Which of the following algorithm is Token Based Algorithm for Mutual Exclusion

  1. Lamport Algorithm
  2. Bully Algorithm
  3. Ricart–Agrawala‘s Algorithm
  4. Raymond‘s Tree based Algorithm
  

Question 447 :
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 sectioniv) One processor as coordinator which handles all requestsv) 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
  

Question 448 :
Which technique is not used for scheduling processes of a distributed system?

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

Question 449 :
Process synchronization can be done on which of the following levels

  1. hardware
  2. software
  3. both hardware and software
  4. BIOS
  

Question 450 :
To manage replicated data, Front end provides transperancy

  1. by hiding fact that data is replicated.
  2. by issuing requests.
  3. by ensuring about data consistency.
  4. by contacting managers.
  
Pages