Distributed Computing MCQ

home MCQ Questions & Answer


Question 351 : In the tree structured directories _____________

  1. the tree has the stem directory
  2. the tree has the leaf directory
  3. the tree has the root directory
  4. the tree has no any directory
  

Question 352 : MPI and sockets are examples of

  1. Message oriented transient communication
  2. message oriented persistent communication
  3. Mobile Oriented Communication
  4. Object oriented permanent Communication
  

Question 353 : A type of the fault which occurs once and only the replacement/repair of a faulty component will allow the Distributed System to function normally

  1. Transient Fault
  2. Intermittent Fault
  3. Permanent Fault
  4. Temporary fault
  

Question 354 : Advantage of Data-caching model over the Remote service model

  1. Reduces network traffic
  2. Contention for the file servers
  3. Increased performance
  4. Contention for Network
  

Question 355 : The strongest form of memory coherence model, having the most stringent consistency requirement

  1. causal consistency
  2. strict consistency
  3. sequential consistency
  4. FIFO consistency
  

Question 356 : A shared-memory system is said to support the __________ model if the value returned by a read operation on a memory address is always the same as the value written by the most recent write operation to that address.

  1. causal consistency
  2. strict consistency
  3. sequential consistency
  4. FIFO consistency
  

Question 357 : The degree at which the conflicting read/write access is tolerated is defined as_________.

  1. Concurrency
  2. Consistency
  3. Availability
  4. Isolation
  

Question 358 : In X.500 Directory you can search for hundreds of thousands of people from a single place on the _______________.

  1. World Wide Web.
  2. at one place
  3. World directory
  4. Words largest file
  

Question 359 : The placement of replica servers is

  1. optimization problem
  2. more of management issue
  3. consistency
  4. performance
  

Question 360 : datanodes and namenode are two elements of which file system?

  1. AFS
  2. HDFS
  3. NFS
  4. None of the above
  

Question 361 : Computation of data is done in which component of SIMD

  1. Local Memory
  2. Front end Controllers
  3. Processing element
  4. Processor array
  

Question 362 : File Replication is done to _____

  1. increase complexity
  2. increase cost
  3. increase reliability
  4. increase data
  

Question 363 : The use of more information gives rise to_________.

  1. Information redundancy
  2. Time redundancy
  3. Physical redundancy
  4. Data Redundancy
  

Question 364 : In the following cases non – preemptive scheduling occurs?

  1. When a process switches from the running state to the ready sta
  2. When a process goes from the running state to the waiting state
  3. When a process switches from the waiting state to the ready sta
  4. shortest job scheduling
  

Question 365 : The following statement “Please give me load” is an example of which policy?

  1. Receiver initiated
  2. Sender Initiated
  3. Load estimation
  4. Load predication
  

Question 366 : 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 367 : A file appears to the file server as an ordered sequence of records in

  1. Unstructured files
  2. Structured files
  3. Immutable files
  4. Mutable files
  

Question 368 : What are the problems of clock synchronization in distributed operating systems ? I. Processses make decision based only on local information II. The relevent information is scattered among multiple machines III. A single point of failure in the system should be avoided IV. No common clock or other precise global time source exists

  1. II, III and IV
  2. I, II and IV
  3. I, III and IV
  4. I, II, III, IV
  

Question 369 : What are the characteristics of data migration?

  1. transfer data by entire file or immediate portion required
  2. transfer the computation rather than the data
  3. execute an entire process or parts of it at different sites
  4. execute an entire process or parts of it at same site
  

Question 370 : The capabiliy of a system to detcet & recover from failure is known as _____________________.

  1. fault tolerant & portable
  2. scalable & robust
  3. fault tolerant & robust
  4. potable & scalable
  

Question 371 : If a ® b and b ® c then a ® c. This property is :

  1. Transitivity
  2. Reflexivity
  3. concurrency
  4. Irreflexivity
  

Question 372 : Inter Process Communication takes place via

  1. Shared memory and message passing
  2. Decentralized memory and message passing
  3. Shared memory and message replicating
  4. Decentralized memory and message replicating
  

Question 373 : ____________ 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 374 : What are the characteristics of data migration?

  1. transfer data by entire file or immediate portion required
  2. transfer the computation rather than the data
  3. execute an entire process or parts of it at different sites
  4. execute limited portion of data
  

Question 375 : Which of the following is not an example of stream data

  1. Video
  2. Audio
  3. large data files
  4. text
  

Question 376 : _________ is an object acting as a gateway for the client side.

  1. skeleton
  2. stub
  3. remote
  4. server
  

Question 377 : To organise file systems on disk _______________

  1. they are split into one or more partitions
  2. information about files is added to each partition
  3. they are made on different storage spaces
  4. they are made on same storage spaces
  

Question 378 : Which of the following technique is not used for scheduling processes in Distributed System?

  1. Load balancing approach
  2. Task assignment approach
  3. Load sharing approach
  4. FCFS approach
  

Question 379 : The local operating system on the server machine passes the incoming packets to the _________

  1. server stub
  2. client stub
  3. client operating system
  4. Binding agent
  

Question 380 : ___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 381 : 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 382 : State which of the following holds true in Process Migration Statement 1: In non preemptive process migration,Process may be migrated during the course of its execution Statement 2: In preemptive process migration,Process may be migrated before it starts executing on its source node

  1. Statement 1 is correct but statement 2 is false
  2. Statement 1 is false but statement 2 is correct
  3. Both the statements are incorrect
  4. Both the statements are correct
  

Question 383 : X.500 Directory is also called

  1. global Yellow Pages directory
  2. global Blue Pages directory
  3. global White Pages directory
  4. global Black Pages directory
  

Question 384 : A ____________is a quartz crystal that oscillates at a well-defined frequency.

  1. Counter register
  2. Quartz crystal
  3. Constant register
  4. None of the mentioned
  

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

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

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

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

Question 387 : If an old process wants a resource held by a young process, the old one will wait happens in _______

  1. Wait-die
  2. Wound-wait
  3. Both
  4. None of the mentioned
  

Question 388 : 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 389 : Each process should get fair chance to execute the critical region, defines which property of mutual exclusion?

  1. Safety
  2. Liveness
  3. Fairness
  4. Scheduling
  

Question 390 : Remote service model for file accessing has

  1. Reduced contention for the network
  2. Reduced network traffic
  3. Client’s request is performed at the server’s node
  4. No contention for the file servers
  

Question 391 : The sever and client computer interact with each other using ________

  1. Specific Port Number and IP Address
  2. MAC Address
  3. MAC Address and Port Number
  4. MAC Address and IP Address
  

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

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

Question 393 : In Release consistency model: ____________ is used by a process to tell the system that it has just exited a critical section and ________ is used by a process to tell the system that it is about to enter a critical section

  1. acquire, release
  2. release, acquire
  3. entry, exit
  4. entry, out
  

Question 394 : What is full form of AFS?

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

Question 395 : 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 396 : In distributed systems, a logical clock is associated with

  1. each instruction
  2. each process
  3. each register
  4. none of the mentioned
  

Question 397 : The computer clock differs from the real time clock is known as ____

  1. Quartz crystal
  2. Clock drift
  3. Clock skew
  4. None of the mentioned
  

Question 398 : What of the following system is not multi-processor system?

  1. A system with multiple CPU, each CPU contains a single core.
  2. A system with a single CPU that has two core.
  3. A system with multiple CPU, each CPU contains two cores.
  4. A system with a single CPU that has a single core.
  

Question 399 : The _____ model is required in order to build systems with predictable behavior in case of fault

  1. Interaction model
  2. Fault model
  3. Architectural model
  4. Security model
  

Question 400 : Which layer is the layer closest to the transmission medium ?

  1. Physical
  2. Data link
  3. Network
  4. Transport