retagged by
1,261 views
3 votes
3 votes

retagged by

2 Answers

Best answer
2 votes
2 votes

Although shaik answered this question but way back I have solved similar kind of question-

1st case-

[91,2,13,24,77][62,72,82]  now first bolded part can be arrange in how many ways = 5! = 120 ways

 

2nd case-

now take one element from 1st partition and put in 2nd partition but you can not put 2,13,24 because if you will move that then 62,72 wil not come at position 6 and 7. So move 91 and 77 one by one

a) now take 91, we can arrange in following ways [62,_,72,82],  [62,72,_,82],[62,72,82,_] (place 91 at each blank) so there are only 3 ways and 4 elements in 1st partition can be arranged in 4! ways. So total ways = 3*4! = 72 ways

b) now take 77, we can arrange in following ways [62,_,72,82],  [62,72,_,82] (place 77 at blanks and we can't put 77 after 82) so there are only 2 ways and 4 elements in 1st partition can be arranged in 4! ways. So total ways = 2*4! = 48 ways

 

3rd case-

now take two elements at one time (91,77).

a)take (91,77), we can arrange in following manner[62,_,77,_,72_,82_] and [62,_,72,_,77_,82_] (place 91 at each blank and look we can't use [62,_,72,_,_,82_,77,_] because 77 can't come after 82)so there are 8 ways and 3 elements in 1st partition can be arranged in 3! ways. So total ways for (91,77) = 8*3! = 48

 

 

Total ways = 120 + 72 + 48 + 48 = 288 ways

selected by
8 votes
8 votes

Total Places = 8

   ___    ___   ___    ___    ___    ___   ___    ___

    1       2       3       4         5      6        7       8

 

From the Data we can observe that 91 can be inserted at any time ===> 8C1 = 8

 

now, remaining positions are 7

   ___    ___   ___    ___    ___    ___   ___

    1       2        3       4        5       6       7     

82 should be at the end ====> 1

 

now, remaining positions are 6

   ___    ___   ___    ___    ___    ___

    1       2        3       4        5       6     

From the Data now, we can observe that 77 can be inserted at any time ===> 6C1 = 6

 

now, remaining positions are 5

   ___    ___   ___    ___    ___

    1        2       3       4        5      

From the Data now, we can observe that 12 and 62 should be inserted at last and in-order ===>1

 

now, remaining positions are 3

   ___    ___   ___

    1        2        3  

From the Data now, we can observe that 2,13 and 34 can be inserted at any order ===> 3 !

 

From Multiplication rule = 8 * 1 * 6 * 1* 3 ! = 8*6*6 = 36 * 8 = 288

Related questions

0 votes
0 votes
1 answer
1
tishhaagrawal asked Dec 16, 2023
308 views
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...
2 votes
2 votes
1 answer
4
eyeamgj asked Jun 17, 2018
2,049 views
WHICH OF THE FOLLOWING IS THE BEST CHOICE AS $m$ IN THE HASH FUNCTION $h(k)=k \mod m$??$61$$701$$81$answer is given as $701$ but how??