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.

20 on this page
Official PYQ1998Operating SystemCPU SchedulingNAT · 1 mark
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered: …
Official PYQ1998Engineering MathematicsProbability: Random Variables and DistributionsNAT · 1 mark
Two friends agree to meet at a park with the following conditions. Each will reach the park between 4:00 pm and 5:00 pm and will see if the other has already arrived. If not, they will wait for 10 minutes or the end of the hour whichever is earlier and leave. What is the probability that the two will not meet?
Official PYQ1998Digital LogicNumber Representations (Fixed and Floating Point)MCQ · 1 mark
Suppose the domain set of an attribute consists of signed four digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an integer rather than in character form?
Official PYQ1998DatabasesTuple Calculus and SQLMCQ · 1 mark
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is incorrect? R1 and R2 are relations, C1 and C2 are selection conditions and A1 and A2 are attributes of R1.
Official PYQ1998Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
If an instruction takes ii microseconds and a page fault takes an additional jj microseconds, the effective instruction time if on the average a page fault occurs every kk instruction is:
Official PYQ1998Operating SystemCPU SchedulingMCQ · 1 mark
Consider nn processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes ss seconds, what must be the quantum size qq such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get its turn at the CPU at least every tt seconds?
Official PYQ1998Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) required to load (and run) this program?
Official PYQ1998Compiler DesignRuntime EnvironmentsMCQ · 1 mark
Faster access to non-local variables is achieved using an array of pointers to activation records called a
Official PYQ1998Programming and Data StructuresArrays, Stacks and QueuesMCQ · 1 mark
Let AA be a two dimensional array declared as follows: A: array [1 …. 10] [1 ….. 15] of integer; Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location 100100, what is the address of the element A[i][j]A[i][j]?
Official PYQ1998Programming and Data StructuresProgramming in CMCQ · 1 mark
What is the result of the following program? program side-effect (input, output); var x, result: integer; function f (var x:integer):integer; begin x:x+1;f:=x; end begin x:=5; result:=f(x)*f(x); writeln(result); end
Official PYQ1998AlgorithmsAsymptotic Worst Case Time and Space ComplexityMCQ · 1 mark
What value would the following function return for the input x=95x=95? Function fun (x:integer):integer; Begin If x > 100 then fun = x – 10 Else fun = fun(fun (x+11)) End;
Official PYQ1998Programming and Data StructuresTreesMCQ · 1 mark
A complete nn-ary tree is one in which every node has 00 or nn sons. If xx is the number of internal nodes of a complete nn-ary tree, the number of leaves in it is given by
Official PYQ1998Computer Organization and ArchitectureMachine Instructions and Addressing ModesMCQ · 1 mark
The address space of 80868086 CPU is
Official PYQ1998Digital LogicBoolean AlgebraMCQ · 1 mark
Which of the following operations is commutative but not associative?
Official PYQ1998Operating SystemI/O SchedulingMCQ · 1 mark
Formatting for a floppy disk refers to
Official PYQ1998Digital LogicMinimization (K-Maps etc.)MCQ · 1 mark
The function represented by the Karnaugh map given below is
Official PYQ1998Theory of ComputationRegular and Context-free LanguagesMCQ · 1 mark
Which of the following statements is false?
Official PYQ1998Theory of ComputationRegular Expressions and Finite AutomataMCQ · 1 mark
Let LL be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting LL is
Official PYQ1998Engineering MathematicsSets, Relations and FunctionsMCQ · 1 mark
In a room containing 2828 people, there are 1818 people who speak English, 1515 people who speak Hindi and 2222 people who speak Kannada. 99 persons speak both English and Hindi, 1111 persons speak both Hindi and Kannada whereas 1313 persons speak both Kannada and English. How many speak all three languages?
Official PYQ1998Engineering MathematicsSets, Relations and FunctionsMCQ · 1 mark
The binary relation R={(1,1),(2,1),(2,2),(2,3),(2,4),(3,1),(3,2),(3,3),(3,4)}R = \{(1, 1), (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2), (3, 3), (3, 4)\} on the set A={1,2,3,4}A=\{1, 2, 3, 4\} is