1
You visited us
1
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Consider R = ...
Question
Consider R = (A, B, C, D, E, F) be a relation schema with the following dependencies
A
→
B
,
A
→
C
,
C
D
→
E
,
C
D
→
F
,
B
→
E
Which of the following is candidate key of R ?
Open in App
Solution
C
l
o
s
u
r
e
o
f
(
A
D
)
+
=
{
A
,
B
,
C
,
D
,
E
,
F
}
Since AD is already a candidate key. Hence superset of AD
i.e., ADE can not be candidate key.
Suggest Corrections
0
Similar questions
Q.
C
o
n
s
i
d
e
r
a
r
e
l
a
t
i
o
n
R
(
A
,
B
,
C
,
D
,
E
)
w
i
t
h
f
u
n
c
t
i
o
n
a
l
d
e
p
e
n
d
e
n
c
i
e
s
:
N
u
m
b
e
r
o
f
c
a
n
d
i
d
a
t
e
s
k
e
y
i
n
a
b
o
v
e
r
e
l
a
t
i
o
n
R
i
s
_
_
_
_
_
_
.
F
=
(
A
E
→
C
,
C
D
→
E
,
C
→
A
,
C
→
D
,
D
→
E
]
Q.
Consider R(A, B, C, D, E) be a relation schema with the following functional dependencies:
F
=
{
A
→
B
C
,
C
D
→
E
,
B
→
D
,
E
→
A
}
Which of the following is true for decomposition of R into (A, B, C) and (C, D, E)?
Q.
The Relation R(ABCDEF) with FD set
F
=
{
A
B
→
C
D
E
F
,
C
→
A
,
D
→
B
,
C
→
D
,
E
→
F
,
B
→
E
}
The number of candidate keys of a relation R is
Q.
Consider a relation R(A,B,C,D,E,F) with functional dependencies
F =(
A
→
B
C
B
→
E
D
→
A
F
F
→
C
B
→
A
D
)
The number of super keys present in the relation are ________
Q.
C
o
n
s
i
d
e
r
a
r
e
l
a
t
i
o
n
R
(
A
,
B
,
C
,
D
,
E
)
w
i
t
h
t
h
e
f
o
l
l
o
w
i
n
g
d
e
p
e
n
d
e
n
c
i
e
s
:
M
a
x
i
m
u
m
p
o
s
s
i
b
l
e
s
u
p
e
r
k
e
y
s
o
n
r
e
l
a
t
i
o
n
R
i
s
_
_
_
_
_
_
_
.
F
=
(
A
→
B
C
,
C
→
A
E
,
B
→
D
,
C
→
B
)
View More
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
Related Videos
Visual Indicators
Watch in App
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
AI Tutor
Textbooks
Question Papers
Install app