Asifpirlo wrote:
The figure shows all the available routes between stations A and C . what is the shortest route available to reach station C from A ?
(1) AB < AE < AD
(2) BC < EC < CD
WHAT IS YOUR ANSWER?
ABC is THE SHORTEST ROUTE
Then you are wrong.
Attachment:
zig.png
There is another route ABFC.
BF+FC can be greater than BC,
Or BF+FC can be smaller than BC.
Because we don’t know anything about BF .
So we have a double case and thus the answer is (E)
there are 5 paths available:
1) A=>B=>C
2) A=>B=>F=>C
3) A=>E=>F=>C
4) A=>E=>F=>B=>C
5) A=>D=>C
NOW we have to find out the shortest path.
stmnt 1: AB < AE < AD
insufficient as it is fragment of full distance.
stmnt2: BC < EC < CD
insufficient as it is fragment of full distance.
combining we can make out that
path 1 < path 3 < path 5
but we dont know about paths 2 and 4 as we dont that B=>F=>C is
shorter/longer than B=>C
HENCE E
_________________
When you want to succeed as bad as you want to breathe ...then you will be successfull....
GIVE VALUE TO OFFICIAL QUESTIONS...
GMAT RCs VOCABULARY LIST: http://gmatclub.com/forum/vocabulary-list-for-gmat-reading-comprehension-155228.html
learn AWA writing techniques while watching video : http://www.gmatprepnow.com/module/gmat-analytical-writing-assessment
: http://www.youtube.com/watch?v=APt9ITygGss