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 PYQ2002Computer Organization and ArchitectureMachine Instructions and Addressing ModesMCQ · 1 mark
Which of the following is not a form of memory
Official PYQ2002Digital LogicMinimization (K-Maps etc.)MCQ · 1 mark
Minimum sum of product expression for f(w,x,y,z)f(w,x,y,z) shown in Karnaugh-map below
Official PYQ2002Computer NetworksConcept of Layering: OSI and TCP/IP Protocol StacksMCQ · 1 mark
In serial data transmission, every byte of data is padded with a ′0′'0' in the beginning and one or two ′1′'1's at the end of byte because:
Official PYQ2002Computer Organization and ArchitectureI/O Interface: Interrupt and DMA ModeMCQ · 1 mark
A device employing INTR line for device interrupt puts the CALL instruction on the data bus while:
Official PYQ2002Engineering MathematicsPropositional and First Order LogicMCQ · 1 mark
"If XX then YY unless ZZ" is represented by which of the following formulas in propositional logic? ("¬\neg" is negation, "∧\land" is conjunction, and "→\rightarrow" is implication)
Official PYQ2002Theory of ComputationRegular and Context-free LanguagesMCQ · 1 mark
The language accepted by a Pushdown Automaton in which the stack is limited to 1010 items is best described as
Official PYQ2002Engineering MathematicsMonoids and GroupsMCQ · 1 mark
Which of the following is true?
Official PYQ2002Programming and Data StructuresLinked ListsMCQ · 1 mark
In the worst case, the number of comparisons needed to search a single linked list of length nn for a given element is
Official PYQ2002Engineering MathematicsGraphs: Connectivity, Matching, ColouringMCQ · 1 mark
The minimum number of colours required to colour the vertices of a cycle with nn nodes in such a way that no two adjacent nodes have the same colour is
Official PYQ2002AlgorithmsAsymptotic Worst Case Time and Space ComplexityMCQ · 1 mark
The solution to the recurrence equation T(2k)=3T(2k−1)+1,T(1)=1T(2^k) = 3T(2^{k-1})+1, T(1) =1 is
Official PYQ2002Numerical Methods (Historical)MCQ · 1 mark
The trapezoidal rule for integration gives exact result when the integrand is a polynomial of degree
Official PYQ2002Engineering MathematicsLinear Algebra: Matrices, Determinants, System of Linear EquationsMCQ · 1 mark
The rank of the matrix [1100]\begin{bmatrix} 1 & 1 \\ 0 & 0 \end{bmatrix} is
Official PYQ2001Operating SystemI/O SchedulingMCQ · 1 mark
Consider a disk with the 100100 tracks numbered from 00 to 9999 rotating at 30003000 rpm. The number of sectors per track is 100100 and the time to move the head between two successive tracks is 0.20.2 millisecond.
Official PYQ2001Operating SystemI/O SchedulingNAT · 1 mark
Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating system initiates the transfer between the disk and the memory sector-wise. Once the head has been placed on the right track, the disk reads a sector in a single scan. It reads bits from the …
Official PYQ2001DatabasesTuple Calculus and SQLMCQ · 1 mark
Consider a relation geq which represents "greater than or equal to", that is, (x,y)∈(x,y) \in geq only if y≥xy \geq x. create table geq ( ib integer not null, ub integer not null, primary key ib, foreign key (ub) references geq on delete cascade ); Which of the following is possible if tuple (x,y) is deleted?
Official PYQ2001DatabasesTuple Calculus and SQLMCQ · 1 mark
Which of the following relational calculus expression is not safe?
Official PYQ2001DatabasesNormal FormsMCQ · 1 mark
R(A,B,C,D)R(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNFBCNF decomposition?
Official PYQ2001Operating SystemConcurrency and SynchronizationMCQ · 1 mark
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag[i] = true; turn = j; while (P) do no-op; Enter critical section, perform actions, then exit critical section Flag[i] = false; Perform other non-critical section actions. Until false; For the program to …
Official PYQ2001Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
Consider a machine with 6464 MB physical memory and a 3232-bit virtual address space. If the page size s 44 KB, what is the approximate size of the page table?
Official PYQ2001Operating SystemProcesses and ThreadsMCQ · 1 mark
Which of the following does not interrupt a running process?