# CMI2020-A: 7

13 views

Basketball shots are classified into $close-range,\;mid-range$ and  $long-range$ shots. Long range shots are worth $3$ points, while close-range and mid-range shots are worth $2$ points. Of the shots that LeBron James attempts, $45\%$ are close-range, $25\%$ are mid-range, and $30\%$ are long-range. He successfully makes $80\%$ of the close-range shots, $48\%$ of the mid-range shots, and $40\%$ of the long-range shots.

What is the probability that a LeBron shot attempt is successful?

1. $\frac{1}{2}$
2. $\frac{4}{5}$
3. $\frac{3}{5}$
4. $\frac{4}{7}$
in Others
edited

## Related questions

1
16 views
We are given an array of $N$ words $W[1\dots N],$ and a length array $L[1\dots N]$, where each $L[i]$ denotes the length (number of characters) of $W[i]$. We are also given a line width $M$, which is assumed to be greater than every $L[i]$. We ... $N$?
Which of the following languages over the alphabet $\{0,1\}$ are $not$ recognized by deterministic finite state automata $(DFA)$ with $three$ states? Words which do not have $11$ as a contiguous subword Binary representations of multiples of three Words that have $11$ as a suffix Words that do not contain $101$ as a contiguous subword
Consider the following regular expressions over alphabet$\{a,b\}$, where the notation $(a+b)^+$ means $(a+b)(a+b)^*$: $r_1=(a+b)^+a(a+b)^*$ $r_2=(a+b)^*b(a+b)^+$ Let $L_1$ and $L_2$ be the languages defined by $r_1$ and $r_2$, respectively. Which of the following regular expressions define $L_1\cap L_2$ ... $(a+b)^*a\;b(a+b)^*$ $(a+b)^*b(a+b)^*a(a+b)^*$ $(a+b)^*a(a+b)^*b(a+b)^*$