GATE DA 2024 Set 1 — Question 26
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasySelection & ProjectionRelational AlgebraDatabase Management & WarehousingSet Operations
Database Management & Warehousing → Relational Algebra → Selection & Projection
Last updated
Question
Consider a database that includes the following relations:Defender(name, rating, side, goals)
Forward(name, rating, assists, goals)
Team(name, club, price)Which ONE of the following relational algebra expressions checks that every name occurring in Team appears in either Defender or Forward, where denotes the empty set?
Forward(name, rating, assists, goals)
Team(name, club, price)Which ONE of the following relational algebra expressions checks that every name occurring in Team appears in either Defender or Forward, where denotes the empty set?
Correct answer
(C) ₙₐₘₑ(Team) (ₙₐₘₑ(Defender) ∪ ₙₐₘₑ(Forward)) = φ
Solution
The query requires checking if the set of names in the Team relation is a subset of the union of names in the Defender and Forward relations.Let be the set of names in Team, be the set of names in Defender, and be the set of names in Forward.
The condition is: .In set theory, is equivalent to .
Therefore, the condition is equivalent to:
The condition is: .In set theory, is equivalent to .
Therefore, the condition is equivalent to:
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE DA question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Relational Algebra
2026 Set 1 Q17 be a relational schema with functional dependency set…2026 Set 1 Q18Consider that the visualization of a 3-dimensional data cube is showing Sales Quantity for each…2026 Set 1 Q26Consider two relations r and s defined on the relational schemas R(A,B) and S(E,C), respectively. A…2026 Set 1 Q32In a relational database, a B+ Tree Index is to be constructed for a relation on a key field. In a…2026 Set 1 Q41Consider a B+ Tree where the maximum number of key values in each leaf node is 2 and the maximum…