Step 1: Define events.
Let $A$ = ball drawn from Bag A, $B$ = ball drawn from Bag B. Each bag is equally likely $\Rightarrow P(A)=P(B)=\tfrac{1}{2}$.
Step 2: Find probability of Red from each bag.
- From Bag A: $P(R|A)=\tfrac{3}{7}$.
- From Bag B: $P(R|B)=\tfrac{5}{11}$.
Step 3: Total probability of Red.
\[
P(R) = P(A)P(R|A)+P(B)P(R|B) = \tfrac{1}{2}\cdot\tfrac{3}{7}+\tfrac{1}{2}\cdot\tfrac{5}{11}
\]
\[
= \tfrac{3}{14}+\tfrac{5}{22} = \tfrac{33}{154}+\tfrac{35}{154}=\tfrac{68}{154}=\tfrac{34}{77}.
\]
Step 4: Apply Bayes' theorem.
\[
P(B|R)=\frac{P(B)\cdot P(R|B)}{P(R)}=\frac{\tfrac{1}{2}\cdot\tfrac{5}{11}}{\tfrac{34}{77}}
\]
\[
= \frac{5}{22}\cdot\frac{77}{34}=\frac{385}{748}=\tfrac{35}{68}.
\]
Step 5: Conclusion.
Thus, the probability that the Red ball came from Bag $B$ is $\tfrac{35}{68}$.
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:
\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.