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.

17 on this page
Official PYQ1990Operating SystemMemory Management and Virtual MemoryNAT · 1 mark
In a two-level virtual memory, the memory access time for main memory, tM=10−8t_{M}=10^{-8} sec, and the memory access time for the secondary memory, tD=10−3t_D=10^{-3} sec. What must be the hit ratio, HH such that the access efficiency is within 8080 percent of its maximum value?
Official PYQ1990Computer Organization and ArchitectureMemory Hierarchy: Cache, Main Memory and Secondary StorageNAT · 1 mark
A block-set associative cache memory consists of 128128 blocks divided into four block sets. The main memory consists of 16,38416, 384 blocks and each block contains 256256 eight bit words. How many bits are required for addressing the main memory? How many bits are needed to represent the TAG, SET and WORD fields?
Official PYQ1990Compiler DesignRuntime EnvironmentsNAT · 1 mark
State whether the following statements are TRUE or FALSE with reason: The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
Official PYQ1990Computer Organization and ArchitectureMachine Instructions and Addressing ModesNAT · 1 mark
State whether the following statements are TRUE or FALSE with reason: The flags are affected when conditional CALL or JUMP instructions are executed.
Official PYQ1990Computer Organization and ArchitectureI/O Interface: Interrupt and DMA ModeNAT · 1 mark
State whether the following statements are TRUE or FALSE with reason: The data transfer between memory and I/O devices using programmed I/O is faster than interrupt-driven I/O.
Official PYQ1990Digital LogicCombinational CircuitsNAT · 1 mark
State whether the following statements are TRUE or FALSE with reason: RAM is a combinational circuit and PLA is a sequential circuit.
Official PYQ1990Engineering MathematicsGraphs: Connectivity, Matching, ColouringMCQ · 1 mark
A graph is planar if and only if,
Official PYQ1990Engineering MathematicsPropositional and First Order LogicMCQ · 1 mark
Indicate which of the following well-formed formulae are valid:
Official PYQ1990Engineering MathematicsCombinatorics: Counting, Recurrence Relations, Generating FunctionsMCQ · 1 mark
The number of ways in which 5  A′s,5  B′s5\; A's, 5\; B's and 5  C′s5\; C's can be arranged in a row is:
Official PYQ1990Theory of ComputationRegular and Context-free LanguagesMSQ · 1 mark
Let R1R_{1} and R2R_{2} be regular sets defined over the alphabet Σ\Sigma Then:
Official PYQ1990Theory of ComputationUndecidabilityMSQ · 1 mark
It is undecidable whether:
Official PYQ1990Theory of ComputationTuring MachinesMSQ · 1 mark
Recursive languages are:
Official PYQ1990AlgorithmsSearching, Sorting, HashingMCQ · 1 mark
The complexity of comparison based sorting algorithms is:
Official PYQ1990Programming and Data StructuresTreesMCQ · 1 mark
The total external path length, EPL,\text{EPL}, of a binary tree with nn external nodes is, EPL=∑wIw\text{EPL}= \displaystyle \sum_{w} I_w, where IwI_{w} is the path length of external node ww),
Official PYQ1990Engineering MathematicsCombinatorics: Counting, Recurrence Relations, Generating FunctionsMSQ · 1 mark
The number of rooted binary trees with nn nodes is,
Official PYQ1990DatabasesNormal FormsMSQ · 1 mark
Indicate which of the following statements are true: A relational database which is in 33NF may still have undesirable data redundancy because there may exist:
Official PYQ1990Digital LogicCombinational CircuitsMCQ · 1 mark
Choose the correct alternatives (More than one may be correct). Two NAND gates having open collector outputs are tied together as shown in below figure. The logic function Y,Y, implemented by the circuit is,