4.9 3NF Third Normal Form
Вставка
- Опубліковано 7 вер 2024
- 📝 Talk to Sanchit Sir: forms.gle/WCAF...
💻 KnowledgeGate Website: www.knowledgeg...
📲 KnowledgeGate Android App: tiny.cc/KG_Offi...
➡ Do not miss our Bestseller Courses:
🔴 GATE Guidance-2025: www.knowledgeg...
🟠 GATE Guidance Plus-2025: www.knowledgeg...
➡ Contact Us:
🟩 Whatsapp Chat: wa.me/91859512...
📞Call on: +91-8000121313
🟦 Telegram Updates: t.me/kg_gate
🟩 Whatsapp Updates: www.whatsapp.c...
📧 Email: contact@knowledgegate.in
➡ Our One Shot Semester Exam Videos: 👇
▶ Operating System: • Complete Operating Sys...
▶ DBMS: • Complete DBMS Data Bas...
▶ Computer Network: • Complete CN Computer N...
▶ Digital Electronics: • Complete DE Digital El...
▶ Computer Architecture: • Complete COA Computer ...
▶ Data Structure: • Complete DS Data Struc...
▶ Algorithm: • Complete DAA Design an...
▶ Software Engineering: • Complete Software Engi...
▶ Theory of Computation: • Complete TOC Theory of...
▶ Compiler: • Complete CD Compiler D...
▶ Discrete Maths: • Complete DM Discrete M...
➡ Free Subject-Wise Complete PlayList: 👇
▶️ DBMS: tiny.cc/kg_yt_DBMS
▶️ Operating System: tiny.cc/kg_yt_OS
▶️ TOC|Automata: tiny.cc/kg_yt_toc
▶️ Computer Networks: tiny.cc/kg_yt_CN
▶️ Digital Electronics: tiny.cc/kg_yt_D...
▶️ Compiler Design: tiny.cc/kg_yt_C...
▶️ Computer Architecture: tiny.cc/kg_yt_COA
▶️ Data Structure: tiny.cc/kg_yt_D...
▶️ Algorithms: tiny.cc/kg_yt_A...
▶️ Set, Relation, Function: tiny.cc/kg_yt_D...
▶️ Graph Theory: tiny.cc/kg_yt_g...
▶️ Group Theory: tiny.cc/kg_yt_g...
▶️ Proposition: tiny.cc/kg_yt_p...
#knowledgegate #GATE #sanchitjain
*********************************************************
For complete DBMS, check out this video: ua-cam.com/video/YRnjGeQbsHQ/v-deo.html
I have exam in two hours now n i am confident enough to solve it easily..........sabko neta banne dunga aur me pass hounga:)
Kya huwa bhai results ka?
batau bhaiya kesi gai exam....
Bhaut hi badiya gai thi exam...thanks to sir.
😂😂💯
😆😆🤣
I cant thank you enough sir. Its because of these open lectures that a lot of engineering aspirants get a strong understanding of the subject you teach and pass our exams.
Words are not enough to thank you. I wish every institution had teachers like you who could ignite the willingness to study in students by making concepts easy.
Rightly said (Y)
Doesn't this seem wrong? At 10:23, he says a super key cannot have a proper subset. But there is and it is called a candidate key [.](stackoverflow.com/questions/4519825/what-are-the-differences-between-a-superkey-and-a-candidate-key). Correct me if I am wrong.
However the explanation is otherwise on point
I think at 10.23 it was wrong. A super key can have a proper subset. Correct me if I am wrong. Except this, every explanation is excellent.
@@AnshumanKumar007 bhai dyn. Se sunn he is right
@@chitrasingh8724 yeah sir said it ryt...
In DBMS no one can beat you on entire earth... Practice problem is the major strength of the series... Keep it up in every subject..
Thank you for such kind words! Keep learning & stay connected for more amazing contents👍😊
I have exam day after tomorrow... This is helping me alot!
Thank you sir! 🤗
Very well explained lectures. Saves a lot of time and energy. Thank you so much Knowledge Gate.
I never really liked commenting on any video but this one compelled me. Thank you so much sir for explaining this concept to me which i was trying so hard to grasp.
Very well-explained lectures. Saves a lot of time and energy. Thank you so much, sir.
You're most welcome dear❤Keep learning & supporting! Stay connected for more amazing videos & upcoming contents 👍😊You can also check out our CS bundle course for complete preparation of Computer Science subjects, sharing course link below:
www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
sir , u are simply so amazing . i have even watched your operating system videos . and just coz of you , im able to understand lots of complicated stuffs so easily . please do continue this and let lord give you everything you ever needed and bless you with abundance love .
3:48 what a nice way to explain the concept. Best teacher !
11:15
Take screenshot of this lecture if anyone want..
Bana do sabko neta 😂😂😝 just awesome ... dost tum milo yaar... i live outside india but indeed i would like to c u ....
Sachin: Your videos are crystal clear. At 11 min 15 secs in the video, u r telling to prove that "either LHS is a SUPER KEY" OR ... In this statement, can we replace SUPER KEY by CANDIDATE KEY? Have u kept Super Key deliberately?
A big fat thanks for all your efforts , sir!
A request sir, plz upload the video / playlists explaining SQL , ER diagram and other important topics..plz
Non-Prime ki himmat itni bhad jaye :P lol
hahaha
thank you sir , your lectures are helping lot as i m mechanical engineering student and take dbms as elective ,your lectures are helping me lot in clearing exam
You are most welcome dear 😍 All the very best for your exam, do well 👍😊 Keep learning & supporting. Do visit our website www.knowledgegate.in for more amazing courses & contents !
I am also mechanical student. My elective is DBMS. This lecture is really helpful.
Sir u r the best teacher of dbms
Without any doubt hatts off to u sir grt lecturers ....luv this chennal
Thank you so much for deep and clear discussion..please upload for multivalued and join dependency ...please
Thank you very much from pakistan for best lecture
Most welcome dear 😍 Keep learning & supporting ! Stay connected for more amazing contents 👍😊
Thank You for the lectures, great learning resource :)
Thank u so very much for uploading these videos.
Can't thank you enough sir!!
Effortlessly simplified explanation 🔥
Sir your explanation just super. And the trick also. You are a hacker sir...
Very easy understandable explanation sir.. Thank you sir❤🙏🙏
You're welcome dear❤Keep learning & supporting! Stay connected for more amazing videos & upcoming contents 👍😊You can also check out our CS bundle course for complete preparation of Computer Science subjects, sharing course link below:
www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
sir aapke neta wale example se samjhane ka tarika bahut hi mazedar hai......
sir lot of thnks..
thnks u sooooooooooooooooooooooooooo much for your endless effort
Doesn't this seem wrong? At 10:23, he says a super key cannot have a proper subset. But there is and it is called a candidate key [.](stackoverflow.com/questions/4519825/what-are-the-differences-between-a-superkey-and-a-candidate-key). Correct me if I am wrong.
However the explanation is otherwise on point.
He meant to say that while there exists a partial dependency then "alpha" has to be a proper subset of candidate key.
Therefore if "alpha" is superset of candidate key,i.e-superkey(superset matlab proper subset nhi hai candidate key ka), then definitely Partial Dependency does not hold therefore we can conclude that its in 3NF.
thanks for the explanation bro
"Neta" word was funny and helped me in memorization. Thank you dost😁
My pleasure 😊 Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents !
Best Teacher 👍💯💯💯💯
Thanks a lot dear Vinayak..keep learning & supporting !! Do visit our website www.knowledgegate.in for more courses & contents !!
Outstanding sir
Aap mahan hain 🙏🙏🙏🙏
Thank you Well explained..
You are welcome Ahamed.. Keep learning and supporting !! Do visit our website www.knowledgegate.in for more courses and contents !!
Thank you sir
Thanks sir g
Thanks sir
Sir the way you teach is really nice
So nice lectures
Ultimate explain
Thanks a lot dear 😍 keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊
Thanks sir.very impressive and easy way.
Sir please help.
Which one of the following statements is FALSE?
A. Any relation with two attributes is in BCNF
.
B. A relation in which every key has only one attribute is in 2NF
C. A prime attribute can be transitively dependent on a key in a 3NF relation
D. A prime attribute can be transitively dependent on a key in a BCNF relation
Your lectures are really helpful thank u sir... Can you upload lectures for computer architecture pls...
Clarity++
you teach amazing sir!!
Thanks a lot dear Aryan, keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents !
You are great sir
A perfect man
Thank you sir 😊
Thanks a lot Bhavna, Keep learning and supporting !! Do visit our website www.knowledgegate.in for more courses and contents !!
sanchit sir is best
Thanks a lot dear @Aditya for your kind words❤ Keep learning & supporting! Stay connected for more amazing contents & videos 👍
Sir u r the best, ,,,unmatched
Thank you so much for your kind words dear, keep supporting❤
2nf mai nai hai A-B MAI partial dependecy hai as b is non prime and a is prime attribute
A functional dependency X → Y is a full functional dependency if removal of any attribute A from X means that the dependency does not hold any more; that is, for any attribute A ε X, (X - {A}) does not functionally determine Y. A functional dependency X → Y is a partial dependency if some attribute A ε X can be removed from X and the dependency still holds; that is, for some A ε X, (X - {A}) → Y.
-- FUNDAMENTALS OF Database Systems SIXTH EDITION Ramez Elmasri & Navathe
-- Reference from stackoverflow.com/a/25827210/6009502
If you were not there....i would have lost my 16 marks...thankss a lott sir ✨
Haha glad to know this ❤ Keep learning & supporting! Stay connected for more amazing contents & videos 👍
superb teaching sir hats off!
Excellent !
sir, not clear about decomposition in 3NF. Whether we should first convert the relation in the 2nf and after that we can convert it into 3nf or we can directly convert 1nf relation into 3nf?? please reply
Hindi mein compatable hai....sir
Easy understand topic in hindi
Thank u for ur efforts sir
but this example is already violating 2nf as c depends on b where b is and c are not a part of primary key?
Why have we introduced a new form then(i.e 3nf), can we have any example which is in 2nf but not in 3nf?
thanks
Thank you 🙏
You’re welcome 😊 keep supporting & stay connected👍 Do visit our website www.knowledgegate.in for more amazing videos & contents😍
shukriya
Sanchit sir : B yhan neta bnrha h or bolrha h m C ko nikal kr dikha dunga
B be like: hume kuch kehna hai....
At 9:00 you said : prime attribute is dependent upon super key ...... But if it is dependent then how can it be as prime attribute?
who were these jealous people , disliking this superb vedio
kamalllll.............
thnk u.
this really helped me. and that's a pakistani speaking! :)
Education has no boundaries, be it the boundary of our countries. :)
i dont understand one thing.Every indian on pakistani channel will always write from India and vice versa.?
I also have noticed this. I think they do this to enforce the fact that despite bitterness between the 2 countries, we still have respect for each other.
this finally cleared it.
Why good teachers like u only found on utube , not in cllg ,schl ?😂😂
Cllg , schl m smjh nii aata utube s ek br m 😌
Thanks you sir !
Sir..at 10:31 you said that...if we prove alpha is a superkey then transitive dependency will not hold because alpha ..being a part of key..cannot be non-prime.But.. Alpha being a superkey may not necessarily be a candidate key..and hence alpha might be a non-prime attribute.Sir,I am having doubt at this point.
"alpha being a superkey may not necessarily be a candidate key".
alpha is the superkey means it can identify a tuple uniquely hence prime attribute as a whole too.
If alpha is ABCD, then where AB is candidate key and definitely its superset is superkey.
Now you're saying alpha may be non prime. How? ABCD cant be non prime since its alpha only and most importantly it contains candidate key.
But sir, I have a confusion that super key consists all the prime attributes and we say that a partial dependency exists when a proper subset of our candidate key can retreive the value of other attribute, but that prime or proper subset of candidate key can also be the subset of super key. For example, if ABCD is superkey and BC is Candiadate key and B has a partial dependency . Then B is also a proper subset of superkey at the same time.
Khuda kareh sahal
Superb
Thanks sir g 🙏
LOVE YOU SIR
Thanks you sir......
👍👍
Thanks.....sir
🔥Complete DBMS by Sanchit Sir: tiny.cc/DBMS_Sanchitsir_kg
🔥🔥All Computer Science Subjects by Sanchit Sir: tiny.cc/CSbundle_dbms_kg
Do we also need to make a relation exclusively for the candidate key along with the attributes which can be only (no partial dependency) and directly(no transitivity) found by it?
What is difference between 1nf and 2nf?..i thought if c.k is made of 1 attribute then that is the 1nf..but here at first example u said it to be 2nf
how can beta be a prime attribute? we know that a prime attribute is the one that does not depend on anything.
Thank u sir....
At 10:23, he says a super key cannot have a proper subset. But there is and it is called a candidate key.Slight mistake...otherwise the video is great.
what if prime attribute finds non prime attribute in Fd will it be in 3nf?
What if B contains prime + nonprime attributes?
Then it becomes super key
Dhanyawad sir ji😆
its actually a knowledge gate. love this channel
Thank you so much sir
GREAT
Thank you dear! Keep supporting & stay connected for more amazing contents👍😊
You can also check out our course for all Computer Science subjects, sharing the link below:
www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
I love u sur 💖😘
Tysm sir
table in non 3NF with 4000 Ds to table in 3NF with 3006 DS.
How can we solve this
cant thank you enough
Hello sir plz upload next video of group theory
jump to @00:50 if you have got exams tomorrow..
Thanks mate
sir can you make some vedio lec on (M-3) math
Please note, A --> B is fully functional dependency, not the partial dependency. Complete clarification is here ... iips.icci.edu.iq/images/exam/databases-ramaz.pdf
Is 3nf Contains redundancy?
Sir will you cover whole syllabus on youtube?
❤️❤️♥️💕💕
Gate smashers se padh ke aayiyee or dhhere dheere ache se samagaiyee or sahi samagaiyeee
🙌
plz sir
UGCNet ke lecture upload kijiye
import questions and shortcut keys