Computer Distributed Computing (CDC) MCQ's




Question 301 :
Absolute time synchronization can be achieved using

  1. Vector time stamping method
  2. Christian’s method
  3. Lamport’s method
  4. Ricart-Agrawala algorithm
  

Question 302 :
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 303 :
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 304 :
NTP is __________ layer protocol.

  1. Application
  2. session
  3. transport
  4. physical
  

Question 305 :
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}. Tasks T1 are assigned to node n1and tasks T2,T3,T4 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, T4T1-> 0, 6, 4, 0T2-> 6, 0, 8, 10T3-> 4, 8, 0, 0T4=> 0, 10, 0, 0

  1. 18
  2. 22
  3. 15
  4. 10
  

Question 306 :
A group server is responsible for_______ - ________ groups

  1. clean and deduct
  2. program and make funtional
  3. create and destroy
  4. advance and fail
  

Question 307 :
The security of a distributed system can be achieved by ______ used for their interactions .

  1. securing the processes and the channels
  2. securing the channels not process
  3. not securing the processes and the channels
  4. securing the processes not the channels
  

Question 308 :
All the resources are shared and integrated within one OS, in the computing paradigm named _________

  1. Distributed computing
  2. Centralized computing
  3. Cloud computing
  4. Parallel computing
  

Question 309 :
Which type of parallelism makes use of multiple processing elements simultaneously for solving any problem.

  1. Parallel Computing
  2. Cloud computing
  3. Grid computing
  4. Network computing
  

Question 310 :
In case of failure, a new transaction coordinator can be elected by _____

  1. Cristian's Algorithm
  2. Bully algorithm
  3. Both bully and Cristian's algorithm
  4. Lamport Algorithm
  

Question 311 :
which of the service offered by middleware is used to provide security to the various shared resources provided by the stystem?

  1. Persistance service
  2. Querying service
  3. Naming service
  4. Security service
  

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

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

Question 313 :
A global system of Interconnected Computer networks is called as

  1. Ethernet
  2. Intranet
  3. Internet
  4. Ultranet
  

Question 314 :
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 315 :
When a user refers to a particular file?

  1. system MFD is searched
  2. his own UFD is not searched
  3. both MFD and UFD are searched
  4. every directory is searched
  

Question 316 :
In mutual exclusion, processes requests to enter in

  1. Network
  2. Critical region
  3. Storage space
  4. Main memeory
  

Question 317 :
_____is unit of allocation and _____is unit of execution

  1. Process,Thread
  2. Thread,Process
  3. Procedure,process
  4. Method,Thread
  

Question 318 :
What are the two steps of a process execution?

  1. I/O - OS Burst
  2. CPU - I/O Burst
  3. Memory - I/O Burst
  4. OS - Memory Burst
  

Question 319 :
Message‐queuing (MQ) systems supports

  1. Transient Synchronous communication
  2. Transient asynchronous communication
  3. Persistent synchronous communication
  4. Persistent asynchronous communication
  

Question 320 :
In ________________________ each node periodically sends a message to the time server.

  1. Passive Time Server Centralized Algorithm
  2. Active Time Server Centralized Algorithm
  3. Global Averaging Distributed Algorithms
  4. Localized Averaging Distributed Algorithms
  

Question 321 :
Which is not an examples of state information ?

  1. Mounting information
  2. Description of HDD space
  3. Session keys
  4. Lock status
  

Question 322 :
___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 323 :
Staleness deviations relate to the ______________

  1. first time a replica was updated
  2. first time a replica was not updated
  3. last time a replica was updated
  4. last time a replica was not updated
  

Question 324 :
What is process?

  1. program in main memory
  2. Program in cache memory
  3. program in execution
  4. Program in secondary memory
  

Question 325 :
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 326 :
Which address is used to identify a process on a host by the transport layer?

  1. physical address
  2. logical address
  3. port address
  4. specific address
  

Question 327 :
A bully election algorithm:

  1. picks the first process to respond to an election request.
  2. relies on majority vote to pick the winning process.
  3. assigns the role of coordinator to the processs holding the token at the time of election.
  4. picks the process with the largest ID.
  

Question 328 :
The server does not handle the request itself but passes it to a seprate thread is called ____.

  1. iterative server
  2. multi-threaded server
  3. concurrent server
  4. distributed server
  

Question 329 :
Suppose that two processes detect the demise of the coordinator simultaneously and both decide to hold an election using the bully algorithm. What happens?

  1. Each of the higher-numbered processes will get two ELECTION messages, but will ignore the first one. The election will proceed as usual
  2. Each of the lower-numbered processes will get two ELECTION messages, but will ignore the first one. The election will proceed as usual
  3. Each of the lower-numbered processes will get two ELECTION messages, but will ignore the second one. The election will proceed as usual
  4. Each of the higher-numbered processes will get two ELECTION messages, but will ignore the second one. The election will proceed as usual
  

Question 330 :
What is WPA?

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