Advertisements
Advertisements
प्रश्न
A student appears in an objective test which contain 5 multiple choice questions. Each question has four choices out of which one correct answer.
How will the answer change if each question may have more than one correct answers?
Advertisements
उत्तर
When each question has more than 1 correct answer.
Selecting the correct choice from the 4 choice can be done is
4C1 or 4C2 or 4C3 or 4C4 ways.
4C1 = 4 = 4C3
4C1 = `(4 xx 3)/(2 xx 1)` = 6
4C4 = 1
∴ 4C1 + 4C2 + 4C3 + 4C4 = 4 + 6 + 4 + 1
= 15
Each question can be answered in 15 ways.
Number of questions = 5
∴ Total number of ways = 155
APPEARS IN
संबंधित प्रश्न
Find r if `""^5P_r = 2^6 P_(r-1)`
In how many of the distinct permutations of the letters in MISSISSIPPI do the four I’s not come together?
In how many ways can the letters of the word ASSASSINATION be arranged so that all the S’s are together?
Which of the following are true:
(2 × 3)! = 2! × 3!
How many numbers of six digits can be formed from the digits 0, 1, 3, 5, 7 and 9 when no digit is repeated? How many of them are divisible by 10 ?
How many numbers of four digits can be formed with the digits 1, 2, 3, 4, 5 if the digits can be repeated in the same number?
Write the number of arrangements of the letters of the word BANANA in which two N's come together.
Write the number of numbers that can be formed using all for digits 1, 2, 3, 4 ?
The number of permutations of n different things taking r at a time when 3 particular things are to be included is
Number of all four digit numbers having different digits formed of the digits 1, 2, 3, 4 and 5 and divisible by 4 is
In a room there are 12 bulbs of the same wattage, each having a separate switch. The number of ways to light the room with different amounts of illumination is
How many 6-digit telephone numbers can be constructed with the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 if each numbers starts with 35 and no digit appear more than once?
Evaluate the following.
`((3!)! xx 2!)/(5!)`
The greatest positive integer which divide n(n + 1) (n + 2) (n + 3) for all n ∈ N is:
For all n > 0, nC1 + nC2 + nC3 + …… + nCn is equal to:
The total number of 9 digit number which has all different digit is:
The number of ways to arrange the letters of the word “CHEESE”:
If `""^(("n" – 1))"P"_3 : ""^"n""P"_4` = 1 : 10 find n
If the letters of the word GARDEN are permuted in all possible ways and the strings thus formed are arranged in the dictionary order, then find the ranks of the words
DANGER
How many words (with or without dictionary meaning) can be made from the letters of the word MONDAY, assuming that no letter is repeated, if
| C1 | C2 |
| (a) 4 letters are used at a time | (i) 720 |
| (b) All letters are used at a time | (ii) 240 |
| (c) All letters are used but the first is a vowel | (iii) 360 |
