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

Engineering Mathematics and Programming and Data Structures together made up 29 of 82 marks, down 2 from GATE CSE 2014 Set 3. 19 of 55 questions were NAT, the most since 2014. Programming in C was the heaviest single topic with 6 marks across 4 questions. Engineering Mathematics moved the most against GATE CSE 2014 Set 3: down 7 marks.

1. Q1 · MCQ · 1 mark · Processes, Threads and IPCThe maximum number of processes that can be in Ready state for a computer system with n CPUs is
2. Q2 · MCQ · 1 mark · Boolean Algebra and MinimizationLet \# be a binary operator defined as X \# Y = X' + Y' where X and Y are Boolean variables. Consider the following two statements. (S1) (P \# Q)\# R = P\#(Q \# R) (S2)…
3. Q3 · MCQ · 1 mark · SQLConsider the following relation Cinema(theater, address, capacity) Which of the following options will be needed at the end of the SQL query SELECT P1.address FROM Cinem…
4. Q4 · MCQ · 1 mark · Asymptotic AnalysisConsider the equality Σi=0n i3 = X and the following choices for X I. (n4) II. (n5) III. O(n5) IV. (n3) The equality above remains correct if X is replaced by
5. Q5 · NAT · 1 mark · CombinatoricsThe number of 4 digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set {1, 2, 3} is …
6. Q6 · MCQ · 1 mark · Data Link LayerConsider a CSMA/CD network that transmits data at a rate of 100 Mbps (108 bits per second) over a 1 km (kilometer) cable with no repeaters. If the minimum frame size req…
7. Q7 · MCQ · 1 mark · Programming in CConsider the following C program segment. #include int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '\0'; printf("%s", s1); } What will be printed by the program?
8. Q8 · MCQ · 1 mark · DNS and HTTPIn a web server, ten WebPages are stored with the URLs of the form http://www.yourname.com/var.html; where, var is a different number from 1 to 10 for each Webpage. Supp…
9. Q9 · MCQ · 1 mark · CalculusThe value of limx → ∞ (1 + x2)e-x is
10. Q10 · MCQ · 1 mark · Concurrency and SynchronizationTwo processes X and Y need to access a critical section. Consider the following synchronization construct used by both the processes Here, varP and varQ are shared varia…
11. Q11 · NAT · 1 mark · Software EngineeringConsider a software program that is artificially seeded with 100 faults. While testing this program, 159 faults are detected, out of which 75 faults are from those artif…
12. Q12 · MCQ · 1 mark · StacksThe result evaluating the postfix expression 10 5 + 60 6 / * 8 - is
13. Q13 · MCQ · 1 mark · Binary Search TreesWhile inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is
14. Q14 · MCQ · 1 mark · Cache Memory and HierarchyConsider a machine with a byte addressable main memory of 220 bytes, block size of 16 bytes and a direct mapped cache having 212 cache lines. Let the addresses of two co…
15. Q15 · MCQ · 1 mark · Linear AlgebraIn the given matrix 1 & -1 & 2 0 & 1 & 0 1 & 2 & 1 , one of the eigenvalues is 1. The eigenvectors corresponding to the eigenvalue 1 are
16. Q16 · MCQ · 1 mark · ParsingAmong simple LR (SLR) , canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is th…
17. Q17 · NAT · 1 mark · Searching, Sorting and HashingGiven a hash table T with 25 slots that stores 2000 elements, the load factor for T is …
18. Q18 · MCQ · 1 mark · Regular Expressions and Finite AutomataLet L be the language represented by the regular expression * 0011 * where = {0, 1}. What is the minimum number of states in a DFA that recognizes L (complement of L)?
19. Q19 · MCQ · 1 mark · Binary HeapsConsider the following array of elements. 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 The minimum number of interchanges needed to convert it into a max-heap is
20. Q20 · MCQ · 1 mark · Integrity Constraints and Normal FormsConsider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies F = { {P, R} → {S, T}, {P, S, U} → {Q, R} } Which of the following is the tri…
21. Q21 · NAT · 1 mark · Function Point MetricConsider a software project with the following information domain characteristics for calculation of function point metric. Number of external inputs (I) = 30 Number of…
22. Q22 · MCQ · 1 mark · TCP Flow and Congestion ControlConsider the following statements. I. TCP connections are full duplex II. TCP has no option for selective acknowledgement III. TCP connections are message streams (A) On…
23. Q23 · MCQ · 1 mark · Discrete MathematicsSuppose U is the power set of the set S = {1,2,3,4,5,6}. For any T ∈ U, let |T| denote the number of elements in T and T' denote the complement of T. For any T, R ∈ U, l…
24. Q24 · MCQ · 1 mark · Discrete MathematicsIn a room there are only two types of people, namely Type 1 and Type 2. Type 1 people always tell the truth and Type 2 people always lie. You give a fair coin to a perso…
25. Q25 · NAT · 1 mark · TreesConsider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are …
26. Q26 · NAT · 1 mark · Programming in CConsider the following C program. #include int main( ) { static int a[ ] = {10, 20, 30, 40, 50}; static int *p[ ] = {a, a+3, a+4, a+1, a+2}; int ptr = p; ptr++; printf("…
27. Q27 · MCQ · 1 mark · SortingAssume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of…
28. Q28 · NAT · 2 marks · Switching and Performance MetricsConsider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is 500 × 106 bits per second. The propagation speed of the media is…
29. Q29 · MCQ · 2 marks · Transactions and Concurrency ControlConsider the following partial Schedule S involving two transactions T1 and T2. Only the read and the write operations have been shown. The read operation on data item P…
30. Q30 · MCQ · 2 marks · Linear Structures, Trees and HeapsConsider the following two C code segments. Y and X are one and two dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segme…
31. Q31 · MCQ · 2 marks · ParsingConsider the following grammar G S &→ F H F &→ p c H &→ d c where S, F, and H are non-terminal symbols, p, d, and c are terminal symbols. Which of the following statemen…
32. Q32 · MCQ · 2 marks · Context-Free Grammars and PDAsWhich of the following languages are context-free? L1 = {am bn an bm m, n ≥ 1} L2 = {am bn am bn m, n ≥ 1} L3 = {am bn m = 2n + 1}
33. Q33 · MCQ · 2 marks · Linear AlgebraIf the following system has non-trivial solution, px + qy + rz = 0 qx + ry + pz = 0 rx + py + qz = 0, then which one of the following options is TRUE?
34. Q34 · MCQ · 2 marks · CPU and I/O SchedulingFor the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?
35. Q35 · NAT · 1 mark · Number Representation and ArithmeticConsider the equation (43)x = (y3)8 where x and y are unknown. The number of possible solutions is …
36. Q36 · NAT · 2 marks · Switching and Performance MetricsTwo hosts are connected via a packet switch with 107 bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 3…
37. Q37 · NAT · 2 marks · Probability and StatisticsSuppose Xi for i = 1,2,3 are independent and identically distributed random variables whose probability mass functions are [Xi = 0] = [Xi = 1] = 1/2 for i = 1,2,3. Defin…
38. Q38 · NAT · 2 marks · IPv4, CIDR and NATIn the network 200.10.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is …
39. Q39 · MCQ · 2 marks · RecursionConsider the following recursive C function. void get(int n) { if (n If get(6) function is being called in main() then how many times will the get() function be invoked…
40. Q40 · NAT · 2 marks · Graph Traversals, MSTs and Shortest PathsLet G be a connected undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of G is 500. When the weight of each edge of G is increased by…
41. Q41 · MCQ · 2 marks · Sets, Relations, Lattices and GroupsLet R be a relation on the set of ordered pairs of positive integers such that ((p,q),(r,s)) ∈ R if and only if p - s = q - r. Which one of the following is true about R?
42. Q42 · MCQ · 2 marks · Asymptotic AnalysisLet f(n) = n and g(n) = n(1 + sin n), where n is a positive integer. Which of the following statements is/are correct? I. f(n) = O(g(n)) II. f(n) = (g(n))
43. Q43 · NAT · 2 marks · Boolean Algebra and MinimizationThe total number of prime implicants of the function f(w, x, y, z) = Σ(0, 2, 4, 5, 6, 10) is …
44. Q44 · MCQ · 2 marks · Boolean Algebra and MinimizationGiven the function F = P' + QR, where F is a function in three Boolean variables P, Q and R and P' = !P, consider the following statements. (S1) F = Σ (4, 5, 6) (S2) F =…
45. Q45 · MCQ · 2 marks · CalculusIf for non-zero x, af(x) + bf ((1)/(x) ) = (1)/(x) - 25 where a ≠ b then 12 f(x)dx is
46. Q46 · NAT · 2 marks · File Organization and IndexingConsider a B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum num…
47. Q47 · MCQ · 2 marks · Instruction PipeliningConsider the following code sequence having five instructions I1 to I5. Each of these instructions has the following format. OP Ri, Rj, Rk where operation OP is performe…
48. Q48 · NAT · 2 marks · Programming in CConsider the following C program: #include int main( ) { int i, j, k = 0; j = 2 * 3 / 4 + 2.0 / 5 + 8 / 5; k -= --j; for(i = 0; i The number of times printf statement is…
49. Q49 · NAT · 2 marks · Algorithm Design TechniquesSuppose c = c[0], ..., c[k - 1] is an array of length k, where all the entries are from the set {0, 1}. For any positive integers a and n, consider the following pseudoc…
50. Q50 · NAT · 2 marks · CalculusThe velocity v (in kilometer/minute) of a motorbike which starts from rest, is given at fixed intervals of time t (in minutes) as follows: The approximate distance (in k…
51. Q51 · NAT · 2 marks · Instruction PipeliningConsider the following reservation table for a pipeline having three stages S1, S2 and S3. The minimum average latency (MAL) is …
52. Q52 · MCQ · 2 marks · DeadlockConsider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning o…
53. Q53 · MCQ · 2 marks · Turing Machines and UndecidabilityLanguage L1 is polynomial time reducible to language L2. Language L3 is polynomial time reducible to L2, which in turn is polynomial time reducible to language L4. Which…
54. Q54 · NAT · 2 marks · Programming in CConsider the following C program. #include int f1(void); int f2(void); int f3(void); int x = 10; int main( ) { int x = 1; x += f1( ) + f2( ) + f3( ) + f2( ); printf("%d"…
55. Q55 · MCQ · 2 marks · Cyclomatic ComplexityConsider three software items: Program-X, Control Flow Diagram of Program-Y and Control Flow Diagram of Program-Z as shown below The values of McCabe's Cyclomatic comple…

How many questions were in GATE CSE 2015 Set 3?

GATE CSE 2015 Set 3 had 55 questions for 82 marks: 36 MCQ, 0 MSQ and 19 NAT.

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

Engineering Mathematics carried the most marks (15 of 82). The top three were Engineering Mathematics (15), Programming and Data Structures (14), Algorithms (9).

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

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

Is the GATE CSE 2015 Set 3 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 2 question paper
• GATE CSE 2014 Set 3 question paper
• GATE CSE 2016 Set 1 question paper
• All GATE CSE papers →
• GATE CSE Engineering Mathematics PYQs
• GATE CSE Programming and Data Structures PYQs
• GATE CSE Algorithms PYQs