The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

- Split the fd's such that rhs contains single attribute.
- Find the redundant fd's and remove redundant ones.
- Find the redundant attributes on lhs and remove them.like AB->C ,A can be deleted if closure of B contains A

Explanation with proper example would have been noble

X->YZ , Y->XZ , Z->X

So from decomposition rule:-

X->Y ,X->Z , Y->X ,Y->Z, Z->X

if we remove Z->X still we get Z and X in closure

X->Y ,X->Z , Y->X ,Y->Z

if Y->X remove still we can Y and X

X->Y ,X->Z ,Y->Z

we can remove one more either X->z or Y->Z

X->Y ,X->Z

we have still X,Y,Z but now we can remove dependecy

so minimal 2

- All categories
- Testimonials 33
- Numerical Ability 0
- Verbal Ability 1
- Engineering Mathematics 8
- Algorithms 1
- Databases 2
- Digital Logic 3
- CO & Architecture 2
- Computer Networks 3
- Compiler Design 2
- Programming & Data Structures 5
- Motivation 17
- Preparation Advice 41
- Theory of Computation 3
- Study Materials 11
- Others 104
- Interview Experience 20
- Preparation Experience 20
- Useful Links 8
- Announcements 45

33,620 questions

40,170 answers

114,126 comments

38,552 users