Skip to content
GATETECH

GATE CS Normal Forms questions

Practise Normal Forms questions for GATE CS. Explore official PYQs and original topic-wise quizzes, check answers and view available solutions. Free, no sign-in.

Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.

8 on this page
Official PYQ1999DatabasesNormal FormsMCQ · 1 mark
Consider the schema R=(S,T,U,V)R=(S,T, U, V) and the dependencies S→T,T→U,U→VS \rightarrow T, T \rightarrow U, U \rightarrow V and V→SV \rightarrow S. Let R=(R1 and R2)R = (R1\text{ and } R2) be a decomposition such that R1∩R2≠ϕR1 \cap R2 \neq \phi. The decomposition is
Official PYQ1999DatabasesNormal FormsMCQ · 1 mark
Let R=(A,B,C,D,E,F)R = (A, B, C, D, E, F) be a relation scheme with the following dependencies C→F,E→A,EC→D,A→BC \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B. Which one of the following is a key for RR?
Official PYQ1998DatabasesNormal FormsMCQ · 1 mark
Which normal form is considered adequate for normal relational database design?
Official PYQ1997DatabasesNormal FormsMCQ · 1 mark
For a database relation R(a,b,c,d)R(a, b, c, d), where the domains a,b,c,da, b, c, d include only atomic values, only the following functional dependencies and those that can be inferred from them hold a→ca \rightarrow c b→db \rightarrow d This relation is
Official PYQ1994DatabasesNormal FormsNAT · 1 mark
State True or False with reason Logical data independence is easier to achieve than physical data independence.
Official PYQ1994DatabasesNormal FormsNAT · 1 mark
State True or False with reason There is always a decomposition into Boyce-Codd normal form (BCNF) that is lossless and dependency preserving.
Official PYQ1990DatabasesNormal FormsMSQ · 1 mark
Indicate which of the following statements are true: A relational database which is in 33NF may still have undesirable data redundancy because there may exist:
Official PYQ1987DatabasesNormal FormsNAT · 1 mark
State whether the following statements are TRUE or FALSE: A relation rr with schema (X,Y)(X, Y) satisfies the function dependency X→YX \rightarrow Y, The tuples ⟨1,2⟩\langle 1, 2\rangle and ⟨2,2⟩\langle 2, 2 \rangle can both be in rr simultaneously.