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.

Expert · Level 6 · 18 questions

Practice questions

01A (5)-digit number is formed using digits from (0) to (9). The first digit is not (0), and the digit (7) must occur exactly once. How many numbers can be formed?

0 reads0 helpful★ – (0)

Answer and explanation

02In a (4)-place locker code, each place can contain a digit from (1,2,3,4,5,6). Exactly (2) places must contain (6). How many codes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

03A bag tag has (3) colored strips arranged in order. (8) colors are available and adjacent strips cannot have the same color. How many tags are possible?

0 reads0 helpful★ – (0)

Answer and explanation

04In course registration, a student chooses (1) of (3) core subjects, (2) of (4) elective subjects with order, and (1) of (2) clubs. How many registrations are possible?

0 reads0 helpful★ – (0)

Answer and explanation

05In a (6)-digit bank token, the first (2) digits must be same and the last (4) digits must all be distinct. The first digit cannot be (0). How many tokens are possible?

0 reads0 helpful★ – (0)

Answer and explanation

06A question paper has (3) sections. A student must choose (2) questions from the first section with order, (1) from the second, and (1) from the third. The sections have (5,6,4) questions. How many ways are possible?

0 reads0 helpful★ – (0)

Answer and explanation

07In a digital clock app, a user chooses from (7) fonts and (6) colors. If (2) special fonts are available only with (3) colors and the remaining fonts are available with all colors, how many combinations are possible?

0 reads0 helpful★ – (0)

Answer and explanation

08A (4)-digit number is formed using (2,3,4,5,6,7). Digits cannot repeat and the number must be odd. How many numbers can be formed?

0 reads0 helpful★ – (0)

Answer and explanation

09In a true-false test of (6) questions, exactly (4) answers must be true and the first question must be false. How many answer patterns are possible?

0 reads0 helpful★ – (0)

Answer and explanation

10In a (5)-step online process, each step has (3) options. No two consecutive steps can have the same option, and the first option is fixed as (1). How many processes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

11A name plate uses (2) distinct symbols and (3) distinct letters. (5) symbols and (8) letters are available. If the first two places are for symbols and the next three are for letters, how many name plates are possible?

0 reads0 helpful★ – (0)

Answer and explanation

12A train ticket requires choosing (1) coach type, (1) seat type, and (1) meal option. The numbers of options are (4,3,5). If sleeper coach has only (2) meal options and the other (3) coaches have all (5) options, how many ticket combinations are possible?

0 reads0 helpful★ – (0)

Answer and explanation

13A (4)-digit number is formed using (0,1,2,3,4,5). Digits cannot repeat and the number must be less than (3000). How many numbers can be formed?

0 reads0 helpful★ – (0)

Answer and explanation

14A password has (3) lowercase letters and (1) special symbol in this order. Lowercase letters may repeat, and the special symbol is chosen from (4) options. If the first letter cannot be a vowel, how many passwords are possible?

0 reads0 helpful★ – (0)

Answer and explanation

15A photo-filter app has (5) frames, (6) effects, and (4) text styles. If (2) premium effects are available with only (2) text styles and the remaining effects are available with all (4) text styles, how many combinations are possible?

0 reads0 helpful★ – (0)

Answer and explanation

16A (5)-digit code is formed using (1,2,3,4). Each digit must appear at least once. How many such codes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

17In a sports tournament, gold, silver, and bronze medal winners are to be chosen from (6) players. If player (A) must not receive any medal, how many outcomes are possible?

0 reads0 helpful★ – (0)

Answer and explanation

18In a delivery code, the first (3) positions contain distinct letters chosen from (8) available letters and the last (3) positions contain digits from (0) to (9). If exactly one (0) must appear in the last (3) digits, 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.