Database Management System
Er Diagrams
Marks 1Marks 2
Functional Dependencies and Normalization
Marks 1Marks 2
Structured Query Language
Marks 1Marks 2
Relational Algebra
Marks 1Marks 2
Transactions and Concurrency
Marks 1Marks 2
File Structures and Indexing
Marks 1Marks 2
1
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-0.3
A table has fields, $$F1, F2, F3, F4, F5,$$ with the following functional dependencies:
$$F1 \to F3.\,F2 \to F4.\,\,\,\left( {F1\,.\,F2} \right) \to F5$$ in terms of Normalization, this table is in
A
$$1NF$$
B
$$2NF$$
C
$$3NF$$
D
None of these
2
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following statements about normal forms is FALSE?
A
$$BCNF$$ is stricter than $$3NF$$
B
Lossless, dependency $$-$$ preserving decomposition into $$3NF$$ is always possible
C
Lossless, dependency - preserving decomposition into $$BCNF$$ is always possible
D
Any relation with two attributes is in $$BCNF$$
3
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
Relation $$R$$ with an associated set of functional dependencies, $$F,$$ is decomposed into $$BCNF.$$ The redundancy (arising out of functional dependencies) in the resulting set of relations is
A
Zero
B
More than zero but less than that of an equivalent $$3NF$$ decomposition
C
Proportional to the size of $${F^ + }$$
D
Indeterminate
4
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
A
Dependency preserving and lossless join
B
Lossless join but not dependency preserving
C
Dependency preserving but not lossless join
D
Not dependency preserving and not lossless join
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization