Top 150+ Solved Distributed Computing System (DCS) MCQ Questions Answer
Q. all related objects moved and left to a server upon the first RPC
a. call by value
b. call by move
c. call by visit
d. call by reference
Q. What is the feature of stateful server?
a. longer server recovery time
b. quick recovery after reboot
c. file operations must beidempotent
d. simple server design
Q. is a process that prevents multiple threads or processes from accessing sharedresources at the same time.
a. critical section
b. deadlock
c. message passing
d. mutual exclusion
Q. Absolute time synchronization can beachieved using
a. vector time stamping method
b. christian’s method
c. lamport’s method
d. ricart-agrawala algorithm
Q. Which mutual exclusion algorithm is useful when the membership of the group is unknown?
a. centralized
b. lamport’s.
c. token ring
d. decentralized algorithm
Q. Which event is concurrent with the vectorclock (2, 8, 4)?
a. (3,9,5)
b. (3,8,4)
c. (1,7,3)
d. (4,8,2)
Q. A client gets a timestamp of 4:12:30.500 from atime server. The elapsed time between the requestand response was 20 msec (0.020 sec).The currenttime on the client is 4:12:30.510. Using Cristian’salgorithm, what is the time set to on theclient?
a. 1970-01-01 04:12:30
b. 1970-01-01 04:12:30
c. 1970-01-01 04:12:32
d. 1970-01-01 04:12:32
Q. Which of the following is an example ofelection algorithm.
a. berkley algorithm:
b. bully algorithm.
c. cristian’s algorithm
d. lamport’s
Q. RAYMOND'S TREE BASEDALGORITHM is an
a. non- token based algorithm.
b. token based algorithm.
c. centralized basedalgorithm
d. physical clocksynchronization algorithm.
Q. Suzuki-Kasami's Broadcast Algorithm isan
a. non- token based algorithm.
b. token based algorithm.
c. centralized basedalgorithm
d. physical clocksynchronization algorithm.
Q. Full form of NTP is:
a. network time protocol
b. new time protocol
c. new timestamp protocol
d. network timestampprotocol