1
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$$
2
GATE CSE 1998
Subjective
+2
-0
Consider the following database relations containing the attributes
Book–id
Subject–Category–of–book
Name–of–Author
Nationality–of–Author
With book–id as the primary key.
(a) What is the highest normal form satisfied by this relation?

(b) Suppose the attributes Book–title and Author–address are added to the relation, and the primary key is changed to {Name–of–Author, Book–title}, what will be the highest normal form satisfied by the relation?

3
GATE CSE 1998
Subjective
+2
-0
Consider the following database relations containing the attributes
Book–id
Subject–Category–of–book
Name–of–Author
Nationality–of–Author
With book–id as the primary key.
(a) What is the highest normal form satisfied by this relation?

(b) Suppose the attributes Book–title and Author–address are added to the relation, and the primary key is changed to {Name–of–Author, Book–title}, what will be the highest normal form satisfied by the relation?

4
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
For a database relation $$R(a,b,c,d),$$ where the domains of $$a, b, c, d$$ include only atomic values, only the following functional dependencies and those that can be inferred from them hold:
$$a \to c\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,b \to d$$
This relation is
A
In $$1$$ $$NF$$ but not in $$2$$ $$NF$$
B
In $$2$$ $$NF$$ but not in $$3$$ $$NF$$
C
In $$3$$ $$NF$$
D
None of the above
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12