NEW
Font size
S
M
L
XL
WorksheetsRelational Database Design
Total questions: 47
Worksheet time: 24mins
Name
Class
Date
1.
A functional dependency is denoted by ….... symbol
a)
&
b)
*
c)
→
d)
%
2.
A functional dependency is a relationship between or among …….
a)
Tables
b)
Rows
c)
Relations
d)
Attributes
3.
Which of the following is not Armstrong’s Axiom?
a)
Reflexivity rule
b)
Transitivity rule
c)
None of these
d)
Augmentation rule
4.
We can use the following three rules to find logically implied functional dependencies. This collection of rules is called
a)
Axioms
b)
Armstrong’s axioms
c)
Armstrong
d)
Closure
5.
There are two functional dependencies with the same set of attributes on the left side of the arrow:
A→BC
A→B
This can be combined as
a)
A→BC
b)
A→B
c)
B→C
d)
None of the mentioned
6.
Which of the following is a trivial functional dependency?
a)
A->A
b)
A->B, if B is a subset of A
c)
B->B
d)
All of these
7.
For a relation R(X, Y, Z, W) with primary key(X, Y) a functional dependency XY→Z is said to be ___________.
a)
Full Dependency
b)
Partial Dependency
c)
Trivial Dependency
d)
None of these
8.
If F is a set of functional dependencies, then the closure of F is denoted by?
a)
F+
b)
Fo
c)
F
d)
F*
9.
If K → L then ___ → LM.
a)
KM
b)
LM
c)
KL
d)
NONE
10.
If a functional dependency is reflexive, Y is a subset of X and X is the set of attributes, then
a)
Y→X holds
b)
XY→Z holds
c)
X→Y holds
d)
None of these
11.
If B is an attribute and A→B, Then B is said to be ________ by A.
a)
Logically implied
b)
Functionally determined
c)
Logically determined
d)
Functionally implied
12.
If B is determined by A, then ___ is determined by BC regardless of C in the augmentation rule.
a)
AB
b)
AC
c)
A
d)
C
13.
If A determines B, and BC determines D, then AC determines D according to the ___ Rule.
a)
Pseudo Decomposition Rule
b)
Transitive Rule
c)
Pseudo Rule
d)
Pseudo Transitive Rule
14.
If A→BC then A→B and _______is decomposition rule.
a)
A→C
b)
B→A
c)
C→A
d)
B→C
15.
If A → B and BC → D then ___.
a)
AB → D
b)
D → AB
c)
AC → D
d)
D → AC
16.
There is a relationship AC →B, A →D, and D→B. Here A is alone capable of determining B, which means B is …....................dependent on AC
a)
Partially
b)
Fully
c)
Medium
d)
Short
17.
Functional dependency which also known as a nontrivial dependency occurs when A →B holds true where ....................
a)
A is a subset of B
b)
B is a subset of A
c)
B is not a subset of A
d)
None of these
18.
If ___, then A -> B has trivial functional dependency.
a)
B is a subset of A
b)
A is a subset of B
c)
A is a subset of A'
d)
B is a subset of B'
19.
If A→B, A→ C then which of the following is true?
a)
A→BC
b)
A→B
c)
A→C
d)
All of the mentioned
20.
In a schema with attributes A, B, C, D and E following set of functional dependencies are given
{A → B, A → C, CD → E, B → D, E → A}
Which of the following functional dependencies is NOT implied by the above set?
a)
CD → AC
b)
BD → CD
c)
BC → CD
d)
AC → BC
21.
AB→CD, AF→D, DE→F, C→G , F→E, G→A
Which one of the following options is false?
a)
CF+ = {ACDEFG}
b)
BG+ = {ABCDG}
c)
AF+ = {ACDEFG}
d)
None of the above
22.
Find Closure set of Attribute for the following: R(A,B,C,D,E,F), FD: AB → C, BC → AD, D → E, CF → B, (AB)+=?
a)
ABCDE
b)
ABC
c)
AB
d)
ABCDEF
23.
What is the Candidate Key for given FDs?
FD : {EF→G ,F→IJ , EH→KL , K→M, L→N}
a)
{GI}
b)
{EFH}
c)
{KL}
d)
{IJ}
24.
What is the candidate key in the relation R(eid,name,age,gender ,marks) consider given functional dependencies
name→eid , name→marks , name→gender,age
a)
eid , marks
b)
name
c)
eid , gender
d)
age
25.
Suppose relation R(A,B,C,D,E) has the following functional dependencies: A →B ,B → C, BC→ A, A → D, E → A, D → E. Which of the following is not a key?
a)
A
b)
B,C
c)
E
d)
D
26.
Relation R has six attribute ABCDEF. F = { A → BC, B → CE, E → A, F → E} is a set of functional dependencies.How many candidate keys does the relation R have?
a)
1
b)
2
c)
4
d)
None of these
27.
Relation R has following attribute ABCDEF. F = { A → B, B → CE, E → A, F → E} is a set of functional dependencies. Which one is candidate key?
a)
D
b)
DF
c)
A
d)
AF
28.
For a given relation R has following attribute EFGHIJKLMN. What are prime attribute?
FD : {EF→G ,F→IJ , EH→KL , K→M, L→N}
a)
E,F,H
b)
G,I
c)
K,L
d)
I,J
29.
Given relation R with attributes A,B, C,D and set of FDs as
B → A , AD → C , C → ABD . Canonical cover for given FDs
a)
{B → E , C → BD,
AD → C}
b)
{B → AF , C → BD,
AD → C}
c)
{B → A , C → BD,
AD → C}
d)
None of there
30.
Empdt1(empcode, name, street, city, state,pincode). For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in
a)
1 NF only
b)
2 NF and hence also in 1 NF
c)
3NF and hence also in 2NF and 1NF
d)
BCNF and hence also in 3NF, 2NF and 1NF View Answer
31.
Functional Dependencies are the types of constraints that are based on______
a)
Key
b)
Key revisited
c)
Superset key
d)
None of the mentioned
32.
Third Normal Form is ….........................
a)
2NF and no transitive
dependencies
b)
2NF or no transitive
dependencies
c)
BCNF or no transitive
dependencies
d)
None of these
33.
A relation is in 2NF when it is in 1 NF and …......................
a)
No Transitivity
b)
Partial functional
dependencies
c)
No partial functional
dependencies
d)
None of these
34.
In which normal form conversion of composite attribute to individual attribute happens,
a)
First NF
b)
Second NF
c)
Third NF
d)
None of these
35.
Normalization is used to design ________________
a)
Join dependencies
b)
Multi-valued dependencies
c)
Cyclic dependencies
d)
Relational database
36.
F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies The relation R is
a)
in 1NF, but not in 2NF.
b)
in BCNF
c)
in 3NF, but not in BCNF.
d)
in 2NF, but not in 3NF.
37.
Which normal form is considered adequate for normal relational database design?
a)
1NF
b)
3 NF
c)
2 NF
d)
4 NF
38.
Every BCNF is in
a)
1 NF
b)
2 NF
c)
3 NF
d)
All of the above
39.
A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies:
F1→F3 , F2→F4 , (F1,F2)→F5 in terms of normalization, this table is in
a)
3 NF
b)
2 NF
c)
4 NF
d)
1`NF
40.
Which of the following is TRUE?
a)
Every relation in 2NF
is also in BCNF
b)
Every relation in BCNF
is also in 3NF
c)
No relation can be in
both BCNF and 3NF
d)
A relation R is in 3NF
if every non-prime
attribute of R is fully
functionally dependent
on every key of R
41.
Consider the following functional dependencies in a database.
Date_of_Birth→Age Age→Eligibility
Name→Roll_number Roll_number→Name
Course_number→Course_name Course_number→Instructor
(Roll_number, Course_number)→Grade
The relation (Roll_number, Name, Date_of_birth, Age) is
a)
in second normal form
but not in third normal form
b)
in third normal form
but not in BCNF
c)
in BCNF
d)
None of these
42.
S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF.
S2: AB→C, D→E, E→C is a minimal cover for the set of functional dependencies
AB→C, D→E, AB→E, E→C.
Which one of the following is CORRECT?
a)
Both S1 and S2 are
FALSE.
b)
S1 is FALSE and
S2 is TRUE.
c)
Both S1 and S2 are
TRUE.
d)
S1 is TRUE and S2
is FALSE.
43.
For a database relation R(a,b,c,d), where the domains a, b, c, d include only atomic values, only the following functional dependencies and those that can be inferred from them hold:
{ a → c, b → d }
This relation is
a)
in first normal form but not in second normal form
b)
in second normal form but not in first normal form
c)
in third normal form
d)
None of the above
44.
Relation R has eight attribute ABCEFGH. F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies.How many candidate keys does the relation R have?
a)
3
b)
6
c)
4
d)
None of these
45.
Match the following
Condition Normal form
a) No Partial dependencies 1) First normal form
b) No transitive dependencies 2) Second normal form
c) Atomic value 3) Third normal form
a)
a-1 , b-2 , c-3
b)
a -2, b-3 , c-1
c)
a-3 , b-1 , c-2
d)
a-1 , b-3 , c-2
46.
"The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into
employee1 (ID, name)
employee2 (name, street, city, salary)
This type of decomposition is called"
a)
Lossless decomposition
b)
Lossy decomposition
c)
Both A and B
d)
None of these
47.
"The relation Account_Branch(Ano, Balance, Bname, Baddress) is decomposed into Account (Ano, Balance, Bname)
Branch(Bname, Baddress)
This type of decomposition is called"
a)
Lossless decomposition
b)
Lossy decomposition
c)
Both A and B
d)
None of these
Reset
