A government land consists of 16 square plots of equal size. If I start from the SW corner and move towards the NE corner (movement is always in the positive direction), in how many different ways can I reach the NE corner?
70
Method 1- Unitary method
Consider a 2x2 grid
No. of different paths = (1+ 2x2 +1)
For a 3x3 = (1 + 3x3 + 3x3 + 1) ..
For a 4x4 =( 1+ 4x4 + 6x6 + 4x4 +1) ..
Thus, answer is 70
Method 2- Using SàD
Shortcut:- No of rows=4. number of columns=4.
i.e. using the one zero method, total number of paths= 4+4C4= 70