Scribd
Upload
7 views1 page

Dbe Assignment2

The document presents a series of database assignments focused on functional dependencies and normalization forms, including tasks to identify keys, candidate keys, and assess relations for 2NF, 3NF, and BCNF. It includes specific examples of relation schemes and their corresponding functional dependencies. The assignments require determining the normal forms of various relations and converting them if necessary.

Uploaded by

rudrashreenayak2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views1 page

Dbe Assignment2

The document presents a series of database assignments focused on functional dependencies and normalization forms, including tasks to identify keys, candidate keys, and assess relations for 2NF, 3NF, and BCNF. It includes specific examples of relation schemes and their corresponding functional dependencies. The assignments require determining the normal forms of various relations and converting them if necessary.

Uploaded by

rudrashreenayak2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DBE ASSIGNMENT-II

1. Consider the relation scheme R = {E, F, G, H, I, J, K, L, M, N} and the set of


functional dependencies {{E, F} -> {G}, {F} -> {I, J}, {E, H} -> {K, L}, K -> {M}, L
-> {N} on R. What is the key for R?
2. Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional
dependencies hold: {A–>B, BC–> D, E–>C, D–>A}. What are the candidate keys of R?
3. Given a relation R( P, Q, R, S, T, U, V, W, X, Y) and the Functional Dependency set FD
= { PQ → R, PS → VW, QS → TU, P → X, W → Y }. Determine whether the given R
is in 2NF? If not convert it into 2 NF.
4. Given a relation R( A, B, C, D, E) and Functional Dependency set FD = { A → B, B →
E, C → D}. Determine whether the given R is in 2NF? If not convert it into 2 NF.
5. Given a relation R( X, Y, Z, W, P) and Functional Dependency set FD = { X → Y, Y →
P, and Z → W}. Determine whether the given R is in 3NF? If not convert it into 3 NF.
6. Given a relation R( P, Q, R, S, T, U, V, W, X, Y) and Functional Dependency set FD = {
PQ → R, P → ST, Q → U, U → VW, and S → XY}. Determine whether the given R is
in 3NF? If not convert it into 3 NF.
7. Given a relation R( X, Y, Z) and Functional Dependency set FD = {XY → Z, Z → Y }.
Determine whether the given R is in BCNF? If not convert it into BCNF.
8. Given a relation R( P, Q, R, S, T, U, V, W, X) and Functional Dependency set FD = { PQ
→ R, QS → TU, PS → VW, and P → X }. Determine whether the given R is in which
normal form?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy