Q. Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S:

I. πA,B(R⋈S)
II. R⋈πB(S)
III. R∩(πA(R) Χ πB(S))
IV. πA,R.B(R Χ S) where R.B refers to the column B in table R.

One can determine that:

View solution

Q. Which of the following statements is TRUE?

D1: The decomposition of the schema R(A,B,C) into R1(A,B) and R2(A,C) is always lossless.
D2: The decomposition of the schema R(A,B,C,D,E) having AD→B, C→DE, B→AE, AE→C into R1(A,B,D) and R2(A,C,D,E) is lossless.

View solution

Q. Consider the following ORACLE relations:

R(A,B,C) = {<1,2,3>, <1,2,0>, <1,3,1>, <6,2,3>, <1,4,2>, <3,1,4>}
S(B,C,D) = {<2,3,7>, <1,4,5>, <1,2,3>, <2,3,4>, <3,1,4>}

Consider the following two SQL queries SQ1 and SQ2:

SQ1: SELECT R.B, AVG(S.B)
FROM R, S
WHERE R.A = S.C AND S.D < 7
GROUP BY R.B;

SQ2: SELECT DISTINCT S.B, MIN (S.C)
FROM S
GROUP BY S.B
HAVING COUNT (DISTINCT S.D) > 1;

If M is the number of tuples returned by SQ1 and N is the number of tuples returned by SQ2 then

View solution

Q. Semi-join strategies are techniques for query processing in distributed database system. Which of the following is a semi-join technique?

View solution

Q. Consider a “CUSTOMERS” database table having a column “CITY” filled with all the names of Indian cities (in capital letters). The SQL statement that finds all cities that have “GAR” somewhere in its name, is:

View solution

Q. Match the following database terms to their functions:

List-I                                       List-II
(a) Normalization                     (i) Enforces match of primary key to foreign key
(b) Data Dictionary                  (ii) Reduces data redundancy in a database
(c) Referential Integrity           (iii) Define view(s) of the database for particular user(s).
(d) External Schema               (iv) Contains metadata describing database structure.

Codes:
      (a)   (b)   (c)    (d)

View solution

Q. Which of the following provides the best description of an entity type?

View solution

Q. Data which improves the performance and accessibility of the database are called:

View solution

Q. A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies:

F={AD→E, BE→F, B→C, AF→G}

Which of the following is a candidate key?

View solution

Q. The hash function used in double hashing is of the form:

View solution

Q. Which of the following statements regarding the features of the object-oriented approach to databases are true ?

(a) The ability to develop more realistic models of the real world.
(b) The ability to represent the world in a non-geometric way.
(c) The ability to develop databases using natural language approaches.
(d) The need to split objects into their component parts.
(e) The ability to develop database models based on location rather than state and behaviour.

View solution

Q. Consider the following database table :

Create table test(
one integer,
two integer,
primary key(one),
unique(two),
check(one≥1 and ≤10),
check(two≥1 and ≤5) );

How many data records/tuples atmost can this table contain ?

View solution

Q. Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 :

SQ1 : Select *
From R Full Join S
On R.B=S.B;
SQ2 : Select *
From R Inner Join S
On R.B=S.B;

The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by :

View solution

Q. Consider the following three SQL queries (Assume the data in the people table) :

(a) Select Name from people where Age>21;
(b) Select Name from people where Height>180;
(c) Select Name from people where (Age>21) or (Height>180);

If the SQL queries (a) and (b) above, return 10 rows and 7 rows in the result set respectively, then what is one possible number of rows returned by the SQL query (c) ?

View solution

Q. Manager's salary details are hidden from the employee. This is called as

View solution

Q. Which of the following statements is false ?

View solution

Q. A clustering index is created when ................

View solution

Q. Let R ={A, B, C, D, E, F} be a relation schema with the following dependencies C→F,E→A,EC→D,A→B
Which of the following is a key for R ?

View solution

Q. Match the following:

List-I                                          List-II
a. DDL                                        i. LOCK TABLE
b. DML                                       ii. COMMIT
c. TCL                                        iii. Natural Difference
d. BINARY Operation             iv. REVOKE

​Codes:
      a    b    c    d

View solution

Q. The student marks should not be greater than 100. This is

View solution