1
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Consider a schema $$R(A,B,C,D)$$ and functional dependencies $$A \to B\,\,$$ and $$C \to D\,\,$$. Then the decomposition of $$R$$ into $${R_1}\left( {AB} \right)$$ and $${R_2}\left( {CD} \right)$$ is
2
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?$$
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which normal form is considered adequate for normal relational database design?
4
GATE CSE 1994
True or False
+1
-0
State True or False with reason. There is always a decomposition into Boyce-codd normal form $$(BCNF)$$ that is lossless and dependency preserving.
Questions Asked from Functional Dependencies and Normalization (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude