Update

Muft Shiksha™ एक 100% Free Education Portal है 🇮🇳, जिसका उद्देश्य Class 9–12 के हर विद्यार्थी तक High-Quality Education को पूरी तरह मुफ्त पहुँचाना है। 🇮🇳 हम मानते हैं कि अच्छी शिक्षा किसी student की आर्थिक स्थिति पर निर्भर नहीं होनी चाहिए। 🇮🇳 हर विद्यार्थी को वही Quality Study Material, MCQs, Quizzes, Exam Preparation, Concept-Based Learning और Bilingual Support मिलना चाहिए, जो आमतौर पर महंगी Coaching या Premium Platforms में मिलता है। Muft Shiksha™ 🇮🇳 इसी सोच के साथ बनाया गया है

Subjects

Mathematics

Fundamental principle of counting

In this Class 11 Mathematics topic from Permutations and Combinations, students learn how to count the total number of possible outcomes when a task is completed in successive stages. The fundamental principle of counting explains that if one step can be performed in one way and the next in another, the combined task can be counted by multiplying the choices at each stage. Students apply this idea to arrangements, selections, decision-making situations, and introductory permutation problems.

Hard · Level 4 · 25 questions

Practice questions

01In a project, the leader is selected from (6) seniors, the coder from (8) juniors, and the designer from (5) artists. The leader and coder cannot be from the same house; house counts among seniors are (2,4) and among juniors (3,5). How many teams are possible?

0 reads0 helpful★ – (0)

Answer and explanation

02In a code, the first and last places are filled by distinct letters from (5) letters, and the two middle places are filled from (0,1,2,3). The two middle digits cannot both be prime. How many codes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

03A student chooses (1) elective from Science, (1) from Arts, and (1) from Skill. Among (4) Science courses, one course can be taken with only (2) Skill courses, while the other (3) Science courses can be taken with (6) Skill courses. Arts has (5) options. How many selections are possible?

0 reads0 helpful★ – (0)

Answer and explanation

04A three-digit lock code is formed and then one letter is added. Digits are distinct, the number is divisible by (5), and if the last digit is (0), the letter cannot be a vowel. How many codes can be formed?

0 reads0 helpful★ – (0)

Answer and explanation

05An exam paper code has (2) media, (7) subjects, (4) sets, and (3) versions. In Mathematics only (2) versions are available, while the other subjects have (3). How many codes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

06In a (4)-digit telephone extension, the first digit cannot be (0), digits do not repeat, and exactly (2) digits are even. How many extensions are possible?

0 reads0 helpful★ – (0)

Answer and explanation

07A gift pack has (4) box choices, (6) ribbon choices, (5) card choices, and (7) sticker choices. If one special box and one special ribbon are chosen together, sticker choices reduce from (7) to (3). How many packs are possible?

0 reads0 helpful★ – (0)

Answer and explanation

08In a layered network, one node is selected from (3) nodes of the first layer, one from (4) nodes of the second layer, and one from (5) nodes of the third layer. One specific pair between the first and second layers is blocked. How many valid paths are possible?

0 reads0 helpful★ – (0)

Answer and explanation

09In a two-day trip, a different city must be chosen each day. There are 5 cities and 3 hotel categories each day. If the capital is chosen on day two, only 2 hotel categories are available for day two. How many plans are possible?

0 reads0 helpful★ – (0)

Answer and explanation

10In a (5)-place code, the first (2) places are filled by distinct letters from (7) letters, and the last (3) places by distinct digits. The fourth digit must be greater than the fifth digit. How many codes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

11One snack is to be selected from each of three counters. The counters have (6,7,8) items and contain (2,3,1) premium items respectively. How many ways are there to select exactly one premium item?

0 reads0 helpful★ – (0)

Answer and explanation

12There are (10) true-false questions. The last answer is fixed as true, and the first (3) answers cannot all be the same. How many answer patterns are possible?

0 reads0 helpful★ – (0)

Answer and explanation

13A code has first (2) distinct uppercase letters, then (2) vowels and (1) digit. If both vowels are the same, the digit must be even, and if the vowels are different, any digit is allowed. How many codes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

14A die is rolled to choose a card box. For a prime result a box with (5) cards is used, and for a non-prime result a box with (7) cards is used, then one of (4) colors is selected. How many outcomes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

15A survey has (6) questions. The first (2) questions have (4) options each, the next (3) have (5) options each, and the last has (3) options. If option (D) is chosen in the first question, only (2) options remain in the last question. How many answer patterns are possible?

0 reads0 helpful★ – (0)

Answer and explanation

16A four-stage machine sequence has (3,4,5,6) choices respectively. After one machine in the second stage, (2) machines in the third stage cannot be chosen. How many valid sequences are possible?

0 reads0 helpful★ – (0)

Answer and explanation

17A (5)-character badge has the first (2) places as digits and the next (3) places from (8) letters. The digit sum is even, digits are distinct, and the letters contain (X) exactly once. How many badges are possible?

0 reads0 helpful★ – (0)

Answer and explanation

18In a conference, a track, session, workshop, and certificate are chosen. In the normal (3) tracks there are (6) sessions, (5) workshops, and (2) certificate options; in the fourth track there are (3) sessions, (5) workshops, and no certificate option. How many selections are possible?

0 reads0 helpful★ – (0)

Answer and explanation

19A word-style code has the order vowel-consonant-vowel-consonant. There are (5) vowels and (21) consonants, vowels cannot repeat and consonants cannot repeat. How many codes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

20A student chooses one class each from 5 morning, 4 afternoon, and 6 evening classes. With the 2 live morning classes, the 3 recorded evening classes cannot be chosen. How many timetables are possible?

0 reads0 helpful★ – (0)

Answer and explanation

21In a (6)-digit OTP, digits may repeat and the first digit cannot be (0). The last two digits are equal, and that digit does not appear in the first four places. How many such OTPs are possible?

0 reads0 helpful★ – (0)

Answer and explanation

22On a website, a main category, subcategory, article, and language are selected. Among (8) main categories, (6) have (5) subcategories and (2) have (3) subcategories; every subcategory has (4) articles and (2) languages. How many page paths are possible?

0 reads0 helpful★ – (0)

Answer and explanation

23Using the digits (1,2,3,4,5), how many (4)-digit numbers can be formed without repetition and divisible by (2)?

0 reads0 helpful★ – (0)

Answer and explanation

24Using the digits (0,1,2,3,4,5), how many (5)-digit numbers can be formed without repetition and divisible by (5)?

0 reads0 helpful★ – (0)

Answer and explanation

25An admission code has first (2) distinct letters followed by (3) distinct digits. If letters are chosen from (A,B,C,D,E) and digits from (1,2,3,4,5,6), how many codes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

Add Muft Shiksha to your Home Screen

In Safari, tap Share, then Add to Home Screen.