|
|
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
E
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
65%
(hard)
Question Stats:
54% (01:45) correct
46%
(01:36)
wrong
based on 231
sessions
History
Date
Time
Result
Not Attempted Yet
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
Show SpoilerSolution:
Attachment:
File comment: this is the question
zig.png [ 17.58 KiB | Viewed 3953 times ]
zig.png [ 17.58 KiB | Viewed 3953 times ]
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)
Pure algebraic questions like this one are no longer part of the GMAT Data Sufficiency syllabus.
For relevant Data Sufficiency questions, please check the Data Sufficiency forum:
Data Sufficiency Forum
Data Sufficiency Forum
04 Aug 2013, 15:26
Kudos
Bookmarks
Thanks for posting this one.
I like not drawn to scale questions. Is this your own? It's pretty good.
You may want to hide the tips and the solution - I have the spoiler tag for that in this case. PM me if you have questions.
I like not drawn to scale questions. Is this your own? It's pretty good.
You may want to hide the tips and the solution - I have the spoiler tag for that in this case. PM me if you have questions.
04 Aug 2013, 15:56
Kudos
Bookmarks
Asifpirlo
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
