Computer Distributed Computing (CDC) MCQ's




Question 271 :
When a process is splited into pieces, it is called as-

  1. Tasks
  2. Program
  3. Processors
  4. Routines
  

Question 272 :
Which one of the following is not a distributed file system?

  1. Andrew File System
  2. Network File System
  3. Hadoop Distributed File System
  4. Fast File System
  

Question 273 :
X.500 is a series of ________________ covering electronic directory services.

  1. system standards
  2. networking standards
  3. computer networking standards
  4. operating system standards
  

Question 274 :
To improve performance ____ approach is used

  1. Task assignment
  2. Load Estimation
  3. Load balancing
  4. Load sharing
  

Question 275 :
Two forms of distributed information systems are:

  1. Transaction Processing System and Enterprise Application Integration.
  2. Transaction Product System and Enterprise Application Interrogation.
  3. Transparency Processing System and Independent Application Integration.
  4. Transaction Processing Software and Enterprise Access Integration.
  

Question 276 :
In global google system Ranking algorithm is called

  1. SyatemRank
  2. LinkRank
  3. PageRank
  4. IPRank
  

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

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

Question 278 :
Backward error recovery requires

  1. Grouping
  2. Assurance
  3. checkpointing
  4. Validation
  

Question 279 :
Session file sharing semantics are suitable for caching

  1. complete folder
  2. complete file
  3. One byte
  4. one block
  

Question 280 :
A type of recovery mechanism which bring the system into a correct state, from which it can then continue to execute

  1. Backward
  2. Forward
  3. Middle
  4. Front
  

Question 281 :
In which Mutual Exclusion algorithm each requests for critical section contains a sequence number.

  1. Raymond‘s Tree based Algorithm
  2. Lamport Algorithm
  3. Bully Algorithm
  4. Suzuki-Kasami‘s Broadcast Algorithms
  

Question 282 :
All communication in distributed systems is based on sending and receiving (low level) messages because of

  1. The absence of shared memory
  2. The presence of heterogeneity
  3. The absence of synchronization
  4. The presence of complexities
  

Question 283 :
A process that is based on IPC mechanism which executes on different systems and can communicate with other processes using message based communication, is called _______.

  1. Local Procedure Call
  2. Inter Process Communication
  3. Remote Procedure Call
  4. Remote Machine Invocation
  

Question 284 :
From the given options select the appropriate statement for sequential consistency(SC).

  1. SC is the strongest and yet practical consistency model
  2. SC allows for high availability during periods of network disconnectivity
  3. SC allows a client thread to read a stale value of some variable
  4. SC is only applicable to distributed shared memory systems and not applicable to distributed storage systems
  

Question 285 :
A ____________is a quartz crystal that oscillates at a well-defined frequency.

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

Question 286 :
In reliable multicasting...

  1. There is requirement that all group members receive messages in the same order.
  2. No requirement that all group members receive messages in the same order.
  3. No requirement that all group members receive messages in the random order.
  4. No requirement that all group members receive messages in parallel.
  

Question 287 :
If a ® b and b ® c then a ® c. This property is :

  1. Transitivity
  2. Reflexivity
  3. concurrency
  4. Irreflexivity
  

Question 288 :
If timestamps of two events are same, then the events are ___________________

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

Question 289 :
In the distributed system, the goal of the task assignment approach is toassign the tasks of a process to the nodes. Consider there are two nodes n1and n2 and four tasks {T1, T2, T3, T4,T5,T6}. Tasks T1 are assigned to node n1and tasks T2,T3,T4, T5, T6 are assigned to node n2.Comunication cost is as given in table below. Considering serial task assignment, the communication incur will be T1, T2, T3, T4,T5,T6T1-> 0, 6, 4, 0, 0, 12T2-> 6, 0, 8, 12, 3, 0T3-> 4, 8, 0, 0, 11, 0T4=> 0, 12, 0, 0, 5, 0T5-> 0, 3, 11, 5 , 0, 0T6=> 12, 0, 0, 0, 0, 0

  1. 38
  2. 22
  3. 39
  4. 50
  

Question 290 :
Internet provides _______ for remote login.

  1. telnet
  2. http
  3. ftp
  4. RPC
  

Question 291 :
Full form of NTP is:

  1. Network Time Protocol
  2. New time Protocol
  3. New Timestamp Protocol
  4. Network Timestamp Protocol
  

Question 292 :
Security for information resource does not include

  1. Availability
  2. Concurrency
  3. Confidentiality
  4. Integrity
  

Question 293 :
Which of the following should be satisfied 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. Prevention from the livelock is must
  

Question 294 :
Multithreading is also called as ____________

  1. Concurrency
  2. Simultaneity
  3. Crosscurrent
  4. Recurrent
  

Question 295 :
Which file is a sequence of bytes organized into blocks understandable by the system’s linker?

  1. object file
  2. source file
  3. executable file
  4. text file
  

Question 296 :
What is close group in group communication?

  1. Only members can send messages to the group as a whole
  2. processes that are not members (clients) can send message to the group.
  3. the idea of groups is to support replicated servers
  4. processes that are not members (clients) but close to the group can send message to the group.
  

Question 297 :
The holding (H) parameter in Raymond’s tree-based algorithm represents the process/node is _______.

  1. Holding token
  2. Executing critical region
  3. Holding information about node having path to token node
  4. Holding REQUEST messages for deferred replies
  

Question 298 :
Which Data consistency model states Writes done by a single process are seen by all other processes in the order in which they were issued but writes form different processes may be seen in a different order by different processes

  1. Weak consistency
  2. Sequential consistency
  3. FIFO consistency
  4. Strict consistency
  

Question 299 :
The Ricart Agarwala mutual exclusion algorithm requires _______ messages per Critical Section invocation

  1. (N - 1)
  2. 3(N - 1)
  3. 2(N - 1)
  4. 5(N - 1)
  

Question 300 :
In case of good process migration mechanism, _______________ means failure of any node other than the one on which the process is running should not affect the execution of process.

  1. Robustness
  2. Efficiency
  3. Transparent
  4. Interference
  
Pages