Question: There are two Threads stored in the Red-Black Tree data structure, where thread A has a vruntime value of 10 and thread B has a
There are two Threads stored in the Red-Black Tree data structure, where thread A has a vruntime value of 10 and thread B has a vruntime value of 20. What can necessarily be concluded from this?
1 . The priority of thread A is higher than that of thread B
2. The priority of thread B is higher than that of thread A
3. Both threads are in Ready mode (that is, Runnable)
4. No answer is correct
Step by Step Solution
3.44 Rating (170 Votes )
There are 3 Steps involved in it
The detailed answer for the above question is provided below The c... View full answer
Get step-by-step solutions from verified subject matter experts
