Quiz 8
Due Oct 24 at 10am
Points 25
Questions 25
Available Oct 24 at 9:35am - Oct 24 at 10am 25 minutes
Time Limit 20 Minutes
Attempt History
Attempt Time Score
LATEST Attempt 1 18 minutes 25 out of 25
Correct answers are hidden.
Score for this quiz: 25 out of 25
Submitted Oct 24 at 9:53am
This attempt took 18 minutes.
Question 1
1 / 1 pts
Which of the following is TRUE?
Every relation in BCNF is also in 3NF
Every relation in 3NF is also in BCNF
A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
No relation can be in both BCNF and 3NF
Question 2
1 / 1 pts
Consider the following relational schema:
Suppliers(sid:integer, sname:string, city:string, street:string)
Parts(pid:integer, pname:string, color:string)
Catalog(sid:integer, pid:integer, cost:real)
Assume that, in the suppliers relation above, each supplier and each street within a city has a unique
name, and (sname, city) forms a candidate key. No other functional dependencies are implied other
than those implied by primary and candidate keys. Which one of the following is TRUE about the
above schema?
The schema is in BCNF
The schema is in 3NF but not in BCNF
The schema is in 2NF but not in 3NF
The schema is not in 2NF
Question 3
1 / 1 pts
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no,
Publisher, Year, Price) Collection (Title, Author, Catalog_no) with in the following functional
dependencies:
I. Title Author --> Catalog_no
II. Catalog_no --> Title, Author, Publisher, Year
III. Publisher Title Year --> Price
Assume {Author, Title} is the key for both schemes. Which of the following statements is true?
Book is in 2NF and Collection is in 3NF
Both Book and Collection are in 2NF only
Both Book and Collection are in BCNF
Both Book and Collection are in 3NF only
Question 4
1 / 1 pts
Select the 'False' statement from the following statements about Normal Forms:
Lossless preserving decomposition into BCNF is always possible
Lossless preserving decomposition into 3NF is always possible
Any Relation with two attributes is in BCNF
BCNF is stronger than 3NF
Question 5
1 / 1 pts
The best normal form of relation scheme R(A, B, C, D) along with the set of functional dependencies
F = {AB → C, AB → D, C → A, D → B} is
Third Normal form
Boyce-Codd Normal form
Second Normal form
First Normal form
Question 6
1 / 1 pts
Which of the following is false?
Every binary relation is never be in BCNF.
Every BCNF relation is in 3NF.
1 NF, 2 NF, 3 NF and BCNF are based on functional dependencies.
Multivalued Dependency (MVD) is a special case of Join Dependency (JD).
Question 7
1 / 1 pts
For a database relation R(a,b,c,d) where the domains of a, b, c and d include only atomic values, only
the following functional dependencies and those that can be inferred from them hold
a -> c
b -> d
The relation is in
First normal form but not in second normal form
Second normal form but not in third normal form
Third normal form
None of the above
Question 8
1 / 1 pts
For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic values,
and only the following functional dependencies and those that can be inferred from them hold : a → c
b → d The relation is in _________.
First normal form but not in second normal form
Second normal form but not in third normal form
Third normal form
BCNF
Question 9
1 / 1 pts
Consider a relational table R that is in 3NF, but not in BCNF. Which one of the following statements is
TRUE ?
R has a nontrivial functional dependency X→A, where X is not a superkey and A is a prime attribute
R has a nontrivial functional dependency X→A, where X is not a superkey and A is a non-prime attribute and X is
not a proper subset of any key
R has a nontrivial functional dependency X→A, where X is not a superkey and A is a non-prime attribute and X is a
proper subset of some key
A cell in R holds a set instead of an atomic value
Question 10
1 / 1 pts
For a database relation R(A, B, C, D) where the domains of A, B, C and D include only atomic values,
only the following functional dependencies and those that can be inferred from them are : A → C B →
D The relation R is in _______.
First normal form but not in second normal form.
Both in first normal form as well as in second normal form.
Second normal form but not in third normal form.
Both in second normal form as well as in third normal form.
Question 11
1 / 1 pts
Consider a database table R with attributes A and B. Which of the following SQL queries is illegal ?
SELECT A, COUNT(*) FROM R;
SELECT A FROM R;
SELECT A, COUNT(*) FROM R GROUP BY A;
SELECT A, B, COUNT(*) FROM R GROUP BY A, B;
Question 12
1 / 1 pts
Which one of the following pairs is correctly matched in the context of database design?
(4)
(2)
(1)
(3)
Question 13
1 / 1 pts
Consider a schema R(MNPQ) and functional dependencies M → N, P → Q. Then the decomposition
of R into R1 (MN) and R2(PQ) is________.
Dependency preserving but not lossless join
Dependency preserving and lossless join
Lossless join but not dependency preserving
Neither dependency preserving nor lossless join.
Question 14
1 / 1 pts
Which normal form is considered adequate for normal relational database design?
3NF
2NF
4NF
5NF
Question 15
1 / 1 pts
Which of the following FD can’t be implied from FD set: {A->B, A->BC, C->D} ?
B->D
A->C
BC->D
All of the above
Question 16
1 / 1 pts
How many minimum relation tables are required which satisfy 1NF?
2, 2, and 1 respectively
2, 2, and 2 respectively
1, 2, and 1 respectively
1, 1, and 1 respectively
Question 17
1 / 1 pts
Consider the following table : Faculty (facName, dept, office, rank, dateHired)
facName dept office rank dateHired
Ravi Art A101 Professor 1975
Murali Math M201 Assistant 2000
Narayanan Art A101 Associate 1992
Lakshmi Math M201 Professor 1982
Mohan CSC C101 Professor 1980
Lakshmi Math M201 Professor 1982
Sreeni Math M203 Associate 1990
Tanuja CSC C101 Instructor 2001
Ganesh CSC C105 Associate 1995
(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 BCNF refers to Boyee-
Codd Normal Form Then Faculty is
In 3NF, not in BCNF
Not in 3NF, in BCNF
In 3NF, in BCNF
Not in 3NF, not in BCNF
Question 18
1 / 1 pts
Consider a schema R(A, B, C, D) and following functional dependencies.
A → B
B → C
C → D
D → B
Then decomposition of R into R1 (A, B), R2(B, C) and R3(B, D) is __________ .
Dependency preserving and lossless join.
Lossless join but not dependency preserving.
Dependency preserving but not lossless join.
Not dependency preserving and not lossless join.
Question 19
1 / 1 pts
Consider the following four relational schemas. For each schema, all non-trivial functional
dependencies are listed, The underlined attributes are the respective primary keys.
Schema I: Registration(rollno, courses) Field ‘courses’ is a set-valued attribute containing the set
of courses a student has registered for. Non-trivial functional dependency rollno → courses
Schema II: Registration (rollno, coursid, email) Non-trivial functional dependencies: rollno,
courseid → email email → rollno
Schema III: Registration (rollno, courseid, marks, grade) Non-trivial functional
dependencies: rollno, courseid, → marks, grade marks → grade
Schema IV: Registration (rollno, courseid, credit) Non-trivial functional dependencies: rollno,
courseid → credit courseid → credit
Which one of the relational schemas above is in 3NF but not in BCNF?
Schema II
Schema I
Schema III
Schema IV
Question 20
1 / 1 pts
A relational database contains two tables student and department in which student table has columns
roll_no, name and dept_id and department table has columns dept_id and dept_name. The following
insert statements were executed successfully to populate the empty tables:
Insert into department values (1, 'Mathematics')
Insert into department values (2, 'Physics')
Insert into student values (l, 'Navin', 1)
Insert into student values (2, 'Mukesh', 2)
Insert into student values (3, 'Gita', 1)
How many rows and columns will be retrieved by the following SQL statement?
Select * from student, department
6 rows and 5 columns
3 rows and 5 columns
3 rows and 4 columns
0 row and 4 columns
Question 21
1 / 1 pts
A table has fields Fl, F2, F3, F4, F5 with the following functional dependencies F1 → F3 F2→ F4
(F1 . F2) → F5 In terms of Normalization, this table is in
1 NF
2NF
3NF
None
Question 22
1 / 1 pts
Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional dependencies are
known to hold: AB → CD, DE → P, C → E, P → C and B → G. The relational schema R is
not in 2NF
in BCNF
in 3NF, but not in BCNF
in 2NF, but not in 3NF
Question 23
1 / 1 pts
Which option is true about the SQL query given below?
SELECT firstName, lastName
FROM Employee
WHERE lastName BETWEEN 'A%' AND 'D%';
It will display all the employees having last names starting with the alphabets 'A' till 'D' inclusive of A and exclusive of
D.
It will throw an error as BETWEEN can only be used for Numbers and not strings.
It will display all the employees having last names starting from 'A' and ending with 'D'.
It will display all the employees having last names in the range of starting alphabets as \'A\' and \'D\' excluding the
names starting with 'A' and 'D'.
Question 24
1 / 1 pts
Let R = ( A, B, C, D, E, F ) be a relation scheme with the following dependencies: C→F, E→A,
EC→D, A→B. Which of the following is a key of R?
EC
CD
AE
AC
Question 25
1 / 1 pts
Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1
and R2) be a decomposition such that R1∩R2 ≠ Ø. The decomposition is:
In both 2NF and 3NF
Not in 2NF
In 2NF but not in 3NF
In 3NF but not in 2NF
Quiz Score: 25 out of 25
