X

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)

sec21it163@sairamtap.edu.in 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Introduction to Database Systems

(course)

Course
outline Week 7: Assignment 7
The due date for submitting this assignment has passed.
Introduction Due on 2023-03-15, 23:59 IST.
to Database
Systems ()
Assignment submitted on 2023-03-14, 22:35 IST
Week 0 () 1) A functional dependency X → Y holds on schema R if, in - - - - legal instance of 2 points
r(R) it satisfies the functional dependency.
Week 1 () Choose the most appropriate word that can be filled in the blank:

Week 2 () At Least one

Some
Week 3 () Every
None of these
Week 4 ()
Yes, the answer is correct.
Score: 2
Week 5 ()
Accepted Answers:
Every
Week 6 ()

2) One or more of the following phrases can be used to correctly complete the 2 points
Week 7 ()
sentence:
Normal forms - A functional dependency is a - - - - - - of a relation.
Introduction { P1: Property of a specific attribute P2: Constraint on the data
(unit? P3: Property of the schema P4: Property of a specific row     }
unit=62&lesson=63) Choose the option that gives all the correct ways of filling the blank:

Deriving new
Only P1 and P3
functional
dependencies Only P2 and P3
(unit? Only P2 and P4
unit=62&lesson=64)
Only P1, P3, and P4
Y h i
 Yes, the answer is correct.
Proving
Score: 2
soundness
Accepted Answers:
and
Only P2 and P3
completeness
of Armstrong's 3) Recall the definition of functional dependency X → Y and identify the FALSE 2 points
Axioms (unit? statement:
unit=62&lesson=65)
A functional dependency is a constraint on the values of two sets of attributes of a relation
Lecture Slides
(unit? schema.
unit=62&lesson=66)
The values of the X component of a tuple uniquely determine the values of the Y
Practice: Week component.
7: Assignment
7 (Non
The values of the X component of a tuple functionally determine the values of the Y
Graded)
component.
(assessment?
name=119)
Whenever X → Y holds on a relation R, Y → X also holds on R.
Quiz: Week 7:
Yes, the answer is correct.
Assignment 7 Score: 2
(assessment?
Accepted Answers:
name=136)
Whenever X → Y holds on a relation R, Y → X also holds on R.
Week 7
Feedback form 4) Any given relation in a relational DB is always in: 2 points
: Introduction
to Database 1NF
Systems (unit?
2NF
unit=62&lesson=68)
3NF
Week 8 () BCNF

Yes, the answer is correct.

Week 9 () Score: 2
Accepted Answers:
Week 10 () 1NF

Week 11 () 5) Complete the following statement by picking up the appropriate expressions for 2 points
EXP1 and EXP2:
Week 12 ()
An FD X → Y where ..EXP1.. is called a trivial FD whereas an FD X → Y where ..EXP2.. is called
Download a non-trivial FD.
Videos ()

EXP 1 : Y = X, EXP 2 : Y ⊆ X
Lecture
Notes () EXP 1 : Y ⊆ X, EXP 2 : Y = X

Live EXP 1 : Y ⊆ X, EXP 2 : Y ⊈ X

Sessions ()
EXP 1 : Y ⊈ X, EXP 2 : Y ⊆ X

Problem Yes, the answer is correct.

Solving Score: 2
Session () Accepted Answers:
EXP 1 : Y ⊆ X, EXP 2 : Y ⊈ X
 
 6) Consider a relation R(A, B, C , D, E, F , G) and an F D set F of R 2 points
{F = A → B, BD → EF , AC → D, B → G, AG → C }
Find the attribute closure A+

{A, B, G}

{A, B, C , G}

{A, B, C , D, G}

{A, B, C , D, E, F , G }

Yes, the answer is correct.

Score: 2
Accepted Answers:
{A, B, C , D, E, F , G }

7) Consider a relation R(P , Q, R, S, T , U ) and the following F D set F of R 2 points

{F = P → Q, P → R, RS → T , RS → U , Q → T }
and the statements given below:
S1: P S → TU can be derived from F
S2: QR → U can be derived from F
Choose the correct option:

S1: TRUE, S2: TRUE

S1: TRUE, S2: FALSE
S1: FALSE, S2: TRUE
S1: FALSE, S2: FALSE

Yes, the answer is correct.

Score: 2
Accepted Answers:
S1: TRUE, S2: FALSE

8) Consider the following FD set on a relation R(A, B, C , D, E) . 2 points

{AB → C , BC → D, AB → D, D → E, BC → E }
Choose the correct option:

Only AB → D is redundant
Only BC → E is redundant
D → E is redundant
Both AB → D and BC → E are redundant

Yes, the answer is correct.

Score: 2
Accepted Answers:
Both AB → D and BC → E are redundant

9) Consider the following sets: 2 points

S1: { p: union rule; q: pseudo transitive rule; r: decomposition rule }
S2: { w: if A → B holds and C ⊆ B, then A → C holds;
x: {A → B, CB → D} ⊨ CA → D;
 y: {A → B, A → C} ⊨ A → BC }
Choose the correct matching between S1 and S2:

p: w; q: x; r: y
p: w; q: y; r: x
p: y; q: x; r: w
p: x; q: y; r: w

No, the answer is incorrect.

Score: 0
Accepted Answers:
p: y; q: x; r: w

10) Choose which of the following statements are TRUE: 2 points

S1: Armstrong's axioms are sound. That is, any FD X → Y which is logically implied by F, can be
derived from F using Armstrong's axioms.
S2: Armstrong’s axioms are sound. That is, if X → Y is deducted from F using axioms, then X →
Y is true in any relation in which the FDs of F are true.
S3: Armstrong's axioms are complete. That is, any FD X → Y which is logically implied by F can
be derived from F using Armstrong's axioms.
S4: Armstrong’s axioms are complete. That is, if X → Y is deducted from F using axioms, then X
→ Y is true in any relation in which the FDs of F are true.

S1, S3
S1, S4
S2, S3
S2, S4

No, the answer is incorrect.

Score: 0
Accepted Answers:
S2, S3