q 33

This topic has expert replies
Senior | Next Rank: 100 Posts
Posts: 65
Joined: Thu Jul 02, 2009 10:38 pm
Location: Bangalore
Thanked: 1 times

q 33

by engg.manik » Tue Oct 13, 2009 7:05 am
33. Pat will walk from A to C to B through the grid section , how many possible routes can pat take that have the minimum possible length ?

OA - 20
Attachments
walk.jpg
Source: — Problem Solving |

Master | Next Rank: 500 Posts
Posts: 153
Joined: Tue Jun 02, 2009 2:48 pm
Location: Ohio
Thanked: 16 times

Re: q 33

by JeffB » Tue Oct 13, 2009 7:58 am
engg.manik wrote:33. Pat will walk from A to C to B through the grid section , how many possible routes can pat take that have the minimum possible length ?

OA - 20
From A to C

5!/3!2! = 10

C to B

Only 2 ways to go

10 * 2 = 20