# Tag Archives: GATE-CS-2002

From the following instance of a relation scheme R (A, B, C), we can conclude that : A B C 1 1 1 1 1… Read More
Relation R is decomposed using a set of functional dependencies, F and relation S is decomposed using another set of functional dependencies G. One decomposition… Read More
A B+ -tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8… Read More
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on : (A) the size of the… Read More
Which combination of the following features will suffice to characterize an OS as a multi-programmed OS? (a) More than one program may be loaded into… Read More
Dynamic linking can cause security concerns because: (A) Security is dynamic (B) The path for searching dynamic libraries is not known till runtime (C) Linking… Read More
To evaluate an expression without any embedded function calls: (A) One stack is enough (B) Two stacks are needed (C) As many stacks as the… Read More
The C language is: (A) A context free language (B) A context sensitive language (C) A regular language (D) Parasble fully only by a Turing… Read More
The binary relation S = ф (empty set) on set A = {1, 2, 3} is : (A) Neither reflexive nor symmetric (B) Symmetric and… Read More
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is : (A) 1/16 (B) 1/8 (C)… Read More
The Newton-Raphson iteration Xn + 1 = (Xn/2) + 3/(2Xn) can be used to solve the equation (A) X2 = 3 (B) X3 = 3… Read More
Which of the following is true? (A) The complement of a recursive language is recursive. (B) The complement of a recursively enumerable language is recursively… Read More
The smallest finite automation which accepts the language {x | length of x is divisible by 3} has : (A) 2 states (B) 3 states… Read More
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left subtree is at least half and… Read More
The running time of the following algorithm Procedure A(n) If n < = 2 return (1) else return (A(Image not present√nImage not present)); is best… Read More