Computer Science · Database Management Systems
Consider the relational schemes R(A, B, C) and S(D, E, F). Given the relational algebra expression: ΠA, F(σC=D(R × S)) Which of the following tuple relational calculus (TRC) expressions is equivalent to the above expression?
- 1{ t | ∃p ∈ R ∃q ∈ S (t[A] = p[A] ∨ t[F] = q[F]) }
- 2{ t | ∃p ∈ R ∃q ∈ S (t[A] = p[A] ∨ t[F] = q[F] ∨ p[C] = q[D]) }
- 3{ t | ∃p ∈ R ∃q ∈ S (t[A] = p[A] ∧ t[F] = p[F] ∧ p[C] = q[D]) }
- 4{ t | ∃p ∈ R ∃q ∈ S (t[A] = p[A] ∧ t[F] = q[F] ∧ p[C] = q[D]) }✓
Correct answer
{ t | ∃p ∈ R ∃q ∈ S (t[A] = p[A] ∧ t[F] = q[F] ∧ p[C] = q[D]) }
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems