Pep classes

Normalization
• A table is in BCNF if it is in 3NF and if every
determinant is a ___________ key.
a) Dependent
b) Normal
c) Candidate
d) Both Normal and Candidate
• Ans c
• A table is in 3NF if it is in 2NF and if it has no
____________
a) Functional Dependencies
b) Transitive Dependencies
c) Trivial Functional Dependency
d) Multivalued Dependencies
• Ans b
• A ___________ is an indirect functional
dependency, one in which X->Z only by virtue
of X->Y and Y->Z.
a) Multivalued Dependencies
b) Join Dependency
c) Trivial Functional Dependency
d) Transitive Dependencies
• Ans d
• In a given relationship R, if an attribute A
uniquely defines all other attributes, then the
attribute A is a key attribute which is also
known as the _________ key.
a) Candidate
b) Join
c) Functional
d) None of the Mentioned
• ANs a
• Anomalies are avoided by splitting the
offending relation into multiple relations, is
also known as
a) Accupressure
b) Decomposition
c) Precomposition
d) Both Decomposition and Precomposition
• Ans b
• Every time attribute A appears, it is matched
with the same value of attribute B, but not the
same value of attribute C. Therefore, it is true
that:
a) A -> B
b) A -> C
c) A -> (B,C)
d) (B,C) -> A
• ANs a
• When the values in one or more attributes
being used as a foreign key must exist in
another set of one or more attributes in
another table, we have created a(n):
a) Transitive Dependency
b) Insertion Anomaly
c) Referential Integrity Constraint
d) Normal Form
• Ans c
• Which of the following is not a restriction for a
table to be a relation?
a) The cells of the table must contain a single
value
b) All of the entries in any column must be of
the same kind
c) The columns must be ordered
d) No two rows in a table may be identical
• Ans c
• A ___ is normalized after it has been
organized.
• Table
• Database
• Row
• Column
• Ans b
• By normalizing relations or sets of relations,
one minimizes ___.
• Data
• Fields
• Redundancy
• Database
• Ans c
• In addition to removing undesirable
characteristics, normalization also eliminates
___ anomalies.
• Insert
• Update
• Delete
• All of the above
• ANs d
• A common approach to normalization is to
___ the larger table into smaller tables and
link them together by using relationships.
– Add
– Subtract
– Multiply
– Divide
• Ans d
• In practical applications, how many types of
Normal Forms are there?
–3
–4
–5
–6
• Ans b
• When a relation contains an atomic value, it
is a ___ relation.
– 1NF
– 2NF
– 3NF
– BCNF
• Ans a
• 2NF relations are those that are in 1NF with
all the attribute types dependent on the ___
key.
– Primary
– Foreign
– Composite
– Alternate
• Ans a
• When a relation is in 2NF and there is ___, it
is in 3NF.
– Transition Dependency
– No Transition Dependency
– Relational Dependency
– No Relational Dependency
• Ans d
• A relation is in ___ if it is in Boyce Codd
normal form and does not have any
multivalued dependencies.
– 1NF
– 2NF
– 3NF
– 4NF
• Ans d
• A BCNF is
– Loss less join and dependency preserving
– LOS less join but not dependency preserving
– Not loss less join but dependency preserving
– None of these
Ans B
• 5 NF is designed to cope with
– Transitive dependency
– Join dependency
– Multi valued dependency
– All of the above

Ans B
• 4 NF is designed to cope with
– Transitive dependency
– Join dependency
– Multi valued dependency
– All of the above

Ans C
• A function that has no partial functional
dependencies is in ____________
– 3NF
– 2NF
– 4NF
– BCNF
Ans B
• Third normal form is based on the concept of
______________
– Closure dependency
– Transitiive dependency
– Normal dependency
– Functional depecndency
Ans B
• Third normal form is inadequate in situations
where the relation
– Has multiple candidate keys
– Has candidate keys that are composite
– Has overlapped candidate keys
– None of the above
Ans D
• Which of the following statements is/are true?
– A relation is in BCNF if it is not in 4NF
– BCNF is stricter than 3NF
– A relation is in BCNF if every determinant of the
relation is a candidate key.
– All are true
Ans D
• Which normal form is considered as adequate
for usual database design?
– 2NF
– 3NF
– 4NF
– 5NF
Ans B
• Which of the following is true?
– A relation in BCNF is always in 3NF
– A relation in 3NF is always in BCNF
– BCNF and 3NF are same
– A relation in BCNF is not in 3NF
• Ans A
• Functional dependencies are a generalization
of
– Key dependencies
– Relation dependencies
– Database dependencies
– None of these
Ans A
• A property which ensures that each functional
dependency is represented in some individual
relational resulting after decomposition
– Loss less join
– Dependency Preservation
– BOTH A & B
– None of the above
• Ans C
A table T1 in a relation database has following rows and columns.
Roll number                       Marks.
1                                           10
2                                           20
3                                           30
4                                           NULL

The following sequence of SQL statements was successfully executed in table T1.

Update T1 set marks =marks + 5 ;

select avg(marks) from T1 ;

 What is the output of the select statement?

 
A. 18.75
B. 20
C.25
D. NULL
• Ans A
Consider the following set of functional dependencies on the
schema (A, B, C)
A --> BC,
B —> C,
A —> B,
AB —> C
The cannonical cover for this set is
A. A —> BC and B ---->C
B. A ----> BC and AB —> C
C.A —> BC and A —> B
D. A —> B and B —> C
• Ans A
• 2NF relations are those that are in 1NF with
all the attribute types dependent on the ___
key.
– Primary
– Foreign
– Composite
– Alternate
• Ans a
• When a relation is in 2NF and there is ___, it
is in 3NF.
– Transition Dependency
– No Transition Dependency
– Relational Dependency
– No Relational Dependency
• Ans d