Figuer: Name is the unique candidate key in the table STUDENTC. Each row in the table describes a different student. A student may only have one major and one minor. To each major corresponds a unique minor. STUDENTC \[\begin{array} { | l | l | l | l | } \hline \text { NAME } & \text { AGE } & \text { MAJOR } & \text { MINOR } \\ \hline \text { GREEN } & 26 & \text { MATH } & \text { INFO } \\ \hline \text { HONEY } & 18 & \text { INFO } & \text { MATH } \\ \hline \text { LAMPOC } & 33 & \text { MKTG } & \text { MGT } \\ \hline \text { TAKKER } & 45 & \text { MKTG } & \text { MGT } \\ \hline \text { YONAR } & 28 & \text { INFO } & \text { MATH } \\ \hline \end{array}\] -The following is a functional dependency in the table STUDENTC:

A) Name -> Minor B) Name -> Major C) Major -> Minor D) All of the above A) Name -> Minor B) Name -> Major C) Major -> Minor D) All of the above D

Figuer: Name is the unique candidate key in the table STUDENT. Each row in the table describes a different student. A student may only have one major and one minor. The choice of a major is independent of the choice of a minor STUDENT \[\begin{array} { | l | l | l | l | } \hline \text { NAME } & \text { AGE } & \text { MAJOR } & \text { MINOR } \\ \hline \text { GREEN } & 26 & \text { MATH } & \text { INFO } \\ \hline \text { HONEY } & 18 & \text { INFO } & \text { MATH } \\ \hline \text { LAMPOC } & 33 & \text { MKTG } & \text { MGT } \\ \hline \text { TAKKER } & 45 & \text { MKTG } & \text { MGT } \\ \hline \text { TRAN } & 45 & \text { MATH } & \text { INFF } \\ \hline \text { YONAR } & 28 & \text { INFO } & \text { MATH } \\ \hline \end{array}\] -The following is a functional dependency in the table STUDENT:

A) Major -> Minor B) Minor -> Major C) Major -> Age D) Name -> Minor A) Major -> Minor B) Minor -> Major C) Major -> Age D) Name -> Minor

Figuer: The table STUDENTB has the following meaning. A student may have one major only and several minors; the choice of the major and of minors is independent of each other. Each student has a unique name. The table has only one candidate key. STUDENTB \[\begin{array} { | l | l | l | } \hline \text { NAME } & \text { MAJOR } & \text { MINOR } \\ \hline \text { GREEN } & \text { MATH } & \text { INFO } \\ \hline \text { GREEN } & \text { MATH } & \text { MKTG } \\ \hline \text { HONEY } & \text { INFO } & \text { MATH } \\ \hline \text { HONEY } & \text { INFO } & \text { MGT } \\ \hline \text { LAMPOC } & \text { MKTG } & \text { MGT } \\ \hline \text { TAKKER } & \text { MKTG } & \text { MGT } \\ \hline \text { YONA } & \text { INFO } & \text { MATH } \\ \hline \end{array}\] -The table STUDENTB satisfies the following normal form (choose the highest NF):

A) 1NF B) 2NF C) 3NF D) 4NF A) 1NF B) 2NF C) 3NF D) 4NF

Figuer: Name is the unique candidate key in the table STUDENT. Each row in the table describes a different student. A student may only have one major and one minor. The choice of a major is independent of the choice of a minor STUDENT \[\begin{array} { | l | l | l | l | } \hline \text { NAME } & \text { AGE } & \text { MAJOR } & \text { MINOR } \\ \hline \text { GREEN } & 26 & \text { MATH } & \text { INFO } \\ \hline \text { HONEY } & 18 & \text { INFO } & \text { MATH } \\ \hline \text { LAMPOC } & 33 & \text { MKTG } & \text { MGT } \\ \hline \text { TAKKER } & 45 & \text { MKTG } & \text { MGT } \\ \hline \text { TRAN } & 45 & \text { MATH } & \text { INFF } \\ \hline \text { YONAR } & 28 & \text { INFO } & \text { MATH } \\ \hline \end{array}\] -The following anomaly exists in the table STUDENT:

A) update anomaly B) insertion anomaly C) deletion anomaly D) none of the above A) update anomaly B) insertion anomaly C) deletion anomaly D) none of the above

Figuer: The table STUDENTB has the following meaning. A student may have one major only and several minors; the choice of the major and of minors is independent of each other. Each student has a unique name. The table has only one candidate key. STUDENTB \[\begin{array} { | l | l | l | } \hline \text { NAME } & \text { MAJOR } & \text { MINOR } \\ \hline \text { GREEN } & \text { MATH } & \text { INFO } \\ \hline \text { GREEN } & \text { MATH } & \text { MKTG } \\ \hline \text { HONEY } & \text { INFO } & \text { MATH } \\ \hline \text { HONEY } & \text { INFO } & \text { MGT } \\ \hline \text { LAMPOC } & \text { MKTG } & \text { MGT } \\ \hline \text { TAKKER } & \text { MKTG } & \text { MGT } \\ \hline \text { YONA } & \text { INFO } & \text { MATH } \\ \hline \end{array}\] -The following is a multivalued dependency in the table STUDENTB:

A) Name -> ->Major | Minor B) Name -> Major C) Name -> Minor D) None of the above A) Name -> ->Major | Minor B) Name -> Major C) Name -> Minor D) None of the above

Exam 7: Normalization of Relational Tables

When you transform the ERD into tables and then use normalization techniques to analyze each table,this is known as the __________________ approach in database development.

Free

(Short Answer)

4.8/5

(32)

Question 1

Correct Answer:

Verified

refinement

Figuer: Name is the unique candidate key in the table STUDENTC. Each row in the table describes a different student. A student may only have one major and one minor. To each major corresponds a unique minor. STUDENTC NAME AGE MAJOR MINOR GREEN 26 MATH INFO HONEY 18 INFO MATH LAMPOC 33 MKTG MGT TAKKER 45 MKTG MGT YONAR 28 INFO MATH -The following is a functional dependency in the table STUDENTC:

Free

(Multiple Choice)

4.9/5

(29)

Question 2

Correct Answer:

Verified

D

In the MVD expressed as $A \rightarrow \rightarrow B \mid C$ ,a given A value is associated with one or more B and C values.

Free

(True/False)

4.8/5

(26)

Question 3

Correct Answer:

Verified

True

Figuer: Name is the unique candidate key in the table STUDENT. Each row in the table describes a different student. A student may only have one major and one minor. The choice of a major is independent of the choice of a minor STUDENT NAME AGE MAJOR MINOR GREEN 26 MATH INFO HONEY 18 INFO MATH LAMPOC 33 MKTG MGT TAKKER 45 MKTG MGT TRAN 45 MATH INFF YONAR 28 INFO MATH -The following is a functional dependency in the table STUDENT:

(Multiple Choice)

4.9/5

(42)

Question 4

Figuer: The table STUDENTB has the following meaning. A student may have one major only and several minors; the choice of the major and of minors is independent of each other. Each student has a unique name. The table has only one candidate key. STUDENTB NAME MAJOR MINOR GREEN MATH INFO GREEN MATH MKTG HONEY INFO MATH HONEY INFO MGT LAMPOC MKTG MGT TAKKER MKTG MGT YONA INFO MATH -The table STUDENTB satisfies the following normal form (choose the highest NF):

(Multiple Choice)

4.7/5

(36)

Question 5

To achieve 4NF,it is possible that there may be M-way relationships that should be split into two or more binary relationships to avoid redundancy.

(True/False)

4.9/5

(35)

Question 6

There is no known general algorithm to convert tables to DKNF.

(True/False)

4.8/5

(33)

Question 7

_________________ is the process of combing tables to make them easier to query.

(Short Answer)

4.8/5

(30)

Question 8

Although rare,a table in DKNF can still have some modification anomalies.

(True/False)

4.8/5

(39)

Question 9

Figuer: Name is the unique candidate key in the table STUDENT. Each row in the table describes a different student. A student may only have one major and one minor. The choice of a major is independent of the choice of a minor STUDENT NAME AGE MAJOR MINOR GREEN 26 MATH INFO HONEY 18 INFO MATH LAMPOC 33 MKTG MGT TAKKER 45 MKTG MGT TRAN 45 MATH INFF YONAR 28 INFO MATH -The following anomaly exists in the table STUDENT:

(Multiple Choice)

4.8/5

(31)

Question 10

The goal of 2NF and 3NF is to produce tables in which every key determines the other columns.

(True/False)

4.8/5

(38)

Question 11

Primary key and foreign key constraints are both important kinds of value-based constraints.

(True/False)

4.8/5

(37)

Question 12

The following functional dependencies demonstrate an example of a: A $\rightarrow$ B B $\rightarrow$ C Then A $\rightarrow$ C

(Multiple Choice)

4.8/5

(42)

Question 13

The column which appears on the left-hand side (LHS)of a functional dependency is the __________________.

(Short Answer)

4.9/5

(32)

Question 14

In the MVD expressed as A $\rightarrow \rightarrow$ B | C,where A,B,and C are columns,the three columns comprise a(n)____________________ of an associative table.

(Short Answer)

4.7/5

(27)

Question 15

Figuer: The table STUDENTB has the following meaning. A student may have one major only and several minors; the choice of the major and of minors is independent of each other. Each student has a unique name. The table has only one candidate key. STUDENTB NAME MAJOR MINOR GREEN MATH INFO GREEN MATH MKTG HONEY INFO MATH HONEY INFO MGT LAMPOC MKTG MGT TAKKER MKTG MGT YONA INFO MATH -The following is a multivalued dependency in the table STUDENTB:

(Multiple Choice)

4.8/5

(39)

Question 16

When part of a key determines a non-key,this is a violation of BCNF.

(True/False)

4.7/5

(36)

Question 17

Examining sample data in a table can be used to prove that a functional dependency exists,but it is of no use in proving that a functional dependency does not exist.

(True/False)

4.8/5

(42)

Question 18

When you can conclude that object A is related to object C because A is related to object B and B is related to C,this is an example of a(n)____________________.

(Short Answer)

4.9/5

(39)

Question 19

A table is in ___________ if every non-key column is dependent on a candidate key,the whole candidate key,and nothing but the candidate key.

(Short Answer)

4.9/5

(43)

Question 20

When you transform the ERD into tables and then use normalization techniques to analyze each table,this is known as the __________________ approach in database development.

In the MVD expressed as $A \rightarrow \rightarrow B \mid C$ ,a given A value is associated with one or more B and C values.

To achieve 4NF,it is possible that there may be M-way relationships that should be split into two or more binary relationships to avoid redundancy.

There is no known general algorithm to convert tables to DKNF.

_________________ is the process of combing tables to make them easier to query.

Although rare,a table in DKNF can still have some modification anomalies.

The goal of 2NF and 3NF is to produce tables in which every key determines the other columns.

Primary key and foreign key constraints are both important kinds of value-based constraints.

The following functional dependencies demonstrate an example of a: A $\rightarrow$ B B $\rightarrow$ C Then A $\rightarrow$ C

The column which appears on the left-hand side (LHS)of a functional dependency is the __________________.

In the MVD expressed as A $\rightarrow \rightarrow$ B | C,where A,B,and C are columns,the three columns comprise a(n)____________________ of an associative table.

When part of a key determines a non-key,this is a violation of BCNF.

Examining sample data in a table can be used to prove that a functional dependency exists,but it is of no use in proving that a functional dependency does not exist.

When you can conclude that object A is related to object C because A is related to object B and B is related to C,this is an example of a(n)____________________.

A table is in ___________ if every non-key column is dependent on a candidate key,the whole candidate key,and nothing but the candidate key.

Introduction to Database Management

Introduction to Database Development

The Relational Data Model

Query Formulation With SQL

Understanding Entity Relations

Developing Data Models for Business Databases

Physical Database Design

Advanced Query Formulation With SQL

Application Development With Views

Stored Procedures and Triggers

View Design and Integration

Data and Database Administration

Transaction Management

Data Warehouse Technology and Management

Client-Server Processing and Distributed Databases

Object Database Management Systems

Filters

Exam 7: Normalization of Relational Tables

When you transform the ERD into tables and then use normalization techniques to analyze each table,this is known as the __________________ approach in database development.

In the MVD expressed as A→→B∣CA \rightarrow \rightarrow B \mid CA→→B∣C ,a given A value is associated with one or more B and C values.

To achieve 4NF,it is possible that there may be M-way relationships that should be split into two or more binary relationships to avoid redundancy.

There is no known general algorithm to convert tables to DKNF.

_________________ is the process of combing tables to make them easier to query.

Although rare,a table in DKNF can still have some modification anomalies.

The goal of 2NF and 3NF is to produce tables in which every key determines the other columns.

Primary key and foreign key constraints are both important kinds of value-based constraints.

The following functional dependencies demonstrate an example of a: A →\rightarrow→ B B →\rightarrow→ C Then A →\rightarrow→ C

The column which appears on the left-hand side (LHS)of a functional dependency is the __________________.

In the MVD expressed as A →→\rightarrow \rightarrow→→ B | C,where A,B,and C are columns,the three columns comprise a(n)____________________ of an associative table.

When part of a key determines a non-key,this is a violation of BCNF.

Examining sample data in a table can be used to prove that a functional dependency exists,but it is of no use in proving that a functional dependency does not exist.

When you can conclude that object A is related to object C because A is related to object B and B is related to C,this is an example of a(n)____________________.

A table is in ___________ if every non-key column is dependent on a candidate key,the whole candidate key,and nothing but the candidate key.

Introduction to Database Management

Introduction to Database Development

The Relational Data Model

Query Formulation With SQL

Understanding Entity Relations

Developing Data Models for Business Databases

Physical Database Design

Advanced Query Formulation With SQL

Application Development With Views

Stored Procedures and Triggers

View Design and Integration

Data and Database Administration

Transaction Management

Data Warehouse Technology and Management

Client-Server Processing and Distributed Databases

Object Database Management Systems

Filters

In the MVD expressed as $A \rightarrow \rightarrow B \mid C$ ,a given A value is associated with one or more B and C values.

The following functional dependencies demonstrate an example of a: A $\rightarrow$ B B $\rightarrow$ C Then A $\rightarrow$ C

In the MVD expressed as A $\rightarrow \rightarrow$ B | C,where A,B,and C are columns,the three columns comprise a(n)____________________ of an associative table.