Advertisements
Advertisements
Question
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
Solution
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
RELATED QUESTIONS
Evaluate 8!
if `1/(6!) + 1/(7!) = x/(8!)`, find x
How many 4-digit numbers are there with no digit repeated?
Find x in each of the following:
Find x in each of the following:
How many natural numbers not exceeding 4321 can be formed with the digits 1, 2, 3 and 4, if the digits can repeat?
In how many ways can 4 prizes be distributed among 5 students, when
(i) no student gets more than one prize?
(ii) a student may get any number of prizes?
(iii) no student gets all the prizes?
The number of five-digit telephone numbers having at least one of their digits repeated is
If k + 5Pk + 1 =\[\frac{11 (k - 1)}{2}\]. k + 3Pk , then the values of k are
The possible outcomes when a coin is tossed five times:
In how many ways can the letters of the word SUCCESS be arranged so that all Ss are together?
A coin is tossed 8 times, how many different sequences containing six heads and two tails are possible?
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
GARDEN
Find the sum of all 4-digit numbers that can be formed using digits 1, 2, 3, 4, and 5 repetitions not allowed?
Choose the correct alternative:
The product of r consecutive positive integers is divisible b
Find the number of permutations of n different things taken r at a time such that two specific things occur together.
A five-digit number divisible by 3 is to be formed using the numbers 0, 1, 2, 3, 4 and 5 without repetitions. The total number of ways this can be done is ______.
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 |
If m+nP2 = 90 and m–nP2 = 30, then (m, n) is given by ______.
Number of words from the letters of the words BHARAT in which B and H will never come together is ______.
