Join 60,000+ competitive exam aspirants
or with email
Your Cart
SubtotalтВ╣0
TotalтВ╣0
Examoogle тАв User тАв info@examoogle.com тАв EE-2024-8821
Chapter 1 of 12 тАв Page 1 of 248ЁЯФТ Protected PDF тАв Watermarked
Join 60,000+ competitive exam aspirants
A question is followed by two statements numbered (I) and (II). Who is the youngest among P, Q, R, S and T? I: Q is younger than P but older than T. II: S is older than R but younger than T.
Data in statement I alone is sufficient
Data in statement II alone is sufficient
Data in both I and II together are sufficient
Data in neither I nor II is sufficient
Data in both I and II together are sufficient
Combine the statements into a single chain by identifying the common variable (T) between the two sequences.
Combine the statements into a single chain by identifying the common variable (T) between the two sequences.
Analyze Statement I
Statement I says Q is younger than P but older than T. This creates the order: P > Q > T.
Analyze Statement II
Statement II says S is older than R but younger than T. This creates the order: T > S > R.
Combine Statements I and II
By linking the two statements via the common variable T, we get the complete sequence: P > Q > T > S > R. From this, we can clearly see that R is the youngest.
A: Statement I only provides the relative positions of P, Q, and T, leaving S and R unknown. B: Statement II only provides the relative positions of S, R, and T, leaving P and Q unknown. D: Since combining both statements provides the full sequence, neither alone is insufficient, but the combination is sufficient.
C is correct because combining both statements establishes the complete age sequence P > Q > T > S > R, which uniquely identifies R as the youngest.
In data sufficiency questions involving rankings or sequences, always search for a 'linking' element that bridges the two statements.
Get instant step-by-step AI explanations, full shift Previous Year Papers (SSC GD, RRB, SSC JE), and regional rank analysis on the official Examoogle App.
Free Download тАв 100K+ Aspirants