Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
947 views
in Programming by (115k points)
closed by

Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies

                F = {

                                {P, R} → {S, T},

                                {P, S, U} → {Q, R}

                         }

Which of the following is the trivial functional dependency in F+, where F+ is closure of F?


1. {P, R} → {S, T}
2. {P, R} → {R, T}
3. {P, S} → {S}
4. {P, S, U} → {Q}

1 Answer

0 votes
by (152k points)
selected by
 
Best answer
Correct Answer - Option 3 : {P, S} → {S}

Concept:

The closure of F, denoted as F+, is the set of all regular FD, that can be derived from.

For trivial functional dependency,

Let A and be two sets consists of attributes of a relation

A → B

\(\supseteq\) B 

Explanation:

Option 1

{P, R} → {S, T}

{P, R} \(\nsupseteq\) {S, T}

Not a trivial functional dependency

Option 2

{P, R} → {R, T}

{P, R} \(\nsupseteq\) {R, T}

Not a trivial functional dependency

Option 3: 

{P, S} → {S}

{P, S} \(\supseteq\) {S}

It is a trivial functional dependency

Option 4

{P, S, U} → {Q}

{P, S, U} \(\nsupseteq\) {Q}

Not a trivial functional dependency

NOTE:

\(\supseteq\) → superset

\(\nsupseteq\) → not superset

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...