WGU C170 questions with verified answers
1NF Ans✓✓✓-The first stage in the normalization process. It describes a relation
depicted in tabular format, with no repeating groups and a primary key identified.
All nonkey attributes in the relation are dependent on the primary key.
2NF Ans✓✓✓-The second stage in the normalization process, in which a relation
is in 1NF and there are no partial dependencies (dependencies in only part of the
primary key).
3NF Ans✓✓✓-A table in 2NF and has no nonkey attribute functionally dependent
on another nonkey attribute - cannot include transitive dependencies
4NF Ans✓✓✓-A table is in this form if it is in 3NF and contains no multiple
independent sets of multivalued dependencies
Access plan Ans✓✓✓-A set of instructions generated at application compilation
time that is created and managed by a DBMS. The access plan predetermines how
an application's query will access the database at run time.
Alias Ans✓✓✓-An alternative name for a column or table in a SQL statement.
ALTER TABLE Ans✓✓✓-The SQL command used to make changes to table
structure. When the command is followed by a keyword (ADD or MODIFY), it adds
a column or changes column characteristics.
AREA Ans✓✓✓-In DB2, a named section of permanent storage space that is
reserved to store the database.
,Atomic attribute Ans✓✓✓-An attribute that cannot be further subdivided to
produce meaningful components. For example, a person's last name attribute
cannot be meaningfully subdivided.
Atomicity Ans✓✓✓-The transaction property that requires all parts of a
transaction to be treated as a single, indivisible, logical unit of work. All parts of a
transaction must be completed or the entire transaction is aborted.
automatic query optimization Ans✓✓✓-A method by which a DBMS finds the
most efficient access path for the execution of a query.
B-tree index Ans✓✓✓-An ordered data structure organized as an upside-down
tree.
Base tables Ans✓✓✓-Tables on which the view is based
batch update routine Ans✓✓✓-A routine that pools transactions into a single
batch to update a master table in a single operation.
BETWEEN Ans✓✓✓-In SQL, a special comparison operator used to check whether
a value is within a range of specified values.
binary relationship Ans✓✓✓-An ER term for an association (relationship)
between two entities. For example, PROFESSOR teaches CLASS.
, Bitmap index Ans✓✓✓-An index that uses a bit array (0s and 1s) to represent the
existence of a value or condition.
Boolean Algebra Ans✓✓✓-A branch of mathematics that uses the logical
operators OR, AND, and NOT.
Boyce-Codd Normal Form (BCNF) Ans✓✓✓-A special type of third normal form
(3NF) in which every determinant is a candidate key. A table in BCNF must be in
3NF. See also determinant.
Candidate Key Ans✓✓✓-A minimal superkey; that is, a key that does not contain
a subset of attributes that is itself a superkey.
Cardinality Ans✓✓✓-A property that assigns a specific value to connectivity and
expresses the range of allowed entity occurrences associated with a single
occurrence of the related entity.
Cascading order sequence Ans✓✓✓-A nested ordering sequence for a set of
rows, such as a list in which all last names are alphabetically ordered and, within
the last names, all first names are ordered.
Closure Ans✓✓✓-A property of relational operators that permits the use of
relational algebra operators on existing tables (relations) to produce new
relations.
Composite Attribute Ans✓✓✓-An attribute that can be further subdivided to
yield additional attributes. For example, a phone number such as 615-898-2368
may be divided into an area code (615), an exchange number (898), and a four-
digit code (2368). Compare to simple attribute.
1NF Ans✓✓✓-The first stage in the normalization process. It describes a relation
depicted in tabular format, with no repeating groups and a primary key identified.
All nonkey attributes in the relation are dependent on the primary key.
2NF Ans✓✓✓-The second stage in the normalization process, in which a relation
is in 1NF and there are no partial dependencies (dependencies in only part of the
primary key).
3NF Ans✓✓✓-A table in 2NF and has no nonkey attribute functionally dependent
on another nonkey attribute - cannot include transitive dependencies
4NF Ans✓✓✓-A table is in this form if it is in 3NF and contains no multiple
independent sets of multivalued dependencies
Access plan Ans✓✓✓-A set of instructions generated at application compilation
time that is created and managed by a DBMS. The access plan predetermines how
an application's query will access the database at run time.
Alias Ans✓✓✓-An alternative name for a column or table in a SQL statement.
ALTER TABLE Ans✓✓✓-The SQL command used to make changes to table
structure. When the command is followed by a keyword (ADD or MODIFY), it adds
a column or changes column characteristics.
AREA Ans✓✓✓-In DB2, a named section of permanent storage space that is
reserved to store the database.
,Atomic attribute Ans✓✓✓-An attribute that cannot be further subdivided to
produce meaningful components. For example, a person's last name attribute
cannot be meaningfully subdivided.
Atomicity Ans✓✓✓-The transaction property that requires all parts of a
transaction to be treated as a single, indivisible, logical unit of work. All parts of a
transaction must be completed or the entire transaction is aborted.
automatic query optimization Ans✓✓✓-A method by which a DBMS finds the
most efficient access path for the execution of a query.
B-tree index Ans✓✓✓-An ordered data structure organized as an upside-down
tree.
Base tables Ans✓✓✓-Tables on which the view is based
batch update routine Ans✓✓✓-A routine that pools transactions into a single
batch to update a master table in a single operation.
BETWEEN Ans✓✓✓-In SQL, a special comparison operator used to check whether
a value is within a range of specified values.
binary relationship Ans✓✓✓-An ER term for an association (relationship)
between two entities. For example, PROFESSOR teaches CLASS.
, Bitmap index Ans✓✓✓-An index that uses a bit array (0s and 1s) to represent the
existence of a value or condition.
Boolean Algebra Ans✓✓✓-A branch of mathematics that uses the logical
operators OR, AND, and NOT.
Boyce-Codd Normal Form (BCNF) Ans✓✓✓-A special type of third normal form
(3NF) in which every determinant is a candidate key. A table in BCNF must be in
3NF. See also determinant.
Candidate Key Ans✓✓✓-A minimal superkey; that is, a key that does not contain
a subset of attributes that is itself a superkey.
Cardinality Ans✓✓✓-A property that assigns a specific value to connectivity and
expresses the range of allowed entity occurrences associated with a single
occurrence of the related entity.
Cascading order sequence Ans✓✓✓-A nested ordering sequence for a set of
rows, such as a list in which all last names are alphabetically ordered and, within
the last names, all first names are ordered.
Closure Ans✓✓✓-A property of relational operators that permits the use of
relational algebra operators on existing tables (relations) to produce new
relations.
Composite Attribute Ans✓✓✓-An attribute that can be further subdivided to
yield additional attributes. For example, a phone number such as 615-898-2368
may be divided into an area code (615), an exchange number (898), and a four-
digit code (2368). Compare to simple attribute.
