December 2012 >

Paper 3

December 2012

Paper 2

Paper 3

56:

If a relation with a Schema R is decomposed into two relations R1 and R2 such that (R1 ∪ R2) = R1 then which one of the following is to be satisfied for a lossless joint decomposition (---> indicates functional dependency)

A.	(R1 ∩ R2) --> R1 or R1 ∩ R2 ---> R2
B.	R1 ∩ R2 --> R1
C.	R1∩ R2 --> R2
D.	R1 ∩ R2 --> R1 and R1 ∩ R2 --> R2

Answer Report Discuss

57:

Given the following statements :
(i) Recursive enumerable sets are closed under complementation.
(ii) Recursive sets are closed under complementation.
Which is/are the correct statements ?

A.	only (i)
B.	only (ii)
C.	both (i) and (ii)
D.	neither (i) nor (ii)

Answer Report Discuss

58:

Skolmization is the process of

A.	(A) bringing all the quantifiers in the beginning of a formula in FDL
B.	removing all the universal quantifiers.
C.	removing all the existential quantifiers.
D.	all of the above.

Answer Report Discuss

59:

Which level of Abstraction describes how data are stored in the data base ?

A.	Physical level
B.	View level
C.	Abstraction level
D.	Logical level

Answer Report Discuss

60:

The transform which possesses the “multi-resolution” property is

A.	Fourier transform
B.	Short-time-Fourier transform
C.	Wavelet transform
D.	Karhunen-Loere transform

Answer Report Discuss

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15