NPTEL Introduction to Database Systems Week 7 Assignment Answers 2025

By /

NPTEL Introduction to Database Systems Week 7 Assignment Answers 2025

1. A functional dependency is a formal constraint among attributes of a relation.

  • True
  • False
Answer :- For Answers Click Here

2. A functional dependency is a property of the meaning of the attributes.

  • True
  • False
Answer :-

3. Functional dependencies are used in the process of schema design.

  • True
  • False
Answer :-

4. If B ⊆ A, then FD A ​ → ​ B is considered trivial.

  • True
  • False
Answer :-

5. We use _ _ _ _ _ to find functional dependencies (FDs) logically implied by the given set of FDs . Choose the most appropriate option:

  • Trivial FDs
  • Non-Trivial FDs
  • Axioms of sets
  • Armstrong axioms
Answer :-

6. Consider the statements S1 and S2 given below:

S1: The following are all examples of trivial FDs:
Uid ​ → ​ Uid, {DeptId, DeptName} ​ → ​ DeptId,
{StudId, MobileNum} ​ → ​ MobileNum, {LoanNum, AccountNum} ​ → ​ {LoanNum, AccountNum}
S2: The following are all examples of non-trivial FDs:
EmpId ​ → ​ EmpName, EmpId ​ → ​ EmpAddress,
{StudName, StudDob, StudMobileNum} ​ → { ​ StudMobileNum, StudAddress}

Choose the correct option:

  • S1: True; S2: False
  • S1: True; S2: True
  • S1: False; S2: True
  • S1: False; S2: False
Answer :-

7. If F = { EmpName → EmpExperience, {EmpPost, EmpExperience} → EmpSalary }, then F entails which of the following:

  • EmpPost → EmpSalary
  • EmpName → EmpSalary
  • {EmpPost,EmpName} → EmpSalary
  • EmpExperience → EmpSalary
Answer :-

8. Which of the following FD’s can be observed as ​ not​ holding on the given data instance?: Employee

  • Empid determines EmpAddress
  • EmpMobileNum ​ determines ​ HomeCity
  • {EmpDob, Homecity} determines EmpAddress
  • {EmpName, HomeCity} determines EmpAddress
Answer :- For Answers Click Here

9. Consider the following statements regarding a relational scheme R and a set of FDs F on it:

S1: Lossless, dependency-preserving decomposition of R into 3NF relations wrt F is always possible
S2: Lossless, dependency-preserving decomposition of R into BCNF relations wrt F is always possible.

Choose the correct option:

  • S1: True, S2: True
  • S1: True, S2: False
  • S1: False, S2: True
  • S1: False, S2: False
Answer :-

10. The functional dependencies for a relation R(A, B, C, D, E, F, G, H, I) are

S = { AD ​ → ​ G, A ​ → ​ F, H ​ → ​ B, FB ​ → ​ D, D →​ C, I ​ → ​ AH }.

Which of the following represents ​ I+ ?

  • {I, A, H}
  • {I, A, H, F}
  • {I, A, H, F, B}
  • {I, A, H, F, B, C, D, G}
Answer :-

11. The functional dependencies for a relation R​ ’ ​ (A, B, C, D, E, F, G, H, I) are

S​ ’ ​ = {AD ​ → ​ G, A ​ → ​ F, H ​ → ​ B, FB ​ → ​ E, D ​ → ​ C, I →​ AH}.

Which of the following represents I+ ?

  • {I, A, H}
  • {I, A, H, F, B}
  • {I, A, H, F, B, C, D, G}
  • {I, A, H, F, B, E}
Answer :-

12. Refer to Question 10 and 11, and find out what is TRUE with respect to R and R​ ’​ :

  • The candidate key for R is I
  • The candidate key for R is IE
  • The candidate key for R’ is IE
  • The candidate key for R is IDE
Answer :-

13. Consider the following statements:

S1: Armstrong axioms allow us to compute all elements of F+ for any given F
S2: Armstrong axioms may sometimes generate an incorrect functional dependency

Choose the correct option:

  • S1: True; S2: True
  • S1: True; S2: False
  • S1: False; S2: False
  • S1: False; S2: True
Answer :- For Answers Click Here

Related Posts

Scroll to Top