Q. A relation R = {A, B, C, D, E, F} is given with following set of functional dependencies:

F = {A→B, AD→C, B→F, A→E}

Which of the following is candidate key ?

View solution

Q. Immediate updates as a recovery protocol is preferable, when:

View solution

Q. Which of the following statement is wrong ?

View solution

Q. A subclass having more than one super class is called .................

View solution

Q. A schema describes:

View solution

Q. One approach to standardizing storing of data:

View solution

Q. In a relational schema, each tuple is divided in fields called:

View solution

Q. An embedded pointer provides:

View solution

Q. A locked file can be:

View solution

Q. An Entity - relationship diagram is a tool to represent:

View solution

Q. Multi-valued dependency among attribute is checked at which level ?

View solution

Q. A WINDOW into a portion of a data base is:

View solution

Q. The E-R model is expressed in terms of:

(i) Entities
(ii) The relationship among entities
(iii) The attributes of the entities

View solution

Q. Specialization is a ............... process.

View solution

Q. The completeness constraint has rules:

View solution

Q. The entity type on which the ................. type depends is called the identifying owner.

View solution

Q. Match the following:

(i) 5 NF              (a) Transitive dependencies eliminated
(ii) 2 NF             (b) Multivalued attribute removed
(iii) 3 NF            (c) Contains no partial functional dependencies
(iv) 4 NF            (d) Contains no join dependency

View solution

Q. The normalization of 1NF relations to 2NF involves:

View solution

Q. Tuple in relational algebra refers to:

View solution

Q. A relation R on a set X is said to be a partial ordering if R is

View solution