GATE CSE 2015 Set 2 Question Paper with Solutions & Answer Key

Engineering Mathematics and Programming and Data Structures together made up 9 of 21 marks, down 21 from GATE CSE 2014 Set 2. 8 of 21 questions were NAT, the most since 2014. Turing Machines and Undecidability was the heaviest single topic with 2 marks across 2 questions. Engineering Mathematics moved the most against GATE CSE 2014 Set 2: down 14 marks.

1. Q1 · MCQ · 1 mark · Transactions and Concurrency ControlConsider the following transaction involving two bank accounts x and y . read(x) ; x := x - 50; write(x) ; read(y) ; y:= y + 50; write(y) The constraint that the sum of…
2. Q2 · MCQ · 1 mark · Turing Machines and UndecidabilityConsider two decision problems Q1, Q2 such that Q1 reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to Q2. Then which one of the following is con…
3. Q3 · MCQ · 1 mark · Discrete MathematicsConsider the following two statements. S1: If a candidate is known to be corrupt, then he will not be elected S2: If a candidate is kind, he will be elected Which one of…
4. Q4 · MCQ · 1 mark · Software EngineeringA software requirements specification (SRS) document should avoid discussing which one of the following?
5. Q5 · NAT · 1 mark · Linear AlgebraThe larger of the two eigenvalues of the matrix 4 & 5 2 & 1 is …
6. Q6 · NAT · 1 mark · File Organization and IndexingWith reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following…
7. Q7 · NAT · 1 mark · Combinational and Sequential CircuitsThe 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, ) is …
8. Q8 · NAT · 1 mark · Switching and Performance MetricsA link has a transmission speed of 106 bits/sec. It uses data packets of size 1000 bytes each. Assume that the acknowledgment has negligible transmission delay, and that…
9. Q9 · NAT · 1 mark · CombinatoricsThe number of divisors of 2100 is …
10. Q10 · NAT · 1 mark · TreesA binary tree T has 20 leaves. The number of nodes in T having two children is …
11. Q11 · NAT · 1 mark · RecursionConsider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k The return value of fun(5) is …
12. Q12 · MCQ · 1 mark · COCOMO ModelConsider the basic COCOMO model where E is the effort applied in person-months, D is the development time in chronological months, KLOC is the estimated number of delive…
13. Q13 · MCQ · 1 mark · DNS and HTTPWhich one of the following statements is NOT correct about HTTP cookies?
14. Q14 · MCQ · 1 mark · Intermediate Code GenerationIn the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE?
15. Q15 · MCQ · 1 mark · RecursionConsider the following function written in the C programming language. void foo(char *a){ if ( *a && *a != ' '){ foo(a+1); putchar(*a); } } The output of the above funct…
16. Q16 · MCQ · 1 mark · Sets, Relations, Lattices and GroupsLet R be the relation on the set of positive integers such that aRb if and only if a and b are distinct and have a common divisor other than 1. Which one of the followin…
17. Q17 · MCQ · 1 mark · Binary HeapsConsider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a he…
18. Q18 · NAT · 1 mark · Sets, Relations and FunctionsThe cardinality of the power set of { 0, 1, 2, , 10 } is …
19. Q19 · MCQ · 1 mark · Lexical Analysis, Parsing and SDTMatch the following:
20. Q20 · MCQ · 1 mark · TCP Flow and Congestion ControlIdentify the correct order in which a server process must invoke the function calls accept , bind , listen , and recv according to UNIX socket API.
21. Q21 · MCQ · 1 mark · Turing Machines and UndecidabilityConsider the following statements. I. The complement of every Turing decidable language is Turing decidable II. There exists some language which is in NP but is not Turi…

How many questions were in GATE CSE 2015 Set 2?

GATE CSE 2015 Set 2 had 21 questions for 21 marks: 13 MCQ, 0 MSQ and 8 NAT.

Which subject carried the most marks in GATE CSE 2015 Set 2?

Engineering Mathematics carried the most marks (5 of 21). The top three were Engineering Mathematics (5), Programming and Data Structures (4), Computer Networks (3).

Where can I find the GATE CSE 2015 Set 2 answer key?

The answer key table on this page lists the answer to every question of GATE CSE 2015 Set 2. Open any question for its full verified solution.

Is the GATE CSE 2015 Set 2 paper useful for GATE 2027 preparation?

Yes. Solving past GATE CSE papers shows how marks are spread across subjects and which topics repeat. Compare it with other GATE CSE question papers and the topic-wise GATE CSE PYQs.

• GATE CSE 2015 Set 1 question paper
• GATE CSE 2015 Set 3 question paper
• GATE CSE 2014 Set 2 question paper
• GATE CSE 2016 Set 2 question paper
• All GATE CSE papers →
• GATE CSE Engineering Mathematics PYQs
• GATE CSE Programming and Data Structures PYQs
• GATE CSE Computer Networks PYQs