Theory-of-Computation
October 3, 2023
Nielit Scientist-C 2016 march
October 3, 2023
Theory-of-Computation
October 3, 2023
Nielit Scientist-C 2016 march
October 3, 2023

GATE 2006-IT

Question 14

Consider the relations r1(P, Q, R) and r2(R, S, T) with primary keys P and R respectively. The relation r1 contains 2000 tuples and r2 contains 2500 tuples. The maximum size of the join r1⋈ r2 is :

A
2000
B
2500
C
4500
D
5000
Question 14 Explanation: 
r1⋈ r2 is a join operation done on the common attribute R. So this can have 2000 tuples.
Correct Answer: A
Question 14 Explanation: 
r1⋈ r2 is a join operation done on the common attribute R. So this can have 2000 tuples.

Leave a Reply

Your email address will not be published. Required fields are marked *