Distributed Computing MCQ's




Question 841 :
The server does not handle the request itself but passes it to a seprate thread is called ____.

  1. iterative server
  2. multi-threaded server
  3. concurrent server
  4. distributed server
  

Question 842 :
Cristian’s Algorithm is _____

  1. Passive Time Server Algorithm
  2. Active Time Server Algorithm
  3. both (a) and (b)
  4. None of the mentioned
  

Question 843 :
Staleness deviations relate to the ______________

  1. first time a replica was updated
  2. first time a replica was not updated
  3. last time a replica was updated
  4. last time a replica was not updated
  

Question 844 :
Synchronization tool is?

  1. thread
  2. pipe
  3. semaphore
  4. socket
  

Question 845 :
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 846 :
________ identifies the names of those enterprise-level networks around the world that are linked together via phone, satellite, or other communication systems

  1. Global Naming Service
  2. Directory Services
  3. CODA Files
  4. Andrew File System
  

Question 847 :
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 848 :
The V-system in distributed computing system is based on ______.

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

Question 849 :
Choosing the best path from sender to receiver is primary task of ___ layer of OSI.

  1. Physical
  2. Transport
  3. Network
  4. Application
  

Question 850 :
______hides differences in data representation and the way an object can be accessed

  1. Location transparency
  2. Access transparency
  3. Migration transparency
  4. Replication transparency
  

Question 851 :
The time interval between critical region (CR)exit - new entry by any process is called ................

  1. System throughput
  2. Message complexity
  3. Synchronization delay
  4. Response time
  

Question 852 :
In mutual exclusion, ‘no deadlock or starvation’is guaranteed by the property of ______.

  1. Serialization
  2. Liveness
  3. Safety
  4. Deadlock detection
  

Question 853 :
When potential causality exists between different messages is preserved in_______.

  1. Unoredered multicast
  2. FIFO ordered multicast
  3. Casually ordered multicast
  4. Totally ordered multicasts
  

Question 854 :
Which of the following is the Logical Clock Synchronization algorithm

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

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

  1. 0.138888889
  2. 0.128472222
  3. 0.135416667
  4. 0.131944444
  

Question 856 :
______ algorithm works fine with low latency algorithm.

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

Question 857 :
Which issue of distributed system should be perceived as the single entity by the users or the application programmers rather than the collection of autonomous system is cooperating

  1. Openness
  2. Scalability
  3. Security
  4. Transparency
  

Question 858 :
client-centric consistency provides guarantees for a __________ concerning the consistency of accesses to a data store by that client.

  1. Single Client
  2. Multiple Client
  3. Single Server
  4. Multiple Server
  

Question 859 :
The example of persistent communication is

  1. Email
  2. Network communication
  3. file transfer
  4. sending messages
  

Question 860 :
In X.500 Directory you can search for hundreds of thousands of people from a single place on the _______________.

  1. World Wide Web.
  2. at one place
  3. World directory
  4. Words largest file
  

Question 861 :
A Client centric consistency model which states If a process reads the value of a data item x, any successive read operation on x by that process will always return that same value or a more recent value.

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

Question 862 :
Distributed Computing Environment (DCE), is a true _____________ system in that it is designed to execute as a layer of abstraction between existing (network) operating systems and distributed applications.

  1. Multiprocessing
  2. Middleware
  3. Top Level
  4. Operating
  

Question 863 :
A bully election algorithm:

  1. picks the first process to respond to an election request.
  2. relies on majority vote to pick the winning process.
  3. assigns the role of coordinator to the processs holding the token at the time of election.
  4. picks the process with the largest ID.
  

Question 864 :
Increased service load handled by capability of system is known as-

  1. Capacity
  2. Scalability
  3. Tolerance
  4. Expansion
  

Question 865 :
Which of the following do not belong to queues for processes?

  1. Job Queue
  2. PCB queue
  3. Device Queue
  4. Ready Queue
  

Question 866 :
In Dynamic Load Balancing, jobs are reassigned at the runtime, depending upon the situation, that is, the load will be transferred from heavily loaded nodes to lightly loaded nodes. In this case, Statement 1: communication overhead wont effect the system performance with increase in number of processors. Statement 2: since more information is collected by an algorithm in short duration of time, the algorithm can make better decisions State which of the following holds true:

  1. Statement 1 is correct but statement 2 is false
  2. Statement 1 is false but statement 2 is correct
  3. Both the statements are incorrect
  4. Both the statements are correct
  

Question 867 :
Which of the following is the fastest means of memory access fo

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

Question 868 :
Which mutual exclusion algorithm works when the membership of the group is unknown?

  1. Centralized.
  2. Ricart-Agrawala.
  3. Lamport.
  4. Token Ring.
  

Question 869 :
How is access to resources of various machines is done?

  1. Remote logging using ssh or telnet
  2. Zone are configured for automatic access
  3. FTP is not used
  4. FTP is used
  

Question 870 :
In wound-wait If a young process wants a resource held by an old process, the young process will _____

  1. Killed
  2. Wait
  3. Preempt
  4. Restarts and wait
  
Pages