Crack
GATE
C
G
Topic
Integrity Constraints and Normal Forms
Databases
0
/ 15 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
0
0
0
0
2018
0
0
0
0
2019
1
1
0
0
2020
1
1
0
0
2021
1.5
1
0.5
0
2022
2
1
0
1
2023
0
0
0
0
2024
1.5
0
1
0.5
2025
1
0
1
0
2026
1.5
0.5
1
0
1
CS 2026 Set 1 · 1 mark · MSQ · Moderate
Let
P
,
Q
,
R
P, Q, R
P
,
Q
,
R
and
S
S
S
be the attributes of a relation in a relational schema. Let
X
→
Y
X \rightarrow Y
X
→
Y
indicate functional dependency in the context of a relational database, where
X
,
Y
⊆
{
P
,
Q
,
R
,
S
}
X, Y \subseteq \{P, Q, R, S\}
X
,
Y
⊆
{
P
,
Q
,
R
,
S
}
.
2
CS 2026 Set 1 · 1 mark · MSQ · Moderate
In the context of relational database normalization, which of the following statements is/are true?
3
CS 2026 Set 2 · 2 marks · MCQ · Moderate
In the context of schema normalization in relational DBMS, consider a set
F
F
F
of functional dependencies. The set of all functional dependencies implied by
F
F
F
is called the closure of
F
F
F
. To compute the closure of
F
F
F
, Armstrong's Axioms can be applied. Consider
X
X
X
,
Y
Y
Y
, and
Z
Z
Z
as sets of attributes over a relational schema. The three rules of Armstrong's Axioms are described as follows.
4
CS 2025 Set 1 · 2 marks · MSQ · Moderate
Consider a relational schema
t
e
a
m
(
n
a
m
e
,
c
i
t
y
,
o
w
n
e
r
)
\mathit{team}(\mathit{name}, \mathit{city}, \mathit{owner})
team
(
name
,
city
,
owner
)
, with functional dependencies
{
n
a
m
e
→
c
i
t
y
,
n
a
m
e
→
o
w
n
e
r
}
\{\mathit{name} \to \mathit{city}, \mathit{name} \to \mathit{owner}\}
{
name
→
city
,
name
→
owner
}
.
5
CS 2025 Set 2 · 2 marks · MSQ · Moderate
Consider the following relational schema along with all the functional dependencies that hold on them.
6
CS 2024 Set 1 · 1 mark · MSQ · Easy
Which of the following statements about a relation
R
R
R
in first normal form (1NF) is/are TRUE?
7
CS 2024 Set 1 · 2 marks · MSQ · Moderate
The symbol
→
\to
→
indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?
8
CS 2024 Set 2 · 2 marks · NAT · Moderate
A functional dependency
F
:
X
→
Y
F: X \rightarrow Y
F
:
X
→
Y
is termed as a useful functional dependency if and only if it satisfies all the following three conditions:
9
CS 2022 · 1 mark · MCQ · Easy
In a relational data model, which one of the following statements is TRUE?
10
CS 2022 · 1 mark · NAT · Moderate
Consider a relation
R
(
A
,
B
,
C
,
D
,
E
)
R(A, B, C, D, E)
R
(
A
,
B
,
C
,
D
,
E
)
with the following three functional dependencies.
11
CS 2021 Set 1 · 2 marks · MCQ · Moderate
Consider the relation
R
(
P
,
Q
,
S
,
T
,
X
,
Y
,
Z
,
W
)
R(P, Q, S, T, X, Y, Z, W)
R
(
P
,
Q
,
S
,
T
,
X
,
Y
,
Z
,
W
)
with the following functional dependencies.
12
CS 2021 Set 2 · 1 mark · MCQ · Easy
Consider the following statements S1 and S2 about the relational data model:
13
CS 2021 Set 2 · 2 marks · MSQ · Moderate
Suppose the following functional dependencies hold on a relation
U
U
U
with attributes
P
P
P
,
Q
Q
Q
,
R
R
R
,
S
S
S
, and
T
T
T
:
14
CS 2020 · 2 marks · MCQ · Easy
Consider a relational table
R
R
R
that is in 3NF, but not in BCNF. Which one of the following statements is TRUE?
15
CS 2019 · 2 marks · MCQ · Moderate
Let the set of functional dependencies
F
=
{
Q
R
→
S
,
R
→
P
,
S
→
Q
}
F = \{QR \rightarrow S, R \rightarrow P, S \rightarrow Q\}
F
=
{
QR
→
S
,
R
→
P
,
S
→
Q
}
hold on a relation schema
X
=
(
P
Q
R
S
)
X = (PQRS)
X
=
(
P
QR
S
)
.
X
X
X
is not in BCNF. Suppose
X
X
X
is decomposed into two schemas
Y
Y
Y
and
Z
Z
Z
, where
Y
=
(
P
R
)
Y = (PR)
Y
=
(
P
R
)
and
Z
=
(
Q
R
S
)
Z = (QRS)
Z
=
(
QR
S
)
.\n\nConsider the two statements given below.\n\nI. Both
Y
Y
Y
and
Z
Z
Z
are in BCNF\nII. Decomposition of
X
X
X
into
Y
Y
Y
and
Z
Z
Z
is dependency preserving and lossless\n\nWhich of the above statements is/are correct?