MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Distributed Computing System (DCS)
→
General
→
For each critical section (CS) execution, maekawa’...
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.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
For each critical section (CS) execution, maekawa’s algorithm requires
For each critical section (CS) execution, Ricart-Agrawala algorithm requires
A client gets a timestamp of 4:12:30.500 from a
What are the advantages of token(with rings) passing approach?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies