chapter 7 review Flashcards

1
Q

t or f: entity relation model forms the basis of an entity relation diagram

A

true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

… represents conceptual DB as viewed by end users

A

ERD

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

ERDs depict DBs main components which are:
e
a
r

A

entity
attribute
relationships

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

refers to entity set and not single entity occurrence

A

entity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what is the shape of a crow’s foot model?

A

rectangle

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

characteristics of entities?

A

attributes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

attributes represented by ovals connected to entity rectangle with a line

A

Chen notation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

…. attributes written in an attribute box below the entity rectangle

A

crows foot notation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

attributes that must have a value

A

required attributes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

maybe left empty

A

optional attributed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

set of possible values for an attribute

A

domain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

one or more attributes that uniquely identify each entity instance

A

identifiers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

primary key composed of more than one attribute

A

composite identifiers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

t or f: composite attributes can’t be subdivided

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

t or f: simple attributes can be subdivided

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

value may be calculated from other attributes

A

derived attributes

17
Q

t or f : relationship classification is difficult to establish if only one side of the relationship is known

A

true

18
Q

describe the relationship classification

A

connectivity

19
Q

expresses a minimum number of entity occurrences associated with one occurrence of a related entity

A

cardinality

20
Q

an entity exists in DB only when it is associated with another related entity occurrence

A

existence dependence

21
Q

entity can exist apart from one or more related entities

A

existence independence

22
Q

exists if PK of related entity doesnt contain PK component of parent entity

A

weak relationship

23
Q

exists if PK of related entity does contain PK component of a parent entity

A

strong entity

24
Q

weak entity meets two conditions:
e
p

A

existence-dependant

primary key partially or totally derived from parent entity in relationship

25
Q

one entity occurrence doesn’t require corresponding entity occurrence in a particular relationship

A

optional participation

26
Q

one entity occurrence requires corresponding entity occurrence in particular relationship

A

mandatory participation

27
Q

the association is maintained within a single entity

A

unary relationship

28
Q

two entities are associated

A

binary relationship

29
Q

three entities are associated

A

Trenary relationship

30
Q

….. used to implement m:n relationship

A

associative entities

31
Q

t or f: DB designers must make design compromises?

A

true

32
Q

…. design standards, processing speed, information requirements

A

conflicting goals

33
Q

t or f: it is not important to meet logical requirements and design conventions

A

false