Reference no: EM132431007
Problem: Suppose we have a relational database schema R for students, consisting of the following attributes: I (student ID), C(cohort), D (department), N (credits needed), O (course) and G (grade) with the following functional dependencies: I →C, I→D, CD→N, IO→G.
Required:
Question 1: Find all the candidate keys for the relation schema R.
Question 2: Determine the highest normal form (ie., no more than BCNF) the following decomposition is in. Justify your answer with a brief explanation.
R1(I, C, D, N) R2(I, O, G)
Question 3: Come up with a decomposition scheme for R so that the tables are in Boyce-Codd normal form (BCNF) and prove it.