GATE 2014 CS (Set 3) question paper PDF and answer key

Q: How many questions are in the GATE 2014 CS (Set 3) paper?

65 questions for 100 marks: 10 General Aptitude questions worth 15 marks and 55 Computer Science & Information Technology questions worth 85 marks. By type, there were 47 MCQs, 18 numerical answer (NAT) questions. The paper lasted 3 hours.

Q: Is there negative marking in GATE 2014 CS (Set 3)?

Yes, for MCQs only. A wrong MCQ answer costs one-third of its marks (−⅓ for a 1-mark question, −⅔ for a 2-mark question). MSQ and numerical (NAT) questions have no negative marking, and an MSQ earns marks only when every correct option is chosen.

Q: Which topics carried the most marks in GATE 2014 CS (Set 3)?

Outside General Aptitude, the biggest topics were Discrete Mathematics (13 marks), Programming and Data Structures (12 marks), Computer Networks (9 marks). The full topic-wise split is in the table on this page.

Q: Were any GATE 2014 CS (Set 3) questions awarded marks to all?

No. Every question was graded with the answer in the official key.

Q: Where does this GATE 2014 CS (Set 3) answer key come from?

From the official answer key published by IIT Kharagpur, which organised GATE 2014. Range answers for numerical questions and questions with more than one accepted answer are kept exactly as the key gives them.

The official GATE 2014 Computer Science & Information Technology (Set 3) paper, organised by IIT Kharagpur: 65 questions for 100 marks in 3 hours. Download the official question paper and answer key as PDFs. Below is how the marks were split by topic, the complete official answer key and 5 questions solved step by step.

Take this paper as a timed test Try the free demo

Question paper (PDF)Official answer key (PDF)

Source: the official paper and answer key published by IIT Kharagpur for GATE 2014. Spotted a mistake? Email team@lemyte.com.

General Aptitude: 10 · 15 marks
Computer Science & Information Technology: 55 · 85 marks
MCQ / MSQ / NAT: 47 / 0 / 18
Marks to all: None

Not in 2027 1 question (Q 18) is on topics removed from the GATE 2027 syllabus. They are marked in the answer key below. What changed for CS

Where the marks were

GATE 2014 CS (Set 3) topic-wise marks

Computer Science & Information Technology questions only; General Aptitude adds 15 marks on top. The top three topics carried 34 of the 85 subject marks.

Topic	Questions	Marks
Discrete Mathematics	8	13
Programming and Data Structures	8	12
Computer Networks	6	9
Databases	5	8
Calculus	5	8
Operating System	4	7
Algorithms	4	6
Theory of Computation	4	6
Digital Logic	4	6
Computer Organization and Architecture	3	5
Compiler Design	3	4
Linear Algebra	1	1

Free solved questions

5 solved questions from GATE 2014 CS (Set 3)

Question text and figures as in the official paper, the answer from the official key, and a worked solution. The other 60 solutions are in your report after you take the paper.

Q5 · General Aptitude · MCQ · 1 mark

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

Answer (official key): C

Solution

The intended pattern is:

1^2+1=2,\quad 2^2+1=5,\quad 3^2+1=10,\quad 4^2+1=17,

5^2+1=26,\quad 6^2+1=37,\quad 7^2+1=50,\quad 8^2+1=65.

So the last term should be 65, not 64.

Therefore, the number that does not belong is 64, i.e. Option C.

Q6 · General Aptitude · MCQ · 2 marks

By the beginning of the 20th century, several hypotheses were being proposed, suggesting a paradigm shift in our understanding of the universe. However, the clinching evidence was provided by experimental measurements of the position of a star which was directly behind our sun.

Which of the following inference(s) may be drawn from the above passage?

(i) Our understanding of the universe changes based on the positions of stars.
(ii) Paradigm shifts usually occur at the beginning of centuries.
(iii) Stars are important objects in the universe.
(iv) Experimental evidence was important in confirming this paradigm shift.

(A)
(i), (ii) and (iv)
(B)
(iii) only
(C)
(i) and (iv)
(D)
(iv) only

Answer (official key): D

Solution

The passage states that experimental measurements provided the clinching evidence for the paradigm shift. It does not imply that understanding changes based on star positions in general, nor that paradigm shifts usually occur at the beginning of centuries.

Therefore, only statement (iv) can be inferred.

The correct answer is Option D.

Q12 · Algorithms · Numerical · 1 mark

Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier.

DFS graph for CS Q13

Then the maximum possible recursion depth, including the initial call, is __________.

Answer (official key): 19

Solution

This is a figure-dependent DFS recursion-depth question. The maximum possible recursion depth for the given graph is 19.

Therefore, the answer is 19.

Q59 · Algorithms · MCQ · 2 marks

Consider the decision problem 2CNFSAT defined as follows:

\{\Phi \mid \Phi \text{ is a satisfiable propositional formula in CNF with at most two literals per clause}\}

For example,

\Phi=(x_1\lor x_2)\land(x_1\lor \overline{x_3})\land(x_2\lor x_4)

is a Boolean formula and it is in 2CNFSAT.

The decision problem 2CNFSAT is:

(A)
NP-Complete.
(B)
solvable in polynomial time by reduction to directed graph reachability.
(C)
solvable in constant time since any input instance is satisfiable.
(D)
NP-hard, but not NP-complete.

Answer (official key): B

Solution

2-SAT can be solved in polynomial time by constructing the implication graph and checking reachability / strongly connected components.

Therefore, 2CNFSAT is solvable in polynomial time.

The correct answer is Option B.

Q62 · Algorithms · Numerical · 2 marks

Suppose you want to move from 0 to 100 on the number line. In each step, you either move right by a unit distance or you take a shortcut. A shortcut is simply a pre-specified pair of integers $i,j$ with $i<j$ . Given a shortcut $i,j$ , if you are at position $i$ on the number line, you may directly move to $j$ .

Suppose $T(k)$ denotes the smallest number of steps needed to move from $k$ to 100. Suppose further that there is at most one shortcut involving any number, and in particular from 9 there is a shortcut to 15. Let $y$ and $z$ be such that

T(9)=1+\min(T(y),T(z)).

Then the value of the product $yz$ is __________.

(Answer in integer)

Answer (official key): 150

Solution

From position 9, there are two possible moves:

move right by one unit to 10
take the shortcut from 9 to 15

So:

T(9)=1+\min(T(10),T(15)).

Hence:

y=10,\quad z=15.

Therefore:

yz=10\times15=150.

The answer is 150.

The other 60 questions are solved in your report when you take GATE 2014 CS (Set 3) as a 3-hour test.

Take GATE 2014 CS (Set 3) as a test

Official answer key

GATE 2014 CS (Set 3) answer key

All 65 answers from the official key. Numerical answers are ranges; “or” means the key accepts either answer.

Download the official GATE 2014 CS (Set 3) answer key (PDF)

Q	Topic	Type	Marks	Answer
1	Verbal Aptitude	MCQ	1	C
2	Quantitative Aptitude	MCQ	1	C
3	Verbal Aptitude	MCQ	1	D
4	Verbal Aptitude	MCQ	1	C
5	Analytical Aptitude	MCQ	1	C
6	Analytical Aptitude	MCQ	2	D
7	Quantitative Aptitude	MCQ	2	D
8	Quantitative Aptitude	MCQ	2	C
9	Analytical Aptitude	MCQ	2	B
10	Quantitative Aptitude	MCQ	2	C
11	Programming and Data Structures	Numerical	1	7
12	Algorithms	Numerical	1	19
13	Compiler Design	MCQ	1	D
14	Computer Networks	MCQ	1	D
15	Databases	MCQ	1	A
16	Theory of Computation	Numerical	1	3
17	Theory of Computation	MCQ	1	C
18	Computer NetworksNot in GATE 2027 syllabus: Framing (data link layer)	MCQ	1	B
19	Compiler Design	MCQ	1	C
20	Computer Organization and Architecture	MCQ	1	C
21	Discrete Mathematics	MCQ	1	D
22	Discrete Mathematics	MCQ	1	D
23	Computer Networks	MCQ	1	B
24	Calculus	Numerical	1	2
25	Operating System	Numerical	1	6
26	Databases	MCQ	1	B
27	Digital Logic	MCQ	1	C
28	Programming and Data Structures	MCQ	1	A
29	Linear Algebra	MCQ	1	A
30	Programming and Data Structures	MCQ	1	A
31	Discrete Mathematics	Numerical	1	5
32	Calculus	Numerical	1	4
33	Algorithms	MCQ	1	A
34	Programming and Data Structures	MCQ	1	B
35	Digital Logic	MCQ	1	B
36	Databases	MCQ	2	D
37	Theory of Computation	MCQ	2	A
38	Computer Networks	Numerical	2	1
39	Discrete Mathematics	MCQ	2	A
40	Operating System	Numerical	2	122
41	Computer Organization and Architecture	Numerical	2	1.68
42	Programming and Data Structures	MCQ	2	A
43	Programming and Data Structures	Numerical	2	110
44	Databases	MCQ	2	A
45	Digital Logic	MCQ	2	D
46	Discrete Mathematics	MCQ	2	C
47	Digital Logic	MCQ	2	C
48	Operating System	Numerical	2	5.5
49	Programming and Data Structures	MCQ	2	B
50	Theory of Computation	MCQ	2	C
51	Computer Networks	MCQ	2	A
52	Calculus	Numerical	2	0.25
53	Discrete Mathematics	MCQ	2	D
54	Compiler Design	MCQ	2	A
55	Computer Organization and Architecture	Numerical	2	1.5 to 1.6
56	Calculus	MCQ	2	A
57	Discrete Mathematics	Numerical	2	4
58	Computer Networks	Numerical	2	256
59	Algorithms	MCQ	2	B
60	Databases	MCQ	2	D
61	Calculus	MCQ	2	C
62	Algorithms	Numerical	2	150
63	Programming and Data Structures	MCQ	2	D
64	Discrete Mathematics	MCQ	2	B
65	Operating System	Numerical	2	7

Questions about GATE 2014 CS (Set 3)

How many questions are in the GATE 2014 CS (Set 3) paper?

65 questions for 100 marks: 10 General Aptitude questions worth 15 marks and 55 Computer Science & Information Technology questions worth 85 marks. By type, there were 47 MCQs, 18 numerical answer (NAT) questions. The paper lasted 3 hours.

Is there negative marking in GATE 2014 CS (Set 3)?

Yes, for MCQs only. A wrong MCQ answer costs one-third of its marks (−⅓ for a 1-mark question, −⅔ for a 2-mark question). MSQ and numerical (NAT) questions have no negative marking, and an MSQ earns marks only when every correct option is chosen.

Which topics carried the most marks in GATE 2014 CS (Set 3)?

Outside General Aptitude, the biggest topics were Discrete Mathematics (13 marks), Programming and Data Structures (12 marks), Computer Networks (9 marks). The full topic-wise split is in the table on this page.

Were any GATE 2014 CS (Set 3) questions awarded marks to all?

No. Every question was graded with the answer in the official key.

Where does this GATE 2014 CS (Set 3) answer key come from?

From the official answer key published by IIT Kharagpur, which organised GATE 2014. Range answers for numerical questions and questions with more than one accepted answer are kept exactly as the key gives them.

GATE 2014 CS (Set 3) question paper PDF and answer key

GATE 2014 CS (Set 3) topic-wise marks

5 solved questions from GATE 2014 CS (Set 3)

GATE 2014 CS (Set 3) answer key

Questions about GATE 2014 CS (Set 3)

How many questions are in the GATE 2014 CS (Set 3) paper?

Is there negative marking in GATE 2014 CS (Set 3)?

Which topics carried the most marks in GATE 2014 CS (Set 3)?

Were any GATE 2014 CS (Set 3) questions awarded marks to all?

Where does this GATE 2014 CS (Set 3) answer key come from?

More GATE papers