Recent questions tagged database-normalization

Recent questions tagged database-normalization

0 votes

0 answers

1

Self - Doubt
Consider the relation R(ABCDE) with the FD set F={A-->E,BC-->D,E-->CD} . find the 3NF decomposition .

Manisha Jaishwal asked in Databases Jun 5

by Manisha Jaishwal

97 views

1 vote

1 answer

2

NIELIT 2022 Jan Scientist B | Section B | Question: 49
Let $\text{R (A, B, C, D)}$ be a relational schema with the following functional dependencies: $\text{A} \rightarrow \text{B, B} \rightarrow \text{C}$ $\text{C} \rightarrow \text{D}$ ... dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving

soujanyareddy13 asked in Others Apr 12

by soujanyareddy13

55 views

0 votes

0 answers

3

Transitive Dependency and Intransitive Dependency in 3NF.
Can anyone please explain about Statement 4 ? I know that transitive dependencies are allowed in 3NF as long as RHS is Prime Attribute. But, what is intransitive dependency. What is the role of it in 3NF?

Varun Raj Akula asked in Databases Mar 12

by Varun Raj Akula

20 views

5 votes

2 answers

4

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.

Arjun asked in Databases Feb 15

by Arjun

868 views

2 votes

1 answer

5

GATE CSE 2022 | Question: 21
Consider a relation $R (A, B, C, D, E)$ with the following three functional dependencies. $AB \rightarrow C; \; BC \rightarrow D; \; C \rightarrow E;$ The number of superkeys in the relation $R$ is ______________ .

Arjun asked in Databases Feb 15

by Arjun

653 views

1 vote

2 answers

6

normalization - DBMS
If AD is the only candidate key for some relation R(A,B,C,D,E) then will CD → E be considered a partial dependency?

atulcse asked in Databases Jan 22

215 views

2 votes

1 answer

7

Applied Test Series
A multi-cuisine restaurant maintains the database of ingredients that are most commonly used in their dishes. The Schema of the relation Dishes is given as: Dishes (Food_item, Taste_of_food, Type_of_cuisine, Ingredient1, Ingredient2, Ingredient3); ... are {Food_item, Taste_of_food}, {Food_item, Type_of_cuisine}. The possible super keys for the given relation are ________

LRU asked in Databases Nov 11, 2021

by LRU

294 views

1 vote

2 answers

8

gradeup quiz question
please explain the question

ajay_rajpurohit asked in Databases Oct 4, 2021

by ajay_rajpurohit

164 views

0 votes

0 answers

9

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 Sep 27, 2021

by SidX

683 views

0 votes

0 answers

10

Random college question paper
Given a relation R(A, B, C, D, E, F, G, H) with keys BD and C and functional dependencies D→G, E→F and H→C, decompose the R into the highest normal form possible.

SidX asked in Databases Sep 27, 2021

by SidX

7 views

0 votes

0 answers

11

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 Sep 27, 2021

by SidX

186 views

6 votes

3 answers

12

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, 2021

by Arjun

2.7k views

12 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

Arjun asked in Databases Feb 18, 2021

by Arjun

5.1k views

1 vote

1 answer

14

NIELIT Scientific Assistant A 2020 November: 72
Let $\text{R=(A,B,C,D,E)}$ having following $\text{FDs}.\;\text{F}=\{\text{A}\rightarrow \text{BC, CD} \rightarrow \text{E, B}\rightarrow \text{D, E}\rightarrow \text{A}\}.$ Which of the following is not a Candidate key? $\text{A}$ $\text{B}$ $\text{E}$ $\text{BC}$

gatecse asked in Databases Dec 9, 2020

80 views

1 vote

1 answer

15

NIELIT Scientific Assistant A 2020 November: 73
Anomalies are avoided by splitting the offending relation into multiple relations, is also known as __________. Accupressure Decomposition Precomposition Both decomposition & precomposition

gatecse asked in Databases Dec 9, 2020

150 views

1 vote

1 answer

16

NIELIT Scientific Assistant A 2020 November: 86
A minimal super key (i.e, one of the super keys for which no proper subset is a superkey) is called: Super Key Candidate Key Primary Key Both Candidate and Primary Key

gatecse asked in Databases Dec 9, 2020

78 views

1 vote

1 answer

17

NIELIT Scientific Assistant A 2020 November: 97
Domain constraints, functional dependency and referential integrity are special forms of _______ Foreign key Primary key Assertion Referential constraint

gatecse asked in Databases Dec 9, 2020

98 views

2 votes

2 answers

18

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

465 views

3 votes

3 answers

19

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

544 views

1 vote

3 answers

20

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

539 views

0 votes

2 answers

21

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

467 views

0 votes

2 answers

22

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

2.1k views

1 vote

2 answers

23

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

974 views

1 vote

2 answers

24

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

3.5k views

1 vote

2 answers

25

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

2.7k views

Page:

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

Follow @gateoverflow

Recent questions tagged database-normalization

Search GATE Overflow for GATE CSE