Q. Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and R2 form a decomposition of R. Then the decomposition is a lossless join decomposition of R provided that:

View solution

Q. In a heap, every element is …………… of all the elements in the subtree.

View solution

Q. A superkey for an entity consists of:

View solution

Q. Which of the following set of keywords constitutes a mapping in SQL?

View solution

Q. If a relation is in 2NF then:

View solution

Q. Which of the following is true ?

View solution

Q. Consider the query : SELECT student_name FROM student_data WHERE rollno (SELECT rollno FROM student_marks WHERE SEM1_MARK=SEM2_MARK);

Which of the following is true?

View solution

Q. A primary key for an entity is:

View solution

Q. Aggregate functions in SQL are:

View solution

Q. If a relation is in 2NF and 3NF forms then:

View solution

Q. The end of an SQL command is denoted by:

View solution

Q. Consider  the  query  :  SELECT  student_name  FROM  students  WHERE class_name=(SELECT  class_name  FROM  students  WHERE  math_marks=100); what will be the output ?

View solution

Q. Which of the following statements is wrong?

View solution

Q. A recursive foreign key is a:

View solution

Q. A sub class having more than one super class is called:

View solution

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

F={A→B,AD→C,B→F,A→E}.

Which of the following is Candidate Key?

View solution

Q. Which statement is false regarding data independence?

View solution

Q. In DBMS, deferred update means:

View solution

Q. Which statement is false regarding data independence ?

View solution

Q. Two phase protocol in a database management system is:

View solution