Discrete Mathematics Questions and Answers – Counting – Combinations

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Counting – Combinations”.

1. There are 6 equally spaced points A, B, C, D, E and F marked on a circle with radius R. How many convex heptagons of distinctly different areas can be drawn using these points as vertices?
a) 7! * 6
b) 7C5
c) 7!
d) same area
View Answer

Answer: d
Explanation: Since all the points are equally spaced; hence the area of all the convex heptagons will be the same.

2. There are 2 twin sisters among a group of 15 persons. In how many ways can the group be arranged around a circle so that there is exactly one person between the two sisters?
a) 15 *12! * 2!
b) 15! * 2!
c) 14C2
d) 16 * 15!
View Answer

Answer: a
Explanation: We know that n objects can be arranged around a circle in \(\frac{(n−1)!}{2}\). If we consider the two sisters and the person in between the brothers as a block, then there will 12 others and this block of three people to be arranged around a circle. The number of ways of arranging 13 objects around a circle is in 12! ways. Now the sisters can be arranged on either side of the person who is in between the sisters in 2! ways. The person who sits in between the two sisters can be any of the 15 in the group and can be selected in 15 ways. Therefore, the total number of ways 15 *12! * 2!.

3. The number of words of 4 consonants and 3 vowels can be made from 15 consonants and 5 vowels, if all the letters are different is ________
a) 3! * 12C5
b) 16C4 * 4C4
c) 15! * 4
d) 15C4 * 5C3 * 7!
View Answer

Answer: d
Explanation: There are 4 consonants out of 15 can be selected in 15C4 ways and 3 vowels can be selected in 5C3 ways. Therefore, the total number of groups each containing 4 consonants and 3 vowels = 15C4 * 4C3. Each group contains 7 letters which can be arranged in 7! ways. Hence, required number of words = 15C4 * 5C3 * 7!.
advertisement
advertisement

4. How many ways are there to arrange 7 chocolate biscuits and 12 cheesecake biscuits into a row of 19 biscuits?
a) 52347
b) 50388
c) 87658
d) 24976
View Answer

Answer: b
Explanation: Consider the situation as having 19 spots and filling them with 7 chocolate biscuits and 19 cheesecake biscuits. Then we just choose 7 spots for the chocolate biscuits and let the other 10 spots have cheesecake biscuits. The number of ways to do this job is 19C7 = 50388.

5. If a, b, c, d and e are five natural numbers, then find the number of ordered sets(a, b, c, d, e) possible such that a+b+c+d+e=75.
a) 65C5
b) 58C6
c) 72C7
d) 74C4
View Answer

Answer: d
Explanation: Let assumes that there are 75 identical balls which are to be arranged in 5 different compartments (Since a, b, c, d, e are distinguishable). If the balls are arranged in the row. We have 74 gaps where we can place a ball in each gap since we need 5 compartments we need to place only 4 balls. We can do this in 74C4 ways.

6. There are 15 people in a committee. How many ways are there to group these 15 people into 3, 5, and 4?
a) 846
b) 2468
c) 658
d) 1317
View Answer

Answer: d
Explanation: The number of ways to choose 3 people out of 9 is 15C3. Then, number of ways to choose 5 people out of (15-3) = 12 is 12C5. Finally, the number of ways to choose 4 people out of (12-4) = 8 is 8C4. Hence, by the rule of product, 15C3 + 12C5 + 8C4 = 1317.

7. There are six movie parts numbered from 1 to 6. Find the number of ways in which they be arranged so that part-1 and part-3 are never together.
a) 876
b) 480
c) 654
d) 237
View Answer

Answer: b
Explanation: The total number of ways in which 6 part can be arranged = 6! = 720. The total number of ways in which part-1 and part-3 are always together: = 5!*2! = 240. Therefore, the total number of arrangements, in which they are not together is = 720 − 240 = 480.
advertisement

8. How many ways are there to divide 4 Indian countries and 4 China countries into 4 groups of 2 each such that at least one group must have only Indian countries?
a) 6
b) 45
c) 12
d) 76
View Answer

Answer: a
Explanation: The number of ways to divide 4+4=8 countries into 4 groups of 2 each is as follows: (10C2 * 10C2 * 10C2 * 10C2)/4! = 30. Since it is required that at least one group must have only Indian countries, we need to subtract 30 from the number of possible groupings where all 4 groups have 1 Indian country and 1 China country each. This is equivalent to the number of ways to match each of the 4 Indian countries with one China country: 4! = 24. Therefore, the answer is 30 – 24 = 6.

9. Find the number of factors of the product 58 * 75 * 23 which are perfect squares.
a) 47
b) 30
c) 65
d) 19
View Answer

Answer: b
Explanation: Any factor of this number should be of the form 5a * 7b * 2c. For the factor to be a perfect square a, b, c has to be even. a can take values 0, 2, 4, 6, 8, b can take values 0, 2, 4 and c can take values 0, 2. Total number of perfect squares = 5 * 3 * 2 = 30.
advertisement

10. From a group of 8 men and 6 women, five persons are to be selected to form a committee so that at least 3 women are there on the committee. In how many ways can it be done?
a) 686
b) 438
c) 732
d) 549
View Answer

Answer: a
Explanation: We may have (2 men and 3 women) or (1 men and 4 woman) or (5 women only). The Required number of ways = (8C2 × 6C3) + (8C1 × 6C4) + (6C5) = 686.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.