Distributed Computing MCQ



Question 701 : Replication model in which one replica is server replica and other follow the sever is___________.

  1. Master-Slave
  2. Client -Server
  3. Peer-to-peer
  4. Permanent
  

Question 702 : A global system of Interconnected Computer networks is called as

  1. Ethernet
  2. Intranet
  3. Internet
  4. Ultranet
  

Question 703 : The Ricart & Agrawala distributed mutual exclusion algorithm is

  1. More efficient and more fault tolerant than a centralized algorithm.
  2. Less efficient and less fault tolerant than a centralized algorithm
  3. Less efficient but more fault tolerant than a centralized algorithm.
  4. More efficient but less fault tolerant than a centralized algorithm.
  

Question 704 : SRM protocol stands for

  1. Scalable Reliable Multispreading
  2. Scalable Recovery Multicasting
  3. Scalable Reliable Multicasting
  4. Scalable Recovery Multispreading
  

Question 705 : _____________ is a physical clock synchronization Algorithm

  1. Cristian
  2. vector
  3. Lamport
  4. Ring
  

Question 706 : A system that offers intermediate-term storage capacity for messages, without requiring either the sender or receiver to be active during message transmission is suitable for

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

Question 707 : Which of the following is a form of distributed information system?

  1. Home system
  2. Transaction Processing System
  3. Pervasive system
  4. Enterprise Resource Planning system
  

Question 708 : Duplicating files on multiple machines improves i)availability ii)performance iii)intergrity iv)consistancy

  1. Only i
  2. i and ii only
  3. i,ii,and iii
  4. ii,iii,iv only
  

Question 709 : In Raymond’s Algorithm, TOKEN is held by which node of the tree?

  1. Left most Leaf node
  2. Right most Leaf node
  3. Root node
  4. Intermediate node
  

Question 710 : The aim of load sharing approach is to refrain nodes from being _______ nodes.

  1. Dead
  2. Idle
  3. Strong
  4. Busy
  

Question 711 : What is not a major reason for building distributed systems?

  1. Resource sharing
  2. Computation speedup
  3. Reliability
  4. Simplicity
  

Question 712 : Which of the following is not a layer in architecture of grid computing?

  1. Collective layer
  2. Connectivity layer
  3. Remote reference layer
  4. Fabric layer
  

Question 713 : The value in the counter register is ____________ by 1 for each oscillation of the quartz crystal.

  1. Decremented
  2. Incremented
  3. Doubled
  4. None of the mentioned
  

Question 714 : The absence of _____________consistency is sometimes experienced when updating Web documents and subsequently viewing the effects.

  1. Read-your-writes
  2. Monotonic-writes
  3. Monotonic-Reads
  4. Writes-follow-reads
  

Question 715 : 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 716 : The method and time to access data and replica is defined as___________.

  1. Concurrency
  2. Consistency
  3. Availability
  4. Isolation
  

Question 717 : Network File System writes data_____

  1. Index wise
  2. Automatic
  3. Synchronously
  4. Asynchronously
  

Question 718 : What are the advantages of token(with rings) passing approach ? I. One processor as coordinator which handles all requests II. No starvation if the ring is unidirectional III. There are many messages passed per section entered if few users want to get in section IV. One processor as coordinator which handles all requests V. Only one message/entry if everyone wants to get in

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

Question 719 : 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 720 : Which policy used in load balancing algorithm

  1. standard policy
  2. variant policy
  3. location policy
  4. random policy
  

Question 721 : ____are useful for the enforcement of mutual exclusion and also provide an effective means of inter-process communication.

  1. Semaphores
  2. Messages
  3. Monitors
  4. Addressing
  

Question 722 : 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 723 : Which of the following is the fastest means of memory access fo

  1. Registers
  2. Cache
  3. Main memory
  4. Virtual Memory
  

Question 724 : In static load balancing, the processes are assigned to the processors during ______.

  1. Compile time
  2. Run time
  3. Any time
  4. No need to assign. Process will be excecuted in its own source node.
  

Question 725 : Optimistic logging protocols need to keep track of

  1. Independencies
  2. Checking points
  3. Dependencies
  4. Erroneous state
  

Question 726 : Number of REQUEST messages for entering the critical region can vary from N/2 to N in which algorithm? (N: Number of nodes)

  1. Singhal’s heuristic algorithm
  2. Raymond’s tree-based algorithm
  3. Ricart–Agrawala's algorithm
  4. Lamport’s algorithm
  

Question 727 : The maximum number of messages required per CS execution in Maekawa's algorithm for deadlock handling is

  1. 4√N
  2. √N
  3. 5√N
  4. 2√N
  

Question 728 : What is process?

  1. program in main memory
  2. Program in cache memory
  3. program in execution
  4. Program in secondary memory
  

Question 729 : Agreement algorithms have which assumptions________.

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

Question 730 : _______is a property to consider in faulty distributed environments

  1. Replication
  2. recovery
  3. concurrency
  4. Consistency
  

Question 731 : Which is not desirable feature of a good distributed system

  1. User mobility
  2. Performance
  3. Data Intergrity
  4. Homogeneity
  

Question 732 : Isosynchronous is a type of which communication _____.

  1. MOM
  2. IPC
  3. Stream Oriented Communication
  4. Group Communication
  

Question 733 : SRM protocol stands for

  1. Scalable Reliable Multispreading
  2. Scalable Recovery Multicasting
  3. Scalable Reliable Multicasting
  4. Scalable Recovery Multispreading
  

Question 734 : The ------- control the assignment of resources to processes

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

Question 735 : A DFS is executed as a part of

  1. System specific program
  2. operating system
  3. File system
  4. Application program
  

Question 736 : 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 737 : Multiprogramming systems:

  1. Are easier to develop than single programming systems
  2. Execute each job faster
  3. Execute more jobs in the same time period
  4. Are used only one large mainframe computers
  

Question 738 : Which is not a characteristic in Distributed Operating System

  1. Enabling Interprocess communication
  2. Uniform process management
  3. Local control management
  4. Different kernel implementation
  

Question 739 : Security for information resource does not include

  1. Availability
  2. Concurrency
  3. Confidentiality
  4. Integrity
  

Question 740 : Distributed system have significant characteristics of

  1. 2 types
  2. 3 types
  3. 4 types
  4. 5 types
  

Question 741 : A typical _________ program creates some remote objects, makes references to these objects accessible, and waits for clients to invoke methods on these objects.

  1. Server
  2. Client
  3. Thread
  4. Concurrent
  

Question 742 : The type of communication where a message is stored by the communication system only as long as the sending and receiving application are executing.

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

Question 743 : Bully Algorithm was proposed by ____________

  1. Garcia-Molina.
  

Question 744 : NOS supports ________ OS in all nodes.

  1. Same
  2. Different
  3. Linux based
  4. Windows Based
  

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

  1. 03:15:00
  2. 04:15:00
  3. 05:15:00
  4. 06:15:00
  

Question 746 : MPI_bsend is equivalent to _____.

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

Question 747 : __________is the problem that occurs when high priority processes keep executing and low priority processes get blocked for indefinite time

  1. Deadlock
  2. Starvation
  3. Fairness
  4. monotonic
  

Question 748 : Which is NOT the characteristic of a DFS?

  1. reliability
  2. Scalability
  3. Transperency
  4. Upgradation
  

Question 749 : Registration of a server makes it possible for a client to locate the server and

  1. Bind to it
  2. Listen to it
  3. Refer to it
  4. Store to it
  

Question 750 : 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