GATE CS 2026 Set 2 question paper: all 65 questions with answers and solutions

General Aptitude

10 questions, 15 marks

General AptitudeMCQ1 markEasy (estimate)
Q.1
Expedite, Hasten, Hurry, __________ Fill the blank by choosing a word with a meaning similar to that of the words given above.
Verbal Ability and Grammar
General AptitudeMCQ1 markEasy (estimate)
Q.2
A black square $P QR S$ 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? Panel I shows a 6 by 6 square PQRS...
Spatial Aptitude
General AptitudeMCQ1 markEasy (estimate)
Q.3
A 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 day...
Quantitative Aptitude
General AptitudeMCQ1 markEasy (estimate)
Q.4
The 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...
Quantitative Aptitude
General AptitudeMCQ1 markEasy (estimate)
Q.5
'When it is raining, peacocks dance.' Based only on this sentence, which one of the following options is necessarily true?
Analytical and Logical Reasoning
General AptitudeMCQ2 marksEasy (estimate)
Q.6
Water : P :: Food : Q Choose the P and Q combination from the options below to form a meaningful analogy.
Verbal Ability and Grammar
General AptitudeMCQ2 marksMedium (estimate)
Q.7
Two tiles are missing in Panel I. Which one of the options in Panel II is the appropriate choice for the missing tiles? Panel I shows a 3 by 3 grid of dot-pattern tiles with the...
Analytical and Logical Reasoning
General AptitudeMCQ2 marksMedium (estimate)
Q.8
Figures (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...
Analytical and Logical Reasoning
General AptitudeMCQ2 marksEasy (estimate)
Q.9
The 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 tha...
Analytical and Logical Reasoning
General AptitudeMCQ2 marksEasy (estimate)
Q.10
An 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 proba...
Quantitative Aptitude

Computer Science and Information Technology

55 questions, 85 marks

Engineering MathematicsMCQ1 markEasy (estimate)
Q.11
For 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...
Propositional and First-Order Logic
Data StructuresMCQ1 markEasy (estimate)
Q.12
The set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal. T S I: Inorder L: left subtree, node, right subtre...
Binary Trees, Binary Search Trees and Balanced Trees
Theory of ComputationMCQ1 markEasy (estimate)
Q.13
Which one of the following statements is equivalent to the following assertion? Turing machine $M$ decides the language $L \subseteq {0, 1}^{*}$
Decidability, Reducibility and Undecidability
Engineering MathematicsMCQ1 markEasy (estimate)
Q.14
The probability density function $f (x)$ of a random variable $X$ which takes real values is…
Probability and Statistics
DatabasesMCQ1 markEasy (estimate)
Q.15
In the context of DBMS, consider the two sets T and S given below. T S I: Logical schema L: Views II: Physical schema M: File organization and indexes III: External schema N: Re...
ER Model and Relational Schema Design
Digital LogicMCQ1 markEasy (estimate)
Q.16
Which one of the following options is not a property of Boolean Algebra? Note: $+$ is OR operation, $.$ is AND operation, and $^{'}$ is NOT operation
Boolean Algebra and Logic Minimization
Compiler DesignMCQ1 markEasy (estimate)
Q.17
In C runtime environment, which one of the following is stored in heap?
Runtime Environments and Parameter Passing
Computer Organization and ArchitectureMCQ1 markEasy (estimate)
Q.18
Consider 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 Se...
I/O Interface, Interrupts and DMA
Programming in CMCQ1 markEasy (estimate)
Q.19
Consider the following three ANSI-C programs, P1, P2, and P3. /* P1 / #include <stdio.h> int a=5; int main(){ int a=7; return(0); } / P2 */ #include <stdio.h> int main(){ int...
Functions, Recursion, Scope and Storage Classes
DatabasesMCQ1 markEasy (estimate)
Q.20
Consider concurrent execution of two transactions $T_{1}$ and $T_{2}$ in a DBMS, both of which access a data object $A$ . For these two transactions to not conflict on $A$ , which one...
Transactions, Serializability and Concurrency Control
Computer NetworksMCQ1 markEasy (estimate)
Q.21
Consider 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,...
OSI/TCP-IP Layering, Physical Layer and Switching
Computer NetworksMCQ1 markEasy (estimate)
Q.22
Which one of the following protocols may need to broadcast some of its messages?
Application Layer: DNS, HTTP, SMTP, FTP
Operating SystemsMCQ1 markEasy (estimate)
Q.23
Which one of the following CPU scheduling algorithms cannot be preemptive?
CPU Scheduling
AlgorithmsMCQ1 markEasy (estimate)
Q.24
Consider the following functions, where $n$ is a positive integer. $n^{1/3}, lo g (n), lo g (n!), 2^{l o g (n)}$ Which one of the following options lists the fun...
Asymptotic Analysis and Time/Space Complexity
AlgorithmsMSQ1 markEasy (estimate)
Q.25
Which of the following can be recurrence relation(s) corresponding to an algorithm with time complexity $Θ (n)$ ?
Asymptotic Analysis and Time/Space Complexity
Engineering MathematicsMSQ1 markEasy (estimate)
Q.26
Let $R$ be a binary relation on the set ${1, 2, \dots, 10}$ , where $(x, y) \in R$ if the product of $x$ and $y$ is square of an integer. Which of the following properties is/a...
Sets, Relations, Functions, Partial Orders and Lattices
Engineering MathematicsMSQ1 markEasy (estimate)
Q.27
For a real number $a$ , let $I (a) = \int_{- 1}^{1} (3 x^{2} - a x + 1) d x$ . Which of the following statements is/are true?
Calculus
Digital LogicMSQ1 markEasy (estimate)
Q.28
In a system, numbers are represented using 4-bit two's complement form. Consider four numbers $N_{1} = 1011$ , $N_{2} = 1101$ , $N_{3} = 1010$ and $N_{4} = 1001$ in the system. Which of t...
Number Representations and Computer Arithmetic
Compiler DesignMSQ1 markEasy (estimate)
Q.29
Which of the following grammars is/are ambiguous?
Parsing and Syntax Analysis (LL and LR)
Data StructuresNAT1 markEasy (estimate)
Q.30
The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h (k) = k mod 9$ . The collisions are resolved by chaining. After all the keys...
Hash Tables and Collision Resolution
Engineering MathematicsNAT1 markEasy (estimate)
Q.31
Consider the system of linear equations given below. $a x + y = b$ $16 x + a y = 24$ Suppose the values of $a$ and $b$ are chosen such that the system of linear equations produ...
Linear Algebra
AlgorithmsNAT1 markEasy (estimate)
Q.32
Consider 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 c...
Divide and Conquer
Computer NetworksNAT1 markEasy (estimate)
Q.33
If 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)
IPv4/IPv6 Addressing, Subnetting, CIDR, ARP, ICMP and NAT
Digital LogicNAT1 markEasy (estimate)
Q.34
The 32-bit IEEE 754 single precision representation of a number is 0xC2710000. The number in decimal representation is ________. (rounded off to two decimal places)
Number Representations and Computer Arithmetic
Compiler DesignNAT1 markEasy (estimate)
Q.35
A lexical analyzer uses the following token definitions - $l e tt er \to [A - Z a - z]$ - $d i g i t \to [0 - 9]$ - $i d \to l e tt er (l e tt er ∣ d i g i t)^{*}$ -…
Lexical Analysis
Engineering MathematicsMCQ2 marksMedium (estimate)
Q.36
Consider 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 se...
Graph Theory
AlgorithmsMCQ2 marksEasy (estimate)
Q.37
Let $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 t...
Single-Source and All-Pairs Shortest Paths
AlgorithmsMCQ2 marksEasy (estimate)
Q.38
Consider 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.…
Searching and Sorting Algorithms
AlgorithmsMCQ2 marksMedium (estimate)
Q.39
Consider a table $T$ , where the elements $T [i] [j]$ , $0 \leq i, j \leq n$ , represent the cost of the optimal solutions of different subproblems of a problem that is being solved us...
Dynamic Programming
Digital LogicMCQ2 marksEasy (estimate)
Q.40
Consider 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 rep...
Boolean Algebra and Logic Minimization
Compiler DesignMCQ2 marksHard (estimate)
Q.41
Consider the canonical $L R (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 \to A C B$ ...
Parsing and Syntax Analysis (LL and LR)
DatabasesMCQ2 marksEasy (estimate)
Q.42
In 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...
Functional Dependencies and Normalization
Computer NetworksMCQ2 marksEasy (estimate)
Q.43
Consider 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…
Data Link Layer: Framing, Error Detection and Sliding Window
Computer Organization and ArchitectureMCQ2 marksMedium (estimate)
Q.44
Consider 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...
Machine Instructions and Addressing Modes
Compiler DesignMCQ2 marksMedium (estimate)
Q.45
Consider the control flow graph given below. Control flow graph with ENTRY leading to basic block B1 (a = b + c); B1 branches to B2 (d = a + e) and B3 (e = a + f); B3 loops back...
Intermediate Code Generation, Data Flow Analysis and Code Optimization
DatabasesMCQ2 marksEasy (estimate)
Q.46
An 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 tw...
File Organization, B-Trees and B+ Trees Indexing
Theory of ComputationMSQ2 marksMedium (estimate)
Q.47
Consider the following two finite automata $D_{1}$ and $D_{2}$ . Two finite automata D1 and D2 over alphabet {0, 1}. D1 accepts strings formed by concatenating {000, 001, 010, 101},...
Regular Expressions, Finite Automata and Regular Languages
Theory of ComputationMSQ2 marksMedium (estimate)
Q.48
Let $Σ = {a, b, c, d}$ and let $L = {a^{i} b^{j} c^{k} d^{ℓ} ∣ i, j, k, ℓ \geq 0}$ . Which of the following constraints ensure(s) that the language $L$ is context-free?
Context-Free Grammars, Pushdown Automata and CFLs
Data StructuresMSQ2 marksMedium (estimate)
Q.49
Consider a binary search tree (BST) with $n$ leaf nodes ( $n > 0$ ). Given any node $V$ , the key present in the node is denoted as $V a l (V)$ . All the keys present in the given BST...
Binary Trees, Binary Search Trees and Balanced Trees
Data StructuresMSQ2 marksMedium (estimate)
Q.50
Consider 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 tha...
Stacks and Queues
Operating SystemsMSQ2 marksMedium (estimate)
Q.51
Consider 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...
Process Synchronization and Concurrency
Computer Organization and ArchitectureMSQ2 marksMedium (estimate)
Q.52
Consider 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...
Memory Hierarchy: Cache, Main Memory and Secondary Storage
Operating SystemsNAT2 marksMedium (estimate)
Q.53
To 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 app...
File Systems, I/O and Disk Scheduling
Operating SystemsNAT2 marksMedium (estimate)
Q.54
A 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 entr...
Memory Management and Virtual Memory
Operating SystemsNAT2 marksEasy (estimate)
Q.55
Consider 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...
Memory Management and Virtual Memory
Computer Organization and ArchitectureNAT2 marksMedium (estimate)
Q.56
Consider 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 addres...
Memory Hierarchy: Cache, Main Memory and Secondary Storage
Computer Organization and ArchitectureNAT2 marksEasy (estimate)
Q.57
A 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 performa...
Instruction Pipelining and Hazards
Computer NetworksNAT2 marksEasy (estimate)
Q.58
Consider 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 th...
Transport Layer: UDP, TCP Flow and Congestion Control, Sockets
Digital LogicNAT2 marksEasy (estimate)
Q.59
Consider 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...
Combinational Circuits
Programming in CNAT2 marksEasy (estimate)
Q.60
Consider the following ANSI-C program. #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); }...
Pointers, Arrays and Strings
Programming in CNAT2 marksMedium (estimate)
Q.61
Consider the following ANSI-C function. 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(start...
Functions, Recursion, Scope and Storage Classes
Engineering MathematicsNAT2 marksEasy (estimate)
Q.62
The determinant of a $4 \times 4$ matrix $A$ is $3$ . The value of the determinant of $2 A$ is ____________. (answer in integer)
Linear Algebra
Engineering MathematicsNAT2 marksMedium (estimate)
Q.63
Suppose 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 tosse...
Probability and Statistics
Engineering MathematicsNAT2 marksMedium (estimate)
Q.64
Consider a function $f : (0, 1) \to {0, 1}$ defined as follows. For a real number $r \in (0, 1)$ , $f (r) = 1$ if the second digit after the decimal point in $r$ is one of...
Calculus
Computer NetworksNAT2 marksMedium (estimate)
Q.65
It 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…
Data Link Layer: Framing, Error Detection and Sliding Window