Introduction to Database Systems Week 7 Quiz Answers Nptel

Are you looking for NPTEL Introduction to Database Systems Week 7 Quiz Answers? You’ve come to the right place! Access the most accurate answers at Progiez.

---

---

---

Introduction to Database Systems Week 7 Quiz Answers (Jan-Apr 2025)

Course Link: Click Here

---

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

a) True
b) False

View Answer

---

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

a) True
b) False

View Answer

---

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

a) True
b) False

View Answer

---

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

a) True
b) False

View Answer

---

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

a) Trivial FDs
b) Non-Trivial FDs
c) Axioms of sets
d) Armstrong axioms

View Answer

---

Que. 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:

a) S1: True; S2: False
b) S1: True; S2: True
c) S1: False; S2: True
d) S1: False; S2: False

View Answer

---

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

a) EmpPost → EmpSalary
b) EmpName → EmpSalary
c) {EmpPost, EmpName} → EmpSalary
d) EmpExperience → EmpSalary

View Answer

---

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

a) Empid determines EmpAddress
b) EmpMobileNum determines HomeCity
c) {EmpDob, Homecity} determines EmpAddress
d) {EmpName, HomeCity} determines EmpAddress

View Answer

---

Que. 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:

a) S1: True, S2: True
b) S1: True, S2: False
c) S1: False, S2: True
d) S1: False, S2: False

View Answer

---

Que. 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+?

a) {I, A, H}
b) {I, A, H, F}
c) {I, A, H, F, B}
d) {I, A, H, F, B, C, D, G}

View Answer

---

Que. 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+?

a) {I, A, H}
b) {I, A, H, F, B}
c) {I, A, H, F, B, C, D, G}
d) {I, A, H, F, B, E}

View Answer

---

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

a) The candidate key for R is I
b) The candidate key for R is IE
c) The candidate key for R’ is IE
d) The candidate key for R is IDE

View Answer

---

Que. 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:

a) S1: True; S2: True
b) S1: True; S2: False
c) S1: False; S2: False
d) S1: False; S2: True

View Answer

---

Introduction to Database Systems Week 7 Quiz Answers

For answers to others Nptel courses, please refer to this link: NPTEL Assignment