Distributed Computing MCQ



Question 451 : In ______ System any communication between the processors takes place through the shared memory.

  1. Tightly Coupled system
  2. Loosely Coupled System
  3. Middleware System
  4. Scientific System
  

Question 452 : What is close group in group communication?

  1. Only members can send messages to the group as a whole
  2. processes that are not members (clients) can send message to the group.
  3. the idea of groups is to support replicated servers
  4. processes that are not members (clients) but close to the group can send message to the group.
  

Question 453 : An external time source that is often used as a reference for synchronizing computer clocks with real time is the __________

  1. Universal Centralized Time
  2. Unique Coordinated Time
  3. Unique Centralized Time
  4. Universal Coordinated Time
  

Question 454 : It Places replicas one by one each time exhaustively evaluating all possible locations.

  1. Greedy Approach for replica Management.
  2. Hotspot for replica Management.
  3. Sequential Replica Management
  4. Parallel Replica Management
  

Question 455 : The Lamport’s mutual exclusion algorithm requires _______ messages per Critical Section invocation

  1. (N - 1)
  2. 3(N - 1)
  3. 2(N - 1)
  4. 5(N - 1)
  

Question 456 : Which of the following is not a distributed computing model?

  1. Processor-pool model
  2. Workstation server model
  3. Failure model
  4. peer-to-peer
  

Question 457 : In distributed systems, election algorithms assumes that ____________

  1. a unique priority number is associated with each active process in system
  2. there is no priority number associated with any process
  3. priority of the processes is not required
  4. process work without number
  

Question 458 : IDLs describe an interface in a ----------- way

  1. language-dependent
  2. language-independent
  3. language oriented
  4. language specified
  

Question 459 : Logical extension of computation migration is ___________

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

Question 460 : The ring election algorithm works by:

  1. Having all nodes in a ring of processors send a message to a coordinator who will elect the leader.
  2. Sending a token around a set of nodes. Whoever has the token is the coordinator.
  3. Sending a message around all available nodes and choosing the first one on the resultant list.
  4. Building a list of all live nodes and choosing the largest numbered node in the list.
  

Question 461 : A distributed system is defined as a collection of autonomous computers linked by a network with software designed to produce an integrated computing facility.

  1. True
  2. False
  

Question 462 : Hide that a resource may be moved to another location while in use

  1. Relocation transparency
  2. migration transparency
  3. location transparency
  4. Replication transparency
  

Question 463 : Google is a _______based corporation

  1. Japan
  2. US
  3. Rasia
  4. UK
  

Question 464 : In distributed systems, election algorithms assumes that _____

  1. a unique priority number is associated with each active process in system
  2. there is no priority number associated with any process
  3. priority of the processes is not required
  4. none of the mentioned
  

Question 465 : which Layer is not part of Grid Computing

  1. Fabric Layer
  2. Data link Layer
  3. Collective Layer
  4. Resource Layer
  

Question 466 : Method invocations between objects in the same process are

  1. Static method invocations
  2. Dynamic method invocations
  3. Local method invocations
  4. Temporal method invocations
  

Question 467 : 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 468 : 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 469 : The calls, whose caller has expired due to node crash, is known as _____.

  1. orphan
  2. dead
  3. alive
  4. request
  

Question 470 : Electronic Health Care Systems are examples of _________ Systems.

  1. Distributed Computing
  2. Distributed Information
  3. Distributed pervasive
  4. Distributed Database
  

Question 471 : In which algorithm, One process is elected as the coordinator.

  1. Distributed mutual exclusion algorithm
  2. Centralized mutual exclusion algorithm
  3. Token ring algorithm
  4. None of the mentioned
  

Question 472 : A process can be ___________

  1. single threaded
  2. tripalthreaded
  3. single threaded and multithreaded
  4. doublethreaded
  

Question 473 : Which Data consistency model states "Writes done by a single process are seen by all other processes in the order in which they were issued but writes form different processes may be seen in a different order by different processes"

  1. Weak consistency
  2. Sequential consistency
  3. FIFO consistency
  4. Strict consistency
  

Question 474 : Which is not the ways mounting of the file system?

  1. Boot mounting
  2. Auto mounting
  3. Explicit mounting
  4. Copy mounting
  

Question 475 : The example of persistent communication is

  1. Email
  2. Network communication
  3. file transfer
  4. sending messages
  

Question 476 : In case of good process migration mechanism, _______________ means failure of any node other than the one on which the process is running should not affect the execution of process.

  1. Robustness
  2. Efficiency
  3. Transparent
  4. Interference
  

Question 477 : The sender-initiated policy is preferable at _______________ system loads. However, the receiver-initiated policy is preferable at _______________ system loads.

  1. Light to moderate, moderate
  2. Light to moderate, high
  3. Light to high, moderate
  4. Light to moderate, light
  

Question 478 : In tokens, the primary function of the sequence number is _____

  1. to decide the priority
  2. to decide the sequence of processes
  3. to distinguish between low priority and high priority requests
  4. to distinguish between old and current requests
  

Question 479 : In all reliable multicast group communication ______

  1. n' response expected from the receiver
  2. response from any of the receiver required
  3. response from 'm'(1
      

Question 480 : Replication should be used when which of the following exist?

  1. When transmission speeds and capacity in a network prohibit frequent refreshing of large tables.
  2. When using many nodes with different operating systems and DBMSs and database designs.
  3. The application's data can be somewhat out-of-date.
  4. When using some nodes with selected operating system.
  

Question 481 : Storing a separate copy of the database at multiple locations is which of the following?

  1. Data Replication
  2. Horizontal Partitioning
  3. Vertical Partitioning
  4. Horizontal and Vertical Partitioning
  

Question 482 : The dynamic replication algorithm takes into account

  1. to reduce load on server
  2. files on server can be migrated anywhere
  3. schedule process migration
  4. resource sharing
  

Question 483 : Scaling transparency hides

  1. System expansion
  2. System collaboration
  3. System failure
  4. System security
  

Question 484 : 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 485 : The ______________ is always a controller in the client-server Scenario.

  1. Client
  2. Slave
  3. Server
  4. User
  

Question 486 : If a system goes down for one millisecond every hour, then how much availability it has?

  1. 99.09 percent
  2. 99.9999 percent
  3. 00.99 percent
  4. 99.3 percent
  

Question 487 : For which file transfer model, cache management is harder due to the variable-length data for different access requests.

  1. File-level transfer model
  2. Block-level transfer model
  3. Byte-level transfer model
  4. Record-level transfer model
  

Question 488 : Processes on the remote systems are identified by _________________

  1. host ID
  2. host name and identifier
  3. identifier
  4. process ID
  

Question 489 : __________ refers to degree of tolerance against component failure and errors

  1. Performance
  2. Availability
  3. Integrity
  4. Reliability
  

Question 490 : Which of the following disadvantages follows the single coordinator approach?

  1. Bottleneck
  2. Slow response
  3. Deadlock
  4. One request per second
  

Question 491 : The link between two processes P and Q to send and receive me

  1. communication link
  2. message-passing link
  3. synchronization link
  4. share data
  

Question 492 : The type of communication where a message that has been submitted for transmission is stored by the communication system as long as it takes to deliver it to the receiver

  1. Transient communication
  2. Persistent communication
  3. Synchronous communication
  4. Asynchronous communication
  

Question 493 : How can we avoid deadlock

  1. Resource Allocation must be done at once
  2. there must be a fixed number of resources to allocate
  3. all deadlock process must be aborted
  4. inversion technique can be used
  

Question 494 : stream oriented communication is suitable for applications like

  1. All the mentioned
  2. audio
  3. video
  4. movie
  

Question 495 : 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 496 : In RPC system, which of the following failure may not occur

  1. The client cannot locate server
  2. The client crashes after sending a request
  3. The server crashs after receiving a request
  4. The request message from the client to the server is obtained
  

Question 497 : Which of the service is not offered by middleware ?

  1. Persistance service
  2. Translation service
  3. Querying service
  4. Concurrency service
  

Question 498 : In context of HDFS file system, Point out the wrong statement.

  1. Replication Factor can be configured at a cluster level (Default is set to 3) and also at a file level
  2. Block Report from each DataNode contains a list of all the blocks that are stored on that DataNode
  3. User data is stored on the local file system of DataNodes
  4. DataNode is aware of the files to which the blocks stored on it belong to
  

Question 499 : This is not the mechanism of recovery in distributed system.

  1. Rollback Recovery
  2. Checkpoint
  3. Message Logging
  4. Multicasting
  

Question 500 : In __________ critical section requests are executed in the increasing order of timestamps i.e a request with smaller timestamp will be given permission to execute critical section first than a request with larger timestamp.

  1. Cristian’s algorithm
  2. Berkeley algorithm
  3. Lamport algorithm
  4. Election algorithm