Distributed Computing MCQ's




Question 331 :
Which of the following is a form of distributed information system?

  1. Home system
  2. Transaction Processing System
  3. Pervasive system
  4. Enterprise Resource Planning system
  

Question 332 :
Which of the following is an transport layer protocol?

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

Question 333 :
Message passing system allows processes to __________

  1. communicate with one another without resorting to shared data
  2. communicate with one another by resorting to shared data
  3. share data
  4. name the recipient or sender of the message
  

Question 334 :
Which is NOT the characteristic of a DFS?

  1. reliability
  2. Scalability
  3. Transperency
  4. Upgradation
  

Question 335 :
Distributed multimedia system uses which type of transmission mode?

  1. Synchronous transmission mode
  2. Asynchronous transmission mode
  3. Isochronous transmission mode
  4. None of the above
  

Question 336 :
Which of the following is disadvantage of active replication

  1. Consistent replicas
  2. Minimal bandwidth costs
  3. Size of the parameters is small
  4. Processing power
  

Question 337 :
In a distributed file system, when a file’s physical storage location changes ___________

  1. File name needs to be changed
  2. File name need not to be changed
  3. File’s host name needs to be changed
  4. File’s local name needs to be changed
  

Question 338 :
An RPC (remote procedure call) is initiated by the _________

  1. Server
  2. Client
  3. Client after server
  4. A third party
  

Question 339 :
In distributed systems, election algorithms assumes that ____________

  1. a unique priority number is associated with each active process in system
  2. there is no priority number associated with any process
  3. priority of the processes is not required
  4. process work without number
  

Question 340 :
SRM protocol stands for

  1. Scalable Reliable Multispreading
  2. Scalable Recovery Multicasting
  3. Scalable Reliable Multicasting
  4. Scalable Recovery Multispreading
  

Question 341 :
Suzuki-Kasami's Broadcast Algorithm is an

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

Question 342 :
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 343 :
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 344 :
What is full form of AFS?

  1. Andrew File System
  2. Analog File System
  3. Acess File System
  4. Acess Fast System
  

Question 345 :
The data sequence of information that is time-dependent is called ___________

  1. Stream of data
  2. traditional data
  3. transactional data
  4. spatial data
  

Question 346 :
The name space of AFS seen by user processes is a conventional UNIX directory hierarchy, with a specific subtree ________ containing all of the shared files.

  1. cmu
  2. tmp
  3. root
  4. lib
  

Question 347 :
In which approach of distributed computing, workload is divided from heavily loaded nodes to lightly loaded nodes in an attempt to ensure good overall performance ?

  1. Load Balancing approach
  2. Task assignment Approach
  3. Load Sharing Approach
  4. Process migration
  

Question 348 :
In Raymond’s Algorithm, TOKEN is held by which node of the tree?

  1. Left most Leaf node
  2. Right most Leaf node
  3. Root node
  4. Intermediate node
  

Question 349 :
Number of REQUEST messages for entering the critical region can vary from N/2 to N in which algorithm? (N: Number of nodes)

  1. Singhal’s heuristic algorithm
  2. Raymond’s tree-based algorithm
  3. Ricart–Agrawala's algorithm
  4. Lamport’s algorithm
  

Question 350 :
Single coordinator approach has the following disadvantages : i.Simple implementation, ii.Simple deadlock handling, iii.Bottleneck

  1. i
  2. ii
  3. ii and iii
  4. iii
  

Question 351 :
Which of the following is not example of Information redundancy

  1. parity
  2. checksum
  3. Hamming codes
  4. Rollback if transaction aborts
  

Question 352 :
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 353 :
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 354 :
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 355 :
In which OSI layer encryption and decryption happens ?

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

Question 356 :
What are the advantages of file replication?

  1. Improves availability -performance
  2. Decreases performance
  3. Improves consistency
  4. Improves speed
  

Question 357 :
Write the event of following notations:M ~P ~C

  1. A crash occurs after sending the completion message and printing the text.
  2. A crash happens after sending the completion message, but before the text could be printed.
  3. A crash happens before the server could do anything.
  4. The text printed, after which a crash occurs before the completion message could be sent.
  

Question 358 :
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 359 :
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 360 :
A technique that allows more than one program to be ready for execution and provides the ability to switch from one process to another.

  1. multitasking
  2. multiprocessing
  3. multitasking
  4. multiprogramming
  
Pages