GATE CS 2024 (Forenoon)

65 questions · 100 marks · 180 minutes

Take this paper as a timed test
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.

GENERAL APTITUDE (GA)

  1. Q1If ' ' denotes increasing order of intensity, then the meaning of the words [dry arid parched] is analogous to [diet fast ]. Which one of the given options is appropriate to fill…Analytical Aptitude · Analogy and Relationship Matching · MCQ · 1 mark
  2. Q2If two distinct non-zero real variables x and y are such that (x + y) is proportional to (x - y) then the value of x yAnalytical Aptitude · Numerical Relations & Arithmetic Logic · MCQ · 1 mark
  3. Q3Consider the following sample of numbers: 9, 18, 11, 14, 15, 17, 10, 69, 11, 13 The median of the sample isQuantitative Aptitude · Elementary Statistics and Probability · MCQ · 1 mark
  4. Q4The number of coins of ₹1, ₹5, and ₹10 denominations that a person has are in the ratio 5 : 3 : 13. Of the total amount, the percentage of money in ₹5 coins isQuantitative Aptitude · Numerical Computation (Percentages, Ratios) · MCQ · 1 mark
  5. Q5For positive non-zero real variables p and q , if (p 2 + q 2) = p + q + 2 3, then, the value of p 4 + q 4 p 2q 2Quantitative Aptitude · Mathematical Operations (Powers, Exponents, Logarithms) · MCQ · 1 mark
  6. Q6In the given text, the blanks are numbered (i) - (iv). Select the best match for all the blanks. Steve was advised to keep his head (i) before heading (ii) to bat; for, while he h…Verbal Aptitude · Basic Vocabulary (Words, Idioms, Phrases in Context) · MCQ · 2 marks
  7. Q7A rectangular paper sheet of dimensions 54 cm × 4 cm is taken. The two longer edges of the sheet are joined together to create a cylindrical tube. A cube whose surface area is equ…Quantitative Aptitude · Mensuration and Geometry · MCQ · 2 marks
  8. Q8The pie chart present the percentage contribution of different macronutrients to a typical 2,000 kcal diet of a person. The typical energy density (kcal/g) of these macoutrients i…Quantitative Aptitude · Data Interpretation (Bar Graphs, Pie Charts, Histograms) · MCQ · 2 marks
  9. Q9A rectangular paper of 20 cm × 8 cm is folded 3 times. Each fold is made along the line of symmetry, which is perpendicular to its long edge. The perimeter of the final folded she…Spatial Aptitude · Paper Folding and Cutting Diagnostics · MCQ · 2 marks
  10. Q10The least number of squares to be added in the figure to make AB a line of symmetry isSpatial Aptitude · Structural Morphing (Mirroring, Assembling, Grouping) · MCQ · 2 marks

MATHEMATICAL FOUNDATIONS

  1. Q11Let f : R R be a function such that f(x) = \ x, x 3\ , x R , where R is the set of all real numbers. The set of all points where f(x) is NOT differentiable isCalculus · Limits, Continuity, and Differentiability · MCQ · 1 mark
  2. Q12The product of all eigen values of the matrix bmatrix 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 bmatrix isLinear Algebra · Eigenvalues and Eigenvectors · MCQ · 1 mark
  3. Q14Consider a permutation sampled uniformly at random from the set of all permutations of \ 1, 2, 3, , n\ for some n 4 . Let X be the event that 1 occurs before 2 in the permutation,…Probability & Statistics · Random Variables & Sampling Rules · MCQ · 1 mark
  4. Q27Let A and B be two events in a probability space with P(A) = 0.3 , P(B) = 0.5 , and P(A B) = 0.1 . Which of the following statements is/are TRUE?Probability & Statistics · Conditional Probability & Bayes Theorem · MSQ · 1 mark
  5. Q32Let A and B be non-empty finite sets such that there exist one-to-one and onto functions (i) from A to B and (ii) from A A to A B . The number of possible values of A is .Discrete Mathematics · Sets, Relations, Functions, Partial Orders, Lattices · NAT · 1 mark
  6. Q34The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is .Discrete Mathematics · Graph Theory (Connectivity, Paths, Cycles, Trees) · NAT · 1 mark
  7. Q49Let A be any n m matrix, where m > n . Which of the following statements is/are TRUE about the system of linear equations Ax = 0 ?Linear Algebra · Matrices, Determinants, & Linear Equation Systems · MSQ · 2 marks
  8. Q51The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let G be any graph with n vertices and chromatic number k . Which of the…Discrete Mathematics · Advanced Graph Bounds (Matching, Coloring Theorems) · MSQ · 2 marks
  9. Q52Consider the operators and defined by a b = a + 2b , a b = ab , for positive integers. Which of the following statements is/are TRUE?Discrete Mathematics · Algebraic Structures (Monoids, Groups) · MSQ · 2 marks
  10. Q63A bag contains 10 red balls and 15 blue balls. Two balls are drawn randomly without replacement. Given that the first ball drawn is red, the probability (rounded off to 3 decimal…Probability & Statistics · Conditional Probability & Bayes Theorem · NAT · 2 marks

CORE CS

  1. Q13Consider a system that uses 5 bits for representing signed integers in 2's complement format. In this system, two integers A and B are represented as A = 01010 and B = 11010 . Whi…Digital Logic · Number Representations & Fixed/Floating Point Math · MCQ · 1 mark
  2. Q15Which one of the following statements is FALSE?Computer Organization and Architecture (COA) · I/O Interfaces (Interrupts & DMA Control Modes) · MCQ · 1 mark
  3. Q16A user starts browsing a webpage hosted at a remote server. The browser opens a single connection to fetch the entire webpage from the server. The webpage consists of a top-level…Computer Networks (CN) · Application Layer (DNS, SMTP, HTTP, FTP, Email) & Security · MCQ · 1 mark
  4. Q17Given an integer array of size N , we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass thro…Algorithms · Asymptotic Analysis (O, Omega, Theta Complexities) · MCQ · 1 mark
  5. Q18Consider the following C program: c include <stdio.h> int main( ) int a = 6; int b = 0; while (a < 10) a = a/12 + 1; a += b; printf("%d", a); return 0; Which one of the following…Programming in C · Data Types, Syntax, Control Structures, Loops · MCQ · 1 mark
  6. Q19Consider the following program: c include <stdio.h> void fx( ); int main( ) fx( ); return 0; void fx( ) char a; if ((a=getchar( )) != ' ') fx( ); if (a != ' ') putchar (a); Assume…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · MCQ · 1 mark
  7. Q20Let S be the specification: “Instructors teach courses. Students register for courses. Courses are allocated classrooms. Instructors guide students.” Which one of the following ER…Database Management Systems (DBMS) · ER-Model · MCQ · 1 mark
  8. Q21In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?Database Management Systems (DBMS) · File Organization & Indexing (e.g., B and B+ Trees) · MCQ · 1 mark
  9. Q22Which of the following statements about a relation R in first normal form (1NF) is/are TRUE?Database Management Systems (DBMS) · Normalization Schemes (1NF, 2NF, 3NF, BCNF Boundaries) · MSQ · 1 mark
  10. Q23Let L 1, L 2 be two regular languages and L 3 a language which is not regular. Which of the following statements is/are always TRUE?Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MSQ · 1 mark
  11. Q24Which of the following statements about threads is/are TRUE?Operating Systems (OS) · System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
  12. Q25Which of the following process state transitions is/are NOT possible?Operating Systems (OS) · System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
  13. Q26Which of the following is/are Bottom-Up Parser(s)?Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MSQ · 1 mark
  14. Q28Consider the circuit shown below where the gates may have propagation delays. Assume that all signal transitions occur instantaneously and that wires have no delays. Which of the…Digital Logic · Combinational Logic (Multiplexers, Decoders, Adders) · MSQ · 1 mark
  15. Q29TCP client P successfully establishes a connection to TCP server Q. Let N P denote the sequence number in the SYN sent from P to Q . Let N Q denote the acknowledgement number in t…Computer Networks (CN) · Transport Layer (Flow Control and Congestion Control, TCP, UDP, Sockets) · MSQ · 1 mark
  16. Q30Consider a 5-stage pipelined processor with Instruction Fetch (IF), Instruction Decode (ID), Execute (EX), Memory Access (MEM), and Register Writeback (WB) stages. Which of the fo…Computer Organization and Architecture (COA) · Instruction Pipelining, Performance, Hazard Management · MSQ · 1 mark
  17. Q31Which of the following fields is/are modified in the IP header of a packet going out of a network address translation (NAT) device from an internal network to an external network?Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · MSQ · 1 mark
  18. Q33Consider the operator precedence and associativity rules for the integer arithmetic operators given in the table below. The value of the expression 3 + 1 + 5 2 / 7 + 2 - 4 - 7 - 6…Programming in C · Data Types, Syntax, Control Structures, Loops · NAT · 1 mark
  19. Q35Consider the following two relations, R(A, B) and S(A, C) : The total number of tuples obtained by evaluating the following expression B < C (R R.A = S.A S) is .Database Management Systems (DBMS) · Relational Models, Relational Algebra, Tuple Calculus · NAT · 1 mark
  20. Q36Consider a network path P - Q - R between nodes P and R via router Q . Node P sends a file of size 10 6 bytes to R via this path by splitting the file into chunks of 10 3 bytes ea…Computer Networks (CN) · OSI & TCP/IP Protocol Layers · MCQ · 2 marks
  21. Q37Consider the following syntax-directed definition (SDD). Given “MMLK” as the input, which one of the following options is the CORRECT value computed by the SDD (in the attribute S…Compiler Design · Syntax-Directed Translation & Runtime Environments · MCQ · 2 marks
  22. Q38Consider the following grammar G , with S as the start symbol. The grammar G has three incomplete productions denoted by (1), (2), and (3). S daT (1) T aS bT (2) R (3) The set of…Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MCQ · 2 marks
  23. Q39Consider the following pseudo-code. L1: t1 = -1 L2: t2 = 0 L3: t3 = 0 L4: t4 = 4 t3 L5: t5 = 4 t2 L6: t6 = t5 M L7: t7 = t4 + t6 L8: t8 = a[t7] L9: if t8 <= goto L11 L10: t1 = t8…Compiler Design · Intermediate Code Generation & Local Code Optimization · MCQ · 2 marks
  24. Q40Consider the following two threads T1 and T2 that update two shared variables a and b . Assume that initially a = b = 1 . Though context switching between threads can happen at an…Operating Systems (OS) · Concurrency & Synchronization (Semaphores, Mutex, Monitors, Locks) · MCQ · 2 marks
  25. Q41An array [82, 101, 90, 11, 111, 75, 33, 131, 44, 93] is heapified. Which one of the following options represents the first three elements in the heapified array?Data Structures · Binary Search Trees (BSTs) & Binary Heaps · MCQ · 2 marks
  26. Q42Consider the following recurrence relation: T(n) = cases n T( n ) + n & for n 1 \\ 1 & for n = 1 cases Which one of the following options is CORRECT?Algorithms · Asymptotic Analysis (O, Omega, Theta Complexities) · MCQ · 2 marks
  27. Q43Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values…Data Structures · Binary Search Trees (BSTs) & Binary Heaps · MCQ · 2 marks
  28. Q44The symbol indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?Database Management Systems (DBMS) · Integrity Constraints & Functional Dependencies · MSQ · 2 marks
  29. Q45Let G be a directed graph and T a depth first search (DFS) spanning tree in G that is rooted at a vertex v . Suppose T is also a breadth first search (BFS) tree in G , rooted at v…Algorithms · Graph Traversals (BFS, DFS) & Single-Source Shortest Paths · MSQ · 2 marks
  30. Q46Consider the following read-write schedule S over three transactions T 1 , T 2 and T 3 , where the subscripts in the schedule indicate transaction IDs: S : r 1(z); \; w 1(z); \; r…Database Management Systems (DBMS) · Transactions, Concurrency Control, Conflict Serializability · MSQ · 2 marks
  31. Q47Consider a Boolean expression given by F(X, Y, Z) = (3, 5, 6, 7) Which of the following statements is/are CORRECT?Digital Logic · Boolean Algebra, Minimization, K-Maps · MSQ · 2 marks
  32. Q48Consider the following C function definition. c int f (int x, int y) for (int i = 0; i < y; i++ ) x = x + x + y; return x; Which of the following statements is/are TRUE about the…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · MSQ · 2 marks
  33. Q50Consider the 5-state DFA M accepting the language L(M) (0 + 1) shown below. For any string w (0 + 1) let n 0(w) be the number of 0's in w and n 1(w) be the number of 1's in w . Wh…Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · MSQ · 2 marks
  34. Q53Consider two set-associative cache memory architectures: WBC , which uses the write back policy, and WTC , which uses the write through policy. Both of them use the LRU (Least Rec…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · MSQ · 2 marks
  35. Q54Consider a 512 GB hard disk with 32 storage surfaces. There are 4096 sectors per track and each sector holds 1024 bytes of data. The number of cylinders in the hard disk is .Operating Systems (OS) · File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
  36. Q55The baseline execution time of a program on a 2 GHz single core machine is 100 nanoseconds (ns). The code corresponding to 90% of the execution time can be fully parallelized. The…Computer Organization and Architecture (COA) · Instruction Pipelining, Performance, Hazard Management · NAT · 2 marks
  37. Q56A given program has 25% load/store instructions. Suppose the ideal CPI (cycles per instruction) without any memory stalls is 2. The program exhibits 2% miss rate on instruction ca…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · NAT · 2 marks
  38. Q57Consider the following code snippet using the fork() and wait() system calls. Assume that the code compiles and runs correctly, and that the system calls run successfully without…Operating Systems (OS) · System Calls, Processes, Threads, InterProcess Communication · NAT · 2 marks
  39. Q58Consider the entries shown below in the forwarding table of an IP router. Each entry consists of an IP prefix and the corresponding next hop router for packets whose destination I…Computer Networks (CN) · Routing Protocols (Shortest Path, Flooding, Distance Vector, Link State Routing) · NAT · 2 marks
  40. Q59Let G = (V, , S, P) be a context-free grammar in Chomsky Normal Form with = \ a, b, c\ and V containing 10 variable symbols including the start symbol S . The string w = a 30 b 30…Theory of Computation (TOC) · Context-Free Grammars & Push-Down Automata · NAT · 2 marks
  41. Q60The number of edges present in the forest generated by the DFS traversal of an undirected graph G with 100 vertices is 40. The number of connected components in G is .Algorithms · Graph Traversals (BFS, DFS) & Single-Source Shortest Paths · NAT · 2 marks
  42. Q61Consider the following two regular expressions over the alphabet \ 0, 1\ : r = 0 + 1 s = 01 + 10 The total number of strings of length less than or equal to 5, which are neither i…Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · NAT · 2 marks
  43. Q62Consider a memory management system that uses a page size of 2 KB. Assume that both the physical and virtual addresses start from 0. Assume that the pages 0, 1, 2, and 3 are store…Operating Systems (OS) · Memory Management and Virtual Memory · NAT · 2 marks
  44. Q64Consider a digital logic circuit consisting of three 2-to-1 multiplexers M1, M2, and M3 as shown below. X1 and X2 are inputs of M1. X3 and X4 are inputs of M2. A , B , and C are s…Digital Logic · Combinational Logic (Multiplexers, Decoders, Adders) · NAT · 2 marks
  45. Q65Consider sending an IP datagram of size 1420 bytes (including 20 bytes of IP header) from a sender to a receiver over a path of two links with a router between them. The first lin…Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · NAT · 2 marks