Ics 321 - Quiz 2

Front 1

A relation is a three-dimensional table (T/F)

Back 1

False

Front 2

A tuple is a group of one or more columns that uniquely identifies a row. (T/F)

Back 2

False

Front 3

In the functional dependency shown as A -> B, B is the determinant. (T/F)

Back 3

False

Front 4

Functional dependencies can involve groups of attributes. (T/F)

Back 4

True

Front 5

A key can be composed of a group of attributes taken together (T/F)

Back 5

True

Front 6

Surrogate keys are normally not shown on forms or reports. (T/F)

Back 6

True

Front 7

A relation is in 4NF when multivalued dependencies are isolated in their own relation. (T/F)

Back 7

True

Front 8

The cast operator explicitly converts an expression from on data type to a different data type. (T/F)

Back 8

True

Front 9

The optional INSERT clause of the SELECT statement is used to create temporary tables. (T/F)

Back 9

False

Front 10

If the removal of facts about one entity results in the unintentional lose of data about another entity, this is referred to as a(n) ____.
a) normalization anomaly
b) insertion anomaly
c) update anomaly
d) deletion anomaly
e) removal anomaly

Back 10

d) deletion anomaly

Front 11

A table that meets the definition of a relation is in ______.
a) First Normal Form
b) Second Normal Form
c) Third Normal Form
d) Boyce-Codd Normal Form
e) Fourth Normal Form

Back 11

a. First Normal Form

Front 12

A relation is in Boyce-Cott normal form if _____.
a) every determinant is a candidate key.
b) every determinant is a primary key
c) every attribute is a candidate key
d) there is more than one candidate key
e) there is more than one primary key

Back 12

a) every determinant is a candidate key

Front 13

If a table is designed so that every determinant is a candidate key, then that relation is in _____.
a) First Normal Form
b) Second Normal Form
c) Third Normal Form
d) Boyce-Codd Normal Form
e) Fourth Normal Form

Back 13

d) Boyce-Codd Normal Form

Front 14

A relation is in domain/key normal form if _______.
a) every key of the relation is a logical consequence of the definition of constraints and determinants
b) every key of the relation is a logical consequence of the definition of constraints and domains
c) every constraint on the relation is a logical consequence of the definition of keys and determinants
d) every constraint on the relation is a logical consequence of the definition of keys and domains
e) every domain of the relation is a logical consequence of the definition of keys and constraints

Back 14

d) every constraint on the relation is a logical consequence of the definition of keys and domains

Front 15

In general, each relation should have ____.
a) one and only one theme
b) one or more themes
c) exactly two themes
d) one or two themes
e) exactly three themes

Back 15

a) one and only one theme

Front 16

Saying that two entities are functionally dependent means that ______.
a) the entities are always connected by a mathematical equation
b) for one of the entities, if we are given the value of that entity, we can determine the value of one other entity
c) for both of the entities if we are given the value of that entity, we can determine the value of one other entity
d) the functional dependency will have to be removed through normalization
e) all of the above

Back 16

b) for one of the entities, if we are given the value of that entity, we can determine the value of one other entity

Front 17

Given the functional dependency (A,B)->C then _______.
a) A ->B
b) A ->C
c) B -> A
d) B -> C
e) none of the above is correct

Back 17

e) None of the above is correct

Front 18

The only reason(s) for having relations is to ____.
a) store instances of functional dependencies
b) store equation components
c) store equation results
d) b and c
e) a, b, and c

Back 18

a) store instances of functional dependencies

Front 19

A combination of two or more columns used to identify particular rows in a relation is a(n) _____.
a) record
b) field
c) composite key
d) foreign key
e) surrogate key

Back 19

c) composite key

Front 20

Referential integrity constraints are used to limit the possible values of a(n) _____.
a) composite key
b) candidate key
c) foreign key
d) surrogate key
e) dependency

Back 20

c) foreign key

Front 21

the _____ operator removes duplicates from a rowset or from a collection of values.
a) SINGLE
b) UNIQUE
c) DISTINCT
d) TOP
e) NO DUPLICATE

Back 21

c) DISTINCT

Front 22

When using WITH TIES, an _____ clause must be specified.
a) SORT BY
b) ARRANGE BY
c) SET [DESC | ASC] ORDER
d) DESC <strribute name>
e) ORDER BY

Back 22

e) ORDER BY

Front 23

In relational terms as defined by E.F. Codd, a row is called a(n) ______.

Back 23

Tuple

Front 24

A(n) _____ is a relationship between attributes such that if we know the value of one attribute, we can determine the value of the other attribute.

Back 24

dependency

Front 25

A(n) ______ is an artificial column that is added to a relation to be its primary key.

Back 25

Surrogate Key

Front 26

Any table that meets the definition of a(n) ______ is said to be in first normal form.

Back 26

relation

Front 27

Everytime we break up a relation during the normalization process, we may have to create _____ constraints.

Back 27

Referential Integrity

Front 28

In SQL Server you can reformat the column output with automatic data type conversion by using the ______ and ____ functions in the SELECT statement

Back 28

CAST, CONVERT

Front 29

You can sort query results by one or more of the columns in the returned rows by using an _____ clause

Back 29

ORDER BY

Front 30

The _____ clause is used to reduce the output of a select statement based on a specific criteria.

Back 30

WHERE

Front 31

The _____ keyword specifies that the first N words of the result set are returned.

Back 31

TOP