Sign up now
to enroll in courses, follow best educators, interact with the community and track your progress.
Find candidate key easily (in Hindi)
581 plays

Easy trick to find candidate key in DBMS for NTA NET computer science examination.

Nisha Mittal is teaching live on Unacademy Plus

Nisha Mittal
🌟 MCA Gold Medalist 🌟 Star Educator 🌟Gate Qualified 🌟YouTuber ☆🌟BOOK published on LINUX ADMINISTRATION by kalyani publisher ☆🌟 7+ years teac

Unacademy user
Sir first of all thanks alot for making such wonderful course, this really helps in saving much time. And i just wanted to ask, do i need to read newspaper also along with your videos ?
Jatin Verma
2 years ago
half an hour atleast
Shruti Suman
2 years ago
Sir, Plz make pib summary...we all need it...plz sir
Nilkantha Garain
2 years ago
Hello sir How could i find out in facebook? please give the address.
Mohd Nasir
2 years ago
Where is today's newspaper summary??
Mohd Nasir
2 years ago
Jatin sir rply me
mam how we calculate number of candidate keys in a relation
done.please teach in English I don't know hindi. please give more mcq mam
Done mam....need more questions from u..thnx
  1. Finding the candidate keys

  2. Finding the candidate keys

  3. Finding the candidate keys

  4. R = ABCDE F = { A-> BE. C-> BE, B-> D)

  5. R ABCDE, F- {A-> BE, C-> BE, B-> D) attribute closure: A+ABDE B+ BD C+CBDE D+ D E+E

  6. R ABCDE, F- {A-> BE, C-> BE, B-> D) attribute closure: A+ABDE B+ BD C+CBDE D+ D E+E The 2 attributes that can not be attained from any functional dependency AC. AC+ A,C,B,E,D)

  7. R-ABCD, F-A-> BCD, C->A) Attribute closure: A+ABCD B+ B C+ABCD D+ D Our candidate keys are A and C

  8. unacademy All live & Lessons by all Weekly quizzes structured courses top Educators & doubt-clearing 001-11 US NISHA MITTAL Referral Code - nishamittal86-2742