Mam your Channel is going really fast . I am following your channel for 4 months and the content is good . Thanks for the Data structures playlist . It really helped me .
I love your teaching techniques Ma'am... you are really the Goddess of DBMS. Please provide video lectures for other subjects of Computer Science as well. It would be really helpful.
You deserve way more likes and subs. Too bad, those who watch these lectures are the ones who truly want to learn, or those who only want to pass. Still, it's very helpful
Please cover all the topics of dbms....your videos are super amazing..and it helps me to understand the topic from basic...after watching your videos i feel confident on that topic ..you are truly amazing...love you
Your way of explaining things is really ineffable and astonishing. Your lectures are the perfect healing for semester injured students. I really want to meet you once. Thank you mam.
Great explanation. I had a lot of trouble understand normalization. I watched all the videos and the real life examples helped me grasp the concepts. Thank you!!!
Mam you are fabulous, magnificent... Your teaching gets stuck in my head and you in my heart💓 You are another crush of mine.. Just keep smiling always..❣❣
Thanks for DBMS ma'am... My DBMS exam on dated 30/11/2019 I can easily learn from your channel. You are combination of beauty and mind. Great and easy explanation. 🔥 🔥 🔥 Please ma'am make video on transaction control Before my exam 🔥 🔥 🔥 I have interest in DBMS and DS because of you 😂 Keep it up!
Thank you mam firstly i have a huge doubt about how to identify the super keys and now by watching your videos my concepts are getting clear day by day
Hi Mam, I have a Doubt, In the video you said 16 keys possible for 4 attributes, In a relation having 4 attributes,the number of keys possible is 15[(2^4)-1], Right? Please clear my doubt,the lecture was Awesome BTW.
No, I don't believe so. Considering that XcY means "X choose Y", you want to calculate 4c0 + 4c1 + 4c2 + 4c3 + 4c4 = 16, where 4c0 represents the candidate key with only A as the attribute (and by definition also the primary key because we don't have any other candidates to choose from).
@@schopengaard9796 my doubt is why are we choosing from X i.e. 4? Since none of BCDE is super key and only A is super key. So A, AB,ABC, ABCD, ABCDE etc are super keys. Please explain why we are considering BCDE as X in X choose Y.
@@twinkler2854 If A is a superkey, any combination of A with the other attributes will also be a superkey. Each attribute (B, C, D or E) can be part of the combination or not (2 possibilities). So, you have 2 power 4 = 16 possibilities total, that includes the case of none of B, C, D or E are included in the combination. The possible combinations are A, AB, AC, AD, AE, ABC, ABD, ABE, ACD, ACE, ADE, ABCD, ABCE, ABDE, ACDE, ABCDE.
Thank you so much ma'am, this is very helpful! I have a quick question - in your trick to find the attribute closure for a given set, do we only have to go over the given functional dependancies, or also have to check the derived FD using axioms? Thank you!
sab samajh ara hai bohot badiya ..but plz thora jaldi video daal dijiye exam hai 15-20 din mai .. daa to ho gayi meri .. DBMS aur karwa dijiye please ... bacha lo madam.
I HAVE A DOUBT !!!!!! I tried to find the 16 superkeys which are according to the 2ⁿ-1 formula. but i got only 14 s.ks by combining each attribute to A, AD ( as they are the only closure sets which contain all set of attribute of the given relation) which are A,AB,AC,AD,AE,ABC,ABD,ABE,ACD,ACE,ADE,ABCD,ABCE,ABCDE. Help me which 2 i left ? i couldn't find 16 keys. 🤔🤔🙄🙄
Same: {A, AB, AC, AD, AE, ABC, ABD, ABE, ACD, ACE, ADE, ABCD, ABCE, ABDE, ABCDE } but I find 15 SK which concurs with her formula for finding SK ( 2ⁿ-1 )
Maximum Super keys = 2^n - 1. If each attribute of relation is candidate key. mind this 2nd line you forgot this. so if you are taking n=4, that means you know that 4 attributes are candidate keys ,but in mam's que. that is not the situation. i hope u got it.
@@259_parthpatidar9 but since we are combining it with A and A is super key so all the combinations will be super key , and total number of combinations : 4c1(AB)+4c2(ABC)+4c3(ABCD)+4c4(ABCDE) = 15
Just 27 min and you are master in closure this is what everyone student wants god bless you mam
I meet you again. DSA, C programing and now, DBSM. You are a life saver, mam
Jenny, you are awesome! I was confused but you CLEARLY explained each step perfectly for me!! I understand now and will help on my up coming test! 😊
Mam your Channel is going really fast . I am following your channel for 4 months and the content is good . Thanks for the Data structures playlist . It really helped me .
Awesome lecture! Thanks from the US. Stay safe during this time
I love your teaching techniques Ma'am... you are really the Goddess of DBMS. Please provide video lectures for other subjects of Computer Science as well. It would be really helpful.
Hii
You deserve way more likes and subs. Too bad, those who watch these lectures are the ones who truly want to learn, or those who only want to pass. Still, it's very helpful
Thanks for this, very easy to understand, and the way you make a point at looking at the camera really kept me focused, thank you!
I was very confused to learn Data structure but u learned very very well.......Thank u so much from Pakistan
It is a wonderful video. The concept is made crystal clear with zero doubt. Thanks a lot.
I will declare this is the best video available on UA-cam to find closure.😮😮😮
Your way of explanation is purely logical and to the point, brilliant Mam, thank you for this lecture.
Please cover all the topics of dbms....your videos are super amazing..and it helps me to understand the topic from basic...after watching your videos i feel confident on that topic ..you are truly amazing...love you
Your lecture is amazing! Thank you so much!
Your way of explaining things is really ineffable and astonishing. Your lectures are the perfect healing for semester injured students. I really want to meet you once. Thank you mam.
Crystal clear explanation ma'am. Way to go.
fabulous mam a i am from Pakistan i like the way you teach this series of lectures helps me for my Dbms paper thank u mam........
Also check mine ones
@@BahawalTV ओक
Your lecture is amazing! Thank you so much!😍
way to go. more useful than our univ lec
Thank you more jenny you are going to make me a champion,your lectures are interresting
Speechless🥰♥️ ...thank u so much jeni from chennai
maza aa gya... aapke jaisa teacher aaj tk nhi dekhaa.. aap bhot badiya pdhate ho mam #jenny_lecture
Hey, I can't think of better lecture.
This video cleared all doubts.
Ofcourse
Your teaching is excellent madam...liked the way you teach.
Thank you very much, you deserve much more appreciation ❤
Just watched your video, what a wonderful explanation! Loved it!
❤❤ best teacher ever
Great explanation. I had a lot of trouble understand normalization. I watched all the videos and the real life examples helped me grasp the concepts. Thank you!!!
Thank you so much Mam. I would like to thank God so much for sending such nice teacher's like you, who explain the concept very nicely.
Mam you are fabulous, magnificent...
Your teaching gets stuck in my head and you in my heart💓
You are another crush of mine..
Just keep smiling always..❣❣
Thanks alot... very simple to follow up your lectures
We love you Jenny. Greetings, 4CHIF.
Madam definitely this is the best video to understand
Thanks for DBMS ma'am... My DBMS exam on dated 30/11/2019
I can easily learn from your channel.
You are combination of beauty and mind.
Great and easy explanation.
🔥 🔥 🔥
Please ma'am make video on transaction control
Before my exam
🔥 🔥 🔥
I have interest in DBMS and DS because of you 😂
Keep it up!
best video!! it helped me a lot mam....thank-you......continue making videos like these!!
This class is super easy to understand,maja agya padh ke 🤩
Thank you!! Your explanation is so clear and considered.
Thank you from Australia.
Iam a big fan of your teaching
Thank you so much Madam ♥️♥️♥️ You are the best..
Thanks a lot for the crystal clear explanation❤❤
Thank you so much mam my all doubts clear 😍
Your teaching so nice that's why Iam asking you
Best lecturer i ever seen♥️
Best Teacher
Thanks mam
Allah ape ko buhat achi life day
here is total 16 sk :
A, AB, AC, AD, AE, ABC, ABD, ABE, ACD, ACE, ADE, ABCD, ABCE, ABDE, ACDE, ABCDE
same question brother
thank you ma'am!
Thankyou ma'am! Thankyou Thankyou Thankyou!🙏
After 2hours of reading slides just to understand closure set of attributes (crystal clear) in 28mins. Thank you maam
Ya
Your explanation 💫👌
Thank you so much💗💗💗💗💗💗💗💗💗💗💗
Thank you mam firstly i have a huge doubt about how to identify the super keys and now by watching your videos my concepts are getting clear day by day
Thanks from Argentina Jenny
❤ Super se bhi upar candidate key
I really enjoyed your lecture. You are such a great lecturer. Keep it up
Hi Mam,
I have a Doubt,
In the video you said 16 keys possible for 4 attributes,
In a relation having 4 attributes,the number of keys possible is 15[(2^4)-1],
Right?
Please clear my doubt,the lecture was Awesome BTW.
No, I don't believe so. Considering that XcY means "X choose Y", you want to calculate
4c0 + 4c1 + 4c2 + 4c3 + 4c4 = 16,
where 4c0 represents the candidate key with only A as the attribute (and by definition also the primary key because we don't have any other candidates to choose from).
Ok
@@schopengaard9796 my doubt is why are we choosing from X i.e. 4? Since none of BCDE is super key and only A is super key. So A, AB,ABC, ABCD, ABCDE etc are super keys. Please explain why we are considering BCDE as X in X choose Y.
@@twinkler2854 If A is a superkey, any combination of A with the other attributes will also be a superkey. Each attribute (B, C, D or E) can be part of the combination or not (2 possibilities). So, you have 2 power 4 = 16 possibilities total, that includes the case of none of B, C, D or E are included in the combination. The possible combinations are A, AB, AC, AD, AE, ABC, ABD, ABE, ACD, ACE, ADE, ABCD, ABCE, ABDE, ACDE, ABCDE.
@@jeanrioux8750 correct👏
Woow, Your lectures really helpful.
thank you so much for these videos!!
this has been very helpful. subscribed
Thank you so much 🥰❤️
amazing explanation.. better than my lecture videos..
What a teaching❤️No one will replace u👌
Awesome and easy explanation
Thanks ❤❤❤❤❤
First comment
Realy you are working so hard
19:32 "definitely not" MSD ❤️
You are awesome. You teach wow.
thank you ma'am 😀
Trick was awesome 👌
if my clg professor teach like you, i will be the topper of the batch
If you listen your professor seriously like your class topper then you will definitely become class topper one day...
Ma'am please make videos on theory of computation also...It will be really helpful :)
Thank You Mam❤!
Awesome lecture.. maam cna you me an other video for what is entity and attributes. how to find entity for given problem
I wish i could have you on our DATE 😎😍😍😍 QUEEN OF DS
Thank you so much ma'am, this is very helpful! I have a quick question - in your trick to find the attribute closure for a given set, do we only have to go over the given functional dependancies, or also have to check the derived FD using axioms? Thank you!
Amazing your lecture
Thank you so much for such a nice lecture. Can you please make a lecture on stable matching problem.
Ok
You're awesome 😊
this video could have been less than 10 mins
@@sadboy-xx6gh there is a 2 min video out there explaining this topic in most simple way
Your beauty distracts me😆😆🤘 FOCUS🤦♂️
thank u mam!
Thank you
❤❤❤
Thank you mam!
I love u 🥰🥰🥰🥰🥰😊😊😊😊😊
Nice explanation
@JennyslecturesCSIT Actually the total possible keys are (2^4) - 1 right?
Nice video mam...
Mam you are super ...
At 19:24 you mentioned that A can be a candidate key. But, how can A be a candidate key since AD is a proper subset of A and AD is a super key?.
your video are amazing mam but can you give us some question on particular topic by that we can conclude our knowledge
Ur disturbing me more uff but ur smiles like an angel 🥰👌❤
Thora porai vi kor lo beta...
sab samajh ara hai bohot badiya ..but plz thora jaldi video daal dijiye exam hai 15-20 din mai .. daa to ho gayi meri .. DBMS aur karwa dijiye please ... bacha lo madam.
mam please make video on...Highest Response Ratio next in operating system concept...plz make Fast...I have exam on this Friday...plz mam🙌🙌
I HAVE A DOUBT !!!!!!
I tried to find the 16 superkeys which are according to the 2ⁿ-1 formula. but i got only 14 s.ks by combining each attribute to A, AD ( as they are the only closure sets which contain all set of attribute of the given relation) which are A,AB,AC,AD,AE,ABC,ABD,ABE,ACD,ACE,ADE,ABCD,ABCE,ABCDE. Help me which 2 i left ? i couldn't find 16 keys.
🤔🤔🙄🙄
Same: {A, AB, AC, AD, AE, ABC, ABD, ABE, ACD, ACE, ADE, ABCD, ABCE, ABDE, ABCDE } but I find 15 SK which concurs with her formula for finding SK ( 2ⁿ-1 )
@@b1zarre23 ACDE
All 16 found
@@Yalla_Balaji thanks
A, AB, AC, AD, AE, ABC, ABD, ABE, ACD, ACE, ADE, ABCD, ABCE, ABDE, ACDE, ABCDE
Maam, max no of super keys - 2^4 -1 ,so 15, right?
Maximum Super keys = 2^n - 1. If each attribute of relation is candidate key. mind this 2nd line you forgot this. so if you are taking n=4, that means you know that 4 attributes are candidate keys ,but in mam's que. that is not the situation. i hope u got it.
@@259_parthpatidar9 but since we are combining it with A and A is super key so all the combinations will be super key , and total number of combinations : 4c1(AB)+4c2(ABC)+4c3(ABCD)+4c4(ABCDE) = 15
Thanks mdm❤️
well explained
Mam please please please make complete video tut for this DBMS subject