Package deal
WGU C170
WGU QUENTIONS AND ANSWER GRADED A+
[Show more]WGU QUENTIONS AND ANSWER GRADED A+
[Show more]AREA - In DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - See composite entity. 
bridge entity - See composite entity. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a sup...
Preview 4 out of 31 pages
Add to cartAREA - In DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - See composite entity. 
bridge entity - See composite entity. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a sup...
AREA - In DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - See composite entity. 
bridge entity - See composite entity. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a sup...
Preview 4 out of 31 pages
Add to cartAREA - In DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - See composite entity. 
bridge entity - See composite entity. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a sup...
Syntax for updating a specific column in a specific row - UPDATE <table> 
SET <atrribute> = <value> 
WHERE <primary key> = <value>; 
Syntax for deleting a row - DELETE FROM <TableName> 
WHERE <PrimaryKey> = <#>; 
Syntax for creating a view - CREATE VIE...
Preview 1 out of 2 pages
Add to cartSyntax for updating a specific column in a specific row - UPDATE <table> 
SET <atrribute> = <value> 
WHERE <primary key> = <value>; 
Syntax for deleting a row - DELETE FROM <TableName> 
WHERE <PrimaryKey> = <#>; 
Syntax for creating a view - CREATE VIE...
Access plan -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 -An alternative name for a column or table in a SQL statement. 
ALTER TABLE -Th...
Preview 2 out of 13 pages
Add to cartAccess plan -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 -An alternative name for a column or table in a SQL statement. 
ALTER TABLE -Th...
Access plan -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 -An alternative name for a column or table in a SQL statement. 
ALTER TABLE -Th...
Preview 2 out of 13 pages
Add to cartAccess plan -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 -An alternative name for a column or table in a SQL statement. 
ALTER TABLE -Th...
A salesperson is authorized to sell many products and a product can be sold by many salespersons. 
Which kind of binary relationship does this scenario describe? 
One-to-one 
One-to-many 
Many-to-many 
One-to-one binary - Many-to-many 
Which two examples are attributes? 
Choose 2 answers 
A person a...
Preview 3 out of 19 pages
Add to cartA salesperson is authorized to sell many products and a product can be sold by many salespersons. 
Which kind of binary relationship does this scenario describe? 
One-to-one 
One-to-many 
Many-to-many 
One-to-one binary - Many-to-many 
Which two examples are attributes? 
Choose 2 answers 
A person a...
DML - IUDS, CR 
insert, update, delete, select 
commit, rollback 
INSERT - add new rows 
UPDATE - modify data of existing rows 
DELETE - delete some/all records from database 
can be rolled back 
COMMIT - permanently saves 
ROLLBACK - undo changes 
SELECT - data retrieval 
WHERE - limits rows return...
Preview 2 out of 5 pages
Add to cartDML - IUDS, CR 
insert, update, delete, select 
commit, rollback 
INSERT - add new rows 
UPDATE - modify data of existing rows 
DELETE - delete some/all records from database 
can be rolled back 
COMMIT - permanently saves 
ROLLBACK - undo changes 
SELECT - data retrieval 
WHERE - limits rows return...
DML - IUDS, CR 
insert, update, delete, select 
commit, rollback 
INSERT - add new rows 
UPDATE - modify data of existing rows 
DELETE - delete some/all records from database 
can be rolled back 
COMMIT - permanently saves 
ROLLBACK - undo changes 
SELECT - data retrieval 
WHERE - limits rows return...
Preview 2 out of 5 pages
Add to cartDML - IUDS, CR 
insert, update, delete, select 
commit, rollback 
INSERT - add new rows 
UPDATE - modify data of existing rows 
DELETE - delete some/all records from database 
can be rolled back 
COMMIT - permanently saves 
ROLLBACK - undo changes 
SELECT - data retrieval 
WHERE - limits rows return...
An entity is said to be X -dependent if it can exist in the database only when it is associated with 
another related entity occurrence. - existence 
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 X. - 1nf...
Preview 2 out of 6 pages
Add to cartAn entity is said to be X -dependent if it can exist in the database only when it is associated with 
another related entity occurrence. - existence 
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 X. - 1nf...
An entity is said to be X -dependent if it can exist in the database only when it is associated with 
another related entity occurrence. - existence 
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 X. - 1nf...
Preview 2 out of 6 pages
Add to cartAn entity is said to be X -dependent if it can exist in the database only when it is associated with 
another related entity occurrence. - existence 
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 X. - 1nf...
First Normal Form - - when all non-key columns depend on the primary key 
- a table with a primary key is in first normal form 
- a table with no duplicate rows is in first normal form 
Second Normal Form - - when all non-key columns depend on the whole primary key 
- cannot depend on part of a comp...
Preview 2 out of 13 pages
Add to cartFirst Normal Form - - when all non-key columns depend on the primary key 
- a table with a primary key is in first normal form 
- a table with no duplicate rows is in first normal form 
Second Normal Form - - when all non-key columns depend on the whole primary key 
- cannot depend on part of a comp...
1.1.1 - Conceptual Schema - ER Model 
Tables: Customer, DonutOrder, Donut - Customer: 
PK - CustomerID 
Rest are customer related fields 
DonutOrder: 
FK - CustomerID, 
FK - DonutID 
Qty, SpecialNotes 
Donut: 
PK - DonutID 
Rest are donut fields 
Relationships: 
Customer - 1:n Identifying - DonutOrd...
Preview 2 out of 5 pages
Add to cart1.1.1 - Conceptual Schema - ER Model 
Tables: Customer, DonutOrder, Donut - Customer: 
PK - CustomerID 
Rest are customer related fields 
DonutOrder: 
FK - CustomerID, 
FK - DonutID 
Qty, SpecialNotes 
Donut: 
PK - DonutID 
Rest are donut fields 
Relationships: 
Customer - 1:n Identifying - DonutOrd...
First Normal Form -- when all non-key columns depend on the primary key 
- a table with a primary key is in first normal form 
- a table with no duplicate rows is in first normal form 
Second Normal Form -- when all non-key columns depend on the whole primary key 
- cannot depend on part of a compos...
Preview 2 out of 13 pages
Add to cartFirst Normal Form -- when all non-key columns depend on the primary key 
- a table with a primary key is in first normal form 
- a table with no duplicate rows is in first normal form 
Second Normal Form -- when all non-key columns depend on the whole primary key 
- cannot depend on part of a compos...
access plan - 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. 
algorithms - A process or set of operations in a calculation. 
automatic query optim...
Preview 1 out of 3 pages
Add to cartaccess plan - 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. 
algorithms - A process or set of operations in a calculation. 
automatic query optim...
An inequality condition is also known as a natural join and an equality condition is also called a theta 
join. - False 
When using a(n) _____ join, only rows that meet the given criteria are returned. - inner 
The statement SELECT * FROM T1, T2 produces a(n) _____ join. - cross 
A(n) _____ join wil...
Preview 2 out of 5 pages
Add to cartAn inequality condition is also known as a natural join and an equality condition is also called a theta 
join. - False 
When using a(n) _____ join, only rows that meet the given criteria are returned. - inner 
The statement SELECT * FROM T1, T2 produces a(n) _____ join. - cross 
A(n) _____ join wil...
An alias is especially useful when a table must be joined to itself in a(n) ___________________ 
query. - recursive 
The ___________ condition is generally composed of an equality comparison between the foreign 
key and the primary key of related tables. - join 
A database language enables the user ...
Preview 2 out of 9 pages
Add to cartAn alias is especially useful when a table must be joined to itself in a(n) ___________________ 
query. - recursive 
The ___________ condition is generally composed of an equality comparison between the foreign 
key and the primary key of related tables. - join 
A database language enables the user ...
AREA - In DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - See composite entity. 
bridge entity - See composite entity. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a sup...
Preview 2 out of 5 pages
Add to cartAREA - In DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - See composite entity. 
bridge entity - See composite entity. 
candidate key - A minimal superkey; that is, a key that does not contain a subset of attributes 
that is itself a sup...
binary relationship -An ER term for an association (relationship) between two entities. For 
example, PROFESSOR teaches CLASS. 
cardinality -An attribute that can be further subdivided to yield additional attributes. For 
example, a phone number such as may be divided into an area code (615), an 
e...
Preview 1 out of 3 pages
Add to cartbinary relationship -An ER term for an association (relationship) between two entities. For 
example, PROFESSOR teaches CLASS. 
cardinality -An attribute that can be further subdivided to yield additional attributes. For 
example, a phone number such as may be divided into an area code (615), an 
e...
access plan - 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. 
algorithms - A process or set of operations in a calculation. 
automatic query optim...
Preview 1 out of 3 pages
Add to cartaccess plan - 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. 
algorithms - A process or set of operations in a calculation. 
automatic query optim...
AREA - in DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - another name for composite entity, bridge entity or linking table 
bridge entity - another name for composite entity, associative entity or linking table 
candidate key - a minima...
Preview 2 out of 5 pages
Add to cartAREA - in DB2, a named section of permanent storage space that is reserved to store the 
database. 
associative entity - another name for composite entity, bridge entity or linking table 
bridge entity - another name for composite entity, associative entity or linking table 
candidate key - a minima...
domain - In data modeling, the construct used to organize and describe an attribute's set of 
possible values 
superkey - An attribute or attributes that uniquely identify each entity in a table. Any composite 
key with this is also this. 
candidate key - A minimal superkey; that is, a key that doe...
Preview 2 out of 6 pages
Add to cartdomain - In data modeling, the construct used to organize and describe an attribute's set of 
possible values 
superkey - An attribute or attributes that uniquely identify each entity in a table. Any composite 
key with this is also this. 
candidate key - A minimal superkey; that is, a key that doe...
Unary relationships are common in manufacturing industries. - TRUE 
_________________ not only helps database designers to stay on track during the design process, it 
also enables them to pick up the design thread when the time comes to modify the design. - 
Documentation 
Ideally, an entity identi...
Preview 2 out of 6 pages
Add to cartUnary relationships are common in manufacturing industries. - TRUE 
_________________ not only helps database designers to stay on track during the design process, it 
also enables them to pick up the design thread when the time comes to modify the design. - 
Documentation 
Ideally, an entity identi...
A salesperson is authorized to sell many products and a product can be sold by many salespersons. 
Which kind of binary relationship does this scenario describe? - Many-to-many 
Which two examples are attributes? - An employee number; A meeting code 
Which delete rule sets column values in a child t...
Preview 2 out of 10 pages
Add to cartA salesperson is authorized to sell many products and a product can be sold by many salespersons. 
Which kind of binary relationship does this scenario describe? - Many-to-many 
Which two examples are attributes? - An employee number; A meeting code 
Which delete rule sets column values in a child t...
Preview 2 out of 7 pages
Add to cartWGU C170 Terms QUESTIONS AND 
ANSWERS
An inequality condition is also known as a natural join and an equality condition is also called a theta 
join. - False 
When using a(n) _____ join, only rows that meet the given criteria are returned. - inner 
The statement SELECT * FROM T1, T2 produces a(n) _____ join. - cross 
A(n) _____ join wil...
Preview 2 out of 5 pages
Add to cartAn inequality condition is also known as a natural join and an equality condition is also called a theta 
join. - False 
When using a(n) _____ join, only rows that meet the given criteria are returned. - inner 
The statement SELECT * FROM T1, T2 produces a(n) _____ join. - cross 
A(n) _____ join wil...
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Stuvia is a marketplace, so you are not buying this document from us, but from seller jessybrown. Stuvia facilitates payment to the seller.
No, you only buy these notes for $25.49. You're not tied to anything after your purchase.
4.6 stars on Google & Trustpilot (+1000 reviews)
73918 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now