GATE CSE 2022 Question Paper with Solutions & Answer Key
All 65 questions of the GATE CSE 2022 paper (100 marks: 30 one-mark and 35 two-mark; 32 MCQ, 15 MSQ, 18 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 / 15 / 18
- Topics
- 43
GATE CSE 2022 paper analysis
Engineering Mathematics and General Aptitude together made up 36 of 100 marks, up 19 from GATE CSE 2021 Set 1. 18 of 65 questions were NAT, the most since 2021. Cache Memory and Hierarchy was the heaviest single topic with 6 marks across 4 questions. General Aptitude moved the most against GATE CSE 2021 Set 1: up 15 marks.
All GATE CSE 2022 questions
Each question opens its full verified solution.
- Q1 · MCQ · 1 mark · Verbal AptitudeThe … is too high for it to be considered …
- Q2 · MCQ · 1 mark · Quantitative AptitudeA function y(x) is defined in the interval [0, 1] on the x-axis as y(x) = 2 & if 0 ≤ x < (1)/(3) [6pt] 3 & if (1)/(3) ≤ x < (3)/(4) [6pt] 1 & if (3)/(4) ≤ x ≤ 1 Which on…
- Q3 · MCQ · 1 mark · Quantitative AptitudeLet r be a root of the equation x2 + 2x + 6 = 0. Then the value of the expression (r + 2)(r + 3)(r + 4)(r + 5) is
- Q4 · MCQ · 1 mark · Analytical AptitudeGiven below are four statements. Statement 1: All students are inquisitive. Statement 2: Some students are inquisitive. Statement 3: No student is inquisitive. Statement…
- Q5 · MCQ · 1 mark · Spatial AptitudeA palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From the additional pl…
- Q6 · MCQ · 2 marks · Verbal AptitudeSome people believe that “what gets measured, improves”. Some others believe that “what gets measured, gets gamed”. One possible reason for the difference in the beliefs…
- Q7 · MCQ · 2 marks · Analytical AptitudeIn a recently conducted national entrance test, boys constituted 65% of those who appeared for the test. Girls constituted the remaining candidates and they accounted fo…
- Q8 · MCQ · 2 marks · Quantitative AptitudeA box contains five balls of same size and shape. Three of them are green coloured balls and two of them are orange coloured balls. Balls are drawn from the box one at a…
- Q9 · MCQ · 2 marks · Spatial AptitudeThe corners and mid-points of the sides of a triangle are named using the distinct letters P, Q, R, S, T and U, but not necessarily in the same order. Consider the follo…
- Q10 · MCQ · 2 marks · Spatial AptitudeA plot of land must be divided between four families. They want their individual plots to be similar in shape, not necessarily equal in area. The land has equally spaced…
- Q11 · MCQ · 1 mark · Asymptotic AnalysisWhich one of the following statements is TRUE for all positive functions f(n)?
- Q12 · MCQ · 1 mark · Regular Expressions and Finite AutomataWhich one of the following regular expressions correctly represents the language of the finite automaton given below?
- Q13 · MCQ · 1 mark · ParsingWhich one of the following statements is TRUE?
- Q14 · MCQ · 1 mark · Integrity Constraints and Normal FormsIn a relational data model, which one of the following statements is TRUE?
- Q15 · MCQ · 1 mark · Linear Structures, Trees and HeapsConsider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the follo…
- Q16 · MCQ · 1 mark · Searching, Sorting and HashingSuppose we are given n keys, m hash table slots, and two simple uniform hash functions h1 and h2. Further suppose our hashing scheme uses h1 for the odd keys and h2 for…
- Q17 · MCQ · 1 mark · I/O Interface, Interrupts and DMAWhich one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput?
- Q18 · MCQ · 1 mark · Number Representation and ArithmeticLet R1 and R2 be two 4-bit registers that store numbers in 2's complement form. For the operation R1+R2, which one of the following values of R1 and R2 gives an arithmet…
- Q19 · MCQ · 1 mark · Concurrency and SynchronizationConsider the following threads, T1, T2, and T3 executing on a single processor, synchronized using three binary semaphore variables, S1, S2, and S3, operated upon using…
- Q20 · MCQ · 1 mark · Linear AlgebraConsider the following two statements with respect to the matrices Am × n, Bn × m, Cn × n and Dn × n. Statement 1: tr(AB) = tr(BA) Statement 2: tr(CD) = tr(DC) where tr(…
- Q21 · MCQ · 1 mark · Programming in CWhat is printed by the following ANSI C program? #include int main(int argc, char *argv[]) { int x = 1, z[2] = {10, 11}; int *p = NULL; p = &x; *p = 10; p = &z[1]; *(&z[…
- Q22 · MCQ · 1 mark · IPv4, CIDR and NATConsider an enterprise network with two Ethernet segments, a web server and a firewall, connected via three routers as shown below. What is the number of subnets inside…
- Q23 · MSQ · 1 mark · Turing Machines and UndecidabilityWhich of the following statements is/are TRUE?
- Q24 · MSQ · 1 mark · Cache Memory and HierarchyLet WB and WT be two set associative cache organizations that use LRU algorithm for cache block replacement. WB is a write back cache and WT is a write through cache. Wh…
- Q25 · MSQ · 1 mark · Relational Model and SQLConsider the following three relations in a relational database. Employee( eId, Name), Brand( bId, bName), Own( eId, bId) Which of the following relational algebra expre…
- Q26 · MSQ · 1 mark · DeadlockWhich of the following statements is/are TRUE with respect to deadlocks?
- Q27 · MSQ · 1 mark · Sets, Relations, Lattices and GroupsWhich of the following statements is/are TRUE for a group G ?
- Q28 · NAT · 1 mark · Binary Search TreesSuppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming…
- Q29 · NAT · 1 mark · ParsingConsider the augmented grammar with {+, *, (, ), id} as the set of terminals. S' → S S → S + R R R → R * P P P → (S) id If I0 is the set of two LR(0) items {[S' → S.], […
- Q30 · NAT · 1 mark · Discrete MathematicsConsider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is …
- Q31 · NAT · 1 mark · Integrity Constraints and Normal FormsConsider a relation R(A, B, C, D, E) with the following three functional dependencies. AB → C; BC → D; C → E; The number of superkeys in the relation R is …
- Q32 · NAT · 1 mark · Discrete MathematicsThe number of arrangements of six identical balls in three identical bins is …
- Q33 · NAT · 1 mark · Cache Memory and HierarchyA cache memory that has a hit rate of 0.8 has an access latency 10 ns and miss penalty 100 ns. An optimization is done on the cache to reduce the miss rate. However, the…
- Q34 · NAT · 1 mark · CalculusThe value of the following limit is … limx → 0+ √(x)1 - e2√(x)
- Q35 · NAT · 1 mark · DNS and HTTPConsider the resolution of the domain name www.gate.org.in by a DNS resolver. Assume that no resource records are cached anywhere across the DNS servers and that iterati…
- Q36 · MCQ · 2 marks · CombinatoricsWhich one of the following is the closed form for the generating function of the sequence { an }n ≥ 0 defined below? an = n+1, & n is odd 1, & otherwise
- Q37 · MCQ · 2 marks · Graph TheoryConsider a simple undirected unweighted graph with at least three vertices. If A is the adjacency matrix of the graph, then the number of 3-cycles in the graph is given…
- Q38 · MCQ · 2 marks · Memory Management and Virtual MemoryWhich one of the following statements is FALSE?
- Q39 · MCQ · 2 marks · Transactions and Concurrency ControlLet Ri(z) and Wi(z) denote read and write operations on a data element z by a transaction Ti, respectively. Consider the schedule S with four transactions. S: R4(x)R2(x)…
- Q40 · MCQ · 2 marks · Cache Memory and HierarchyConsider a digital display system (DDS) shown in the figure that displays the contents of register X. A 16-bit code word is used to load a word in X, either from S or fr…
- Q41 · MCQ · 2 marks · Number Representation and ArithmeticConsider three floating point numbers A, B and C stored in registers RA, RB and RC, respectively as per IEEE-754 single precision floating point format. The 32-bit conte…
- Q42 · MCQ · 2 marks · CPU and I/O SchedulingConsider four processes P, Q, R, and S scheduled on a CPU as per round robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all…
- Q43 · MCQ · 2 marks · Programming in CWhat is printed by the following ANSI C program? #include int main(int argc, char *argv[]) { int a[3][3][3] = {{1, 2, 3, 4, 5, 6, 7, 8, 9}, {10, 11, 12, 13, 14, 15, 16,…
- Q44 · MCQ · 2 marks · Programming in CWhat is printed by the following ANSI C program? #include int main(int argc, char *argv[]){ char a = 'P'; char b = 'x'; char c = (a & b) + '*'; char d = (a | b) - '-'; c…
- Q45 · MCQ · 2 marks · Linear AlgebraConsider solving the following system of simultaneous equations using LU decomposition. x1 + x2 - 2x3 &= 4 x1 + 3x2 - x3 &= 7 2x1 + x2 - 5x3 &= 7 where L and U are denot…
- Q46 · MSQ · 2 marks · Turing Machines and UndecidabilityWhich of the following is/are undecidable?
- Q47 · MSQ · 2 marks · Regular and Context-Free LanguagesConsider the following languages: L1 = {an w an w ∈ {a,b}*} L2 = {w x wR w, x ∈ {a,b}*, |w|, |x| > 0} Note that wR is the reversal of the string w. Which of the followin…
- Q48 · MSQ · 2 marks · Context-Free Grammars and PDAsConsider the following languages: L1 = {ww w ∈ {a,b}*} L2 = {an bn cm m, n ≥ 0} L3 = {am bn cn m, n ≥ 0} Which of the following statements is/are FALSE?
- Q49 · MSQ · 2 marks · Graph Traversals, MSTs and Shortest PathsConsider a simple undirected weighted graph G, all of whose edge weights are distinct. Which of the following statements about the minimum spanning trees of G is/are TRU…
- Q50 · MSQ · 2 marks · Graph TheoryThe following simple undirected graph is referred to as the Peterson graph. Which of the following statements is/are TRUE?
- Q51 · MSQ · 2 marks · Recurrence RelationsConsider the following recurrence: f(1) = 1; f(2n) = 2 f(n) - 1, for n ≥ 1; f(2n+1) = 2 f(n) + 1, for n ≥ 1. Then, which of the following statements is/are TRUE?
- Q52 · MSQ · 2 marks · Graph TheoryWhich of the properties hold for the adjacency matrix A of a simple undirected unweighted graph having n vertices?
- Q53 · MSQ · 2 marks · Linear AlgebraWhich of the following is/are the eigenvector(s) for the matrix given below? -9 & -6 & -2 & -4 -8 & -6 & -3 & -1 20 & 15 & 8 & 5 32 & 21 & 7 & 12
- Q54 · MSQ · 2 marks · Cache Memory and HierarchyConsider a system with 2 KB direct mapped data cache with a block size of 64 bytes. The system has a physical address space of 64 KB and a word length of 16 bits. During…
- Q55 · MSQ · 2 marks · CIDR NotationConsider routing table of an organization’s router shown below: Which of the following prefixes in CIDR notation can be collectively used to correctly aggregate all of t…
- Q56 · NAT · 2 marks · SQLConsider the relational database with the following four schemas and their respective instances. Student( sNo, sName, dNo) Dept( dNo, dName) Course( cNo, cName, dNo) Reg…
- Q57 · NAT · 2 marks · Distance Vector and Link-State RoutingConsider a network with three routers P, Q, R shown in the figure below. All the links have cost of unity. The routers exchange distance vector routing information and h…
- Q58 · NAT · 2 marks · Discrete MathematicsLet G(V,E) be a directed graph, where V = {1,2,3,4,5} is the set of vertices and E is the set of directed edges, as defined by the following adjacency matrix A. A[i][j]…
- Q59 · NAT · 2 marks · Switching and Performance MetricsConsider a 100 Mbps link between an earth station (sender) and a satellite (receiver) at an altitude of 2100 km. The signal propagates at a speed of 3 × 108 m/s. The tim…
- Q60 · NAT · 2 marks · TCP Flow and Congestion ControlConsider the data transfer using TCP over a 1 Gbps link. Assuming that the maximum segment lifetime (MSL) is set to 60 seconds, the minimum number of bits required for t…
- Q61 · NAT · 2 marks · Instruction PipeliningA processor X1 operating at 2 GHz has a standard 5-stage RISC instruction pipeline having a base CPI (cycles per instruction) of one without any pipeline hazards. For a…
- Q62 · NAT · 2 marks · Programming and Data StructuresConsider the queues Q1 containing four elements and Q2 containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are En…
- Q63 · NAT · 2 marks · File SystemsConsider two files systems A and B, that use contiguous allocation and linked allocation, respectively. A file of size 100 blocks is already stored in A and also in B. N…
- Q64 · NAT · 2 marks · Memory Management and Virtual MemoryConsider a demand paging system with four page frames (initially empty) and LRU page replacement policy. For the following page reference string 7, 2, 7, 3, 2, 5, 3, 4,…
- Q65 · NAT · 2 marks · Syntax-Directed TranslationConsider the following grammar along with translation rules. ll S → S1 \# T & {S val = S1 val * T val} S → T & {S val = T val} T → T1 \% R & {T val = T1 val R val} T → R…
GATE CSE 2022 answer key
Official answers. Open a question for the full solution.
| Q | Type | Marks | Answer | Topic |
|---|---|---|---|---|
| Q1 | MCQ | 1 | D | Verbal Aptitude |
| Q2 | MCQ | 1 | C | Quantitative Aptitude |
| Q3 | MCQ | 1 | D | Quantitative Aptitude |
| Q4 | MCQ | 1 | A | Analytical Aptitude |
| Q5 | MCQ | 1 | B | Spatial Aptitude |
| Q6 | MCQ | 2 | B | Verbal Aptitude |
| Q7 | MCQ | 2 | D | Analytical Aptitude |
| Q8 | MCQ | 2 | D | Quantitative Aptitude |
| Q9 | MCQ | 2 | B | Spatial Aptitude |
| Q10 | MCQ | 2 | D | Spatial Aptitude |
| Q11 | MCQ | 1 | A | Asymptotic Analysis |
| Q12 | MCQ | 1 | D | Regular Expressions and Finite Automata |
| Q13 | MCQ | 1 | D | Parsing |
| Q14 | MCQ | 1 | A | Integrity Constraints and Normal Forms |
| Q15 | MCQ | 1 | A | Linear Structures, Trees and Heaps |
| Q16 | MCQ | 1 | B | Searching, Sorting and Hashing |
| Q17 | MCQ | 1 | A | I/O Interface, Interrupts and DMA |
| Q18 | MCQ | 1 | B | Number Representation and Arithmetic |
| Q19 | MCQ | 1 | C | Concurrency and Synchronization |
| Q20 | MCQ | 1 | C | Linear Algebra |
| Q21 | MCQ | 1 | D | Programming in C |
| Q22 | MCQ | 1 | C | IPv4, CIDR and NAT |
| Q23 | MSQ | 1 | B, C, D | Turing Machines and Undecidability |
| Q24 | MSQ | 1 | A, B, D | Cache Memory and Hierarchy |
| Q25 | MSQ | 1 | A, B | Relational Model and SQL |
| Q26 | MSQ | 1 | A, D | Deadlock |
| Q27 | MSQ | 1 | A, B, C | Sets, Relations, Lattices and Groups |
| Q28 | NAT | 1 | 509 | Binary Search Trees |
| Q29 | NAT | 1 | 5 | Parsing |
| Q30 | NAT | 1 | 36 | Discrete Mathematics |
| Q31 | NAT | 1 | 8 | Integrity Constraints and Normal Forms |
| Q32 | NAT | 1 | 7 | Discrete Mathematics |
| Q33 | NAT | 1 | 0.85 | Cache Memory and Hierarchy |
| Q34 | NAT | 1 | -0.5 | Calculus |
| Q35 | NAT | 1 | 4 | DNS and HTTP |
| Q36 | MCQ | 2 | A | Combinatorics |
| Q37 | MCQ | 2 | D | Graph Theory |
| Q38 | MCQ | 2 | C | Memory Management and Virtual Memory |
| Q39 | MCQ | 2 | A | Transactions and Concurrency Control |
| Q40 | MCQ | 2 | C | Cache Memory and Hierarchy |
| Q41 | MCQ | 2 | B | Number Representation and Arithmetic |
| Q42 | MCQ | 2 | D | CPU and I/O Scheduling |
| Q43 | MCQ | 2 | A | Programming in C |
| Q44 | MCQ | 2 | A | Programming in C |
| Q45 | MCQ | 2 | D | Linear Algebra |
| Q46 | MSQ | 2 | A, B, C | Turing Machines and Undecidability |
| Q47 | MSQ | 2 | A, B, C | Regular and Context-Free Languages |
| Q48 | MSQ | 2 | B, C, D | Context-Free Grammars and PDAs |
| Q49 | MSQ | 2 | A, B, C | Graph Traversals, MSTs and Shortest Paths |
| Q50 | MSQ | 2 | A, B, C | Graph Theory |
| Q51 | MSQ | 2 | A, B, C | Recurrence Relations |
| Q52 | MSQ | 2 | A | Graph Theory |
| Q53 | MSQ | 2 | A, C, D | Linear Algebra |
| Q54 | MSQ | 2 | A, B, D | Cache Memory and Hierarchy |
| Q55 | MSQ | 2 | B, D | CIDR Notation |
| Q56 | NAT | 2 | 2 | SQL |
| Q57 | NAT | 2 | 0.5 | Distance Vector and Link-State Routing |
| Q58 | NAT | 2 | 24 | Discrete Mathematics |
| Q59 | NAT | 2 | 7.08 | Switching and Performance Metrics |
| Q60 | NAT | 2 | 33 | TCP Flow and Congestion Control |
| Q61 | NAT | 2 | 1.43 | Instruction Pipelining |
| Q62 | NAT | 2 | 0 | Programming and Data Structures |
| Q63 | NAT | 2 | 153 | File Systems |
| Q64 | NAT | 2 | 0.6 | Memory Management and Virtual Memory |
| Q65 | NAT | 2 | 80 | Syntax-Directed Translation |
Subject-wise weightage
Where the marks came from in GATE CSE 2022, against GATE CSE 2021 Set 1 and the average paper.
| Subject | Qs | Marks | Share | vs previous year | Avg marks / paper |
|---|---|---|---|---|---|
| GATE CSE Engineering Mathematics PYQs | 13 | 21 | 21% | +4 | 14.8 |
| GATE CSE General Aptitude PYQs | 10 | 15 | 15% | +15 | 7.4 |
| GATE CSE Operating Systems PYQs | 6 | 10 | 10% | +4 | 7.4 |
| GATE CSE Computer Networks PYQs | 6 | 10 | 10% | +1 | 7.6 |
| GATE CSE Programming and Data Structures PYQs | 6 | 9 | 9% | +3 | 9.5 |
| GATE CSE Computer Organization and Architecture PYQs | 6 | 9 | 9% | +4 | 6.8 |
| GATE CSE Theory of Computation PYQs | 5 | 8 | 8% | 0 | 6.9 |
| GATE CSE Databases PYQs | 5 | 7 | 7% | -1 | 6.8 |
| GATE CSE Algorithms PYQs | 3 | 4 | 4% | -8 | 7.2 |
| GATE CSE Compiler Design PYQs | 3 | 4 | 4% | -4 | 5.2 |
| GATE CSE Digital Logic PYQs | 2 | 3 | 3% | -3 | 5.5 |
GATE CSE 2022 FAQ
- How many questions were in GATE CSE 2022?
- GATE CSE 2022 had 65 questions for 100 marks: 32 MCQ, 15 MSQ and 18 NAT.
- Which subject carried the most marks in GATE CSE 2022?
- Engineering Mathematics carried the most marks (21 of 100). The top three were Engineering Mathematics (21), General Aptitude (15), Operating Systems (10).
- Where can I find the GATE CSE 2022 answer key?
- The answer key table on this page lists the answer to every question of GATE CSE 2022. Open any question for its full verified solution.
- Is the GATE CSE 2022 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.