GATE CS 2025 (Afternoon)

65 questions · 100 marks · 180 minutes

Take this paper as a timed test
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.

GENERAL APTITUDE (GA)

  1. Q1Despite his initial hesitation, Rehman's to contribute to the success of the project never wavered. Select the most appropriate option to complete the above sentence.Verbal Aptitude · Basic Vocabulary (Words, Idioms, Phrases in Context) · MCQ · 1 mark
  2. Q2Bird : Nest :: Bee : Select the correct option to complete the analogy.Analytical Aptitude · Analogy and Relationship Matching · MCQ · 1 mark
  3. Q3If Pe x = Qe -x for all real values of x , which one of the following statements is true?Quantitative Aptitude · Mathematical Operations (Powers, Exponents, Logarithms) · MCQ · 1 mark
  4. Q4The paper as shown in the figure is folded to make a cube where each square corresponds to a particular face of the cube. Which one of the following options correctly represents t…Spatial Aptitude · Structural Morphing (Mirroring, Assembling, Grouping) · MCQ · 1 mark
  5. Q5Let p 1 and p 2 denote two arbitrary prime numbers. Which one of the following statements is correct for all values of p 1 and p 2 ?Analytical Aptitude · Numerical Relations & Arithmetic Logic · MCQ · 1 mark
  6. Q6Based only on the conversation below, identify the logically correct inference: “Even if I had known that you were in the hospital, I would not have gone there to see you”, Ramya…Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 2 marks
  7. Q7If IMAGE and FIELD are coded as FHBNJ and EMFJG respectively then, which one among the given options is the most appropriate code for BEACH ?Analytical Aptitude · Analogy and Relationship Matching · MCQ · 2 marks
  8. Q8Which one of the following options is correct for the given data in the table? Iteration ( i ) 0 1 2 3 --- --- --- --- --- Input ( I ) 20 -4 10 15 Output ( X ) 20 16 26 41 Output…Analytical Aptitude · Numerical Relations & Arithmetic Logic · MCQ · 2 marks
  9. Q9In the given figure, PQRS is a square of side 2 cm and PLMN is a rectangle. The corner L of the rectangle is on the side QR. Side MN of the rectangle passes through the corner S o…Quantitative Aptitude · Mensuration and Geometry · MCQ · 2 marks
  10. Q10The diagram below shows a river system consisting of 7 segments, marked P, Q, R, S, T, U, and V. It splits the land into 5 zones, marked Z1, Z2, Z3, Z4, and Z5. We need to connect…Analytical Aptitude · Operational Puzzles and Systemic Reasoning · MCQ · 2 marks

MATHEMATICAL FOUNDATIONS

  1. Q11If A = pmatrix 1 & 2 \\ 2 & -1 pmatrix , then which ONE of the following is A 8 ?Linear Algebra · Matrices, Determinants, & Linear Equation Systems · MCQ · 1 mark
  2. Q12The value of x such that x > 1 , satisfying the equation 1 x t t \,dt = 1 4 isCalculus · Mean Value Theorems & Definite Integration · MCQ · 1 mark
  3. Q14Let L , M , and N be non-singular matrices of order 3 satisfying the equations L 2 = L -1 , M = L 8 and N = L 2 . Which ONE of the following is the value of the determinant of (M…Linear Algebra · Matrices, Determinants, & Linear Equation Systems · MCQ · 1 mark
  4. Q15Let P(x) be an arbitrary predicate over the domain of natural numbers. Which ONE of the following statements is TRUE?Discrete Mathematics · Propositional and First-Order Quantifier Logic · MCQ · 1 mark
  5. Q42Let F be the set of all functions from \ 1, , n\ to \ 0, 1\ . Define the binary relation on F as follows: f, g F, f g if and only if x \ 1, , n\ , f(x) g(x) , where 0 1 . Which of…Discrete Mathematics · Sets, Relations, Functions, Partial Orders, Lattices · MSQ · 2 marks
  6. Q44Consider a system of linear equations PX = Q where P R 3 3 and Q R 3 3 . Suppose P has an LU decomposition, P = LU , where L = bmatrix 1 & 0 & 0 \\ l 21 & 1 & 0 \\ l 31 & l 32 & 1…Linear Algebra · Matrix Factorization & LU Decomposition · MSQ · 2 marks
  7. Q64A quadratic polynomial (x - )(x - ) over complex numbers is said to be square invariant if (x - )(x - ) = (x - 2)(x - 2) . Suppose from the set of all square invariant quadratic p…Probability & Statistics · Random Variables & Sampling Rules · NAT · 2 marks
  8. Q65The unit interval (0,1) is divided at a point chosen uniformly distributed over (0,1) in R into two disjoint subintervals. The expected length of the subinterval that contains 0.4…Probability & Statistics · Continuous/Discrete Distributions (Uniform, Normal, Exponential) · NAT · 2 marks

CORE CS

  1. Q13Consider a binary tree T in which every node has either zero or two children. Let n > 0 be the number of nodes in T . Which ONE of the following is the number of nodes in T that h…Data Structures · Linked Lists & Binary Trees · MCQ · 1 mark
  2. Q16Consider the following statements: (i) Address Resolution Protocol (ARP) provides a mapping from an IP address to the corresponding hardware (link-layer) address. (ii) A single TC…Computer Networks (CN) · OSI & TCP/IP Protocol Layers · MCQ · 1 mark
  3. Q17Consider the routing protocols given in List-I and the names given in List-II: List-I (i) Distance vector routing (ii) Link state routing List-II (a) Bellman-Ford (b) Dijkstra For…Computer Networks (CN) · Routing Protocols (Shortest Path, Flooding, Distance Vector, Link State Routing) · MCQ · 1 mark
  4. Q18A machine receives an IPv4 datagram. The protocol field of the IPv4 header has the protocol number of a protocol X. Which ONE of the following is NOT a possible candidate for X?Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · MCQ · 1 mark
  5. Q19Consider the following C program: c include <stdio.h> void stringcopy(char , char ); int main( ) char a[30] = "@ Hello World!"; stringcopy(a, a + 2); printf("%s ", a); return 0; v…Programming in C · Pointers, Multi-Dimensional Arrays, Structures · MCQ · 1 mark
  6. Q20Consider an unordered list of N distinct integers. What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest in the list?Algorithms · Searching, Sorting, Hashing Mechanisms · MCQ · 1 mark
  7. Q21Consider the following statements about the use of backpatching in a compiler for intermediate code generation: (I) Backpatching can be used to generate code for Boolean expressio…Compiler Design · Intermediate Code Generation & Local Code Optimization · MCQ · 1 mark
  8. Q22Given the following syntax directed translation rules: Rule 1: R AB \ B.i = R.i - 1; A.i = B.i; R.i = A.i + 1;\ Rule 2: P CD \ P.i = C.i + D.i; D.i = C.i + 2\ Rule 3: Q EF \ Q.i =…Compiler Design · Syntax-Directed Translation & Runtime Environments · MCQ · 1 mark
  9. Q23Consider a network that uses Ethernet and IPv4. Assume that IPv4 headers do not use any options field. Each Ethernet frame can carry a maximum of 1500 bytes in its data field. A U…Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · MCQ · 1 mark
  10. Q24Which ONE of the following languages is accepted by a deterministic pushdown automaton?Theory of Computation (TOC) · Context-Free Grammars & Push-Down Automata · MCQ · 1 mark
  11. Q25Let G 1 , G 2 be Context Free Grammars (CFGs) and R be a regular expression. For a grammar G , let L(G) denote the language generated by G . Which ONE among the following question…Theory of Computation (TOC) · Turing Machines & Undecidability · MCQ · 1 mark
  12. Q26Processes P1 , P2 , P3 , P4 arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively. Shortes…Operating Systems (OS) · CPU and I/O Scheduling · MCQ · 1 mark
  13. Q27An audit of a banking transactions system has found that on an earlier occasion, two joint holders of account A attempted simultaneous transfers of Rs. 10000 each from account A t…Database Management Systems (DBMS) · Transactions, Concurrency Control, Conflict Serializability · MSQ · 1 mark
  14. Q28Which of the following is/are part of an Instruction Set Architecture of a processor?Computer Organization and Architecture (COA) · Machine Instructions & Addressing Modes · MSQ · 1 mark
  15. Q29Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph G is/are TRUE?Algorithms · Graph Traversals (BFS, DFS) & Single-Source Shortest Paths · MSQ · 1 mark
  16. Q30Consider the two lists List-I and List-II given below: List-I (i) Context free languages (ii) Recursive languages (iii) Regular languages List-II (a) Closed under union (b) Not cl…Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MSQ · 1 mark
  17. Q31Consider the following logic circuit diagram. Which is/are the CORRECT option(s) for the output function ..?Digital Logic · Combinational Logic (Multiplexers, Decoders, Adders) · MSQ · 1 mark
  18. Q32The following two signed 2's complement numbers (multiplicand M and multiplier Q) are being multiplied using Booth's algorithm: M : 1100 1101 1110 1101 and Q: 1010 0100 1010 1010…Computer Organization and Architecture (COA) · ALU, Control Unit Design, Data-Path Operations · NAT · 1 mark
  19. Q33c int x = 126, y = 105; do if(x > y) x = x - y; else y = y - x; while(x!=y); printf("%d", x); The output of the given C code segment is . (Answer in integer)Programming in C · Data Types, Syntax, Control Structures, Loops · NAT · 1 mark
  20. Q34In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is . (Answer in integer)Digital Logic · Sequential Circuits (Flip-Flops, Registers, Counters) · NAT · 1 mark
  21. Q35Suppose the values 10, -4, 15, 30, 20, 5, 60, 19 are inserted in that order into an initially empty binary search tree. Let T be the resulting binary search tree. The number of ed…Data Structures · Binary Search Trees (BSTs) & Binary Heaps · NAT · 1 mark
  22. Q36Suppose we are transmitting frames between two nodes using Stop-and-Wait protocol. The frame size is 3000 bits. The transmission rate of the channel is 2000 bps (bits/second) and…Computer Networks (CN) · Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging) · MCQ · 2 marks
  23. Q37Let G be an edge-weighted undirected graph with positive edge weights. Suppose a positive constant is added to the weight of every edge. Which ONE of the following statements is T…Algorithms · Minimum Spanning Trees (Prim/Kruskal Algorithms) · MCQ · 2 marks
  24. Q38A meld operation on two instances of a data structure combines them into one single instance of the same data structure. Consider the following data structures: P: Unsorted doubly…Data Structures · Binary Search Trees (BSTs) & Binary Heaps · MCQ · 2 marks
  25. Q39For a direct-mapped cache, 4 bits are used for the tag field and 12 bits are used to index into a cache block. The size of each cache block is one byte. Assume that there is no ot…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · MCQ · 2 marks
  26. Q40Given a Context-Free Grammar G as follows: S Aa bac dc bda A d Which ONE of the following statements is TRUE?Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MCQ · 2 marks
  27. Q41An array A of length n with distinct elements is said to be bitonic if there is an index 1 = i = n such that A[1..i] is sorted in the non-decreasing order and A[i+1..n] is sorted…Algorithms · Searching, Sorting, Hashing Mechanisms · MCQ · 2 marks
  28. Q43Given the following Karnaugh Map for a Boolean function F(w, x, y, z) : Which one or more of the following Boolean expression(s) represent(s) F ?Digital Logic · Boolean Algebra, Minimization, K-Maps · MSQ · 2 marks
  29. Q45Consider a stack data structure into which we can PUSH and POP records. Assume that each record pushed in the stack has a positive integer key and that all keys are distinct. We w…Data Structures · Abstract Data Types (ADTs), Stacks, Queues · MSQ · 2 marks
  30. Q46Consider the following relational schema along with all the functional dependencies that hold on them. R1(A, B, C, D, E) : \ D E, EA B, EB C\ R2(A, B, C, D) : \ A D, A B, C A\ Whi…Database Management Systems (DBMS) · Normalization Schemes (1NF, 2NF, 3NF, BCNF Boundaries) · MSQ · 2 marks
  31. Q47Consider a demand paging system with three frames, and the following page reference string: 1 2 3 4 5 4 1 6 4 5 1 3 2. The contents of the frames are as follows initially and afte…Operating Systems (OS) · Memory Management and Virtual Memory · MSQ · 2 marks
  32. Q48P = \ P 1, P 2, P 3, P 4\ consists of all active processes in an operating system. R = \ R 1, R 2, R 3, R 4\ consists of single instances of distinct types of resources in the sys…Operating Systems (OS) · Deadlock Prevention, Avoidance, Detection, Recovery · MSQ · 2 marks
  33. Q49Three floating point numbers X, Y, and Z are stored in three registers R X, R Y, and R Z , respectively in IEEE 754 single precision format as given below in hexadecimal: R X = 0x…Digital Logic · Number Representations & Fixed/Floating Point Math · MSQ · 2 marks
  34. Q50Which of the following Boolean algebraic equation(s) is/are CORRECT?Digital Logic · Boolean Algebra, Minimization, K-Maps · MSQ · 2 marks
  35. Q51Consider two grammars G 1 and G 2 with the production rules given below: G 1 : S if E then S if E then S else S a E b G 2 : S if E then S M M if E then M else S c E b where if, th…Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MSQ · 2 marks
  36. Q52Let = \ a, b, c\ . For x , and , let \ (x) denote the number of occurrences of in x . Which one or more of the following option(s) define(s) regular language(s)?Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MSQ · 2 marks
  37. Q53Consider the database transactions T1 and T2, and data items X and Y. Which of the schedule(s) is/are conflict serializable?Database Management Systems (DBMS) · Transactions, Concurrency Control, Conflict Serializability · MSQ · 2 marks
  38. Q54Consider the following relational schema: Students (rollno: integer, name: string, age: integer, cgpa: real) Courses (courseno: integer, cname: string, credits: integer) Enrolled…Database Management Systems (DBMS) · SQL Queries (DDL/DML, Joins, Aggregations) · MSQ · 2 marks
  39. Q55Given a computing system with two levels of cache (L1 and L2) and a main memory. The first level (L1) cache access time is 1 nanosecond (ns) and the “hit rate” for L1 cache is 90%…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · NAT · 2 marks
  40. Q56A 5-stage instruction pipeline has stage delays of 180, 250, 150, 170, and 250, respectively, in nanoseconds. The delay of an inter-stage latch is 10 nanoseconds. Assume that ther…Computer Organization and Architecture (COA) · Instruction Pipelining, Performance, Hazard Management · NAT · 2 marks
  41. Q57In a B+ - tree where each node can hold at most four key values, a root to leaf path consists of the following nodes: A = (49, 77, 83, –), B = (7, 19, 33, 44), C = (20 , 22 , 25 ,…Database Management Systems (DBMS) · File Organization & Indexing (e.g., B and B+ Trees) · NAT · 2 marks
  42. Q58A computer system supports a logical address space of 2 32 bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A logical address is divided into a b-bit i…Operating Systems (OS) · Memory Management and Virtual Memory · NAT · 2 marks
  43. Q59Consider the following algorithm someAlgo that takes an undirected graph G as input. someAlgo(G) 1. Let v be any vertex in G . Run BFS on G starting at v . Let u be a vertex in G…Algorithms · Graph Traversals (BFS, DFS) & Single-Source Shortest Paths · NAT · 2 marks
  44. Q60Let = \ 1, 2, 3, 4\ . For x , let prod (x) be the product of symbols in x modulo 7. We take prod ( ) = 1 , where is the null string. For example, prod (124) = (1 2 4) 7 = 1 . Defi…Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · NAT · 2 marks
  45. Q61An application executes 6.4 10 8 number of instructions in 6.3 seconds. There are four types of instructions, the details of which are given in the table. The duration of a clock…Computer Organization and Architecture (COA) · Instruction Pipelining, Performance, Hazard Management · NAT · 2 marks
  46. Q62Consider the following C program: c include <stdio.h> int main( ) int a; int arr[5] = 30, 50, 10 ; int ptr; ptr = &arr[0] + 1; a = ptr; ( ptr)++; ptr++; printf("%d", a + ( ptr) +…Programming in C · Pointers, Multi-Dimensional Arrays, Structures · NAT · 2 marks
  47. Q63Consider the following C program: c include <stdio.h> int g(int n) return (n+10); int f(int n) return g(n 2); int main( ) int sum, n; sum=0; for (n=1; n<3; n++) sum += g(f(n)); pr…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · NAT · 2 marks