1
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Given the following relation instance
$$\eqalign{ & X\,\,\,\,\,Y\,\,\,\,\,Z \cr & \,\,1\,\,\,\,\,\,4\,\,\,\,\,\,2 \cr & \,\,1\,\,\,\,\,\,5\,\,\,\,\,\,3 \cr & \,\,1\,\,\,\,\,\,6\,\,\,\,\,\,3 \cr & \,\,3\,\,\,\,\,\,2\,\,\,\,\,\,2 \cr} $$
$$\eqalign{ & X\,\,\,\,\,Y\,\,\,\,\,Z \cr & \,\,1\,\,\,\,\,\,4\,\,\,\,\,\,2 \cr & \,\,1\,\,\,\,\,\,5\,\,\,\,\,\,3 \cr & \,\,1\,\,\,\,\,\,6\,\,\,\,\,\,3 \cr & \,\,3\,\,\,\,\,\,2\,\,\,\,\,\,2 \cr} $$
Which of the following functional dependencies are satisfied by the instance?
2
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
Consider the schema $$R = \left( {S\,\,T\,\,U\,\,V} \right)$$ and the dependencies $$S \to T,\,\,T \to U,\,\,U \to V$$ and $$V \to S$$ let $$R =$$ $$(R1$$ and $$R2)$$ be a decomposition such that $$R1 \cap R2 \ne \phi .$$ The decomposition is:
3
GATE CSE 1998
Subjective
+2
-0
Consider the following database relations containing the attributes
Book–id
Subject–Category–of–book
Name–of–Author
Nationality–of–Author
With book–id as the primary key.
(a) What is the highest normal form satisfied by this relation?
Book–id
Subject–Category–of–book
Name–of–Author
Nationality–of–Author
With book–id as the primary key.
(a) What is the highest normal form satisfied by this relation?
(b) Suppose the attributes Book–title and Author–address are added to the relation, and the primary key is changed to {Name–of–Author, Book–title}, what will be the highest normal form satisfied by the relation?
4
GATE CSE 1998
Subjective
+2
-0
Consider the following database relations containing the attributes
Book–id
Subject–Category–of–book
Name–of–Author
Nationality–of–Author
With book–id as the primary key.
(a) What is the highest normal form satisfied by this relation?
Book–id
Subject–Category–of–book
Name–of–Author
Nationality–of–Author
With book–id as the primary key.
(a) What is the highest normal form satisfied by this relation?
(b) Suppose the attributes Book–title and Author–address are added to the relation, and the primary key is changed to {Name–of–Author, Book–title}, what will be the highest normal form satisfied by the relation?
Questions Asked from Functional Dependencies and Normalization (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2021 Set 2 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2019 (1)
GATE CSE 2015 Set 1 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2013 (2)
GATE CSE 2008 (3)
GATE CSE 2007 (1)
GATE CSE 2006 (2)
GATE CSE 2005 (2)
GATE CSE 2004 (2)
GATE CSE 2003 (1)
GATE CSE 2002 (2)
GATE CSE 2001 (1)
GATE CSE 2000 (1)
GATE CSE 1999 (1)
GATE CSE 1998 (2)
GATE CSE 1997 (2)
GATE CSE 1995 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages