GATE DA 2024 — Question 26

Database Management and Warehousingrelational model: relational algebra, tuple calculus, SQLMCQ1 mark · −1/3 if wrongMedium

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 \(\phi\) denotes the empty set?
  1. A
    \(\Pi_{name}(\text{Team}) \setminus (\Pi_{name}(\text{Defender}) \cap \Pi_{name}(\text{Forward})) = \phi\)
  2. B
    \((\Pi_{name}(\text{Defender}) \cap \Pi_{name}(\text{Forward})) \setminus \Pi_{name}(\text{Team}) = \phi\)
  3. C
    \(\Pi_{name}(\text{Team}) \setminus (\Pi_{name}(\text{Defender}) \cup \Pi_{name}(\text{Forward})) = \phi\)
  4. D
    \((\Pi_{name}(\text{Defender}) \cup \Pi_{name}(\text{Forward})) \setminus \Pi_{name}(\text{Team}) = \phi\)
Practise the full 2024 paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkDatabase System Concepts (Korth)Normalisation, SQL, transactions and indexing — the DBMS syllabus in one book.
Practise more on relational model: relational algebra, tuple calculus, SQLTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group