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 2021 Set 2
MCQ (Single Correct Answer)
+1
-0.33

Consider the following statements S1 and S2 about the relational data model:

S1: A relation scheme can have at most one foreign key.

S2: A foreign key in a relation scheme R cannot be used to refer to tuples of R.

Which one of the following choices is correct? 

A
S1 is true and S2 is false.  
B
Both S1 and S2 are true.  
C
Both S1 and S2 are false.  
D
S1 is false and S2 is true. 
2
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
A database of research articles in a journal uses the following schema.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)
The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → TITLE
(VOLUME, NUMBER) → YEAR
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → PRICE
The database is redesigned to use the following schemas.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)
(VOLUME, NUMBER, YEAR)
Which is the weakest normal form that the new database satisfies, but the old one does not?
A
1NF
B
2NF
C
3NF
D
BCNF
3
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider the relation $$X\left( {P,Q,R,S,T,U} \right)$$ with the following set of functional dependencies
$$\eqalign{ & F = \left\{ \, \right. \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\left\{ {P,R} \right\} \to \left\{ {S,T} \right\}, \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\left\{ {P,S,U} \right\} \to \left\{ {Q,R} \right\} \cr & \,\,\,\,\,\,\,\,\,\,\left. \, \right\} \cr} $$
Which of the following is the trivial functional dependency in $${F^ + },$$ where $${F^ + }$$ is closure of $$f$$ ?
A
$$\left\{ {P,R} \right\} \to \left\{ {S,T} \right\}$$
B
$$\left\{ {P,R} \right\} \to \left\{ {R,T} \right\}$$
C
$$\left\{ {P,S} \right\} \to \left\{ S \right\}$$
D
$$\left\{ {P,S,U} \right\} \to \left\{ Q \right\}$$
4
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
A prime attribute of a relation scheme $$R$$ is an attribute that appears
A
In all candidate keys of $$R$$
B
In some candidate key of $$R.$$
C
In a foreign key of $$R.$$
D
Only in the primary key of $$R.$$
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