Question:

Consider a database relation \( R \) with attributes \( A, B, C, D, E, F, G \), and having the following functional dependencies: \[ A \rightarrow BCEF \quad E \rightarrow DG \quad BC \rightarrow A \] Which of the following statements is/are correct?

Show Hint

When solving database normalization problems, always check if the given functional dependencies can uniquely determine all attributes and analyze candidate keys carefully. For BCNF, ensure the determinant is always a superkey.

Updated On: Apr 4, 2025

\( A \) is the only candidate key of \( R \)
\( A, BC \) are the candidate keys of \( R \)
\( A, BC, E \) are the candidate keys of \( R \)
Relation \( R \) is not in Boyce-Codd Normal Form (BCNF)

Hide Solution

Verified By Collegedunia

The Correct Option is B, D

Solution and Explanation

Step 1: Analyzing the given functional dependencies.
From \( A \rightarrow BCEF \), we know that if we know \( A \), we can determine \( B, C, E, F \).
From \( E \rightarrow DG \), knowing \( E \) gives us \( D \) and \( G \).
From \( BC \rightarrow A \), knowing \( B \) and \( C \) gives us \( A \).

Thus, the combination of \( A \) and \( BC \) will allow us to determine all the attributes in the relation, making \( A \) and \( BC \) valid candidate keys.

Step 2: Checking other options.
Option (A): \( A \) alone is not the only candidate key because \( BC \) also forms a candidate key.
Option (C): \( E \) can be considered a candidate key along with \( A \) and \( BC \), because knowing \( E \) gives us \( D \) and \( G \), and with \( BC \), we can determine \( A \). This leads to all the attributes in the relation.
Option (D): The relation is in BCNF because the determinant in all functional dependencies is either a superkey or part of a superkey.

Was this answer helpful?

Questions Asked in GATE DA exam

Consider a directed graph \( G = (V,E) \), where \( V = \{0,1,2,\dots,100\} \) and
\[ E = \{(i,j) : 0 < j - i \leq 2, \text{ for all } i,j \in V \}. \] Suppose the adjacency list of each vertex is in decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 is:
- GATE DA - 2025
- Data Structures
View Solution

Consider the following pseudocode.

Create empty stack S
Set x = 0, flag = 0, sum = 0
Push x onto S
while (S is not empty){
    if (flag equals 0){
        Set x = x + 1
        Push x onto S
    }
    if (x equals 8):
        Set flag = 1
    if (flag equals 1){
        x = Pop(S)
        if (x is odd):
            Pop(S)
        Set sum = sum + x
    }
}
Output sum

The value of \( sum \) output by a program executing the above pseudocode is:

GATE DA - 2025
Data Structures

View Solution

Consider the following Python code snippet.

def f(a, b):
    if (a == 0):
        return b
    if (a % 2 == 1):
        return 2 * f((a - 1) / 2, b)
    return b + f(a - 1, b)

print(f(15, 10))

The value printed by the code snippet is 160 (Answer in integer).

GATE DA - 2025
Recursion