Chap 008 Database Design

Chapter 8 Data Modeling and Analysis
True/False Questions
1. Data modeling is a technique for defining business requirements for a database.
Answer: True Page: 270 LD: !as"
2. Data modeling is a technique for organi#ing and documenting a s"stem$s logical and
%h"sical models.
Answer: &alse Page: 270 LD: 'edium
(ationale: Data modeling is a technique for organi#ing and documenting a s"stem$s
data.
). Data modeling is sometimes called database modeling because a data model is
e*entuall" im%lemented as a database.
+. An entit" is something about which the business needs to store data.
,. An entit" is a class of %ersons- %laces- ob.ects- e*ents or conce%ts about which we
need to ca%ture and store data.
/. An identit" is a class of %ersons- %laces- ob.ects- e*ents- or conce%ts about which we
need to ca%ture and store data.
(ationale: An entit" is a class of %ersons- %laces- ob.ects- e*ents or conce%ts about
which we need to ca%ture and store data.
7. An entit" instance is a single occurrence of an entit".
0. An entit" e1istence is a single occurrence of an entit".
Answer: &alse Page: 272 LD: !as"
(ationale: An entit" instance is a single occurrence of an entit".
Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition 137
2. An attribute is a descri%ti*e %ro%ert" or characteristic of an entit".
10. A com%ound attribute is one that actuall" consists of other attributes that are logicall"
grou%ed together.
11. A com%ound attribute is an attribute that will be e1%anded into a se%arate entit".
(ationale: A com%ound attribute is one that actuall" consists of other attributes that are
logicall" grou%ed together.
12. The data t"%e of an attribute defines what t"%e of data can be stored in that attribute.
1). !1am%le data t"%es include: numbers- te1t- memo- date- time- "es3no- 4oolean- *alue
set- or image.
1+. The domain of an attribute defines what *alues an attribute can legitimatel" ta5e on.
1,. The domain *alue for an attribute is the *alue that will be recorded if not s%ecified b"
the user.
Answer: &alse Page: 27) LD: 'edium
(ationale: The default *alue for an attribute is the *alue that will be recorded if not
s%ecified b" the user.
1/. A 5e" is an attribute- or grou% of attributes- that assumes a unique *alue for each entit"
instance. 6t is sometimes called an identifier.
Answer: True Page: 27) LD: !as"
138 Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
17. A 5e" is an attribute or grou% of attributes that assumes a unique *alue for each entit"
instance. 6t is sometimes called the domain of the attribute.
(ationale: A 5e" is an attribute- or grou% of attributes- that assumes a unique *alue for
each entit" instance. 6t is sometimes called an identifier.
10. A concatenated 5e" is a grou% of attributes that uniquel" identifies an instance of an
entit".
12. A concatenated 5e" is also 5nown as a com%osite 5e" or a com%ound 5e".
20. A candidate 5e" must be a single attribute.
Answer: &alse Page: 27+ LD: 'edium
(ationale: A candidate 5e" ma" be a single attribute or a concatenated 5e".
21. A candidate 5e" ma" be a single attribute or a concatenated 5e".
Answer: True Page: 27+ LD: !as"
22. A %rimar" 5e" is that candidate 5e" that will most commonl" be used to uniquel"
identif" a single entit" instance.
2). An e1am%le of domain would be an attribute called grade where the *alues could onl"
be A- 4- 7- D- !- or &.
Answer: True Page: 272 LD: 'edium
2+. An alternate 5e" is also 5nown as a secondar" 5e".
2,. A subsetting criteria is an attribute or concatenated attribute whose finite *alues di*ide
all entit" instances into useful subsets.
2/. A subsetting criteria is also 5nown as an in*ersion entr".
27. A subsetting criteria is a domain of attributes whose *alues are limitless to allow for a
*ariet" of subsets to be constructed from a database.
(ationale: A subsetting criteria is an attribute or concatenated attribute whose finite
*alues di*ide all entit" instances into useful subsets.
20. A relationshi% is a natural business association that e1ists between one or more
entities.
Answer: True Page: 27, LD: !as"
22. A relationshi% ma" re%resent an e*ent that lin5s the entities or merel" a %h"sical
affinit" that e1ists between the entities.
Answer: &alse Page: 27, LD: 8ard
(ationale: A relationshi% ma" re%resent an e*ent that lin5s the entities or merel" a
logical affinit" that e1ists between the entities.
)0. All data model relationshi%s are unidirectional.
Answer: &alse Page: 27, LD: 'edium
(ationale: (elationshi%s are bi9directional.
)1. 4ecause all relationshi%s are bi9directional in an entit" relationshi% diagram-
cardinalit" must be defined in both directions for e*er" relationshi%.
)2. 7once%tuall" cardinalit" defines the minimum and ma1imum attributes that can be
added to an entit".
(ationale: 7ardinalit" is the minimum and ma1imum number of occurrence of one
entit" that ma" be related to a single occurrence of the other entit".
)). The degree of a relationshi% is the number of entities that %artici%ate in the
relationshi%.
)+. The domain of a relationshi% is the number of entities that %artici%ate in the
relationshi%.
(ationale: The degree of a relationshi% is the number of entities that %artici%ate in the
relationshi%.
),. A recursi*e relationshi% is when onl" one entit" %artici%ates in the relationshi%.
Answer: True Page: 27/ LD: !as"
)/. A recursi*e relationshi% is a relationshi% with a degree of infinit"- because there is no
limit to how man" entities %artici%ate in the relationshi%.
Answer: &alse Page: 27/ LD: 'edium
(ationale: A recursi*e relationshi% is a relationshi% with a degree of one :1;- onl" one
entit" %artici%ates in the relationshi%.
)7. A recursi*e relationshi% identifies a relationshi% that ma" e1ist between different
instances of the same entit".
)0. A ternar" relationshi% is a relationshi% among three entities.
)2. The relationshi% between a student entit" and a curriculum entit" would be classified
as recursi*e.
(ationale: A recursi*e relationshi% identifies a relationshi% that ma" e1ist between
different instances of the same entit"
+0. 6n a one9to9man" relationshi%- the %arent is the entit" on the <one< side.
+1. A foreign 5e" in a child entit" alwa"s matches the %rimar" 5e" in the %arent entit".
+2. A foreign 5e" in the %arent entit" alwa"s matches the %rimar" 5e" in the child entit".
(ationale: A foreign 5e" in a child entit" alwa"s matches the %rimar" 5e" in the %arent
entit".
+). =onidentif"ing relationshi%s are those in which each of the %artici%ating entities has
its own inde%endent %rimar" 5e". That is- none of the %rimar" 5e" attributes is shared.
++. =onidentif"ing relationshi%s are those in which each of the %artici%ating entities has
de%endent %rimar" 5e"s.
(ationale: =onidentif"ing relationshi%s are those in which each of the %artici%ating
entities has its own inde%endent %rimar" 5e". That is- none of the %rimar" 5e"
attributes is shared.
+,. 6dentif"ing relationshi%s are those in which the %arent entit" contributes its %rimar"
5e" to become %art of the %rimar" 5e" of the child entit".
+/. A nons%ecific relationshi% is a man"9to9man" relationshi%.
+7. A non9s%ecific relationshi% is one in which man" instances of one entit" are associated
with man" instances of another entit".
+0. A man"9to9man" relationshi% is one in which man" entities are associated with other
attributes of a different entit".
(ationale: A man"9to9man" relationshi% is one in which man" instances of one entit"
are associated with man" instances of another entit".
14! Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
+2. >enerali#ation is a technique wherein the attributes that are common to se*eral t"%es
of an entit" are grou%ed into their own entit"- called a su%ert"%e.
,0. >enerali#ation is a technique wherein the domains common to se*eral t"%es of
attributes are grou%ed into their own entit"- called an associate entit".
(ationale: >enerali#ation is a technique wherein the attributes that are common to
se*eral t"%es of an entit" are grou%ed into their own entit"- called a su%ert"%e.
,1. An entit" subt"%e is an entit" whose instances inherit some common attributes from an
entit" su%ert"%e and then add other attributes that are unique to an instance of the
subt"%e.
,2. An entit" su%ert"%e is an entit" whose instances inherit some common attributes from
an entit" subt"%e and then add other attributes that are unique to an instance of the
su%ert"%e.
(ationale: An entit" subt"%e is an entit" whose instances inherit some common
attributes from an entit" su%ert"%e and then add other attributes that are unique to an
instance of the subt"%e.
,). An enter%rise data model t"%icall" identifies onl" the most fundamental of entities of
the enter%rise.
,+. An enter%rise data model t"%icall" identifies and defines onl" the most com%le1
entities used b" the enter%rise.
(ationale: An enter%rise data model t"%icall" identifies onl" the most fundamental of
entities.
,,. The data model for a single information s"stem is usuall" called an a%%lication data
model.
,/. The conte1t data model is %re%ared during the %roblem anal"sis %hase and onl"
includes entities and relationshi%s- but no attributes.
,7. The requirements anal"sis results in a logical data model that is de*elo%ed in stages as
follows: :1; conte1t data model? :2; 5e"9based data model? :); full" attributed data
model? and :+; the normali#ed data model.
Answer: True Page: 20/9207 LD: 'edium
,0. The requirements anal"sis results in a %h"sical data model that is de*elo%ed in stages
as follows: :1; normali#ed data model? :2; 5e"9based data model? :); full" attributed
data model? and :+; the conte1t data model.
Answer: &alse Page: 20/9207 LD: 'edium
(ationale: The requirements anal"sis results in a logical data model that is de*elo%ed
in stages as follows: :1; conte1t data model? :2; 5e"9based data model? :); full"
attributed data model? and :+; the normali#ed data model.
,2. During s"stems design- the logical data model will be transformed into a %h"sical data
model.
/0. During the requirements %hase- the %h"sical data model is transformed into the logical
data model.
(ationale: During s"stems design- the logical data model will be transformed into a
%h"sical data model.
/1. Another name for the logical data model is the database schema.
(ationale: Another name for the %h"sical data model is the database schema.
/2. The data model is metadata @ that is- it is data about data.
/). The *alue of a 5e" should not change o*er the lifetime of each entit" instance.
/+. The *alue of a 5e" can change o*er the lifetime of each entit" instance.
(ationale: The *alue of a 5e" should not change o*er the lifetime of each entit"
instance.
/,. The *alue of a 5e" can be null.
(ationale: The *alue of a 5e" cannot be null.
//. 7ontrols must be installed to ensure that the *alue of a 5e" is *alid.
/7. An intelligent 5e" is a business code whose structure communicates data about an
entit" instance :such as its classification- si#e or other %ro%erties;.
/0. The authors of "our te1tboo5 recommend the use of intelligent 5e"s since the" can be
quic5l" %rocessed b" humans without the assistance of a com%uter.
/2. Aome e1%erts suggest that "ou a*oid the use of intelligent 5e"s when designing "our
data model. The" argue that because characteristics can change it *iolates the rule that
the *alue of a 5e" should not change o*er the lifetime of each entit" instance.
70. Aerial codes assign sequentiall" generated numbers to entit" instances.
71. Al%habetic codes use finite combinations of letters :and %ossibl" numbers; to describe
entit" instances.
Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition 14"
72. 6n significant %osition codes- each digit or grou% of digits describes a measurable or
identifiable characteristic of the entit" instance.
7). Aignificant %osition codes are frequentl" used to code in*entor" items.
Answer: True Page: 22) LD: 'edium
7+. 8ierarchical codes %ro*ide a to%9down inter%retation for an entit" instance b"
factoring an item into its grou%- subgrou% and so forth.
7,. 6f use9case narrati*es ha*e been written during the requirements anal"sis %hase-
anal"sts can scan them for *erbs to disco*er data attributes and entities.
(ationale: Acan each use9case narrati*e for nouns.
7/. nce the data model has been defined- it is tri*ial to identif" the remaining data
attributes.
(ationale: 6t is not a tri*ial tas5 to identif" the remaining data attributes. To
accom%lish this tas5- it is necessar" to ha*e a thorough understanding of the data
attributes for the s"stem.
77. 'an" organi#ations ha*e naming standards and a%%ro*ed abbre*iations for data
attributes.
70. A good data model is sim%le.
72. A good data model is essentiall" nonredundant.
14# Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
00. 6n a good data mode- each data attribute describes at most one entit".
(ationale: !ach attribute- other than foreign 5e"s- describes at most one entit".
01. A good data model should be fle1ible and ada%table to future needs.
02. A good data model is infle1ible because it is an accurate re%resentation of the business
data requirements.
(ationale: A good data model should be fle1ible and ada%table to future needs.
0). Data anal"sis is a %rocess that %re%ares a logical model for im%lementation as a
redundant- e1%licit- and finite database through a technique called generali#ation.
(ationale: Data anal"sis is a %rocess that %re%ares a data model for im%lementation as
a sim%le- nonredundant- fle1ible and ada%table database through a technique called
normali#ation.
0+. An entit" is in first normal form :1=&; if there are no attributes that can ha*e more
than one *alue for a single instance of the entit".
0,. An entit" is in second normal form :2=&; if it is alread" in 1=& and if the *alues of all
non%rimar" 5e" attributes are de%endent on the full %rimar" 5e" @ not .ust %art of it.
0/. An entit" is in third normal form :)=&; if it is alread" in 2=& and if the *alues of its
non%rimar" 5e" attributes are not de%endent on an" other non%rimar" 5e" attributes.
07. An entit" is in third normal form :)=&; if it is alread" in 2=& and if the *alues of all
non%rimar" 5e" attributes are de%endent on the full %rimar" 5e" @ not .ust %art of it.
Answer: &alse Page: )2) LD: 8ard
(ationale: An entit" is in second normal form :2=&; if it is alread" in 1=& and if the
*alues of all non%rimar" 5e" attributes are de%endent on the full %rimar" 5e" not .ust
%art of it.
00. An entit" is in first normal form :1=&; if the *alues of its non%rimar" 5e" attributes
are not de%endent on an" other non%rimar" 5e" attributes.
Answer: &alse Page: 222 LD: 8ard
(ationale: An entit" is in first normal form :1=&; if there are no attributes that can
ha*e more than one *alue for a single instance of the entit".
02. ne form of )=& ma5es sure that transiti*e de%endencies e1ist in each entit".
Answer: &alse Page: )0+ LD: 8ard
(ationale: Transiti*e de%endenc" is an error that is remo*ed b" )=&.
20. A data9to9location 7(BD matri1 is a table in which the rows indicate entities :and
%ossible attributes;? the columns indicate locations? and the cells :the intersection of
the rows and columns; document le*el of access where 7Ccreate? (Cread? BCu%date?
and DCdelete or deacti*ate.
Answer: True Page: )00 LD: !as"
21. A data9to9location 7(BD matri1 is a table in which garbage *alues that fall outside
the domain of an attribute are identified and used for data *erification.
Answer: &alse Page: )00 LD: 'edium
(ationale: A data9to9location 7(BD matri1 is a table in which the rows indicate
entities :and %ossible attributes;? the columns indicate locations? and the cells :the
intersection of the rows and columns; document le*el of access where 7Ccreate?
(Cread? BCu%date? and DCdelete or deacti*ate.
22. 'an" nons%ecific relationshi%s can be resol*ed into two one9to9man" relationshi%s
using an associati*e entit".
2). A generali#ation hierarch" can be at most two le*els dee%.
(ationale: A generali#ation hierarch" can be an" number of le*els dee%. Aee &igure 09
11.
Multiple Choice Questions
2+. Dhich of the following is a categor" of entitiesE
A; %erson
4; %lace
7; ob.ect
D; conce%t
!; all of these
Answer: ! Page: 271 LD: !as"
2,. A descri%ti*e %ro%ert" or characteristic of an entit" is:
A; a domain
4; an attribute
7; an entit" instance
D; an entit" e1istence
!; none of these
Answer: 4 Page: 272 LD: 'edium
2/. A data t"%e:
A; defines what t"%e of data can be stored in an attribute.
4; could be te1t- number- date- time- "es3no- *alue set or image.
7; consists of com%ound attributes.
D; both :A; and :4;.
!; none of these
Answer: D Page: 272 LD: 'edium
27. Dhat defines what *alues an attribute can legitimatel" ta5e onE
A; realm
4; entit"
7; relationshi%
D; domain
!; none of these
20. The *alue that is recorded in an attribute if a user does not s%ecif" one is 5nown as
the:
A; domain
4; 5e"
7; default *alue
D; data t"%e
!; none of these
Answer: 7 Page: 27) LD: 'edium
22. An attribute or grou% of attributes that assumes a unique *alue for each entit" instance
is a:
A; domain
4; 5e"
7; default *alue
D; data t"%e
!; none of these
100. An" candidate 5e" that is not selected to become the %rimar" 5e" is called:
A; the entit" 5e"
4; the concatenated 5e"
7; the subsetting 5e"
D; the domain 5e"
!; the alternate 5e"
Answer: ! Page: 27+ LD: 'edium
1" Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
101. 6f an em%lo"ee entit" had both an !m%lo"ee6D attribute and a Aocial Aecurit" =umber
attribute- the one that was not used as the %rimar" 5e" would be called a:n;:
A; entit" 5e"
4; concatenated 5e"
7; alternate 5e"
D; candidate 5e"
!; all of these
Answer: 7 Page: 27+ LD: 'edium
102. An attribute or concatenated attribute whose *alues di*ide all entit" instances into
useful subsets is 5nown as:
A; %rimar" criteria
4; secondar" criteria
7; alternate criteria
D; subsetting criteria
!; none of these
Answer: D Page: 27+ LD: 'edium
10). Dhat defines the minimum and ma1imum number of occurrences of one entit" that
ma" be related to a single occurrence of the other entit"E
A; domain
4; concatenation
7; associati*e entit"
D; cardinalit"
!; none of these
Answer: D Page: 27, LD: 'edium
10+. The number of entities that can %artici%ate in a relationshi% is 5nown as:
A; the domain of the relationshi%
4; the cardinalit" of the relationshi%
7; the degree of the relationshi%
D; the association of the relationshi%
!; none of these
Answer: 7 Page: 27, LD: 'edium
Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition 1"1
10,. A ternar" relationshi% is:
A; recursi*e
4; refle1i*e
7; between three entities
D; is not %ossible in data modeling
!; none of these
Answer: 7 Page: 27/ LD: 'edium
10/. An entit" that inherits its %rimar" 5e" from more than one entit" is called a:n;:
A; associati*e entit"
4; concatenated entit"
7; ternar"
D; man"9to9man" cardinalit"
!; none of these
Answer: A Page: 27/ LD: 'edium
107. Dhen a %arent entit" contributes its %rimar" 5e" to become %art of the %rimar" 5e" of
the child entit"- the relationshi% is 5nown as:
A; %rimar"
4; associati*e
7; nonidentif"ing
D; identif"ing
!; none of these
100. A relationshi% where man" instances of one entit" can be associated with man"
instances of another entit" is 5nown as:
A; ternar"
4; man"9to9man"
7; nons%ecific
D; 4 and 7
!; none of these
1"! Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
102. A technique wherein attributes that are common to se*eral t"%es of an entit" are
grou%ed into their own entit" called a su%ert"%e is called:
A; normali#ation
4; generali#ation
7; concatenation
D; com%ound data t"%e
!; none of these
110. An entit" whose instances store attributes that are common to one or more entities is
a:n;:
A; su%ert"%e
4; subt"%es
7; com%ound t"%e
D; default t"%e
!; none of these
Answer: A Page: 20) LD: 'edium
111. The data model for a single information s"stem is usuall" called:
A; the enter%rise data model
4; the logical data model
7; the %h"sical data model
D; the a%%lication data model
!; none of these
112. The %roblem anal"sis %hase model that includes onl" entities and relationshi%s but no
attributes is 5nown as:
A; the enter%rise data model
4; the a%%lication data model
7; the conte1t data model
D; does not e1ist- all data models must ha*e attributes
!; none of these
Answer: 7 Page: 20, LD: 'edium
11). During requirements anal"sis- what order of model de*elo%ment is used to arri*e at
the logical data modelE
A; conte1t data model? full" attributed data model? 5e"9based data model? normali#ed
data model
4; normali#ed data model? conte1t data model? full" attributed data model? 5e"9based
data model
7; normali#ed data model? 5e"9based data model? full" attributed data model? conte1t
data model
D; conte1t data model? 5e"9based data model? full" attributed data model? normali#ed
data model
!; none of these
Answer: D Page: 20,920/ LD: 'edium
11+. Dhich of the following statements is falseE:
A; Data models hel% anal"sts to quic5l" identif" business *ocabular" more
com%letel" than %rocess models.
4; Data models are almost alwa"s built more quic5l" than %rocess models.
7; Data models for e1isting and %ro%osed s"stems are far more similar than %rocess
models for e1isting and %ro%osed s"stems.
D; Data modelers frequentl" get hung u% on unnecessar" details associated with the
data.
!; =one of these.
11,. A true entit":
A; must ha*e onl" one instance
4; must ha*e man" %ossible instances
7; must ha*e a recursi*e relationshi%
D; must ha*e the same cardinalit" and degree
!; all of these
11/. A 5e" *alue whose structure communicates data about an entit" instance:
A; is 5nown as an intelligent 5e".
4; should be a*oided :suggested b" the authors of "our boo5;.
7; is randoml" assigned.
D; can onl" use al%habetic codes.
!; all of these
Answer: A Page: 222 LD: 'edium
1"4 Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
117. A code that assigns sequentiall" generated numbers to entit" instances is 5nown as:
A; a serial code
4; a sequential code
7; an al%habetic code
D; a significant %osition code
!; none of these
110. A code that uses bloc5s of numbers that are di*ided into grou%s that ha*e some
business meaning is 5nown as a:
A; serial code
4; hierarchical code
7; significant %osition code
D; bloc5 code
!; none of these
Answer: D Page: 22) LD: 'edium
112. A code that %ro*ides a to%9down inter%retation for an entit" instance is 5nown as:
A; a serial code
4; a structured code
7; a significant %osition code
D; a hierarchical code
!; none of these
Answer: D Page: 22) LD: 'edium
120. Dhich of the following is =T a guideline for creating a business coding schemeE
A; 7odes should be e1%andable to accommodate growth.
4; The full code must result in redundant *alues for entities.
7; 7odes should be large enough to describe distinguishing characteristics- but small
enough to be inter%reted b" a %erson without a com%uter.
D; 7odes should be con*enient.
!; All of these
Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition 1""
121. Dhich of the following is a criteria for ma5ing a good data modelE
A; A good data model is sim%le.
4; A good data model is essentiall" nonredundant.
7; A good data model should be fle1ible and ada%table to future needs.
D; !ach data attribute should describe at most one entit".
!; All of these.
122. The %rocess that %re%ares a data model for im%lementation as a sim%le- nonredundant-
fle1ible and ada%table database is 5nown as:
A; %rocess anal"sis
4; requirements anal"sis
7; data anal"sis
D; generali#ation
!; none of these
12). The %rocess that %re%ares a data model for im%lementation as a database is 5nown as:
A; conte1tuali#ation
4; normali#ation
7; data anal"sis
D; both normali#ation and data anal"sis
!; none of these
12+. Dhich normal form deals with re%eating attributesE
A; 1=&
4; 2=&
7; )=&
D; all of these
!; none of these
1"# Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
12,. An attribute whose *alue can be calculated from other attributes is called a:n;:
A; com%ound attribute
4; deri*ed attribute
7; domain attribute
D; false attribute
!; none of these
Answer: 4 Page: )02 LD: 'edium
12/. 6n the relationshi% between BA cities and BA states- the state entit" would be:
A; the child
4; the %arent
7; nons%ecific
D; subt"%e
!; su%ert"%e
127. An entit" is in third normal form if:
A; all the *alues of %rimar" 5e"s are inde%endent on the non%rimar" 5e"s.
4; *alues of non%rimar" 5e" attributes are not de%endent on an" other non%rimar"
5e" attributes.
7; *alues of its non%rimar" 5e" attributes are de%endent on an" other non%rimar" 5e"
attributes.
D; "ou add additional non5e" attributes that are de%endent on other non5e" attributes.
!; none of these.
120. Dhich normal form deals with transiti*e de%endenciesE
A; 1=&
4; 2=&
7; )=&
D; all of these
!; none of these
Answer: 7 Page: )0+ LD: 'edium
122. Dhen a non5e" attribute is de%endent on another non5e" attribute :other than b"
deri*ation; is 5nown as:
A; an associati*e de%endenc"
4; a concatenation de%endenc"
7; a transiti*e de%endenc"
D; a deri*ed de%endenc"
!; none of these
Answer: 7 Page: )0+ LD: 'edium
1)0. A table in which rows indicate entities :and %ossible attributes; and the columns
indicate locations- and the cells indicate the document le*el of access including create-
read- u%date or delete is 5nown as:
A; an entit" relationshi% table
4; a transiti*e de%endenc" table
7; a data9to9location 7(BD matri1
D; a decision table
!; none of these
Answer: 7 Page: )00 LD: 'edium
1)1. An entit" relationshi% diagram:
A; is used in data modeling.
4; de%icts data in terms of entities and relationshi%s.
7; identifies the cardinalit" of a relationshi%.
D; ma5es clear the degree of a relationshi%.
!; all of these
1)2. An entit":
A; is something about which the business needs to store data.
4; is a class of %ersons- %laces- ob.ects- e*ents or conce%ts about which we need to
ca%ture and store data.
7; can ha*e man" instances.
D; can ha*e man" attributes.
!; all of these
1"8 Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
1)). !*er" student resides in 0 or 1 dorm. This is an e1am%le of:A; domain
A; default
4; degree
7; cardinalit"
D; nons%ecific relationshi%
1)+. 6n the relationshi% between cities and residents- the resident entit" would be:
A; the child
4; the %arent
7; nons%ecific
D; subt"%e
!; su%ert"%e
1),. Dhich of the following is =T a source for entit" disco*er"E
A; F(P sessions
4; inter*iews with users
7; forms from the e1isting s"stem
D; use9case narrati*es
!; all of these can be used as sources
Answer: ! Page: 202 LD: 'edium
Fill in the Blank Questions
1)/. A:n; GGGGGGGGGGGGGGGGGGGGGGGG is a %iece of data that we want to store about each
instance of a gi*en entit".
Answer: attribute Page: 272 LD: 'edium
1)7. The three %ro%erties of an attribute are: GGGGGGGGGGGGGGGGGGGGGGGGGGG-
GGGGGGGGGGGGGGGGGGGGGGG- and GGGGGGGGGGGGGGGGGGGGGGGGGGGGG.
Answer: data t"%e- domain and default Page: 272927) LD: 8ard
1)0. The GGGGGGGGGGGGGGGGGGGGGGGGGGG defines what *alues an attribute can
legitimatel" ta5e.
Answer: domain Page: 272 LD: 'edium
1)2. The GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG is the *alue that will be recorded for an
attribute if a user does not s%ecif" one.
Answer: Default *alue Page: 27) LD: 'edium
1+0. !*er" entit" must ha*e GGGGGGGGGGGGGGGGGGGGGGGGGG.
Answer: an identifier or a 5e" Page: 27) LD: 'edium
1+1. A grou% of attributes that uniquel" identifies an instance of an entit" is called a:n;
GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG.
Answer: concatenated 5e" Page: 27) LD: 'edium
1+2. A candidate 5e" is the candidate to become the GGGGGGGGGGGGGGGGGGGGGGGGGGG of
instances of an entit".
Answer: %rimar" 5e" or identifier Page: 27+ LD: 'edium
1+). A:n; GGGGGGGGGGGGGGGGGGGGGGGGGGGGG is a natural business association that e1ists
between one or more entities.
Answer: relationshi% Page: 27, LD: 'edium
1++. All relationshi%s are im%licitl" GGGGGGGGGGGGGGGGGGGGGGGGGGGGG.
Answer: bi9directional Page: 27, LD: 'edium
1+,. GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG defines the minimum and ma1imum number
of occurrences of one entit" for a single occurrence of the related entit".
Answer: 7ardinalit" Page: 27, LD: 'edium
1+/. The GGGGGGGGGGGGGGGGGGGGGGGGGGG of a relationshi% is the number of entit" classes
that %artici%ate in the relationshi%.
Answer: Degree Page: 27, LD: 'edium
1+7. A:n; GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG relationshi% is where a relationshi% e1ists
between different instances of the same entit".
Answer: recursi*e or unar" Page: 27/ LD: 8ard
1# Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
1+0. A:n; GGGGGGGGGGGGGGGGGGGGGGGGGGGGG relationshi% is the most common t"%e-
where two entities %artici%ate.
Answer: binar" Page: 27, LD: 8ard
1+2. A:n; GGGGGGGGGGGGGGGGGGGGGGGGGGGGG relationshi% is one between three different
entities.
Answer: ternar" Page: 27/ LD: 'edium
1,0. A:n; GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG relationshi% is where man" instances of
one entit" are associated with man" instances of another entit".
Answer: man"9to9man" or non s%ecific relationshi%. Page: 272 LD: 8ard
1,1. A:n; GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG entit" is an entit" that inherits its
%rimar" 5e" from more than one other entit" :%arents;. !ach %art of that concatenated
5e" %oints to one and onl" one instance of each of the connecting entities.
Answer: associati*e Page: 27/ LD: 'edium
1,2. A:n; GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG 5e" is a %rimar" 5e" of one entit" that is
contributed to :du%licated in; another entit" to identif" instances of a relationshi%.
Answer: foreign Page: 277 LD: 'edium
1,). GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG relationshi%s are those in which each of the
%artici%ating entities has its own inde%endent %rimar" 5e".
Answer: =onidentif"ing Page: 270 LD: 'edium
1,+. GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG is an a%%roach that see5s to disco*er and
e1%loit the commonalties between entities.
Answer: >enerali#ation Page: 20) LD: 8ard
1,,. GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG is a technique where the attributes are grou%ed
to form entit" su%ert"%es and subt"%es.
Answer: generali#ation Page: 20) LD: 8ard
Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition 1#1
1,/. A GGGGGGGGGGGGGGGGGGGGGGGGGGG is an entit" whose instances store attributes that
are common to one or more entit" subt"%es.
Answer: su%ert"%e Page: 20) LD: 'edium
1,7. A GGGGGGGGGGGGGGGGGGGGGGGGGGG is an entit" whose instances inherit some common
attributes from an entit" su%ert"%e and then add other attributes that are unique to its
instance.
Answer: subt"%e Page: 20) LD: 'edium
1,0. Another name for an alternate 5e" is GGGGGGGGGGGGGGGGGGGGGGGGGGGGGG 5e".
Answer: secondar" Page: 27+ LD: 'edium
1,2. A GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG is an attribute :or concatenated
attribute; whose finite *alues di*ide all entit" instances into useful subsets.
Answer: subsetting criteria or in*ersion entr" Page: 27+ LD: 8ard
1/0. A:n; GGGGGGGGGGGGGGGGGGGGGG data model contains onl" entities and relationshi%s-
but no attributes.
Answer: conte1t Page: 20, LD: 'edium
1/1. GGGGGGGGGGGGGGGGGGGGGGGGG is data about the business$s data.
Answer: 'etadata Page: 20/ LD: 'edium
1/2. GGGGGGGGGGGGGGGGGG codes assign sequentiall" generated numbers to entit"
instances.
Answer: Aerial Page: 222 LD: 8ard
1/). GGGGGGGGGGGGGGGGGG codes assign numbers that ha*e been di*ided into grou%s based
on some business meaning.
Answer: 4loc5 Page: 22) LD: 8ard
1/+. GGGGGGGGGGGGGGGGGGGGGG codes use finite combinations of letters or numbers to
describe entit" instances.
Answer: al%habetic or al%hanumeric Page: 22) LD: 'edium
1#! Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition
1/,. 6n GGGGGGGGGGGGGGGGGGGGGGGG codes - each digit or grou% of digits describes a
measurable or identifiable characteristic of the entit" instance.
Answer: significant %osition Page: 22) LD: 'edium
1//. GGGGGGGGGGGGGGGGGGGGGGGGGG codes %ro*ide a to%9down inter%retation for an entit"
instance.
Answer: 8ierarchical Page: 22) LD: 8ard
1/7. GGGGGGGGGGGGGGGGGGGGGGGGGGGG is a %rocess that %re%ares a data model for
im%lementation as a sim%le- nonredundant- fle1ible and ada%table database.
Answer: Data anal"sis or normali#ation Page: 222 LD: 'edium
1/0. GGGGGGGGGGGGGGGGGGGGGGGGG is a data anal"sis technique that organi#es data
attributes such that the" are grou%ed to form nonredundant- stable- fle1ible- and
ada%ti*e entities.
Answer: =ormali#ation Page: 222 LD: 'edium
1/2. GGGGGGGGGGGGGGGGGGGGGGGG attributes are those whose *alues can either be
calculated from other attributes or deri*ed through logic from the *alues of other
attributes.
Answer: Deri*ed Page: )02 LD: 'edium
170. GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG is a technique for organi#ing and
documenting a s"stem$s data.
Answer: Data 'odeling Page: 270 LD: 'edium
171. Data modeling is sometimes called GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG because
a data model is usuall" im%lemented as a database.
Answer: database modeling Page: 270 LD: 'edium
172. A:n; GGGGGGGGGGGGGGGGGGGGGGGGG is something that the business needs to store data.
Answer: !ntit" Page: 271 LD: 'edium
Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition 1#3
17). 7ategories of GGGGGGGGGGGGGGGGGGGGGGG include: %ersons- %laces- ob.ects- e*ents or
conce%ts.
Answer: entities Page: 271 LD: 'edium
17+. 7ategories of entities include: GGGGGGGGGGGG- GGGGGGGGGGGGGGG- GGGGGGGGGGGGGGG-
GGGGGGGGGGGGGGGGGGGGGGG- or GGGGGGGGGGGGGGGGGGGGGG.
Answer: %ersons- %laces- ob.ects- e*ents- or conce%ts Page: 271 LD: 'edium
17,. The entit" on the <man"< side of a one9to9man" relationshi% is called the
GGGGGGGGGGGGG.
Answer: child Page: 277 LD: 'edium
1#4 Whitten/Bentley, Systems Analysis & Design Methods, Seventh Edition

Chap 008 Database Design

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Chap 008 Database Design

Загружено:

Авторское право:

Доступные форматы

Chapter 8 Data Modeling and Analysis

Вам также может понравиться