Recent questions tagged database-normalization

0 votes

0 answers

1

Random Question paper
Consider schedules S3, S4, and S5 below. Determine whether each schedule is strict, cascadeless, recoverable, or nonrecoverable. (Determine the strictest recoverability condition that each schedule satisfies). S3: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); c1; w3 (Y); c3; r2 (Y); w2 (Z); w2 ... ); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); c1; w2 (Z); w3 (Y); w2 (Y); c3; c2;

SidX asked in Databases 1 day ago

by SidX

14 views

0 votes

0 answers

2

DBMS, School Assignment
Consider an EMPLOYEE file with 10000 records where each record is of size 80 bytes. The file is sorted on employee number (15 bytes long), which is the primary key. Assuming un-spanned organization, block size of 512 bytes and block pointer size of 5 ... for retrieving an employee record based on employee number if (i) No index is used (ii) Multi-level primary index is used.

SidX asked in Databases 1 day ago

by SidX

11 views

2 votes

1 answer

3

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$

Arjun asked in Databases Feb 18

by Arjun

1.5k views

2 votes

5 answers

4

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

Arjun asked in Databases Feb 18

by Arjun

1.7k views

1 vote

2 answers

5

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

Lakshman Patel RJIT asked in Databases Apr 1, 2020

by Lakshman Patel RJIT

369 views

1 vote

3 answers

6

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$

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

393 views

0 votes

3 answers

7

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.

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

373 views

0 votes

2 answers

8

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.

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

319 views

0 votes

2 answers

9

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

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

1k views

0 votes

2 answers

10

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.

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

674 views

0 votes

2 answers

11

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

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

1.9k views

0 votes

2 answers

12

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.

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

1.7k views

1 vote

3 answers

13

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

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

343 views

0 votes

2 answers

14

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$

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

398 views

0 votes

2 answers

15

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$

Lakshman Patel RJIT asked in Databases Mar 31, 2020

by Lakshman Patel RJIT

830 views

3 votes

5 answers

16

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$

Lakshman Patel RJIT asked in Databases Mar 30, 2020

by Lakshman Patel RJIT

1.5k views

1 vote

2 answers

17

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.

Lakshman Patel RJIT asked in Databases Mar 30, 2020

by Lakshman Patel RJIT

394 views

0 votes

4 answers

18

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

Lakshman Patel RJIT asked in Databases Mar 30, 2020

by Lakshman Patel RJIT

2k views

0 votes

4 answers

19

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

Lakshman Patel RJIT asked in Databases Mar 30, 2020

by Lakshman Patel RJIT

2k views

0 votes

5 answers

20

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

jothee asked in Databases Mar 24, 2020

by jothee

824 views

0 votes

2 answers

21

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.

jothee asked in Databases Mar 24, 2020

by jothee

428 views

5 votes

2 answers

22

GATE CSE 2020 | Question: 36
Consider a relational table $R$ that is in $3NF$, but not in BCNF. Which one of the following statements is TRUE? $R$ has a nontrivial functional dependency $X \rightarrow A$, where $X$ is not a superkey and $A$ is a prime attribute. $R$ has a ... a non-prime attribute and $X$ is a proper subset of some key A cell in $R$ holds a set instead of an atomic value.

Arjun asked in Databases Feb 12, 2020

by Arjun

2.7k views

5 votes

12 answers

23

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

Satbir asked in Databases Jan 13, 2020

by Satbir

4.6k views

1 vote

0 answers

24

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.

gatecse asked in Databases Aug 4, 2019

109 views

0 votes

2 answers

25

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

gatecse asked in Others Aug 4, 2019

252 views

Page:

1
2
3
4
5
6
...
15
next »

Follow @gateoverflow

GATE Overflow

Recent questions tagged database-normalization

Search GATE Overflow