GATE CSE 2003 | Relational Algebra Question 26 | Database Management System

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Consider the following SQL query:

Select distinct a₁, a₂, ..., a_n 

From r₁, r₂, ..., r_m 

Where P;

For an arbitrary predicate P, this query is equivalent to which of the following relational algebra expressions?

$$\prod\limits_{{a_1},{a_2},....,{a_n}} {{\sigma _p}} \left( {{r_1} \times {r_2} \times .... \times {r_m}} \right)$$

$$\prod\limits_{{a_1},{a_2},....,{a_n}} {{\sigma _p}} \left( {{r_1} \Join {r_2} \Join .... \Join {r_m}} \right)$$

$$\prod\limits_{{a_1},{a_2},....,{a_n}} {{\sigma _p}} \left( {{r_1} \cup {r_2} \cup .... \cup {r_m}} \right)$$

$$\prod\limits_{{a_1},{a_2},....,{a_n}} {{\sigma _p}} \left( {{r_1} \cap {r_2} \cap .... \cap {r_m}} \right)$$

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

With regard to the expressive power of the formal relational query languages, which of the following statements is true?

Relational algebra is more powerful than relational calculus.

Relational algebra has the same power as relational calculus.

Relational algebra has the same power as safe relational calculus.

None of the above

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

Given the relations

employee (name, salary, deptno), and
department (deptno, deptname, address)

Which of the following queries cannot be expressed using the basic relational algebra operations $$\left(\sigma, \pi,\times ,\Join, \cup, \cap,-\right)$$?

Department address of every employee

Employees whose name is the same as their department name

The sum of all employee’s salaries

All employees of a given department

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then the maximum and minimum sizes of the join respectively are

m + n and 0

mn and 0

m + n and |m – n|

mn and m + n

PREVIOUS NEXT