Let's say there's a password scheme as follows:
- the password is of length 4 (four)
- the 1st position is taken by one character from the set:
a, b, c
- the 2nd position is taken by one character from the set:
D, E, F, G
- the 3rd position is taken by one character from the set:
1, 2, 3, 4, 5
- the 4th position is taken by one character from the set:
-, +
Example: b, F, 2, +
Is the number of permutations calculated as follows?
3C1 * 4C1 * 5C1 * 2C1 = 3 * 4 * 5 * 2 = 120