0% found this document useful (0 votes)
222 views3 pages

DPP - 02 Fundamental Principal of Counting

The document discusses fundamental principles of counting and provides examples of counting problems and their solutions. Some key examples include: - There are 10 ways to travel from Delhi to Agra and back using different buses for each trip. - If a coin is tossed 3 times, there are 8 possible outcomes. If tossed n times, there are 2^n possible outcomes. - If selecting 3 questions from exercises with 12, 18, and 10 questions respectively, there are 2,160 ways to make the selection. - If assigning 3 jobs to 3 people with each person getting only 1 job, there are 6 ways to make the assignments. The document contains 36 counting problems and their corresponding solutions.

Uploaded by

vidhi bisht
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
222 views3 pages

DPP - 02 Fundamental Principal of Counting

The document discusses fundamental principles of counting and provides examples of counting problems and their solutions. Some key examples include: - There are 10 ways to travel from Delhi to Agra and back using different buses for each trip. - If a coin is tossed 3 times, there are 8 possible outcomes. If tossed n times, there are 2^n possible outcomes. - If selecting 3 questions from exercises with 12, 18, and 10 questions respectively, there are 2,160 ways to make the selection. - If assigning 3 jobs to 3 people with each person getting only 1 job, there are 6 ways to make the assignments. The document contains 36 counting problems and their corresponding solutions.

Uploaded by

vidhi bisht
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

TOPIC : FUNDAMENTAL PRINCIPAL OF COUNTING

DPP : 02
1. There are 10 buses running between Delhi and Agra. In how many ways
can a man go from Delhi to Agra and return by a different bus?
2. A, B and C are three cities. There are 5 routes from A to B and 3 routes from
B to C. How many different routes are there from A to C via B?
3. There are 12 steamers plying between A and B. In how many ways could
the round trip from A be made if the return was made on (i) the same
steamer? (ii) a different steamer?
4. In how many ways can 4 people be seated in a row containing 6 seats?
5. In how many ways can 5 ladies draw water from 5 taps, assuming that no
tap remains unused?
6. In a textbook on mathematics there are three exercises A, B and C consisting
of 12, 18 and 10 questions respectively. In how many ways can three
questions be selected choosing one from each exercise?
7. In a school, there are four sections of 40 students each in XI standard. In
how many ways can a set of 4 student representatives be chosen, one from
each section?
8. In how many ways can a vowel, a consonant and a digit be chosen out of
the 26 letters of the English alphabet and the 10 digits?
9. How many 8-digit telephone numbers can be constructed using the digits 0
to 9 if each number starts with 270 and no digit appears more than once?
10. (a) A coin is tossed three times and the outcomes are recorded. How
many possible outcomes are there?
(b) How many possible outcomes if the coin is tossed:
(i) four times? (ii) five times? (iii) n times?
11. Find the number of different signals that can be generated by arranging at
least 2 flags in order (one below the other) on a vertical staff, if five different
flags are available.
12. How many 4-letter codes can be formed using the first 10 letters of the
English alphabet, if no letter can be repeated?
13. Given, A  {2, 3, 5} and B  {0, 1} . Find the number of different ordered pairs
in which the first entry is an element of A and the second is an element of B.
14. How many arithmetic progressions with 10 terms are there whose first
term is in the set {1, 2, 3} and whose common difference is in the set {2, 3, 4}?
15. There are 6 items in column A and 6 items in column B. A student is asked
to match each item in column A with an item in column B. How many
possible (correct or incorrect) answers are there to this question?
16. A mint prepares metallic calendars specifying months, dates and days in
the form of monthly sheets (one plate for each month). How many types of
February calendars should it prepare to serve for all the possibilities in the
future years?
17. From among the 36 teachers in a school, one principal and one vice-
principal are to be appointed. In how many ways can this be done?
18. A sample of 3 bulbs is tested. A bulb is labelled as G if it is good and D if it
is defective. Find the number of all possible outcomes.
19. For a set of five true or false questions, no student has written the all
correct answer and no two students have given the same sequence of
answers. What is the maximum number of students in the class for this
to be possible?
20. In how many ways can the following prizes be given away to a class of
20 students:
first and second in mathematics; first and second in chemistry; first in
physics and first in English?
21. Find the total number of ways of answering 5 objective-type questions,
each question having 4 choices.
22. A gentleman has 6 friends to invite. In how many ways can he send
invitation cards to them, if he has 3 servants to carry the cards?
23. In how many ways 6 rings of different types can be worn in 4 fingers?
24. In how many ways can 5 letters be posted in 4 letter boxes?
25. How many 3-letter words can be formed using a, b, c, d, e if
(i) repetition of letters is not allowed?
(ii) repetition of letters is allowed?
26. How many 4-digit numbers are there, when a digit may be repeated any
number of times?
27. How many numbers can be formed from the digits 1, 3, 5, 9 if repetition of
digits is not allowed?
28. How many 3-digit numbers are there with no digit repeated?
29. How many 3-digit numbers can be formed by using the digits 0, 1, 3, 5, 7
while each digit may be repeated any number of times?
30. How many 6-digit numbers can be formed from the digits 0, 1, 3, 5, 7, 9
when no digit is repeated? How many of them are divisible by 10?
31. How many natural numbers less than 1000 can be formed from the digits
0, 1, 2, 3, 4, 5 when a digit may be repeated any number of times?
32. How many 6-digit telephone numbers can be constructed using the digits
0 to 9, if each number starts with 67 and no digit appears more than once?
33. In how many ways can three jobs I, II and III be assigned to three persons
A, B and C if one person is assigned only one job and all are capable of
doing each job?
34. A number lock on a suitcase has three wheels each labelled with ten digits
0 to 9. If opening of the lock is a particular sequence of three digits with no
repeats, how many such sequences will be possible? Also, find the number
of unsuccessful attempts to open the lock.
35. A customer forgets a four-digit code for an automated teller machine (ATM)
in a bank. However, he remembers that this code consists of digits 3, 5, 6,
9. Find the largest possible number of trials necessary to obtain the correct
code.
36. In how many ways can 3 prizes be distributed among 4 girls, when
(i) no girl gets more than one prize?
(ii) a girl may get any number of prizes?
(iii) no girl gets all the prizes?

ANSWERS (DPP :02)

1. 90 2. 15 3. (i) 12 (ii) 132 4. 360 5. 120 6. 2160


7. 2560000 8. 1050 9. 2520 10. (a) 8 (b) (i) 16 (ii) 32 (iii) 2 n
11. 320 12. 5040 13. 6 14. 9 15. 720 16. 14
17. 1260 18. 8 19. 31 20. 57760000 21. 4 5
22. 36 23. 46 24. 45 25. (i) 60 (ii) 125 26. 9000
27. 64 28. 648 29. 100 30. 600, 120 31. 215
32. 1680 33. 6 34. 720, 719 35. 24 36. (i) 24 (ii) 64 (iii) 60

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy