GATE CSE 2026 Set 2 Question Paper with Solutions & Answer Key
All 65 questions of the GATE CSE 2026 Set 2 paper (100 marks: 30 one-mark and 35 two-mark; 35 MCQ, 11 MSQ, 19 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
- 35 / 11 / 19
- Topics
- 45
GATE CSE 2026 Set 2 paper analysis
Engineering Mathematics and General Aptitude together made up 28 of 100 marks, up 1 from GATE CSE 2025 Set 2. 19 of 65 questions were NAT, the most since 2025. Verbal Aptitude was the heaviest single topic with 4 marks across 3 questions. Engineering Mathematics moved the most against GATE CSE 2025 Set 2: up 3 marks.
All GATE CSE 2026 Set 2 questions
Each question opens its full verified solution.
- Q1 · MCQ · 1 mark · Verbal AptitudeExpedite, Hasten, Hurry, … Fill the blank by choosing a word with a meaning similar to that of the words given above.
- Q2 · MCQ · 1 mark · Spatial AptitudeA black square PQRS has been cut into two parts. One part of it is shown in Panel I. Which one of the shapes in Panel II is the other part?
- Q3 · MCQ · 1 mark · Quantitative AptitudeA day can only be cloudy or sunny. The probability of a day being cloudy is 0.5, independent of the condition on other days. What is the probability that in any given fo…
- Q4 · MCQ · 1 mark · Quantitative AptitudeThe values of Stock A and Stock B on a particular day are Rs. 50 and Rs. 80, respectively. An investor invests Rs. 100 in Stock A and Rs. 80 in Stock B. He sells all the…
- Q5 · MCQ · 1 mark · Verbal Aptitude‘When it is raining, peacocks dance.’ Based only on this sentence, which one of the following options is necessarily true?
- Q6 · MCQ · 2 marks · Verbal AptitudeWater : P :: Food : Q Choose the P and Q combination from the options below to form a meaningful analogy.
- Q7 · MCQ · 2 marks · Spatial AptitudeTwo tiles are missing in Panel I. Which one of the options in Panel II is the appropriate choice for the missing tiles?
- Q8 · MCQ · 2 marks · Graph TheoryFigures (i) and (ii) represent intercity highway systems. The black dots represent cities and the line segments between them represent intercity highways. A salesperson…
- Q9 · MCQ · 2 marks · Analytical AptitudeThe figure in Panel I below is a grid of cells with four rows and four columns. The numbers on the top and on the left represent the number of cells that are to be shade…
- Q10 · MCQ · 2 marks · Quantitative AptitudeAn unbiased six-faced dice whose faces are marked with numbers 1, 2, 3, 4, 5, and 6 is rolled twice in succession and the number on the top face is recorded each time. T…
- Q11 · MCQ · 1 mark · Propositional and First-Order LogicFor two different persons x and y, the predicate M(x, y) denotes that x knows y. Consider the following statement. *There is a person who does not know anyone else, but…
- Q12 · MCQ · 1 mark · TreesThe set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal. Which one of the following is the correct…
- Q13 · MCQ · 1 mark · Turing Machines and UndecidabilityWhich one of the following statements is equivalent to the following assertion? Turing machine M decides the language L ⊆ {0,1}*
- Q14 · MCQ · 1 mark · Probability and StatisticsThe probability density function f(x) of a random variable X which takes real values is f(x) = 13√(2 ) (-(x2)/(18) ), x ∈ (-∞, +∞) Which one of the following statements…
- Q15 · MCQ · 1 mark · ER ModelIn the context of DBMS, consider the two sets T and S given below. Which one of the following is the correct match from T to S ?
- Q16 · MCQ · 1 mark · Boolean Algebra and MinimizationWhich one of the following options is not a property of Boolean Algebra? Note: + is OR operation, . is AND operation, and ' is NOT operation
- Q17 · MCQ · 1 mark · Programming in CIn C runtime environment, which one of the following is stored in heap?
- Q18 · MCQ · 1 mark · I/O Interface, Interrupts and DMAConsider the following two statements about interrupt handling mechanisms in a CPU. S1: In non-vectored interrupt mechanism, it usually takes more time to start the Inte…
- Q19 · MCQ · 1 mark · Programming in CConsider the following three ANSI-C programs, P1, P2, and P3. Which one of the following statements is true?
- Q20 · MCQ · 1 mark · Transactions and Concurrency ControlConsider concurrent execution of two transactions T1 and T2 in a DBMS, both of which access a data object A. For these two transactions to not conflict on A, which one o…
- Q21 · MCQ · 1 mark · Switching and Performance MetricsConsider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2 Mbps, 500 kbps, and…
- Q22 · MCQ · 1 mark · DNS and HTTPWhich one of the following protocols may need to broadcast some of its messages?
- Q23 · MCQ · 1 mark · CPU and I/O SchedulingWhich one of the following CPU scheduling algorithms cannot be preemptive?
- Q24 · MCQ · 1 mark · Asymptotic AnalysisConsider the following functions, where n is a positive integer. n1/3 , log(n) , log(n!) , 2log(n) Which one of the following options lists the functions in increasing o…
- Q25 · MSQ · 1 mark · Asymptotic AnalysisWhich of the following can be recurrence relation(s) corresponding to an algorithm with time complexity (n)?
- Q26 · MSQ · 1 mark · Discrete MathematicsLet R be a binary relation on the set {1, 2, , 10}, where (x, y) ∈ R if the product of x and y is square of an integer. Which of the following properties is/are satisfie…
- Q27 · MSQ · 1 mark · CalculusFor a real number a, let I(a) = -11 (3x2 - ax + 1) dx. Which of the following statements is/are true?
- Q28 · MSQ · 1 mark · Number Representation and ArithmeticIn a system, numbers are represented using 4-bit two's complement form. Consider four numbers N1 = 1011, N2 = 1101, N3 = 1010 and N4 = 1001 in the system. Which of the f…
- Q29 · MSQ · 1 mark · Context-Free Grammars and PDAsWhich of the following grammars is/are ambiguous?
- Q30 · NAT · 1 mark · Searching, Sorting and HashingThe keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function h(k) = k mod 9. The collisions are resolved by chaining. After all the…
- Q31 · NAT · 1 mark · Linear AlgebraConsider the system of linear equations given below. ax + y = b 16x + ay = 24 Suppose the values of a and b are chosen such that the system of linear equations produce m…
- Q32 · NAT · 1 mark · Searching, Sorting and HashingConsider an array A = [10, 7, 8, 19, 41, 35, 25, 31]. Suppose the merge sort algorithm is executed on array A to sort it in increasing order. The merge sort algorithm wi…
- Q33 · NAT · 1 mark · CIDR NotationIf an IP network uses a subnet mask of 255.255.240.0, the maximum number of IP addresses that can be assigned to network interfaces is … (answer in integer)
- Q34 · NAT · 1 mark · Number Representation and ArithmeticThe 32-bit IEEE 754 single precision representation of a number is 0xC2710000. The number in decimal representation is … (rounded off to two decimal places)
- Q35 · NAT · 1 mark · Lexical AnalysisA lexical analyzer uses the following token definitions • letter → [A - Z a - z] • digit → [0 - 9] • id → letter (letter digit)* • number → digit+ • ws → (blank tab newl…
- Q36 · MCQ · 2 marks · Graph TheoryConsider a complete graph Kn with n vertices (n > 4). Note that multiple spanning trees can be constructed over Kn. Each of these spanning trees is represented as a set…
- Q37 · MCQ · 2 marks · Shortest PathsLet G be a weighted directed acyclic graph with m edges and n vertices. Given G and a source vertex s in G, which one of the following options gives the worst case time…
- Q38 · MCQ · 2 marks · Asymptotic AnalysisConsider an array A of integers of size n. The indices of A run from 1 to n. An algorithm is to be designed to check whether A satisfies the condition given below. ∀ i,…
- Q39 · MCQ · 2 marks · Dynamic ProgrammingConsider a table T, where the elements T[i][j], 0 ≤ i, j ≤ n, represent the cost of the optimal solutions of different subproblems of a problem that is being solved usin…
- Q40 · MCQ · 2 marks · Boolean Algebra and MinimizationConsider the following 4-variable Boolean function F(A, B, C, D) = m(0, 1, 2, 3, 8, 9, 10, 11) Consider A as MSB, D as LSB. Which one of the following options represents…
- Q41 · MCQ · 2 marks · ParsingConsider the canonical LR(0) parsing of the grammar below using terminals {a, b, c} and non-terminals {A, B, C, S} with S as the start symbol. S → ACB A → aA C → cC B →…
- Q42 · MCQ · 2 marks · Integrity Constraints and Normal FormsIn the context of schema normalization in relational DBMS, consider a set F of functional dependencies. The set of all functional dependencies implied by F is called the…
- Q43 · MCQ · 2 marks · Data Link LayerConsider the transmission of data bits 110001011 over a link that uses Cyclic Redundancy Check (CRC) code for error detection. If the generator bit pattern is given to b…
- Q44 · MCQ · 2 marks · Instruction Set and Addressing ModesConsider a processor that has 16 general purpose registers and it uses 2-byte instruction format for all its instructions. Variable-sized opcodes are permitted. There ar…
- Q45 · MCQ · 2 marks · Data Flow AnalysesConsider the control flow graph given below. Which one of the following options is the set of live variables at the exit point of each basic block?
- Q46 · MCQ · 2 marks · File Organization and IndexingAn index in a DBMS is said to be dense if an index entry appears for every search-key value in the indexed file. Otherwise it is called a sparse index. Consider the foll…
- Q47 · MSQ · 2 marks · Regular Expressions and Finite AutomataConsider the following two finite automata D1 and D2. Which of the following statements is/are true?
- Q48 · MSQ · 2 marks · Context-Free Grammars and PDAsLet = {a, b, c, d} and let L = {ai bj ck d i, j, k, ≥ 0}. Which of the following constraints ensure(s) that the language L is context-free?
- Q49 · MSQ · 2 marks · Binary Search TreesConsider a binary search tree (BST) with n leaf nodes (n > 0). Given any node V, the key present in the node is denoted as Val(V). All the keys present in the given BST…
- Q50 · MSQ · 2 marks · Linear Structures, Trees and HeapsConsider a stack S and a queue Q. Both of them are initially empty and have the capacity to store ten elements each. The elements 1, 2, 3, 4, and 5 arrive one by one, in…
- Q51 · MSQ · 2 marks · Concurrency and SynchronizationConsider three processes P1, P2, and P3 running identical code, as shown in the pseudocode below. A and B are two binary semaphores initialized to 1 and 0, respectively.…
- Q52 · MSQ · 2 marks · Cache Memory and HierarchyConsider a system with a processor and a 4 KB direct mapped cache with block size of 16 bytes. The system has a 16 MB physical memory. Four words P, Q, R, and S are acce…
- Q53 · NAT · 2 marks · File SystemsTo keep track of free blocks in a file system, one of the two approaches is generally used – using bitmaps (bit vectors) or using linked lists. Consider that the linked…
- Q54 · NAT · 2 marks · Memory Management and Virtual MemoryA system has a Translation Lookaside Buffer (TLB) that has a reach of 1 MB. TLB reach is defined as the total amount of physical memory that can be accessed through the…
- Q55 · NAT · 2 marks · Memory Management and Virtual MemoryConsider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes 20 KB, 4 KB, 25 KB, 1…
- Q56 · NAT · 2 marks · Cache Memory and HierarchyConsider a system with 1 MB physical memory and a word length of 1 byte. The system uses a direct mapped cache, with block numbers starting from 0. The word with physica…
- Q57 · NAT · 2 marks · Instruction PipeliningA non-pipelined instruction execution unit that operates at 1.6 GHz clock takes an average of 5 clock cycles to complete the execution of an instruction. To improve the…
- Q58 · NAT · 2 marks · TCP Flow and Congestion ControlConsider a new TCP connection between a sender and a receiver. The receiver advertised window is constant at 48 KB, the maximum segment size (MSS) is 2 KB, and the slow…
- Q59 · NAT · 2 marks · Combinational and Sequential CircuitsConsider the digital circuit shown below with two input lines A and B, two select lines S0 and S1, and an output line Y. The blocks Q and M represent active high 2:4 dec…
- Q60 · NAT · 2 marks · Programming in CConsider the following ANSI-C program. #include int main(){ int *ptr, a, b, c; a=5; b=11; c=20; ptr=&a; *ptr=c; ptr=&c; a=*(&b); c=*ptr-a; printf("%d",c); return(0); } T…
- Q61 · NAT · 2 marks · RecursionConsider the following ANSI-C function. int func(int start, int end){ int length=end+1-start; if((length The maximum possible value that can be returned from this functi…
- Q62 · NAT · 2 marks · Linear AlgebraThe determinant of a 4 × 4 matrix A is 3. The value of the determinant of 2A is … (answer in integer)
- Q63 · NAT · 2 marks · Probability and StatisticsSuppose an unbiased coin is tossed 6 times. Each coin toss is independent of all previous coin tosses. Let E1 be the event that among the second, fourth, and sixth coin…
- Q64 · NAT · 2 marks · CalculusConsider a function f (0,1) → {0, 1} defined as follows. For a real number r ∈ (0,1) , f(r) = 1 if the second digit after the decimal point in r is one of the four digit…
- Q65 · NAT · 2 marks · Data Link LayerIt is necessary to design a link-layer protocol between two hosts that are directly connected over a lossless link of length 3000 kilometers. Assume that the link bandwi…
GATE CSE 2026 Set 2 answer key
Official answers. Open a question for the full solution.
| Q | Type | Marks | Answer | Topic |
|---|---|---|---|---|
| Q1 | MCQ | 1 | A | Verbal Aptitude |
| Q2 | MCQ | 1 | C | Spatial Aptitude |
| Q3 | MCQ | 1 | A | Quantitative Aptitude |
| Q4 | MCQ | 1 | A | Quantitative Aptitude |
| Q5 | MCQ | 1 | C | Verbal Aptitude |
| Q6 | MCQ | 2 | A | Verbal Aptitude |
| Q7 | MCQ | 2 | A | Spatial Aptitude |
| Q8 | MCQ | 2 | A | Graph Theory |
| Q9 | MCQ | 2 | B | Analytical Aptitude |
| Q10 | MCQ | 2 | C | Quantitative Aptitude |
| Q11 | MCQ | 1 | A | Propositional and First-Order Logic |
| Q12 | MCQ | 1 | A | Trees |
| Q13 | MCQ | 1 | D | Turing Machines and Undecidability |
| Q14 | MCQ | 1 | B | Probability and Statistics |
| Q15 | MCQ | 1 | C | ER Model |
| Q16 | MCQ | 1 | B | Boolean Algebra and Minimization |
| Q17 | MCQ | 1 | C | Programming in C |
| Q18 | MCQ | 1 | C | I/O Interface, Interrupts and DMA |
| Q19 | MCQ | 1 | A | Programming in C |
| Q20 | MCQ | 1 | A | Transactions and Concurrency Control |
| Q21 | MCQ | 1 | B | Switching and Performance Metrics |
| Q22 | MCQ | 1 | C | DNS and HTTP |
| Q23 | MCQ | 1 | B | CPU and I/O Scheduling |
| Q24 | MCQ | 1 | A | Asymptotic Analysis |
| Q25 | MSQ | 1 | A, B | Asymptotic Analysis |
| Q26 | MSQ | 1 | A, B, C | Discrete Mathematics |
| Q27 | MSQ | 1 | A, C | Calculus |
| Q28 | MSQ | 1 | B, D | Number Representation and Arithmetic |
| Q29 | MSQ | 1 | B, C | Context-Free Grammars and PDAs |
| Q30 | NAT | 1 | 3 | Searching, Sorting and Hashing |
| Q31 | NAT | 1 | 24 | Linear Algebra |
| Q32 | NAT | 1 | 3 | Searching, Sorting and Hashing |
| Q33 | NAT | 1 | 4094 | CIDR Notation |
| Q34 | NAT | 1 | -60.25 | Number Representation and Arithmetic |
| Q35 | NAT | 1 | 13 | Lexical Analysis |
| Q36 | MCQ | 2 | C | Graph Theory |
| Q37 | MCQ | 2 | A | Shortest Paths |
| Q38 | MCQ | 2 | A | Asymptotic Analysis |
| Q39 | MCQ | 2 | A | Dynamic Programming |
| Q40 | MCQ | 2 | B | Boolean Algebra and Minimization |
| Q41 | MCQ | 2 | D | Parsing |
| Q42 | MCQ | 2 | D | Integrity Constraints and Normal Forms |
| Q43 | MCQ | 2 | D | Data Link Layer |
| Q44 | MCQ | 2 | B | Instruction Set and Addressing Modes |
| Q45 | MCQ | 2 | A | Data Flow Analyses |
| Q46 | MCQ | 2 | A | File Organization and Indexing |
| Q47 | MSQ | 2 | C, D | Regular Expressions and Finite Automata |
| Q48 | MSQ | 2 | A, C, D | Context-Free Grammars and PDAs |
| Q49 | MSQ | 2 | A, C | Binary Search Trees |
| Q50 | MSQ | 2 | A, B | Linear Structures, Trees and Heaps |
| Q51 | MSQ | 2 | A, B, C | Concurrency and Synchronization |
| Q52 | MSQ | 2 | A, B | Cache Memory and Hierarchy |
| Q53 | NAT | 2 | 16417 | File Systems |
| Q54 | NAT | 2 | 1536 | Memory Management and Virtual Memory |
| Q55 | NAT | 2 | 3 | Memory Management and Virtual Memory |
| Q56 | NAT | 2 | 128 | Cache Memory and Hierarchy |
| Q57 | NAT | 2 | 2.34 | Instruction Pipelining |
| Q58 | NAT | 2 | 4 | TCP Flow and Congestion Control |
| Q59 | NAT | 2 | 6 | Combinational and Sequential Circuits |
| Q60 | NAT | 2 | 9 | Programming in C |
| Q61 | NAT | 2 | 1 | Recursion |
| Q62 | NAT | 2 | 48 | Linear Algebra |
| Q63 | NAT | 2 | 0.5 | Probability and Statistics |
| Q64 | NAT | 2 | 40 | Calculus |
| Q65 | NAT | 2 | 30 | Data Link Layer |
Subject-wise weightage
Where the marks came from in GATE CSE 2026 Set 2, against GATE CSE 2025 Set 2 and the average paper.
| Subject | Qs | Marks | Share | vs previous year | Avg marks / paper |
|---|---|---|---|---|---|
| GATE CSE Engineering Mathematics PYQs | 10 | 15 | 15% | +3 | 14.8 |
| GATE CSE General Aptitude PYQs | 9 | 13 | 13% | -2 | 7.4 |
| GATE CSE Programming and Data Structures PYQs | 7 | 11 | 11% | -1 | 9.5 |
| GATE CSE Algorithms PYQs | 7 | 10 | 10% | +2 | 7.2 |
| GATE CSE Computer Organization and Architecture PYQs | 5 | 9 | 9% | -1 | 6.8 |
| GATE CSE Computer Networks PYQs | 6 | 9 | 9% | +3 | 7.6 |
| GATE CSE Operating Systems PYQs | 5 | 9 | 9% | +2 | 7.4 |
| GATE CSE Digital Logic PYQs | 5 | 7 | 7% | -1 | 5.5 |
| GATE CSE Theory of Computation PYQs | 4 | 6 | 6% | -1 | 6.9 |
| GATE CSE Databases PYQs | 4 | 6 | 6% | -3 | 6.8 |
| GATE CSE Compiler Design PYQs | 3 | 5 | 5% | -1 | 5.2 |
GATE CSE 2026 Set 2 FAQ
- How many questions were in GATE CSE 2026 Set 2?
- GATE CSE 2026 Set 2 had 65 questions for 100 marks: 35 MCQ, 11 MSQ and 19 NAT.
- Which subject carried the most marks in GATE CSE 2026 Set 2?
- Engineering Mathematics carried the most marks (15 of 100). The top three were Engineering Mathematics (15), General Aptitude (13), Programming and Data Structures (11).
- Where can I find the GATE CSE 2026 Set 2 answer key?
- The answer key table on this page lists the answer to every question of GATE CSE 2026 Set 2. Open any question for its full verified solution.
- Is the GATE CSE 2026 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.