If ∑ = {a, b, c, d, e, f } then number of strings in ∑ of length 4 such that no symbol is used more than once in a string is
| A. | 35 |
| B. | 360 |
| C. | 49 |
| D. | 720 |
Answer : B Explanation : Here string length is 4 so we can create string of length 4 by 6 values. Suppose at first place we can arrange any value by 6 methods.so 6. then Remaining total numbers are 5 so we can arrange them by 5 methods at second place. then remaining total numbers are 4 so we can arrange them by 4 methods. now remaining total numbers are 3 and we can arrange them by 3 methods. so according to permutation technique. We multiply them i.e. 6*5*4*3=360. So, 'B' richa said: (4:19pm on Saturday 13th April 2013)
this answer comes out... 6!c(6-4!)*4!
vikki gound said: (2:09am on Thursday 23rd May 2013)
thus answer of given question is total no of string=6!=720and length of each string=6-4=2 then we calculate length of string=(6c2)*4!=15*24=360so total length=720-360=360
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
