• recategorized by
1,959 views

4 Answers

2 2 votes

Number of permutation of n objects with n1 identical objects of type 1, n2 identical objects of type 2, ......and nk identical objects of type k is $\frac{n!}{n_{1}!n_{2}!....n_{k}!}$

Permutation of letter BANANA are $\frac{6!}{3!2!}= 60$

Option c) is correct

1 1 vote
$\text{Total number of letters in ''BANANA''} = 6$

$\text{Total number of 'A' in the word ''BANANA'' }= 3$

$\text{ Total number of  'N' in the word ''BANANA''}= 2$

$\text{Total distinguishable permutations of the letters ''BANANA'' }=\frac{6!}{3! 2!}=60$
• edited by
0 0 votes
Distinguishable permutation means the letters won't be repeated. Here BANANA contains 6 letters in which N has been repeated twice and A has been repeated thrice. Hence number of distinguishable permutations = 6!/(3!2!) = 60
Answer:
Position:
Show:

Related questions

1 1 vote
0 0 answers
877
877 views
gatecse asked Dec 9, 2020
877 views
The number of $4$ digit numbers which contain not more than two different digits is:$576$$567$$513$$504$
1 1 vote
2 2 answers
3.9k
3.9k views
Arjun asked Nov 5, 2017
3,931 views
Which speed up could be achieved according to Amdahl's Law for infinte number of processes if $5\%$ of a program is sequential and the remaining part is ideally parallel?...
0 0 votes
1 1 answer
3.1k
3.1k views
Arjun asked Nov 5, 2017
3,141 views
Which of the given wireless technologies used in IoT, consumes the least amount of power?ZigbeeBluetoothWi-FiGSM/CDMA
0 0 votes
2 2 answers
5.4k
5.4k views
Arjun asked Nov 5, 2017
5,435 views
Which of the following is not a Clustering method?K-Means methodSelf Organizing feature map methodK- nearest neighbor methodAgglomerative method