Difficulty distribution
How the classified questions are distributed by difficulty.
3questions
Medium
3
100%
Numerical Relations and Analogies - Logic - General Aptitude (GA) Previous Year Questions
Practice Numerical Relations and Analogies - Logic - General Aptitude (GA) previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
3Papers
2Years
3Questions
1Topics
Numerical Relations and Analogies question pattern
Every graph below is calculated only from this selection.
Questions by year
Year-wise coverage for Numerical Relations and Analogies. Each bar uses a separate theme-derived color.
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
3questions
MCQ
2
66.7%
Numerical Answer Type (NAT)
1
33.3%
Subject weightage
Top subjects by unique question coverage.
Most asked topics
Top topics across the included previous year papers.
Subtopic coverage
Top subtopics inside this exact selection.
Paper coverage
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Included previous year papers
Newest papers appear first. Sort by year, question coverage or name.
| Paper | Year / session | Questions in this view | Open |
|---|---|---|---|
| Computer Science & Information Technology (CS) 2015 [Session 1] | 2015 | 1 | View paper |
| Computer Science & Information Technology (CS) 2015 [Session 2] | 2015 | 1 | View paper |
| Computer Science & Information Technology (CS) 2014 [Session 2] | 2014 | 1 | View paper |
All Numerical Relations and Analogies previous year questions
Practice every matching question in batches of 20, with every available option.
2014 · General Aptitude (GA) · Logic · Numerical Relations and Analogies
Computer Science & Information Technology (CS) 2014 [Session 2]
Let \(k = 2^n\). A circuit is built by giving the output of an \(n\)-bit binary counter as input to an \(n\)-to-\(2^n\) bit decoder. This circuit is equivalent to a
2015 · General Aptitude (GA) · Logic · Numerical Relations and Analogies
Computer Science & Information Technology (CS) 2015 [Session 1]
Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is
2015 · General Aptitude (GA) · Logic · Numerical Relations and Analogies
Computer Science & Information Technology (CS) 2015 [Session 2]
The minimum number of JK flip-flops required to construct a synchronous counter with the count sequence \((0,0,1,1,2,2,3,3,0,0,\ldots)\) is ________.