WGU C170 Data Management – Applications
Exam Questions With Verified Answers
1NF - ANSWER-Normal form: No repeating groups, PK identified, all values
depend on PK
.2NF - ANSWER-Normal form: 1NF and no partial dependencies
.3NF - ANSWER-Normal form: 2NF and no transitive dependencies
.4NF - ANSWER-Normal form: 3NF and no independent multivalued
dependencies
.access plan - ANSWER-The result of parsing a SQL statement; it contains the
series of steps a DBMS will use to execute the query and return the result set in
the most efficient way
.ALL - ANSWER-This operator can be used to compare something to every
returned row of a subquery
.ANY - ANSWER-This operator can be used to compare something to a list of
values and return any rows that satisfy the criteria
.automatic vs manual - ANSWER-Whether query optimization is done by the
DBMS vs done by the programmer
, .B-tree index - ANSWER-An ordered data structure organized as an upside-down
tree
.base table - ANSWER-The table on which a view is based
.batch update routine - ANSWER-A routine that pools transactions into a single
group to update a master table in a single operation
.BCNF (Boyce-Codd Normal Form) - ANSWER-Normal form: every determinant is
a candidate key (special case of 3NF)
.bitmap index - ANSWER-An index that uses a bit array (0s and 1s) to represent
the existence of a value or condition
.candidate key - ANSWER-A minimal superkey; that is, a key that does not
contain a subset of attributes that is itself a superkey
.cardinality - ANSWER-Term for how many instances of one object are related to
instances of another object (maximum)
.CHECK - ANSWER-SQL command to validate data in an attribute, used during
table column creation
.connectivity - ANSWER-Term for the classification of the relationship between
entities. Classifications include 1:1, 1:M, and M:N
Exam Questions With Verified Answers
1NF - ANSWER-Normal form: No repeating groups, PK identified, all values
depend on PK
.2NF - ANSWER-Normal form: 1NF and no partial dependencies
.3NF - ANSWER-Normal form: 2NF and no transitive dependencies
.4NF - ANSWER-Normal form: 3NF and no independent multivalued
dependencies
.access plan - ANSWER-The result of parsing a SQL statement; it contains the
series of steps a DBMS will use to execute the query and return the result set in
the most efficient way
.ALL - ANSWER-This operator can be used to compare something to every
returned row of a subquery
.ANY - ANSWER-This operator can be used to compare something to a list of
values and return any rows that satisfy the criteria
.automatic vs manual - ANSWER-Whether query optimization is done by the
DBMS vs done by the programmer
, .B-tree index - ANSWER-An ordered data structure organized as an upside-down
tree
.base table - ANSWER-The table on which a view is based
.batch update routine - ANSWER-A routine that pools transactions into a single
group to update a master table in a single operation
.BCNF (Boyce-Codd Normal Form) - ANSWER-Normal form: every determinant is
a candidate key (special case of 3NF)
.bitmap index - ANSWER-An index that uses a bit array (0s and 1s) to represent
the existence of a value or condition
.candidate key - ANSWER-A minimal superkey; that is, a key that does not
contain a subset of attributes that is itself a superkey
.cardinality - ANSWER-Term for how many instances of one object are related to
instances of another object (maximum)
.CHECK - ANSWER-SQL command to validate data in an attribute, used during
table column creation
.connectivity - ANSWER-Term for the classification of the relationship between
entities. Classifications include 1:1, 1:M, and M:N
