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

General Aptitude

10 questions, 15 marks

General AptitudeMCQ1 markEasy (estimate)
Q.1
Despite 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 Ability and Grammar
General AptitudeMCQ1 markEasy (estimate)
Q.2
Bird : Nest :: Bee : _______ Select the correct option to complete the analogy.
Verbal Ability and Grammar
General AptitudeMCQ1 markEasy (estimate)
Q.3
If $P e^{x} = Q e^{- x}$ for all real values of $x$ , which one of the following statements is true?
Quantitative Aptitude
General AptitudeMCQ1 markEasy (estimate)
Q.4
The 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...
Spatial Aptitude
General AptitudeMCQ1 markEasy (estimate)
Q.5
Let $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}$ ?
Quantitative Aptitude
General AptitudeMCQ2 marksEasy (estimate)
Q.6
Based 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", Ramy...
Reading Comprehension and Verbal Deduction
General AptitudeMCQ2 marksEasy (estimate)
Q.7
If 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 and Logical Reasoning
General AptitudeMCQ2 marksEasy (estimate)
Q.8
Which 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 (Y) 20 -80 -800 -12000
Data Interpretation and Graphs
General AptitudeMCQ2 marksMedium (estimate)
Q.9
In 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...
Spatial Aptitude · Quantitative Aptitude
General AptitudeMCQ2 marksMedium (estimate)
Q.10
The 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 conne...
Analytical and Logical Reasoning

Computer Science and Information Technology

55 questions, 85 marks

Engineering MathematicsMCQ1 markEasy (estimate)
Q.11
If $A = (12 2 - 1)$ , then which ONE of the following is $A^{8}$ ?
Linear Algebra
Engineering MathematicsMCQ1 markEasy (estimate)
Q.12
The value of $x$ such that $x > 1$ , satisfying the equation $\int_{1}^{x} t ln t d t = \frac{1}{4}$ is
Calculus
Data StructuresMCQ1 markEasy (estimate)
Q.13
Consider 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…
Binary Trees, Binary Search Trees and Balanced Trees
Engineering MathematicsMCQ1 markEasy (estimate)
Q.14
Let $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 determi...
Linear Algebra
Engineering MathematicsMCQ1 markEasy (estimate)
Q.15
Let $P (x)$ be an arbitrary predicate over the domain of natural numbers. Which ONE of the following statements is TRUE?
Propositional and First-Order Logic · Combinatorics, Counting, Recurrence Relations and Generating Functions
Computer NetworksMCQ1 markEasy (estimate)
Q.16
Consider 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...
IPv4/IPv6 Addressing, Subnetting, CIDR, ARP, ICMP and NAT · Transport Layer: UDP, TCP Flow and Congestion Control, Sockets
Computer NetworksMCQ1 markEasy (estimate)
Q.17
Consider the routing protocols given in List I and the names given in List II: List I List II (i) Distance vector routing (a) Bellman-Ford (ii) Link state routing (b) Dijkstra F...
Routing Algorithms (Distance Vector, Link State) and BGP/OSPF
Computer NetworksMCQ1 markEasy (estimate)
Q.18
A 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?
IPv4/IPv6 Addressing, Subnetting, CIDR, ARP, ICMP and NAT · Routing Algorithms (Distance Vector, Link State) and BGP/OSPF
Programming in CMCQ1 markEasy (estimate)
Q.19
Consider the following C program: #include <stdio.h> void stringcopy(char *, char *); int main(){ char a[30] = "@#Hello World!"; stringcopy(a, a + 2); printf("%s\n", a); return...
Pointers, Arrays and Strings
AlgorithmsMCQ1 markEasy (estimate)
Q.20
Consider 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?
Searching and Sorting Algorithms
Compiler DesignMCQ1 markEasy (estimate)
Q.21
Consider 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 express...
Intermediate Code Generation, Data Flow Analysis and Code Optimization · Syntax-Directed Translation
Compiler DesignMCQ1 markMedium (estimate)
Q.22
Given the following syntax directed translation rules: Rule 1: $R \to A B {B . i = R . i - 1; A . i = B . i; R . i = A . i + 1;}$ Rule 2…
Syntax-Directed Translation
Computer NetworksMCQ1 markEasy (estimate)
Q.23
Consider 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...
IPv4/IPv6 Addressing, Subnetting, CIDR, ARP, ICMP and NAT
Theory of ComputationMCQ1 markEasy (estimate)
Q.24
Which ONE of the following languages is accepted by a deterministic pushdown automaton?
Context-Free Grammars, Pushdown Automata and CFLs
Theory of ComputationMCQ1 markEasy (estimate)
Q.25
Let $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...
Decidability, Reducibility and Undecidability
Operating SystemsMCQ1 markEasy (estimate)
Q.26
Processes $P_{1}, P_{2}, P_{3}, P_{4}$ 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. Sh...
CPU Scheduling
DatabasesMSQ1 markEasy (estimate)
Q.27
An 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...
Transactions, Serializability and Concurrency Control
Computer Organization and ArchitectureMSQ1 markEasy (estimate)
Q.28
Which of the following is/are part of an Instruction Set Architecture of a processor?
Machine Instructions and Addressing Modes
AlgorithmsMSQ1 markMedium (estimate)
Q.29
Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph $G$ is/are TRUE?
Graph Traversals, Topological Sort and Connectivity
Theory of ComputationMSQ1 markEasy (estimate)
Q.30
Consider the two lists List I and List II given below: List I List II (i) Context free languages (a) Closed under union (ii) Recursive languages (b) Not closed under complementa...
Context-Free Grammars, Pushdown Automata and CFLs · Decidability, Reducibility and Undecidability · Regular Expressions, Finite Automata and Regular Languages
Digital LogicMSQ1 markEasy (estimate)
Q.31
Consider the following logic circuit diagram. Logic circuit with inputs Y and X feeding three branches into a 3-input OR gate with output F: top branch is a 2-input NAND gate of...
Boolean Algebra and Logic Minimization · Combinational Circuits
Computer Organization and ArchitectureNAT1 markEasy (estimate)
Q.32
The 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…
ALU, Datapath and Control Unit · Number Representations and Computer Arithmetic
Programming in CNAT1 markEasy (estimate)
Q.33
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)
Data Types, Operators and Control Flow
Digital LogicNAT1 markEasy (estimate)
Q.34
In 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)
Sequential Circuits, Counters and Registers
Data StructuresNAT1 markEasy (estimate)
Q.35
Suppose 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...
Binary Trees, Binary Search Trees and Balanced Trees
Computer NetworksMCQ2 marksEasy (estimate)
Q.36
Suppose 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) an...
Data Link Layer: Framing, Error Detection and Sliding Window
AlgorithmsMCQ2 marksEasy (estimate)
Q.37
Let $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 st...
Minimum Spanning Trees · Single-Source and All-Pairs Shortest Paths
Data StructuresMCQ2 marksMedium (estimate)
Q.38
A 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 doub...
Arrays and Linked Lists · Binary Heaps and Priority Queues · Binary Trees, Binary Search Trees and Balanced Trees
Computer Organization and ArchitectureMCQ2 marksEasy (estimate)
Q.39
For 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...
Memory Hierarchy: Cache, Main Memory and Secondary Storage
Compiler DesignMCQ2 marksMedium (estimate)
Q.40
Given a Context-Free Grammar $G$ as follows: $S \to A a ∣ b A c ∣ d c ∣ b d a$ $A \to d$ Which ONE of the following statements is TRUE?
Parsing and Syntax Analysis (LL and LR)
AlgorithmsMCQ2 marksMedium (estimate)
Q.41
An array $A$ of length $n$ with distinct elements is said to be bitonic if there is an index $1 \leq i \leq n$ such that $A [1.. i]$ is sorted in the non-decreasing order and…
Searching and Sorting Algorithms · Divide and Conquer
Engineering MathematicsMSQ2 marksEasy (estimate)
Q.42
Let $F$ be the set of all functions from ${1, \dots, n}$ to ${0, 1}$ . Define the binary relation $≼$ on $F$ as follows…
Sets, Relations, Functions, Partial Orders and Lattices
Digital LogicMSQ2 marksEasy (estimate)
Q.43
Given the following Karnaugh Map for a Boolean function $F (w, x, y, z)$ : 4 by 4 Karnaugh Map for F(w, x, y, z) with row variables wx and column variables yz; rows 1 and 4 are 1,...
Boolean Algebra and Logic Minimization
Engineering MathematicsMSQ2 marksEasy (estimate)
Q.44
Consider a system of linear equations $P X = Q$ where $P \in R^{3 \times 3}$ and $Q \in R^{3 \times 1}$ . Suppose $P$ has an LU decomposition, $P = LU$ , where…
Linear Algebra
Data StructuresMSQ2 marksEasy (estimate)
Q.45
Consider 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...
Stacks and Queues
DatabasesMSQ2 marksMedium (estimate)
Q.46
Consider the following relational schema along with all the functional dependencies that hold on them.…
Functional Dependencies and Normalization
Operating SystemsMSQ2 marksMedium (estimate)
Q.47
Consider 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...
Memory Management and Virtual Memory
Operating SystemsMSQ2 marksMedium (estimate)
Q.48
$P = {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...
Deadlock Prevention, Avoidance and Detection
Computer Organization and ArchitectureMSQ2 marksEasy (estimate)
Q.49
Three 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:...
ALU, Datapath and Control Unit · Number Representations and Computer Arithmetic
Digital LogicMSQ2 marksMedium (estimate)
Q.50
Which of the following Boolean algebraic equation(s) is/are CORRECT?
Boolean Algebra and Logic Minimization
Compiler DesignMSQ2 marksHard (estimate)
Q.51
Consider two grammars $G_{1}$ and $G_{2}$ with the production rules given below…
Parsing and Syntax Analysis (LL and LR)
Theory of ComputationMSQ2 marksEasy (estimate)
Q.52
Let $Σ = {a, b, c}$ . For $x \in Σ^{*}$ , and $α \in Σ$ , let $#_{α} (x)$ denote the number of occurrences of $α$ in $x$ . Which one or more of the follo...
Regular Expressions, Finite Automata and Regular Languages
DatabasesMSQ2 marksEasy (estimate)
Q.53
Consider the database transactions T1 and T2, and data items X and Y. Which of the schedule(s) is/are conflict serializable? Transaction T1 Transaction T2 R1(X) W2(X) W1(Y) W2(Y...
Transactions, Serializability and Concurrency Control
DatabasesMSQ2 marksEasy (estimate)
Q.54
Consider the following relational schema: Students (rollno: integer, name: string, age: integer, cgpa: real) Courses (courseno: integer, cname: string, credits: integer)…
SQL Queries and Integrity Constraints
Computer Organization and ArchitectureNAT2 marksEasy (estimate)
Q.55
Given 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 9...
Memory Hierarchy: Cache, Main Memory and Secondary Storage
Computer Organization and ArchitectureNAT2 marksEasy (estimate)
Q.56
A 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 th...
Instruction Pipelining and Hazards
DatabasesNAT2 marksMedium (estimate)
Q.57
In a $B^{+}$ -tree where each node can hold at most four key values, a root to leaf path consists of the following nodes…
File Organization, B-Trees and B+ Trees Indexing
Operating SystemsNAT2 marksEasy (estimate)
Q.58
A 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…
Memory Management and Virtual Memory
AlgorithmsNAT2 marksMedium (estimate)
Q.59
Consider 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 i...
Graph Traversals, Topological Sort and Connectivity
Theory of ComputationNAT2 marksMedium (estimate)
Q.60
Let $Σ = {1, 2, 3, 4}$ . For $x \in Σ^{*}$ , let $p r o d (x)$ be the product of symbols in $x$ modulo $7$ . We take $p r o d (ϵ) = 1$ , where $ϵ$ is the null string...
Regular Expressions, Finite Automata and Regular Languages
Computer Organization and ArchitectureNAT2 marksEasy (estimate)
Q.61
An application executes $6.4 \times 1 0^{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...
ALU, Datapath and Control Unit · Instruction Pipelining and Hazards
Programming in CNAT2 marksEasy (estimate)
Q.62
Consider the following C program: #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)...
Pointers, Arrays and Strings
Programming in CNAT2 marksEasy (estimate)
Q.63
Consider the following C program: #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...
Functions, Recursion, Scope and Storage Classes
Engineering MathematicsNAT2 marksMedium (estimate)
Q.64
A quadratic polynomial $(x - α) (x - β)$ over complex numbers is said to be square invariant if $(x - α) (x - β) = (x - α^{2}) (x - β^{2})$ . Suppose from the...
Probability and Statistics · Combinatorics, Counting, Recurrence Relations and Generating Functions
Engineering MathematicsNAT2 marksMedium (estimate)
Q.65
The 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 subinterva...
Probability and Statistics · Calculus