Distributed Computing MCQ

home MCQ Questions & Answer


Question 851 : Which event is concurrent with the vector clock (2, 8, 4)?

  1. (3, 9, 5)
  2. (3, 8, 4)
  3. (1, 7, 3) à
  4. (4, 8, 2)
  

Question 852 : In X.500, each local directory is called a _____________________.

  1. Directory System Agent
  2. Local System Agent
  3. Personal System Agent
  4. Secret System Agent
  

Question 853 : Which of the following is a feature of global scheduling algorithm?

  1. scalability
  2. flexibility
  3. transitivity
  4. reliability
  

Question 854 : DIT in Domain Name Space stands for

  1. Direct Information Transparency
  2. Directory Implicit Transfer
  3. Direct Information Token
  4. Directory Information Tree
  

Question 855 : Network file system(NFS) is developed by?

  1. Sun Microsystem
  2. oracle
  3. apple
  4. honeywell
  

Question 856 : The difference between logical and physical clocks?

  1. Logical clocks measure the time of day and Physical clocks are used to mark relationships among events in a distributed system
  2. Both are the same
  3. Physical clocks measure the time of day and Logical clocks are used to mark relationships among events in a distributed system.
  4. Both measures the time of day.
  

Question 857 : Which one is not the property of QoS in stream oriented communication

  1. Required bit rate
  2. Maximum delay
  3. maximum and minimum end to end delay`
  4. File size
  

Question 858 : The main advantage of centralized system for clock synchronization is _____

  1. Time is fixed
  2. Time is unambiguous
  3. There is no time delay
  4. There is no jitter
  

Question 859 : Which of the following is not a benefit of open distributed system (ODS)

  1. Extensibility
  2. Interoperability
  3. Securability
  4. Portability
  

Question 860 : In Distributed system, _____ can be hidden

  1. Replication
  2. Fault tolerance
  3. concurrency
  4. Consistency
  

Question 861 : X.500 is a way to route e-mail as well as to provide name lookup, using the _________________.

  1. Lightweight Directory Access Protocol
  2. Directory Access Protocol
  3. Global Directory Access Protocol
  4. Local Directory Access Protocol
  

Question 862 : which of the service offered by middleware is allows to share & access the resources Concurrently?

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

Question 863 : The NFS protocol __________ concurrency control mechanisms.

  1. provides
  2. does not provide
  3. may provide
  4. may not provide at some time
  

Question 864 : Which are the two complementary deadlock-prevention schemes using time stamps ?

  1. The wait-die & wound-wait scheme
  2. The wait-n-watch scheme
  3. The wound-wait scheme
  4. The wait-wound & wound-wait scheme
  

Question 865 : 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 866 : In GFS(Google file System) files are divided into _______chunks

  1. Variable Size
  2. Fixed Size
  3. Variable and Fixed size
  4. Not variable not fixed size
  

Question 867 : What is global scheduling algorithms?

  1. priori knowledge of resources
  2. Dynamic in nature
  3. not scalable
  4. not stable
  

Question 868 : 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. Lamport algorithm
  

Question 869 : As per lamports clock synchronisation algorithm, If timestamps of two events are same, then the events are ____________

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

Question 870 : The application layer packet is encapsulated in a

  1. TCP or UDP packet
  2. IP packet
  3. Presentation packet
  4. data link layer
  

Question 871 : Single coordinator approach has the following advantages :

  1. Simple implementation
  2. Simple deadlock handling
  3. Bottleneck
  4. All of the mentioned
  

Question 872 : X.500 is implemented as part of the ______________ in its Global Directory Service

  1. Distributed Computing Environment
  2. User fraindly Environment
  3. Global Computing Environment
  4. World Computing Environment
  

Question 873 : Which of the following is NOT type of distributed systems

  1. Distributed computing system
  2. Pervasive system
  3. Distributed Information System
  4. Parallel System
  

Question 874 : Presenting a singular, globalview, even while local changes are applied to the replicated data is defined as_________.

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

Question 875 : A semaphore is a shared integer variable that can not

  1. drop below zero
  2. be more than zero
  3. drop below one
  4. that cannot be more than one
  

Question 876 : Which file model supports consistent sharing which results in support of easy file caching and replication

  1. Structured File Model
  2. Unstructured File Model
  3. Mutable File Model
  4. Immutable File Model
  

Question 877 : Following is Possible diffeerent RPC server semantics.

  1. The server guarantees it will secure communication.
  2. The server guarantees it will distribute workload
  3. The server guarantees it will halt communication.
  4. The server guarantees it will carry out an oper-ation at most once.
  

Question 878 : What is a Iterative server

  1. Its handles request and give response to client
  2. Server does not handle request
  3. its uses concurrent server
  4. Its not handles request and give response to client
  

Question 879 : Which of the following for Mutual exclusion can be provided by the

  1. mutex locks
  2. binary semaphores
  3. both mutex locks and binary semaphores
  4. none of the mentioned
  

Question 880 : A redundancy technique used to mask failure where extra (duplicate) hardware and/or software is added to the system.

  1. Information Redundancy
  2. Time Redundancy
  3. Physical Redundancy
  4. Space Redundancy
  

Question 881 : Which file is a sequence of bytes organized into blocks understandable by the system’s linker?

  1. object file
  2. source file
  3. executable file
  4. text file
  

Question 882 : Which of the following is a disadvantage of replication?

  1. Reduced network traffic
  2. If the database fails at one site, a copy can be located at another site.
  3. Each site must have the same storage capacity.
  4. Each transaction may proceed without coordination across the network.
  

Question 883 : Which are the two complementary deadlock-prevention schemes using time stamps ?

  1. The wait-die & wound-wait scheme
  2. The wait-n-watch scheme
  3. The wound-wait scheme
  4. The wait-wound & wound-wait scheme
  

Question 884 : How the processes are organized in a ring structure, in case of token passing approach of distributed systems?

  1. Logically
  2. Physically
  3. Both logically and physically
  4. Randomly
  

Question 885 : For each critical section (CS) execution, maekawa’s algorithm requires ___________ messages per CS execution and the Synchronization delay in the algorithm is ____________.

  1. √N , T
  2. 2√N , T
  3. 3√N , T
  4. 3√N , 2T
  

Question 886 : Staleness deviations relate to the _________ a replica was updated.

  1. First time
  2. Most recent time
  3. last time
  4. previous time
  

Question 887 : Which of the following statements is true?

  1. happens before is a transitive relation
  2. happens before is a symmetric relation
  3. happens before is a reflexive relation
  4. happens before is a complex relation
  

Question 888 : _______ is not possible in distributed file system

  1. File replication
  2. Migration
  3. Client interface
  4. Remote access
  

Question 889 : In which Mutual Exclusion algorithm each requests for critical section contains a sequence number.

  1. Raymond‘s Tree based Algorithm
  2. Lamport Algorithm
  3. Bully Algorithm
  4. Suzuki-Kasami‘s Broadcast Algorithms
  

Question 890 : In RMI, a remote interface is a normal ----- interface, which must extend the marker interface

  1. C
  2. C++
  3. Java
  4. Pascal
  

Question 891 : Centralize algorithm has one basic disadvantage.

  1. Single point failure
  2. Many process
  3. Not fair
  4. deadlock
  

Question 892 : The high availability & load balancing are the key features of _________________________.

  1. Cluster computing
  2. Grid computing
  3. Centralized computing
  4. Single Computing
  

Question 893 : What is RMI ?

  1. Remote Message Invocation
  2. Remote Method Invocation
  3. Remote Method Information
  4. Remote Message Initialization
  

Question 894 : Which statement is false about Scheduling?

  1. It reduces the waiting time of each job
  2. It avoids deadlock
  3. It makes minimum utilization of resources.
  4. It reduces response time
  

Question 895 : Google was born out of a research project at Standford with the company launched in

  1. 1995
  2. 1992
  3. 1997
  4. 1998
  

Question 896 : _____ is defined as that feeling something when it is not actually present

  1. method
  2. Thread
  3. virtualization
  4. client server
  

Question 897 : Absolute time ordering of all shared accesses matters in

  1. Sequential Consistency
  2. Casual Consistency
  3. Strict Consistency
  4. Weak Consistency
  

Question 898 : The ___________ layer, which provides the interface that client and server application objects use to interact with each other.

  1. Increasing
  2. Count
  3. Bit
  4. Stub/skeleton
  

Question 899 : The ___________ layer, which provides the interface that client and server application objects use to interact with each other.

  1. increasing
  2. count
  3. stub/skeleton
  4. bit
  

Question 900 : Which of the following for Mutual exclusion can be provided by the

  1. mutex locks
  2. binary semaphores
  3. both mutex locks and binary semaphores
  4. none of the mentioned