Computer Distributed Computing (CDC) MCQ's




Question 841 :
Which of the following is Election algorithm

  1. Berkley's Algorithm
  2. Cristian's Algorithm
  3. Lamport's Algorithm
  4. Bully Algorithm
  

Question 842 :
__________________ transparency makes sure that even if the servers are migrated from one location to to the other, they will not affect the performance of system.

  1. Location
  2. Migration
  3. Network
  4. Concurrent
  

Question 843 :
Following is not Task Assignment Approach algorithms

  1. Graph Theoretic Deterministic Algorithm
  2. Centrilized Heuristic Algorithm
  3. Raymond's Algorithm
  4. Hierarchical Algorithm
  

Question 844 :
A DFS is executed as a part of

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

Question 845 :
__________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 846 :
What is DGC?

  1. Distributed Garbage Collection
  2. Digital Garbage Collection
  3. Distributed Garbage Connection
  4. Digital Garbage Connection
  

Question 847 :
Which of the following is not an advantage of multiprocessor systems

  1. Increased throughput
  2. Economy of scale
  3. Increased reliability
  4. Optimise the program size
  

Question 848 :
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 849 :
In RPC, _________________ handles transmission of messages across the network between client and the server machine

  1. Rpc transmission
  2. Rpc runtime
  3. Rpc communication
  4. Rpc interface
  

Question 850 :
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 851 :
A software that lies between the OS and the applications running on it.

  1. system software
  2. middleware
  3. utility software
  4. Application software
  

Question 852 :
The remote method invocation __________

  1. Allows a process to invoke memory on a remote object
  2. Allows a thread to invoke a method on a remote object
  3. Allows a thread to invoke memory on a remote object
  4. allows a process to invoke a method on a remote object
  

Question 853 :
Which one of the following is a distributed file system?

  1. andrew file system
  2. server file system
  3. newer network
  4. dc file system
  

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

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

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

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

Question 856 :
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 857 :
Which of the following variables denote the state of site in Singhals dynamic information structure algorithm

  1. Requesting, Executing, and My_ priority
  2. Requesting, Responsing and My_priority
  3. Requesting, Responsing and Blocked
  4. Requesting, Executing and Blocked
  

Question 858 :
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 859 :
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. when it receives a reply message from its child process
  

Question 860 :
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 861 :
A data consistency model in which shared data are made consistent when a critical region is exited.

  1. Casual consistency
  2. Sequential consistency
  3. Release consistency
  4. Strict consistency
  

Question 862 :
DNS is an example of

  1. Continuous Consistency
  2. Causal Consistency
  3. Sequential Consistency
  4. Eventual Consistency
  

Question 863 :
Cristian’s Algorithm is ______________

  1. Passive Time Server Algorithm
  2. Active Time Server Algorithm
  3. Distributed mutual exclusion
  4. Logical algorithm
  

Question 864 :
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 865 :
________algorithm uses the information about properties of the node and characteristics of processes.

  1. probabilistic algorithm
  2. Heuristics solution
  3. deterministic algorithm
  4. Optimal solution
  

Question 866 :
A type of the failure model where a server fails to respond to incoming requests.

  1. Crash failure
  2. Response failure
  3. Omission failure
  4. Arbitrary failure
  

Question 867 :
A cache in which location is the easiest to implement

  1. Server’s main memory
  2. Client’s disk
  3. Client’s main memory
  4. Server’s Disk
  

Question 868 :
What are characteristics of processor in distributed system ?

  1. They vary in size and function
  2. They are same in size and function
  3. They are manufactured with single purpose
  4. They are real-time devices
  

Question 869 :
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 870 :
Replication model in which one copy is master and other copies are slaves is __________.

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