Skip to content

Tag Archives: GATE-GATE-CS-2000

In SQL, relations can contain null values, and comparisons with null values are treated as unknown. Suppose all comparisons with a null value are treated… Read More
Given relations r(w, x) and s(y, z), the result of SELECT DISTINCT w, x FROM r, s is guaranteed to be same as r, providedAttention… Read More
Given the following relation instance. x y z 1 4 2 1 5 3 1 6 3 3 2 2 Which of the following functional… Read More
Which of the following is NOT a valid deadlock prevention scheme? (GATE CS 2000) (A) Release all resources before requesting a new resource (B) Number… Read More
Suppose the time to service a page fault is on the average 10 milliseconds, while a memory access takes 1 microsecond. Then a 99.99% hit… Read More
Given the following expression grammar: E -> E * F | F + E | F F -> F - F | id which of… Read More
The value of j at the end of the execution of the following C program. Attention reader! Don’t stop learning now.  Practice GATE exam well… Read More
Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a… Read More
Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum… Read More
Consider the following functions Which of the following is true? (A) h(n) is O(f(n))Attention reader! Don’t stop learning now.  Practice GATE exam well before the… Read More
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal, respectively, of a complete binary tree. Which of… Read More
Suppose you are given an array s[1..n] and a procedure reverse (s, i, j) which reverses the order of elements in a between positions i… Read More
Consider the values A = 2.0 x 1030, B =-2.0 x 1030, C= 1.0, and the sequence X: = A + B Y: = A… Read More
A graphics card has on board memory of 1 MB. Which of the following modes can the card not support? (A) 1600 x 400 resolution… Read More
The following arrangement of master-slave flip flops has the initial state of P, Q as 0, 1 (respectively). After three clock cycles the output state… Read More

Start Your Coding Journey Now!