Register

Made easy || Database

1,524 views
1 votes
1 votes

Consider a relation schema r(A, B, C, D, E, F) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________.

User Avatar

1 Answer

Best answer
3 votes
3 votes

Maximum number of candidate keys for a relation can be given by:$\binom{n}{\left \lceil n/2 \right \rceil}$. For example R(A,B,C,D) have AB,BC,CD,AD,BD .Here A is fixed in any candidate key, so for other 5 attributes we  have $\binom{5}{\left \lceil 5/2 \right \rceil} = 10$ keys. So, answer is 10.

Reference: sql - finding largest number of candidate keys that a relation has? - Stack Overflow

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
kaustubh7 asked Sep 20, 2023
435 views
made easy test series 2023
Consider a relation R having seven attributes ABCDEFG. Fields of R contain only atomic values. FDs = {CD → G, A → BC, B → CF, E → A, F → EG, G → D} is set of functional dependencies. So, how many candidates key does the relation R have?
Consider a relation R having seven attributes ABCDEFG. Fields of R contain only atomic values.FDs = {CD → G, A → BC, B → CF, E → A, F → EG, G → D} is set of f...
User Avatar
3 votes
3 votes
2 answers
2
Ram Swaroop asked Jan 30, 2019
1,298 views
Made easy mock test 1 DBMS super keys
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_
User Avatar
0 votes
0 votes
1 answer
4
nikkey123 asked Nov 16, 2017
633 views
MadeEasy Subject Test: Databases - Candidate Keys
User Avatar
Link Copied!