GATE CS 2022 (Forenoon)

65 questions · 100 marks · 180 minutes

Take this paper as a timed test
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.

GENERAL APTITUDE (GA)

  1. Q1The is too high for it to be considered .Verbal Aptitude · Basic Vocabulary (Words, Idioms, Phrases in Context) · MCQ · 1 mark
  2. Q2A function y(x) is defined in the interval [0, 1] on the x-axis as y(x) = cases 2 & if 0 x < 1 3 \\ 3 & if 1 3 x < 3 4 \\ 1 & if 3 4 x < 1 cases Which one of the following is the…Quantitative Aptitude · Graphical Representations (2D and 3D Plots, Maps, Tables) · MCQ · 1 mark
  3. Q3Let r be a root of the equation x 2 + 2x + 6 = 0. Then the value of the expression (r + 2)(r + 3)(r + 4)(r + 5) isQuantitative Aptitude · Mathematical Operations (Powers, Exponents, Logarithms) · MCQ · 1 mark
  4. Q4Given below are four statements: Statement 1: All students are inquisitive. Statement 2: Some students are inquisitive. Statement 3: No student is inquisitive. Statement 4: Some s…Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 1 mark
  5. Q5A 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 plates given…Analytical Aptitude · Operational Puzzles and Systemic Reasoning · MCQ · 1 mark
  6. Q6Some 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 is the wo…Verbal Aptitude · Reading Comprehension · MCQ · 2 marks
  7. Q7In a recently conducted national entrance test, boys constituted 65% of those who appeared for the test. Girls constituted the remaining candidates and they accounted for 60% of t…Quantitative Aptitude · Numerical Computation (Percentages, Ratios) · MCQ · 2 marks
  8. Q8A 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 time. If…Quantitative Aptitude · Elementary Statistics and Probability · MCQ · 2 marks
  9. Q9The 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 following state…Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 2 marks
  10. Q10A 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 poles, ma…Spatial Aptitude · Pattern Identification in 2D and 3D Spaces · MCQ · 2 marks

CORE CS

  1. Q11Which one of the following statements is TRUE for all positive functions f(n)?Algorithms · Asymptotic Analysis (O, Omega, Theta Complexities) · MCQ · 1 mark
  2. Q12Which one of the following regular expressions correctly represents the language of the finite automaton given below?Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · MCQ · 1 mark
  3. Q13Which one of the following statements is TRUE?Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MCQ · 1 mark
  4. Q14In a relational data model, which one of the following statements is TRUE?Database Management Systems (DBMS) · Normalization Schemes (1NF, 2NF, 3NF, BCNF Boundaries) · MCQ · 1 mark
  5. Q15Consider 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 following state…Data Structures · Linked Lists & Binary Trees · MCQ · 1 mark
  6. Q16Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h 1 and h 2. Further suppose our hashing scheme uses h 1 for the odd keys and h 2 for the ev…Algorithms · Searching, Sorting, Hashing Mechanisms · MCQ · 1 mark
  7. Q17Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput?Computer Organization and Architecture (COA) · I/O Interfaces (Interrupts & DMA Control Modes) · MCQ · 1 mark
  8. Q18Let 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 arithmetic overf…Digital Logic · Number Representations & Fixed/Floating Point Math · MCQ · 1 mark
  9. Q19Consider the following threads, T 1, T 2 and T 3 executing on a single processor, synchronized using three binary semaphore variables, S 1, S 2 and S 3, operated upon using standa…Operating Systems (OS) · Concurrency & Synchronization (Semaphores, Mutex, Monitors, Locks) · MCQ · 1 mark
  10. Q21What is printed by the following ANSI C program? c include<stdio.h> int main(int argc, char argv[ ]) int x = 1, z[2] = 10, 11 ; int p = NULL; p = &x; p = 10; p = &z[1]; (&z[0] + 1…Programming in C · Pointers, Multi-Dimensional Arrays, Structures · MCQ · 1 mark
  11. Q22Consider 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 the enterp…Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · MCQ · 1 mark
  12. Q23Which of the following statements is/are TRUE?Theory of Computation (TOC) · Turing Machines & Undecidability · MSQ · 1 mark
  13. Q24Let 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. Which of the…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · MSQ · 1 mark
  14. Q25Consider the following three relations in a relational database. Employee ( eId , Name), Brand ( bId , bName), Own( eId, bId ) Which of the following relational algebra expression…Database Management Systems (DBMS) · Relational Models, Relational Algebra, Tuple Calculus · MSQ · 1 mark
  15. Q26Which of the following statements is/are TRUE with respect to deadlocks?Operating Systems (OS) · Deadlock Prevention, Avoidance, Detection, Recovery · MSQ · 1 mark
  16. Q28Suppose 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 that the…Data Structures · Binary Search Trees (BSTs) & Binary Heaps · NAT · 1 mark
  17. Q29Consider the augmented grammar with +, , (, ), id as the set of terminals. S' S S S + R R R R P P P (S) id If I 0 is the set of two LR(0) items \ [S' S.], [S S. + R]\ , then goto(…Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · NAT · 1 mark
  18. Q31Consider 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 .Database Management Systems (DBMS) · Integrity Constraints & Functional Dependencies · NAT · 1 mark
  19. Q33A 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 optimizat…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · NAT · 1 mark
  20. Q35Consider 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 iterative query m…Computer Networks (CN) · Application Layer (DNS, SMTP, HTTP, FTP, Email) & Security · NAT · 1 mark
  21. Q38Which one of the following statements is FALSE?Operating Systems (OS) · Memory Management and Virtual Memory · MCQ · 2 marks
  22. Q39Let R i(z) and W i(z) denote read and write operations on a data element z by a transaction T i, respectively. Consider the schedule S with four transactions. S : R 4(x), R 2(x),…Database Management Systems (DBMS) · Transactions, Concurrency Control, Conflict Serializability · MCQ · 2 marks
  23. Q40Consider 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 from R. S is…Digital Logic · Combinational Logic (Multiplexers, Decoders, Adders) · MCQ · 2 marks
  24. Q41Consider three floating point numbers A, B and C stored in registers R A, R B and R C, respectively as per IEEE-754 single precision floating point format. The 32-bit content stor…Digital Logic · Number Representations & Fixed/Floating Point Math · MCQ · 2 marks
  25. Q42Consider 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 at time t…Operating Systems (OS) · CPU and I/O Scheduling · MCQ · 2 marks
  26. Q43What is printed by the following ANSI C program? c include<stdio.h> 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, 17, 1…Programming in C · Pointers, Multi-Dimensional Arrays, Structures · MCQ · 2 marks
  27. Q44What is printed by the following ANSI C program? c include <stdio.h> int main(int argc, char argv[ ]) char a = 'P'; char b = 'x'; char c = (a & b) + ' '; char d = (a b) - '-'; cha…Programming in C · Data Types, Syntax, Control Structures, Loops · MCQ · 2 marks
  28. Q46Which of the following is/are undecidable?Theory of Computation (TOC) · Turing Machines & Undecidability · MSQ · 2 marks
  29. Q47Consider the following languages: L 1 = \ a n wa n w \ a, b\ \ L 2 = \ wxw R w, x \ a, b\ , w , x > 0\ Note that w R is the reversal of the string w. Which of the following is/are…Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MSQ · 2 marks
  30. Q48Consider the following languages: L 1 = \ ww w \ a, b\ \ L 2 = \ a n b n c m m, n 0\ L 3 = \ a m b n c n m, n 0\ Which of the following statements is/are FALSE?Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MSQ · 2 marks
  31. Q49Consider 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 TRUE?Algorithms · Minimum Spanning Trees (Prim/Kruskal Algorithms) · MSQ · 2 marks
  32. Q54Consider 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 the execu…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · MSQ · 2 marks
  33. Q55Consider 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 the subnets…Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · MSQ · 2 marks
  34. Q56Consider the relational database with the following four schemas and their respective instances. Student(sNo, sName, dNo) Dept(dNo, dName) Course(cNo, cName, dNo) Register(sNo, cN…Database Management Systems (DBMS) · SQL Queries (DDL/DML, Joins, Aggregations) · NAT · 2 marks
  35. Q57Consider 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 have conver…Computer Networks (CN) · Routing Protocols (Shortest Path, Flooding, Distance Vector, Link State Routing) · NAT · 2 marks
  36. Q59Consider 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 10 8 m/s. The time taken (in…Computer Networks (CN) · Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging) · NAT · 2 marks
  37. Q60Consider 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 the sequenc…Computer Networks (CN) · Transport Layer (Flow Control and Congestion Control, TCP, UDP, Sockets) · NAT · 2 marks
  38. Q61A processor X 1 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 given pro…Computer Organization and Architecture (COA) · Instruction Pipelining, Performance, Hazard Management · NAT · 2 marks
  39. Q62Consider the queues Q 1 containing four elements and Q 2 containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue(Q,…Data Structures · Abstract Data Types (ADTs), Stacks, Queues · NAT · 2 marks
  40. Q63Consider 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. Now, consid…Operating Systems (OS) · File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
  41. Q64Consider 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, 6, 7, 7, 1…Operating Systems (OS) · Memory Management and Virtual Memory · NAT · 2 marks
  42. Q65Consider the following grammar along with translation rules. S S 1 \ T \ S.val = S 1.val T.val\ S T \ S.val = T.val\ T T 1 \% R \ T.val = T 1.val R.val\ T R \ T.val = R.val\ R id…Compiler Design · Syntax-Directed Translation & Runtime Environments · NAT · 2 marks

MATHEMATICAL FOUNDATIONS

  1. Q20Consider the following two statements with respect to the matrices A m n , B n m , C n n and D n n . Statement 1: tr(AB) = tr(BA) Statement 2: tr(CD) = tr(DC) where tr( ) represen…Linear Algebra · Matrices, Determinants, & Linear Equation Systems · MCQ · 1 mark
  2. Q27Which of the following statements is/are TRUE for a group G?Discrete Mathematics · Algebraic Structures (Monoids, Groups) · MSQ · 1 mark
  3. Q30Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is .Discrete Mathematics · Graph Theory (Connectivity, Paths, Cycles, Trees) · NAT · 1 mark
  4. Q32The number of arrangements of six identical balls in three identical bins is .Discrete Mathematics · Combinatorics (Counting Rules, Summation Formulas) · NAT · 1 mark
  5. Q34The value of the following limit is . x 0+ x 1 - e 2 xCalculus · Limits, Continuity, and Differentiability · NAT · 1 mark
  6. Q36Which one of the following is the closed form for the generating function of the sequence \ a n\ n 0 defined below? a n = cases n + 1, & n is odd \\ 1, & otherwise casesDiscrete Mathematics · Recurrence Relations and Generating Functions · MCQ · 2 marks
  7. Q37Consider 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 by the tra…Discrete Mathematics · Graph Theory (Connectivity, Paths, Cycles, Trees) · MCQ · 2 marks
  8. Q45Consider solving the following system of simultaneous equations using LU decomposition. x 1 + x 2 - 2x 3 = 4 x 1 + 3x 2 - x 3 = 7 2x 1 + x 2 - 5x 3 = 7 where L and U are denoted a…Linear Algebra · Matrix Factorization & LU Decomposition · MCQ · 2 marks
  9. Q50The following simple undirected graph is referred to as the Peterson graph. Which of the following statements is/are TRUE?Discrete Mathematics · Advanced Graph Bounds (Matching, Coloring Theorems) · MSQ · 2 marks
  10. Q51Consider the following recurrence: f(1) = 1; f(2n) = 2f(n) - 1, for n 1; f(2n + 1) = 2f(n) + 1, for n 1; Then, which of the following statements is/are TRUE?Discrete Mathematics · Recurrence Relations and Generating Functions · MSQ · 2 marks
  11. Q52Which of the properties hold for the adjacency matrix A of a simple undirected unweighted graph having n vertices?Discrete Mathematics · Graph Theory (Connectivity, Paths, Cycles, Trees) · MSQ · 2 marks
  12. Q53Which of the following is/are the eigen vector(s) for the matrix given below? pmatrix -9 & -6 & -2 & -4 \\ -8 & -6 & -3 & -1 \\ 20 & 15 & 8 & 5 \\ 32 & 21 & 7 & 12 pmatrixLinear Algebra · Eigenvalues and Eigenvectors · MSQ · 2 marks
  13. Q58Let 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] = ca…Discrete Mathematics · Graph Theory (Connectivity, Paths, Cycles, Trees) · NAT · 2 marks