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 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
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?$$
A
$$CD$$
B
$$EC$$
C
$$AE$$
D
$$AC$$
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which normal form is considered adequate for normal relational database design?
A
$$2$$ $$NF$$
B
$$5$$ $$NF$$
C
$$4$$ $$NF$$
D
$$3$$ $$NF$$
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.
A
TRUE
B
FALSE
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