3NF
GATE CSE & IT · Database Management Systems - Normalization · 1995-2026
Study anchor
Source-book anchor pending for this concept.
Practice action
Start latest PYQPYQs in this concept
All concepts →In the context of relational database normalization, which of the following statements is/ are true?
Consider the following relational schema along with all the functional dependencies that hold on them. R1(A, B, C, D, E): { D → E, EA → B, EB → C} R2(A, B, C, D): { A → D, A → B, C...
Consider a relational schema team (name, city, owner), with functional dependencies {name → city, name → owner}. The relation team is decomposed into two relations, t1(name, city)...
Consider a relational schema team(name, city, owner), with functional dependencies \{name $\rightarrow$ city, name $\rightarrow$ owner}. The relation team is decomposed into two re...
Consider the following relational schema along with all the functional dependencies that hold on them. $$\begin{aligned} & R 1(A, B, C, D, E):\{D \rightarrow E, E A \rightarrow B,...
Consider a relational table R that is in 3NF, but not in BCNF. Which one of the following statements is TRUE?
Consider an Entity-Relationship (ER) model in which entity sets E 1 and E 2 are connected by an m : n relationship R 12 . E 1 and E 3 are connected by a 1 : n (1 on the side of E 1...
Which of the following is TRUE?
Consider the following relational schemes for a library database. Book ( Title, Author, Catalog_ no, Publisher, Year, Pr ice ) Collection ( Title, Author, Catalog no ) With in the...
Which one of the following statements if FALSE?
Which one of the following statements about normal forms is FALSE?
The relation scheme student Performance (Name, CourseNo, RollNo, Grade) has the following functional dependencies: Name, courseNo $$\,\, \to \,\,$$ grade RollNo, courseNo $$\,\, \t...
A relation Empdt $$1$$ is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, for any given st...
Relation $$R$$ is decomposed using a set of functional dependencies, $$F,$$ and relation $$S$$ is decomposed using another set of functional dependencies, $$G.$$ One decomposition...
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 decompos...
Which normal form is considered adequate for normal relational database design?
(a) Consider the relation scheme $$R(A, B, C)$$ with the following functional dependencies: $$\eqalign{ & A,B \to C \cr & \,\,\,\,\,\,C \to A \cr} $$ Show that the scheme $$R$$ is...