1
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 ' $)\}$
2
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

3
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 6 English 1
How many tuples will be returned by the following relational algebra query?
GATE CSE 2019 Database Management System - Relational Algebra Question 6 English 2
Your input ____
4
GATE CSE 2018
MCQ (Single Correct Answer)
+2
-0.6
Consider the relations $$r(A, B)$$ and $$s(B, C),$$ where $$s.B$$ is a primary key and $$r.B$$ is a foreign key referencing $$s.B.$$ Consider the query

$$Q:$$ $$\,\,\,\,\,\,\,\,\,$$ $$r$$ $$\,\,\,\,$$ $$\bowtie$$ $$\,\,\,\,$$ $$\left( {{\sigma _{b < 5}}\left( s \right)} \right)$$

Let $$LOJ$$ denote the natural left outer-join operation. Assume that $$r$$ and $$s$$ contain no null values.

Which one of the following queries is NOT equivalent to $$Q$$?

A
$${\sigma _{B < 5}}\left( {r\,\,} \right.$$ $$\bowtie$$ $$\left. {\,\,s} \right)$$
B
$${\sigma _{B < 5}}\left( {r\,\,LOJ\,\,s} \right)$$
C
$$r\,\,LOJ\,\,\left( {{\sigma _{B < 5}}\left( s \right)} \right)$$
D
$${\sigma _{B < 5}}\left( r \right)LOJ\,\,s$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP