In 2NF
No partial functional dependencies exist
Well Done. Your Answer is Correct Keep it Up!
No partial multivalued dependencies exist.
No multivalued dependencies exist.
No functional dependencies exist.
Dependency preservation is not guaranteed in
Dependency preservation is not guaranteed in
BCNF
Well Done. Your Answer is Correct Keep it Up!
3NF
4NF
DKNF
If two relations R and S are joined, then the non matching ruples of both R and S are ignored in
If two relations R and S are joined, then the non matching ruples of both R and S are ignored in
inner join
Well Done. Your Answer is Correct Keep it Up!
full outer join
right outer join
left outer join
Fifth Normal form is concerned with
Fifth Normal form is concerned with
Join dependency
Well Done. Your Answer is Correct Keep it Up!
Functional dependency
Multivalued dependency
Domain key
The operation which is not considered a basic operation of relational algebra is
The operation which is not considered a basic operation of relational algebra is
Join
Well Done. Your Answer is Correct Keep it Up!
Selection
Union
Cross product
Relational Algebra does not have
Relational Algebra does not have
Aggregation operator
Well Done. Your Answer is Correct Keep it Up!
Division operator
Projection operator
Selection operator
The rule that a value of a foreign key must appear as a value of some specific table is called a
The rule that a value of a foreign key must appear as a value of some specific table is called a
Referential constraint
Well Done. Your Answer is Correct Keep it Up!
Index
Integrity constraint
Functional dependency
If an entity can belong to only one lower level entity then the constraint is
If an entity can belong to only one lower level entity then the constraint is
partial
Well Done. Your Answer is Correct Keep it Up!
disjoint
overlapping
single
The common column is eliminated in
The common column is eliminated in
natural join
Well Done. Your Answer is Correct Keep it Up!
outer join
theta join
composed join
Relationships among relationships can be represented in an E-R model using
Relationships among relationships can be represented in an E-R model using
Aggregation
Well Done. Your Answer is Correct Keep it Up!
Association
Weak entity sets
Weak relationship sets