Skip to content
GATETECH

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.

10 on this page
Official PYQ1999Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
Listed below are some operating system abstractions (in the left column) and the hardware components (in the right column) …
Official PYQ1999Digital LogicMinimization (K-Maps etc.)MCQ · 1 mark
Which of the following functions implements the Karnaugh map shown below?
Official PYQ1999Digital LogicBoolean AlgebraMCQ · 1 mark
Which of the following expressions is not equivalent to xˉ\bar{x}?
Official PYQ1999Theory of ComputationContext-free Grammars and Push-down AutomataMCQ · 1 mark
Context-free languages are closed under:
Official PYQ1999Theory of ComputationRegular Expressions and Finite AutomataMCQ · 1 mark
Consider the regular expression (0+1)(0+1)…N(0 + 1) (0+1) \dots N times. The minimum state finite automaton that recognizes the language represented by this regular expression contains
Official PYQ1999Engineering MathematicsCombinatorics: Counting, Recurrence Relations, Generating FunctionsMCQ · 1 mark
The number of binary strings of nn zeros and kk ones in which no two ones are adjacent is
Official PYQ1999Engineering MathematicsSets, Relations and FunctionsMCQ · 1 mark
The number of binary relations on a set with nn elements is:
Official PYQ1999Engineering MathematicsProbability: Random Variables and DistributionsMCQ · 1 mark
Suppose that the expectation of a random variable XX is 55. Which of the following statements is true?
Official PYQ1999AlgorithmsAlgorithm Design: Greedy TechniquesMCQ · 1 mark
The minimum number of record movements required to merge five files A (with 1010 records), B (with 2020 records), C (with 1515 records), D (with 55 records) and E (with 2525 records) is:
Official PYQ1999Theory of ComputationContext-free Grammars and Push-down AutomataMCQ · 1 mark
Let L1L_1 be the set of all languages accepted by a PDA by final state and L2L_2 the set of all languages accepted by empty stack. Which of the following is true?