Computer Distributed Computing (CDC) MCQ's




Question 961 :
Processes on the remote systems are identified by _________________

  1. host ID
  2. host name and identifier
  3. identifier
  4. process ID
  

Question 962 :
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
  

Question 963 :
Logical extension of computation migration is ___________

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

Question 964 :
Replication model in which one replica is server replica and other follow the sever is___________.

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

Question 965 :
For execution on process need

  1. Throughput
  2. Timer
  3. Resources
  4. Access Time
  

Question 966 :
SRM protocol stands for

  1. Scalable Reliable Multispreading
  2. Scalable Recovery Multicasting
  3. Scalable Reliable Multicasting
  4. Scalable Recovery Multispreading
  

Question 967 :
If a system goes down for one millisecond every hour, then how much availability it has?

  1. 99.09 percent
  2. 99.9999 percent
  3. 00.99 percent
  4. 99.3 percent
  

Question 968 :
Write the event of following notations:M ~P ~C

  1. A crash occurs after sending the completion message and printing the text.
  2. A crash happens after sending the completion message, but before the text could be printed.
  3. A crash happens before the server could do anything.
  4. The text printed, after which a crash occurs before the completion message could be sent.
  

Question 969 :
The Electronic mail system is a -

  1. Types of message Passing
  2. Types of communication
  3. Types of Internet
  4. Part of RPC
  

Question 970 :
A type of the fault which occurs, vanishes, reappears; but follows no real pattern

  1. Transient Fault
  2. Intermittent Fault
  3. Permanent Fault
  4. Temporary fault
  

Question 971 :
Which ordering uses global timestamps as message id?

  1. Total ordering
  2. FIFO ordering
  3. Causal Ordering
  4. Absolute Ordering
  

Question 972 :
Pretransfering also known as__

  1. Premigrating
  2. Precopying
  3. Prefiltering
  4. Postcopying
  

Question 973 :
What are the characteristics of tightly coupled system ? i) Different clockii) Use communication linksiii) Same clockiv) Distributed systems

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

Question 974 :
The ______________ is used to store a constant value that is decided based on the frequency of oscillation of the quartz crystal.

  1. Counter register
  2. Quartz crystal
  3. Constant register
  4. None of the mentioned
  

Question 975 :
In which the access takes place when different processes try to access the same data concurrently and the outcome of the execution depends on the specific order, is called

  1. dynamic condition
  2. race condition
  3. essential condition
  4. critical condition
  

Question 976 :
The sever and client computer interact with each other using ________

  1. Specific Port Number and IP Address
  2. MAC Address
  3. MAC Address and Port Number
  4. MAC Address and IP Address
  

Question 977 :
Number of REQUEST messages for entering the critical region can vary from N/2 to N in which algorithm? (N: Number of nodes)

  1. Singhal’s heuristic algorithm
  2. Raymond’s tree-based algorithm
  3. Ricart–Agrawala's algorithm
  4. Lamport’s algorithm
  

Question 978 :
A distributed computer running a distributed program is known as

  1. Distributed Process
  2. Distributed Application
  3. Distributed Computing
  4. Distributed Program
  

Question 979 :
The main advantage of centralized system for clock synchronization is _____

  1. Time is fixed
  2. Time is unambiguous
  3. There is no time delay
  4. There is no jitter
  

Question 980 :
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 981 :
In Singhal's algorithm, the information structure at site consists of ___ sets

  1. request and inform
  2. request and reply
  3. inform and priority
  4. reply and priority
  

Question 982 :
Type of cluster computing is

  1. Load sharing cluster
  2. Load holding cluster
  3. Load replication cluster
  4. Load balancing cluster
  

Question 983 :
A monitor is a module and monitor which of the following can encapsulates

  1. shared data structures
  2. procedures that operate on shared data structure
  3. synchronization between concurrent procedure invocation
  4. all of the mentioned
  

Question 984 :
What is full form of AFS?

  1. Andrew File System
  2. Analog File System
  3. Acess File System
  4. Acess Fast System
  

Question 985 :
In distributed file system, DNS stands for?

  1. Domain Name System
  2. Domain Name Server
  3. Directory name service
  4. Disk name system
  

Question 986 :
Logical extension of computation migration is

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

Question 987 :
Following is Possible diffeerent RPC server semantics.

  1. The server guarantees it will secure communication.
  2. The server guarantees it will distribute workload
  3. The server guarantees it will halt communication.
  4. The server guarantees it will carry out an oper-ation at most once.
  

Question 988 :
In weak consistency____-

  1. one operation on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  2. Two operations on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  3. All operations on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  4. No operation on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  

Question 989 :
As per lamports clock synchronisation algorithm, If timestamps of two events are same, then the events are ____________

  1. concurrent
  2. non concurrent
  3. monotonic
  4. non monotonic
  

Question 990 :
What is the advantage of a vector clock over Lamport's logical clock?

  1. Catch causality
  2. avoid deadlock
  3. avoid linear relationship
  4. set nonlinear relationship
  
Pages