Permutations and Combinations

Get insights from 121 questions on Permutations and Combinations, answered by students, alumni, and experts. You may also ask and answer any question you like about Permutations and Combinations

Follow Ask Question
121

Questions

0

Discussions

4

Active Users

0

Followers

New answer posted

4 months ago

0 Follower 5 Views

P
Payal Gupta

Contributor-Level 10

37. Since out of 8 total questions at least 3 questions has to be attempted from each of part I and II containing 5 and 7 questions respectively we can have the choices.

(a) 3 questions from I and 5 questions from II selected in 5C3*7C5 ways.

(b) 4 questions from I and 4 questions from II selected in 5C4*7C4 ways.

(c) 5 questions from I and 3 questions from II selected in 5C5*7C3 ways.

Therefore, the required number of ways.

= (5C3*7C5) + (5C4*7C4) + (5C5*7C3)

5!3! (53)! * 7!5! (75)! + 5!4! (54)! * 7!4! (74)! + 5!5! (55)! * 7!3! (73)!

= (10 * 21) + (5 * 35) + 35

= 210 + 175 + 35

= 420

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

36. In an English word there are 5 vowels and 21 consonants.

The number of ways of selecting 2 vowel out of 5 = 5C2

5!2! (5? 2)!

= 5 * 2 = 10

The number of ways of selecting 2 consonants out of 21 = 21C2

21!2! (21? 2)!

= 21 * 10

= 210

Therefore, the number of combinations of 2 vowels and 2 consonants is 10 * 210 = 2100

Each of these 2100 combinations has 4 letters which can be rearranged among themselves in 4! Ways.

Therefore, the required number of ways

= 4! * 2100

= 4 * 3 * 2 * 1 * 2100

= 50400

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

35. Since the 6-digit numbers to be formed from the digits 0, 1, 3, 5, 7 and 9 has to be divisible by 10 we have to fix the unit place as 0. Now, the remaining 5 places can be filled only by the digits 1, 3, 5, 7 and 9.

Therefore, the required number of ways

= 5!

= 5 * 4 * 3 * 2 * 1

= 120

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

34. In the eleven-letter word EXAMINATION there are 2A's, 2I's and 2N's and the rest are all different.

Since in a dictionary the words are listed according to the English alphabet we can only find words starting with A (as B, C, D are not a part of the letters forming the word EXAMINATION) listed before E.

Hence after fixing one A as first word we can rearrange the remaining 10 letters of which 2 are I, 2 are N and rest are all different.

Therefore, the required number of ways = 10!2! 2!

= 10 * 9 * 8 * 7 * 6 * 5 * 2 * 3

= 9,07,200

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

33. In the word EQUATION, there are vowels (E, U, A, I, O) and 3 consonants (Q, T, N).

Treating vowels as a whole as 1st object and consonants as a whole as 2nd object, we can have an arrangement of 2! = 2.

Similarly, arrangement within the vowels = 5! = 5 * 4 * 3 * 2 * 1 = 120

And arrangement within the consonants = 3! = 3 * 2 * 1 = 6

Therefore, total number of possible arrangement = 2 * 120 * 6 = 1440

New answer posted

4 months ago

0 Follower 7 Views

P
Payal Gupta

Contributor-Level 10

32. In the word DAUGHTER, there are 3 vowels, namely A, U, E and 5 consonants, namely D, G, H, T, R.

The number of ways of selecting 2 vowels out of 3

= 3C2

3!2! (32)!

= 3

The number of ways of selecting 3 consonants out of 5

= 5C3

5!3! (53)!

= 5 * 2

= 10

Therefore, the number of combination of 3 consonants and 2 vowels is 3 * 10 = 30.

Each of these 30 combinations has 5 letters which can be arranged among themselves in 5! Ways.

Therefore, the required numbers of different words is

= 30 * 5! = 30 * 5 * 4 * 3 * 2 * 1 = 3600

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

31. A student can choose 5 out of 9 available courses. However 2 specific courses are made compulsory.

So, now a student has 3 choices out of the remaining 7 courses.

Therefore, the required number of ways

=7C3

7!3! (7? 3)!

= 35

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

30. We are given 5 black and 6 red balls of which 2 black and 3 red balls can be selected.

Thus the required number of ways

= 5C2*6C3

5!2! (52)! * 6!3! (63)!

= 10 * 20

= 200

New answer posted

4 months ago

0 Follower 8 Views

P
Payal Gupta

Contributor-Level 10

29. We are given 17 players of which 5 players can bowl and 17 – 5 = 12 can bat. But we need to select a team of 11 in which there are exactly 4 bowlers.

Hence, the required number of ways

=5C4 (bowl) x 12C (11-4) (bat)

5!4! (54)! * 12!7! (127)!

= 5 * 11 * 9 * 8

= 3960

New answer posted

4 months ago

0 Follower 2 Views

P
Payal Gupta

Contributor-Level 10

28. In a deck of 52 cards there are 4 ace cards. The required number of ways of selecting one ace card from the four = 4C1 = 4!1! (41)! = 4!3! = 4*3!3! = 4

After selecting one ace we need to select the remaining 4 card from the remaining 48 card to have a combination of 5 cards. The required number of ways

= 48C4

48!4! (484)!

= 1,94,580

Therefore, the total number of ways for selecting 5 card combination out of a deck of 52 cards if there is exactly one ace in each combination

= 4C1*48C4

= 4 * 1,94,580

= 7,78,320

Get authentic answers from experts, students and alumni that you won't find anywhere else

Sign Up on Shiksha

On Shiksha, get access to

  • 65k Colleges
  • 1.2k Exams
  • 688k Reviews
  • 1800k Answers

Share Your College Life Experience

×
×

This website uses Cookies and related technologies for the site to function correctly and securely, improve & personalise your browsing experience, analyse traffic, and support our marketing efforts and serve the Core Purpose. By continuing to browse the site, you agree to Privacy Policy and Cookie Policy.