UGC NET CS 2017 Nov- paper-2
October 5, 2023GATE 2019
October 5, 2023UGC NET CS 2017 Nov- paper-2
| Question 3 |
How many distinguishable permutations of the letters in the word BANANA are there ?
| 720 | |
| 120 | |
| 60 | |
| 360 |
Question 3 Explanation:
Total distinguishable permutations means no repetition.
BANANA= 6 letters
B is appearing 1 time
A is appearing 3 times
N is appearing 2 times
So, = 6! / (3! * 2!)
= 60
BANANA= 6 letters
B is appearing 1 time
A is appearing 3 times
N is appearing 2 times
So, = 6! / (3! * 2!)
= 60
Correct Answer: C
Question 3 Explanation:
Total distinguishable permutations means no repetition.
BANANA= 6 letters
B is appearing 1 time
A is appearing 3 times
N is appearing 2 times
So, = 6! / (3! * 2!)
= 60
BANANA= 6 letters
B is appearing 1 time
A is appearing 3 times
N is appearing 2 times
So, = 6! / (3! * 2!)
= 60