Computer Distributed Computing (CDC) MCQ's




Question 661 :
________________ provides programmers a familiar programming model by extending the local procedure call to a distributed environment

  1. Distributed environment
  2. Permanent procedure call
  3. Process and file
  4. Remote procedure call
  

Question 662 :
The type of communication where a sender continues its execution immediately after it has submitted its message for transmission

  1. Transient communication
  2. Persistent communication
  3. Synchronous communication
  4. Asynchronous communication
  

Question 663 :
Rebooting as a practical recovery technique requires that components are largely

  1. coupled in the sense that there are dependencies between different components.
  2. coupled in the sense that there are no dependencies between different components.
  3. decoupled in the sense that there are few or no dependencies between different components
  4. decoupled in the sense that there are dependencies between different components.
  

Question 664 :
What are the advantages of file replication?

  1. Improves availability -performance
  2. Decreases performance
  3. Improves consistency
  4. Improves speed
  

Question 665 :
In NFS,all client-server communication is done through _____________

  1. RPC
  2. RMI
  3. LPC
  4. MPI
  

Question 666 :
Which is NOT the characteristic of a DFS?

  1. reliability
  2. Scalability
  3. Transperency
  4. Upgradation
  

Question 667 :
A technique that allows more than one program to be ready for execution and provides the ability to switch from one process to another.

  1. multitasking
  2. multiprocessing
  3. multitasking
  4. multiprogramming
  

Question 668 :
When a client has a cascading mount _______ server(s) is/are involved in a path name traversal.

  1. at least one
  2. more than one
  3. more than two
  4. more than three
  

Question 669 :
To enforce ………………….. two functions are provided enter-critical and exit-critical, where each function takes as an argument the name of the resource that is the subject of competition.

  1. Deadlock
  2. Starvation
  3. Mutual exclusion
  4. Synchronization
  

Question 670 :
An RPC (remote procedure call) is initiated by the _________

  1. Server
  2. Client
  3. Client after server
  4. A third party
  

Question 671 :
Which of the following is not example of Information redundancy

  1. parity
  2. checksum
  3. Hamming codes
  4. Rollback if transaction aborts
  

Question 672 :
Raymond’s Tree-Based Algorithm exchanges only ______- messages under light load .

  1. O(Nlog2 N)
  2. O(log N)
  3. O(NlogN)
  4. O(logN)
  

Question 673 :
UTC stands for

  1. Unique Cordinated Time
  2. Unique Time Coordination
  3. Universal Total Coordination
  4. Universal Coordinated Time
  

Question 674 :
In which approach of distributed computing, workload is divided from heavily loaded nodes to lightly loaded nodes in an attempt to ensure good overall performance ?

  1. Load Balancing approach
  2. Task assignment Approach
  3. Load Sharing Approach
  4. Process migration
  

Question 675 :
Which multicast delivers messages so that potential causality between different messages is preserved

  1. Unordered multicasts
  2. FIFO-ordered multicasts
  3. Causally-ordered multicasts
  4. Totally-ordered multicasts
  

Question 676 :
The data sequence of information that is time-dependent is called ___________

  1. Stream of data
  2. traditional data
  3. transactional data
  4. spatial data
  

Question 677 :
Process Fail - Stop in process omission faults

  1. Can be detected in synchronous system.
  2. Can be detected in asynchronous system.
  3. Can be detected in synchronous and asynchronous system.
  4. Can be detected in standalone system.
  

Question 678 :
Which of the following is disadvantage of active replication

  1. Consistent replicas
  2. Minimal bandwidth costs
  3. Size of the parameters is small
  4. Processing power
  

Question 679 :
When high priority task is indirectly preempted by medium priority the scenario is called

  1. priority inversion
  2. priority removal
  3. priority exchange
  4. priority modification
  

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

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

Question 681 :
In the Bully algorithm, process which is elected as the coordinator is the one having –

  1. Highest process ID
  2. Lowest process ID
  3. Highest timestamp value
  4. Lowest Timestamp value
  

Question 682 :
The ring election algorithm works by:

  1. Having all nodes in a ring of processors send a message to a coordinator who will elect the leader.
  2. Sending a token around a set of nodes. Whoever has the token is the coordinator.
  3. Sending a message around all available nodes and choosing the first one on the resultant list.
  4. Building a list of all live nodes and choosing the largest numbered node in the list.
  

Question 683 :
Hide that a resource may be moved to another location while in use

  1. Relocation transparency
  2. migration transparency
  3. location transparency
  4. Replication transparency
  

Question 684 :
map and reduce are____

  1. libraries
  2. functions
  3. file system
  4. OS
  

Question 685 :
In distributed file system, when a file’s physical storage location changes

  1. file name need to be changed
  2. file name need not to be changed
  3. file’s host name need to be changed
  4. file’s local name need to be changed
  

Question 686 :
What are the characteristics of mutual exclusion using centralized approach ? i. One processor as coordinator which handles all requests ii. It requires request,reply and release per critical section entry iii.The method is free from starvation.

  1. i
  2. ii
  3. iii
  4. i,ii and iii
  

Question 687 :
Which of the following variable wait within the to enable a process

  1. a condition is defined by a condition variable
  2. objects Boolean objects can be used by condition variables
  3. semaphore must be used
  4. all of the mentioned
  

Question 688 :
Among the following option which is not main focus of Distributed System

  1. Availability
  2. Reliability
  3. Scientific Performance
  4. Resource sharing
  

Question 689 :
A centralized mutual exclusion algorithm requires ___ messages per entry/exit

  1. 1
  2. 2
  3. 3
  4. 4
  

Question 690 :
The data consistency models in the descending order of their strictness in consistency are _____.

  1. Linearizability, Sequential, Casual, FIFO
  2. FIFO,Casual,Sequential,Linearizability
  3. Casual,Sequential,Linearizability,FIFO
  4. Sequential,Casual,FIFO,Linearizability
  
Pages