Distributed Computing MCQ's




Question 871 :
Security for information resource does not include

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

Question 872 :
Which of the following is a disadvantage of replication?

  1. Reduced network traffic
  2. If the database fails at one site, a copy can be located at another site.
  3. Each site must have the same storage capacity.
  4. Each transaction may proceed without coordination across the network.
  

Question 873 :
A process can enter into its critical section _______

  1. anytime
  2. when it receives a reply message from its parent process
  3. when it receives a reply message from all other processes in the system
  4. when it receives a reply message from its child process
  

Question 874 :
What is the advantage of caching in remote file access?

  1. Reduced network traffic by retaining recently accessed disk blocks
  2. Faster network access
  3. Copies of data creates backup automatically
  4. Copies of data resolves inconsistencies
  

Question 875 :
Distributed file system supports i)Remote Information Sharting ii)User Mobility iii)Unavailability iv)Diskless Workstations

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

Question 876 :
An email service is a typical example of messaging service, where a sender sends an email message to recipient.

  1. It never waits for a reply from the recipient
  2. it always waits for a reply from the reciepient before sending next
  3. it will always send the reply email message to the sender.
  4. it is a type of synchronous communication
  

Question 877 :
____________ used in replication of stocks

  1. Numerical deviation
  2. Staleness deviation
  3. Ordering deviation
  4. Time deviation
  

Question 878 :
In which pipeline ,the data between adjacent stages is controlled by handshaking protocol.

  1. Blocking pipeline
  2. Non-blocking pipeline
  3. Asynchronous pipeline
  4. Synchronous pipeline
  

Question 879 :
In _______ assignment of job is done at run

  1. Dynamic load balancing algorithm
  2. Static load balancing algorithm
  3. Symmetric load balancing algorithm
  4. Asymmetric load balancing algorithm
  

Question 880 :
Non-token based algorithms uses ______________to order requests for the critical section

  1. token
  2. Timestamp
  3. sequence number
  4. token ID
  

Question 881 :
In the case of____________ , changes to an open file are only locally visible.

  1. session semantics
  2. immutable files
  3. atomic transactions
  4. Client Interfacing
  

Question 882 :
_________ all related objects moved and left to a server upon the first RPC

  1. Call by value
  2. Call by move
  3. Call by visit
  4. Call by reference
  

Question 883 :
In a nutshell, what Birrell and Nelson suggested was allowing programs to call procedures located on other machines related to

  1. RPC
  2. IPC
  3. PROTOCOL
  4. BINDING
  

Question 884 :
In global google sysytem indexing define as

  1. index for the contents of the web that is similar to an index at the back of a book
  2. Serial nos
  3. Serial nos in parrallel
  4. index of data
  

Question 885 :
The Mekawa mutual exclusion algorithm requires _______ messages per Critical Section invocation

  1. 2N
  2. 2 √N
  3. 3N
  4. 3 √N
  

Question 886 :
What is true about No a priori knowledge about the processes ?

  1. Process assignment decisions should be dynamic i.e based on the current load of the system and not on some static policy
  2. Heuristic methods requiring less computational efforts
  3. Algorithms provide near optimal system performance with a minimum overhead
  4. Scheduling algorithms that operate based on the information about the chracteristics and resource requirements of the processes
  

Question 887 :
Which are the two complementary deadlock-prevention schemes using time stamps ?

  1. The wait-die - wound-wait scheme
  2. The wait-n-watch scheme
  3. The wound-wait scheme
  4. The wait-wound - wound-wait scheme
  

Question 888 :
Maekawa’s algorithm is a ___________ mutual exclusion algorithm.

  1. Token-based
  2. Voting-based
  3. Non-token based
  4. Tree-based
  

Question 889 :
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 890 :
Resource Record in DNS has_____.

  1. Mapping of domain Name to IP address
  2. Resources consumption records
  3. Key Performance Indicator for Domain
  4. Backup nodes IP Address
  

Question 891 :
Which mutual exclusion algorithm works when the membership of the group is unknown?

  1. Centralized.
  2. Ricart-Agrawala.
  3. Lamport.
  4. Token Ring.
  

Question 892 :
The sections of a program that need exclusive access to shared resources are referred as___________

  1. Critical sections
  2. deadlocks
  3. fairness
  4. starvation
  

Question 893 :
To what extent inconsistencies can be tolerated depends highly on the usage of a

  1. replication
  2. duplication
  3. resource
  4. data
  

Question 894 :
Full form of NTP is:

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

Question 895 :
In which type of failures we assume that communication links are nonfaulty, but that process P cannot distinguish crash failures from omission failures

  1. Fail-stop failures
  2. Fail-noisy failures
  3. fail-silent failures
  4. Fail-safe failures
  

Question 896 :
Writes done by a single process are seen by all other processes in the order in which they were issued, but writes from different processes may be seen in a different order by different processes is the necessary condition in ______

  1. Casual consistency
  2. FIFO consistency
  3. LRU consistency
  4. Optimal consistency
  

Question 897 :
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 898 :
A remote procedure call is __________.

  1. a single process
  2. a single thread
  3. a single stream
  4. inter-process communication
  

Question 899 :
Network File System writes data_____

  1. Index wise
  2. Automatic
  3. Synchronously
  4. Asynchronously
  

Question 900 :
Following is not a agreement to ensure consistency.

  1. 2PC
  2. 3PC
  3. Paxos
  4. P2P
  
Pages