Computer Distributed Computing (CDC) MCQ's




Question 871 :
The NFS protocol __________ concurrency control mechanisms.

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

Question 872 :
Writes that are potentially casually related must be seen by all processes in the same order. Concurrent writes may be seen in a different order on different machines is the necessary condition in ______

  1. FIFO consistency
  2. LRU consistency
  3. Optimal consistency
  4. Casual consistency
  

Question 873 :
_______consistency provides consistency gurantees for a single client with respect to the data stored by that client

  1. Data-centric
  2. Client centric
  3. Eventual
  4. Entry
  

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

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

Question 875 :
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. same priority number is associated to two process at a time
  

Question 876 :
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 877 :
Which of the following algortihm uses active time daemon for clock Synchronization

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

Question 878 :
Agreement algorithms have which assumptions________.

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

Question 879 :
What is Inter process communication?

  1. allows processes to communicate and synchronize their actions when using the same address space
  2. allows processes to communicate and synchronize their actions without using the same address space
  3. allows the processes to only synchronize their actions without c
  4. communicate with one another without resorting to shared dat
  

Question 880 :
____are used for signaling among processes and can be readily used to enforce a mutual exclusion discipline.

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

Question 881 :
Once failure has occurred in many cases it is important to ______critical processes to a known state in order to resume processing

  1. start
  2. stop
  3. recover
  4. pause
  

Question 882 :
At any point of time number of coordinator in distributed system is______.

  1. At least one
  2. One and only one
  3. At most one
  4. More than one
  

Question 883 :
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 884 :
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 885 :
________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 886 :
The Raymond's algorithm doesn’t provide which of the following guarantees:

  1. mutual exclusion is guaranteed
  2. deadlock is impossible
  3. starvation is impossible.
  4. The delay is impossible
  

Question 887 :
NOS supports ________ OS in all nodes.

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

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

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

Question 889 :
What is NOT the characteristics of session semantics?

  1. Each client obtains a working copy from the server
  2. When file is closed, the modified file is copied to the file server
  3. The burden of coordinating file sharing is ignored by the system
  4. Easy to implement in a single processor system
  

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

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

Question 891 :
CPU scheduling is the basis of ___________

  1. multiprocessor systems
  2. multiprogramming operating systems
  3. larger memory sized systems
  4. first-come, first-served scheduling
  

Question 892 :
A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called ____________

  1. Data consistency
  2. race condition
  3. aging
  4. starvation
  

Question 893 :
In Networking of Computing machine the overall power is

  1. Very less
  2. High
  3. Very high
  4. Average
  

Question 894 :
AFS has two unusual design characteristics:

  1. Reliability, Scalability
  2. Whole-file serving, Whole-file caching
  3. file serving, file catching
  4. security, file catching
  

Question 895 :
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 896 :
Which Distributed System Model deals with Communication?

  1. Security Model
  2. Fault Model
  3. Interaction Model
  4. Architecture Model
  

Question 897 :
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 898 :
For proper synchronization in distributed systems _____

  1. prevention from the deadlock is must
  2. prevention from the starvation is must
  3. prevention from the deadlock - starvation is must
  4. none of the mentioned
  

Question 899 :
Processes do not communicate with each other and creates their own check points.

  1. User Triggered
  2. Uncoordinated check points
  3. Coordinated check points
  4. Message based check pointing.
  

Question 900 :
In which technique, processes are reassigned at the runtime depending upon the situation that is the load will be transferred from heavily loaded nodes to the lightly loaded nodes.

  1. Task assignmnet
  2. Static load balancing
  3. Dynamic load balancing
  4. Hybrid technique.
  
Pages