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.

16 on this page
Official PYQ1991Digital LogicSequential CircuitsNAT · 1 mark
Find the maximum clock frequency at which the counter in the figure below can be operated. Assume that the propagation delay through each flip flop and each AND gate is 10  ns10\;\text{ns}. Also, assume that the setup time for the JKJK inputs of the flip flops is negligible.
Official PYQ1991Theory of ComputationRegular and Context-free LanguagesMCQ · 1 mark
Which of the following is the strongest correct statement about a finite language over some finite alphabet Σ?\Sigma?
Official PYQ1991Theory of ComputationRegular Expressions and Finite AutomataMSQ · 1 mark
Let r=1(1+0)∗,s=11∗0 and t=1∗0r=1(1+0)^*, s=11^*0 \text{ and } t=1^*0 be three regular expressions. Which one of the following is true?
Official PYQ1991Operating SystemMemory Management and Virtual MemoryMSQ · 1 mark
Indicate all the false statements from the statements given below:
Official PYQ1991Engineering MathematicsPropositional and First Order LogicMCQ · 1 mark
If F1F_1, F2F_2 and F3F_3 are propositional formulae such that F1∧F2→F3F_1 \land F_2 \rightarrow F_3 and F1∧F2→∼F3F_1 \land F_2 \rightarrow \sim F_3 are both tautologies, then which of the following is true:
Official PYQ1991Compiler DesignRuntime EnvironmentsMSQ · 1 mark
Indicate all the true statements from the following:
Official PYQ1991AlgorithmsAsymptotic Worst Case Time and Space ComplexityMCQ · 1 mark
Consider the following Pascal function: Function X(M:integer):integer; Var i:integer; Begin i := 0; while i*i < M do i:= i+1 X := i end The function call X(N)X(N), if NN is positive, will return
Official PYQ1991AlgorithmsMinimum Spanning TreesMSQ · 1 mark
Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph GG with nn vertices and mm edges has the time complexity of:
Official PYQ1991Programming and Data StructuresArrays, Stacks and QueuesMCQ · 1 mark
The following sequence of operations is performed on a stack: PUSH(10),PUSH(20),POP,PUSH(10),PUSH(20),POP,POP,POP,PUSH(20),POPPUSH (10), PUSH (20), POP, PUSH (10), PUSH (20), POP, POP, POP, PUSH (20), POP The sequence of values popped out is
Official PYQ1991Compiler DesignRuntime EnvironmentsMCQ · 1 mark
A “link editor” is a program that:
Official PYQ1991Computer Organization and ArchitectureMemory Hierarchy: Cache, Main Memory and Secondary StorageMSQ · 1 mark
The total size of address space in a virtual memory system is limited by:
Official PYQ1991Digital LogicSequential CircuitsMCQ · 1 mark
Advantage of synchronous sequential circuits over asynchronous ones is:
Official PYQ1991Programming and Data StructuresRecursionNAT · 1 mark
Consider the following recursive definition of fibfib: fib(n) := if n = 0 then 1 else if n = 1 then 1 else fib(n-1) + fib(n-2) The number of times fibfib is called (including the first call) for evaluation of fib(7)fib(7) is___________.
Official PYQ1991Programming and Data StructuresTreesNAT · 1 mark
The weighted external path length of the binary tree in figure is ______
Official PYQ1991AlgorithmsSearching, Sorting, HashingNAT · 1 mark
The minimum number of comparisons required to sort 55 elements is ______
Official PYQ1991Digital LogicNumber Representations (Fixed and Floating Point)NAT · 1 mark
Consider the number given by the decimal expression: 163∗9+162∗7+16∗5+316^3*9 + 16^2*7 + 16*5+3 The number of 1’s1’s in the unsigned binary representation of the number is ______