| 1 |
A non - orderly arrangement of thing s is called: |
- A. Permutation
- B. Equally likely
- C. Combination
- D. Equally likely
|
| 2 |
How many possible permutations can be formed from the wood COMMITTEE. |
- A. 45360
- B. 9
- C. 6
- D. None of them
|
| 3 |
Subset of sample space is called |
- A. Event
- B. Simple event
- C. Compound event
- D. Experiment
|
| 4 |
Probability of an impossible event is |
- A. Zero
- B. Negative
- C. Positive
- D. One
|
| 5 |
<sup>4</sup>C<sub>5</sub>= .................... |
- A. 5
- B. 1/5
- C. 0
- D. None of these
|
| 6 |
When each outcome of a sample is as equally likely to occur as any other, the out come are called. |
- A. Mutually exclusive
- B. Equally likely
- C. Exhaustive
- D. Not mutually
|
| 7 |
<sup>n</sup>P<sub>r</sub> can be solved by the formula |
|
| 8 |
Probability of a sure event is |
- A. Zero
- B. Less than one
- C. Greater than one
- D. One
|
| 9 |
If the chance of occurance of two events are same then such events are called |
- A. Independent events
- B. Dependent events
- C. Mutually exclusive events
- D. Equally likely events
|
| 10 |
Two events A and B are mutually exclusive if P(A<span style="color: rgb(0, 0, 0); font-family: 'Lucida Sans Unicode', 'Lucida Grande', sans-serif; font-size: 18px; line-height: 23.390625px;">∪</span>B) = |
- A. P(A) - P(B)
- B. P(A) + P(B)
- C. P(A)P(B) - P(A<span style="color: rgb(0, 0, 0); font-family: 'Lucida Sans Unicode', 'Lucida Grande', sans-serif; font-size: 18px; line-height: 23.390625px;">∪</span>B)
- D. P(A) + P(B) - P(A<span style="color: rgb(0, 0, 0); font-family: 'Lucida Sans Unicode', 'Lucida Grande', sans-serif; font-size: 18px; line-height: 23.390625px;">∪</span>B)
|
