Scribd
Upload
597 views6 pages

Distributed Computing Solved MCQs (Set-2)

This document contains 50 multiple choice questions about distributed computing systems. The questions cover topics such as remote procedure calls, stateful servers, mutual exclusion algorithms, logical clock synchronization methods, election algorithms, and consistency models. They assess understanding of fundamental concepts in distributed systems including communication, coordination, replication, and consistency.

Uploaded by

Yilma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
597 views6 pages

Distributed Computing Solved MCQs (Set-2)

This document contains 50 multiple choice questions about distributed computing systems. The questions cover topics such as remote procedure calls, stateful servers, mutual exclusion algorithms, logical clock synchronization methods, election algorithms, and consistency models. They assess understanding of fundamental concepts in distributed systems including communication, coordination, replication, and consistency.

Uploaded by

Yilma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Distributed Computing System (DCS) MCQs

[set-2]

26. 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
Answer: B

27. What is the feature of stateful server?


A. longer server recovery time
o m
B. quick recovery after reboot
. c
C. file operations must be idempotent
te
D. simple server design
a
Answer: A

q M
28.
shared resources at the sameM
c
is a process that prevents
time.
multiple threads or processes from accessing

A. critical section
B. deadlock
C. message passing
D. mutual exclusion
Answer: D

29. Absolute time synchronization can be achieved using


A. vector time stamping method
B. christian’s method
C. lamport’s method
D. ricart-agrawala algorithm
Answer: B

30. 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
Answer: A

31. Which event is concurrent with the vector clock (2, 8, 4)?
A. (3,9,5)
B. (3,8,4)
C. (1,7,3)
D. (4,8,2)
Answer: D

32. A client gets a timestamp of 4:12:30.500 from a


time server. The elapsed time between the request
and response was 20 msec (0.020 sec).
The current
time on the client is 4:12:30.510. Using Cristian’s
algorithm, what is the time set to on the
client?
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
Answer: C

33. NTP is layer protocol.


A. application
B. session
C. transport
D. physical
Answer: A

34. Which of the following is an example of election algorithm.


A. berkley algorithm:
B. bully algorithm.
C. cristian’s algorithm

Download more sets at McqMate.com


D. lamport’s
Answer: B

35. For each critical section (CS) execution, Ricart-Agrawala algorithm requires
messages per CS execution and the Synchronization delay in the
algorithm is .
A. 3(n ? 1), t
B. 2(n ? 1), t
C. (n ? 1), 2t
D. (n ? 1), t
Answer: B

36. For each critical section (CS) execution, maekawa’s algorithm requires
messages per CS execution and the Synchronization delay in the
algorithm is .
A. ?n , t
B. 2?n , t
C. 3?n , t
D. 3?n , 2t
Answer: D

37. RAYMOND'S TREE BASED ALGORITHM is an


A. non- token based algorithm.
B. token based algorithm.
C. centralized based algorithm
D. physical clock synchronization algorithm.
Answer: B

38. Suzuki-Kasami's Broadcast Algorithm is an


A. non- token based algorithm.
B. token based algorithm.
C. centralized based algorithm
D. physical clock synchronization algorithm.
Answer: B

39. Full form of NTP is:


A. network time protocol
B. new time protocol

Download more sets at McqMate.com


C. new timestamp protocol
D. network timestamp protocol
Answer: A

40. Which algorithm requires "1 to ?" messages to enter and leave a critical
region?
A. token ring algorithm
B. centralized algorithm
C. decentralized algorithm
D. distributed algorithm
Answer: A

41. Pretransfering also known as


A. premigrating
B. precopying
C. prefiltering
D. postcopying
Answer: B

42. change the state of thread from suspe


A. run()
B. yield()
C. destroy()
D. start()
Answer: D

43. Distributed syatem consists of set of resour


A. printer
B. processor
C. cd
D. processes
Answer: B

44. This is not feature of cooperative algorithm


A. complex
B. larger overhead
C. worst stability

Download more sets at McqMate.com


D. better stability
Answer: C

45. How is access to resources of various machines is done?


A. remote logging using ssh or telnet
B. zone are configured for automatic access
C. ftp is not used
D. ftp is used
Answer: A

46. What are the characteristics of data migration?


A. transfer data by entire file or immediate portion required
B. transfer the computation rather than the data
C. execute an entire process or parts of it at different sites
D. execute an entire process or parts of it at same site
Answer: A

47. What are the characteristics of computation migration?


A. transfer data by entire file or immediate portion required
B. transfer the computation rather than the data
C. execute an entire process or parts of it at different sites
D. execute an entire process or parts of it at same site
Answer: B

48. What are the characteristics of process migr


A. transfer data by entire file or immediate portion required
B. transfer the computation rather than the data
C. execute an entire process or parts of it at different sites
D. execute an entire process or parts of it at same site
Answer: C

49. When the process issues an I/O request


A. it is placed in an i/o queue
B. it is placed in a waiting queue
C. it is placed in the ready queue
D. it is placed in the job queue
Answer: A

Download more sets at McqMate.com


50. Absolute time ordering of all shared accesses matters in
A. sequential consistency
B. casual consistency
C. strict consistency
D. weak consistency
Answer: C

Download more sets at McqMate.com

You might also like