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
A Boolean function is to be realized only by gates. Its -map is given below: The realization is
The below figure shows four -type flip-flops connected as a shift register using a gate. The initial state and three subsequent states for three clock pulses are also given. …
The Boolean expression is equivalent to
State whether the following statements are TRUE or FALSE: A relation with schema satisfies the function dependency , The tuples and can both be in simultaneously.
State whether the following statements are TRUE or FALSE: The problem as to whether a Turing machine accepts input is undecidable.
State whether the following statement are TRUE or FALSE. is recursive if both and its complement are accepted by Turing machines.
State whether the following statements are TRUE or FALSE: The intersection of two CFL's is also a CFL.
State whether the following statements are TRUE or FALSE: A minimal DFA that is equivalent to an NDFA with nodes has always states.
State whether the following statements are TRUE or FALSE: Regularity is preserved under the operation of string reversal.
State whether the following statements are TRUE or FALSE: All subsets of regular sets are regular.
State whether the following statements are TRUE or FALSE: If the number of leaves in a tree is not a power of then the tree is not a binary tree.
State whether the following statements are TRUE or FALSE: The union of two equivalence relations is also an equivalence relation.
State whether the following statements are TRUE or FALSE: It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?
State whether the following statements are TRUE or FALSE: Data transfer between a microprocessor and an I/O device is usually faster in memory-mapped-I/O scheme than in I/O-mapped -I/O scheme.
State whether the following statements are TRUE or FALSE In a microprocessor-based system, if a bus (DMA) request and an interrupt request arrive sumultaneously, the microprocessor attends first to the bus request.
If then
The simplex method is so named because
A square matrix is singular whenever
The equation has
If and are constants, which of the following is a linear inequality?
