Skip to content

GATE CS question library

Practise GATE CS Computer Science previous year questions free. Browse by subject, syllabus topic, year and question type, with answers and available solutions.

Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.

20 on this page
Official PYQ2015Engineering MathematicsSets, Relations and FunctionsMCQ · 1 mark
For a set AA, the power set of AA is denoted by 2A2^{A}. If A={5,{6},{7}}A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}, which of the following options are TRUE? ∅∈2A\varnothing \in 2^{A} ∅⊆2A\varnothing \subseteq 2^{A} {5,{6}}∈2A\left\{5,\left\{6\right\}\right\} \in 2^{A} {5,{6}}⊆2A\left\{5,\left\{6\right\}\right\} \subseteq 2^{A}
Official PYQ2015Engineering MathematicsSets, Relations and FunctionsMCQ · 1 mark
The binary operator ≠\neq is defined by the following truth table. …
Official PYQ2015Operating SystemI/O SchedulingNAT · 1 mark
Suppose the following disk request sequence (track numbers) for a disk with 100100 tracks is given: 45,20,90,10,50,60,80,25,70.45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is on track 5050. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN …
Official PYQ2015DatabasesTuple Calculus and SQLNAT · 1 mark
Consider the following relation: …
Official PYQ2015Programming and Data StructuresTreesMCQ · 1 mark
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 55 are
Official PYQ2015Programming and Data StructuresBinary Search TreesMCQ · 1 mark
What are the worst-case complexities of insertion and deletion of a key in a binary search tree?
Official PYQ2015DatabasesFile Organization and Indexing (B and B+ Trees)MCQ · 1 mark
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is called
Official PYQ2015Computer NetworksFragmentation and IP Addressing, IPv4, CIDRMCQ · 1 mark
Which of the following fields of an IP header is NOT modified by a typical IP router?
Official PYQ2015Digital LogicSequential CircuitsMCQ · 1 mark
Consider a 44-bit Johnson counter with an initial value of 0000.0000. The counting sequence of this counter is
Official PYQ2015Computer NetworksTransport Layer: Flow Control, Congestion Control, UDP, TCP, SocketsMCQ · 1 mark
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? If the sequence number of a segment is m,m, then the sequence number of the subsequent segment is always m+1.m+1. If the estimated round trip time at any given point of time is tt sec, the value of the …
Official PYQ2015Computer NetworksApplication Layer Protocols: DNS, SMTP, HTTP, FTP, EmailMCQ · 1 mark
In one of the pairs of protocols given below , both the protocols can use multiple TCP\textsf{TCP} connections between the same client and the server. Which one is that?
Official PYQ2015Web Technologies (Historical)MCQ · 1 mark
Which of the following statement is/are FALSE? XML overcomes the limitations in HTML to support a structured way of organizing content. XML specification is not case sensitive while HTML specification is case sensitive. XML supports user defined tags while HTML uses pre-defined tags. XML tags need not be closed while HTML tags must be closed.
Official PYQ2015Engineering MathematicsPropositional and First Order LogicMCQ · 1 mark
Which one of the following is NOT equivalent to p↔qp ↔ q?
Official PYQ2015Compiler DesignParsing (LL, LR)MCQ · 1 mark
Which one of the following is TRUE at any valid state in shift-reduce parsing?
Official PYQ2015Operating SystemMemory Management and Virtual MemoryNAT · 1 mark
Consider a system with byte-addressable memory, 32-bit32\text{-bit} logical addresses, 4  kilobyte4\;\text{kilobyte} page size and page table entries of 4  bytes4\;\text{bytes} each. The size of the page table in the system in megabytes\text{megabytes} is___________.
Official PYQ2015Programming and Data StructuresProgramming in CNAT · 1 mark
The output of the following C program is_____________. void f1 ( int a, int b) { int c; c = a; a = b; b = c; } void f2 ( int * a, int * b) { int c; c = * a; *a = *b; *b = c; } int main () { int a = 4, b = 5, c = 6; f1 ( a, b); f2 (&b, &c); printf ("%d", c - a - b); }
Official PYQ2015Programming and Data StructuresBinary Search TreesMCQ · 1 mark
Which of the following is/are correct in order traversal sequence(s) of binary search tree(s)? 3,5,7,8,15,19,253, 5, 7, 8, 15, 19, 25 5,8,9,12,10,15,255, 8, 9, 12, 10, 15, 25 2,7,10,8,14,16,202, 7, 10, 8, 14, 16, 20 4,6,7,9,18,20,254, 6, 7, 9, 18, 20, 25
Official PYQ2015Operating SystemConcurrency and SynchronizationNAT · 1 mark
The following two functions P1P1 and P2P2 that share a variable BB with an initial value of 22 execute concurrently. P1() { P2(){ C = B - 1; D = 2 * B;  B = 2 * C; B = D - 1;}}\begin{array}{|l|l|}\hline \text{P1() \{ } & \text{P2()\{} \\ \text{ C = B - 1;} & \text{ D = 2 * B; } \\ \text{ B = 2 * C;} & \text{ B = D - 1;} \\ \text{\}} & \text{\}} \\ \hline \end{array} The number of …
Official PYQ2015Compiler DesignIntermediate Code GenerationMCQ · 1 mark
For computer based on three-address instruction formats, each address field can be used to specify which of the following: (S1) A memory operand (S2) A processor register (S3) An implied accumulator register
Official PYQ2015DatabasesTuple Calculus and SQLMCQ · 1 mark
SELECT operation in SQL is equivalent to