GATE CSE 2002
Q11.
The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children isQ12.
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 is definitely BCNF , the other is definitely. 3NF , but it is not known which is which. To make a guaranteed identification, which one of the following tests should be used on the decompositions ? (Assume that the closures of F and G are available).Q13.
Relation R with an associated set of functional dependencies, F , is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is.Q14.
In serial data transmission, every byte of data is padded with a '0' in the beginning and one or two '1's at the end of byte becauseQ15.
The Newton-Raphson iteration X_{n+1}=(X_{n}/2)+(3/(2X_{n})) can be used to solve the equationQ16.
The trapezoidal rule for integration gives exact result when the integrand is a polynomial of degreeQ17.
The language accepted by a Pushdown Automaton in which the stack is limited to 10 items is best described asQ19.
The running time of the following algorithm Procedure A(n) If n \leq 2 return (1) else return (A(\sqrt{n})); is best discribed by