menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
GO Book for GATECSE 2022
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Exact tag match
Recent Posts
GATE 2021 AIR 26 journey and some useful tips
A Short Guide to GATE
Seeking DRDO Scientist B previous year papers
STRATEGY TO EFFECTIVELY CREATE SHORT & MICRO NOTES FOR GATE EXAM AND BEST REVISION STRATEGY BY AIR-"152"
My Video Experience AIR-152 GATE_CS(Some More motivation)!!!!!!
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3.1k)
Programming and DS
(5.2k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Follow @gateoverflow
GATE Overflow
Recent questions tagged database-normalization
Recent Blog Comments
Thanks bro :) It has been quite the...
Wow! Awesome! Congratulations brother
It's one of the top University in Canada.
Hi falgun09, If you don't mind me asking, which...
That's great!
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Slides
Recent questions tagged database-normalization
0
votes
1
answer
1
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 functional dependencies can be inferred from the above functional dependencies? $PS \rightarrow T$ $R \rightarrow T$ $P \rightarrow R$ $PS \rightarrow Q$
asked
Feb 18
in
Databases
Arjun
450
views
gate2021-cse-set2
multiple-selects
databases
database-normalization
2
votes
4
answers
2
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$ Consider the decomposition of the relation $R$ into the constituent relations according to ... , but $D_2$ is a lossless decomposition Both $D_1$ and $D_2$ are lossless decompositions Both $D_1$ and $D_2$ are lossy decompositions
asked
Feb 18
in
Databases
Arjun
519
views
gate2021-cse-set1
databases
database-normalization
lossless-decomposition
1
vote
3
answers
3
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 16
For a database relation $R(a,b,c,d)$ where the domains of $a,b,c$ and $d$ include only atomic values, only the following functional dependencies and those that can be inferred from them hold. $a \rightarrow c$ ... form but not in second normal form Second normal form but not in third normal form Third normal form None of the above
For a database relation $R(a,b,c,d)$ where the domains of $a,b,c$ and $d$ include only atomic values, only the following functional dependencies and those that can be inferred from them hold. $a \rightarrow c$ $b \rightarrow d$ The relation is in First normal form but not in second normal form Second normal form but not in third normal form Third normal form None of the above
asked
Apr 1, 2020
in
Databases
Lakshman Patel RJIT
273
views
nielit2017oct-assistanta-it
databases
database-normalization
1
vote
3
answers
4
NIELIT 2016 MAR Scientist B - Section C: 43
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$? $CD$ $EC$ $AE$ $AC$
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$? $CD$ $EC$ $AE$ $AC$
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
283
views
nielit2016mar-scientistb
database-normalization
candidate-keys
0
votes
3
answers
5
NIELIT 2016 MAR Scientist B - Section C: 44
For a database relation $R(a,b,c,d)$ where the domains of $a,b,c,d$ include only atomic values, only the following functional dependencies and those that can be inferred from them hold: $a\to c\\b\to d$ the relation is in first normal form but not in second normal form. second normal form but not in third normal form. third normal form. none of these.
For a database relation $R(a,b,c,d)$ where the domains of $a,b,c,d$ include only atomic values, only the following functional dependencies and those that can be inferred from them hold: $a\to c\\b\to d$ the relation is in first normal form but not in second normal form. second normal form but not in third normal form. third normal form. none of these.
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
288
views
nielit2016mar-scientistb
databases
database-normalization
0
votes
2
answers
6
NIELIT 2016 DEC Scientist B (IT) - Section B: 14
Normalization from which is based on transitive dependency is classified as: First normal form. Second normal form. Fourth normal form. Third normal form.
Normalization from which is based on transitive dependency is classified as: First normal form. Second normal form. Fourth normal form. Third normal form.
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
242
views
nielit2016dec-scientistb-it
databases
database-normalization
0
votes
2
answers
7
NIELIT 2016 DEC Scientist B (IT) - Section B: 40
In functional dependency between two sets of attribute $A$ and $B$ then set of attributes $A$ of database is classified as: top right side down left side left hand side right hand side
In functional dependency between two sets of attribute $A$ and $B$ then set of attributes $A$ of database is classified as: top right side down left side left hand side right hand side
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
685
views
nielit2016dec-scientistb-it
databases
database-normalization
0
votes
2
answers
8
NIELIT 2016 DEC Scientist B (IT) - Section B: 44
Which one of the following statements about normal forms is FALSE? BCNF is stricter than $3$NF. Lossless, dependency-preserving decomposition into BCNF is always possible. Lossless, dependency-preserving decomposition into $3$NF is always possible. Any relation with two attributes is BCNF.
Which one of the following statements about normal forms is FALSE? BCNF is stricter than $3$NF. Lossless, dependency-preserving decomposition into BCNF is always possible. Lossless, dependency-preserving decomposition into $3$NF is always possible. Any relation with two attributes is BCNF.
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
413
views
nielit2016dec-scientistb-it
databases
database-normalization
bcnf-decomposition
0
votes
2
answers
9
NIELIT 2016 DEC Scientist B (IT) - Section B: 57
If attribute of relation schema $R$ is member of some candidate key then this type of attributes are classified as: atomic attribute candidate attribute non-prime attribute prime attribute
If attribute of relation schema $R$ is member of some candidate key then this type of attributes are classified as: atomic attribute candidate attribute non-prime attribute prime attribute
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
934
views
nielit2016dec-scientistb-it
databases
database-normalization
0
votes
2
answers
10
NIELIT 2016 DEC Scientist B (CS) - Section B: 2
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as: normalization of data. denomination of data. isolation of data. de-normalization of data.
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as: normalization of data. denomination of data. isolation of data. de-normalization of data.
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
1.1k
views
nielit2016dec-scientistb-cs
databases
database-normalization
1
vote
3
answers
11
NIELIT 2016 DEC Scientist B (CS) - Section B: 31
Rule which states that addition of same attributes to right side and left side will result in other valid dependency is classified as referential rule inferential rule augmentation rule reflexive rule
Rule which states that addition of same attributes to right side and left side will result in other valid dependency is classified as referential rule inferential rule augmentation rule reflexive rule
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
237
views
nielit2016dec-scientistb-cs
databases
database-normalization
0
votes
2
answers
12
NIELIT 2016 DEC Scientist B (CS) - Section B: 47
If every functional dependency in set $E$ is also in closure of $F$ then this is classified as $FD$ is covered by $E$ $E$ is covered by $F$ $F$ is covered by $E$ $F$ plus is covered by $E$
If every functional dependency in set $E$ is also in closure of $F$ then this is classified as $FD$ is covered by $E$ $E$ is covered by $F$ $F$ is covered by $E$ $F$ plus is covered by $E$
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
290
views
nielit2016dec-scientistb-cs
databases
database-normalization
0
votes
2
answers
13
NIELIT 2016 DEC Scientist B (CS) - Section B: 49
Considering relational database, functional dependency between two attributes $A$ and $B$ is denoted by $A\to B$ $B\gets A$ $AB\to R$ $R\gets AB$
Considering relational database, functional dependency between two attributes $A$ and $B$ is denoted by $A\to B$ $B\gets A$ $AB\to R$ $R\gets AB$
asked
Mar 31, 2020
in
Databases
Lakshman Patel RJIT
579
views
nielit2016dec-scientistb-cs
databases
database-normalization
3
votes
5
answers
14
NIELIT 2017 DEC Scientist B - Section B: 1
Which one of the following statements are not correct? $S1$: $3$NF decomposition is always lossless join and dependency preserving. $S2$: $3$NF decomposition is always lossless join but may or may not be dependency preserving. $S3$: BCNF decomposition is always ... may not be dependency preserving. Only $S1$ Only $S4$ Both $S1$ and $S4$ Both $S2$ and $S3$
Which one of the following statements are not correct? $S1$: $3$NF decomposition is always lossless join and dependency preserving. $S2$: $3$NF decomposition is always lossless join but may or may not be dependency preserving. $S3$: BCNF decomposition is always lossless join and dependency ... but may or may not be dependency preserving. Only $S1$ Only $S4$ Both $S1$ and $S4$ Both $S2$ and $S3$
asked
Mar 30, 2020
in
Databases
Lakshman Patel RJIT
1.2k
views
nielit2017dec-scientistb
database-normalization
bcnf-decomposition
1
vote
2
answers
15
NIELIT 2017 DEC Scientist B - Section B: 24
Which of the following is TRUE? Every relation in $3$NF is also in BCNF A relation R is in $3$NF if every non-prime attribute of R is fully functionally dependent on every key of R Every relation in BCNF is also in $3$NF No relation can be in both BCNF and $3$NF.
Which of the following is TRUE? Every relation in $3$NF is also in BCNF A relation R is in $3$NF if every non-prime attribute of R is fully functionally dependent on every key of R Every relation in BCNF is also in $3$NF No relation can be in both BCNF and $3$NF.
asked
Mar 30, 2020
in
Databases
Lakshman Patel RJIT
317
views
nielit2017dec-scientistb
database-normalization
bcnf
0
votes
4
answers
16
NIELIT 2017 DEC Scientist B - Section B: 25
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$. $2$NF BCNF $3$NF $1$NF
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$. $2$NF BCNF $3$NF $1$NF
asked
Mar 30, 2020
in
Databases
Lakshman Patel RJIT
1.3k
views
nielit2017dec-scientistb
databases
database-normalization
0
votes
4
answers
17
NIELIT 2017 DEC Scientist B - Section B: 55
Consider the relational schema $\text{R(A B C D)}$ with following functional dependency set $F=\{A\rightarrow BC,C\rightarrow D\};$ The relation $\text{R}$ is in $2$NF BCNF $3$NF $1$NF
Consider the relational schema $\text{R(A B C D)}$ with following functional dependency set $F=\{A\rightarrow BC,C\rightarrow D\};$ The relation $\text{R}$ is in $2$NF BCNF $3$NF $1$NF
asked
Mar 30, 2020
in
Databases
Lakshman Patel RJIT
1.4k
views
nielit2017dec-scientistb
database-normalization
bcnf
0
votes
7
answers
18
UGCNET-Jan2017-III: 8
Which one is correct w.r.t. RDBMS? primary key $\subseteq$ super key $\subseteq$ candidate key primary key $\subseteq$ candidate key $\subseteq$ super key super key $\subseteq$ candidate key $\subseteq$ primary key super key $\subseteq$ primary key $\subseteq$ candidate key
Which one is correct w.r.t. RDBMS? primary key $\subseteq$ super key $\subseteq$ candidate key primary key $\subseteq$ candidate key $\subseteq$ super key super key $\subseteq$ candidate key $\subseteq$ primary key super key $\subseteq$ primary key $\subseteq$ candidate key
asked
Mar 24, 2020
in
Databases
jothee
366
views
ugcnetjan2017iii
database-normalization
candidate-keys
0
votes
3
answers
19
UGCNET-Jan2017-III: 10
For database relation $R(A,B,C,D)$ where the domains of $A,B,C$ and $D$ include only atomic values, only the following functional dependencies and those that can be inferred from them are: $A \rightarrow C$ $B \rightarrow D$ The relation $R$ ... in second normal form Second normal form but not in third normal form. Both in second normal form as well as in third normal form.
For database relation $R(A,B,C,D)$ where the domains of $A,B,C$ and $D$ include only atomic values, only the following functional dependencies and those that can be inferred from them are: $A \rightarrow C$ $B \rightarrow D$ The relation $R$ is in First ... well as in second normal form Second normal form but not in third normal form. Both in second normal form as well as in third normal form.
asked
Mar 24, 2020
in
Databases
jothee
333
views
ugcnetjan2017iii
databases
database-normalization
4
votes
13
answers
20
ISRO2020-50
If every non-key attribute functionally dependent on the primary key, then the relation will be in First normal form Second normal form Third normal form Fourth Normal form
If every non-key attribute functionally dependent on the primary key, then the relation will be in First normal form Second normal form Third normal form Fourth Normal form
asked
Jan 13, 2020
in
Databases
Satbir
3.8k
views
isro-2020
databases
database-normalization
easy
1
vote
0
answers
21
KPGCET-CSE-2019-3
The process of normalization is used to Enhance the number of relations Determine the relationship between different relations Minimize the redundancies & eliminate anomalies Ease the computational work.
The process of normalization is used to Enhance the number of relations Determine the relationship between different relations Minimize the redundancies & eliminate anomalies Ease the computational work.
asked
Aug 4, 2019
in
Databases
gatecse
75
views
kpgcet-cse-2019
databases
database-normalization
0
votes
2
answers
22
KPGCET-CSE-2019-74
The multivalued dependencies (MVDs) can be eliminated using ______ normal form on _____ normal form relations. $1$st, $2$nd $2$nd, $3$rd $3$rd, BCNF $4$th, BCNF
The multivalued dependencies (MVDs) can be eliminated using ______ normal form on _____ normal form relations. $1$st, $2$nd $2$nd, $3$rd $3$rd, BCNF $4$th, BCNF
asked
Aug 4, 2019
in
Others
gatecse
169
views
kpgcet-cse-2019
database-normalization
databases
3
votes
5
answers
23
UGCNET-June-2019-II: 34
In relational databases, if relation R is in BCNF, then which of the following is true about relation R? R is in 4NF R is not in 1NF R is in 2NF and not in 3NF R is in 2NF and 3NF
In relational databases, if relation R is in BCNF, then which of the following is true about relation R? R is in 4NF R is not in 1NF R is in 2NF and not in 3NF R is in 2NF and 3NF
asked
Jul 2, 2019
in
Databases
Arjun
1.4k
views
ugcnetjune2019ii
database-normalization
2
votes
4
answers
24
Doubt on database normalization for relation having all prime attributes
In a relation, if every attribute is prime but key may not be simple then the relation is in ______. A. 1NF B. 2NF C. 3NF D. BCNF
In a relation, if every attribute is prime but key may not be simple then the relation is in ______. A. 1NF B. 2NF C. 3NF D. BCNF
asked
May 27, 2019
in
Databases
Tuhin Dutta
1.1k
views
databases
database-normalization
rdbms
1
vote
2
answers
25
Made Easy Test Series: Database-Normalization
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies $F=${ $A\rightarrow B$ $BC\rightarrow E$ $ED\rightarrow A$ } Number of additional relation required to convert it into lossless , dependency preserving $3NF$ decomposition is _____________ What is meaning of additional relation (Here no table mentioned previously)??
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies $F=${ $A\rightarrow B$ $BC\rightarrow E$ $ED\rightarrow A$ } Number of additional relation required to convert it into lossless , dependency preserving $3NF$ decomposition is _____________ What is meaning of additional relation (Here no table mentioned previously)??
asked
May 19, 2019
in
Databases
srestha
522
views
databases
made-easy-test-series
database-normalization
0
votes
2
answers
26
dbms normalization - 2nf/bcnf query
Consider the following relational schemes: R(A, B, C, D, E, F) and S(A, B, C) with in the following functional dependencies: I. AB --> C II. C --> ABDE III. ADE --> F Assume {A,B} is the key for both schemes. Which of the ... C is the relation for the S table, which satisfies BCNF properties. (So S is in BCNF) Please let me know if it is correct or not.
Consider the following relational schemes: R(A, B, C, D, E, F) and S(A, B, C) with in the following functional dependencies: I. AB --> C II. C --> ABDE III. ADE --> F Assume {A,B} is the key for both schemes. Which of the following statements is true? R ... : only AB→ C is the relation for the S table, which satisfies BCNF properties. (So S is in BCNF) Please let me know if it is correct or not.
asked
May 10, 2019
in
Databases
pritam946
329
views
database-normalization
databases
Page:
1
2
3
4
5
6
...
14
next »
...