True/False
Indicate whether the sentence or statement is true
or false.
|
|
|
1.
|
A
relational database handles entities, attributes, and relationships by storing each entity in its own
table.
|
|
|
2.
|
Each
column in the table must have a unique name in the table.
|
|
|
3.
|
In a
relation, all of the attributes in a row must contain a single value.
|
|
|
4.
|
In a
relation, the order of the columns is important.
|
|
|
5.
|
In a
relation, the order of rows is important.
|
|
|
6.
|
A
relational database is a collection of tables.
|
|
|
7.
|
An
unnormalized relation is a table that has more than one row.
|
|
|
8.
|
When
there is more than one table in the database, the columns in common cannot have the exact same column
name.
|
|
|
9.
|
The
primary key of a table is the column that identifies a row in a related table.
|
|
|
10.
|
A
column whose value uniquely identifies a given row in a table is the primary key.
|
|
|
11.
|
A
primary key must consist of a single column.
|
|
|
12.
|
A
combination of columns can be used to uniquely identify a row.
|
|
|
13.
|
A
query is a question posed to a database.
|
|
|
14.
|
QBE
is a written method of querying a database.
|
|
|
|
|
|
15.
|
Refer
to figure 2.3 on page 34. The query shown will display four attributes for all
customers.
|
|
|
16.
|
Refer
to figure 2.3 on page 34. The query shown will always display exactly four customers when
executed.
|
|
|
17.
|
Using
the hash mark (#) in a query will result in all fields being displayed.
|
|
|
18.
|
Values formatted as text fields must be enclosed in quotes.
|
|
|
19.
|
The
comparison operators are >, <, >=, <=, =, and NOT.
|
|
|
20.
|
The
comparison operators are also known as the relational operators.
|
|
|
21.
|
Queries must be single-focused; there can only be one condition placed within a
query.
|
|
|
22.
|
Use
the OR row to show that only one criteria needs to be true.
|
|
|
23.
|
If
the criteria is placed in the same field, then the condition is considered to be an OR
condition.
|
|
|
24.
|
Aggregate functions are built-in statistics that calculate totals of some
type.
|
|
|
25.
|
The
concept of grouping means that statistics will be calculated for individual records.
|
|
|
26.
|
Sorting will re-order the physical table itself.
|
Modified True/False
Indicate
whether the sentence or statement is true or false. If false, change the identified word or
phrase to make the sentence or statement true.
|
|
|
27.
|
A
relational database handles entities, attributes, and relationships by storing each entity in
its own table.
|
|
|
28.
|
Using
the hash mark (#) in a query will result in all fields being displayed.
|
|
|
29.
|
A
comparison operator is also known as a(n) logical operator.
|
|
|
30.
|
Aggregate functions are built-in statistics that calculate totals of some type.
|
|
|
31.
|
The
minor sort key is also known as the primary sort key.
|
|
|
32.
|
To
create a query based on more than one table, you must merge the tables.
|
|
|
33.
|
A
query that changes data is called a(n) update query.
|
|
|
34.
|
Using
a delete query will delete one or more tables at a time.
|
|
|
35.
|
A(n)
make-table query will create a new table from the query results.
|
|
|
36.
|
Boolean algebra is a theoretical way of manipulating a database.
|
|
|
37.
|
The
SELECT command retrieves rows from a table.
|
|
|
38.
|
The
keyword AS, followed by a table name, requests that the result of the command be placed in a
temporary table with the name specified.
|
|
|
39.
|
A(n)
union will show every row in the first table or every row in the second table or every row in
both the first and second table.
|
|
|
40.
|
A(n)
intersection is a table that has all the rows from the first table, but not the second.
|
|
|
41.
|
A(n)
intersection is a table containing all rows that are common in both the first table and second
table used.
|
|
|
42.
|
The
product of two tables is the table created by combining every row in the first table with
every row in the second table.
|
|
|
43.
|
A
simpler name for the Cartesian product is the intersection of two tables.
|
|
|
44.
|
The
join operation is the core operation of relational algebra because it is the command that
allows you to extract data from more than one table.
|
|
|
45.
|
Relational algebra is a theoretical way of manipulating a relational database.
|