GateAI

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.

  1. Q1 · MCQ · 1 mark · Verbal AptitudeWe reached the station late, and … missed the train.
  2. Q2 · MCQ · 1 mark · Verbal AptitudeKind : … : : Often : Frequently (By word meaning)
  3. 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 ?
  4. 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…
  5. 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?
  6. 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…
  7. 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…
  8. 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…
  9. 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…
  10. 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?
  11. 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:…
  12. 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?
  13. 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…
  14. 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…
  15. 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?
  16. 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?
  17. 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…
  18. 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…
  19. 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…
  20. 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…
  21. 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…
  22. 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?
  23. 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?
  24. Q24 · MSQ · 1 mark · Turing Machines and UndecidabilityWhich of the following statements is/are CORRECT?
  25. 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?
  26. 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.…
  27. Q27 · MSQ · 1 mark · CPU and I/O SchedulingWhich one or more of the following CPU scheduling algorithms can potentially cause starvation?
  28. Q28 · MSQ · 1 mark · CalculusLet f(x) = x3 + 15x2 - 33x - 36 be a real-valued function. Which of the following statements is/are TRUE?
  29. 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?
  30. 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…
  31. 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)
  32. 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 …
  33. 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…
  34. 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…
  35. 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…
  36. 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))…
  37. 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?
  38. 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…
  39. 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.…
  40. 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…
  41. 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…
  42. 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…
  43. 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,…
  44. 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…
  45. 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 (…
  46. 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…
  47. 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…
  48. 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 ∩…
  49. 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…
  50. 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…
  51. 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…
  52. 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…
  53. 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…
  54. 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…
  55. 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…
  56. 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…
  57. 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…
  58. 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…
  59. 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…
  60. 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 \#,…
  61. 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…
  62. 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…
  63. 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…
  64. 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…
  65. 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.

QTypeMarksAnswerTopic
Q1MCQ1BVerbal Aptitude
Q2MCQ1—Verbal Aptitude
Q3MCQ1AQuantitative Aptitude
Q4MCQ1AQuantitative Aptitude
Q5MCQ1CSpatial Aptitude
Q6MCQ2DVerbal Aptitude
Q7MCQ2CQuantitative Aptitude
Q8MCQ2DVerbal Aptitude
Q9MCQ2BQuantitative Aptitude
Q10MCQ2ASpatial Aptitude
Q11MCQ1BIntermediate Code Generation
Q12MCQ1BBinary Heaps
Q13MCQ1DLinear Structures, Trees and Heaps
Q14MCQ1CRegular Expressions and Finite Automata
Q15MCQ1ARecurrence Relations
Q16MCQ1ARelational Model and SQL
Q17MCQ1BData Link Layer
Q18MCQ1BLinear Algebra
Q19MCQ1CLexical Analysis
Q20MCQ1CSearching, Sorting and Hashing
Q21MCQ1BCombinational and Sequential Circuits
Q22MSQ1B, C, DProcesses, Threads and IPC
Q23MSQ1C, DSystem Calls
Q24MSQ1A, C, DTuring Machines and Undecidability
Q25MSQ1A, CDistance Vector and Link-State Routing
Q26MSQ1B, CPropositional and First-Order Logic
Q27MSQ1A, C, DCPU and I/O Scheduling
Q28MSQ1B, DCalculus
Q29MSQ1A, CAsymptotic Analysis
Q30NAT12Linear Algebra
Q31NAT10Calculus
Q32NAT1110Number Representation and Arithmetic
Q33NAT12040Instruction Pipelining
Q34NAT110.2I/O Interface, Interrupts and DMA
Q35NAT17Programming in C
Q36MCQ2ARuntime Environments
Q37MCQ2DData Flow Analyses
Q38MCQ2CConcurrency and Synchronization
Q39MCQ2BContext-Free Grammars and PDAs
Q40MCQ2AContext-Free Grammars and PDAs
Q41MCQ2BInstruction Set and Addressing Modes
Q42MCQ2CCache Memory and Hierarchy
Q43MCQ2ACombinational and Sequential Circuits
Q44MCQ2CCombinational and Sequential Circuits
Q45MCQ2CNumber Representation and Arithmetic
Q46MCQ2BBinary Heaps
Q47MCQ2CRecursion
Q48MCQ2DCombinatorics
Q49MSQ2B, C, DDiscrete Mathematics
Q50MSQ2B, C, DTCP Flow and Congestion Control
Q51MSQ2A, DSets, Relations, Lattices and Groups
Q52MSQ2C, DDNS and HTTP
Q53MSQ2C, DProbability and Statistics
Q54MSQ2A, DAsymptotic Analysis
Q55MSQ2A, BGraph Theory
Q56NAT25040Graph Traversals
Q57NAT24096Memory Management and Virtual Memory
Q58NAT25Memory Management and Virtual Memory
Q59NAT28Linear Structures, Trees and Heaps
Q60NAT22.375Syntax-Directed Translation
Q61NAT22SQL
Q62NAT26File Organization and Indexing
Q63NAT24Regular Expressions and Finite Automata
Q64NAT219Cache Memory and Hierarchy
Q65NAT23CIDR Notation

Subject-wise weightage

Where the marks came from in GATE CSE 2023, against GATE CSE 2022 and the average paper.

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.

Explore more GATE CSE papers