2 2 votes number of boxes in the grid number of lines on the side of grid number of squares that can be made in the grid number of possible paths to top-left to bottom-right of the grid Programming in C + – vijay_jr 984 views answer comment Share Follow Print See all 6 Comments 6 6 Comments reply Show 3 previous comments Lokesh . commented Jan 12, 2017 reply Follow flag calculate s(2,2) = 2 s(3,3) = 6 s(4,4) = 20 .... check option A. for s(4,4) it should be 4*4 = 16 FALSE B. for s(4,4) one side of grid will have 4 line only (I didnt understood this option clearly) C. for s(3,3) no. of squares are clearly >9 but here s(3,3) = 6 only D. no of paths for s(4,4) = 6C3 = 20 0 0 replyShare jatinmittal199510 commented Jan 12, 2017 reply Follow flag Sir how 6C3 is working here. Imean why this formula is used? 0 0 replyShare Lokesh . commented Jan 13, 2017 reply Follow flag in 4*4 ....moves needed (r,r,r,d,d,d) to reach bottom right...r = right , d =down now any permutation of this moves can go to bottom right..so 6C3 = 20 ways 0 0 replyShare Please log in or register to add a comment.
0 0 votes Question is nt proper it needs some more inforrmation regarding option 4 http://www.geeksforgeeks.org/print-all-possible-paths-from-top-left-to-bottom-right-of-a-mxn-matrix/ http://www.geeksforgeeks.org/count-possible-paths-top-left-bottom-right-nxm-matrix/ saurabh rai answered Jan 12, 2017 saurabh rai comment Share Follow 0 reply Please log in or register to add a comment.
