1
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Let $$R=(A,B,C,D,E,F)$$ be a relation scheme with the following dependencies: $$C \to F,\,E \to A,\,EC \to D,\,A \to B.$$ Which of the following is a key for $$R?$$
A
$$CD$$
B
$$EC$$
C
$$AE$$
D
$$AC$$
2
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
Consider the schema $$R = \left( {S\,\,T\,\,U\,\,V} \right)$$ and the dependencies $$S \to T,\,\,T \to U,\,\,U \to V$$ and $$V \to S$$ let $$R =$$ $$(R1$$ and $$R2)$$ be a decomposition such that $$R1 \cap R2 \ne \phi .$$ The decomposition is:
A
Not in $$2NF$$
B
In $$2NF$$ but not $$3NF$$
C
In $$3NF$$ but not in $$2NF$$
D
In both $$2NF$$ and $$3NF$$
3
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is/are correct?
A
An SQL query automatically eliminates duplicates.
B
An SQL query will not work if there are no indexes on the relations.
C
SQL permits attribute names to be repeated in the same relation.
D
None of the above.
4
GATE CSE 1999
Subjective
+2
-0
Consider the set of relations

EMP (Employee-no, Dept-no, Employee-name, Salary)
DEPT (Dept-no, Dept-name, Location)

Write an SQL query to:

(a) Find all employee names who work in departments located at "Calcutta" and whose salary is greater than Rs.50,000.

(b) Calculate, for each department number, the number of employees with a salary greater than Rs.1,00,000.

EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12