Discussion
A task signals a binary semaphore three times before any task waits on it. The waiting task will return
Answer: A
Correct answer: once, two of the three signals having been lost
A binary semaphore holds a single bit, so signalling it when it is already signalled changes nothing. Two of the three events are lost. A counting semaphore would have recorded all three, which is exactly the case counting semaphores exist for.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development