to enroll in courses, follow best educators, interact with the community and track your progress.
29 lessons,
3h 12m
Enroll
280
Find candidate key easily (in Hindi)
730 plays

More
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 🔴UGC NET qualified🔴🌟YouTuber ☆🌟BOOK published on LINUX ADMINISTRATION by kalyani publish

U
Sir, i am getting a different answer in question no 5, can u tell me where iam wrong, please. (A+7)/6=22 =>A=125 =>A/5=25.. A=sum of ages of other family members
Mohit sharma
3 years ago
Let me take your solution like this: A=old average; so the total age seven year ago was A*5 but now after 7 years we have 6 members. to total increase in ages would be 7*6 therefore the equation for new average will be like (A*5+7*6)/6=22, which on solving gives A=18;
done mam
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