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
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered: …
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?
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?
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.
If an instruction takes microseconds and a page fault takes an additional microseconds, the effective instruction time if on the average a page fault occurs every instruction is:
Consider processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes seconds, what must be the quantum size 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 seconds?
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?
Faster access to non-local variables is achieved using an array of pointers to activation records called a
Let 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 , what is the address of the element ?
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
What value would the following function return for the input ? Function fun (x:integer):integer; Begin If x > 100 then fun = x – 10 Else fun = fun(fun (x+11)) End;
A complete -ary tree is one in which every node has or sons. If is the number of internal nodes of a complete -ary tree, the number of leaves in it is given by
The address space of CPU is
Which of the following operations is commutative but not associative?
Formatting for a floppy disk refers to
The function represented by the Karnaugh map given below is
Which of the following statements is false?
Let 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 is
In a room containing people, there are people who speak English, people who speak Hindi and people who speak Kannada. persons speak both English and Hindi, persons speak both Hindi and Kannada whereas persons speak both Kannada and English. How many speak all three languages?
The binary relation on the set is
