Question is about KEY. Its not mentioned that it should be a candidate key or a super key. Then how to determine what is the Answer, because option C is also a KEY coz it contains EFH too.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+15 votes

Consider the relation scheme $R = (E, F, G, H, I, J, K, L, M, N)$ and the set of functional dependencies $$\left\{ \{E, F \} \to \{G\}, \{F\} \to \{I, J\}, \{E, H\} \to \{K, L\}, \\ \{K\} \to \{M\}, \{L\} \to \{N\}\right\}$$ on $R$. What is the key for $R$?

- $\{E, F\}$
- $\{E, F, H\}$
- $\{E, F, H, K, L\}$
- $\{E\}$

+23 votes

Best answer

0

Question is about KEY. Its not mentioned that it should be a candidate key or a super key. Then how to determine what is the Answer, because option C is also a KEY coz it contains EFH too.

+3 votes

given relation is determined)

of the given relation can be determined

but it is not minimal, since by the definition

of Candidate key it should be minimal Super Key)

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.5k
- Digital Logic 2.1k
- Programming & DS 4k
- Algorithms 3.4k
- Theory of Computation 4.2k
- Compiler Design 1.6k
- Databases 3.1k
- CO & Architecture 2.7k
- Computer Networks 3.1k
- Non GATE 1.1k
- Others 1.4k
- Admissions 501
- Exam Queries 449
- Tier 1 Placement Questions 19
- Job Queries 62
- Projects 12

38,079 questions

45,572 answers

132,066 comments

49,040 users