NTS Preparation MCQs
Prepare for NTS with comprehensive practice MCQs & mock tests
Practice Now
Test yourself with instant feedback
Showing 590 MCQs
in Analytical Reasoning
Answer: The lead engineer (C) would manage the junior developer (D).
Answer: Some scientists are physicists who study matter, which has measurable properties.
Answer: D married into the family through C, so D is in-law to A and B.
Answer: The cycle A→B→C→D→A means if any one is true, all are true. Having exactly 1 true is impossible.
Answer: The trainee (E) is lowest in the hierarchy.
Answer: The cycle P→Q→R→P means if any one is true, all are true. Exactly 2 true implies all are true.
487
Which strengthens? \'CRISPR can eliminate genetic diseases because it can edit the human genome.\'
Answer: For the argument to hold, all these assumptions must be true.
Answer: For the argument to hold, all these assumptions must be true.
489
What assumption? \'Autonomous vehicles will reduce accidents because computers don\'t get tired.\'
Answer: For the argument to hold, all these assumptions must be true.
Answer: Assuming AI development leads to sentience and destruction is a slippery slope.
Answer: Equivalence means all must have the same truth value. Having exactly 1 true is impossible.
Answer: If A is true and they form a cycle, all must be true by modus ponens.
Answer: Limited charging infrastructure and range advantages of gas cars weaken the replacement claim.
Answer: A manages B, B manages C, C manages D, but D also reports directly to A, creating a matrix structure.
Answer: The recommendation for stronger data protection laws is the conclusion.
Answer: Since exactly 5 are true and they form equivalence pairs, exactly one pair must be false (both statements in that pair false).
Answer: If renewables aren\'t cost-competitive, fossil fuels may still dominate despite being finite.
Answer: All AI requires computing power, which generates heat, which requires energy-intensive management, so all AI is energy-intensive.
Answer: If all three are false, the implications are satisfied: F∧F→F (true), so this is consistent.
Answer: If 1 is true, all are true. If 1 is false, we need 4 true from 2-5, but 2→3→4→5 means if any earlier is true, all later are true. The only way to have 4 true is 1-4 true, but 4→5 means 5 is true, making 5 true. So all are true.