GateQA is a free GATE CS preparation platform featuring 3,500+ previous-year questions (1987–2026),
36,000+ aptitude questions, subject-wise and year-wise mock tests, performance analytics,
and full offline support. Practice Operating Systems, Algorithms, DBMS, Computer Networks,
Theory of Computation, Discrete Mathematics, Compiler Design, Digital Logic, and more.
Let $R (A, B, C, D, E, P, G)$ be a relational schema in which the following functional dependencies are known to hold: $AB \to CD, DE \to P, C \to E, P \to C$ and $B \to G.$ The…
Answer: D
This static SEO snapshot loads the full interactive GateQA app when JavaScript is available.