Distributed Computing MCQ



Question 651 : ________________is token based algorithm

  1. Richart Agrawala
  2. Maekawa
  3. Lamport’s
  4. Raymond Tree
  

Question 652 : A Client centric consistency model which states "A write operation by a process on a data item x is completed before any successive write operation on x by the same process".

  1. Monotonic Reads
  2. Monotonic Writes
  3. Read your writes
  4. Writes your Reads
  

Question 653 : X.500 Directory Service is a standard way to develop an electronic directory of people in an organization so that it can be part of a available to anyone in the world with Internet access.

  1. social directory
  2. local directory
  3. global directory
  4. personal directory
  

Question 654 : In _______approach, each process submitted by the user for processing is viewed as a collection of related tasks and these task are scheduled to suitable nodes in order to improve the performance.

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

Question 655 : A message broker acts as an application-level gateway in a ________

  1. Message-queuing system.
  2. RPC
  3. IPC
  4. Message Streaming System
  

Question 656 : 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 657 : According to the ring algorithm, links between processes are _____

  1. Bidirectional
  2. Unidirectional
  3. Both bidirectional and unidirectional
  4. omnidirectional
  

Question 658 : which is not type of Distributed computing system?

  1. Grid Computing
  2. Cluster Computing
  3. Health Care System
  4. Cloud Computing
  

Question 659 : A distributed computer running a distributed program is known as

  1. Distributed Process
  2. Distributed Application
  3. Distributed Computing
  4. Distributed Program
  

Question 660 : In ------- algorithms collect state information and react to system state if it changed

  1. Static load balancing
  2. Dynamic load balancing
  3. constant load balancing
  4. single load balancing
  

Question 661 : Which of the following are models of middleware that are belong to distributed object technology.

  1. RPC & RMI
  2. RPC & CORBA
  3. MOM & RMI
  4. RMI & CORBA
  

Question 662 : This model is similar to processor consistency model with an additional restriction of memory coherence.

  1. strict consistency
  2. PRAM consistency
  3. causal consistency
  4. FIFO consistency
  

Question 663 : ________represents solution to the static scheduling problem that requires a reasonable amount of time and other resources to perform its function.

  1. Approximate solution
  2. Heuristics solution
  3. Optimal solution
  4. Suboptimal solution
  

Question 664 : Match the following : List – I 1. Iterative server 2. Concurrent server 3. Multi-threades server List – II i. does not handle the request itself but passes it to another process ii. does not handle the request itself but create a new process for each new incoming request. iii. itself handles the request and return response to the requesting client

  1. 1. (ii), 2. (iii), 3. (i)
  2. 1. (iii), 2. (i), 3. (ii)
  3. 1. (i), 2. (ii), 3. (iii)
  4. 1. (iii), 2. (ii), 3. (i)
  

Question 665 : The difference in the time value of two Clocks is called_______

  1. Clock drift
  2. Clock skew
  3. Clock synchronization
  4. Difference clock
  

Question 666 : What are the three popular semantic modes?

  1. Unix, Coherent & Session semantics
  2. Unix, Transaction & Session semantics
  3. Coherent, Transaction & Session semantics
  4. Session, Coherent semantics
  

Question 667 : A typical __________ program obtains a remote reference to one or more remote objects on a server and then invokes methods on them.

  1. a) Server
  2. b) Client
  3. c) Thread
  4. d) Concurrent
  

Question 668 : All transport-level communication services offer only

  1. Transient communication
  2. Intransient Communication
  3. Protocol
  4. Interfaces
  

Question 669 : Which of the following is/are the desirable features of global scheduling algorithm. i) Process tharshing must be prevented ii)Heuristic method used for decision making iii) Prior knowledge about the processes required

  1. i and iii only
  2. ii and iii only
  3. i and ii only
  4. All i, ii and iii
  

Question 670 : An architecture where clients first communicate the server for data then format and display it to the users, is known as ___________

  1. Client/Server architecture
  2. Three-tier architecture
  3. Two-tier architecture
  4. Peer-to-Peer architecture
  

Question 671 : RPC allows a computer program to cause a subroutine to execute in _______.

  1. its own address space
  2. another address space
  3. both its own address space and another address space
  4. applications address space
  

Question 672 : When high priority task is indirectly preempted by medium priority the scenario is called

  1. priority inversion
  2. priority removal
  3. priority exchange
  4. priority modification
  

Question 673 : 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 674 : A multiprocessor operating system must take care of

  1. authorized data access and data protection
  2. unauthorized data access and data protection
  3. authorized data access
  4. data protection
  

Question 675 : ___________ acts between name servers and their clients.

  1. Name machine
  2. Context node
  3. Naming agents
  4. Main servers
  

Question 676 : If a process is executing in its critical section, ________

  1. any other process can also execute in its critical section
  2. no other process can execute in its critical section
  3. one more process can execute in its critical section
  4. two more process can execute in its critical section
  

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

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

Question 678 : Migrating some resources, Suspending the execution, migrating the process and then resuming is known as ______.

  1. Total Freezing
  2. Pre Transferring
  3. On demand Exchange
  4. On demand migration
  

Question 679 : The result of any execution is the same as if the read and the write Operations by all processes on the data store were executed in some Sequential order and the operations of each individual process appear in this sequence in the order specified by its program.

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

Question 680 : Scheduuling of threads done by

  1. input
  2. output
  3. operating system
  4. memory
  

Question 681 : Whatapp service uses which type of communication-

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

Question 682 : Transparency that allows movement of resources and clients within a system is called ______.

  1. Concurrency
  2. Performance
  3. Replication
  4. Mobility
  

Question 683 : In reliable multicasting...

  1. There is requirement that all group members receive messages in the same order.
  2. No requirement that all group members receive messages in the same order.
  3. No requirement that all group members receive messages in the random order.
  4. No requirement that all group members receive messages in parallel.
  

Question 684 : What is full replication?

  1. A copy of whole dataset is stored at every site.
  2. A copy of whole dataset is stored at limited sites.
  3. A copy of fully accessed dataset is stored at most visited site.
  4. A copy of whole dataset is copied.
  

Question 685 : DOS gives the view of ___________ System.

  1. Multi-processor
  2. Uniprocessor
  3. Multi-controller
  4. Virtual Uniprocessor
  

Question 686 : A type of recovery mechanism which bring the system into a correct state, from which it can then continue to execute

  1. Backward
  2. Forward
  3. Middle
  4. Front
  

Question 687 : Which algorithms are used for selecting a process to act as coordinator or sequencer? I. Centralized algorithm II. Election algorithm III. Ring algorithm IV. Chandy-Misra-Haas algorithm

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

Question 688 : Network operating system runs on ___________

  1. Server
  2. Client
  3. Every system in the network
  4. Network Agent
  

Question 689 : 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 690 : Frames are used for communication in which layer of the TCP/IP protocol suite

  1. Physical Layer
  2. Data Link Layer
  3. Network layer
  4. Transport Layer
  

Question 691 : Which one is not a primitive of message passing primitive.

  1. MPI_RECV ()
  2. MPI_SEND ()
  3. WRITE ()
  4. MPI_BSEND ()
  

Question 692 : All techniques of Fault tolerance must rely on ______.

  1. Integrity
  2. Dependability
  3. Redundancy
  4. Synchronization
  

Question 693 : In which technique of cache updation -Files are modified and in parallel cache memory is also updated ?

  1. Write through
  2. Read any write all
  3. Write back
  4. Quorum based protocol
  

Question 694 : Which algorithms are used to handle mutual exclusion in distributed systems?

  1. Centralized
  2. Distributed
  3. Token ring
  4. All of the mentioned
  

Question 695 : If a process is executing in its critical section ____________

  1. any other process can also execute in its critical section
  2. no other process can execute in its critical section
  3. one more process can execute in its critical section
  4. every process can execute in its critical section
  

Question 696 : What is the feature of stateful server?

  1. Longer server recovery time
  2. Quick recovery after reboot
  3. File operations must be idempotent
  4. Simple server design
  

Question 697 : ___________defined a relation called happens-before

  1. Berkeley
  2. Lamport
  3. Vector
  4. Cristian
  

Question 698 : 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. ALU
  

Question 699 : The response time is short since process migration is not required in ______

  1. Workstation model
  2. Workstation -server model
  3. Processor-pool model
  4. Client-server model
  

Question 700 : A process can enter into its critical section _______

  1. anytime
  2. when it receives a reply message from its parent process
  3. when it receives a reply message from all other processes in the system
  4. none of the mentioned