My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

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.

4Papers
3Years
4Questions
1Topics

Numerical Relations and Analogies question pattern

Every graph below is calculated only from this selection.

Questions by year

Compare question counts across years.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 3 75%
Easy 1 25%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 3 75%
Numerical Answer Type (NAT) 1 25%

Subject weightage

Top subjects by unique question coverage.

General Aptitude (GA)
4 Qs

Most asked topics

Top topics across the included previous year papers.

Logic
4 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Numerical Relations and Analogies
4 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science & Information Technology (CS) 2017 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
1 Qs

Included previous year papers

Newest papers appear first. Search these papers or sort by year and name.

Paper nameYearPDFAttempt
Computer Science & Information Technology (CS) 2017 [Session 1]2017
1 questions in this view		2017
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2015 [Session 1]2015
1 questions in this view		2015
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2015 [Session 2]2015
1 questions in this view		2015
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2014 [Session 2]2014
1 questions in this view		2014
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download

All Numerical Relations and Analogies previous year questions

Practice every matching question in batches of 20, with every available option.

1
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
Open complete paper
2
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
Open complete paper
3
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 ________.
Open complete paper
4
2017 · General Aptitude (GA) · Logic · Numerical Relations and Analogies
Computer Science & Information Technology (CS) 2017 [Session 1]

Consider the following table:

Algorithms Design Paradigms
(P) Kruskal (i) Divide and Conquer
(Q) Quicksort (ii) Greedy
(R) Floyd-Warshall (iii) Dynamic Programming
Match the algorithms to the design paradigms they are based on.

Question diagram

Open complete paper