What is the probability of getting at least one six in a single throw of three unbiased dice?s
91/216
1/216
200/216
17/216
Quiz Recommendation System API Link - https://fresherbell-quiz-api.herokuapp.com/fresherbell_quiz_api
# | Quiz |
---|---|
1
Discuss
|
Two dice are thrown simultaneously. What is the probability of getting two numbers whose product is even?
Solution |
2
Discuss
|
One red flower, three white flowers, and two blue flowers are arranged in a line such that
Solution |
3
Discuss
|
In a single throw with four dice,the probability of throwing seven is
Solution |
4
Discuss
|
A person tosses an unbiased coin. When head turns up, he gets Rs.8 and tail turns up he loses Rs.4. If 3 coins are tossed, what is probability that he gets a profit of Rs.12?
SolutionPerson will get profit of Rs 12 only when there is 2H (Head) and 1T (Tail) H + H + T = 12 8 + 8 + (-4) = 12 Total outcome of 2 head and 1 tail = 23 = 8 i.e (T, H, TH, HT, HH, HHT, HTH, THH) Total event with 2H and 1 T is 3 therfore probability = 3/8 |
5
Discuss
|
In how many different ways can the letters of the word 'DETAIL' be arranged in such a way that the vowels occupy only the odd positions?
Solution |
6
Discuss
|
In a simultaneous throw of two dice, what is the probability of getting a total of 7?
Solution |
7
Discuss
|
How many four-digit numbers, each divisible by 4 can be formed using the digits 5, 6, 7, 8, 9, repetition of digits being allowed in any number?
Solution |
8
Discuss
|
The number of triangles that can be formed by choosing the vertices from a set of 12 points, seven of which lie on the same straight line, is
Solution |
9
Discuss
|
There are 20 people among whom two are sisters. Find the number of ways in which we can arrange them around a circle so that there is exactly one person between the two sisters.
Solution |
10
Discuss
|
There are 8 orators A, B, C, D, E, F, G, and H. In how many ways can the arrangements be made so that A always comes before B and B always comes before C.
Solution |
# | Quiz |
Copyright © 2020 Inovatik - All rights reserved