D) race condition 2. (24 pts) True/False 13) A counting semaphore can never be u
ID: 3699608 • Letter: D
Question
D) race condition 2. (24 pts) True/False 13) A counting semaphore can never be used as a binary semaphore 14) Atomic operations on a variable that is accessible to two processes do not require locking. 15) A traditional (or heavyweight) process has a single thread of control. 16) The value of a counting semaphore can range only between 0 and 1. 17) Mutex locks and binary semaphores are essentially the same thing. 18) In RR scheduling, the time quantum should be small with respect to the context-switch time. 19) Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long. 20) A common problem in FCFS scheduling algorithm is starvation.Explanation / Answer
13) TRUE
14) for correcteness lock is required TRUE
15) True
16) FALSE
17) TRUE
18) FALSE
19) TRUE
20) FALSE
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.