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

General Aptitude and Engineering Mathematics together made up 30 of 100 marks, down 1 from GATE CSE 2024 Set 1. 22 of 65 questions were NAT, the most since 2020. Quantitative Aptitude was the heaviest single topic with 7 marks across 4 questions. Algorithms moved the most against GATE CSE 2024 Set 1: up 4 marks.

1. Q1 · MCQ · 1 mark · Verbal AptitudeRavi had … younger brother who taught at … university. He was widely regarded as … honorable man. Select the option with the correct sequence of articles to fill in the…
2. Q2 · MCQ · 1 mark · Verbal AptitudeThe CEO’s decision to downsize the workforce was considered myopic because it sacrificed long-term stability to accommodate short-term gains. Select the most appropriate…
3. Q3 · MCQ · 1 mark · Quantitative AptitudeThe average marks obtained by a class in an examination were calculated as 30.8. However, while checking the marks entered, the teacher found that the marks of one stude…
4. Q4 · MCQ · 1 mark · Analytical AptitudeConsider the relationships among P, Q, R, S, and T: • P is the brother of Q. • S is the daughter of Q. • T is the sister of S. • R is the mother of Q. The following stat…
5. Q5 · MCQ · 1 mark · Spatial AptitudeAccording to the map shown in the figure, which one of the following statements is correct? Note: The figure shown is representative.
6. Q6 · MCQ · 2 marks · Reading Comprehension“I put the brown paper in my pocket along with the chalks, and possibly other things. I suppose every one must have reflected how primeval and how poetical are the thing…
7. Q7 · MCQ · 2 marks · Quantitative AptitudeIn the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and line…
8. Q8 · MCQ · 2 marks · Quantitative AptitudeA fair six-faced dice, with the faces labelled '1', '2', '3', '4', '5', and '6', is rolled thrice. What is the probability of rolling '6' exactly once?
9. Q9 · MCQ · 2 marks · Spatial AptitudeA square paper, shown in figure (I), is folded along the dotted lines as shown in the figures (II) and (III). Then a few cuts are made as shown in figure (IV). Which one…
10. Q10 · MCQ · 2 marks · Quantitative AptitudeA shop has 4 distinct flavors of ice-cream. One can purchase any number of scoops of any flavor. The order in which the scoops are purchased is inconsequential. If one w…
11. Q11 · MCQ · 1 mark · I/O Interface, Interrupts and DMASuppose a program is running on a non-pipelined single processor computer system. The computer is connected to an external device that can interrupt the processor asynch…
12. Q12 · MCQ · 1 mark · Lexical AnalysisWhich ONE of the following statements is FALSE regarding the symbol table?
13. Q13 · MCQ · 1 mark · Data Flow AnalysesWhich ONE of the following techniques used in compiler code optimization uses live variable analysis?
14. Q14 · MCQ · 1 mark · Memory Management and Virtual MemoryConsider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory is byte add…
15. Q15 · MCQ · 1 mark · Transactions and Concurrency ControlA schedule of three database transactions T1, T2, and T3 is shown. Ri(A) and Wi(A) denote read and write of data item A by transaction Ti, i = 1,2,3. The transaction T1…
16. Q16 · MCQ · 1 mark · Principles of LayeringIdentify the ONE CORRECT matching between the OSI layers and their corresponding functionalities as shown.
17. Q17 · MCQ · 1 mark · Discrete Mathematicsg(.) is a function from A to B, f(.) is a function from B to C, and their composition defined as f(g(.)) is a mapping from A to C. If f(.) and f(g(.)) are onto (surjecti…
18. Q18 · MCQ · 1 mark · Minimum Spanning TreesLet G be any undirected graph with positive edge weights, and T be a minimum spanning tree of G. For any two vertices, u and v, let d1(u, v) and d2(u, v) be the shortest…
19. Q19 · MCQ · 1 mark · Context-Free Grammars and PDAsConsider the following context-free grammar G, where S, A, and B are the variables (non-terminals), a and b are the terminal symbols, S is the start variable, and the ru…
20. Q20 · MCQ · 1 mark · Asymptotic AnalysisConsider the following recurrence relation: T(n) = 2T(n - 1) + n2n for n > 0, T(0) = 1. Which ONE of the following options is CORRECT?
21. Q21 · MSQ · 1 mark · File Organization and IndexingConsider the following B+ tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the B+ tree. Which of the following options(…
22. Q22 · MSQ · 1 mark · TCP Flow and Congestion ControlConsider the 3-way handshaking protocol for TCP connection establishment. Let the three packets exchanged during the connection establishment be denoted as P1, P2, and P…
23. Q23 · MSQ · 1 mark · Linear AlgebraConsider the given system of linear equations for variables x and y, where k is a real-valued constant. Which of the following option(s) is/are CORRECT? x + ky = 1 kx +…
24. Q24 · MSQ · 1 mark · Boolean Algebra and MinimizationLet X be a 3-variable Boolean function that produces output as ‘1’ when at least two of the input variables are ‘1’. Which of the following statement(s) is/are CORRECT,…
25. Q25 · MSQ · 1 mark · Number Representation and ArithmeticThe number -6 can be represented as 1010 in 4-bit 2's complement representation. Which of the following is/are CORRECT 2's complement representation(s) of -6?
26. Q26 · MSQ · 1 mark · Binary Search TreesWhich of the following statement(s) is/are TRUE for any binary search tree (BST) having n distinct integers?
27. Q27 · MSQ · 1 mark · ALU DesignA partial data path of a processor is given in the figure, where RA, RB, and RZ are 32-bit registers. Which option(s) is/are CORRECT related to arithmetic operations usi…
28. Q28 · MSQ · 1 mark · Regular Expressions and Finite AutomataA regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FALSE?
29. Q29 · NAT · 1 mark · Processes, Threads and IPCSuppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an I/O related operation is performed. Ass…
30. Q30 · NAT · 1 mark · CombinatoricsLet S be the set of all ternary strings defined over the alphabet {a, b, c}. Consider all strings in S that contain at least one occurrence of two consecutive symbols, t…
31. Q31 · NAT · 1 mark · CalculusConsider the given function f(x). f(x) = ax + b & for x < 1 x3 + x2 + 1 & for x ≥ 1 If the function is differentiable everywhere, the value of b must be … (rounded off t…
32. Q32 · NAT · 1 mark · Probability and StatisticsA box contains 5 coins: 4 regular coins and 1 fake coin. When a regular coin is tossed, the probability P(head) = 0.5 and for a fake coin, P(head) = 1. You pick a coin a…
33. Q33 · NAT · 1 mark · SortingThe pseudocode of a function fun() is given below: fun(int A[0,...,n-1]){ for i=0 to n-2 for j=0 to n-i-2 if (A[j]>A[j+1]) then swap A[j] and A[j+1] } Let A[0, , 29] be…
34. Q34 · NAT · 1 mark · Programming in C#include void foo(int *p, int x){ *p=x; } int main(){ int *z; int a = 20, b = 25; z = &a; foo(z,b); printf("%d",a); return 0; } The output of the given C program is … (A…
35. Q35 · NAT · 1 mark · Binary HeapsThe height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node. Suppose a Min-Heap T stores 32 keys. The height…
36. Q36 · MCQ · 2 marks · Cache Memory and HierarchyConsider a memory system with 1M bytes of main memory and 16K bytes of cache memory. Assume that the processor generates 20-bit memory address, and the cache block size…
37. Q37 · MCQ · 2 marks · Instruction Set and Addressing ModesA processor has 64 general-purpose registers and 50 distinct instruction types. An instruction is encoded in 32-bits. What is the maximum number of bits that can be used…
38. Q38 · MCQ · 2 marks · CPU and I/O SchedulingA computer has two processors, M1 and M2. Four processes P1, P2, P3, P4 with CPU bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive at the same time and the…
39. Q39 · MCQ · 2 marks · Relational Model and SQLConsider two relations describing teams and players in a sports league: • teams(tid, tname): tid, tname are team-id and team-name, respectively • players(pid, pname, tid…
40. Q40 · MCQ · 2 marks · CIDR NotationA packet with the destination IP address 145.36.109.70 arrives at a router whose routing table is shown. Which interface will the packet be forwarded to?
41. Q41 · MCQ · 2 marks · Linear AlgebraLet A be a 2 × 2 matrix as given. A = 1 & 1 1 & -1 What are the eigenvalues of the matrix A13 ?
42. Q42 · MCQ · 2 marks · Boolean Algebra and MinimizationConsider the following four variable Boolean function in sum-of-product form F(b3, b2, b1, b0) = Σ(0, 2, 4, 8, 10, 11, 12). where the value of the function is computed b…
43. Q43 · MCQ · 2 marks · Graph TraversalsLet G(V, E) be an undirected and unweighted graph with 100 vertices. Let d(u, v) denote the number of edges in a shortest path between vertices u and v in V. Let the max…
44. Q44 · MCQ · 2 marks · Regular and Context-Free LanguagesConsider the following two languages over the alphabet {a, b} : L1 = { ∈ {a, b}+ AND ∈ {a, b}+ } L2 = { ∈ {a}+ AND ∈ {a, b}+ } Which ONE of the following statements is C…
45. Q45 · MCQ · 2 marks · Regular and Context-Free LanguagesConsider the following two languages over the alphabet {a, b, c}, where m and n are natural numbers. L1 = {am bm cm+n m, n ≥ 1} L2 = {am bn cm+n m, n ≥ 1} Which ONE of t…
46. Q46 · MSQ · 2 marks · Lexical Analysis, Parsing and SDTWhich of the following statement(s) is/are TRUE while computing First and Follow during top down parsing by a compiler?
47. Q47 · MSQ · 2 marks · Integrity Constraints and Normal FormsConsider a relational schema team(name, city, owner), with functional dependencies {name → city, name → owner}. The relation team is decomposed into two relations, t1(na…
48. Q48 · MSQ · 2 marks · Propositional and First-Order LogicWhich of the following predicate logic formulae/formula is/are CORRECT representation(s) of the statement: “Everyone has exactly one mother”? The meanings of the predica…
49. Q49 · MSQ · 2 marks · Sets, Relations, Lattices and GroupsA = {0, 1, 2, 3, } is the set of non-negative integers. Let F be the set of functions from A to itself. For any two functions, f1, f2 ∈ F, we define (f1 f2)(n) = f1(n) +…
50. Q50 · MSQ · 2 marks · Regular Expressions and Finite AutomataConsider the following deterministic finite automaton (DFA) defined over the alphabet, = {a, b}. Identify which of the following language(s) is/are accepted by the given…
51. Q51 · NAT · 2 marks · File SystemsA disk of size 512M bytes is divided into blocks of 64K bytes. A file is stored in the disk using linked allocation. In linked allocation, each data block reserves 4 byt…
52. Q52 · NAT · 2 marks · Local OptimisationRefer to the given 3-address code sequence. This code sequence is split into basic blocks. The number of basic blocks is … (Answer in integer) 1001: i = 1 1002: j = 1 10…
53. Q53 · NAT · 2 marks · Cache Memory and HierarchyA computer has a memory hierarchy consisting of two-level cache (L1 and L2) and a main memory. If the processor needs to access data from memory, it first looks into L1…
54. Q54 · NAT · 2 marks · Memory Management and Virtual MemoryIn optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modification of the optimal page replace…
55. Q55 · NAT · 2 marks · SQLConsider the following database tables of a sports league. player(pid, pname, age) team(tid, tname, city, cid) coach(cid, cname) members(pid, tid) An instance of the tab…
56. Q56 · NAT · 2 marks · Probability and StatisticsSuppose a 5-bit message is transmitted from a source to a destination through a noisy channel. The probability that a bit of the message gets flipped during transmission…
57. Q57 · NAT · 2 marks · IPv4 FragmentationSuppose a message of size 15000 bytes is transmitted from a source to a destination using IPv4 protocol via two routers as shown in the figure. Each router has a defined…
58. Q58 · NAT · 2 marks · Probability and StatisticsConsider a probability distribution given by the density function P(x). P(x) = Cx2, & for 1 ≤ x ≤ 4 0, & for x 4 The probability that x lies between 2 and 3, i.e., P(2 ≤…
59. Q59 · NAT · 2 marks · Combinational and Sequential CircuitsConsider a finite state machine (FSM) with one input X and one output f, represented by the given state transition table. The minimum number of states required to realiz…
60. Q60 · NAT · 2 marks · Combinational and Sequential CircuitsConsider the given sequential circuit designed using D-Flip-flops. The circuit is initialized with some value (initial state). The number of distinct states the circuit…
61. Q61 · NAT · 2 marks · Recursion#include int foo(int S[],int size){ if(size == 0) return 0; if(size == 1) return 1; if(S[0] != S[1]) return 1+foo(S+1,size-1); return foo(S+1,size-1); } int main(){ int…
62. Q62 · NAT · 2 marks · Programming in CLet LIST be a datatype for an implementation of linked list defined as follows: typedef struct list { int data; struct list *next; } LIST; Suppose a program has created…
63. Q63 · NAT · 2 marks · Programming in CConsider the following C program: #include int gate (int n) { int d, t, newnum, turn; newnum = turn = 0; t=1; while (n>=t) t *= 10; t /=10; while (t>0) { d = n/t; n = n%…
64. Q64 · NAT · 2 marks · Graph Traversals, MSTs and Shortest PathsThe maximum value of x such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is … (answer in integer)
65. Q65 · NAT · 2 marks · Searching, Sorting and HashingIn a double hashing scheme, h1(k) = k mod 11 and h2(k) = 1 + (k mod 7) are the auxiliary hash functions. The size m of the hash table is 11. The hash function for the i-…

How many questions were in GATE CSE 2025 Set 1?

GATE CSE 2025 Set 1 had 65 questions for 100 marks: 30 MCQ, 13 MSQ and 22 NAT.

Which subject carried the most marks in GATE CSE 2025 Set 1?

General Aptitude carried the most marks (15 of 100). The top three were General Aptitude (15), Engineering Mathematics (15), Algorithms (9).

Where can I find the GATE CSE 2025 Set 1 answer key?

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

Is the GATE CSE 2025 Set 1 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 2025 Set 2 question paper
• GATE CSE 2024 Set 1 question paper
• GATE CSE 2026 Set 1 question paper
• All GATE CSE papers →
• GATE CSE General Aptitude PYQs
• GATE CSE Engineering Mathematics PYQs
• GATE CSE Algorithms PYQs