Distributed Computing System Set 2
On This Page
This set of Distributed Computing System DCS Multiple Choice Questions & Answers (MCQs) focuses on Distributed Computing System Set 2
Q1 | all related objects moved and left to a server upon the first RPC
- call by value
- call by move
- call by visit
- call by reference
Q2 | What is the feature of stateful server?
- longer server recovery time
- quick recovery after reboot
- file operations must beidempotent
- simple server design
Q3 | is a process that prevents multiple threads or processes from accessing sharedresources at the same time.
- critical section
- deadlock
- message passing
- mutual exclusion
Q4 | Absolute time synchronization can beachieved using
- vector time stamping method
- christian’s method
- lamport’s method
- ricart-agrawala algorithm
Q5 | Which mutual exclusion algorithm is useful when the membership of the group is unknown?
- centralized
- lamport’s.
- token ring
- decentralized algorithm
Q6 | Which event is concurrent with the vectorclock (2, 8, 4)?
- (3,9,5)
- (3,8,4)
- (1,7,3)
- (4,8,2)
Q7 | 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?
- 1970-01-01 04:12:30
- 1970-01-01 04:12:32
Q8 | NTP is layer protocol.
- application
- session
- transport
- physical
Q9 | Which of the following is an example ofelection algorithm.
- berkley algorithm:
- bully algorithm.
- cristian’s algorithm
- lamport’s
Q10 | For each critical section (CS) execution, Ricart-Agrawala algorithm requires messages per CS execution and the Synchronization delay in thealgorithm is .
- 3(n − 1), t
- 2(n − 1), t
- (n − 1), 2t
- (n − 1), t
Q11 | For each critical section (CS) execution, maekawa’s algorithm requires messages per CS execution and the Synchronization delay in thealgorithm is .
- √n , t
- 2√n , t
- 3√n , t
- 3√n , 2t
Q12 | RAYMOND'S TREE BASEDALGORITHM is an
- non- token based algorithm.
- token based algorithm.
- centralized basedalgorithm
- physical clocksynchronization algorithm.
Q13 | Suzuki-Kasami's Broadcast Algorithm isan
- non- token based algorithm.
- token based algorithm.
- centralized basedalgorithm
- physical clocksynchronization algorithm.
Q14 | Full form of NTP is:
- network time protocol
- new time protocol
- new timestamp protocol
- network timestampprotocol
Q15 | Which algorithm requires "1 to ∞" messages to enter and leave a criticalregion?
- token ring algorithm
- centralized algorithm
- decentralized algorithm
- distributed algorithm
Q16 | Pretransfering also known as
- premigrating
- precopying
- prefiltering
- postcopying
Q17 | change the state of thread from suspe
- run()
- yield()
- destroy()
- start()
Q18 | Distributed syatem consists of set of resour
- printer
- processor
- cd
- processes
Q19 | This is not feature of cooperative algorithm
- complex
- larger overhead
- worst stability
- better stability
Q20 | How is access to resources of variousmachines is done?
- remote logging using ssh or telnet
- zone are configured forautomatic access
- ftp is not used
- ftp is used
Q21 | What are the characteristics of data migration?
- transfer data by entire file or immediate portion required
- transfer the computation rather than the data
- execute an entire process or parts of it at different sites
- execute an entire process or parts of it at same site
Q22 | What are the characteristics of computation migration?
- transfer data by entire file or immediate portion required
- transfer the computation rather than the data
- execute an entire process or parts of it at different sites
- execute an entire process or parts of it at same site
Q23 | What are the characteristics of process migr
- transfer data by entire file or immediate portion required
- transfer the computation rather than the data
- execute an entire process or parts of it at different sites
- execute an entire process or parts of it at same site
Q24 | When the process issues an I/O request
- it is placed in an i/o queue
- it is placed in a waitingqueue
- it is placed in the readyqueue
- it is placed in the job queue
Q25 | Absolute time ordering of all sharedaccesses matters in
- sequential consistency
- casual consistency
- strict consistency
- weak consistency