Crack
GATE
C
G
Topic
Relational Algebra
Databases
0
/ 4 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
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
0
0
0
0
2020
0
0
0
0
2021
0.5
0
0
0.5
2022
1
0
1
0
2023
0
0
0
0
2024
1
0.5
0
0.5
2025
0
0
0
0
2026
0
0
0
0
1
CS 2024 Set 1 · 1 mark · NAT · Easy
Consider the following two relations,
R
(
A
,
B
)
R(A, B)
R
(
A
,
B
)
and
S
(
A
,
C
)
S(A, C)
S
(
A
,
C
)
:
2
CS 2024 Set 2 · 2 marks · MCQ · Moderate
The relation schema,
P
e
r
s
o
n
(
p
i
d
,
c
i
t
y
)
\mathrm{Person}(\mathrm{pid},\mathrm{city})
Person
(
pid
,
city
)
, describes the city of residence for every person uniquely identified by
p
i
d
\mathrm{pid}
pid
. The following relational algebra operators are available: selection, projection, cross product, and rename.
3
CS 2022 · 1 mark · MSQ · Moderate
Consider the following three relations in a relational database.
4
CS 2021 Set 1 · 1 mark · NAT · Moderate
A relation
r
(
A
,
B
)
r(A,B)
r
(
A
,
B
)
in a relational database has
1200
1200
1200
tuples. The attribute
A
A
A
has integer values ranging from
6
6
6
to
20
20
20
, and the attribute
B
B
B
has integer values ranging from
1
1
1
to
20
20
20
. Assume that the attributes
A
A
A
and
B
B
B
are independently distributed.