Computer Distributed Computing (CDC) MCQ's




Question 571 :
Which mutual exclusion algorithm is useful when the membership of the group is unknown?

  1. Centralized
  2. Lamport’s.
  3. Token ring
  4. Decentralized Algorithm
  

Question 572 :
The address of the next instruction to be executed by the current process is provided by the __________

  1. Program counter
  2. CPU registers
  3. Process stack
  4. Pipe
  

Question 573 :
Following algorithm proposes the concept of time server and RPC

  1. Lamport’s Scalar Clock synchronization
  2. Christians clock synchronization
  3. Berkleyclock synchronization
  4. Network time protocol
  

Question 574 :
In static load balancing, the processes are assigned to the processors during ______.

  1. Compile time
  2. Run time
  3. Any time
  4. No need to assign. Process will be excecuted in its own source node.
  

Question 575 :
You are synchronizing your clock from a time server using NTP and observe the following times: [4 points] a. timestamp at client when the message leaves the client: 6:22:15.100 b. timestamp at which the server receives the message: 7:05:10.700 c. timestamp at which the server sends the reply: 7:05:10.710 d. timestamp at client when the message is received at client: 6:22:15.250 To what value do you set the client's clock?

  1. 0.295266204
  2. 0.33693287
  3. 0.378599537
  4. 0.420266204
  

Question 576 :
What is Server Load Balancing (SLB)?

  1. SLB distributes servers to a group of clients and ensures that clients are not sent to failed servers.
  2. SLB distributes clients to a group of servers and ensures that clients are not sent to failed servers.
  3. SLB distributes servers to a group of clients and ensures that tasks are not sent to failed servers.
  4. SLB distributes servers to a group of clients and ensures that tasks are sent to failed servers.
  

Question 577 :
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 the process.

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

Question 578 :
X.500 Directory is also called

  1. global Yellow Pages directory
  2. global Blue Pages directory
  3. global White Pages directory
  4. global Black Pages directory
  

Question 579 :
Which communication model uses the queuing model?

  1. RPC
  2. RMIu
  3. MOM
  4. MPI
  

Question 580 :
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 581 :
What is full replication?

  1. A copy of whole dataset is stored at every site.
  2. A copy of whole dataset is stored at limited sites.
  3. A copy of fully accessed dataset is stored at most visited site.
  4. A copy of whole dataset is copied.
  

Question 582 :
IDLs describe an interface in a ________ way

  1. language-dependent
  2. language-independent
  3. language oriented
  4. language specified
  

Question 583 :
Which one of the following is not shared by threads?

  1. program counter
  2. stack register
  3. program counter and stack
  4. register
  

Question 584 :
Which of the following is not a layer in architecture of grid computing?

  1. Collective layer
  2. Connectivity layer
  3. Remote reference layer
  4. Fabric layer
  

Question 585 :
Which is not the way to organize servers?

  1. Iterative server
  2. Concurrent server
  3. Active server
  4. Multi-threaded serve
  

Question 586 :
In weak consistency____-

  1. All read or write operation on data items are allowed to be performed until all previous operations to synchronization variables have been performed
  2. No read or write operation on data items are allowed to be performed until all previous operations to synchronization variables have been performed
  3. One read or write operation on data items are allowed to be performed until all previous operations to synchronization variables have been performed
  4. Two read or write operation on data items are allowed to be performed until all previous operations to synchronization variables have been performed
  

Question 587 :
Which of the given statements is false?

  1. Message Passing Interface(MPI) provides buffering service.
  2. Socket programming provides transient asynchronous communication.
  3. Message Passing Interface(MPI) is more advanced than socket programming
  4. Message Passing Interface(MPI) provides transient asynchronous communication.
  

Question 588 :
The Ricart - Agrawala distributed mutual exclusion algorithm is:

  1. Less efficient and less fault tolerant than a centralized algorithm.
  2. More efficient and more fault tolerant than a centralized algorithm.
  3. More efficient but less fault tolerant than a centralized algorithm.
  4. Less efficient but more fault tolerant than a centralized algorithm.
  

Question 589 :
Which of the following is true in case of the NFS server?

  1. They are stateless
  2. They save the current state of the request
  3. They are stateful
  4. They save previous state
  

Question 590 :
Which of the following is not comes under Dependability

  1. Availability
  2. Reliability
  3. Maintainability
  4. Redundancy
  

Question 591 :
The distributed global directory works through a __________________ and one or more central places that manage many directories.

  1. registration process
  2. saccession process
  3. application process
  4. distribution process
  

Question 592 :
An object acting as a gateway for the client side.

  1. skeleton
  2. stub
  3. remote
  4. server
  

Question 593 :
Which of the following technique is not used for scheduling process of distributed system.

  1. task assignment approach
  2. load balancing approach
  3. load sharing approach
  4. task management approach
  

Question 594 :
In _______approach, each process submitted by the user for processing is viewed as a collection of related tasks and these task are scheduled to suitable nodes in order to improve the performance.

  1. Task assignment approach
  2. Load balancing approach
  3. Load dividing approach
  4. Load sharing approach
  

Question 595 :
If timestamps of two events are same, then the events are ____

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

Question 596 :
What are the characteristics of data migration?

  1. transfer data by entire file or immediate portion required
  2. transfer the computation rather than the data
  3. execute an entire process or parts of it at different sites
  4. execute limited portion of data
  

Question 597 :
In GFS(Google file System) files are divided into _______chunks

  1. Variable Size
  2. Fixed Size
  3. Variable and Fixed size
  4. Not variable not fixed size
  

Question 598 :
No special machines manage the network of architecture in which resources are known as

  1. Peer-to-Peer
  2. Space based
  3. Tightly coupled
  4. Loosely coupled
  

Question 599 :
In order to join or leave a group each process has to broadcast a message.

  1. flat group
  2. IETF group
  3. Collected process Group
  4. Hierarchical Group
  

Question 600 :
Following is concerned with extension and improvements of distributed system -

  1. openness
  2. concurrency
  3. fault tolerance
  4. Resource sharing
  
Pages