Distributed Computing System Set 3

Computer Science Engineering (CSE),

Information Technology Engineering (IT)

Practice Mode Previous Next
On This Page

This set of Distributed Computing System DCS Multiple Choice Questions & Answers (MCQs) focuses on Distributed Computing System Set 3

Q1 | In Casual consistency model all processesshared accesses in
  • random order
  • same order
  • sequential order
  • specific order
Answer: same order
Q2 | In which of the following consistency model all writes become perceptible to allprocesses
  • strict
  • weak
  • casual
  • sequential
Answer: strict
Q3 |                  consistency is that write operations by the same process are performed in the correct ordereverywhere.
  • weak
  • strict
  • eventual
  • fifo
Answer: fifo
Q4 | 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.
  • monotonic-write
  • writes follows reads
  • read your writes
  • monotonic-read
Answer: writes follows reads
Q5 | replicas are used only toimprove access time on data
  • client initiated
  • server initiated
  • permanent
  • dynamic
Answer: client initiated
Q6 | In                                  receivers never acknowledge the successful delivery of multicast message but instead report onlywhen missing the message.
  • basic reliable multicasting
  • non-hierarchical feedback control
  • hierarchical feedback control
  • atomic multicast
Answer: non-hierarchical feedback control
Q7 | A problem with the                  protocol is that when the coordinator has crashed, participants may not be able to reach afinal decision.
  • one-phase commit
  • three-phase commit
  • two-phase commit
  • virtual synchrony
Answer: two-phase commit
Q8 | Optimistic logging protocols need to keeptrack of
  • independencies
  • checking points
  • dependencies
  • erroneous state
Answer: dependencies
Q9 | Processor Consistency model guarantees and conforms that
  • all write accomplished on identical memory location in identical sequence.
  • all write accomplished on random memory location in random sequence
  • all write accomplished on random memory location in identicalsequence
  • all write accomplished on identical memory location in random order
Answer: all write accomplished on identical memory location in identical sequence.
Q10 | Staleness deviations relate to thea replica was updated.
  • first time
  • most recent time
  • last time
  • previous time
Answer: last time
Q11 | The dynamic replication algorithmtakes into account
  • to reduce load on server
  • files on server can bemigrated anywhere
  • schedule processmigration
  • resource sharing
Answer: to reduce load on server
Q12 | To improve performance, many distributed systems
  • combine check pointing with recovery oriented computing
  • combine check pointing with message logging
  • combine check pointing with distributed commit
  • combine distributed commit with messagelogging.
Answer: combine check pointing with message logging
Q13 | File Replication is done to
  • increase complexity
  • increase cost
  • increase reliability
  • increase data
Answer: increase reliability
Q14 | in NFS which funtion is used for creatingnew file?
  • open()
  • create()
  • develope()
  • null()
Answer: create()
Q15 | which command is used to create adirectory
  • rmdir
  • symlink
  • mkdir
  • open
Answer: mkdir
Q16 | datanodes and namenode are two elementsof which file system?
  • afs
  • hdfs
  • nfs
  • none of the above
Answer: hdfs
Q17 | In which file system mapreduce function isused?
  • afs
  • nfs
  • hdfs
  • none of the above
Answer: hdfs
Q18 | In distributed file system, DNS stands for?
  • domain name system
  • domain name server
  • directory name service
  • disk name system
Answer: domain name system
Q19 | NFS file System uses Mechanism
  • rpc
  • corba
  • rmi
  • none of the above
Answer: rpc
Q20 | map and reduce are
  • libraries
  • functions
  • file system
  • os
Answer: functions
Q21 | In HDFS file System, A                  serves as the master and there is only oneNameNode per cluster
  • data node
  • namenode
  • replication
  • data block
Answer: namenode
Q22 | HDFS works in a fashion.
  • master-master
  • master-slave
  • slave-slave
  • none of the above
Answer: master-slave
Q23 | In HDFS file System,                   NameNode is used when the PrimaryNameNode goes down.
  • rack
  • data
  • secondary
  • primary
Answer: secondary
Q24 | In context of HDFS file system, Point out the wrong statement.
  • replication factor can be configured at a cluster level (default is set to 3) and also at afile level
  • block report from each datanode contains a list of all the blocks that are storedon that datanode
  • user data is stored on the local file system of datanodes
  • datanode is aware of the files to which the blocks stored on it belong to
Answer: datanode is aware of the files to which the blocks stored on it belong to
Q25 | In HDFS, .                  is the slave/workernode and holds the user data in the form of Data Blocks.
  • datanode
  • namenode
  • data block
  • replication
Answer: datanode
Previous Next