Numerical Relations and Analogies - General Aptitude - General Aptitude (GA) Previous Year Questions

1

2012 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2012

Given the sequence of terms, AD CG FK JP, the next term is

A

OV

B

OW

C

PV

D

PW

Open complete paper

2

2014 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2014 [Session 3]

Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64

A

17

B

37

C

64

D

26

Open complete paper

3

2015 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2015 [Session 1]

Match the following:
(P) Prim's algorithm for minimum spanning tree      (i) Backtracking
(Q) Floyd-Warshall algorithm for all pairs shortest paths      (ii) Greedy method
(R) Mergesort      (iii) Dynamic programming
(S) Hamiltonian circuit      (iv) Divide and conquer

(A) P-iii, Q-ii, R-iv, S-i
(B) P-i, Q-ii, R-iv, S-iii
(C) P-ii, Q-iii, R-iv, S-i
(D) P-ii, Q-i, R-iii, S-iv

A

P-iii, Q-ii, R-iv, S-i

B

P-i, Q-ii, R-iv, S-iii

C

P-ii, Q-iii, R-iv, S-i

D

P-ii, Q-i, R-iii, S-iv

Open complete paper

4

2015 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2015 [Session 2]

Match the following

P.	Lexical analysis	1.	Graph coloring
Q.	Parsing	2.	DFA minimization
R.	Register allocation	3.	Post-order traversal
S.	Expression evaluation	4.	Production tree

A

P-2, Q-3, R-1, S-4

B

P-2, Q-1, R-4, S-3

C

P-2, Q-4, R-1, S-3

D

P-2, Q-3, R-4, S-1

Open complete paper

5

2015 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2015 [Session 3]

If ROAD is written as URDG, then SWAN should be written as:

A

VXDQ

B

VZDQ

C

VZDP

D

UXDQ

Open complete paper

6

2020 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2020 [Session 2]

If P = 3, R = 27, T = 243, then Q + S = ____.

A

40

B

80

C

90

D

110

Open complete paper

7

2023 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2023 [Session 2]

A series of natural numbers \(F_1, F_2, F_3, F_4, F_5, F_6, F_7, ...\) obeys \(F_{n+1} = F_n + F_{n-1}\) for all integers \(n \geq 2\).
If \(F_6 = 37\), and \(F_7 = 60\), then what is \(F_1\) ?

A

4

B

5

C

8

D

9

Open complete paper

8

2024 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2024 [Session 2]

In the sequence 6, 9, 14, \(x\), 30, 41, a possible value of \(x\) is

A

25

B

21

C

18

D

20

Open complete paper

9

2025 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2025 [Session 2]

If IMAGE and FIELD are coded as FHBNJ and EMFJG respectively then, which one among the given options is the most appropriate code for BEACH ?

A

CEADP

B

IDBFC

C

JGIBC

D

IBCEC

Open complete paper

10

2025 · General Aptitude (GA) · General Aptitude · Numerical Relations and Analogies

Computer Science & Information Technology (CS) 2025 [Session 2]

Which one of the following options is correct for the given data in the table?

A

\(X(i) = X(i - 1) + I(i); \quad Y(i) = Y(i - 1)I(i); \quad i > 0 \)

B

\(X(i) = X(i - 1)I(i); \quad Y(i) = Y(i - 1) + I(i); \quad i > 0 \)

C

\(X(i) = X(i - 1)I(i); \quad Y(i) = Y(i - 1)I(i); \quad i > 0 \)

D

\(X(i) = X(i - 1) + I(i); \quad Y(i) = Y(i - 1)I(i - 1); \quad i > 0 \)

Open complete paper