..i under stand with 6!/(3!*3!) method... plz explain from combination point of view....i didnt get ur last line....i understand that
we need to find no. of permutaions of abcxyz s.t a<b<c and x<y<z.....plz tell how to find this....i understand as someone explained above with VVVHHH method..... please explain from thsi view that we need to find no. of permutaions of abcxyz s.t a<b<c and x<y<z. On Sat, Oct 27, 2012 at 12:31 PM, Saurabh Kumar <[email protected]>wrote: > Since this is a small grid you can count it manually but in general > problem is to count no. of paths from bottom-left corner to top-right > corner (provided all the transition alphabets in the automata are distinct > in the respective dimensions e.g. here, xyz in one dimension and abc in > other) > > You can view this problem as writing all permutations of strings of 3R's > and 3U's (for RIGHT movement and UP movement) RRRUUU which will take you to > the top right most corner. > All possible arrangements = (3+3)! / (3! * 3!) > In general: (m+n)! / (m! * n!) for a mxn grid. > > > On 27 October 2012 11:05, rahul sharma <[email protected]> wrote: > >> should i take it how many ways are there to reach from start to the top >> right destination...x,y,z,a,b,c, are i/p state....xyzabc one string....abc >> xyz is another...if m ryt then is dere any formulla to calute or we have to >> do it manuallyyyy >> >> >> On Sat, Oct 27, 2012 at 11:02 AM, rahul sharma >> <[email protected]>wrote: >> >>> >>> can u please elaborate...i am not able to understand the figure..plz >>> explain....it would be of great help >>> >>> On Sat, Oct 27, 2012 at 5:57 AM, payal gupta <[email protected]>wrote: >>> >>>> should be 6C3 or 20 perhaps. >>>> >>>> On Sat, Oct 27, 2012 at 3:29 AM, rahul sharma >>>> <[email protected]>wrote: >>>> >>>>> Finite state automata accpt string of length 6 >>>>> >>>>> what is total number of strings in set..please find the attahcment >>>>> >>>>> -- >>>>> You received this message because you are subscribed to the Google >>>>> Groups "Algorithm Geeks" group. >>>>> To post to this group, send email to [email protected]. >>>>> To unsubscribe from this group, send email to >>>>> [email protected]. >>>>> For more options, visit this group at >>>>> http://groups.google.com/group/algogeeks?hl=en. >>>>> >>>> >>>> -- >>>> You received this message because you are subscribed to the Google >>>> Groups "Algorithm Geeks" group. >>>> To post to this group, send email to [email protected]. >>>> To unsubscribe from this group, send email to >>>> [email protected]. >>>> For more options, visit this group at >>>> http://groups.google.com/group/algogeeks?hl=en. >>>> >>> >>> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
