GATE CS 2026 (Afternoon)
65 questions · 100 marks · 180 minutes
GENERAL APTITUDE (GA)
- Q1Expedite, Hasten, Hurry, . Fill the blank by choosing a word with a meaning similar to that of the words given above.Verbal Aptitude · Vocabulary Mechanics (Antonyms, Synonyms) · MCQ · 1 mark
- Q2A black square PQRS has been cut into two parts. One part of it is shown in Panel I. Which one of the shapes in Panel II is the other part?Spatial Aptitude · Structural Morphing (Mirroring, Assembling, Grouping) · MCQ · 1 mark
- Q3A day can only be cloudy or sunny. The probability of a day being cloudy is 0.5, independent of the condition on other days. What is the probability that in any given four days, t…Quantitative Aptitude · Elementary Statistics and Probability · MCQ · 1 mark
- Q4The values of Stock A and Stock B on a particular day are Rs. 50 and Rs. 80, respectively. An investor invests Rs. 100 in Stock A and Rs. 80 in Stock B. He sells all the stocks th…Quantitative Aptitude · Numerical Computation (Percentages, Ratios) · MCQ · 1 mark
- Q5'When it is raining, peacocks dance.' Based only on this sentence, which one of the following options is necessarily true?Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 1 mark
- Q6Water : P :: Food : Q Choose the P and Q combination from the options below to form a meaningful analogy.Analytical Aptitude · Analogy and Relationship Matching · MCQ · 2 marks
- Q7Two tiles are missing in Panel I. Which one of the options in Panel II is the appropriate choice for the missing tiles?Spatial Aptitude · Pattern Identification in 2D and 3D Spaces · MCQ · 2 marks
- Q8Figures (i) and (ii) represent intercity highway systems. The black dots represent cities and the line segments between them represent intercity highways. A salesperson needs to m…Analytical Aptitude · Operational Puzzles and Systemic Reasoning · MCQ · 2 marks
- Q9The figure in Panel I below is a grid of cells with four rows and four columns. The numbers on the top and on the left represent the number of cells that are to be shaded in that…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
- Q11For two different persons x and y , the predicate M(x, y) denotes that x knows y . Consider the following statement. There is a person who does not know anyone else, but that pers…Discrete Mathematics · Propositional and First-Order Quantifier Logic · MCQ · 1 mark
- Q14The probability density function f(x) of a random variable X which takes real values is f(x) = 1 3 2 (- x 2 18 ), \; x (- , + ) Which one of the following statements is correct ab…Probability & Statistics · Continuous/Discrete Distributions (Uniform, Normal, Exponential) · MCQ · 1 mark
- Q26Let R be a binary relation on the set \ 1, 2, , 10\ , where (x, y) R if the product of x and y is square of an integer. Which of the following properties is/are satisfied by R ?Discrete Mathematics · Sets, Relations, Functions, Partial Orders, Lattices · MSQ · 1 mark
- Q27For a real number a , let I(a) = -1 1 (3x 2 - ax + 1) dx . Which of the following statements is/are true?Calculus · Mean Value Theorems & Definite Integration · MSQ · 1 mark
- Q31Consider the system of linear equations given below. ax + y = b 16x + ay = 24 Suppose the values of a and b are chosen such that the system of linear equations produce multiple so…Linear Algebra · Matrices, Determinants, & Linear Equation Systems · NAT · 1 mark
- Q36Consider a complete graph K n with n vertices ( n > 4 ). Note that multiple spanning trees can be constructed over K n . Each of these spanning trees is represented as a set of ed…Discrete Mathematics · Graph Theory (Connectivity, Paths, Cycles, Trees) · MCQ · 2 marks
- Q62The determinant of a 4 x 4 matrix A is 3. The value of the determinant of 2A is . (answer in integer)Linear Algebra · Matrices, Determinants, & Linear Equation Systems · NAT · 2 marks
- Q63Suppose an unbiased coin is tossed 6 times. Each coin toss is independent of all previous coin tosses. Let E 1 be the event that among the second, fourth, and sixth coin tosses, t…Probability & Statistics · Conditional Probability & Bayes Theorem · NAT · 2 marks
- Q64Consider a function f : (0, 1) \ 0, 1\ defined as follows. For a real number r (0, 1) , f(r) = 1 if the second digit after the decimal point in r is one of the four digits 2, 3, 6…Calculus · Limits, Continuity, and Differentiability · NAT · 2 marks
CORE CS
- Q12The set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal. T I: Inorder II: Preorder III: Postorder S L: left s…Data Structures · Linked Lists & Binary Trees · MCQ · 1 mark
- Q13Which one of the following statements is equivalent to the following assertion? Turing machine M decides the language L \ 0, 1\ .Theory of Computation (TOC) · Turing Machines & Undecidability · MCQ · 1 mark
- Q15In the context of DBMS, consider the two sets T and S given below. T I: Logical schema II: Physical schema III: External schema S L: Views M: File organization and indexes N: Rela…Database Management Systems (DBMS) · Relational Models, Relational Algebra, Tuple Calculus · MCQ · 1 mark
- Q16Which one of the following options is not a property of Boolean Algebra? Note: + is OR operation, is AND operation, and ' is NOT operationDigital Logic · Boolean Algebra, Minimization, K-Maps · MCQ · 1 mark
- Q17In C runtime environment, which one of the following is stored in heap?Programming in C · Dynamic Memory Allocation & File Handling · MCQ · 1 mark
- Q18Consider the following two statements about interrupt handling mechanisms in a CPU. S1: In non-vectored interrupt mechanism, it usually takes more time to start the Interrupt Serv…Computer Organization and Architecture (COA) · I/O Interfaces (Interrupts & DMA Control Modes) · MCQ · 1 mark
- Q19Consider the following three ANSI-C programs, P1, P2 and P3 Which one of the following statements is true?Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · MCQ · 1 mark
- Q20Consider concurrent execution of two transactions T1 and T2 in a DBMS, both of which access a data object A . For these two transactions to not conflict on A , which one of the fo…Database Management Systems (DBMS) · Transactions, Concurrency Control, Conflict Serializability · MCQ · 1 mark
- Q21Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2 Mbps, 500 kbps, and 1 Mbps, r…Computer Networks (CN) · OSI & TCP/IP Protocol Layers · MCQ · 1 mark
- Q22Which one of the following protocols may need to broadcast some of its messages?Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · MCQ · 1 mark
- Q23Which one of the following CPU scheduling algorithms cannot be preemptive?Operating Systems (OS) · CPU and I/O Scheduling · MCQ · 1 mark
- Q24Consider the following functions, where n is a positive integer. n 1/3 , (n), (n!), 2 (n) Which one of the following options lists the functions in increasing order of asymptotic…Algorithms · Asymptotic Analysis (O, Omega, Theta Complexities) · MCQ · 1 mark
- Q25Which of the following can be recurrence relation(s) corresponding to an algorithm with time complexity (n) ?Algorithms · Asymptotic Analysis (O, Omega, Theta Complexities) · MSQ · 1 mark
- Q28In a system, numbers are represented using 4-bit two's complement form. Consider four numbers N1 = 1011, N2 = 1101, N3 = 1010 and N4 = 1001 in the system. Which of the following o…Digital Logic · Number Representations & Fixed/Floating Point Math · MSQ · 1 mark
- Q29Which of the following grammars is/are ambiguous?Theory of Computation (TOC) · Context-Free Grammars & Push-Down Automata · MSQ · 1 mark
- Q30The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function h(k) = k 9 . The collisions are resolved by chaining. After all the keys are inse…Algorithms · Searching, Sorting, Hashing Mechanisms · NAT · 1 mark
- Q32Consider an array A = [10, 7, 8, 19, 41, 35, 25, 31] . Suppose the merge sort algorithm is executed on array A to sort it in increasing order. The merge sort algorithm will carry…Algorithms · Divide-and-Conquer Designs · NAT · 1 mark
- Q33If an IP network uses a subnet mask of 255.255.240.0, the maximum number of IP addresses that can be assigned to network interfaces is . (answer in integer)Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · NAT · 1 mark
- Q34The 32-bit IEEE 754 single precision representation of a number is 0xC2710000. The number in decimal representation is . (rounded off to two decimal places)Digital Logic · Number Representations & Fixed/Floating Point Math · NAT · 1 mark
- Q35A lexical analyzer uses the following token definitions • letter [A - Za - z] • digit [0 - 9] • id letter (letter digit) • number digit + • ws (blank tab newline) + For the string…Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · NAT · 1 mark
- Q37Let G be a weighted directed acyclic graph with m edges and n vertices. Given G and a source vertex s in G , which one of the following options gives the worst case time complexit…Algorithms · Graph Traversals (BFS, DFS) & Single-Source Shortest Paths · MCQ · 2 marks
- Q38Consider an array A of integers of size n . The indices of A run from 1 to n . An algorithm is to be designed to check whether A satisfies the condition given below. i, j \ 1, , n…Algorithms · Searching, Sorting, Hashing Mechanisms · MCQ · 2 marks
- Q39Consider a table T , where the elements T[i][j], 0 i, j n , represent the cost of the optimal solutions of different subproblems of a problem that is being solved using a dynamic…Algorithms · Dynamic Programming Infrastructure · MCQ · 2 marks
- Q40Consider the following 4-variable Boolean function F(A, B, C, D) = m(0, 1, 2, 3, 8, 9, 10, 11) Consider A as MSB, D as LSB. Which one of the following options represents the minim…Digital Logic · Boolean Algebra, Minimization, K-Maps · MCQ · 2 marks
- Q41Consider the canonical LR(0) parsing of the grammar below using terminals \ a, b, c\ and non-terminals \ A, B, C, S\ with S as the start symbol. S ACB A A C cC B bB b Which one of…Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MCQ · 2 marks
- Q42In the context of schema normalization in relational DBMS, consider a set F of functional dependencies. The set of all functional dependencies implied by F is called the closure o…Database Management Systems (DBMS) · Integrity Constraints & Functional Dependencies · MCQ · 2 marks
- Q43Consider the transmission of data bits 110001011 over a link that uses Cyclic Redundancy Check (CRC) code for error detection. If the generator bit pattern is given to be 1001, wh…Computer Networks (CN) · Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging) · MCQ · 2 marks
- Q44Consider a processor that has 16 general purpose registers and it uses 2-byte instruction format for all its instructions. Variable-sized opcodes are permitted. There are three di…Computer Organization and Architecture (COA) · Machine Instructions & Addressing Modes · MCQ · 2 marks
- Q45Consider the control flow graph given below. Which one of the following options is the set of live variables at the exit point of each basic block?Compiler Design · Data Flow Analysis: Constant Propagation, Liveliness Analysis, Common Subexpression Elimination · MCQ · 2 marks
- Q46An index in a DBMS is said to be dense if an index entry appears for every search-key value in the indexed file. Otherwise it is called a sparse index. Consider the following two…Database Management Systems (DBMS) · File Organization & Indexing (e.g., B and B+ Trees) · MCQ · 2 marks
- Q47Consider the following two finite automata D 1 and D 2 . Which of the following statements is/are true?Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · MSQ · 2 marks
- Q48Let = \ a, b, c, d\ and let L = \ a i b j c k d l i, j, k, l 0\ . Which of the following constraints ensure(s) that the language L is context-free?Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MSQ · 2 marks
- Q49Consider a binary search tree (BST) with n leaf nodes ( n > 0 ). Given any node V , the key present in the node is denoted as Val (V) . All the keys present in the given BST are d…Data Structures · Binary Search Trees (BSTs) & Binary Heaps · MSQ · 2 marks
- Q50Consider a stack S and a queue Q . Both of them are initially empty and have the capacity to store ten elements each. The elements 1, 2, 3, 4, and 5 arrive one by one, in that ord…Data Structures · Abstract Data Types (ADTs), Stacks, Queues · MSQ · 2 marks
- Q51Consider three processes P1, P2, and P3 running identical code, as shown in the pseudocode below. A and B are two binary semaphores initialized to 1 and 0, respectively. X is a sh…Operating Systems (OS) · Concurrency & Synchronization (Semaphores, Mutex, Monitors, Locks) · MSQ · 2 marks
- Q52Consider a system with a processor and a 4 KB direct mapped cache with block size of 16 bytes. The system has a 16 MB physical memory. Four words P, Q, R, and S are accessed by th…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · MSQ · 2 marks
- Q53To keep track of free blocks in a file system, one of the two approaches is generally used – using bitmaps (bit vectors) or using linked lists. Consider that the linked list appro…Operating Systems (OS) · File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
- Q54A system has a Translation Lookaside Buffer (TLB) that has a reach of 1 MB. TLB reach is defined as the total amount of physical memory that can be accessed through the TLB entrie…Operating Systems (OS) · Memory Management and Virtual Memory · NAT · 2 marks
- Q55Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes 20 KB, 4 KB, 25 KB, 18 KB, 7 KB…Operating Systems (OS) · Memory Management and Virtual Memory · NAT · 2 marks
- Q56Consider a system with 1 MB physical memory and a word length of 1 byte. The system uses a direct mapped cache, with block numbers starting from 0. The word with physical address…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · NAT · 2 marks
- Q57A non-pipelined instruction execution unit that operates at 1.6 GHz clock takes an average of 5 clock cycles to complete the execution of an instruction. To improve the performanc…Computer Organization and Architecture (COA) · Instruction Pipelining, Performance, Hazard Management · NAT · 2 marks
- Q58Consider a new TCP connection between a sender and a receiver. The receiver advertised window is constant at 48 KB, the maximum segment size (MSS) is 2 KB, and the slow start thre…Computer Networks (CN) · Transport Layer (Flow Control and Congestion Control, TCP, UDP, Sockets) · NAT · 2 marks
- Q59Consider the digital circuit shown below with two input lines A and B, two select lines S0 and S1, and an output line Y. The blocks Q and M represent active high 2 : 4 decoder and…Digital Logic · Combinational Logic (Multiplexers, Decoders, Adders) · NAT · 2 marks
- Q60Consider the following ANSI-C program. c include <stdio.h> int main( ) int ptr, a, b, c; a=5; b=11; c=20; ptr=&a; ptr=c; ptr=&c; a= (&b); c= ptr-a; printf("%d",c); return(0); The…Programming in C · Pointers, Multi-Dimensional Arrays, Structures · NAT · 2 marks
- Q61Consider the following ANSI-C function. c int func(int start, int end) int length = end + 1 - start; if((length<1) (start < 0) (end<0)) return(0); if(length%3 == 0) return(func(st…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · NAT · 2 marks
- Q65It is necessary to design a link-layer protocol between two hosts that are directly connected over a lossless link of length 3000 kilometers. Assume that the link bandwidth is 10…Computer Networks (CN) · Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging) · NAT · 2 marks

