A bag contains 10 red balls and 15 blue balls. Two balls are drawn randomly without replacement. Given that the first ball drawn is red, the probability (rounded off to 3 decimal places) that both balls drawn are red is ________
Which of the following statements about threads is/are TRUE?
Which of the following process state transitions is/are NOT possible?
Consider the following two threads T1 and T2 that update two shared variables a and b. Assume that initially $a = 1$ and $b = 1$. Though context switching between threads can happen at any time, each statement of T1 or T2 is executed atomically without interruption.
T1:
$a = a + 1$;
$b = b + 1$;
T2:
$b = 2 * b$;
$a = 2 * a$;
Which one of the following options lists all the possible combinations of values of a and b after both T1 and T2 finish execution?