Scribd Logo
Upload

Welcome to Scribd!

  • End Sem Solution 1

    Uploaded by

    22mb0069
    20 views12 pages
    1. The document discusses decomposing a relation into BCNF and 3NF forms using attributes A, B, C, D, E, and F. It provides examples of decomposing relations using attributes and calculating new relations. 2. It also discusses classifying data instances using attributes A, B, and C and calculating their values. It finds the classification of instances is based on the attribute with the highest value. 3. The document involves decomposing relations, calculating new relations based on attributes, and classifying data instances using attribute values.

    Original Description:

    dbms

    Original Title

    End_Sem_Solution_168354694217905690806458e33e2ee41 (1) (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document discusses decomposing a relation into BCNF and 3NF forms using attributes A, B, C, D, E, and F. It provides examples of decomposing relations using attributes and calculating new relations. 2. It also discusses classifying data instances using attributes A, B, and C and calculating their values. It finds the classification of instances is based on the attribute with the highest value. 3. The document involves decomposing relations, calculating new relations based on attributes, and classifying data instances using attribute values.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    20 views12 pages

    End Sem Solution 1

    Uploaded by

    22mb0069
    1. The document discusses decomposing a relation into BCNF and 3NF forms using attributes A, B, C, D, E, and F. It provides examples of decomposing relations using attributes and calculating new relations. 2. It also discusses classifying data instances using attributes A, B, and C and calculating their values. It finds the classification of instances is based on the attribute with the highest value. 3. The document involves decomposing relations, calculating new relations based on attributes, and classifying data instances using attribute values.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 12

    1 a).

    Fabe

    salafi. ACD
    R2(A,c, D,E)
    AC net a o

    A>ß ,and
    RI atauo 3 Marks

    b) Ta. DECEAB
    CF AB,

    Aio DF AB DE ARcE
    A B ’ C DEABCE
    Cnd DFC

    DEC a d DfAB supuky


    Abt ,dhay baud srb ay kiy
    DE
    des nil appcal
    fid that DFC ael
    al oulseta t

    Chaky minlmal
    DEAB al munl mal suhr keys 3 Marks
    Snams

    Patts
    coleied Vcele gca

    sicl Tpid A) catalg )

    ctleiicd Pat) ataly))

    RI 0R2.

    u) RL atalcg
    Catalrg R2.4id(RIxA
    -R2. pid
    R.bid
    þid, sic

    R? sidl

    T,ala)-Ga lai)xk2 -RI)

    -3. a) End the Sup plis ot los than


    sd kat lat
    |00 dollars.
    stalmnt dounet
    lateal alyeba
    b) Tho
    atun angliny Fgrte

    the Sutplu cest lns


    ) Fincsul}y a ad fait hat pat that
    ho dellad ag n
    aned
    tlan 1o0 1DOelas.
    thay
    Cat lss
    d) Sout
    BCNE
    3 Marksz

    B’DE’A spkay (
    R,
    wiy and unau
    R(AeCDE)
    Decempeu
    BCE)

    3 Marks
    a |B0)
    nat
    R,ARy
    4 marks

    BCNF CD’£
    F=A>2 ABCDEw
    ABCDE ad
    R EABCD
    (A,E,C,DE)
    E
    aol
    CO But (R-D)
    BD cE)
    gt R(AB,
    =CoT
    A
    /
    We New
    Now
    a) PC &
    Fd eocl FD

    FDQ
    a) x = XYZ ( wit X’yz)
    b) XYt - XYZ (
    c) = wXYZ( wolng

    b) c P
    eoch F
    clese
    Findby
    a)x=Xz
    W>xZ W>VeX>)
    wxzvY (
    b) w=
    Tue
    c)
    Decemposition
    a) ley
    net a y
    z

    Decentiten
    ley
    all
    do nit ald
    ald ut to

    Ri
    K
    a d R2
    atlibut betaveu

    dcmfostein
    n
    d) lodibs Ctmngn
    thu
    a supes kay
    RIQR2 = XZW

    aufe ky
    A 6

    6
    2

    not
    E o

    Candicat gueatio
    C Sutheit cut
    AB
    Ac

    AD

    L2
    2tens t
    Safhoit-Cout
    AL
    AC
    (-6 marks if Apriori Property
    not explained or used in solution)

    L2
    L2 L2 ic.

    Bt
    Net waly
    aund
    C3

    |A2G
    amd L3
    ascocutou ile ae
    howka ste
    b) Ony
    B
    A
    AA
    A C

    eacl, wich Comes


    out
    class nsto

    ) Eoiinal =l- na )-0 30

    data
    |.e,

    teutt A,th ga
    euesfat Ea:rh2)-0
    A=T
    25
    (Shers
    caleultoy
    25 25 EAzF
    25 E,

    EAF

    = 25

    2 Marks
    atlikut
    20
    B-T EBBT
    20
    50
    |=50

    attibt C.
    25
    2
    C=T 20
    25 50
    +25
    5
    2S
    To0 jo0

    as
    cate

    has

    3 Marks
    b) Becêube A-T cild node s pue

    tu ditibuton instans
    laled
    BC
    20

    25
    F 251

    thu A=F child nodo s


    The clasif
    25
    attibtt B, te
    E r 20
    BT
    B=T
    +|2
    25
    30

    =5

    2 Marks
    ottulutt C, h ga

    C=T
    2.5 Er
    |2s25| E = 25

    SO

    mal on attubtt L.
    1he sbut al! de
    2 Marks

    C) 20 inotaue niaclastifds

    A=T A=
    25 +
    25 +
    50
    |o
    25
    l30-]
    20

    1 Marks
    20

    You might also like