Problem 1. Based on C1 = {a,b, c, d}, C2 = {!,+, $}, C3 = {7,9}, C4 = {1,2}, C; = {2,5}, answer following questions. %3D 1(d) |C1 U C2| x |C3 U C4| 1(e) To set a password, whose 1st character must come from C1, 2nd character must come from C2 and the 3rd character must come from C3, how many ways are there to set the password? 1(f) To set a password, whose 1st character must come from C1, 2nd character must come from C2 and the 3rd character must come from C4 or C5, how many ways are there to set the password?
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
