1
GATE CSE 2026 Set 1
MCQ (Single Correct Answer)
+2
-0

Consider a relational database schema with two relations $R(P, Q)$ and $S(X, Y)$.

Let $E=\{\langle u\rangle \mid \exists v \exists w\langle u, v\rangle \in R \wedge\langle v, w\rangle \in S\}$ be a tuple relational calculus expression. Which one of the following relational algebraic expressions is equivalent to $E$ ?

A

$\Pi_P\left(R \bowtie_{R . P=S . X} S\right)$

B

$\Pi_P\left(S \bowtie_{S . X=R . Q} R\right)$

C

$\Pi_P\left(R \bowtie_{R . P=S . Y} S\right)$

D

$\Pi_P\left(S \bowtie_{S . Y=R . Q} R\right)$

2
GATE CSE 2025 Set 1
MCQ (Single Correct Answer)
+2
-0

Consider two relations describing teams and players in a sports league:

$\bullet$ teams(tid, tname): tid, tname are team-id and team-name, respectively.

$\bullet$ players(pid, pname, tid): pid, pname, and tid denote player-id, player-name and the team-id of the player, respectively.

Which ONE of the following tuple relational calculus queries returns the name of the players who play for the team having tname as ' $M I$ '?

A
$\{$ p.pname $\mid p \in$ players $\wedge \exists t(t \in$ teams $\wedge$ p.tid $=$ t.tid $\wedge$ t.name $=' \mathrm{MI}$ ' $)\}$
B
$\{$ p.pname $\mid p \in$ teams $\wedge \exists t(t \in$ players $\wedge$ p.tid $=$ t.tid $\wedge$ t.name $=' \mathrm{Ml}$ ') \}
C
$\{$ p.pname $\mid p \in$ players $\wedge \exists t(t \in$ teams $\wedge$ t.name $=' M 1$ ' $)\}$
D
$\{p . p n a m e \mid p \in$ teams $\wedge \exists t(t \in$ players $\wedge$ t.name $=$ ' Ml ' $)\}$
3
GATE CSE 2024 Set 2
MCQ (Single Correct Answer)
+2
-0.66

The relation schema, Person($\underline{\text{pid}}$, $city$), describes the city of residence for every person uniquely identified by $pid$. The following relational algebra operators are available: selection, projection, cross product, and rename.

To find the list of cities where at least 3 persons reside, using the above operators, the minimum number of cross product operations that must be used is

A

1

B

2

C

3

D

4

4
GATE CSE 2019
Numerical
+2
-0
Consider the following relations P(X,Y,Z), Q(X,Y,T) and R(Y,V).
GATE CSE 2019 Database Management System - Relational Algebra Question 7 English 1
How many tuples will be returned by the following relational algebra query?
GATE CSE 2019 Database Management System - Relational Algebra Question 7 English 2
Your input ____

GATE CSE Subjects

Browse all chapters by subject

Software Engineering
Web Technologies