#### Question

a.

Relational algebra is more powerful than relational calculus

b.

Relational algebra has the same power as relational calculus

c.

Relational algebra has the same power as safe relational calculus

d.

None of the above

Posted under GATE cse question paper DBMS

#### Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

## Similar Questions

###### Discover Related MCQs

Q. Consider the relation "enrolled(student, course)" in which (student, course) is the primary key, and the relation "paid(student, amount)" where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Given the following four queries:

Query1: select student from enrolled where

student in (select student from paid)

Query2: select student from paid where

student in (select student from enrolled)

Query3: select E.student from enrolled E, paid P

where E.student = P.student

Query4: select student from paid where exists

(select * from enrolled where enrolled.student

= paid.student)

Which one of the following statements is correct?

View solution

Q. Given relations r(w, x) and s(y, z), the result of

SELECT DISTINCT w, x

FROM r, s

is guaranteed to be same as r, provided

View solution

Q. Which of the following scenarios may lead to an irrecoverable error in a database system ?

View solution

Q. Consider the following relational schema:

Suppliers(sid:integer, sname:string, city:string, street:string)

Parts(pid:integer, pname:string, color:string)

Catalog(sid:integer, pid:integer, cost:real)

(sid,pid are primary keys)

Assume that, in the suppliers relation above, each supplier and each street within a city has a unique name, and (sname, city) forms a candidate key. No other functional dependencies are implied other than those implied by primary and candidate keys. Which one of the following is TRUE about the above schema?

View solution

Q. In an inventory management system implemented at a trading corporation, there are several tables designed to hold all the information. Amongst these, the following two tables hold information on which items are supplied by which suppliers, and which warehouse keeps which items along with the stock-level of these items. Supply = (supplierid, itemcode) Inventory = (itemcode, warehouse, stocklevel) For a specific information required by the management, following SQL query has been written

Select distinct STMP.supplierid

From Supply as STMP

Where not unique (Select ITMP.supplierid

From Inventory, Supply as ITMP

Where STMP.supplierid = ITMP.supplierid

And ITMP.itemcode = Inventory.itemcode

And Inventory.warehouse = 'Nagpur');

For the warehouse at Nagpur, this query will find all suppliers who

View solution

Q. Consider the following ordering of transactions:

T1 : R(X); T2 : R(X); T1 : w(x); T1 : r(y); T2 : w(x); T2 : Commit; T1: w(y) ; T1: Commit

Which of the following is true?

View solution

Q. Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection (Title, Author, Catalog_no) with in the following functional dependencies:

I. Title Author --> Catalog_no

II. Catalog_no --> Title, Author, Publisher, Year

III. Publisher Title Year --> Price

Assume {Author, Title} is the key for both schemes. Which of the following statements is true?

View solution

Q. Consider the set of relations shown below and the SQL query that follows.

Students: (Roll_number, Name, Date_of_birth)

Courses: (Course number, Course_name, Instructor)

Grades: (Roll_number, Course_number, Grade)

select distinct Name

from Students, Courses, Grades

where Students. Roll_number = Grades.Roll_number

and Courses.Instructor = Korth

and Courses.Course_number = Grades.Course_number

and Grades.grade = A

Which of the following sets is computed by the above query?

View solution

Q. Which option is true about the SQL query given below?

SELECT firstName, lastName

FROM Employee

WHERE lastName BETWEEN 'A%' AND 'D%';

View solution

Q. Consider the following transaction involving two bank accounts x and y.

read(x); x := x – 50; write(x); read(y); y := y + 50; write(y)

The constraint that the sum of the accounts x and y should remain constant is that of

View solution

Q. Which one of the following statements about normal forms is FALSE?

View solution

Q. Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1 and R2 do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model?

View solution

Q. SQL allows tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below:

select * from R where a in (select S.a from S)

View solution

Q. Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below.

T1: r1(X); r1(Z); w1(X); w1(Z)

T2: r2(Y); r2(Z); w2(Z)

T3: r3(Y); r3(X); w3(Y)

S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z);

w3(Y); w2(Z); r1(Z); w1(X); w1(Z)

S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z);

r2(Z); w3(Y); w1(X); w2(Z); w1(Z)

Which one of the following statements about the schedules is TRUE?

View solution

Q. Consider the following Employee table

ID salary DeptName

1 10000 EC

2 40000 EC

3 30000 CS

4 40000 ME

5 50000 ME

6 60000 ME

7 70000 CS

How many rows are there in the result of following query?

SELECT E.ID

FROM Employee E

WHERE EXISTS (SELECT E2.salary

FROM Employee E2

WHERE E2.DeptName = 'CS'

AND E.salary > E2.salary)

View solution

Q. Which level of locking provides the highest degree of concurrency in a relational data base?

View solution

Q. Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies

F = {

{P, R} → {S,T},

{P, S, U} → {Q, R}

}

Which of the following is the trivial functional dependency in F+ is closure of F?

View solution

Q. Suppose a database schedule S involves transactions T1, ....Tn. Construct the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?

View solution

Q. Consider the following functional dependencies in a database:

Data_of_Birth → Age

Age → Eligibility

Name → Roll_number

Roll_number → Name

Course_number → Course_name

Course_number → Instructor

(Roll_number, Course_number) → Grade

The relation (Roll_number, Name, Date_of_birth, Age) is:

View solution

Q. Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold: {A–>B, BC–>D, E–>C, D–>A}. What are the candidate keys of R?

View solution

# Suggested Topics

Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!