GateAI

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

All 65 questions of the GATE CSE 2025 Set 2 paper (100 marks: 30 one-mark and 35 two-mark; 32 MCQ, 18 MSQ, 15 NAT), with the answer key and a verified solution for each. See more GATE CSE question papers or all GATE CSE PYQs.

Questions
65
Total marks
100
MCQ / MSQ / NAT
32 / 18 / 15
Topics
44

GATE CSE 2025 Set 2 paper analysis

General Aptitude and Engineering Mathematics together made up 27 of 100 marks, down 2 from GATE CSE 2024 Set 2. 15 of 65 questions were NAT, the most since 2024. Quantitative Aptitude was the heaviest single topic with 6 marks across 4 questions. Algorithms moved the most against GATE CSE 2024 Set 2: up 3 marks.

All GATE CSE 2025 Set 2 questions

Each question opens its full verified solution.

  1. Q1 · MCQ · 1 mark · Verbal AptitudeDespite his initial hesitation, Rehman’s … to contribute to the success of the project never wavered. Select the most appropriate option to complete the above sentence.
  2. Q2 · MCQ · 1 mark · Verbal AptitudeBird : Nest :: Bee : … Select the correct option to complete the analogy.
  3. Q3 · MCQ · 1 mark · Quantitative AptitudeIf P ex = Q e-x for all real values of x, which one of the following statements is true?
  4. Q4 · MCQ · 1 mark · Spatial AptitudeThe paper as shown in the figure is folded to make a cube where each square corresponds to a particular face of the cube. Which one of the following options correctly re…
  5. Q5 · MCQ · 1 mark · Quantitative AptitudeLet p1 and p2 denote two arbitrary prime numbers. Which one of the following statements is correct for all values of p1 and p2?
  6. Q6 · MCQ · 2 marks · Verbal AptitudeBased only on the conversation below, identify the logically correct inference: “Even if I had known that you were in the hospital, I would not have gone there to see yo…
  7. Q7 · MCQ · 2 marks · Reading ComprehensionIf IMAGE and FIELD are coded as FHBNJ and EMFJG respectively then, which one among the given options is the most appropriate code for BEACH ?
  8. Q8 · MCQ · 2 marks · Quantitative AptitudeWhich one of the following options is correct for the given data in the table?
  9. Q9 · MCQ · 2 marks · Quantitative AptitudeIn the given figure, PQRS is a square of side 2 cm and PLMN is a rectangle. The corner L of the rectangle is on the side QR. Side MN of the rectangle passes through the…
  10. Q10 · MCQ · 2 marks · Analytical AptitudeThe diagram below shows a river system consisting of 7 segments, marked P, Q, R, S, T, U, and V. It splits the land into 5 zones, marked Z1, Z2, Z3, Z4, and Z5. We need…
  11. Q11 · MCQ · 1 mark · Linear AlgebraIf A = 1 & 2 2 & -1 , then which ONE of the following is A8 ?
  12. Q12 · MCQ · 1 mark · CalculusThe value of x such that x > 1, satisfying the equation 1x t ln t dt = (1)/(4) is
  13. Q13 · MCQ · 1 mark · TreesConsider a binary tree T in which every node has either zero or two children. Let n > 0 be the number of nodes in T. Which ONE of the following is the number of nodes in…
  14. Q14 · MCQ · 1 mark · Linear AlgebraLet L, M, and N be non-singular matrices of order 3 satisfying the equations L2 = L-1, M = L8 and N = L2. Which ONE of the following is the value of the determinant of (…
  15. Q15 · MCQ · 1 mark · Discrete MathematicsLet P(x) be an arbitrary predicate over the domain of natural numbers. Which ONE of the following statements is TRUE?
  16. Q16 · MCQ · 1 mark · TCP Flow and Congestion ControlConsider the following statements: (i) Address Resolution Protocol (ARP) provides a mapping from an IP address to the corresponding hardware (link-layer) address. (ii) A…
  17. Q17 · MCQ · 1 mark · Distance Vector and Link-State RoutingConsider the routing protocols given in List I and the names given in List II: For matching of items in List I with those in List II, which ONE of the following options…
  18. Q18 · MCQ · 1 mark · IPv4, CIDR and NATA machine receives an IPv4 datagram. The protocol field of the IPv4 header has the protocol number of a protocol X. Which ONE of the following is NOT a possible candidat…
  19. Q19 · MCQ · 1 mark · Programming in CConsider the following C program: #include void stringcopy(char *, char *); int main() { char a[30] = "@#Hello World!"; stringcopy(a, a + 2); printf("%s ", a); return 0;…
  20. Q20 · MCQ · 1 mark · SearchingConsider an unordered list of N distinct integers. What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest in t…
  21. Q21 · MCQ · 1 mark · Intermediate Code GenerationConsider the following statements about the use of backpatching in a compiler for intermediate code generation: (I) Backpatching can be used to generate code for Boolean…
  22. Q22 · MCQ · 1 mark · Syntax-Directed TranslationGiven the following syntax directed translation rules: Rule 1: R → AB {B.i = R.i - 1; A.i = B.i; R.i = A.i + 1;} Rule 2: P → CD {P.i = C.i + D.i; D.i = C.i + 2;} Rule 3:…
  23. Q23 · MCQ · 1 mark · IPv4 FragmentationConsider a network that uses Ethernet and IPv4. Assume that IPv4 headers do not use any options field. Each Ethernet frame can carry a maximum of 1500 bytes in its data…
  24. Q24 · MCQ · 1 mark · Context-Free Grammars and PDAsWhich ONE of the following languages is accepted by a deterministic pushdown automaton?
  25. Q25 · MCQ · 1 mark · Turing Machines and UndecidabilityLet G1, G2 be Context Free Grammars (CFGs) and R be a regular expression. For a grammar G, let L(G) denote the language generated by G. Which ONE among the following que…
  26. Q26 · MCQ · 1 mark · CPU and I/O SchedulingProcesses P1, P2, P3, P4 arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively.…
  27. Q27 · MSQ · 1 mark · Transactions and Concurrency ControlAn audit of a banking transactions system has found that on an earlier occasion, two joint holders of account A attempted simultaneous transfers of Rs. 10000 each from a…
  28. Q28 · MSQ · 1 mark · Instruction Set and Addressing ModesWhich of the following is/are part of an Instruction Set Architecture of a processor?
  29. Q29 · MSQ · 1 mark · Graph TraversalsWhich of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph G is/are TRUE?
  30. Q30 · MSQ · 1 mark · Regular and Context-Free LanguagesConsider the two lists List I and List II given below: For matching of items in List I with those in List II, which of the following option(s) is/are CORRECT?
  31. Q31 · MSQ · 1 mark · Boolean Algebra and MinimizationConsider the following logic circuit diagram. Which is/are the CORRECT option(s) for the output function F?
  32. Q32 · NAT · 1 mark · ALU DesignThe following two signed 2's complement numbers (multiplicand M and multiplier Q) are being multiplied using Booth's algorithm: M: 1100 1101 1110 1101 and Q: 1010 0100 1…
  33. Q33 · NAT · 1 mark · Programming in Cint x=126, y=105; do { if(x>y) x=x-y; else y=y-x; } while(x!=y); printf("%d",x); The output of the given C code segment is … (Answer in integer)
  34. Q34 · NAT · 1 mark · Combinational and Sequential CircuitsIn a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is … (Answer in intege…
  35. Q35 · NAT · 1 mark · Binary Search TreesSuppose the values 10, -4, 15, 30, 20, 5, 60, 19 are inserted in that order into an initially empty binary search tree. Let T be the resulting binary search tree. The nu…
  36. Q36 · MCQ · 2 marks · Data Link LayerSuppose we are transmitting frames between two nodes using Stop-and-Wait protocol. The frame size is 3000 bits. The transmission rate of the channel is 2000 bps (bits/se…
  37. Q37 · MCQ · 2 marks · Minimum Spanning Trees and Shortest PathsLet G be an edge-weighted undirected graph with positive edge weights. Suppose a positive constant is added to the weight of every edge. Which ONE of the following state…
  38. Q38 · MCQ · 2 marks · Linear Structures, Trees and HeapsA meld operation on two instances of a data structure combines them into one single instance of the same data structure. Consider the following data structures: P: Unsor…
  39. Q39 · MCQ · 2 marks · Cache Memory and HierarchyFor a direct-mapped cache, 4 bits are used for the tag field and 12 bits are used to index into a cache block. The size of each cache block is one byte. Assume that ther…
  40. Q40 · MCQ · 2 marks · ParsingGiven a Context-Free Grammar G as follows: S → Aa bAc dc bda A → d Which ONE of the following statements is TRUE?
  41. Q41 · MCQ · 2 marks · Searching, Sorting and HashingAn array A of length n with distinct elements is said to be bitonic if there is an index 1 ≤ i ≤ n such that A[1 i] is sorted in the non-decreasing order and A[i + 1 n]…
  42. Q42 · MSQ · 2 marks · Discrete MathematicsLet F be the set of all functions from {1, , n} to {0,1}. Define the binary relation on F as follows: ∀ f, g ∈ F, f g if and only if ∀ x ∈ {1, , n}, f(x) ≤ g(x), where 0…
  43. Q43 · MSQ · 2 marks · Boolean Algebra and MinimizationGiven the following Karnaugh Map for a Boolean function F(w, x, y, z): Which one or more of the following Boolean expression(s) represent(s) F?
  44. Q44 · MSQ · 2 marks · Linear AlgebraConsider a system of linear equations PX = Q where P ∈ R3× 3 and Q ∈ R3× 1. Suppose P has an LU decomposition, P = LU, where L = 1 & 0 & 0 l21 & 1 & 0 l31 & l32 & 1 and…
  45. Q45 · MSQ · 2 marks · StacksConsider a stack data structure into which we can PUSH and POP records. Assume that each record pushed in the stack has a positive integer key and that all keys are dist…
  46. Q46 · MSQ · 2 marks · Integrity Constraints and Normal FormsConsider the following relational schema along with all the functional dependencies that hold on them. R1(A, B, C, D, E): { D → E, EA → B, EB → C } R2(A, B, C, D): { A →…
  47. Q47 · MSQ · 2 marks · Memory Management and Virtual MemoryConsider a demand paging system with three frames, and the following page reference string: 1 2 3 4 5 4 1 6 4 5 1 3 2. The contents of the frames are as follows initiall…
  48. Q48 · MSQ · 2 marks · DeadlockP = {P1, P2, P3, P4} consists of all active processes in an operating system. R = {R1, R2, R3, R4} consists of single instances of distinct types of resources in the sys…
  49. Q49 · MSQ · 2 marks · Number Representation and ArithmeticThree floating point numbers X, Y, and Z are stored in three registers Rx, RY, and RZ, respectively in IEEE 754 single precision format as given below in hexadecimal: Rx…
  50. Q50 · MSQ · 2 marks · Boolean Algebra and MinimizationWhich of the following Boolean algebraic equation(s) is/are CORRECT?
  51. Q51 · MSQ · 2 marks · ParsingConsider two grammars G1 and G2 with the production rules given below: G1: S → if E then S if E then S else S a E → b G2: S → if E then S M M → if E then M else S c E →…
  52. Q52 · MSQ · 2 marks · Regular and Context-Free LanguagesLet = {a, b, c}. For x ∈ *, and ∈ , let \# (x) denote the number of occurrences of in x. Which one or more of the following option(s) define(s) regular language(s)?
  53. Q53 · MSQ · 2 marks · Transactions and Concurrency ControlConsider the database transactions T1 and T2, and data items X and Y. Which of the schedule(s) is/are conflict serializable?
  54. Q54 · MSQ · 2 marks · SQLConsider the following relational schema: Students ( rollno: integer, name: string, age: integer, cgpa: real) Courses ( courseno: integer, cname: string, credits: intege…
  55. Q55 · NAT · 2 marks · Cache Memory and HierarchyGiven a computing system with two levels of cache (L1 and L2) and a main memory. The first level (L1) cache access time is 1 nanosecond (ns) and the “hit rate” for L1 ca…
  56. Q56 · NAT · 2 marks · Instruction PipeliningA 5-stage instruction pipeline has stage delays of 180, 250, 150, 170, and 250, respectively, in nanoseconds. The delay of an inter-stage latch is 10 nanoseconds. Assume…
  57. Q57 · NAT · 2 marks · File Organization and IndexingIn a B+- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes: A = (49, 77, 83, -), B = (7, 19, 33, 44), C = (20*,…
  58. Q58 · NAT · 2 marks · Memory Management and Virtual MemoryA computer system supports a logical address space of 232 bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A logical address is divided into…
  59. Q59 · NAT · 2 marks · Graph TraversalsConsider the following algorithm someAlgo that takes an undirected graph G as input. someAlgo(G) 1. Let v be any vertex in G. Run BFS on G starting at v. Let u be a vert…
  60. Q60 · NAT · 2 marks · Regular Expressions and Finite AutomataLet = {1,2,3,4}. For x ∈ *, let prod(x) be the product of symbols in x modulo 7. We take prod( ) = 1, where is the null string. For example, prod(124) = (1 × 2 × 4) mod…
  61. Q61 · NAT · 2 marks · Cache Memory and HierarchyAn application executes 6.4 × 108 number of instructions in 6.3 seconds. There are four types of instructions, the details of which are given in the table. The duration…
  62. Q62 · NAT · 2 marks · Programming in CConsider the following C program: #include int main() { int a; int arr[5] = {30,50,10}; int *ptr; ptr = &arr[0] + 1; a = *ptr; (*ptr)++; ptr++; printf("%d", a + (*ptr) +…
  63. Q63 · NAT · 2 marks · Programming in CConsider the following C program: #include int g(int n) { return (n+10); } int f(int n) { return g(n*2); } int main() { int sum, n; sum=0; for (n=1; n The output of the…
  64. Q64 · NAT · 2 marks · Probability and StatisticsA quadratic polynomial (x - )(x - ) over complex numbers is said to be square invariant if (x - )(x - ) = (x - 2)(x - 2). Suppose from the set of all square invariant qu…
  65. Q65 · NAT · 2 marks · Probability and StatisticsThe unit interval (0,1) is divided at a point chosen uniformly distributed over (0,1) in R into two disjoint subintervals. The expected length of the subinterval that co…

GATE CSE 2025 Set 2 answer key

Official answers. Open a question for the full solution.

QTypeMarksAnswerTopic
Q1MCQ1CVerbal Aptitude
Q2MCQ1CVerbal Aptitude
Q3MCQ1AQuantitative Aptitude
Q4MCQ1ASpatial Aptitude
Q5MCQ1BQuantitative Aptitude
Q6MCQ2BVerbal Aptitude
Q7MCQ2BReading Comprehension
Q8MCQ2AQuantitative Aptitude
Q9MCQ2DQuantitative Aptitude
Q10MCQ2CAnalytical Aptitude
Q11MCQ1CLinear Algebra
Q12MCQ1ACalculus
Q13MCQ1BTrees
Q14MCQ1ALinear Algebra
Q15MCQ1ADiscrete Mathematics
Q16MCQ1BTCP Flow and Congestion Control
Q17MCQ1ADistance Vector and Link-State Routing
Q18MCQ1DIPv4, CIDR and NAT
Q19MCQ1DProgramming in C
Q20MCQ1ASearching
Q21MCQ1CIntermediate Code Generation
Q22MCQ1CSyntax-Directed Translation
Q23MCQ1DIPv4 Fragmentation
Q24MCQ1AContext-Free Grammars and PDAs
Q25MCQ1DTuring Machines and Undecidability
Q26MCQ1DCPU and I/O Scheduling
Q27MSQ1B, CTransactions and Concurrency Control
Q28MSQ1DInstruction Set and Addressing Modes
Q29MSQ1B, C, DGraph Traversals
Q30MSQ1B, CRegular and Context-Free Languages
Q31MSQ1A, B, CBoolean Algebra and Minimization
Q32NAT113ALU Design
Q33NAT121Programming in C
Q34NAT1250Combinational and Sequential Circuits
Q35NAT14Binary Search Trees
Q36MCQ2AData Link Layer
Q37MCQ2CMinimum Spanning Trees and Shortest Paths
Q38MCQ2ALinear Structures, Trees and Heaps
Q39MCQ2ACache Memory and Hierarchy
Q40MCQ2CParsing
Q41MCQ2DSearching, Sorting and Hashing
Q42MSQ2B, CDiscrete Mathematics
Q43MSQ2A, DBoolean Algebra and Minimization
Q44MSQ2A, B, CLinear Algebra
Q45MSQ2AStacks
Q46MSQ2C, DIntegrity Constraints and Normal Forms
Q47MSQ2DMemory Management and Virtual Memory
Q48MSQ2C, DDeadlock
Q49MSQ2A, B, CNumber Representation and Arithmetic
Q50MSQ2B, C, DBoolean Algebra and Minimization
Q51MSQ2C, DParsing
Q52MSQ2A, CRegular and Context-Free Languages
Q53MSQ2BTransactions and Concurrency Control
Q54MSQ2A, C, DSQL
Q55NAT24Cache Memory and Hierarchy
Q56NAT2261.04Instruction Pipelining
Q57NAT233File Organization and Indexing
Q58NAT211Memory Management and Virtual Memory
Q59NAT26Graph Traversals
Q60NAT26Regular Expressions and Finite Automata
Q61NAT23Cache Memory and Hierarchy
Q62NAT2111Programming in C
Q63NAT246Programming in C
Q64NAT20.5Probability and Statistics
Q65NAT20.74Probability and Statistics

Subject-wise weightage

Where the marks came from in GATE CSE 2025 Set 2, against GATE CSE 2024 Set 2 and the average paper.

GATE CSE 2025 Set 2 FAQ

How many questions were in GATE CSE 2025 Set 2?
GATE CSE 2025 Set 2 had 65 questions for 100 marks: 32 MCQ, 18 MSQ and 15 NAT.
Which subject carried the most marks in GATE CSE 2025 Set 2?
General Aptitude carried the most marks (15 of 100). The top three were General Aptitude (15), Engineering Mathematics (12), Programming and Data Structures (12).
Where can I find the GATE CSE 2025 Set 2 answer key?
The answer key table on this page lists the answer to every question of GATE CSE 2025 Set 2. Open any question for its full verified solution.
Is the GATE CSE 2025 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.

Explore more GATE CSE papers