Distributed Computing MCQ

Question 401 : An RMI Server is responsible for _______

  1. All mentioned above
  2. Creating an instance of the remote object
  3. Exporting the remote object
  4. Binding the instance of the remote object to the RMI registry

Question 402 : Which of the following is correct about migration transparency?

  1. Local and remote objects should be accessed in a uniform way
  2. Objects are referred by logical names which hide the physical location of the objects
  3. Movement of object from one system to the other is invisible to user
  4. Sharing of objects without interference

Question 403 : 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 404 : Which of the following is disadvantage of NFS

  1. Easy to share if files are available on multiple machines
  2. Network slower than local disk
  3. Easier to administer server than client
  4. Access way more data that fits on your local disk

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

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

Question 406 : Backward error recovery requires

  1. Grouping
  2. Assurance
  3. checkpointing
  4. Validation

Question 407 : _______________ algorithm requires clients to periodically synchronize with central time server.

  1. Cristian’s algorithm
  2. Berkeley algorithm
  3. Lamport algorithm
  4. Election algorithm

Question 408 : In distributed systems, transaction coordinator

  1. starts the execution of transaction
  2. breaks the transaction into number of sub transactions
  3. coordinates the termination of the transaction
  4. all of the mentioned

Question 409 : A resources can be termed as one of the following-

  1. Physical and database
  2. Physical and distributed
  3. Physical and logical
  4. Logical and virtual

Question 410 : Which of the following two operations are provided by the IPC f

  1. write & delete message
  2. delete & receive message
  3. send & delete message
  4. receive & send message

Question 411 : Which one of the following is not true about GFS?

  1. Cluster Based Architecture
  2. Client Caching
  3. End users do not interact
  4. Server Replication

Question 412 : X.500 directory uses _______.

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

Question 413 : The security of distributed system can be achieved in terms of various security goals,which one is not the goal

  1. Authentication
  2. Authorization
  3. Confidentiality
  4. Denial Service

Question 414 : Replication model in which one copy is master and other copies are slaves is __________.

  1. Master-Slave
  2. Client -Server
  3. Peer-to-peer
  4. Permanent or

Question 415 : The protocols defined by X.500 include

  2. TCP,IP
  3. ISO,OSI
  4. IP

Question 416 : What is the drawback of non-interleaving technique compared to interleaving technique in stream-oreinted communication

  1. Non-interleaving techniques is not providing synchronization.
  2. Non-interleaving technique is more complex.
  3. Non-interleaving technique does not handle loss of packets.
  4. Non-interleaving techniques requires larger buffer space.

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

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

Question 418 : Which among the following is not performed be RPC Runtime

  1. Retransmission
  2. Routing
  3. Marshalling
  4. Encryption

Question 419 : Which transparency deals with providing efficient access to the system by hiding the implementation details.

  1. Location Tranparency
  2. Access Tranparency
  3. Network Tranparency
  4. Failure Tarnsparency

Question 420 : For execution on process need

  1. Throughput
  2. Timer
  3. Resources
  4. Access Time

Question 421 : What is not a major goal for building distributed systems?

  1. Resource sharing
  2. Computation speedup
  3. Reliability
  4. Simplicity

Question 422 : In mutual exclusion algorithm, number of messages per Critical Section invocation should be_________.

  1. minimized
  2. Maximized
  3. Remain same
  4. monotonic

Question 423 : 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 424 : According to the ring algorithm, links between processes are _____

  1. Bidirectional
  2. Unidirectional
  3. Both bidirectional and unidirectional
  4. None of the mentioned

Question 425 : 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 426 : In a distributed system, information is exchanged through __________.

  1. Memory sharing
  2. Message passing
  3. Email sending
  4. Network sharing

Question 427 : A single NFS write procedure ____________

  1. can be atomic
  2. is atomic
  3. is non atomic
  4. is automatic

Question 428 : Deterministic and probabilistic algorithms are the types of _____________.

  1. Static Load balancing algorithm
  2. Dynamic Load balancing algorithm
  3. Distributed
  4. Centralized

Question 429 : A system with "m" CPUs and "n" processes has the following case "m>n" in case of task assignment approch how scheduling will takes place ?

  1. There is a need to schedule the processes on CPUs and several processes may be assigned to each CPU
  2. Some CPUs may remain idle or work on processes allocated earlier
  3. Each process is allocated to one CPU
  4. This kind of senario does not exist

Question 430 : To enforce ………………….. two functions are provided enter-critical and exit-critical, where each function takes as an argument the name of the resource that is the subject of competition.

  1. Deadlock
  2. Starvation
  3. Mutual exclusion
  4. Synchronization

Question 431 : To what extent inconsistencies can be tolerated depends highly on the usage of a

  1. replication
  2. duplication
  3. resource
  4. data

Question 432 : 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 433 : What is not true about Persistent Communication

  1. Message submitted for transmission is stored by communication system for as long as it takes to deliver it to receiver
  2. Not necessary for receiver to be executing at the time message submission
  3. Not necessary for sender to continue execution after submitting a message
  4. Sender and receiver has to be active simultaneously

Question 434 : For proper synchronization in distributed systems _____

  1. prevention from the deadlock is must
  2. prevention from the starvation is must
  3. prevention from the deadlock & starvation is must
  4. prevention from deadlock is not necessary

Question 435 : The Ricart & Agrawala distributed mutual exclusion algorithm is:

  1. More efficient and more fault tolerant than a centralized algorithm.
  2. More efficient but less fault tolerant than a centralized algorithm
  3. Less efficient but more fault tolerant than a centralized algorithm
  4. Less efficient and less fault tolerant than a centralized algorithm

Question 436 : 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 437 : If file system is growing without affecting performance of the system then this Union feature is called as?

  1. portable
  2. robust
  3. Scalability

Question 438 : Compared to single sharing system, the distribute system has higher________and __________

  1. noise and irrelevance
  2. reliability and availability
  3. bottleneck and single point of failure
  4. noise and bottleneck

Question 439 : In distributed systems, a logical clock is associated with ______________.

  1. each instruction
  2. each process
  3. each register
  4. each ALU

Question 440 : The process which blocks pipeline stage from accepting and processing new data is called

  1. Pipeline pre-processing
  2. Pipeline Flush
  3. Pipeline Interlock
  4. Pipeline lag

Question 441 : The mount mechanism ________ a transitive property.

  1. exhibits
  2. does not exhibit
  3. may exhibit
  4. executes

Question 442 : Suspending, migrating all resources as well as process and then resuming is known as ______.

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

Question 443 : Which of the following is the drawback of static scheduling algorithm.

  1. Maximize the total processing time
  2. Maximum extent of resource utilization
  3. Get maximum throughput
  4. To adjust the system fluctuation

Question 444 : A socket uses ____________ to transmit data between the sender and the reciever.

  1. IPC
  2. IMC
  3. IBC
  4. API

Question 445 : Synchronization of complex stream data deals with-

  1. maintaining temporal relations between streams
  2. ensuring receiver receives data in the same order sent.
  3. sender and receiver being running at the same time
  4. receiving data without errors

Question 446 : ____lends itself to implementation in distributed systems as well as in shared-memory multiprocessor and uni-processor system.

  1. monitor
  2. message passing
  3. strong semaphore
  4. binary semaphore

Question 447 : Single point failure is observed in this type of process resilence group.

  1. Hierarchical Group
  2. flat group
  3. IETF group
  4. Collected process Group

Question 448 : Which of the following conditions is not requied to solve the critical section problem?

  1. Mutual Exclusion
  2. Progress
  3. Bounded Waiting
  4. Sharing

Question 449 : A semaphore is a shared integer variable that can not

  1. drop below zero
  2. be more than zero
  3. drop below one
  4. that cannot be more than one

Question 450 : Process of suspending execution at source and resuming at destination is known as_________.

  1. Freezing
  2. Suspension
  3. Distribution
  4. Migration