For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?
A. 1
B. 2
C. 3
D. 4
E. None of the above
Answer: Option B
Solution(By Examveda Team)
Dekker'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 an unpublished paper on sequential process descriptions and his manuscript on cooperating sequential processes.This Question Belongs to Computer Fundamentals >> Operating System
Related Questions on Operating System
If there are multiple recycle bin for a hard disk
A. You can set different size for each recycle bin
B. You can choose which recycle bin to use to store your deleted files
C. You can make any one of them default recycle bin
D. None of above
A. You can find deleted files in recycle bin
B. You can restore any files in recycle bin if you ever need
C. You can increase free space of disk by sending files in recycle bin
D. You can right click and choose Empty Recycle Bin to clean it at once
If the displayed system time and date is wrong, you can reset it using
A. Write
B. Calendar
C. Write file
D. Control panel
Join The Discussion