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
An operating system contains user processes each requiring units of resource . The minimum number of units of such that no deadlocks will ever arise is
Which of the following languages over is accepted by a deterministic pushdown automata? Note: is the string obtained by reversing .
Which one of the following is not decidable?
Which one of the following regular expressions over denotes the set of all strings not containing as substring?
The number of equivalence relations of the set is
Let be the graph with vertices numbered to . Two vertices and are adjacent if or . The number of connected components in is
A partial order is defined on the set as for all and for all , where . The number of total orders on the set S which contain the partial order is
Consider a logic circuit shown in figure below. The functions (in canonical sum of products form in decimal notation) are : The function is
Given . The value of the radix is:
A micro instruction is to be designed to specify: none or one of the three micro operations of one kind and none or upto six micro operations of another kind The minimum number of bits in the micro-instruction is:
Let be a switching function. Which one of the following is valid?
The expression where ‘op’ is one of ‘’, ‘’ and ‘’ (exponentiation) can be evaluated on a CPU with single register without storing the value of () if
Let be the function defined by for . Which of the following statements is true?
A priority queue is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT where is an appropriate integer key chosen by the implementation. POP is implemented as DELETEMIN. For a sequence of operations, the keys chosen are in
A binary search tree contains the value . The tree is traversed in pre-order and the values are printed out. Which of the following sequences is a valid output?
A polynomial is such that and . The minimum degree it should have is
Let be an -rowed square matrix and be the matrix obtained by interchanging the first and second rows of the -rowed Identity matrix. Then is such that its first
What is the maximum value of the function in the interval ?
Dirty bit for a page in a page table
Thrashing
