the answer for the homework--> AC is the candidate key but relation is not in 2NF, because A is proper subset of AC(candidate key)and A->B, where B is non prime attribute.
1NF: Each attribute should contain atomic values A column should contai value from the same domain Each column should have unique name No ordering to rows and columns. No duplicate rows. 2NF: It must be 1NF No Patial dependency in the relation (Partial dependency occurs when the left hand side of a candidate key points non-prime attributes) 3NF: It is in 2NF No transitive dependency for non-prime attributes (To be non transitive and 3NF atleast one of these must be true: Either the left handside of funtional dependency is superkey or the right handside points to a prime attribute) BCNF: A relation is BCNF if it is 3NF For each functional dependency there must be a super key
I'd highly appreciate it if anyone can HELP me. I have an assignment to normalize a table. The issue is I wasn't provided FDs or any keys. So how and where to start. ( I did find four FDs, not sure though if they're right or not). What to doooo ????
madam obviously I don't know how I thankful to you....I'm speechless about this service....God bless you madam...great English pronunciation and well explained.....much love you madam.....
Good Evening Ma'am, ur explaination is very helpful and understandable, Thanks alot. Plz make complete videos on SQL's numericals, Transaction management & Concurrency and File Structure Last Question which is given by you in 2nd Normal Form Lecture ....The answer would be the given relation, R(A, B, C, D) & F.D.={A->B, B->D} is not in 2nd Normal Form
Answer of last example question: We obtain AC closure as candidate key which shows us the FD is not in the 2nd normal form. Perfect explanation, thank you very much
Hi Jenny, you take so much effort to explain things. I like your videos very much. But for this particular video, you can take a practical example like orders database to explain partial dependence. That would have made things easier to understand.
The whiteboard at time brighten up way too much, I know its because of the lighting, but at times it becomes too bright that my eyes start paining. Except this, you are one of the best tutors on youtube.Thankyou for helping thousands of students in need.
Answer for exercise at 20:14 Partial Functional dependency exists which is A--> B Because A is a proper subset of the candidate key AC , and B is a non-prime attribute. Can't thank u enough Jenny ma'am !! 🤩🙌 The videos on Normalization are just amazing.. !! ✨🙌
AC is only CK, PD exists as A,C are PA. B,D are NPA. A as subset of AC determines NPA B and D. Therefore PD exists and not in 2NF. Kindly advise if correct. Thank You.
The question with R(A,B,C,D) FD:{AB->CD , C->A , D->B } There will be 4 candidate keys AB , AD , BC , CD. Timestamp : 15:50 Details Explaination: Classification of the attributes: +-------------+---------+---------+----------+ | I(isolated) | L(left) | B(both) | R(right) | +-------------+---------+---------+----------+ | - | - | A,B,C,D | - | +-------------+---------+---------+----------+ Union of I and L: Computation of the closure of the attributes from Step 4 Attributes on the both side of FD: A,B,C,D Compute the closure of the combination of the power set of B(both) and . A⁺ = A ⊂ R B⁺ = B ⊂ R C⁺ = AC ⊂ R D⁺ = BD ⊂ R We have not found any candidate keys by adding one-element sets to AB⁺ = ABCD = R (candidate key) AC⁺= AC ⊂ R AD⁺ = ABCD = R (candidate key) BC⁺ = ABCD = R (candidate key) BD⁺= BD ⊂ R CD⁺ = ABCD = R (candidate key) Adding any other attribute leads to a superkey. Hence, ['AB', 'AD', 'BC', 'CD'] are the (only) candidate keys. AB, AD, BC, CD
Sorry ma'am! In 2nd example there are 4 cks here AB is equivalent to CD cos C=>A and D=>B that why A can be replaced with C n B with D now thus we'll get CD too
In last example R(A,B,C,D) F.D={A->B, B->D} here Ck={AC}, P.A={A,C}, non prime attribute={B,D} , partial dependency is present. so this is not 2NF. But I have a question which is partial dependency A->B or A->D ??
not in 2NF because {AC} is candidate key , hence non prime attributes are {B,D} and {A->ABD} (by transitivity), which is partial dependency . But partial dependency cant exist in 2NF.
Ma'am in second example you said AB is a candidate key and also AB->CD, C->A, D->B then if we replace A to C and B to D then CD is also a super key? Is it a candidate key ?? As per i understand the concept it is a candidate key if i am wrong then plz clear my doubt.... also i want to tell you are an amazing teacher your lessons are helpful to me...thank you so much❤🌸
Mam thank you so much the video was really helpful. And the last problem is not in second normal form,please reply for this mam it would be great help for me
Ac is candidate key and not in 2nf because a->b where a is a proper subset of candidate key which implicant b ie the non prime attribute. In this case prime attributes are ac and non prime attributes b and d
Given a relation R( P, Q, R, S, T, U, V, W, X, Y) and 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. could you solve it mam please?
In the second example you used the one from hw in Part 1 finding candidate key.. But the result is different from there, I have doubts which one is correct please
yeah its actually 4 CK, but she stopped because, she found out that CK={AB,CB,AD} is enough for answering it as in 2NF.. how? by that time CK={AB,CB,AD} she noticed that PrimeAttributes={A,B,C,D} - which has all the attributes in the given relation and hence no possiblity of getting non prime attributes by the subset of CK(even from following any iteration of finding CKs)
@@HemanthKumar-if8vu If CD is candidate key, it wouldn't be 2nf as it defines C-> A? I think going to this partial dependence. . Please correct me if I'm thinking wrong
No You miss the key ..after candidate key has found you should check whether the primeattributes of the candidate key is present in the given dependencies ...in this manner , we should get .
15:54 mam we have one more CK that is CD ?????? I m confuse mam BTW thank you mam for amazing explanation I am learning so many things from your videos 👍
15:50 The candidate keys will be AB , AD , BC , CD, C, D right? I mean AB -> C and AB -> D Proper subset of C is phi as well as D. Therefore, C and D are candidate keys?
In the first video of ck of playlist , she gave the same question for homework and she told answer is AB,AD,BC,CD are ck so i think therre are 4 cks not 3 ck
She never ask for like and subscribe .
She simply teaches her subject so rare these days.
Lots of love from all students mam.
yes
🥺❤️💯
true
@@stackritesh true
Ok
the answer for the homework-->
AC is the candidate key but relation is not in 2NF, because A is proper subset of AC(candidate key)and A->B, where B is non prime attribute.
To make it into 2NF we have to divide it into 2 table
ABD and AC right?
@@subhamkumarsah7885 yes bro
bro h b....k....l
thank you bhai kabhi mile toh mere se 20 rupay le lena 😊😊😊😊😊😊😊😊
right answer bro
Jenny mam you are the only one who teach in a better and simple way.......still your videos worthy......thank you so much.....🥺💕
Hey ,in 1st example we are getting. Baf,caf,daf,eaf candidate keys right
Am lucky to found your channel,because i found all topics which i wanna learn with a fabulous explanation
Hey ,in 1st example we are getting. Baf,caf,daf,eaf candidate keys right
This is hands down some of the best videos on databases I have come across.
The question with R(A,B,C,D) FD:{AB->CD , C->A , D->B } There will be 4 candidate keys AB , AD , BC , CD. Timestamp : 15:50
S mam I'm also getting 4 CK's
then why in video she got 3 candidate keys
Yes there will be 4 CK according to me too.
Follow the rules.
she missed out 1 more...
1NF:
Each attribute should contain atomic values
A column should contai value from the same domain
Each column should have unique name
No ordering to rows and columns.
No duplicate rows.
2NF:
It must be 1NF
No Patial dependency in the relation (Partial dependency occurs when the left hand side of a candidate key points non-prime attributes)
3NF:
It is in 2NF
No transitive dependency for non-prime attributes
(To be non transitive and 3NF atleast one of these must be true: Either the left handside of funtional dependency is superkey or the right handside points to a prime attribute)
BCNF:
A relation is BCNF if it is 3NF
For each functional dependency there must be a super key
In 2NF(partial dependency --> left hand side proper subset of candidate key not candidate key itself)
I LOVE YOU
@@akashsharma2216 Behen ke lawde 🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣 comment section me bhi flirt maarne aa gaya tu bkl 😁😁🤣🤣
@@akashsharma2216 padhai pe dhyaan de
Some heroes do not wear capes.
Only AC is a candidate key ,prime attributes are {A,C} and the relation is in 1NF but not in 2NF because of the partial dependency (A -> B)
asa am calculat si eu si mi a dat bine, bafta la examen!!!
Correct
I'd highly appreciate it if anyone can HELP me. I have an assignment to normalize a table. The issue is I wasn't provided FDs or any keys. So how and where to start. ( I did find four FDs, not sure though if they're right or not). What to doooo ????
yes
Yessss
madam obviously I don't know how I thankful to you....I'm speechless about this service....God bless you madam...great English pronunciation and well explained.....much love you madam.....
Watching from Kashmir !!!
Tommorow iz my Dbms viva!!!
Jenny's ma'ams videos helped me alot!!!
CK = AC,
Non Prime Attributes={B,D}
A+ ={A,B,D} € Non Prime
So Partial Dependency
Implies R is not in 2NF
Hey ,in 1st example we are getting. Baf,caf,daf,eaf candidate keys right
Not in 2nd normal form because ck={A,C} and A->B .here is an partial dependency
Shut up
correct
one correction AC is candidate key
If only one FD is partial then also it's not in 2NF?
@@aditirai1909 Yes, if even one FD is partial, then its not in 2NF
Good Evening Ma'am, ur explaination is very helpful and understandable, Thanks alot.
Plz make complete videos on SQL's numericals, Transaction management & Concurrency and File Structure
Last Question which is given by you in 2nd Normal Form Lecture ....The answer would be the given relation, R(A, B, C, D) & F.D.={A->B, B->D} is not in 2nd Normal Form
God bless you. You're an amazing teacher!
I LOVE YOU!! I'm 4 days away from my exam and FINALLY, I have the whole clear picture.
People like you make gate preparation much easier. Thank You very much for your efforts Ma'am. Stay Safe :)
finally understood 2NF.... can't believe this can be explained in such easy to understand way. thank you!
the way she teaches definitely way better than the prof teach in my class, love it!!!
our country needs selfless teacher like her
The explanation is crystal clear !!!!!!!!!!! Thank You !!!!!!!!!
Your explanation is very nice madam... i am following your lectures daily... Thank you very much for providing these lectures to us...
Answer of last example question: We obtain AC closure as candidate key which shows us the FD is not in the 2nd normal form. Perfect explanation, thank you very much
Your explanation is great ful thank you so much mam 💫👌😊🤗
Thank you for your all efforts, I can easily understand all these complicate things.
your videos are very helpful mam
Your lecture is pakka...I loved it..I was searching so many video regarding normalization today I got the concept..thank you mam
Hey ,in 1st example we are getting. Baf,caf,daf,eaf candidate keys right
Hi Jenny, you take so much effort to explain things. I like your videos very much. But for this particular video, you can take a practical example like orders database to explain partial dependence. That would have made things easier to understand.
mem ye bohot aache bat hain ki hamare college ke lecturer aapke video dekhe padhate hain
I think in the second example CD is also a candidate key along with AB, CB and AD.
These videos are like an emerald in a coal mine.
The whiteboard at time brighten up way too much, I know its because of the lighting, but at times it becomes too bright that my eyes start paining. Except this, you are one of the best tutors on youtube.Thankyou for helping thousands of students in need.
All I can say is thank you
Very nice method of teaching.....
Thank you so much Madam😍😍😍😍😍
Thanks Mam
Amazing Video
🙏🙏
There is only 1 Ck key i.e AC. In the question, there is a partial dependency on A->B that's why this is not in 2NF.
best video for 2nf
Happy teachers day mam
Answer for exercise at 20:14
Partial Functional dependency exists which is A--> B
Because A is a proper subset of the candidate key AC , and B is a non-prime attribute.
Can't thank u enough Jenny ma'am !! 🤩🙌
The videos on Normalization are just amazing.. !! ✨🙌
Ma'am thank you thank you thank you very very much 🙏🏻
Excellent way of teaching.
Very easy to understand, thank you Jenny
AC is only CK, PD exists as A,C are PA. B,D are NPA. A as subset of AC determines NPA B and D. Therefore PD exists and not in 2NF. Kindly advise if correct. Thank You.
Your lecture is too much good👌👌👌👌
Hey ,in 1st example we are getting. Baf,caf,daf,eaf candidate keys right
The question with R(A,B,C,D) FD:{AB->CD , C->A , D->B } There will be 4 candidate keys AB , AD , BC , CD. Timestamp : 15:50
Details Explaination:
Classification of the attributes:
+-------------+---------+---------+----------+
| I(isolated) | L(left) | B(both) | R(right) |
+-------------+---------+---------+----------+
| - | - | A,B,C,D | - |
+-------------+---------+---------+----------+
Union of I and L:
Computation of the closure of the attributes from Step 4
Attributes on the both side of FD: A,B,C,D
Compute the closure of the combination of the power set of B(both) and .
A⁺ = A ⊂ R
B⁺ = B ⊂ R
C⁺ = AC ⊂ R
D⁺ = BD ⊂ R
We have not found any candidate keys by adding one-element sets to
AB⁺ = ABCD = R (candidate key)
AC⁺= AC ⊂ R
AD⁺ = ABCD = R (candidate key)
BC⁺ = ABCD = R (candidate key)
BD⁺= BD ⊂ R
CD⁺ = ABCD = R (candidate key)
Adding any other attribute leads to a superkey.
Hence, ['AB', 'AD', 'BC', 'CD'] are the (only) candidate keys.
AB, AD, BC, CD
Ans. Of hw question is
Not in 2nd NF
❤❤❤ Amazing lecture
Thank you jenny 🥰
Ur nice mam u r so gd in teaching, lv u mam
Sory it is u r
You are a wonder... Thank you ma'am
There is only 1 CK i.e . AC having PA (A,C ) and it's not in 2 NF becoz of PD of (A> B ) which is PA of our AC (Candidate key ) .
1 million subs very soon🥳
Best teacher ever🤩🥰
ma'am @ 15:41 replace B with D in CB ( since FD : D --> B) we will get another C.K i.e., CD therefore total 4 C.K's... thank you ma'am .
yup
Yes
Sorry ma'am! In 2nd example there are 4 cks here AB is equivalent to CD cos C=>A and D=>B that why A can be replaced with C n B with D now thus we'll get CD too
In last example R(A,B,C,D) F.D={A->B, B->D} here Ck={AC}, P.A={A,C}, non prime attribute={B,D} , partial dependency is present. so this is not 2NF. But I have a question which is partial dependency A->B or A->D ??
not in 2NF because {AC} is candidate key , hence non prime attributes are {B,D} and {A->ABD} (by transitivity), which is partial dependency . But partial dependency cant exist in 2NF.
2:30 start
AC is the only candidate key. The prime attributes are A,C. It is not in 2NF because A->B also A->D(transitive) .
Love you ma'am
As a computer engineering student, if Indian guys don't exist, probably I wouldn't learn anything about computer technologies :)
Ma'am in second example you said AB is a candidate key and also AB->CD, C->A, D->B then if we replace A to C and B to D then CD is also a super key? Is it a candidate key ?? As per i understand the concept it is a candidate key if i am wrong then plz clear my doubt.... also i want to tell you are an amazing teacher your lessons are helpful to me...thank you so much❤🌸
Question :- R(a,b,c,d)
FD={A--->B, B---->D}
Answer:- not in 2nd normal phone because PA={a,c}
Thank you ❤
Thank you Mam🙏❤!
Ma'am you are pretty and your teaching method is very impressive
waooo great lecture ...i can watch on dbms last question ans : not second form
God bless you mam
Good explanation
Mam thank you so much the video was really helpful. And the last problem is not in second normal form,please reply for this mam it would be great help for me
AC is Ck but the relation is 1nf not 2nf because A->B is partially dependent and also exist non -prime attributes.
Ma'am u are looking so beautiful. And thanks alot for this lacture
Thanku soo much mam ❤️❤️❤️❤️
Vere level......💥
Thanks mam.
Ac is candidate key and not in 2nf because a->b where a is a proper subset of candidate key which implicant b ie the non prime attribute. In this case prime attributes are ac and non prime attributes b and d
Thank you
Nice knowledge spreading spray
8:44 "super key is super key" lmao
Given a relation R( P, Q, R, S, T, U, V, W, X, Y) and 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. could you solve it mam please?
Thanks ma'am
Mam the question you are solving at 18:18 is not in 2nd normal form perhaps.
It contain two CK {A,AB} and B is pointing to non-prime attribute....
I am answering the question you've asked in second normal form...my answer is, yes that relation is in second normal form
but in the second last example there is a partial dependency so it should not be in 2NF
In the second example you used the one from hw in Part 1 finding candidate key.. But the result is different from there, I have doubts which one is correct please
Hi I think only three candidate keys
*_Nice Job_*
For 15:51 example, Won't CD be also a candidate key ??????????????????????????????????
@15:45 I think there can be four candidate keys AB, CD, CB, AD.
Please correct me if I am wrong. Thanks in advance.
yeah its actually 4 CK, but she stopped because, she found out that CK={AB,CB,AD} is enough for answering it as in 2NF.. how? by that time CK={AB,CB,AD} she noticed that PrimeAttributes={A,B,C,D} - which has all the attributes in the given relation and hence no possiblity of getting non prime attributes by the subset of CK(even from following any iteration of finding CKs)
@@HemanthKumar-if8vu If CD is candidate key, it wouldn't be 2nf as it defines C-> A? I think going to this partial dependence. . Please correct me if I'm thinking wrong
@@deryasonmez2524 but A is a prime attribute , what you say is the rule of the 3rd forme , so the relatio is not in the 3rd forme
thankssss
what's the difference between the candidate key and prime attributes? (9:07)
If there would be oscar in Teaching then mam will definetly get the award
Not in second normal form. Because of partial dependence A->B.
Excuse me ma'am, how long would it take to complete the playlist of dbms as well as OS . If possible please lemme know the dates .
Regards,
Jay
Thankyou ma'am.
You're helping alot 🙂
😉yaa
In second example you stated as 3 Candidate keys,But we have 4 Candidate keys,AB,CB,AD,CD
No You miss the key ..after candidate key has found you should check whether the primeattributes of the candidate key is present in the given dependencies ...in this manner , we should get .
@@shyamprakashm6325 thank you
15:54 mam we have one more CK that is CD
??????
I m confuse mam
BTW thank you mam for amazing explanation
I am learning so many things from your videos 👍
Can u please share your solution? Coz I am getting only 3 ck. Either (AB,BC,CD) or (AB,BC,AD).
@@fayazmd bhai from B can be replaced by D as there is a FD given , so AD
15:50 The candidate keys will be AB , AD , BC , CD, C, D right?
I mean AB -> C and AB -> D
Proper subset of C is phi as well as D. Therefore, C and D are candidate keys?
No through COMPOSITION rule,A->C and B->D
In the first video of ck of playlist , she gave the same question for homework and she told answer is AB,AD,BC,CD are ck so i think therre are 4 cks not 3 ck
AC is the CK, and A->B ; partial dependency exists:
therefore,, its not 2NF.
Nice
notes : definition and example : 6:10
12:00 varaikum paaru