For each critical section (CS) execution, maekawa’s algorithm requires messages per CS execution and the Synchronization delay in the algorithm is .

Mr. Dubey • 52.30K Points
Coach

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

(D) 3√n , 2t

Correct : Option (D)

Discusssion

Be the first to start discuss.

Q. If R be relation ‘<‘ from A = {1, 2, 3, 4} to B = {1, 3, 5} ie, (a, b) Î R iff a < b, then RoR– 1 is

Q. Expansion for DSS in DW is__________.

Q. Common deep learning applications include

Q. Quality planning is the process of developing a quality plan for

Q. Which software engineering team has no permanent leader?

Q. Select the incorrect statement: “Software engineers should

Q. Memory system performance is largely captured by?

Q. Network bottlenecks occur when data sets must be transferred

Q. The BOOT sector files of the system are stored in

Q. For each critical section (CS) execution, maekawa’s algorithm requires messages per CS execution and the Synchronization delay in the algorithm is .

Discusssion

Related MCQs