Database Normalization Quiz Part2

Database Normalization Quiz Part2

University

20 Qs

quiz-placeholder

Similar activities

DBMS - Fundamentals

DBMS - Fundamentals

University

19 Qs

Sử dụng bảng tính Excel (21-40)

Sử dụng bảng tính Excel (21-40)

University

20 Qs

8051-MCQ

8051-MCQ

University

15 Qs

1 Introduccion al IoT

1 Introduccion al IoT

University

15 Qs

Introducción a CNC

Introducción a CNC

University

15 Qs

Com100: Module 5-Amparo

Com100: Module 5-Amparo

University

15 Qs

Business for Video Games

Business for Video Games

5th Grade - University

19 Qs

Think it through

Think it through

University - Professional Development

16 Qs

Database Normalization Quiz Part2

Database Normalization Quiz Part2

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

Comprehensive Viva

Used 2+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

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

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for Computers