1000+ Permutation and Combination Questions for Bank PO Pdf - 1

Question: 1

A customer forgets a 4 digit code for an Automatic Teller Machine (A.T.M.) in a bank. However, he remembers that this code consist of digits 3, 5, 6 and 9. Find the largest possible number of trails necessary to obtain the correct code.

(A) 12

(B) 24

(C) 36

(D) 48

Ans: B

At the first place he can try any of the 4 digits hence in first trial he tries 4 digits.

In the second place he will try 3 remaining digits.

Similarly, he will try 2 and 1 digit at the third and fourth places.

Thus, the number of trials is = 4 × 3 × 2 × 1 = 24.

Question: 2

There are 6 multiple choice questions in an examination. How many sequences of answers are possible, if the first 2 questions have 3 choices each the next 2 have 4 choices each and the last two have 5 choices each?

(A) 3300

(B) 3400

(C) 3450

(D) 3600

Ans: D

First question can be answered in 3 ways.

Second questions can be answered in 3 ways.

3 question can be answered in 4 ways.

4 question can be answered in 4 ways.

5 question can be answered in 5 ways.

6 question can be answered in 5 ways.

Hence, by fundamental principle of counting, the required number of sequences of answers

= 3 x 3 x 4 x 4 x 5 x 5 = 3600.

Question: 3

How many 3 digit numbers each less than 600 can be formed from the digits 1, 2, 3, 4, 5 and 9, if repetition of digits is allowed?

(A) 160

(B) 165

(C) 180

(D) 185

Ans: C

Unit’s place can be filled in 6 ways by any 1 of the digits 1, 2, 3, 4, 5 or 9. Also, ten’s place can be filled in 6 ways.

But hundred’s place can be filled only in 5 ways using either 1, 2, 3, 4, or 5 : 9 cannot be filled in hundred’s place as the required number is < 600.

∴ Required number of numbers = 6 × 6 × 5 = 180.

Question: 4

How many words with or without meaning, can be formed using all letters of the word 'EQUATION' using each letter exactly once?

(A) 38320

(B) 38400

(C) 39320

(D) 40320

Ans: D

The word EQUATION has exactly 8 letters which are all different.

∴ Number of words that can be formed = number of permutations of 8 letters taken all at a time

= P(8, 8) = 8!

= 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1 = 40320.

Question: 5

In how many ways 6 apples be distributed among 3 boys, there being no restriction to the number of apples each boy may get?

(A) 719

(B) 729

(C) 739

(D) 749

Ans: B

Each apple can be given to any 1 of the 3 boys and this can be done in 3 ways.

∴ The required number of ways = 36 = 729.

Related Questions