Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for database-normalization
128
votes
6
answers
1
GATE CSE 2001 | Question: 2.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition?$A \rightarrow B, B \rightarrow CD$$A \righta...
Kathleen
52.1k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
databases
database-normalization
normal
+
–
101
votes
3
answers
2
GATE IT 2008 | Question: 61
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies : $A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, B), (B, C), (B, D)$ gives a ... a lossless join, but is not dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies :$A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, ...
Ishrat Jahan
35.5k
views
Ishrat Jahan
asked
Oct 28, 2014
Databases
gateit-2008
databases
database-normalization
normal
+
–
69
votes
11
answers
3
GATE CSE 1999 | Question: 2.7, UGCNET-June2014-III: 25
Consider the schema $R=(S,T, U, V)$ and the dependencies $S \rightarrow T, T \rightarrow U, U \rightarrow V$ and $V \rightarrow S$. Let $R = (R1\text{ and } R2)$ be a decomposition such that $R1 \cap R2 \neq \phi$. The decomposition ... but not $\textsf{3NF}$ in $\textsf{3NF}$ but not in $\textsf{2NF}$ in both $\textsf{2NF}$ and $\textsf{3NF}$
Consider the schema $R=(S,T, U, V)$ and the dependencies $S \rightarrow T, T \rightarrow U, U \rightarrow V$ and $V \rightarrow S$. Let $R = (R1\text{ and } R2)$ be a dec...
Kathleen
27.4k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
database-normalization
normal
ugcnetjune2014iii
+
–
60
votes
5
answers
4
GATE CSE 2008 | Question: 69
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies: $\text{Title Author }\rightarrow\text{ Catalog_no}$ ... $\text{2NF}$ and Collection in $\text{3NF}$ Both Book and Collection are in $\text{2NF}$ only
Consider the following relational schemes for a library database:Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no)with the fo...
Kathleen
28.1k
views
Kathleen
asked
Sep 12, 2014
Databases
gatecse-2008
databases
database-normalization
normal
+
–
70
votes
6
answers
5
GATE CSE 2007 | Question: 62, UGCNET-June2014-II: 47
Which one of the following statements is $\text{FALSE}$? Any relation with two attributes is in $\text{BCNF}$ A relation in which every key has only one attribute is in $\text{2NF}$ A prime attribute can be transitively dependent on ... a $\text{3 NF}$ relation A prime attribute can be transitively dependent on a key in a $\text{BCNF}$ relation
Which one of the following statements is $\text{FALSE}$?Any relation with two attributes is in $\text{BCNF}$A relation in which every key has only one attribute is in $\t...
Kathleen
24.3k
views
Kathleen
asked
Sep 21, 2014
Databases
gatecse-2007
databases
database-normalization
normal
ugcnetcse-june2014-paper2
+
–
47
votes
5
answers
6
GATE CSE 2012 | Question: 2
Which of the following is TRUE? Every relation in $\text{3NF}$ is also in $\text{BCNF}$ A relation $\text{R}$ is in $\text{3NF}$ if every non-prime attribute of $\text{R}$ is fully functionally dependent on every key of $R$ Every relation in $\text{BCNF}$ is also in $\text{3NF}$ No relation can be in both $\text{BCNF}$ and $\text{3NF}$
Which of the following is TRUE?Every relation in $\text{3NF}$ is also in $\text{BCNF}$A relation $\text{R}$ is in $\text{3NF}$ if every non-prime attribute of $\text{R}$ ...
gatecse
19.8k
views
gatecse
asked
Aug 5, 2014
Databases
gatecse-2012
databases
easy
database-normalization
+
–
62
votes
6
answers
7
GATE CSE 2009 | Question: 56
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... $\text{2NF}$ but not in $\text{3NF}$ The schema is not in $\text{2NF}$
Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\tex...
go_editor
28.2k
views
go_editor
asked
Apr 23, 2016
Databases
gatecse-2009
databases
sql
database-normalization
normal
+
–
24
votes
2
answers
8
GATE CSE 2019 | Question: 32
Let the set of functional dependencies $F=\{QR \rightarrow S, \: R \rightarrow P, \: S \rightarrow Q \}$ hold on a relation schema $X=(PQRS)$. $X$ is not in BCNF. Suppose $X$ is decomposed into two schemas $Y$ and $Z$ ... and $Z$ is dependency preserving and lossless Which of the above statements is/are correct? Both I and II I only II only Neither I nor II
Let the set of functional dependencies $F=\{QR \rightarrow S, \: R \rightarrow P, \: S \rightarrow Q \}$ hold on a relation schema $X=(PQRS)$. $X$ is not in BCNF. Suppose...
Arjun
13.4k
views
Arjun
asked
Feb 7, 2019
Databases
gatecse-2019
databases
database-normalization
2-marks
+
–
37
votes
5
answers
9
GATE CSE 2018 | Question: 42
Consider the following four relational schemas. For each schema , all non-trivial functional dependencies are listed, The bolded attributes are the respective primary keys. $\text{Schema I:}$ Registration(rollno, courses) Field courses' is a set-valued attribute containing the ... $\text{Schema I}$ $\text{Schema II}$ $\text{Schema III}$ $\text{Schema IV}$
Consider the following four relational schemas. For each schema , all non-trivial functional dependencies are listed, The bolded attributes are the respective primary key...
gatecse
11.9k
views
gatecse
asked
Feb 14, 2018
Databases
gatecse-2018
databases
database-normalization
normal
2-marks
+
–
58
votes
6
answers
10
GATE IT 2004 | Question: 75
A relation $\text{Empdtl}$ ... and $\textsf{1NF}$ $\textsf{BCNF}$ and hence also in $\textsf{3NF}$, $\textsf{2NF}$ and $\textsf{1NF}$
A relation $\text{Empdtl}$ is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, fo...
Ishrat Jahan
17.8k
views
Ishrat Jahan
asked
Nov 2, 2014
Databases
gateit-2004
databases
database-normalization
normal
+
–
51
votes
5
answers
11
GATE CSE 2002 | Question: 16
For relation R=(L, M, N, O, P), the following dependencies hold: $ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$ R is decomposed into R1 = (L, M, N, P) and R2 = (M, ... above decomposition dependency-preserving? If not, list all the dependencies that are not preserved. What is the highest normal form satisfied by the above decomposition?
For relation R=(L, M, N, O, P), the following dependencies hold:$ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$R is decomposed into R1 = ...
Kathleen
16.7k
views
Kathleen
asked
Sep 15, 2014
Databases
gatecse-2002
databases
database-normalization
normal
descriptive
+
–
42
votes
8
answers
12
GATE CSE 2010 | Question: 43
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$ $A \to C$ The relation $R$ contains $200$ tuples and the relation $S$ contains $100$ tuples. What is the maximum number of tuples possible in the natural join $R \bowtie S$? $100$ $200$ $300$ $2000$
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$$A \to C$The relation $R$ contains $200$ tuples and the relation $S$ con...
go_editor
13.2k
views
go_editor
asked
Sep 30, 2014
Databases
gatecse-2010
databases
normal
natural-join
database-normalization
+
–
27
votes
5
answers
13
GATE CSE 2021 Set 1 | Question: 33
Consider the relation $R(P,Q,S,T,X,Y,Z,W)$ with the following functional dependencies. $PQ\rightarrow X;\quad P\rightarrow YX;\quad Q\rightarrow Y; \quad Y\rightarrow ZW$ Consider the decomposition of the relation $R$ into the ... $D_2$ is a lossless decomposition Both $D_1$ and $D_2$ are lossless decompositions Both $D_1$ and $D_2$ are lossy decompositions
Consider the relation $R(P,Q,S,T,X,Y,Z,W)$ with the following functional dependencies.$$PQ\rightarrow X;\quad P\rightarrow YX;\quad Q\rightarrow Y; \quad Y\rightarrow ZW$...
Arjun
13.4k
views
Arjun
asked
Feb 18, 2021
Databases
gatecse-2021-set1
databases
database-normalization
2-marks
+
–
35
votes
5
answers
14
GATE CSE 1990 | Question: 3-ii
Indicate which of the following statements are true: A relational database which is in $3$NF may still have undesirable data redundancy because there may exist: Transitive functional dependencies Non-trivial functional dependencies ... dependencies involving prime attributes only on the left-side. Non-trivial functional dependencies involving only prime attributes.
Indicate which of the following statements are true:A relational database which is in $3$NF may still have undesirable data redundancy because there may exist:Transitive ...
makhdoom ghaya
14.5k
views
makhdoom ghaya
asked
Nov 19, 2016
Databases
gate1990
normal
databases
database-normalization
multiple-selects
+
–
18
votes
3
answers
15
GATE CSE 2021 Set 2 | Question: 40
Suppose the following functional dependencies hold on a relation $U$ with attributes $P,Q,R,S$, and $T$: $P \rightarrow QR$ $RS \rightarrow T$ Which of the following functional dependencies can be inferred from the above functional dependencies? $PS \rightarrow T$ $R \rightarrow T$ $P \rightarrow R$ $PS \rightarrow Q$
Suppose the following functional dependencies hold on a relation $U$ with attributes $P,Q,R,S$, and $T$:$P \rightarrow QR$$RS \rightarrow T$Which of the following functio...
Arjun
7.3k
views
Arjun
asked
Feb 18, 2021
Databases
gatecse-2021-set2
multiple-selects
databases
database-normalization
2-marks
+
–
30
votes
3
answers
16
GATE CSE 2006 | Question: 70
The following functional dependencies are given: $ AB\rightarrow CD,AF\rightarrow D,DE\rightarrow F,$C\rightarrow G,F\rightarrow E,G\rightarrow A $ Which one of the following options is false? $ \left \{ CF \right \}^{*}=\left \{ ACDEFG \right \}$ $ \left \{ BG \right \} ... $ \left \{ AB \right \}^{*}=\left \{ ABCDG \right \}$
The following functional dependencies are given:$ AB\rightarrow CD,AF\rightarrow D,DE\rightarrow F,$$C\rightarrow G,F\rightarrow E,G\rightarrow A $Which one of the follow...
Rucha Shelke
12.0k
views
Rucha Shelke
asked
Sep 26, 2014
Databases
gatecse-2006
databases
database-normalization
normal
+
–
12
votes
2
answers
17
GATE CSE 2022 | Question: 4
In a relational data model, which one of the following statements is $\text{TRUE}?$ A relation with only two attributes is always in $\text{BCNF}.$ If all attributes of a relation are prime attributes, then the relation is in $\text{BCNF}.$ Every relation has at least one non-prime attribute. $\text{BCNF}$ decompositions preserve functional dependencies.
In a relational data model, which one of the following statements is $\text{TRUE}?$A relation with only two attributes is always in $\text{BCNF}.$If all attributes of a r...
Arjun
10.0k
views
Arjun
asked
Feb 15, 2022
Databases
gatecse-2022
databases
database-normalization
1-mark
+
–
32
votes
6
answers
18
GATE CSE 2005 | Question: 29, UGCNET-June2015-III: 9
Which one of the following statements about normal forms is $\text{FALSE}?$ $\text{BCNF}$ is stricter than $\text{3NF}$ Lossless, dependency-preserving decomposition into $\text{3NF}$ is always possible Lossless, dependency-preserving decomposition into $\text{BCNF}$ is always possible Any relation with two attributes is in $\text{BCNF}$
Which one of the following statements about normal forms is $\text{FALSE}?$$\text{BCNF}$ is stricter than $\text{3NF}$Lossless, dependency-preserving decomposition into $...
Kathleen
16.9k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2005
databases
database-normalization
easy
ugcnetcse-june2015-paper3
+
–
63
votes
7
answers
19
GATE CSE 2002 | Question: 1.19
Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resulting set of relations is Zero More than zero but less than that of an equivalent $3NF$ decomposition Proportional to the size of F+ Indeterminate
Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resu...
Kathleen
20.3k
views
Kathleen
asked
Sep 15, 2014
Databases
gatecse-2002
databases
database-normalization
normal
+
–
8
votes
4
answers
20
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 60
In a relational database relation, we say a non-empty set of attributes $\mathrm{X}$ is closed (with respect to a given set of functional dependencies FD) if $X^{+}=X$ (where $X^{+}$is the closure of $X).$ ... $2.$ $R$ is in $2 N F$. $R$ is in $3 N F$.
In a relational database relation, we say a non-empty set of attributes $\mathrm{X}$ is closed (with respect to a given set of functional dependencies FD) if $X^{+}=X$ (w...
GO Classes
1.0k
views
GO Classes
asked
Jan 13
Databases
goclasses2024-mockgate-11
goclasses
databases
database-normalization
functional-dependency
multiple-selects
2-marks
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register