Distributed Computing MCQ's




Question 61 :
CPU scheduling is the basis of ___________


  1. multiprocessor systems
  2. multiprogramming operating systems
  3. larger memory sized systems
  4. first-come, first-served scheduling
  

Question 62 :
The __________consist of a network of personal computers, each with its own hard disk nad local files system and interconnected over the network termed as diskful workstations


  1. Workstation model
  2. Workstation -server model
  3. Processor-pool model
  4. Client-server model
  

Question 63 :
________enables users and application programs to complete their tasks despite the failure of hardware or software components


  1. Concurrency transparency
  2. Failure transparency
  3. Replication transparency
  4. Migration transparency
  

Question 64 :
In HDFS, . ________ is the slave/worker node and holds the user data in the form of Data Blocks.


  1. DataNode
  2. NameNode
  3. Data block
  4. Replication
  

Question 65 :
Having a single CPU and being able to pretend that there are more can be extended to other resources as well and is known as ______________.


  1. Resource management
  2. Resource virtualization
  3. Resource sharing
  4. Resource distribution
  

Question 66 :
When the process issues an I/O request __________


  1. It is placed in an I/O queue
  2. It is placed in a waiting queue
  3. It is placed in the ready queue
  4. It is placed in the Job queue
  

Question 67 :
The ___________________ fault describes the worst possible fault semantics where any type of error may occur.


  1. Timing
  2. Arbitrary
  3. Omission
  4. Non-timing
  

Question 68 :
What is not true about parallel computing


  1. A problem is broken in to discrete parts that can be solved concurrently
  2. Each part is further broken down to a series of instructions
  3. Instructions from each part execute simultaneously on different processor
  4. hardware limitation on the transmission speed
  

Question 69 :
What is DGC?


  1. Distributed Garbage Collection
  2. Digital Garbage Collection
  3. Distributed Garbage Connection
  4. Digital Garbage Connection
  

Question 70 :
Network operating system runs on ______


  1. Server of the network
  2. Every system in the network
  3. Both server and every system in the network
  4. Neigher on server nor on every sysyem in the network
  

Question 71 :
All methods in a remote interface must be declared to throw the ________to deal with unexpected network failure


  1. object
  2. exception
  3. method
  4. function
  

Question 72 :
What are the advantages of file replication?


  1. Improves availability - performance
  2. Decreases performance
  3. Decreases availability
  4. Increases Cost
  

Question 73 :
What are the advantages of token(with rings) passing approach ? I. One processor as coordinator which handles all requests II. No starvation if the ring is unidirectional III. 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, II and V
  2. I, II and IV
  3. II, III and IV
  4. II, IV and V
  

Question 74 :
Which one of the following file system hides the location where in the network the file is stored?


  1. hidden distributed file system
  2. transparent distributed file system
  3. escaped distribution file system
  4. spy distributed file system
  

Question 75 :
____________ is used to store the distributed objects permanently on to the data store


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

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


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

Question 77 :
X.500 directory uses _______.


  1. User Information Tree
  2. Directory Information Tree
  3. Person Information Tree
  4. system Information Tree
  

Question 78 :
The transparency that enables multiple instances of resources to be used, is called


  1. Replication transparency
  2. Scaling transparency
  3. Concurrency transparency
  4. Performance transparency
  

Question 79 :
Migrating some resources, Suspending the execution, migrating the process and then resuming is known as ______.


  1. Total Freezing
  2. Pre Transferring
  3. On demand Exchange
  4. On demand migration
  

Question 80 :
What are the different ways in which clients and servers are dispersed across machines ?


  1. Servers may not run on dedicated machines
  2. Servers and clients can be on same machines
  3. Distribution cannot be interposed between a OS and the file system
  4. OS cannot be distributed with the file system a part of that distribution
  

Question 81 :
The response time is short since process migration is not required in ______


  1. Workstation model
  2. Workstation -server model
  3. Processor-pool model
  4. Client-server model
  

Question 82 :
Retransmitting a message can be done using...


  1. a single multicast message sent to all processes.
  2. a multiple multicast message sent to all processes.
  3. a single broadcast message sent to all processes.
  4. a unicast message sent to all processes.
  

Question 83 :
Machine that places the request to access the data is generally called as _________.


  1. Server Machine
  2. Client Machine
  3. Request Machine
  4. Response Machine
  

Question 84 :
Which of the following is Election algorithm


  1. Berkley's Algorithm
  2. Cristian's Algorithm
  3. Lamport's Algorithm
  4. Bully Algorithm
  

Question 85 :
State transition failures happens


  1. Server fails
  2. Server reacts unexpectedly
  3. Client fails
  4. Network fails
  

Question 86 :
If timestamps of two events are same, then the events are ___________________


  1. concurrent
  2. non-concurrent
  3. monotonic
  4. non-monotonic
  

Question 87 :
In tokens, the primary function of the sequence number is _____


  1. to decide the priority
  2. to decide the sequence of processes
  3. to distinguish between low priority and high priority requests
  4. to distinguish between old and current requests
  

Question 88 :
X.500 Directory Service is a standard way to develop an electronic directory of people in an organization so that it can be part of a available to anyone in the world with Internet access.


  1. social directory
  2. local directory
  3. global directory
  4. personal directory
  

Question 89 :
The main problem with the reliable multicast scheme is that


  1. Support large number of receivers
  2. Support fixed number of receiver
  3. cannot support fixed numbers of receivers.
  4. cannot support large numbers of receivers.
  

Question 90 :
Which of the following is not a variable defined in Raymond's tree based algorithm:


  1. Holder
  2. Using
  3. Privilege
  4. Asked
  
Pages