Computer Distributed Computing (CDC) MCQ's




Question 151 :
Any successive write operation by a process on a data item x will be performed on a copy of x that is up to date with the value most recently read by that process.

  1. Monotonic-write
  2. Writes follows reads
  3. Read your writes
  4. Monotonic-read
  

Question 152 :
A remote procedure call is __________.

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

Question 153 :
Duplicating files on multiple machines improves i)availability ii)performance iii)intergrity iv)consistancy

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

Question 154 :
In X.500 the user interface program for access to one or more DSAs is a ___________________.

  1. Directory User Agent
  2. System User Agent
  3. Network User Agent
  4. World User Agent
  

Question 155 :
What are the characteristics of a distributed file system?

  1. Its users, servers and storage devices are dispersed
  2. Service activity is not carried out across the network
  3. They have single centralized data repository
  4. There are multiple dependent storage devices
  

Question 156 :
_________ 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 157 :
The time in which the remote updating is reflected locally is called as _________.

  1. Concurrency
  2. Consistency
  3. Availability
  4. Isolation
  

Question 158 :
The absence of _____________consistency is sometimes experienced when updating Web documents and subsequently viewing the effects.

  1. Read-your-writes
  2. Monotonic-writes
  3. Monotonic-Reads
  4. Writes-follow-reads
  

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

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

Question 160 :
A Client centric consistency model which states If a process reads the value of a data item x, any successive read operation on x by that process will always return that same value or a more recent value.

  1. Monotonic Reads
  2. Monotonic Writes
  3. Read your writes
  4. Writes your Reads
  

Question 161 :
For HDFS file system, Point out the correct statement.

  1. Each incoming file is broken into 32 MB by default
  2. Data blocks are replicated across different nodes in the cluster to ensure a low degree of fault tolerance
  3. DataNode is the slave/worker node and holds the user data in the form of Data Blocks
  4. Data blocks are replicated across different nodes in the cluster to ensure a low degree of fault tolerance
  

Question 162 :
Positioning a node in an m-dimensional geometric space requires ___distance measures to nodes with known positions.

  1. m+1
  2. m
  3. m-1
  4. 2m
  

Question 163 :
The placement of replica servers is

  1. optimization problem
  2. more of management issue
  3. consistency
  4. performance
  

Question 164 :
Which one is the disadvantage of Remote Procedure Call

  1. There is no flexibility in RPC for hardware architecture.
  2. support process oriented and thread oriented models.
  3. The effort to re-write and re-develop the code is minimum
  4. Many of the protocol layers are omitted by RPC to improve performance.
  

Question 165 :
File services should be provided across different operating systems and hardware platforms is called as _____.

  1. Openness
  2. Scalability
  3. Reliability
  4. Heterogeneity
  

Question 166 :
The technique that increases the system’s productivity.

  1. multiprogramming
  2. multitasking
  3. multiprocessing
  4. single-programming
  

Question 167 :
RAYMOND'S TREE BASED ALGORITHM is an ___

  1. Non- token based algorithm.
  2. Token based algorithm.
  3. Centralized Based algorithm
  4. physical clock synchronization algorithm.
  

Question 168 :
In Dynamic Load Balancing, jobs are reassigned at the runtime, depending upon the situation, that is, the load will be transferred from heavily loaded nodes to lightly loaded nodes. In this case, Statement 1: communication overhead wont effect the system performance with increase in number of processors. Statement 2: since more information is collected by an algorithm in short duration of time, the algorithm can make better decisions State which of the following holds true:

  1. Statement 1 is correct but statement 2 is false
  2. Statement 1 is false but statement 2 is correct
  3. Both the statements are incorrect
  4. Both the statements are correct
  

Question 169 :
An external time source that is often used as a reference for synchronizing computer clocks with real time is the __________

  1. Universal Centralized Time
  2. Unique Coordinated Time
  3. Unique Centralized Time
  4. Universal Coordinated Time
  

Question 170 :
Which algorithms are used for selecting a process to act as coordinator or sequencer? I. Centralized algorithm II. Election algorithm III. Ring algorithm IV. Chandy-Misra-Haas algorithm

  1. II and IV
  2. II, III, IV
  3. II and III
  4. II
  

Question 171 :
When potential causality exists between different messages is preserved in_______.

  1. Unoredered multicast
  2. FIFO ordered multicast
  3. Casually ordered multicast
  4. Totally ordered multicasts
  

Question 172 :
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 173 :
The example of persistent communication is

  1. Email
  2. Network communication
  3. file transfer
  4. sending messages
  

Question 174 :
Which file model supports consistent sharing which results in support of easy file caching and replication

  1. Structured File Model
  2. Unstructured File Model
  3. Mutable File Model
  4. Immutable File Model
  

Question 175 :
What are the problems of clock synchronization in distributed operating systems ? I. Processses make decision based only on local information II. The relevent information is scattered among multiple machines III. A single point of failure in the system should be avoided IV. No common clock or other precise global time source exists

  1. II, III and IV
  2. I, II and IV
  3. I, III and IV
  4. I, II, III, IV
  

Question 176 :
Centralize algorithm has one basic disadvantage.

  1. Single point failure
  2. Many process
  3. Not fair
  4. deadlock
  

Question 177 :
If a server was executing along running RPC computation and during the execution it comes to know that a clent has crashed then such calls are called as_______.

  1. Duplicate call
  2. Extra call
  3. Orphan RPC call
  4. Orphan RMI call
  

Question 178 :
Distributed Computing Environment (DCE), is a true _____________ system in that it is designed to execute as a layer of abstraction between existing (network) operating systems and distributed applications.

  1. Multiprocessing
  2. Middleware
  3. Top Level
  4. Operating
  

Question 179 :
Which of the following network is used to dissiminate information to its group members.

  1. Prior network
  2. Chief network
  3. Prime Network
  4. Overlay network
  

Question 180 :
Which among below is not Distributed system models are

  1. Architectural model
  2. Interaction model
  3. Fault model
  4. Performance model
  
Pages