GATE CS 2015 Set 3 — Question 13

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+1 / -0.33EasyFunctional DependenciesNormalizationDatabases

Databases → Normalization → Functional Dependencies

Last updated

Question

Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies
F = {{P,R}{S,T}\{P,R\} \to \{S,T\},{P,S,U}{Q,R}\{P,S,U\} \to \{ Q,R\}}
Which of the following is the trivial functional dependency in F+F^+, where F+F^+ is closure of FF ?
Your answer

Choose one option, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Normalization