For each critical section (CS) execution, Ricart-Agrawala algorithm requires messages per CS execution and the Synchronization delay in the algorithm is .

Home / Engineering / Distributed Computing System (DCS) / Question

Mr. Dubey • 51.17K Points
Coach

Q.) 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

(D) (n − 1), t

Correct answer : Option (B) - 2(n − 1), t

Discusssion

Related MCQs on Distributed Computing System (DCS)

Q. In software testing Verification is …..

Q. Bluetooth is an example of

Q. Dynamic Management View is a type of ___________

Q. Determine the binary numbers represented by 25.5

Q. The register in 68000 can contain up to bits.

Q. If R is a relation defined from set A to set B then------

Q. A 4-input neuron has weights 1, 2, 3 and 4. The transfer function is linear with the constant of proportionality being equal to 2. The inputs are 4, 10, 10 and 30 respectively. What will be the output?

Q. The source of all data warehouse data is the__________.

Q. To check whether string s1 contains another string s2, use

Q. An IP address contains________ bits ?

Q.) For each critical section (CS) execution, Ricart-Agrawala algorithm requires messages per CS execution and the Synchronization delay in the algorithm is .

Discusssion

Related MCQs on Distributed Computing System (DCS)