adplus-dvertising

Welcome to the Counting Theory MCQs Page

Dive deep into the fascinating world of Counting Theory with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Counting Theory, a crucial aspect of Discrete Mathematics. In this section, you will encounter a diverse range of MCQs that cover various aspects of Counting Theory, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Discrete Mathematics.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Counting Theory. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Discrete Mathematics.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Counting Theory. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Counting Theory MCQs | Page 3 of 12

Q21.
A bag contains 25 balls such as 10 balls are red, 7 are white and 8 are blue. What is the minimum number of balls that must be picked up from the bag blindfolded (without replacing any of it) to be assured of picking at least one ball of each colour?
Discuss
Answer: (b).18
Q22.
How many substrings (of all lengths inclusive) can be formed from a character string of length 8? (Assume all characters to be distinct)
Discuss
Answer: (d).37
Q23.
The number of diagonals can be drawn in a hexagon is ______
Discuss
Answer: (a).9
Q24.
The number of binary strings of 17 zeros and 8 ones in which no two ones are adjacent is ___________
Discuss
Answer: (a).43758
Q25.
How many words that can be formed with the letters of the word ‘SWIMMING’ such that the vowels do not come together? Assume that words are of with or without meaning.
Discuss
Answer: (c).729
Q26.
A number lock contains 6 digits. How many different zip codes can be made with the digits 0–9 if repetition of the digits is allowed upto 3 digits from the beginning and the first digit is not 0?
Discuss
Answer: (b).453600
Q27.
Let M be a sequence of 9 distinct integers sorted in ascending order. How many distinct pairs of sequences, N and O are there such that i) each are sorted in ascending order, ii) N has 5 and O has 4 elements, and iii) the result of merging N and O gives that sequence?
Discuss
Answer: (a).84
Q28.
14 different letters of alphabet are given, words with 6 letters are formed from these given letters. How many number of words are there which have at least one letter repeated?
Discuss
Answer: (b).999988
Q29.
In how many ways can 10 boys be seated in a row having 28 seats such that no two friends occupy adjacent seats?
Discuss
Answer: (c).¹⁹P₁₀
Q30.
How many ways can 8 prizes be given away to 7 students, if each student is eligible for all the prizes?
Discuss
Answer: (b).40320
Page 3 of 12

Suggested Topics

Are you eager to expand your knowledge beyond Discrete Mathematics? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!