Analytical Aptitude Practice Questions for GATE CS
GATE CS Analytical Aptitude: 1 units and 4 chapters, weightage from 21 previous year questions across 9 papers, a study order by exam weight and 355 practice
A question from this chapter
Question 1
Level 1: Warm-up
Consider the passage: "All students who study daily pass the exam. Rohan passed the exam."
How many of the following statements MUST be true based ONLY on the passage?
Rohan studied daily.
Some students who do not study daily might pass the exam.
If a student did not pass the exam, they did not study daily.
Question 2
Level 1: Warm-up
In a row of students, M is standing 6th from the left end. N is standing 4 places to the right of M. What is N's position from the left end?
Question 3
Level 1: Warm-up
In the step-by-step analogy solving hierarchy, what is the step number for 'Eliminate via Substitution'?
Question 4
Level 1: Warm-up
A river system splits the land into several distinct zones. If the minimum number of bridges required to connect all these zones is 8, how many distinct zones are there?
Free preview ends here
Login to view the complete practice questions and solutions
Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.
Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.
Built around you, not around a syllabus PDF
Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.
Revision that hits your weak spots
We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.
Questions calibrated to the real exam
Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.
Notes written for recall, not for volume
Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.
One place for everything
Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.
Honest progress
No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.
Unlock the whole course
Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.
Analytical Aptitude Practice Questions for GATE CS
GATE CS Analytical Aptitude: 1 units and 4 chapters, weightage from 21 previous year questions across 9 papers, a study order by exam weight and 355 practice questions.
About Analytical Aptitude Practice Questions
355 practice questions for Analytical Aptitude in GATE CS, sorted chapter by chapter and graded from basic to exam level, each with a full solution.
GATE CS Analytical Aptitude Unit-wise Weightage from Past Papers
We counted every GATE CS Analytical Aptitude previous year question in our bank (21 questions from 9 papers) and grouped them by unit.
One Solved Question from Each Analytical Aptitude Chapter
Question 1 · Deductive Reasoning, Statements and SyllogismsMCQ
Consider the passage: "All students who study daily pass the exam. Rohan passed the exam."
How many of the following statements MUST be true based ONLY on the passage?
Rohan studied daily.
Some students who do not study daily might pass the exam.
If a student did not pass the exam, they did not study daily.
A.
0
B.
1
C.
2
D.
3
Correct Answer:
B
Step-by-Step Solution
Key idea: This is a deductive inference question testing the distinction between "must be true" and "might be true." We apply the golden rule: only accept what MUST be true in every scenario consistent with the passage.
Step 1: Analyze the passage.
"All students who study daily pass the exam" means: Study daily → Pass.
"Rohan passed the exam" means: Rohan ∈ Pass.
Step 2: Evaluate each statement.
Statement 1: "Rohan studied daily." This is the converse fallacy. Just because Rohan passed doesn't mean he studied daily. He might have passed without studying daily. So this MIGHT be true, but doesn't HAVE to be true. NOT necessarily true.
Statement 2: "Some students who do not study daily might pass the exam." The passage says "All who study daily pass," but it doesn't say "ONLY those who study daily pass." So it's possible that some who don't study daily also pass. However, this is a possibility, not a necessity. The passage doesn't guarantee this. NOT necessarily true.
Statement 3: "If a student did not pass the exam, they did not study daily." This is the contrapositive of "All who study daily pass." The contrapositive of (Study daily → Pass) is (Not pass → Not study daily). The contrapositive is logically equivalent to the original statement. So this MUST be true.
Step 3: Count the statements that MUST be true.
Only statement 3 MUST be true.
Answer: B (1 statement)
Question 2 · Relationships, Ordering and Arrangement PuzzlesMCQ
In a row of students, M is standing 6th from the left end. N is standing 4 places to the right of M. What is N's position from the left end?
A.
9
B.
10
C.
11
D.
8
Correct Answer:
B
Step-by-Step Solution
Key idea: "Places to the right" means you add to the position. This is a direct translation from language to math.
Step 1: M's position from left = 6.
Step 2: N is 4 places to the right of M.
Step 3: N's position from left = M's position + 4
= 6 + 4
= 10.
Note: We add 4 directly because "4 places to the right" means moving 4 positions forward, not counting the spaces between.
Answer: 10
Question 3 · Patterns, Series, Coding and AnalogiesMCQ
In the step-by-step analogy solving hierarchy, what is the step number for 'Eliminate via Substitution'?
A.
1
B.
2
C.
3
D.
4
Correct Answer:
D
Step-by-Step Solution
Key idea: This is a contradiction question testing the strict sequence of the analogy solving protocol.
Step 1: Recall the step-by-step analogy solving hierarchy from the smart notes.
Step 2: The steps are:
Isolate the Given Pair
Draft the Bridge Sentence
Test Directionality
Eliminate via Substitution
Step 3: Identify the step number for 'Eliminate via Substitution'.
Answer: The step number is 4.
Question 4 · Graph, Route and Tournament ReasoningMCQ
A river system splits the land into several distinct zones. If the minimum number of bridges required to connect all these zones is 8, how many distinct zones are there?
A.
7
B.
8
C.
9
D.
10
Correct Answer:
C
Step-by-Step Solution
Key idea: This is a reverse-engineering minimum connectivity problem.
Step 1: Recall the minimum connectivity rule: Minimum Bridges=V−1.