GATE DA 2025 Set 1 — Question 17
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 & WarehousingJoin & Division
Database Management & Warehousing → Relational Algebra → Join & Division
Last updated
Question
Consider the following three relations:
Car (model, year, serial, color)Make (maker, model)Own (owner, serial)A tuple in Car represents a specific car of a given model, made in a given year, with a serial number and a color. A tuple in Make specifies that a maker company makes cars of a certain model. A tuple in Own specifies that an owner owns the car with a given serial number. Keys are underlined; (owner, serial) together form key for Own. ( denotes natural join)Which one of the following options describes what the above expression computes?Correct answer
(C) All owners of a red car made by ABC
Solution
The expression is evaluated as follows:
1.: Selects tuples from
Make where the maker is "ABC".2.: Joins
Car with the result of step 1. This filters cars to only those models made by "ABC".3.: Selects tuples from the result of step 2 where the color is "red". We now have all red cars made by "ABC".
4.: Joins
Own with the result of step 3 on serial. This associates owners with the specific red cars made by "ABC".5.: Projects the
Thus, the query returns the names of all owners who own a red car made by ABC.owner attribute.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…