GATE CSE 2023 Question Paper with Solutions & Answer Key
All 65 questions of the GATE CSE 2023 paper (100 marks: 30 one-mark and 35 two-mark; 34 MCQ, 15 MSQ, 16 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
- 34 / 15 / 16
- Topics
- 46
GATE CSE 2023 paper analysis
Engineering Mathematics and General Aptitude together made up 33 of 100 marks, down 3 from GATE CSE 2022. 16 of 65 questions were NAT, the most since 2022. Verbal Aptitude was the heaviest single topic with 6 marks across 4 questions. Digital Logic moved the most against GATE CSE 2022: up 5 marks.
All GATE CSE 2023 questions
Each question opens its full verified solution.
- Q1 · MCQ · 1 mark · Verbal AptitudeWe reached the station late, and … missed the train.
- Q2 · MCQ · 1 mark · Verbal AptitudeKind : … : : Often : Frequently (By word meaning)
- Q3 · MCQ · 1 mark · Quantitative AptitudeA series of natural numbers F1, F2, F3, F4, F5, F6, F7, obeys Fn+1 = Fn + Fn-1 for all integers n ≥ 2 . If F6 = 37, and F7 = 60, then what is F1 ?
- Q4 · MCQ · 1 mark · Quantitative AptitudeA survey for a certain year found that 90% of pregnant women received medical care at least once before giving birth. Of these women, 60% received medical care from doct…
- Q5 · MCQ · 1 mark · Spatial AptitudeLooking at the surface of a smooth 3-dimensional object from the outside, which one of the following options is TRUE?
- Q6 · MCQ · 2 marks · Verbal AptitudeThe country of Zombieland is in distress since more than 75% of its working population is suffering from serious health issues. Studies conducted by competent health exp…
- Q7 · MCQ · 2 marks · Quantitative AptitudeConsider two functions of time (t) , f(t) = 0.01 t2 g(t) = 4 t where 0 0 , g(t) > f(t) . (ii) There exists a T , such that f(t) > g(t) for all t > T . Which one of the f…
- Q8 · MCQ · 2 marks · Verbal AptitudeWhich one of the following sentence sequences creates a coherent narrative? (i) Once on the terrace, on her way to her small room in the corner, she notices the man righ…
- Q9 · MCQ · 2 marks · Quantitative Aptitudef(x) and g(y) are functions of x and y, respectively, and f(x) = g(y) for all real values of x and y. Which one of the following options is *necessarily* TRUE for all x…
- Q10 · MCQ · 2 marks · Spatial AptitudeWhich one of the options best describes the transformation of the 2-dimensional figure P to Q, and then to R, as shown?
- Q11 · MCQ · 1 mark · Intermediate Code GenerationConsider the following statements regarding the front-end and back-end of a compiler. S1: The front-end includes phases that are independent of the target hardware. S2:…
- Q12 · MCQ · 1 mark · Binary HeapsWhich one of the following sequences when stored in an array at locations A[1], , A[10] forms a max-heap?
- Q13 · MCQ · 1 mark · Linear Structures, Trees and HeapsLet SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLLdel be another…
- Q14 · MCQ · 1 mark · Regular Expressions and Finite AutomataConsider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet {0, 1}, and has the set of states {s, p, q, r}, with s being the star…
- Q15 · MCQ · 1 mark · Recurrence RelationsThe Lucas sequence Ln is defined by the recurrence relation: Ln = Ln-1 + Ln-2, for n ≥ 3, with L1 = 1 and L2 = 3. Which one of the options given is TRUE?
- Q16 · MCQ · 1 mark · Relational Model and SQLWhich one of the options given below refers to the degree (or arity) of a relation in relational database systems?
- Q17 · MCQ · 1 mark · Data Link LayerSuppose two hosts are connected by a point-to-point link and they are configured to use Stop-and-Wait protocol for reliable data transfer. Identify in which one of the f…
- Q18 · MCQ · 1 mark · Linear AlgebraLet A = 1 & 2 & 3 & 4 4 & 1 & 2 & 3 3 & 4 & 1 & 2 2 & 3 & 4 & 1 and B = 3 & 4 & 1 & 2 4 & 1 & 2 & 3 1 & 2 & 3 & 4 2 & 3 & 4 & 1 . Let det(A) and det(B) denote the determ…
- Q19 · MCQ · 1 mark · Lexical AnalysisConsider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions: letter &→ [A-Za-z] digit &→ [0-9…
- Q20 · MCQ · 1 mark · Searching, Sorting and HashingAn algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let k be the…
- Q21 · MCQ · 1 mark · Combinational and Sequential CircuitsThe output of a 2-input multiplexer is connected back to one of its inputs as shown in the figure. Match the functional equivalence of this circuit to one of the followi…
- Q22 · MSQ · 1 mark · Processes, Threads and IPCWhich one or more of the following need to be saved on a context switch from one thread (T1) of a process to another thread (T2) of the same process?
- Q23 · MSQ · 1 mark · System CallsWhich one or more of the following options guarantee that a computer system will transition from user mode to kernel mode?
- Q24 · MSQ · 1 mark · Turing Machines and UndecidabilityWhich of the following statements is/are CORRECT?
- Q25 · MSQ · 1 mark · Distance Vector and Link-State RoutingWhich of the following statements is/are INCORRECT about the OSPF (Open Shortest Path First) routing protocol used in the Internet?
- Q26 · MSQ · 1 mark · Propositional and First-Order LogicGeetha has a conjecture about integers, which is of the form ∀ x (P(x) ∃ y Q(x,y) ), where P is a statement about integers, and Q is a statement about pairs of integers.…
- Q27 · MSQ · 1 mark · CPU and I/O SchedulingWhich one or more of the following CPU scheduling algorithms can potentially cause starvation?
- Q28 · MSQ · 1 mark · CalculusLet f(x) = x3 + 15x2 - 33x - 36 be a real-valued function. Which of the following statements is/are TRUE?
- Q29 · MSQ · 1 mark · Asymptotic AnalysisLet f and g be functions of natural numbers given by f(n) = n and g(n) = n2. Which of the following statements is/are TRUE?
- Q30 · NAT · 1 mark · Linear AlgebraLet A be the adjacency matrix of the graph with vertices {1, 2, 3, 4, 5}. Let 1, 2, 3, 4, and 5 be the five eigenvalues of A. Note that these eigenvalues need not be dis…
- Q31 · NAT · 1 mark · CalculusThe value of the definite integral -33 -22 -11 (4x2y - z3) dz dy dx is … (Rounded off to the nearest integer)
- Q32 · NAT · 1 mark · Number Representation and ArithmeticA particular number is written as 132 in radix-4 representation. The same number in radix-5 representation is …
- Q33 · NAT · 1 mark · Instruction PipeliningConsider a 3-stage pipelined processor having a delay of 10 ns (nanoseconds), 20 ns, and 14 ns, for the first, second, and the third stages, respectively. Assume that th…
- Q34 · NAT · 1 mark · I/O Interface, Interrupts and DMAA keyboard connected to a computer is used at a rate of 1 keystroke per second. The computer system polls the keyboard every 10 ms (milli seconds) to check for a keystro…
- Q35 · NAT · 1 mark · Programming in CThe integer value printed by the ANSI-C program given below is … #include int funcp(){ static int x = 1; x++; return x; } int main(){ int x,y; x = funcp(); y = funcp()+x…
- Q36 · MCQ · 2 marks · Runtime EnvironmentsConsider the following program: int main() { f1(); f2(2); f3(); return(0); } int f1() { return(1); } int f2(int X) { f3(); if (X==1) return f1(); else return (X*f2(X-1))…
- Q37 · MCQ · 2 marks · Data Flow AnalysesConsider the control flow graph shown. Which one of the following choices correctly lists the set of live variables at the exit point of each basic block?
- Q38 · MCQ · 2 marks · Concurrency and SynchronizationConsider the two functions incr and decr shown below. incr(){ wait(s); X = X+1; signal(s); } decr(){ wait(s); X = X-1; signal(s); } There are 5 threads each invoking inc…
- Q39 · MCQ · 2 marks · Context-Free Grammars and PDAsConsider the context-free grammar G below S &→ aSb X X &→ aX Xb a b , where S and X are non-terminals, and a and b are terminal symbols. The starting non-terminal is S.…
- Q40 · MCQ · 2 marks · Context-Free Grammars and PDAsConsider the pushdown automaton (PDA) P below, which runs on the input alphabet {a, b}, has stack alphabet { , A}, and has three states {s, p, q}, with s being the start…
- Q41 · MCQ · 2 marks · Instruction Set and Addressing ModesConsider the given C-code and its corresponding assembly code, with a few operands U1–U4 being unknown. Some useful information as well as the semantics of each unique a…
- Q42 · MCQ · 2 marks · Cache Memory and HierarchyA 4 kilobyte (KB) byte-addressable memory is realized using four 1 KB memory blocks. Two input address lines (IA4 and IA3) are connected to the chip select (CS) port of…
- Q43 · MCQ · 2 marks · Combinational and Sequential CircuitsConsider a sequential digital circuit consisting of T flip-flops and D flip-flops as shown in the figure. CLKIN is the clock input to the circuit. At the beginning, Q1,…
- Q44 · MCQ · 2 marks · Combinational and Sequential CircuitsA Boolean digital circuit is composed using two 4-input multiplexers (M1 and M2) and one 2-input multiplexer (M3) as shown in the figure. X0–X7 are the inputs of the mul…
- Q45 · MCQ · 2 marks · Number Representation and ArithmeticConsider the IEEE-754 single precision floating point numbers P = 0xC1800000 and Q = 0x3F5C2EF4. Which one of the following corresponds to the product of these numbers (…
- Q46 · MCQ · 2 marks · Binary HeapsLet A be a priority queue for maintaining a set of elements. Suppose A is implemented using a max-heap data structure. The operation EXTRACT-MAX(A) extracts and deletes…
- Q47 · MCQ · 2 marks · RecursionConsider the C function foo and the binary tree shown. typedef struct node { int val; struct node *left, *right; } node; int foo(node *p) { int retval; if (p == NULL) re…
- Q48 · MCQ · 2 marks · CombinatoricsLet U = {1, 2, , n}, where n is a large positive integer greater than 1000. Let k be a positive integer less than n. Let A, B be subsets of U with |A| = |B| = k and A ∩…
- Q49 · MSQ · 2 marks · Discrete MathematicsLet f : A → B be an onto (or surjective) function, where A and B are nonempty sets. Define an equivalence relation on the set A as a1 a2 if f(a1) = f(a2) , where a1, a2…
- Q50 · MSQ · 2 marks · TCP Flow and Congestion ControlSuppose you are asked to design a new reliable byte-stream transport protocol like TCP. This protocol, named myTCP, runs over a 100 Mbps network with Round Trip Time of…
- Q51 · MSQ · 2 marks · Sets, Relations, Lattices and GroupsLet X be a set and 2X denote the powerset of X. Define a binary operation on 2X as follows: A B = (A - B) ∪ (B - A) . Let H = (2X, ). Which of the following statements a…
- Q52 · MSQ · 2 marks · DNS and HTTPSuppose in a web browser, you click on the www.gate-2023.in URL. The browser cache is empty. The IP address for this URL is not cached in your local host, so a DNS looku…
- Q53 · MSQ · 2 marks · Probability and StatisticsConsider a random experiment where two fair coins are tossed. Let A be the event that denotes HEAD on both the throws, B be the event that denotes HEAD on the first thro…
- Q54 · MSQ · 2 marks · Asymptotic AnalysisConsider functions Function\1 and Function\2 expressed in pseudocode as follows: Function1 while n > 1 do for i = 1 to n do x = x + 1; end for n = ⌊n/2⌋; end while Funct…
- Q55 · MSQ · 2 marks · Graph TheoryLet G be a simple, finite, undirected graph with vertex set {v1, , vn}. Let (G) denote the maximum degree of G and let N = {1, 2, } denote the set of all possible colors…
- Q56 · NAT · 2 marks · Graph TraversalsLet U = {1, 2, 3}. Let 2U denote the powerset of U. Consider an undirected graph G whose vertex set is 2U. For any A, B ∈ 2U, (A, B) is an edge in G if and only if (i) A…
- Q57 · NAT · 2 marks · Memory Management and Virtual MemoryConsider the following two-dimensional array D in the C programming language, which is stored in row-major order: int D[128][128]; Demand paging is used for allocating m…
- Q58 · NAT · 2 marks · Memory Management and Virtual MemoryConsider a computer system with 57-bit virtual addressing using multi-level tree-structured page tables with L levels for virtual to physical address translation. The pa…
- Q59 · NAT · 2 marks · Linear Structures, Trees and HeapsConsider a sequence a of elements a0 = 1, a1 = 5, a2 = 7, a3 = 8, a4 = 9, and a5 = 2. The following operations are performed on a stack S and a queue Q, both of which ar…
- Q60 · NAT · 2 marks · Syntax-Directed TranslationConsider the syntax directed translation given by the following grammar and semantic rules. Here N, I, F and B are non-terminals. N is the starting non-terminal, and \#,…
- Q61 · NAT · 2 marks · SQLConsider the following table named Student in a relational database. The primary key of this table is rollNum . The SQL query below is executed on this database. SELECT…
- Q62 · NAT · 2 marks · File Organization and IndexingConsider a database of fixed-length records, stored as an ordered file. The database has 25,000 records, with each record being 100 bytes, of which the primary key occup…
- Q63 · NAT · 2 marks · Regular Expressions and Finite AutomataConsider the language L over the alphabet {0, 1}, given below: L = {w ∈ {0, 1}* w does not contain three or more consecutive 1's}. The minimum number of states in a Dete…
- Q64 · NAT · 2 marks · Cache Memory and HierarchyAn 8-way set associative cache of size 64 KB (1 KB = 1024 bytes) is used in a system with 32-bit address. The address is sub-divided into TAG, INDEX, and BLOCK OFFSET. T…
- Q65 · NAT · 2 marks · CIDR NotationThe forwarding table of a router is shown below. A packet addressed to a destination address 200.150.68.118 arrives at the router. It will be forwarded to the interface…
GATE CSE 2023 answer key
Official answers. Open a question for the full solution.
| Q | Type | Marks | Answer | Topic |
|---|---|---|---|---|
| Q1 | MCQ | 1 | B | Verbal Aptitude |
| Q2 | MCQ | 1 | — | Verbal Aptitude |
| Q3 | MCQ | 1 | A | Quantitative Aptitude |
| Q4 | MCQ | 1 | A | Quantitative Aptitude |
| Q5 | MCQ | 1 | C | Spatial Aptitude |
| Q6 | MCQ | 2 | D | Verbal Aptitude |
| Q7 | MCQ | 2 | C | Quantitative Aptitude |
| Q8 | MCQ | 2 | D | Verbal Aptitude |
| Q9 | MCQ | 2 | B | Quantitative Aptitude |
| Q10 | MCQ | 2 | A | Spatial Aptitude |
| Q11 | MCQ | 1 | B | Intermediate Code Generation |
| Q12 | MCQ | 1 | B | Binary Heaps |
| Q13 | MCQ | 1 | D | Linear Structures, Trees and Heaps |
| Q14 | MCQ | 1 | C | Regular Expressions and Finite Automata |
| Q15 | MCQ | 1 | A | Recurrence Relations |
| Q16 | MCQ | 1 | A | Relational Model and SQL |
| Q17 | MCQ | 1 | B | Data Link Layer |
| Q18 | MCQ | 1 | B | Linear Algebra |
| Q19 | MCQ | 1 | C | Lexical Analysis |
| Q20 | MCQ | 1 | C | Searching, Sorting and Hashing |
| Q21 | MCQ | 1 | B | Combinational and Sequential Circuits |
| Q22 | MSQ | 1 | B, C, D | Processes, Threads and IPC |
| Q23 | MSQ | 1 | C, D | System Calls |
| Q24 | MSQ | 1 | A, C, D | Turing Machines and Undecidability |
| Q25 | MSQ | 1 | A, C | Distance Vector and Link-State Routing |
| Q26 | MSQ | 1 | B, C | Propositional and First-Order Logic |
| Q27 | MSQ | 1 | A, C, D | CPU and I/O Scheduling |
| Q28 | MSQ | 1 | B, D | Calculus |
| Q29 | MSQ | 1 | A, C | Asymptotic Analysis |
| Q30 | NAT | 1 | 2 | Linear Algebra |
| Q31 | NAT | 1 | 0 | Calculus |
| Q32 | NAT | 1 | 110 | Number Representation and Arithmetic |
| Q33 | NAT | 1 | 2040 | Instruction Pipelining |
| Q34 | NAT | 1 | 10.2 | I/O Interface, Interrupts and DMA |
| Q35 | NAT | 1 | 7 | Programming in C |
| Q36 | MCQ | 2 | A | Runtime Environments |
| Q37 | MCQ | 2 | D | Data Flow Analyses |
| Q38 | MCQ | 2 | C | Concurrency and Synchronization |
| Q39 | MCQ | 2 | B | Context-Free Grammars and PDAs |
| Q40 | MCQ | 2 | A | Context-Free Grammars and PDAs |
| Q41 | MCQ | 2 | B | Instruction Set and Addressing Modes |
| Q42 | MCQ | 2 | C | Cache Memory and Hierarchy |
| Q43 | MCQ | 2 | A | Combinational and Sequential Circuits |
| Q44 | MCQ | 2 | C | Combinational and Sequential Circuits |
| Q45 | MCQ | 2 | C | Number Representation and Arithmetic |
| Q46 | MCQ | 2 | B | Binary Heaps |
| Q47 | MCQ | 2 | C | Recursion |
| Q48 | MCQ | 2 | D | Combinatorics |
| Q49 | MSQ | 2 | B, C, D | Discrete Mathematics |
| Q50 | MSQ | 2 | B, C, D | TCP Flow and Congestion Control |
| Q51 | MSQ | 2 | A, D | Sets, Relations, Lattices and Groups |
| Q52 | MSQ | 2 | C, D | DNS and HTTP |
| Q53 | MSQ | 2 | C, D | Probability and Statistics |
| Q54 | MSQ | 2 | A, D | Asymptotic Analysis |
| Q55 | MSQ | 2 | A, B | Graph Theory |
| Q56 | NAT | 2 | 5040 | Graph Traversals |
| Q57 | NAT | 2 | 4096 | Memory Management and Virtual Memory |
| Q58 | NAT | 2 | 5 | Memory Management and Virtual Memory |
| Q59 | NAT | 2 | 8 | Linear Structures, Trees and Heaps |
| Q60 | NAT | 2 | 2.375 | Syntax-Directed Translation |
| Q61 | NAT | 2 | 2 | SQL |
| Q62 | NAT | 2 | 6 | File Organization and Indexing |
| Q63 | NAT | 2 | 4 | Regular Expressions and Finite Automata |
| Q64 | NAT | 2 | 19 | Cache Memory and Hierarchy |
| Q65 | NAT | 2 | 3 | CIDR Notation |
Subject-wise weightage
Where the marks came from in GATE CSE 2023, against GATE CSE 2022 and the average paper.
| Subject | Qs | Marks | Share | vs previous year | Avg marks / paper |
|---|---|---|---|---|---|
| GATE CSE Engineering Mathematics PYQs | 12 | 18 | 18% | -3 | 14.8 |
| GATE CSE General Aptitude PYQs | 10 | 15 | 15% | 0 | 7.4 |
| GATE CSE Programming and Data Structures PYQs | 6 | 9 | 9% | 0 | 9.5 |
| GATE CSE Operating Systems PYQs | 6 | 9 | 9% | -1 | 7.4 |
| GATE CSE Compiler Design PYQs | 5 | 8 | 8% | +4 | 5.2 |
| GATE CSE Theory of Computation PYQs | 5 | 8 | 8% | 0 | 6.9 |
| GATE CSE Computer Networks PYQs | 5 | 8 | 8% | -2 | 7.6 |
| GATE CSE Digital Logic PYQs | 5 | 8 | 8% | +5 | 5.5 |
| GATE CSE Computer Organization and Architecture PYQs | 5 | 8 | 8% | -1 | 6.8 |
| GATE CSE Databases PYQs | 3 | 5 | 5% | -2 | 6.8 |
| GATE CSE Algorithms PYQs | 3 | 4 | 4% | 0 | 7.2 |
GATE CSE 2023 FAQ
- How many questions were in GATE CSE 2023?
- GATE CSE 2023 had 65 questions for 100 marks: 34 MCQ, 15 MSQ and 16 NAT.
- Which subject carried the most marks in GATE CSE 2023?
- Engineering Mathematics carried the most marks (18 of 100). The top three were Engineering Mathematics (18), General Aptitude (15), Programming and Data Structures (9).
- Where can I find the GATE CSE 2023 answer key?
- The answer key table on this page lists the answer to every question of GATE CSE 2023. Open any question for its full verified solution.
- Is the GATE CSE 2023 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.