LOVELY PROFESSIONAL UNIVERSITY

MODEL HOME WORK: #3

Code : CSE 351 Course Title:

DATABASE SYSTEMS

School: LHST Department:

CSE/IT

Name of the faculty member: Monalisa Panigrahi

Class: CSE351 Term: 2 Section: A1802

Batch: 2008

Max. Marks: 5 DOA: 19-03-2011 DOS: 1-04-2011

DOT:2-04-2011

PART – A

1. Consider R (A B C D) and FD’s are

C -> B
A -> B
D -> AB
AC -> D

Find the minimal set ???

2. Consider R ( ABCDEFG) , FD’s are

BC -> E
A -> F
F -> G
C -> D
A -> G
AB -> D
Decompose upto BCNF ????

3. What is Join Dependency and how is it related to 5NF ?

 PART – B

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(A)

READ(A)

WRITE(B)

READ(B)

WRITE(A)

READ(C)

WRITE(C )

WRITE(B)

READ(C)

WRITE(C)

WRITE(B)
5. State the difference between 3NF and BCNF ?

6. What is Functional Dependency ? How to check functional dependency from a given relation ?