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 2004
MCQ (Single Correct Answer)
+2
-0.6
The relation scheme student Performance (Name, CourseNo, RollNo, Grade) has the following functional dependencies:

Name, courseNo $$\,\, \to \,\,$$ grade
RollNo, courseNo $$\,\, \to \,\,$$ grade
$$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$$$\,\,\,\,\,\,\,\,\,$$ Name $$\,\, \to \,\,$$ rollNo
$$\,\,\,\,\,\,\,\,\,\,\,\,\,$$$$\,\,\,\,\,\,\,\,\,$$ RollNo $$\,\, \to \,\,$$ name

The highest normal form of this relation scheme is

A
$$2\,NF$$
B
$$3\,NF$$
C
$$BCNF$$
D
$$4\,NF$$
2
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
A relation Empdt $$1$$ is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, for any given street city and the state, there is just one pincode. In normalization terms, Empdt$$1$$ is a relation in
A
$$1NF$$ only
B
$$2NF$$ and hence also in $$1NF$$
C
$$3NF$$ and hence also in $$2NF$$ and $$1NF$$
D
$$BCNF$$ and hence also in $$3NF,$$ $$2NF$$ and $$1NF$$
3
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
Consider the following functional dependencies in a database.
$$\eqalign{ & \,\,\,\,Date\,\,of\,\,Birth\,\, \to \,\,Age \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,Age\,\, \to \,\,Eligibility \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,Name\,\, \to \,\,Roll\_number \cr & \,\,\,\,\,Roll\_number\,\, \to \,\,Name \cr & Course\_number\, \to \,\,Course\_name \cr & Course\_number\, \to Instructor \cr & (Roll\_Number,\,Course\_number)\,\, \to \,\,Grade \cr} $$

The relation (Roll_number, Name, Date_of_Birth, Age) is

A
In $$2$$ $$NF$$ but not in $$3$$ $$NF$$
B
In $$3$$ $$NF$$ but not in $$BCNF$$
C
In $$BCNF$$
D
None of the above
4
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
From the following instance of a relation schema $$R(A, B, C),$$ we can conclude that: GATE CSE 2002 Database Management System - Functional Dependencies and Normalization Question 30 English
A
A functionally determines $$B$$ and $$B$$ functionally determines $$C$$
B
A functionally determines $$B$$ and $$B$$ does not functionally determines $$C$$
C
$$B$$ does not functionally determines $$C$$
D
A does not functionally determine $$B$$ and $$B$$ does not functionally determine $$C$$
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