Database Normalization Quiz Part2

Database Normalization Quiz Part2

University

20 Qs

quiz-placeholder

Similar activities

ORACLE_JR_SERIES_1

ORACLE_JR_SERIES_1

University

25 Qs

Kunci kekalahan

Kunci kekalahan

University

20 Qs

Functional Dependency and Normalization

Functional Dependency and Normalization

University

20 Qs

AI&DS

AI&DS

University

17 Qs

Mastering RDBMS Concepts

Mastering RDBMS Concepts

University

20 Qs

Database-Normalisation

Database-Normalisation

9th Grade - University

20 Qs

DBTHON-23 Round-1

DBTHON-23 Round-1

University

20 Qs

UAS MANAGEMEN BASIS DATA (PG)_old

UAS MANAGEMEN BASIS DATA (PG)_old

University

22 Qs

Database Normalization Quiz Part2

Database Normalization Quiz Part2

Assessment

Quiz

Computers

University

Hard

Created by

Comprehensive Viva

Used 2+ times

FREE Resource

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Consider the relation R(A, B, C, D, E) and the functional dependency set F={AB→C, B→D, C→E }. What is the highest normal form of the relation R ?

1NF

2NF

3NF

BCNF

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Consider the relation R (A, B, C, D, E) and the functional dependency set F = {AB→CD, ABC→E, C→A}. How many candidate keys are possible for the relation R ?

1

2

3

4

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Consider a relation R(A, B, C, D, E) and a set of all FDs that hold on R as given below: {A → BC, CD → E, B → D, E → A} Choose the correct option:

R is in 1NF, not in 2NF

R is in 2NF, not in 3NF

R is in 3NF, not in BCNF

R is in BCNF

4.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Consider the following two sets of functional dependencies: F = {A → C, AC → D, E → AD, E → H} G = {A → CD, E → AH} Choose the correct option:

only F covers G

only G covers F

F and G are equivalent

None of the above

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Consider the following schedule S.

S: R1(X); W1(X); R2(X); W2(X); R1(Y); R2(Y);

Which of the following is a non-conflicting pair of operations in the schedule S?

R1(X); W1(X);

W1(X); R2(X);

W1(X); W2(X);

R1(X); W2(X);

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

To be conflict serializable, all transactions should follow _______

Binary locking

Two phase locking

Binary Locking with wait-for graph

None of these

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is NOT a type of database model?

Relational model

Network model

Hierarchical model

Object-oriented model

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?