Computer Distributed Computing (CDC) MCQ's




Question 631 :
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 632 :
In which algorithm, One process is elected as the coordinator.

  1. Distributed mutual exclusion algorithm
  2. Centralized mutual exclusion algorithm
  3. Token ring algorithm
  4. Lamport algorithm
  

Question 633 :
The ___________________ fault describes the worst possible fault semantics where any type of error may occur.

  1. Timing
  2. Arbitrary
  3. Omission
  4. Non-timing
  

Question 634 :
File caching is done _____________.

  1. To made file available
  2. To make faster access
  3. For transparent access
  4. For Mobile access
  

Question 635 :
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 636 :
Which of the following is an transport layer protocol?

  1. DNS
  2. TCP
  3. RMI
  4. SONET
  

Question 637 :
Storing a separate copy of the database at multiple locations is which of the following?

  1. Data Replication
  2. Horizontal Partitioning
  3. Vertical Partitioning
  4. Horizontal and Vertical Partitioning
  

Question 638 :
Server checking whether file is updated in cache or not before using it is known as_____.

  1. Client Validation
  2. Server Validation
  3. Client updating
  4. Server Updating
  

Question 639 :
X.500 is implemented as part of the ______________ in its Global Directory Service

  1. Distributed Computing Environment
  2. User fraindly Environment
  3. Global Computing Environment
  4. World Computing Environment
  

Question 640 :
___algorithm for coordinator election assumes that no process can fail during the election procedure until the new coordinator has been selected.

  1. bully algorithm
  2. Ring algorithm
  3. Lamport algorithm
  4. Suzuki Kasami algorithm
  

Question 641 :
Writes by a single process are seen by all other processes in the order in which they were issued; however, writes from different processes may be seen in different orders by different processes.', above statement defines which consistency model?

  1. Causal Consistency Model
  2. FIFO consistency Model
  3. Sequential Consistency Model
  4. Strict consistency Model
  

Question 642 :
What are the advantages of file replication ?

  1. Improves availability -performance
  2. Decreases performance
  3. They are consistent
  4. Improves speed
  

Question 643 :
X.500 directory uses _______.

  1. User Information Tree
  2. Directory Information Tree
  3. Person Information Tree
  4. system Information Tree
  

Question 644 :
Time interval from a request send to its critical region execution completed is called ________.

  1. System throughput
  2. Message complexity
  3. Synchronization delay
  4. Response time
  

Question 645 :
Web-based office suite supporting shared editing of documents held on Google servers.

  1. Gmail
  2. Google Talk
  3. Google News
  4. Google Docs
  

Question 646 :
Which failures Response lies outside a specified time interval

  1. Timing Failure
  2. Omission failure
  3. Crash Failure
  4. Arbitrary Failure
  

Question 647 :
An RPC (remote procedure call) is initiated by the _____.

  1. server
  2. client
  3. client after the sever
  4. a third party
  

Question 648 :
RMI stands for?

  1. Remote Mail Invocation
  2. Remote Message Invocation
  3. Remaining Method Invocation
  4. Remote Method Invocation
  

Question 649 :
A shared-memory system is said to support the __________ model if the value returned by a read operation on a memory address is always the same as the value written by the most recent write operation to that address.

  1. causal consistency
  2. strict consistency
  3. sequential consistency
  4. FIFO consistency
  

Question 650 :
In Erasure correction approach a missing packet is constructed from

  1. other successfully delivered packets
  2. last delivered packet
  3. first packet
  4. retransmitting packets
  

Question 651 :
In which OSI layer encryption and decryption happens ?

  1. Application
  2. Presentation
  3. Transport
  4. Data Link
  

Question 652 :
A type of the fault which occurs once and only the replacement/repair of a faulty component will allow the Distributed System to function normally

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

Question 653 :
In this type of process resilence group, the processes are equal and the decisions made are collective.

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

Question 654 :
Scaling transparency hides

  1. System expansion
  2. System collaboration
  3. System failure
  4. System security
  

Question 655 :
Hide where a resource is located which type of transparency is this?

  1. Location
  2. Migration
  3. Relocation
  4. Access
  

Question 656 :
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 657 :
X.500 is a way to route e-mail as well as to provide name lookup, using the _________________.

  1. Lightweight Directory Access Protocol
  2. Directory Access Protocol
  3. Global Directory Access Protocol
  4. Local Directory Access Protocol
  

Question 658 :
In X.500, hierarchical organization of entries which are distributed across one or more servers is

  1. Directory System Agents (DSA)
  2. Relative Distinguished Name (RDN)
  3. HTTPS
  4. HTTP
  

Question 659 :
A redundancy technique used to mask failure where extra (duplicate) hardware and/or software is added to the system.

  1. Information Redundancy
  2. Time Redundancy
  3. Physical Redundancy
  4. Space Redundancy
  

Question 660 :
What is the drawback of non-interleaving technique compared to interleaving technique in stream-oreinted communication

  1. Non-interleaving techniques is not providing synchronization.
  2. Non-interleaving technique is more complex.
  3. Non-interleaving technique does not handle loss of packets.
  4. Non-interleaving techniques requires larger buffer space.
  
Pages