How many fourdigit numbers, each divisible by 4 can be formed using the digits 5, 6, 7, 8, 9, repetition of digits being allowed in any number?
75
100
125
150
Quiz Recommendation System API Link  https://fresherbellquizapi.herokuapp.com/fresherbell_quiz_api
#  Quiz 

1
Discuss

If P(A)=2/5, P(B)=3/10 and P(A ∩ B) =51, then P(A'  B'). P(B'  A') is equal to
Solution 
2
Discuss

12 person are seated at a round table. Number of ways of selecting 2 persons not adjacent to each other is
Solution 
3
Discuss

A polygon has 44 diagonals. What is the number of its sides?
Solution 
4
Discuss

A, B, C, and D are four points, any three of which are noncollinear. Then, the number of ways to construct three lines each joining a pair of points so that the lines do not form a triangle is
Solution 
5
Discuss

A number lock on a suitcase has 3 wheels each labeled with 10 digits from 0 to 9. If the opening of the lock is a particular sequence of three digits with no repeats, how many such sequences will be possible?
Solution 
6
Discuss

A biased coin in tossed thrice. What is the probability that heads turns out at least twice considering that the probability of a head is 60%?
Solution 
7
Discuss

There are 6 letters for 3 envelopes. In how many different ways can the envelopes be filled?
Solution 
8
Discuss

There are seven pairs of black shoes and five pairs of white shoes. They are all put into a box and shoes are drawn one at a time. To ensure that at least one pair of black shoes are taken out, what is the number of shoes required to be drawn out?
Solution 
9
Discuss

Three unbiased coins are tossed. What is the probability of getting at most two heads ?
Solution 
10
Discuss

Two variants of the CAT paper are to be given to 12 students. In how many ways can the students be placed in two rows of six each so that there should be no identical variants side by side and that the students sitting one behind the other should have the same variant. Find the number of ways this can be done
Solution 
#  Quiz 
Copyright © 2020 Inovatik  All rights reserved