Crack
GATE
C
G
Topic
Relational Model
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
1.3
1
0
0.3
2018
0
0
0
0
2019
2
0
0
2
2020
0
0
0
0
2021
1
1
0
0
2022
1
0
0
1
2023
1
1
0
0
2024
0
0
0
0
2025
1
0.5
0.5
0
2026
1.5
1
0
0.5
1
CS 2026 Set 1 · 2 marks · MCQ · Easy
Consider a relational database schema with two relations
R
(
P
,
Q
)
R(P, Q)
R
(
P
,
Q
)
and
S
(
X
,
Y
)
S(X, Y)
S
(
X
,
Y
)
.
2
CS 2026 Set 1 · 2 marks · NAT · Moderate
Consider a relational database schema with a relation
R
(
A
,
B
,
C
,
D
)
R(A, B, C, D)
R
(
A
,
B
,
C
,
D
)
. If
{
A
,
B
}
\{A, B\}
{
A
,
B
}
and
{
A
,
C
}
\{A, C\}
{
A
,
C
}
are the only two candidate keys of the relation
R
R
R
, then the number of superkeys of relation
R
R
R
is ____. (answer in integer)
3
CS 2026 Set 2 · 1 mark · MCQ · Easy
In the context of DBMS, consider the two sets
T
\mathbf{T}
T
and
S
\mathbf{S}
S
given below.
4
CS 2025 Set 1 · 2 marks · MCQ · Easy
Consider two relations describing
teams
and
players
in a sports league:
5
CS 2025 Set 2 · 2 marks · MSQ · Moderate
Consider the following relational schema:
6
CS 2023 · 1 mark · MCQ · Easy
Which one of the options given below refers to the degree (or arity) of a relation in relational database systems?
7
CS 2022 · 2 marks · NAT · Moderate
Consider the relational database with the following four schemas and their respective instances.
8
CS 2021 Set 1 · 2 marks · MCQ · Moderate
The following relation records the age of 500 employees of a company, where
e
m
p
N
o
empNo
e
m
pN
o
(indicating the employee number) is the key:
9
CS 2021 Set 2 · 2 marks · MCQ · Easy
The relation scheme given below is used to store information about the employees of a company, where empId is the key and deptId indicates the department to which the employee is assigned. Each employee is assigned to exactly one department.
10
CS 2019 · 2 marks · NAT · Moderate
A relational database contains two tables Student and Performance as shown below:
11
CS 2019 · 2 marks · NAT · Moderate
Consider the following relations
P
(
X
,
Y
,
Z
)
P(X,Y,Z)
P
(
X
,
Y
,
Z
)
,
Q
(
X
,
Y
,
T
)
Q(X,Y,T)
Q
(
X
,
Y
,
T
)
and
R
(
Y
,
V
)
R(Y,V)
R
(
Y
,
V
)
.
12
CS 2015 Set 1 · 1 mark · MCQ · Easy
SELECT operation in SQL is equivalent to
13
CS 2015 Set 1 · 2 marks · NAT · Moderate
Consider the following relations:
14
CS 2015 Set 2 · 2 marks · MCQ · Moderate
Consider two relations
R
1
(
A
,
B
)
R_1(A, B)
R
1
(
A
,
B
)
with the tuples
(
1
,
5
)
,
(
3
,
7
)
(1, 5), (3, 7)
(
1
,
5
)
,
(
3
,
7
)
and
R
2
(
A
,
C
)
=
(
1
,
7
)
,
(
4
,
9
)
R_2(A, C) = (1, 7), (4, 9)
R
2
(
A
,
C
)
=
(
1
,
7
)
,
(
4
,
9
)
. Assume that
R
(
A
,
B
,
C
)
R(A, B, C)
R
(
A
,
B
,
C
)
is the full natural outer join of
R
1
R_1
R
1
and
R
2
R_2
R
2
. Consider the following tuples of the form
(
A
,
B
,
C
)
(A, B, C)
(
A
,
B
,
C
)
:
a
=
(
1
,
5
,
n
u
l
l
)
a = (1, 5, \mathit{null})
a
=
(
1
,
5
,
null
)
,
b
=
(
1
,
n
u
l
l
,
7
)
b = (1, \mathit{null}, 7)
b
=
(
1
,
null
,
7
)
,
c
=
(
3
,
n
u
l
l
,
9
)
c = (3, \mathit{null}, 9)
c
=
(
3
,
null
,
9
)
,
d
=
(
4
,
7
,
n
u
l
l
)
d = (4, 7, \mathit{null})
d
=
(
4
,
7
,
null
)
,
e
=
(
1
,
5
,
7
)
e = (1, 5, 7)
e
=
(
1
,
5
,
7
)
,
f
=
(
3
,
7
,
n
u
l
l
)
f = (3, 7, \mathit{null})
f
=
(
3
,
7
,
null
)
,
g
=
(
4
,
n
u
l
l
,
9
)
g = (4, \mathit{null}, 9)
g
=
(
4
,
null
,
9
)
. Which one of the following statements is correct?
15
CS 2015 Set 3 · 1 mark · MCQ · Easy
Consider the relation
X
(
P
,
Q
,
R
,
S
,
T
,
U
)
X(P, Q, R, S, T, U)
X
(
P
,
Q
,
R
,
S
,
T
,
U
)
with the following set of functional dependencies