Explore topic-wise MCQs in Distributed Computing System (DCS).

This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Distributed Computing System (DCS) knowledge and support exam preparation. Choose a topic below to get started.

1.

For each critical section (CS) execution, maekawa’s algorithm requires

A. √n , t
B. 2√n , t
C. 3√n , t
D. 3√n , 2t
Answer» E.
Discussion
2.

For each critical section (CS) execution, Ricart-Agrawala algorithm requires

A. 3(n − 1), t
B. 2(n − 1), t
C. (n − 1), 2t
D. (n − 1), t
Answer» C. (n − 1), 2t
Discussion
3.

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

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» D. 1970-01-01 04:12:32
Discussion
4.

What are the advantages of token(with rings) passing approach?

A. i
B. ii and iii
C. i, ii and iii
D. i, ii and iv
Answer» E.
Discussion