GATE CS 2026 (Forenoon)
65 questions · 100 marks · 180 minutes
GENERAL APTITUDE (GA)
- Q1The antonym of the word protagonist is .Verbal Aptitude · Vocabulary Mechanics (Antonyms, Synonyms) · MCQ · 1 mark
- Q2The figure shows two 4-tile patterns. Either one or both of the patterns can be used any number of times and in any orientation to construct a new pattern. Which one of the option…Spatial Aptitude · Structural Morphing (Mirroring, Assembling, Grouping) · MCQ · 1 mark
- Q3Consider a knock-out women's badminton singles tournament where there are no ties. The loser in each game is eliminated from the tournament. Every player plays until she is defeat…Quantitative Aptitude · Combinatorics Core (Permutations, Combinations, Series) · MCQ · 1 mark
- Q4A student needs to enroll for a minimum of 60 credits. A student cannot enroll for more than 70 credits. The credits are divided amongst project and three distinct sets of courses…Analytical Aptitude · Numerical Relations & Arithmetic Logic · MCQ · 1 mark
- Q5'When the teacher is in the room, all students stand silently.' If the above statement is true, which one of the following statements is not necessarily true?Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 1 mark
- Q6Combinatorics deals with problems involving counting. For example, “How many distinct arrangements of N distinct objects in M spaces on a circle are possible?” is a typical proble…Verbal Aptitude · Reading Comprehension · MCQ · 2 marks
- Q7In Panel I of the figure below, the front view and top view of a structure are shown. Which one of the 3D structures shown in Panel II possesses the views shown in Panel I?Spatial Aptitude · Pattern Identification in 2D and 3D Spaces · MCQ · 2 marks
- Q8For positive real numbers S and K , the function H K(S) is defined as: H K(S) = (S - K, 0) . The max function is defined as: (a, b) = cases a, & when a > b \\ b, & when a b cases…Quantitative Aptitude · Graphical Representations (2D and 3D Plots, Maps, Tables) · MCQ · 2 marks
- Q9In the 2020 summer Olympics' Javelin throw finals, Neeraj Chopra exhibited a spectacular performance to win the gold medal. The silver medal was won by Jakub Vadlejch and the bron…Analytical Aptitude · Operational Puzzles and Systemic Reasoning · MCQ · 2 marks
- Q10An unbiased six-faced dice whose faces are marked with numbers 1, 2, 3, 4, 5, and 6 is rolled twice in succession and the number on the top face is recorded each time. The probabi…Quantitative Aptitude · Elementary Statistics and Probability · MCQ · 2 marks
MATHEMATICAL FOUNDATIONS
- Q11An urn contains one red ball and one blue ball. At each step, a ball is picked uniformly at random from the urn, and this ball together with another ball of the same color is put…Probability & Statistics · Conditional Probability & Bayes Theorem · MCQ · 1 mark
- Q12Consider 4 4 matrices with their elements from \ 0, 1\ . The number of such matrices with even number of 1s in every row and every column isDiscrete Mathematics · Combinatorics (Counting Rules, Summation Formulas) · MCQ · 1 mark
- Q13For n > 1 , the maximum multiplicity of any eigenvalue of an n n matrix with elements from R isLinear Algebra · Eigenvalues and Eigenvectors · MCQ · 1 mark
- Q20Let n > 1 . Consider an n n matrix M with its elements from R . Let the vector (0, 1, 0, 0, , 0) T R n be in the null space of M . Which of the following options is/are always cor…Linear Algebra · Matrices, Determinants, & Linear Equation Systems · MSQ · 1 mark
- Q32Consider the function f : R R defined as follows: f(x) = cases c 1 e x - c 2 e ( 1 x ), & if x > 0 \\ 3, & otherwise cases where c 1, c 2 R . If f is continuous at x = 0 , then c…Calculus · Limits, Continuity, and Differentiability · NAT · 1 mark
- Q46Let f : R R be defined as follows: f(x) = ( x 2 - x ) ( x - x 2 ) Which of the following statements is/are true?Calculus · Limits, Continuity, and Differentiability · MSQ · 2 marks
- Q47Let G(V, E) be a simple, undirected graph. A vertex cover of G is a subset V' V such that for every (u, v) E , u V' or v V' . Let the size of the smallest vertex cover in G be k .…Discrete Mathematics · Advanced Graph Bounds (Matching, Coloring Theorems) · MSQ · 2 marks
- Q55An undirected, unweighted, simple graph G(V, E) is said to be 2-colorable if there exists a function c : V \ 0, 1\ such that for every (u, v) E , c(u) c(v) . Which of the followin…Discrete Mathematics · Graph Theory (Connectivity, Paths, Cycles, Trees) · MSQ · 2 marks
- Q57Let G be an undirected graph, which is a path on 8 vertices. The number of matchings in G is . (answer in integer)Discrete Mathematics · Combinatorics (Counting Rules, Summation Formulas) · NAT · 2 marks
- Q58Let X be a random variable which takes values in the set \ 1, 2, 3, 4, 5, 6, 7, 8\ . Further, (X = 1) = (X = 2) = (X = 5) = (X = 7) = 1 6 and (X = 3) = (X = 4) = (X = 6) = (X = 8)…Probability & Statistics · Random Variables & Sampling Rules · NAT · 2 marks
CORE CS
- Q14Match each addressing mode in List I with a data element or an element of a data structure (in a high-level language) in List II : List I P. Immediate Q. Indirect R. Base with ind…Computer Organization and Architecture (COA) · Machine Instructions & Addressing Modes · MCQ · 1 mark
- Q15Consider a processor P whose instruction set architecture is the load-store architecture. The instruction format is such that the first operand of any instruction is the destinati…Computer Organization and Architecture (COA) · Machine Instructions & Addressing Modes · MCQ · 1 mark
- Q16Which one of the following dependencies among the register operands of different instructions can cause a data hazard in a pipelined processor?Computer Organization and Architecture (COA) · Instruction Pipelining, Performance, Hazard Management · MCQ · 1 mark
- Q17Consider the following recurrence relations: For all n > 1 , T 1(n) = 4T 1 ( n 2 ) + T 2(n) T 2(n) = 5T 2 ( n 4 ) + ( 2 n) Assume that for all n 1 , T 1(n) = 1 and T 2(n) = 1 . Wh…Algorithms · Asymptotic Analysis (O, Omega, Theta Complexities) · MCQ · 1 mark
- Q18With respect to a TCP connection between a client and a server, which one of the following statements is true?Computer Networks (CN) · Transport Layer (Flow Control and Congestion Control, TCP, UDP, Sockets) · MCQ · 1 mark
- Q19Which of the following statements is/are true with respect to the interaction of a web browser with a web server using HTTP 1.1?Computer Networks (CN) · Application Layer (DNS, SMTP, HTTP, FTP, Email) & Security · MSQ · 1 mark
- Q21Consider the following Boolean expression of a function F : F(P, Q) = (P + Q) ( P Q) Which of the following expressions is/are equivalent to F ?Digital Logic · Boolean Algebra, Minimization, K-Maps · MSQ · 1 mark
- Q22Consider the 8-bit signed integers X, Y and Z represented using the sign-magnitude form. The binary representations of X and Y are as follows: X : 10110100 Y : 01001100 Which of t…Digital Logic · Number Representations & Fixed/Floating Point Math · MSQ · 1 mark
- Q23Let n be an odd number greater than 100. Consider a binary minheap with n elements stored in an array P whose index starts from 1. Which of the following indices of P do/does NOT…Data Structures · BSTs & Binary Heaps · MSQ · 1 mark
- Q24Consider a hash table P[0, 1, , 10] that is initially empty. The hash table is maintained using open addressing with linear probing. The hash function used is h(x) = (x + 7) 11 .…Algorithms · Searching, Sorting, Hashing Mechanisms · MSQ · 1 mark
- Q25Consider the following grammar where S is the start symbol, and a and b are terminal symbols. S aSbS bS Which of the following statements is/are true?Theory of Computation (TOC) · Context-Free Grammars & Push-Down Automata · MSQ · 1 mark
- Q26Let M be a non-deterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of the following options CANNOT be the number of states in the minimal deterministi…Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · MSQ · 1 mark
- Q27Consider the following C statements: c char str1 = "Hello; / Statement S1 / char str2 = "Hello;"; / Statement S2 / int str3 = "Hello"; / Statement S3 / Which of the following opti…Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MSQ · 1 mark
- Q28Which of the following statements is/are true?Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MSQ · 1 mark
- Q29With respect to deadlocks in an operating system, which of the following statements is/are FALSE?Operating Systems (OS) · Deadlock Prevention, Avoidance, Detection, Recovery · MSQ · 1 mark
- Q30Let P, Q, R and S be the attributes of a relation in a relational schema. Let X Y indicate functional dependency in the context of a relational database, where X, Y \ P, Q, R, S\…Database Management Systems (DBMS) · Integrity Constraints & Functional Dependencies · MSQ · 1 mark
- Q31In the context of relational database normalization, which of the following statements is/are true?Database Management Systems (DBMS) · Normalization Schemes (1NF, 2NF, 3NF, BCNF Boundaries) · MSQ · 1 mark
- Q33The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with 23 nodes is . (a…Data Structures · Linked Lists & Binary Trees · NAT · 1 mark
- Q34Consider the following program in C: c include <stdio.h> void func(int i, int j) if(i < j) int i = 0; while (i < 10) j += 2; i++; printf("%d", i); int main() int i = 9, j = 10; fu…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · NAT · 1 mark
- Q35Consider a system consisting of k instances of a resource R , being shared by 5 processes. Assume that each process requires a maximum of two instances of resource R and a process…Operating Systems (OS) · Deadlock Prevention, Avoidance, Detection, Recovery · NAT · 1 mark
- Q36Consider the real valued variables X, Y and Z represented using the IEEE 754 single-precision floating-point format. The binary representations of X and Y in hexadecimal notation…Digital Logic · Number Representations & Fixed/Floating Point Math · MCQ · 2 marks
- Q37Consider a 2-bit saturating up/down counter that performs the saturating up count when the input P is 0, and the saturating down count when P is 1. The Next State table of the cou…Digital Logic · Sequential Circuits (Flip-Flops, Registers, Counters) · MCQ · 2 marks
- Q38The size of the physical address space of a processor is 2 32 bytes. The capacity of a cache memory unit is 2 23 bytes. The cache block size is 128 bytes. The cache memory unit ca…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · MCQ · 2 marks
- Q39Consider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to by the pointer variable head . c struct node int e…Data Structures · Linked Lists & Binary Trees · MCQ · 2 marks
- Q40Let P be the set of all integers from 1 to 15. Consider any order of insertion of the elements of P into a binary search tree that creates a complete binary tree. Which one of the…Data Structures · BSTs & Binary Heaps · MCQ · 2 marks
- Q41Let G(V, E) be an undirected, edge-weighted graph with integer weights. The weight of a path is the sum of the weights of the edges in that path. The length of a path is the numbe…Algorithms · Graph Traversals (BFS, DFS) & Single-Source Shortest Paths · MCQ · 2 marks
- Q42Consider the control flow graph shown in the figure. Which one of the following options correctly lists the set of redundant expressions (common sub-expressions) in the basic bloc…Compiler Design · Data Flow Analysis: Constant Propagation, Liveliness Analysis, Common Subexpression Elimination · MCQ · 2 marks
- Q43Consider a relational database schema with two relations R(P, Q) and S(X, Y) . Let E = \ u v w ( u, v R v, w S)\ be a tuple relational calculus expression. Which one of the follow…Database Management Systems (DBMS) · Relational Models, Relational Algebra, Tuple Calculus · MCQ · 2 marks
- Q44A TCP sender successfully establishes a connection with a TCP receiver and starts the transmission of segments. The TCP congestion control mechanism's slow-start threshold is set…Computer Networks (CN) · Transport Layer (Flow Control and Congestion Control, TCP, UDP, Sockets) · MCQ · 2 marks
- Q45Consider the implementation of sliding window protocol over a lossless link, with a window size of W frames, where each frame is of size 1000 bits (including header). The bandwidt…Computer Networks (CN) · Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging) · MCQ · 2 marks
- Q48Consider a Boolean function F with the following minterm expression: F(P, Q, R, S) = m(1, 2, 3, 4, 5, 7, 10, 12, 13, 14) Which of the following options is/are the minimal sum-of-p…Digital Logic · Boolean Algebra, Minimization, K-Maps · MSQ · 2 marks
- Q49Let G(V, E) be a simple, undirected, edge-weighted graph with unique edge weights. Which of the following statements about the minimum spanning trees (MST) of G is/are true?Algorithms · Minimum Spanning Trees (Prim/Kruskal Algorithms) · MSQ · 2 marks
- Q50Consider the following pseudocode for depth-first search (DFS) algorithm which takes a directed graph G(V, E) as input, where d[v] and f[v] are the discovery time and finishing ti…Algorithms · Graph Traversals (BFS, DFS) & Single-Source Shortest Paths · MSQ · 2 marks
- Q51Let L 1 and L 2 be two languages over a finite alphabet, such that L 1 L 2 and L 2 are regular languages. Which of the following statements is/are always true?Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MSQ · 2 marks
- Q52Consider the following context-free grammar G : S abaaBAbba A aaBBAb bBabaa B aBb ab In the above grammar, S is the start symbol, a and b are terminal symbols, and A and B are non…Theory of Computation (TOC) · Context-Free Grammars & Push-Down Automata · MSQ · 2 marks
- Q53Consider the following two syntax-directed definitions SDD1 and SDD2 for type declarations. D is the start symbol, and int, float and id are the three terminals. The non-terminal…Compiler Design · Syntax-Directed Translation & Runtime Environments · MSQ · 2 marks
- Q54Consider a system that has a cache memory unit and a memory management unit (MMU). The address input to the cache memory is a physical address. The MMU has a translation lookaside…Computer Organization and Architecture (COA) · Main Memory & Virtual Memory Mechanics · MSQ · 2 marks
- Q56An ISP having an address block 202.16.0.0/15 assigns a block of 6000 IP addresses to a client, using the classless internet domain routing (CIDR) super-netting approach. Which of…Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · MSQ · 2 marks
- Q59Consider a hard disk with a rotational speed of 15000 rpm. The time to move the read/write head from a track to its adjacent track is 1 millisecond. Initially, the head is on trac…Operating Systems (OS) · File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
- Q60The EX stage of a pipelined processor performs the memory read operations for LOAD instructions, and the operations for the arithmetic and logic instructions. Let t EX denote the…Computer Organization and Architecture (COA) · Instruction Pipelining, Performance, Hazard Management · NAT · 2 marks
- Q61Consider the recursive functions represented by the following code segment: c int bar(int n) if (n == 1) return 0; else return 1 + bar(n/2); int foo(int n) if (n == 1) return 1; e…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · NAT · 2 marks
- Q62The following sequence corresponds to the preorder traversal of a binary search tree: 50, 25, 13, 40, 30, 47, 75, 60, 70, 80, 77 The position of the element 60 in the postorder tr…Data Structures · BSTs & Binary Heaps · NAT · 2 marks
- Q63Consider the following program snippet. Assume that the program compiles and runs successfully. Further, assume that the fork() system call is always successful in creating a proc…Operating Systems (OS) · System Calls, Processes, Threads, InterProcess Communication · NAT · 2 marks
- Q64Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst…Operating Systems (OS) · CPU and I/O Scheduling · NAT · 2 marks
- Q65Consider a relational database schema with a relation R(A, B, C, D) . If \ A, B\ and \ A, C\ are the only two candidate keys of the relation R , then the number of superkeys of re…Database Management Systems (DBMS) · Integrity Constraints & Functional Dependencies · NAT · 2 marks

