Computer Distributed Computing (CDC) MCQ's




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


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

Question 32 :
Select correct option for the message(Mi) transmission case Mi must be delivered before mj if Ti < Tj


  1. Absolute Ordering
  2. Consistent Ordering
  3. Causal Ordering
  4. total ordering
  

Question 33 :
In ________________receivers never acknowledge the successful delivery of multicast message but instead report only when missing the message.


  1. Basic reliable multicasting
  2. Non-hierarchical feedback control
  3. Hierarchical feedback control
  4. Atomic multicast
  

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


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

Question 35 :
_____________ manage the name spaces and binds an object to its location.


  1. Name Server
  2. Name agent
  3. Context
  4. Name resolution
  

Question 36 :
Scheduuling of threads done by


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

Question 37 :
A distributed database is which of the following?


  1. A single logical database that is spread to multiple locations and is interconnected by a network
  2. A loose collection of file that is spread to multiple locations and is interconnected by a network
  3. A single logical database that is limited to one location.
  4. A loose collection of file that is limited to one location.
  

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


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

Question 39 :
Which application-level protocol plays a crucial role in carrying out the data definition and manipulation in addition to X-500 features?


  1. TCP
  2. LDAP
  3. FTP
  4. UDP
  

Question 40 :
The client stub is called by the __.


  1. server
  2. client
  3. host
  4. client and server
  

Question 41 :
what is the task of RPCRuntime ?


  1. It is responsible for marshaling
  2. It is responsible for retransmission
  3. It is responsible for handling exception
  4. It is responsible for syntactic transparency
  

Question 42 :
Logical extension of computation migration is ___________


  1. process migration
  2. system migration
  3. thread migration
  4. data migration
  

Question 43 :
In consistent ordering when recieving the message each member calculate its proposed sequence number by using the function____________


  1. max(Fmax, Pmax) + I + i/N
  2. min(Fmax, Pmax) + I + i/N
  3. min(Fmin, Pmax) + I + i/N
  4. max(Fmin, Pmin) + I + i/N
  

Question 44 :
The name space of AFS seen by user processes is a conventional UNIX directory hierarchy, with a specific subtree ________ containing all of the shared files.


  1. cmu
  2. tmp
  3. root
  4. lib
  

Question 45 :
storage of firmware is -


  1. ROM
  2. RAM
  3. External
  4. Cache memory
  

Question 46 :
The main disadvantage of P2P model are _______________________ - _______________________.


  1. lack of scalability, high complexity
  2. support for scalability, low complexity
  3. lact of scalability, high simplycity
  4. support for scalability, high simplycity
  

Question 47 :
Bully Algorithm was proposed by ____________


  1. Garcia-Molina.
  

Question 48 :
What are characteristics of Naming and Name resolution ?


  1. name systems in the network
  2. address messages with the process-id
  3. virtual circuit
  4. message switching
  

Question 49 :
Increasing the speedup for parallel processor which law is suitable


  1. Amdhals law
  2. Flynns law
  3. Minsky conjecture
  4. Moores Law
  

Question 50 :
In context of HDFS file system, Point out the wrong statement.


  1. Replication Factor can be configured at a cluster level (Default is set to 3) and also at a file level
  2. Block Report from each DataNode contains a list of all the blocks that are stored on that DataNode
  3. User data is stored on the local file system of DataNodes
  4. DataNode is aware of the files to which the blocks stored on it belong to
  

Question 51 :
Which of the following is not a classification of group communication?


  1. One to Many
  2. Many to one
  3. Many to Many
  4. Many to All
  

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


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

Question 53 :
What is DFS(Distributed File System)?


  1. is a file system that is distributed on multiple file servers or multiple locations
  2. is a file system that is distributed multiple times
  3. is a file system that is on centralized location
  4. is a file system that access any file
  

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


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

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


  1. 0.135416667
  2. 0.177083333
  3. 0.21875
  4. 0.260416667
  

Question 56 :
What is not a major goal for building distributed systems?


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

Question 57 :
In which file system mapreduce function is used?


  1. AFS
  2. NFS
  3. HDFS
  4. None of the above
  

Question 58 :
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. none of the mentioned
  

Question 59 :
In Singal's algorithm, the manner In which cardinality decreases, leads to a ___ pattern, topologically.


  1. mesh
  2. ring
  3. stepwise
  4. staircase
  

Question 60 :
A replica set can have only ________ primary.


  1. One
  2. two
  3. three
  4. zero
  
Pages