Let the set of functional dependencies F = {QR → S, R → P, S → Q} hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y = (PR) and Z = (QRS).Consider the two statements given below.I. Both Y and Z are in BCNFII. Decomposition of X into Y and Z is dependency preserving and losslessWhich of the above statements is/are correct?

Let the set of functional dependencies F = {QR → S, R → P, S → Q

1.	Let the set of functional dependencies F = {QR → S, R → P, S → Q} hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y = (PR) and Z = (QRS).Consider the two statements given below.I. Both Y and Z are in BCNFII. Decomposition of X into Y and Z is dependency preserving and losslessWhich of the above statements is/are correct?
A.	Both I and II
B.	I only
C.	II only
D.	Neither I nor II
Answer» D. Neither I nor II

Discussion

No Comment Found

Related MCQs

______ normal form is based on the concept of transitive dependancy.
Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and following functional dependencies exist.CH → GA → BCB → CFHE → AF → EGThe relation R is ______.
A database of research articles in a journal uses the following schema.(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema.(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → TITLE(VOLUME, NUMBER) → YEAR(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → PRICEThe database is redesigned to use the following schemas.(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)(VOLUME, NUMBER, YEAR)Which is the weakest normal form that the new database satisfies, but the old one does not?
Every time the attribute A appears, it is matched with the same value of attribute B but not the same value of attribute C. Which of the following is true ?
Consider the following table: Faculty (facName, dept, office, rank, dateHired)facNameDeptOfficeRankdateHiredRaviArtA101Professor1975MuraliMathM201Assistant2000NarayananArtA101Associate1992LakshmiMathM201Professor1982MohanCSCC101Professor1980SreeniMathM203Associate1990TanujaCSCC101Instructor2001GaneshCSCC105Associate1995(Assume that no faculty member within a single department has same name. Each faculty member has only one office identified in office). 3NF refers to third normal form and BNCF refers to Boyce Codd normal form.Then Faculty is
A relation Empdtl is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms, Empdtl is a relation in:
Consider the schema R (A, B, C, D) and the functional dependencies A → B and C → D. If the decomposition is made as R1 (A, B) and R2 (C, D), then which of the following is TRUE ?
Consider a schema R(A, B, C, D) and following functional dependencies.A → BB → CC → DD → BThen decomposition of R into R1(A, B), R2(B, C) and R3(B, D) is _______
A relation in which every non-key attribute is fully functionally dependent on the primary key and which has no transitive dependencies is said to be in:
If every non-key attribute functionally dependant on the primary key, then the relation will be in

Discussion

No Comment Found

Related MCQs

Reply to Comment