RDBMS Questions and relation that is a primary key of another

relation
Answers – Introduction to d) A foreign key is the primary key of a
the Relational Model relation that does not occur anywhere
else in the schema
This set of RDBMS Multiple Choice View Answer
Questions & Answers (MCQs) focuses Answer: c
on “Introduction to the Relational Explanation: A foreign key is an attribute of
Model”. a relation that is initially a primary key of
another relation. A foreign key usage
1. Choose the correct statement preserves referential integrity.
regarding superkeys 4. What action does ⋈ operator perform
a) A superkey is an attribute or a group
in relational algebra
of multiple attributes that can uniquely a) Output specified attributes from all
identify a tuple
rows of the input relation and remove
b) A superkey is a tuple or a set of duplicate tuples from the output
multiple tuples that can uniquely identify
b) Outputs pairs of rows from the two
an attribute input relations that have the same value
c) Every superkey is a candidate key on all attributes that have the same
d) A superkey is an attribute or a set of
name
attributes that distinguish the relation c) Output all pairs of rows from the two
from other relations
input relations (regardless of whether or
View Answer
not they have the same values on
Answer: a common attributes)
Explanation: A superkey is an attribute or a d) Return rows of the input relation that
set of multiple attributes that can uniquely satisfy the predicate
identify a tuple. It is used to differentiate View Answer
between tuples.
2. What is an Instance of a Database? Answer: a
a) The logical design of the database Explanation: ⋈ Outputs specified attributes
system from all rows of the input relation. Remove
duplicate tuples from the output. The
b) The entire set of attributes of the
operation is called the join operation.
Database put together in a single
5. What does the “x” operator do in
relation
relational algebra?
c) The state of the database system at
a) Output specified attributes from all
any given point of time
rows of the input relation. Remove
d) The initial values inserted into the
duplicate tuples from the output
Database immediately after its creation
b) Output pairs of rows from the two
View Answer
input relations that have the same value
Answer: c on all attributes that have the same
Explanation: The state of the database name
system at any given point of time is called c) Output all pairs of rows from the two
as an Instance of the database. input relations (regardless of whether or
3. What is a foreign key? not they have the same values on
a) A foreign key is a primary key of a common attributes)
relation which is an attribute in another d) Returns the rows of the input relation
relation that satisfy the predicate
b) A foreign key is a superkey of a View Answer
relation which is an attribute in more
than one other relations Answer: c
c) A foreign key is an attribute of a Explanation: The “x” operator outputs all
pairs of rows from the two input relations join of book and borrow wherever the
(regardless of whether or not they have the year is lesser than 2009
same values on common attributes). This c) Selects all the tuples from the natural
operation is called as the Cartesian product join of book and student wherever the
operation and is similar to the Cartesian
year is greater than or equal to 2009
product of sets.
d) Selects all tuples from the Cartesian
6. An attribute is a __________ in a
product of book and borrow wherever
relation.
the year is greater than or equal to 2009
a) Row
View Answer
b) Column
c) Value Answer: b
d) Tuple Explanation: The condition under the select
View Answer statement represents the condition that must
be satisfied by the tuples and the symbol ⋈
Answer: b represents natural join between the two
Explanation: An attribute is a column in a relations on either side of the operator.
relation. A tuple is a row in a relation. 10. State true or false: If a relation
7. What is the method of specifying a consists of a foreign key, then it is called
primary key in a schema description? a referenced relation of the foreign key
a) By writing it in bold letters dependency.
b) By underlining it using a dashed line a) True
c) By writing it in capital letters b) False
d) By underlining it using a bold line View Answer
View Answer
Answer: b
Answer: d Explanation: If a relation has a foreign key,
Explanation: We can specify a primary key then it is called a referencing relation of the
in schema description by underlining the foreign key dependency.
respective attribute with a bold line.
8. Statement 1: A tuple is a row in a
relation RDBMS Questions and
Statement 2: Existence of multiple
foreign keys in a same relation is
Answers – SQL Data
possible definition
a) Both the statements are true
b) Statement 1 is correct but Statement This set of RDBMS Multiple Choice
2 is false Questions & Answers (MCQs) focuses
c) Statement 1 is false but Statement 2 on “SQL Data Definition”.
is correct 1. Which of the following information
d) Both the statements are false does an SQL DDL not specify?
View Answer a) The schema for each relation
Answer: a b) The integrity constraints
Explanation: A tuple is a row is a relation. c) The operations on the tuples
There can exist multiple foreign keys in the d) The security and authorization
same relation because there can exist information for each relation
multiple attributes in the relation that are View Answer
primary keys in two or more other relations.
9. Choose the option that correctly Answer: c
explains in words, the function of the Explanation: The SQL DDL does not specify
following relational algebra expression the operations that are supposed to be
made on the tuples. DDL means Data
σyear≥2009 (book ⋈ borrow)
definition language, hence it does not
a) Selects all tuples from the Cartesian include the operations made.
product of book and borrow 2. Which of the following data types
b) Selects all the tuples from the natural does the SQL standard not support?
a) char(n) database?
b) String(n) a) drop table R
c) varchar(n) b) drop relation R
d) float(n) c) delete table R
View Answer d) delete from R
View Answer
Answer: b
Explanation: The SQL standard does not Answer: a
support String(n) but it supports char, Explanation: The drop table command is
varchar and float. used to delete a relation from a database
3. Which command is used to create a whereas the delete table removes all the
new relation in SQL tuples from a relation
a) create table( , …) 7. Which of the following commands do
b) create relation( , …) we use to delete all the tuples from a
c) new table( , …) relation (R)?
d) new relation( , …) a) delete table R
View Answer b) drop table R
c) delete from R
Answer: a
d) drop from R
Explanation: We use the create table
command to create a new relation in the
View Answer
database. The syntax is Answer: c
create table( , …); Explanation: The delete from command is
4. If a1, a2, a3 are attributes in a relation used to delete all the tuples in a relation.
and S is another relation, which of the The drop table totally deletes a relation.
following is an incorrect specification of 8. Choose the correct command to
an integrity constraint? delete an attribute A from a relation R
a) primary key(a1, a2, a3) a) alter table R delete A
b) primary key(a1) b) alter table R drop A
c) foreign key(a1, a2) references S c) alter table drop A from R
d) foreign key(a1, a2) d) delete A from R
View Answer View Answer
Answer: d Answer: b
Explanation: Whenever the integrity Explanation: We can delete an attribute from
constraint foreign key is mentioned, the a relation using the alter table command
attributes that are the foreign keys should with the following syntax
always be referenced from the relation in alter table drop
which they are primary keys. 9. create table apartment(ownerID
5. What is the syntax to load data into varchar (5), ownername varchar(25),
the database? (Consider D as the floor numeric(4,0), primary key
database and a, b, c as data) (ownerID));
a) enter into D (a, b, c); Choose the correct option regarding the
b) insert into D values (a, b, c); above statement
c) insert into D (a, b, c); a) The statement is syntactically wrong
d) insert (a, b, c) values into D; b) It creates a relation with three
View Answer attributes ownerID, ownername, floor in
Answer: b
which floor cannot be null.
Explanation: To load data into a database c) It creates a relation with three
we use the insert into command. The syntax attributes ownerID, ownername, floor in
is which ownerID cannot be null.
insert into D values (a, b, c) where a, b, c d) It creates a relation with three
are the appropriate values attributes ownerID, ownername, floor in
6. Which of the following commands do which ownername must consist of at
we use to delete a relation (R) from a
least 25 characters. d) include
View Answer View Answer
Answer: c Answer: a
Explanation: It creates a relation apartment Explanation: The “all” keyword is used
with three attributes as specified. The beside the select clause to explicitly specify
attribute ownername cannot be null because that duplicates are not removed.
it is the primary key of the relation. 3. Which of the following logical
10. What does the notnull integrity connectives is not included in SQL?
constraint do? a) and
a) It ensures that at least one tuple is b) or
present in the relation c) nor
b) It ensures that at least one foreign d) not
key is present in the relation View Answer
c) It ensures that all tuples have a finite
Answer: d
value on a specified attribute
Explanation: “not” is not a logical connective
d) It ensures that all tuples have finite included in the SQL. The and, or and nor
attributes on all the relations are logical connectives that are included in
View Answer SQL.
Answer: c 4. The where clause is a predicate
Explanation: The notnull integrity constraint involving attributes of the relation in the
ensures that all the tuples have a finite value ______ clause.
on the specified attribute in the relation. It a) select
avoids the specification of null values. b) from
c) with
d) none of the mentioned
RDBMS Questions and View Answer
Answers – Basic Operations Answer: b
Explanation: The “from” clause contains the
This set of RDBMS Multiple Choice attribute names on which the “which” clause
Questions & Answers (MCQs) focuses can be used on.
on “Basic Operations”. 5. select distinct dept_name
1. Which of the following syntax of the from institute;
basic query is correct? What does the above query do?
a) select <relation> from <attribute> a) It gives all the tuples having a distinct
b) select <attribute> from <elation> dept_name
c) select <tuple> from <relation> b) It gives the dept_name attribute
d) select <tuple> from <attribute> values of all tuples without repetition
View Answer c) It gives all the dept_name attribute of
Answer: b all the tuples
Explanation: The select clause is used to d) It gives all the tuples having a null
select a specific attribute from a given value under the dept_name attribute
relation. So, the syntactically correct View Answer
statement is select <attribute> from
<relation>. Answer: b
Explanation: The distinct keyword is used to
2. Which of the following keywords is
explicitly force the elimination of duplicate
used beside the select clause to tuples. Thus, the above query excludes
explicitly specify that duplicates are not duplicates.
removed? 6. What does the following query do?
a) all select name, ID, branch
b) not unique from student, department
c) notnull where student.branch =
4. What are composite attributes? entity-relationship model to uniquely identify
a) They are those attributes which the entity in the entity set.
cannot be further divided into other advertisement
attributes
8. State true or false: Multiple attributes
b) They are those attributes which can
combined together can be primary keys
further be divided into other attributes
a) True
c) They are those attributes which are
b) False
essentially the primary keys of the
View Answer
relation
d) None of the mentioned Answer: a
View Answer Explanation: A primary key is an attribute or
a set of attributes that can uniquely identify
Answer: b a tuple in a relation. So, this means that
Explanation: Composite attributes are the multiple attributes can be combined to
ones which can be further divided into other uniquely identify a tuple in a relation.
attributes whereas simple attributes cannot 9. Which of the following is a good
be divided into other attributes. database management practice?
5. Let E be an entity set in a relationship a) Adding redundant attributes
set R. If every entity in E participates in b) Removing redundant attributes
at least one relationships in R, Then the c) Not specifying primary keys
participation of E in R is __________ d) None of the mentioned
a) Partial View Answer
b) Total
c) Complete Answer: b
d) Incomplete Explanation: Removing redundant attributes
View Answer from a relation makes data extraction more
efficient and faster. Thus, it is a good
Answer: Total database management technique.
Explanation: Let E be an entity set in a
relationship set R. If every entity in E
participates in at least one relation in R, RDBMS Questions and
Then the participation of E in R is total.
6. Let E be an entity set in a relationship
Answers – Entity
set R. If only some entities in E Relationship Diagrams
participate in relationships in R, Then
the participation of E in R is __________ This set of RDBMS Multiple Choice
a) Partial Questions & Answers (MCQs) focuses
b) Total on “Entity Relationship Diagrams”.
c) Complete
1. Which of the following symbols
d) Incomplete
represent entity sets in an ER diagram?
View Answer
a) Divided rectangles
Answer: Total b) Diamonds
Explanation: Let E be an entity set in a c) Lines
relationship set R. If only some entities in E d) Undivided rectangles
participate in relationships in R, Then the View Answer
participation of E in R is partial.
7. State true or false: We cannot specify Answer: a
keys in the Entity-Relationship model Explanation: Rectangles divided into two
a) True parts represent entity sets in an ER
diagram. The upper rectangle contains the
b) False
name of the entity sets. And the lower
View Answer rectangle contains the attributes.
Answer: b 2. Which of the following symbols
Explanation: Keys can be specified in the represent relationship sets in an ER
diagram a) Using a solid line
a) Divided rectangles b) Circling it
b) Diamonds c) Using a dashed line
c) Lines d) Drawing a square around it
d) Undivided rectangles View Answer
View Answer
Answer: c
Answer: b Explanation: A discriminator of a weak entity
Explanation: Diamonds represent set can be specified by underlining it with a
relationship sets in an ER diagram. dashed line.
Relationship sets define how two entity sets 7. An entity set that has a primary key is
are related in a database. called as ___________
3. What do double diamonds represent a) Strong entity set
in an ER diagram b) Weak entity set
a) They link entity sets to relationship c) Complete entity set
sets d) None of the mentioned
b) Total participation of an entity in a View Answer
relationship set
Answer: a
c) Relationship sets linked to weak entity
Explanation: An entity set that has a primary
sets key is called as a strong entity set. An entity
d) None of the mentioned set that does not have a primary key is
View Answer called a weak entity set.
Answer: c 8. The relationship associating the weak
Explanation: The double diamonds entity sets with the identifying entity set
represent the relationship sets linked to is called as ________
weak entity sets. Weak entity sets are the a) Identifying relationship
sets that do not have a primary key. b) Connecting relationship
4. What does a directed line ( → ) from a c) Completing relationship
relationship set to two entity sets mean? d) Unique relationship
a) One-one View Answer
b) Many-one
Answer: a
c) Many-many
Explanation: The relationship associating
d) One-many the weak entity sets with the identifying
View Answer entity set is called as an Identifying
Answer: a relationship. An identifying set is a many to
Explanation: A directed line ( → ) from a one from the weak entity set to the
relationship set to two entity sets means that identifying entity set.
there is a one-one cardinality between two 9. State true or false: Every weak entity
entity sets. set must be associated with an
5. How are roles specified in an ER identifying entity
diagram a) True
a) By labelling the rectangles b) False
b) By labelling the diamonds View Answer
c) Roles cannot be specified in an ER Answer: a
diagram Explanation: Every weak entity set must be
d) By labelling the lines associated with an identifying entity. The
View Answer weak entity is then said to be existence
dependent on the identifying entity set.
Answer: E-R diagrams can include role
indicators. Roles can be specified in an ER 10. State true or false: A weak entity can
diagram by labelling the lines. participate in all the relationships.
6. How is the discriminator of a weak a) True
entity set specified? b) False
View Answer
Answer: b Answer: a
Explanation: It cannot participate in all the Explanation: The primary key of the
relationships. A weak entity set can only representation of a weak entity set consists
participate in relationships other than the of the primary key of the strong entity set
identifying relationship. and the discriminator of the weak entity set.
4. For a binary many to many
relationship, the ________ of the
RDBMS Questions and participating entity sets becomes the
Answers – Reduction to prime attribute
a) Intersection of primary keys
Relational Schema b) Primary key of either one
c) Union of primary keys
This set of RDBMS Interview Questions
d) Primary key on the many side
and Answers for Experienced people View Answer
focuses on “Reduction to Relational
Schema”. Answer: c
Explanation: For a binary many to many
1. For schemas derived from strong relationship, the union of the primary keys of
entity sets, the _______ of the entity set the participating entity sets becomes the
serves as the primary key of the prime attribute.
resulting schema 5. For a binary one to one relationship,
a) First attribute the ________ of the participating entity
b) Primary key sets becomes the prime attribute
c) Foreign key a) Intersection of primary keys
d) None of the mentioned b) Primary key of either one
View Answer c) Union of primary keys
d) Primary key on the many side
Answer: b
Explanation: For schemas derived from
View Answer
strong entity sets, the primary key of the Answer: b
entity set serves as the primary key of the Explanation: For a binary one to one
resulting schema. This is because the relationship, the primary key of either one of
primary keys are to be preserved as they the participating entity sets becomes the
are unique. prime attribute.
2. State true or false: Derived attributes 6. For a binary many to many
cannot be directly represented in the relationship, the ________ of the
relational data model participating entity sets becomes the
a) True prime attribute
b) False a) Intersection of primary keys
View Answer b) Primary key of either one
Answer: a c) Union of primary keys
Explanation: Derived attributes cannot be d) Primary key on the many side
directly represented in the relational data View Answer
model. Instead, they are represented as
Answer: d
methods.
Explanation: For a binary many to many
3. The primary key of the representation relationship, the primary key on the many
of a weak entity set consists of the side of the participating entity sets becomes
primary key of the strong entity set and the prime attribute.
the _______ 7. For a n-ary relationship set without
a) Discriminator of the weak entity set arrows, the ________ of the
b) Foreign key participating entity sets becomes the
c) Primary key of all the other entity sets prime attribute
d) All the attributes of the weak entity set a) Intersection of primary keys
View Answer b) Primary key of either one
c) Union of primary keys the alphabetical orderor the data in the
d) Primary key on the many side attribute.
View Answer
Answer: c RDBMS Questions and
Explanation: For a binary many to many
relationship, the union of the primary keys of Answers – Extended E-R
the participating entity sets becomes the Features
prime attribute.
8. State true or false: The schema for This set of RDBMS Multiple Choice
the relationship set linking a weak entity Questions & Answers (MCQs) focuses
set to its corresponding strong entity set on “Extended ER Features”.
is redundant.
a) True 1. The process of designating sub
b) False groupings within the entity set is called
View Answer as _______
a) Specialization
Answer: a b) Division
Explanation: The schema for the
c) Aggregation
relationship set linking a weak entity set to
its corresponding strong entity set is
d) Finalization
redundant and it need not be present in the View Answer
relational database design derived from an Answer: a
ER diagram. Explanation: The process of designating
9. Statement 1: We can create foreign sub-groupings within the entity set is called
key constraints on relational schema as specialization. Specialization allows us to
derived from ER diagram distinguish among entities.
Statement 2: Relational schema cannot 2. State true or false: Specialization can
be derived from an ER diagram be applied only once
a) Both the statements are true a) True
b) Both the statements are false b) False
c) Statement 1 is true and Statement 2 View Answer
is false
Answer: a
d) Statement 2 is true and statement 1 is Explanation: We can apply specialization
false multiple times to refine a design. An entity
View Answer set may also be specialized by more than
Answer: c one distinguishing feature.
Explanation: We can create foreign key 3. Which of the following is the
constraints on relational schema derived specialization that permits multiple sets
from ER diagram and also it is possible to a) Superclass specialization
derive relational schema from ER diagrams. b) Disjoint specialization
10. Which of the following can affect the c) Overlapping specialization
placement of the relationship attributes? d) None of the mentioned
a) Alphabetical order View Answer
b) The data in the attribute
Answer: c
c) Cardinality ratio Explanation: Overlapping specialization is
d) None of the mentioned the type of specialization that permits
View Answer multiple sets. But disjoint specialization does
Answer: c not permit multiple sets. Disjoint
Explanation: The cardinality ratio of a specialization permits at most one set.
relationship can affect the placement of 4. The similarities between the entity set
relationship attributes. The placement of the can be expressed by which of the
relationship attributes are not dependent on following features?
a) Specialization
b) Generalization c) Value defined
c) Uniquation d) Undefined
d) Inheritance View Answer
View Answer
Answer: a
Answer: b Explanation: Condition defined
Explanation: The similarities between the generalization constraint is also said to be
entity set can be expressed by the attribute defined.
generalization feature. It is a containment o 9. If each higher level entity belongs to
the relationship that exists between a higher the lower level entity, then what kind of
level entity set and one or more lower level generalization is it?
entity sets. a) Modal generalization
5. Higher level entity sets are b) Partial generalization
designated by the term _________ c) Total generalization
a) Sub class d) None of the mentioned
b) Super class View Answer
c) Parent class
d) Root class Answer: c
View Answer Explanation: If each higher level entity
belongs to the lower level entity then it is
Answer: b called as total generalization. It is also called
Explanation: Higher level entity sets can as total specialization. If some higher level
also be designated by the term super class. entities do not belong, it is called as partial
In the similar manner lower level entity sets generalization.
can also be designated by the term sub 10. ________ is an abstraction through
class. which relationships are treated as higher
6. State true or false: The attributes of level entities
the higher level entity sets are inherited a) Creation
by the attributes of the lower level entity b) Superseding
sets c) Attribute separation
a) True d) Aggregation
b) False View Answer
View Answer
Answer: d
Answer: a Explanation: One limitation of E-R model is
Explanation: The attributes of the higher that it cannot express relationships among
level entity sets are inherited by the relationships. Thus for this purpose,
attributes of the lower level entity sets. But aggregation is used. Aggregation is an
the inverse is not true in this case. abstraction through which relationships are
7. Which of the following is not a treated as higher level entities.
generalization constraint?
a) Condition-defined
b) User defined RDBMS Questions and
c) Disjoint Answers – Features of
d) Machine defined
View Answer Good Relational Design
Answer: d This set of RDBMS Multiple Choice
Explanation: Machine definition is not a Questions & Answers (MCQs) focuses
generalization constraint. Condition defined, on “Features of Good Relational
user defined, disjoint and overlapping are 4 Designs”.
generalization constraints.
8. Condition defined generalization 1. Which of the following is not a feature
constraint is also said to be ________ of a good relational design?
a) Attribute defined a) Specifying primary keys
b) Constraint defined b) Specifying foreign keys
c) Preserving integrity constraints 5. A domain whose elements are
d) Allowing redundancy of attributes indivisible is called as ______
View Answer a) Unique domain
b) Proxy domain
Answer: d
Explanation: Allowing redundancy of
c) Atomic domain
attributes makes it very difficult for data d) Multiple domain
extraction. So, It is not a good relational View Answer
design feature. Answer: c
2. The dependency rules specified by Explanation: A domain is said to be atomic if
the database designer are known as all of its elements are considered to be
_______ indivisible. If the domains are atomic, then
a) Designer dependencies the relational schema is in the first normal
b) Database rules form.
c) Functional dependencies 6. If all the domains are atomic then the
d) None of the mentioned relational schema is in ________ normal
View Answer form
a) 1
Answer: c
b) 2
Explanation: The dependency rules
specified by the database designer are
c) 3
known as functional dependencies. The d) 4
normal forms are based on functional View Answer
dependencies. Answer: a
3. If the decomposition is unable to Explanation: If all the domains are atomic
represent certain important facts about then the relational schema is in first (1)
the relation, then such a decomposition normal form. That is, the domains must be
is called as? indivisible.
a) Lossless decomposition 7. State true or false: Composite
b) Lossy decomposition attributes have non-atomic domains.
c) Insecure decomposition a) True
d) Secure decomposition b) False
View Answer View Answer
Answer: b Answer: b
Explanation: If the decomposition is unable Explanation: Composite attributes have non
to represent certain important facts about atomic domains i.e. domains of the
the relation, then such a decomposition is composite attributes are generally divisible.
called as lossy decomposition. Lossy advertisement
decompositions should be avoided as they
result in the loss of data. 8. State true or false: Redundancy is
4. If the decomposition is able to desired in a relational schema
represent all the facts about the relation a) True
then such a decomposition is called as? b) False
a) Lossless decomposition View Answer
b) Lossy decomposition Answer: b
c) Insecure decomposition Explanation: Redundancy is never desired
d) Secure decomposition in a relational schema, it makes data
View Answer retrieval very difficult.
Answer: a
Explanation: If the decomposition is able to
represent all the facts about the relation
RDBMS Questions and
then such a decomposition is called as a Answers – Decomposition
lossless decomposition. Lossless
decompositions are generally preferred.
 Answer: a
Using Functional Explanation: X→ Y is said to be trivial if X is
Dependencies a subset of Y. Thus X ⊂ Y implies X→Y is
trivial.
This set of RDBMS test focuses on 5. Which of the following is not a
“Decomposition Using Functional condition for X→ Y in Boyce codd
Dependencies”. normal form?
a) X → Y is trivial
1. An instance of a relation that satisfies b) X is the superkey for the relational
all real world constraints is known as? schema R
a) Proper relation c) Y is the superkey for the relational
b) Ideal relation schema R
c) Perfect relation d) All of the mentioned
d) Legal relation View Answer
View Answer
Answer: c
Answer: d Explanation: Y does not need to be a
Explanation: A relation that satisfies all the superkey of the relation for the given
real world constraints is called as a legal functional dependency to satisfy BCNF. X→
relation. An instance of a legal relation is Y must be trivial and X must be the
called as a legal instance. superkey of the relation R.
2. If K → R then K is said to be the 6. Which of the following is used to
_______ of R express database consistency?
a) Candidate key a) Primary keys
b) Foreign key b) Functional dependencies
c) Super key c) Check clause
d) Domain d) All of the mentioned
View Answer View Answer
Answer: c Answer: d
Explanation: If K → R then k is said to be Explanation: Primary keys, Functional
the superkey of R i.e. K uniquely identifies dependencies, Check clause are all used to
every tuple in the relation R. express database consistency.
3. X → Y holds on a schema k(K) if? Y?7. Which of the following is not a
a) At least one legal instance satisfies condition for the third normal form in the
the functional dependency case of X
b) No legal instance satisfies the a) X→ Y is trivial
functional dependency b) X is the superkey for R
c) Each and every legal instance c) Each attribute in Y-X is a candidate
satisfies the functional dependency key for R
d) None of the mentioned d) Each attribute in X-Y is a candidate
View Answer key for R
Answer: c View Answer
Explanation: X → Y holds on a schema k(K)
Answer: d
if each and every legal instance satisfies the
Explanation: Each attribute in X-Y is a
functional dependency. Even if one instance
candidate key for R is not a necessary
does not satisfy the functional dependency
condition for the third normal form in the
X→ Y does not hold on a schema.
case of X → Y. X→Y is trivial and X is the
4. X→ Y is trivial if? superkey of R are necessary conditions for
a) X ⊂ Y the third normal form.
b) Y ⊂ X 8. F+ is called as the ________ of F
c) X ⊇ Y a) Closure
d) None of the mentioned b) Sum
View Answer c) Cartesian product