Consider the relation given below and ind the maximum normal form applicable to them <br /> 1. R(A, B) with productions { A --> B } <br /> 2. R(A, B) with productions { B --> A } <br /> 3 R(A, B) with productions {A —> B, B --> A } <br /> 4 R(A, B, C) with productions {A -->B, B --> A, AB --> C }

www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Databases
13

Databases MCQ with Answers

13) Consider the relation given below and ind the maximum normal form applicable to them
1. R(A, B) with productions { A --> B }
2. R(A, B) with productions { B --> A }
3 R(A, B) with productions {A —> B, B --> A }
4 R(A, B, C) with productions {A -->B, B --> A, AB --> C }

1, 2 and 3 are in 3NF and 4 is in BCNF

1 and 2 are in BCNF and 3 and 4 are in 3NF

All are in 3NF

All are in BCNF

Answer is:

All are in BCNF

Databases MCQ with Answers

For more MCQ's Click Here

15) Consider the following functional dependencies in a database:
Date_of_Birth —> Age
Age —> Eligibility
Name —> Roll_number
Roll_number -> Name
Course_number ---> Course—> name
Course_number —> Instructor
(Roll number; Course_number) —> Grade
The relation (Roll_number; Name; Date_of birth, Age) is

in second normal form but not in third normal form

in third normal form but not in BCNF

in BCNF

in none of the above

Answer is:

in none of the above

16) The relation scheme student performance (name, courseNo, rollNo, grade) has the following functional dependencies:
name, curseNo --> grade
RolINo, courseNo —> grade
name —> rollNo
rollNo —> name
The highest normal form ofthis relation scheme is:

2 NF

3 NF

BCNF

4 NF

Answer is:

3 NF

17) Which-one of the following statements about normal forms is FALSE

BCNF is stricter than 3 NF

Lossless, dependency -preserving decomposition into 3 NF is always possible

Loss less, dependency - preserving decomposition into BCNF is always possible

Any relation with two attributes is BCNF

Answer is:

Loss less, dependency - preserving decomposition into BCNF is always possible

18) Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold: {A —> B, BC ---> D, E, —> C, D —> Al . What are the candidate keys of R?

AE, BE

AE, BE, DE

AEH, BEH, BCH

AEH, BEH, DEH

Answer is:

AEH, BEH, DEH

Databases MCQ with Answers

For more MCQ's Click Here

13) Consider the relation given below and ind the maximum normal form applicable to them 1. R(A, B) with productions { A --> B } 2. R(A, B) with productions { B --> A } 3 R(A, B) with productions {A —> B, B --> A } 4 R(A, B, C) with productions {A -->B, B --> A, AB --> C }

All are in BCNF

Databases MCQ with Answers

Related Databases MCQ with Answers

in none of the above

16) The relation scheme student performance (name, courseNo, rollNo, grade) has the following functional dependencies: name, curseNo --> grade RolINo, courseNo —> grade name —> rollNo rollNo —> name The highest normal form ofthis relation scheme is:

3 NF

17) Which-one of the following statements about normal forms is FALSE

Loss less, dependency - preserving decomposition into BCNF is always possible

18) Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold: {A —> B, BC ---> D, E, —> C, D —> Al . What are the candidate keys of R?

AEH, BEH, DEH

Databases MCQ with Answers

13) Consider the relation given below and ind the maximum normal form applicable to them
1. R(A, B) with productions { A --> B }
2. R(A, B) with productions { B --> A }
3 R(A, B) with productions {A —> B, B --> A }
4 R(A, B, C) with productions {A -->B, B --> A, AB --> C }

16) The relation scheme student performance (name, courseNo, rollNo, grade) has the following functional dependencies:
name, curseNo --> grade
RolINo, courseNo —> grade
name —> rollNo
rollNo —> name
The highest normal form ofthis relation scheme is: