Professional Documents
Culture Documents
UNIVERSITY
HOME WORK: #3
Code : CSE 351
Submitted To:
Mr. Raj Singh
Submitted By:
Vijay Kumar
RA1807 A19
PART – A
Ans)
A->B
C->B
D->A
D->B
D->C
AC ->D
A+=A
C+=C
D+=DBC
D+=DACB
D defines B therefore we can remove it
D+=DBA
C+=CDAB
C+=CB
A+=CDAB
A+=AB
MINIMAL SET:-
A->B
C->B
D->A
D->C
AC->D
Sol)
IN order to decompose it first of all we have to find candidate key. and the candidate
key we can find by finding the closure of each determinant.
BCD+=BCDAEFG
BC+=BCED
A+=AFG
F+=FG
C+=CD
1)In order to convert it into 2NF we have to remove all partial dependencies
BC->E is a partial dependency, therefore remove E from the relation R and there is a
separate relation for BCE
R1=ABCDFG
R2=BCE
A->F
F->G
A->G
Now remove F,G from the relation R1 and there is a separate relation for AE,FG,AG
R1=ABCD
R2=BCE
R3=AF
R4=FG
R5=AG
BCD->A
C->D
4)in order to convert it into BCNF we have to check it each relation is a candidate
key
And in this case all the relations upto 3NF already in BCNF form
PART – B
Q 4)A Schedule S : Is this Schedule Conflict Schedule S
Serializable ? If yes, What is the Equivalent Serial Schedule ?
T1 T2 T3
READ(A
)
READ(B)
WRITE(
READ(A)
A)
WRITE(B)
WRITE(A
READ(B
)
)
WRITE(
B)
READ(C) READ(C
)
WRITE(C
WRITE( WRITE(B)
)
C)
Q 5)Make a list of Security Concerns for a Bank. For each item on your list, state
whether this concern relates to physical security, human security, operating system
security, or database security.
Ans)Physical security: Physical level
Human Security:-
Users must be screened to ensure that an authorized users do not give access to
intruders Users should be trained on password selection and secrecy.
Operating system super-users can do anything they want to the database! Good
operating system level security is required
Database security:
6)Which normal form is more desirable ? Justify your answer with the help of an
example ?
Sol)Among all the normal forms 3NF is more desirable, Because after decomposing
upto BCNF there is a chances that decomposition is a lossy decomposition.
R (ABC),
R1 (AB) , R2(AC)
B -> C
R1 Λ R2 = A
R1 Λ R2 -> R1 : A -> AB
From the above we conclude that A defines A but not B,therefore it is false
R1 Λ R2 -> R2 : A -> AC
From the above we conclude that A defines A but not C,therefore it is false