Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

WGU C170 Data Management – Applications, Exams of Public Health

Chamberlain College of NursingPublic Health

WGU C170 Data Management – Applications

Typology: Exams

2025/2026

Available from 01/31/2026

may-blessed
may-blessed 🇺🇸

4.1

(8)

31K documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
WGU C170 Data Management –
Applications
domain Correct Ans - In data modeling, the construct used to
organize and describe an attribute's set of possible values
superkey Correct Ans - An attribute or attributes that uniquely
identify each entity in a table. Any composite key with this is also this.
candidate key Correct Ans - A minimal superkey; that is, a key that
does not contain a subset of attributes that is itself a superkey
entity integrity Correct Ans - The property of a relational table that
guarantees each entity has a unique value in a primary key and that the key
has no null values
referential integrity Correct Ans - A condition by which a
dependent table's foreign key must have either a null entry or a matching
entry in the related table
data dictionary Correct Ans - A DBMS component that stores
metadata. It contains the data definition & their characteristics and
relationships; may also include data external to the DBMS
system catalog Correct Ans - A detailed system data dictionary
that describes all objects in a database
homonym Correct Ans - The use of the same name to label
different attributes, much like similar-sounding words with different
meanings
synonym Correct Ans - The use of different names to identify the
same object, such as an entity, an attribute, or a relationship. These should
generally be avoided.
not null and unique Correct Ans - Any candidate key must have
these two constraints enforced
cardinality Correct Ans - Term for how many instances of one
object are related to instances of another object (maximum)
modality Correct Ans - Term for whether an instance of a specific
entity is optional or mandatory in a relationship (minimum)
pf3
pf4
pf5

Partial preview of the text

Download WGU C170 Data Management – Applications and more Exams Public Health in PDF only on Docsity!

WGU C170 Data Management –

Applications

domain Correct Ans - In data modeling, the construct used to organize and describe an attribute's set of possible values superkey Correct Ans - An attribute or attributes that uniquely identify each entity in a table. Any composite key with this is also this. candidate key Correct Ans - A minimal superkey; that is, a key that does not contain a subset of attributes that is itself a superkey entity integrity Correct Ans - The property of a relational table that guarantees each entity has a unique value in a primary key and that the key has no null values referential integrity Correct Ans - A condition by which a dependent table's foreign key must have either a null entry or a matching entry in the related table data dictionary Correct Ans - A DBMS component that stores metadata. It contains the data definition & their characteristics and relationships; may also include data external to the DBMS system catalog Correct Ans - A detailed system data dictionary that describes all objects in a database homonym Correct Ans - The use of the same name to label different attributes, much like similar-sounding words with different meanings synonym Correct Ans - The use of different names to identify the same object, such as an entity, an attribute, or a relationship. These should generally be avoided. not null and unique Correct Ans - Any candidate key must have these two constraints enforced cardinality Correct Ans - Term for how many instances of one object are related to instances of another object (maximum) modality Correct Ans - Term for whether an instance of a specific entity is optional or mandatory in a relationship (minimum)

connectivity Correct Ans - Term for the classification of the relationship between entities. Classifications include 1:1, 1:M, and M:N CREATE SCHEMA AUTHORIZATION Correct Ans - SQL command to create a database schema DEFAULT Correct Ans - SQL option to define a default value for a column (when no value is given) CHECK Correct Ans - SQL command to validate data in an attribute, used during table column creation CREATE TABLE AS Correct Ans - SQL command to create a new table based on a query in the user's database schema HAVING Correct Ans - SQL option that restricts a selection of grouped rows based on a condition EXISTS Correct Ans - SQL option that checks whether a subquery returns any rows DECIMAL Correct Ans - SQL data type like the NUMBER specification, but the storage length is a minimum specification True Correct Ans - True or false: if an INSERT or SELECT command is embedded inside a program for later use, the attribute list should always be used, as the table may change over time inner join Correct Ans - A join operation in which only rows that meet a given criterion are selected. The most common type of join outer join Correct Ans - A join operation that produces a table in which all unmatched pairs are retained; unmatched values in the related table are left null cross join Correct Ans - A join operation that returns the Cartesian product of two sets or tables natural join Correct Ans - Join type that returns only the rows with matching values in the matching columns; the matching columns must have the same names and similar data types left, right, full Correct Ans - Name the three types of outer joins ALL Correct Ans - This operator can be used to compare something to every returned row of a subquery

extents Correct Ans - In a DBMS environment, refers to the ability of data files to expand in size automatically using predefined increments table space (file group) Correct Ans - In a DBMS, a logical storage space used to group related data SQL cache (procedure cache) Correct Ans - A shared, reserved memory area that stores the most recently executed SQL statements or PL/SQL procedures, including triggers and functions automatic vs manual Correct Ans - Whether query optimization is done by the DBMS vs done by the programmer static vs dynamic Correct Ans - Whether query optimization is done at compilation vs run-time statistically based algorithm Correct Ans - A query optimization technique that uses statistical information about a database. The DBMS then uses these statistics to determine the best access strategy rule based algorithm Correct Ans - A query optimization technique that uses preset rules and points to determine the best approach to executing a query access plan Correct Ans - 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 query processing bottleneck Correct Ans - In query optimization, a delay introduced in the processing of an I/O operation that causes the overall system to slow down data sparsity Correct Ans - A column distribution of values or the number of different values a column can have hash index Correct Ans - An index based on an ordered list of hash values B-tree index Correct Ans - An ordered data structure organized as an upside-down tree bitmap index Correct Ans - An index that uses a bit array (0s and 1s) to represent the existence of a value or condition prime attribute Correct Ans - A key attribute; that is, an attribute that is part of a key or is the whole key

1NF Correct Ans - Normal form: No repeating groups, PK identified, all values depend on PK 2NF Correct Ans - Normal form: 1NF and no partial dependencies 3NF Correct Ans - Normal form: 2NF and no transitive dependencies BCNF (Boyce-Codd Normal Form) Correct Ans - Normal form: every determinant is a candidate key (special case of 3NF) 4NF Correct Ans - Normal form: 3NF and no independent multivalued dependencies full functional dependence Correct Ans - If attribute B is functionally dependent on a composite key A but not on any subset of that composite key, the attribute B is said to be this partial dependency Correct Ans - A condition in which an attribute is dependent on only a portion (subset) of the primary key transitive dependency Correct Ans - A condition in which an attribute is dependent on another attribute that is not part of the primary key repeating group Correct Ans - A characteristic describing a group of multiple entries of the same type for a single key attribute occurrence. For example, a car can have multiple colors for its top, interior, bottom, trim, and so on.