NPTEL Introduction to Database Systems Assignment 7 Answers 2023

Hello Learners, In this Post, you will find NPTEL Introduction to Database Systems Assignment 7 Week 7 Answers 2023. All the Answers are provided below to help the students as a reference don’t straight away look for the solutions.

NPTEL Introduction to Database Systems Assignment 8 Answers Join Group👇

CLICK HERE

Note: First try to solve the questions by yourself. If you find any difficulty, then look for the solutions.

NPTEL Introduction to Database Systems Assignment 7 Answers 2023:

We are updating answers soon Join Group for update: CLICK HERE

Q.1. A functional dependency X→Y→holds on schema R if, in – – – – legal instance of r(R) it satisfies the functional dependency.
Choose the most appropriate word that can be filled in the blank:

• At Least one
• Some
• Every
• None of these

Q.2. One or more of the following phrases can be used to correctly complete the sentence:
A functional dependency is a – – – – – – of a relation.
{  P1: Property of a specific attribute  P2: Constraint on the data
P3: Property of the schema  P4: Property of a specific row     }
Choose the option that gives all the correct ways of filling the blank:

• Only P1 and P3
• Only P2 and P3
• Only P2 and P4
• Only P1, P3, and P4

Q.3. Recall the definition of functional dependency X→Y and identify the FALSE statement:

• A functional dependency is a constraint on the values of two sets of attributes of a relation schema.
• The values of the X component of a tuple uniquely determine the values of the Y component.
• The values of the X component of a tuple functionally determine the values of the Y component.
• Whenever X→Y holds on a relation R,Y→X also holds on R .

NPTEL Introduction to Database Systems Assignment 7 Answers Join Group👇

Q.4. Any given relation in a relational DB is always in:

• 1NF
• 2NF
• 3NF
• BCNF

Q.5. Complete the following statement by picking up the appropriate expressions for EXP1 and EXP2:

An FD X → Y where ..EXP1.. is called a trivial FD whereas an FD X → Y where ..EXP2.. is called a non-trivial FD.

• EXP1:Y=X,EXP2:Y⊆X
• EXP1:Y⊆X,EXP2:Y=X
• EXP1:Y⊆X,EXP2:Y⊈X
• EXP1:Y⊈X,EXP2:Y⊆X

Q.6. Consider a relation R(A,B,C,D,E,F,G) and an FD set F of R {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}

Q.7. Consider a relation R(P,Q,R,S,T,U) and the following FD set F of R {F=P→Q,P→R,RS→T,RS→U,Q→T }

and the statements given below:
S1: PS→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

NPTEL Introduction to Database Systems Week 7 Answers Join Group👇

CLICK HERE

Q.8. Consider the following FD set on a relation R(A,B,C,D,E) . {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

Q.9. Consider the following sets:

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

Q.10. Choose which of the following statements are TRUE:

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

NPTEL Introduction to Database Systems Assignment 7 Answers Join Group👇

Disclaimer: This answer is provided by us only for discussion purpose if any answer will be getting wrong don’t blame us. If any doubt or suggestions regarding any question kindly comment. The solution is provided by Brokenprogrammers. This tutorial is only for Discussion and Learning purpose.

About NPTEL Introduction to Database Systems Course:

Databases are the backbone of almost all the digital services and e-governance solutions. Modern businesses and financial systems heavily depend on databases systems and transaction processing for their successful operation. This course introduces the students to the various theoretical and practical principles involved in the design and use of databases systems with the help of database management systems (DBMS) and the SQL Standard

Course Layout:

• Week 1   : Introduction and part of E/R Model Module
• Week 2   : ER Model Module
• Week 3   : Relational Model Module
• Week 4   : Relational Model Module
• Week 5   : TRC Module and part of SQL Module
• Week 6   : SQL Module
• Week 7   : Indexes Module
• Week 8   : Indexes Module + Query Processing Module
• Week 9   : Normal Forms Module
• Week 10 : Normal Forms Module
• Week 11 : Transaction Processing Module
• Week 12 : Transaction Processing Module

CRITERIA TO GET A CERTIFICATE:

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

If you have not registered for exam kindly register Through https://examform.nptel.ac.in/