Distributed Computing MCQ's




Question 751 :
Brain of computer is ____________

  1. Control unit
  2. Arithmetic and Logic unit
  3. Central Processing Unit
  4. Memory
  

Question 752 :
A distributed system is a collection of _______________ computers that appears to its users as a single coherent system.

  1. Independent
  2. Interconnected
  3. Interrelated
  4. Shared
  

Question 753 :
_________these policies are used in GFS to be highly available

  1. Fast Recovery , Chunk Replication
  2. Fast Recovery , Garbage Collection
  3. Master Replication , Data Integrity
  4. Master Replication , Garbage collection
  

Question 754 :
Message passing provides a mechanism to allow processes to communicate and to synchronize their actions ________

  1. By sharing the same address space
  2. without sharing the same address space
  3. by sharing the same process number and Process Identifier
  4. By sharing port number
  

Question 755 :
Processes are migrated to fulfill their ______requirements

  1. resource
  2. object
  3. thread
  4. component
  

Question 756 :
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 757 :
ISO OSI Model is invented by

  1. Zimmerman
  2. Dennis Richie
  3. Lamport
  4. Zippy
  

Question 758 :
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 759 :
which command is used to create a directory

  1. rmdir
  2. symlink
  3. mkdir
  4. open
  

Question 760 :
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 761 :
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 762 :
State whether the following statements are correct for the characteristics of monitor i) The local data variables are accessible not only by the monitors’ procedures but also by the external procedure. ii) A process enters the monitor by invoking one of its procedures. iii) Only one process may be excluded in the monitor at a time.

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

Question 763 :
What are the advantages of token(with rings) passing approach ?i) One processor as coordinator which handles all requestsii) No starvation if the ring is unidirectionaliii) There are many messages passed per section entered if few users want to get in section iv) One processor as coordinator which handles all requests v) Only one message/entry if everyone wants to get in

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

Question 764 :
Traditional election algorithms fail in wireless networks because____

  1. They assume that message passing is transient
  2. They assume that topology of network changes
  3. they assume that message passing is reliable and that the topology of the network does not change
  4. They assume that message passing is unreliable and topology of network changes
  

Question 765 :
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 766 :
Hide that a resource may move to another location which type of transparency is this?

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

Question 767 :
Which of the following allocates/deallocates buffers

  1. RRL
  2. Stub/skeleton layer
  3. Transport layer
  4. Networking layer
  

Question 768 :
stream oriented communication is suitable for applications like

  1. All the mentioned
  2. audio
  3. video
  4. movie
  

Question 769 :
_______socket primitive attach local address to the socket

  1. Accept
  2. Bind
  3. Connect
  4. Listen
  

Question 770 :
Which of the following is not a protocol defined by X.500?

  1. DAP (Directory Access Protocol)
  2. DSP (Directory System Protocol)
  3. DISP (Directory Information Shadowing Protocol)
  4. DGP (Directory Gateway Protocol)
  

Question 771 :
Which of the following process can be affected by other processes during execution in the system?

  1. init process
  2. child process
  3. parent process
  4. cooperating process
  

Question 772 :
The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________

  1. assigning ready processes to CPU
  2. assigning ready processes to waiting queue
  3. assigning running processes to blocked queue
  4. assigning new processes to cpu
  

Question 773 :
Following is not need of fault tolerance in distributed system.

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

Question 774 :
In global google system offering application-level software over the Internet as

  1. web application
  2. user application
  3. link application
  4. system application
  

Question 775 :
What is WPA?

  1. wi-fi protected access
  2. wired protected access
  3. wired process access
  4. wi-fi process access
  

Question 776 :
Type of grid computing is

  1. Collaborative Grid
  2. System Grid
  3. Process Grid
  4. Channel grid
  

Question 777 :
The difference in the time value of two Clocks is called_______

  1. Clock drift
  2. Clock skew
  3. Clock synchronization
  4. Difference clock
  

Question 778 :
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 779 :
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 780 :
______ cover the case of dealing with arbitrary failures by process Q, yet these failures are benign: they cannot do any harm.

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