For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?-A-1B-2C-3D-4E-None of the above-B-2

Question

For how many processes which are sharing common data, the Dekker&#39;s algorithm implements mutual exclusion?-A-1B-2C-3D-4E-None of the above-B-2

APTITUDE CRACK · Accepted Answer

B 2 Dekker&#39;s algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes. It allows two threads to share a single use resource without conflict, using only shared memory for communication. It avoids the strict alternation of a naive turn taking algorithm, and was one of the first mutual exclusion algorithms to be invented. Source: http://en.wikipedia.org/wiki/Dekker&#39;s_algorithm

Operating Systems Concepts - Engineering

For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?

For help Students Orientation
Mcqs Questions

Quick Links

Newsletter

Operating Systems Concepts - Engineering

For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?

Solution

For help Students Orientation Mcqs Questions

For help Students Orientation
Mcqs Questions