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 2008
MCQ (Single Correct Answer)
+2
-0.6
Let $$R\left( {A,\,B,\,C,\,D,E,P,G} \right)$$ be a relational schema in which the following functional dependencies are known to hold: $$AB \to CD,\,\,DE \to P,\,\,C \to E.\,\,P \to C$$ and $$B \to G.$$ The relational schema $$R$$ is
A
In $$BCNF$$
B
In $$3NF,$$ but not in $$3NF$$
C
In $$2NF,$$ but not in $$3NF$$
D
Not in $$2NF$$
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Let $$R\left( {A,B,C,D} \right)$$ be a relational schema with the following functional dependencies:
$$A \to B,\,\,B \to C,\,\,C \to D$$ and $$D \to B.$$
The decomposition of $$R$$ into $$(A,B), (B,C)$$ and $$(B,D)$$
A
gives a lossless join, and is dependency preserving
B
gives a lossless join, but is not dependency preserving.
C
does not give a lossless join, but is dependency preserving
D
does not give a lossless join and is not dependency preserving
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
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 following functional dependencies:
$${\rm I}.\,\,\,\,\,\,$$ Title Author $$ \to $$ Catalog_no
$${\rm II}.\,\,\,\,$$ Catalog_no $$ \to $$ Title Author Publisher Year
$${\rm III}.\,\,\,\,$$ Publisher Title Year $$ \to $$ Price

Assume { Author, Title } is the key for both schemes. Which of the following statements is true?

A
Both Book and Collection are in $$BCNF$$
B
Both Book and Collection are in $$3$$ $$NF$$ only
C
Book is in $$2$$ $$NF$$ and Collection is in $$3$$ $$NF$$
D
Both Book and Collection are in $$2$$ $$NF$$ only
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following statements if FALSE?
A
Any relation with two attributes is in $$BCNF.$$
B
A relation in which every key has only one attribute is in $$2NF$$.
C
A prime attribute can be transitively dependent on a key in a $$3$$ $$N$$F relation.
D
A prime attribute can be transitively dependent on a key in a $$BCNF$$ relation.
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