Consider the relational algebra expression:

Assume that the join is based on the department identifier and that the condition Dept='CSE' refers only to attributes of DEPARTMENT. Which transformation is generally beneficial for reducing the number of tuples participating in the join?

A B+ tree index has a root node, two intermediate levels, and a leaf level. Assuming the root is already in memory, how many index-node disk accesses are required to reach a leaf, if each remaining node must be read from disk?

Consider the following relation 

and answer which statement(s) is/are correct ? Select check box to represent the correct statement

Match the problem with its root cause

Say true or false to the following statements

Data dictionary is managed by the storage manager in the Database

Which is not a data model

 which operation(s)  is/are not a part of Relational algebra ?

Say true or false to the following statements: 

Query processor is capable of interpreting and compiling the SQL statements

Match the scenario with appropriate user

Consider the following relation 

Customer (CustomerID, AadhaarNo, Email, Phoneno, name, City) 

Product (ProductID, productname, category, price)

Order(OrderID, CustomerID, OrderDate, Amount) 

OrderItem (OrderID, ProductID, Quantity, Unitprice)

Match the appropriate choice