CA Foundation Exam  >  CA Foundation Notes  >  Quantitative Aptitude for CA Foundation  >  PPT - Permutations and Combinations

PPT - Permutations and Combinations | Quantitative Aptitude for CA Foundation PDF Download

Download, print and study this document offline
Please wait while the PDF view is loading
 Page 1


Permutation & Combination
Page 2


Permutation & Combination
Topics
• Fundamental Principal of Counting.
• Permutation
– Theorem 1
– Theorem 2
– Theorem 3
– Examples
• Combination
– Examples
Page 3


Permutation & Combination
Topics
• Fundamental Principal of Counting.
• Permutation
– Theorem 1
– Theorem 2
– Theorem 3
– Examples
• Combination
– Examples
Fundamental Principal of Counting
If an event can occur in ‘m’ different
ways, following which another event can
occur in ‘n’ different ways, then total
number of events which occurs is ‘m X n’.
Page 4


Permutation & Combination
Topics
• Fundamental Principal of Counting.
• Permutation
– Theorem 1
– Theorem 2
– Theorem 3
– Examples
• Combination
– Examples
Fundamental Principal of Counting
If an event can occur in ‘m’ different
ways, following which another event can
occur in ‘n’ different ways, then total
number of events which occurs is ‘m X n’.
Example
Rohan has 3 shirts and 2 pants, in how many are the
combinations possible.
He can select any shirt from 3 shirts and any pant from 3 pants.
3 ways 2 ways
Total = 3 X 2 = 6 ways
Page 5


Permutation & Combination
Topics
• Fundamental Principal of Counting.
• Permutation
– Theorem 1
– Theorem 2
– Theorem 3
– Examples
• Combination
– Examples
Fundamental Principal of Counting
If an event can occur in ‘m’ different
ways, following which another event can
occur in ‘n’ different ways, then total
number of events which occurs is ‘m X n’.
Example
Rohan has 3 shirts and 2 pants, in how many are the
combinations possible.
He can select any shirt from 3 shirts and any pant from 3 pants.
3 ways 2 ways
Total = 3 X 2 = 6 ways
Permutation
per·mu·ta·tion
A way, esp. one of several possible variations, in which
a set or number of things can be ordered or arranged.
Definition:
A permutation is an arrangement in a definite order of
a number of objects taken some or all at a time.
Note:
Whenever we deal with permutations order is important.
Read More
114 videos|164 docs|98 tests

Top Courses for CA Foundation

FAQs on PPT - Permutations and Combinations - Quantitative Aptitude for CA Foundation

1. What is the difference between permutations and combinations in the context of the CA Foundation exam?
Ans. Permutations and combinations are both topics in mathematics that deal with counting and arranging elements. The main difference between them is that permutations consider the order of the elements, while combinations do not. In the context of the CA Foundation exam, understanding this distinction is important for solving problems related to arranging objects or selecting subsets.
2. How can I calculate the number of permutations of a set of objects?
Ans. To calculate the number of permutations of a set of objects, you can use the formula nPr = n! / (n - r)!, where n represents the total number of objects and r represents the number of objects to be arranged. For example, if you have 5 objects and need to arrange them in groups of 3, the calculation would be 5P3 = 5! / (5 - 3)! = 5! / 2! = 60.
3. What is the formula for calculating combinations in the CA Foundation exam?
Ans. The formula for calculating combinations is given by nCr = n! / (r! * (n - r)!), where n represents the total number of objects and r represents the number of objects to be selected. This formula is used to determine the number of ways to select subsets from a larger set without considering the order of the elements.
4. Can you provide an example of a permutation problem that may appear in the CA Foundation exam?
Ans. Sure! An example of a permutation problem could be: "In how many ways can the letters of the word 'FOUNDATION' be arranged if the vowels must be kept together?" In this case, the vowels (O, U, A, I, O) need to be kept together, which means we can treat them as a single element. The number of arrangements would then be calculated using the formula nPr = n! / (n - r)!, where n is the total number of elements (including the group of vowels) and r is the number of elements in the group (5 in this case).
5. How can I approach a combination problem that involves selecting objects from a larger set in the CA Foundation exam?
Ans. When approaching a combination problem, it is important to identify the total number of objects and the desired number of objects to be selected. Once you have these values, you can use the combination formula nCr = n! / (r! * (n - r)!) to calculate the number of combinations. It is also helpful to consider whether the order of the selected objects matters or not, as this will determine whether permutations or combinations should be used.
114 videos|164 docs|98 tests
Download as PDF
Explore Courses for CA Foundation exam

Top Courses for CA Foundation

Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

MCQs

,

Extra Questions

,

shortcuts and tricks

,

Semester Notes

,

Summary

,

study material

,

pdf

,

PPT - Permutations and Combinations | Quantitative Aptitude for CA Foundation

,

past year papers

,

mock tests for examination

,

Important questions

,

video lectures

,

Exam

,

Previous Year Questions with Solutions

,

PPT - Permutations and Combinations | Quantitative Aptitude for CA Foundation

,

Objective type Questions

,

ppt

,

practice quizzes

,

Viva Questions

,

Free

,

PPT - Permutations and Combinations | Quantitative Aptitude for CA Foundation

,

Sample Paper

;