Discussion
Statements
J#N ,K@N ,T$k
Conclusions
I.J%T II.T$N III.N@J
Answer: D
Correct answer: All are true
In this set the code reads: \(@\) is “not smaller than”, so \(\ge\); \(\#\) is “not greater than”, so \(\le\); \(\%\) is “neither greater nor equal”, so \(<\); \(*\) is “neither smaller nor greater”, so \(=\); and \(\$\) is “neither smaller nor equal”, so \(>\). Note that this is not the same code as the neighbouring sets use - check the direction before translating. The statements become \( J \le N \), \( K \ge N \) and \( T > K \), which join into the single chain \[ J \le N \le K < T. \]
I. \( J \% T \) asks whether \( J < T \). The chain runs from J all the way to T, and it contains the strict link \( K < T \), so the whole relation is strict. True.
II. \( T \$ N \) asks whether \( T > N \). Reading the chain backwards from T gives \( T > K \ge N \), again strict. True.
III. \( N @ J \) asks whether \( N \ge J \). That is the first statement read the other way round. True.
All three follow, so the answer is that all are true.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development