Exam 6: Normalization of Database Tables

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

A relational table must not contain a(n).

(Multiple Choice)
4.9/5
(82)

The conflicts between design efficiency,information requirements,and performance are often resolved through_____.

(Multiple Choice)
4.9/5
(80)

Explain normalization and its different forms.

(Essay)
4.8/5
(90)

Dependencies based on only a part of a composite primary key are known as dependencies.

(Multiple Choice)
4.8/5
(83)

All relational tables satisfy the 1NF requirements.

(True/False)
4.9/5
(74)

A determinant is any attribute whose value determines other values within a column.

(True/False)
4.9/5
(93)

A table where all attributes are dependent on the primary key but are independent of each other,and no row contains two or more multivalued facts about an entity is said to be in .

(Multiple Choice)
4.8/5
(76)

An attribute that cannot be further subdivided is said to display .

(Short Answer)
4.8/5
(73)

An example of denormalization is using a denormalized table to hold report data.This is required when creating a tabular report in which the columns represent data that are stored in the table as rows.

(Multiple Choice)
4.7/5
(87)

When a table contains only one candidate key,are considered to be equivalent.

(Multiple Choice)
4.8/5
(94)

An atomic attribute .

(Multiple Choice)
4.9/5
(76)

A table that has all key attributes defined,has no repeating groups,and all its attributes are dependent on the primary key is said to be in .

(Multiple Choice)
4.9/5
(75)
Showing 81 - 92 of 92
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)