MCQ m8

System Analysis and Design/ Logical Database Design Multiple Choice Questions
8.1.1 An entity is
(1) a collection of items in an application
(2) a distinct real world item in an application
(3) an inanimate object in an application
(4) a data structure
8.1.2 Pick entities from the following:
(1) vendor
(2) student
(3) attends
(4) km/hour
(a i! ii! iii (b i! ii! i"
(c i and ii (d iii and i"
8.1.3 A relationship is
(1) an item in an application
(2) a meaningful dependency between entities
(3) a collection of related entities
(4) related data
8.1.4 Pick the relationship from the following:
(1) a classroom
(2) teacher
(3) attends
(4) cost per do#en
8.1.5 Pick the meaningful relationship between entities
(1) "endor supplies goods
(2) "endor tal$s with customers
(3) "endor complains to "endor
(4) "endor as$s prices
8.1.6 The entity set is a
(1) set of entities
(2) collection of different entities
(3) collection of related entities
(4) collection of similar entities
8.1.7 Pick entity set from the following
(1) all "endors supplying to an organi#ation
(2) "endors and organi#ations they supply
(3) "endors and transporters
(4) a "endor supplying to many organi#ations
8.1.8 Attributes are
(9) properties of relationship
(35)attributed to entities
(61) properties of members of an entity set
(a i (b i and ii
(c i and iii (d iii
8.1. The attributes of relationship teaches in teacher teaches course should be
%& 'ajaraman/((Sc& )angalore M*/%+/,uly
-./+
(1) teacher code! teacher name! dept! phone no
(2) course no! course name! semester offered! credits
(3) teacher code! course no! semester no
(4) teacher code! course no! teacher name! dept! phone no
8.1.10 The e!pansion of "#$ diagram is
(1) /ntity0'elationship diagram
(2) /ntity0'elati"e diagram
(3) /ntity0'elation diagram
(4) /ntity0'ationali#ed diagram
8.1.11%n an "#$ diagram entities are represented by
(1) circles
(2) rectangles
(3) diamond shaped bo1
(4) ellipse
8.1.12 %n an "#$ diagram relationship is represented by
(1) circles
(2) rectangles
(3) diamond shaped bo1
(4) ellipse
8.1.13 "ntities are identified from the word statement of a problem by
(1) pic$ing words which are adjecti"es
(2) pic$ing words which are nouns
(3) pic$ing words which are "erbs
(4) pic$ing words which are pronouns
8.1.14 $elationships are identified from the word statement of a problem by
(1) pic$ing words which are adjecti"es
(2) pic$ing words which are nouns
(3) pic$ing words which are "erbs
(4) pic$ing words which are pronouns
8.1.15 &ne entity may be
(1) related to only one other entity
(2) related to itself
(3) related to only two other entities
(4) related to many other entities
8.2.1 'y relation cardinality we mean
(1) number of items in a relationship
(2) number of relationships in which an entity can appear
(3) number of items in an entity
(4) number of entity sets which may be related to a gi"en entity
8.2.2 %f an entity appears in only one relationship then it is
(1) a +2+ relationship
(2) a +23 relationship
(3) a 32+ relationship
(4) a 32M relationship
-./4
8.2.3 %f an entity appears in ( relationships then it is
(1) a +2+ relationship
(2) a +23 relationship
(3) a 32+ relationship
(4) a 32M relationship
8.2.4 %f an entity appears in not more than ) relationships then it is a
(1) +2+ relationship
(2) +25 relationship
(3) 52+ relationship
(4) 525 relationship
8.2.5 A pilot can fly three types of planes and a plane can be piloted by any *ualified
pilot. The pilot#plane type relationship is
(1) 326
(2) 623
(3) +26
(4) 62+
8.2.6 A student can take not more than ) sub+ects in a semester. The number of
students allowed in a sub+ect in a semester is not more than ,-. The student
. sub+ect relationship is:
(1) 52.-
(2) .-25
(3) 325
(4) .-2M
8.2.7 The following "#$ diagram is interpreted as follows:
(1) A doctor treats upto 3 patients
(2) A doctor treats e1actly 3 patients
(3) A doctor may treat upto 3 patients7 Some doctors may not treat any patients
(4) A doctor will treat patients based on some conditions
/octor
Treat
Patients
-./6
8.2.8 A relation is
(1) an entity
(2) a relationship
(3) members of a relationship set
(4) members of an entity set or a relationship set
8.2.9 $ows of a relation are called
(1) tuples
(2) a relation row
(3) a data structure
(4) an entity
8.2.10 The rows of a relation
(1) must be in specified order
(2) may be in any order
(3) in ascending order of $ey
(4) in descending order of $ey
8.2.11 The columns of a relation
(1) must be in specified order
(2) may be in any order
(3) with $ey field in first column
(4) with largest width column last
8.2.12 $elations are used in logical database design because
(1) sound theory of relations facilitates systematic design of relational
databases
(2) they are very popular
(3) they are flat files and easy to store and retrieve from computer0s
memory
(4) "#$ diagrams allow design of relations
(a i and ii (b i and iii
(c ii and iii (d iii and i"
8.3.1 (ormali1ation is a process of restructuring a relation to
(1) minimi#e duplication of data in a database
(2) ma1imi#e duplication of data to ensure reliability
(3) ma$e it of uniform si#e
(4) allow addition of data
8.3.2 (ormali1ation of database is essential to
(1) a"oid accidental deletion of re8uired data when some data is deleted
(2) eliminate inconsistencies when a data item is modified in the database
(3) allows storage of data in a computer9s dis$
(4) use a database management system
(a i and iii (b i and ii
(c ii and iii (d ii and i"
8.3.3 The process of normali1ation
(1) is automatic using a computer program
(2) re8uires one to understand dependency between attributes
-./.
(3) is manual and re8uires semantic information
(4) is finding the $ey of a relation
8.3.4 The following relation is not normali1ed because
Roll no Name Courses taken
Course No Dept Sem
.5:* A&) Moni CS +-+ C&S& +
// 5.5 /&/& 4
;hy 645 ;hysics +
.*<. '& Chamnlal ;hy +-+ ;hysics +
Chem4-4 Chemistry 4
Math +-6 Math& +
CS +-+ C&S& +
.<5. '& =upta CS +-+ C&S& +
(1) (t is difficult to store due to non>uniform si#e of the attributes
(2) 'oll no& .5:* ha"e 6 course line whereas 'oll no& .<5. has only one course
line
(3) ?he composite attribute (CS +-+! C&S&! + is repeated
(4) Some item lines ha"e composite attributes
8.3.5 The relation given in "!ercise 1-.,., may be converted to 1 (2 relation by
(1) eliminating composite attributes
(2) eliminating common attributes
(3) duplicating common attributes as many times as lines in corresponding
attributes
(4) putting composite attributes in a separate table
8.3.6 A relation is said to be in 1(2 if
(1) there is no duplication of data
(2) there are no composite attributes in the relation
(3) there are only a few composite attributes
(4) all attributes are of uniform type
8.3.7 The number of normal forms which has been proposed and discussed in the
book are
(a 6 (b .
(c 5 (d :
8.3.8 A relation which is in a higher normal form
(1) implies that it also 8ualifies to be in lower normal form
(2) does not necessarily satisfy the conditions of lower normal form
(3) is included in the lower normal form
(4) is independent of lower normal forms
8.3.9 3iven an attribute !4 another attribute y is dependent on it4 if for a given !
(1) there are many y "alues
(2) there is only one "alue of y
(3) there is one or more y "alues
(4) there is none or one y "alue
%& 'ajaraman/((Sc& )angalore M*/%+/,uly -./5
8.3.10 An attribute y may be functionally dependent on
(1) a composite attribute !4y
(2) a single attribute !
(3) no attribute
(a i and ii (b i and iii
(c ii and iii (d iii
8.5.11A second (ormal 2orm 67 (28 relation should
(1) be in + 3@
(2) not ha"e a composite $ey
(3) not ha"e attributes dependent on $ey attribute
(4) not ha"e attributes dependent on one another
8.3.12 A relation is said to be in 7 (2 if
(1) it is in 1 (2
(2) non#key attributes dependent on key attribute
(3) non#key attributes are independent of one another
(4) if it has a composite key4 no non#key attribute should be dependent on
part of the composite key
(a i! ii! iii (b i and ii
(c i! ii! i" (d i! i"
8.5.15 3iven the following relation
"endor order ("endor no! order no! "endor name! 8ty supplied! price/unit it is not
in 4 3@ because
(1) it is not in + 3@
(2) it has a composite $ey
(3) non0$ey attribute "endor name is dependent on "endor no& which is one part
of the composite $ey
(4) Qty supplied and price/unit are dependent
8.5.1, 3iven the following relation
"endor order ("endor no! order no! "endor name! 8ty supplied ! price/unit the
second normal form relations are
(1) "endor ("endor no! "endor
name 8ty (8ty supplied!
price/unit order (order no! 8ty
supplied
(2) "endor ("endor no! "endor name order
(order no! 8ty supplied! price/unit
(3) "endor ("endor no! "endor name order
(order no! 8ty supplied! price/unit
"endor order ("endor no! order no
(4) "endor ("endor no! "endor name! 8ty supplied! price/unit
"endor order (order no! "endor no
8.5.1)A third (ormal 2orm 65 (28 relation should
(1) be in 4 3@
(2) not ha"e complete $ey
(3) not be + 3@
(4) should not ha"e non0$ey attributes depend on $ey attribute
-./:
8.5.19A relation is said to be in 5 (2 if
(1) it is in 7 (2
(2) non#key attributes are independent of one another
(3) key attribute is not dependent on part of a composite key
(4) has no multi#valued dependency
(a i and iii (b i and i"
(c i and ii (d ii and i"
8.3.17 3iven the following relation it is not 5 (2 because
:tudent 6roll no4 name4 course no4 course ma!. marks4 year of study4
address8
(1) it is not in 4 3@
(2) it does not ha"e composite $ey
(3) non0$ey attributes course no and course ma1& mar$s are functionally
dependent
(4) it has more than 6 non0$ey attributes
8.5.183iven the following relation
:tudent 6roll no4 name4 course no4 course ma!. marks4 year of study4
address8
The corresponding 5 (2 relations are
(1) student (roll no! name! year of study! address
course (course no! course ma1& mar$s
(2) student ( roll no! name! year of study! address
student (roll no! course no
(3) student (roll no ! name! address
year (roll no! year of study
(4) student (roll no! name! address
course (course no! course ma1& mar$s! year of study
8.3.19 'oye ;odd (ormal 2orm 6';(28 is needed when
(1) two non0$ey attributes are dependent
(2) there is more then one possible composite $ey
(3) there are two or more possible composite o"erlapping $eys and one attribute
of a composite $ey is dependent on an attribute of another composite $ey
(4) there are two possible $eys and they are dependent on one another
8.3.20 A relation is said to be in ';(2 when
(1) it has o"erlapping composite $eys
(2) it has no composite $eys
(3) it has no multi"alued dependencies
(4) it has no o"erlapping composite $eys which ha"e related attributes
8.3.21 A 5 (2 relation is converted to ';(2 by
(1) remo"ing composite $eys
(2) remo"ing multi"alued dependencies
(3) dependent attributes of o"erlapping composite $eys are put in a separate
relation
-./A
(4) dependent non0$ey attributes are put in a separate table
8.3.22 ';(2 is needed because
(1) otherwise tuples may be duplicated
(2) when a data is deleted tuples may be lost
(3) updating is otherwise difficult
(4) when there is dependent attributes in two possible composite $eys one of the
attributes is unnecessarily duplicated in the tuples
8.3.23 3iven the relation
:upplier6s<id4 p<order4 s<name4 *ty8
3iven that there is a uni*ue s<name for each s<id and that s<id4 p<order is a
composite key4 find the correct statement among the following:
(1) this relation is a ';(2
(2) this is 5 (2 relation
(3) this is a 7 (2 relation
(4) this is a 1 (2 relation
(a i and ii (b ii and iii
(c i and i" (d i and iii
8.3.24 3iven the relation of "!ercise 1-.=.) it is reduced to the following ';(2
relation
(1) Supplier (sBids! sBname
;urchase (sBid! pBorder! 8ty
(2) Supplier (sBid! sBname
;urchase (pBorder! 8ty
(3) ;urchase (sBid! pBorder
Supplier (sBname! 8ty
(4) Supplier (sBid! sBname! 8ty
;urchase (sBid! pBorder
8.3.25 2ourth normal form 6, (28 relations are needed when
(1) there are multi"alued dependencies between attributes in composite $ey
(2) there are more than one composite $ey
(3) there are two or more o"erlapping composite $eys
(4) there are multi"alued dependency between non0$ey attributes
8.3.26 A 5 (2 relation is split into , (2
(1) by remo"ing o"erlapping composite $eys
(2) by splitting into relations which do not ha"e more than one independent
multi"alued dependency
(3) remo"ing multi"alued dependency
(4) by putting dependent non0$ey attribute in a separate table
8.3.27 A relation pro+ect guidance
Pro+ect 3uidance6professor4 pro+ect4 student no. st#name4 dept8
A professor can give many pro+ects to many students
A pro+ect will have many students
A pro+ect may be guided by many professors
The , (2 relation corresponding to this are
-./*
(1) ;rofB;roject (professor! stBname! dept
;rojBstud (project! student no&
(2) ;rofBstud (professor! student no
;rojBstud (project! student no
Student (student no! stBname! dept
(3) Student (student no! stBname! dept
;rofessor(professor! project
(4) ;rofessor( professor! project! dept
Student (student no! stBname! dept
8.3.28 The pro+ect guidance relation of "!ercise 1-.8.5 needs further normali1ation
to ) (2 because
(1) ?here are too many multi"alued dependencies
(2) Multi"alued dependency and simple dependency are mi1ed in the . 3@
relation
(3) Spurious tuples got introduced when the . 3@ relations are combined due to
the fact that a professor can guide only specified projects
(4) . 3@ relations ha"e composite $eys
8.3.29 ) (2 relations e*uivalent to the relation of "!ercise 1-.8.5 are
(1) ;rofBstud (professor! studentBno
;rojBstud ( project! studentBno
;rofBproj (professor! project
Student (studentBno! stBname! dept
(2) ;rofessor (professor! professor details
;roject (project no! project details
;rofBproj (professor! project
StudBproj (studentBno! project
8.4.1 The &$/"$ P>A;"/ 2&$ relation in ?ini#case e!ample 1 has the
composite key order no4 item code because
(1) item code has a multi"alued dependency with order no&
(2) the non0$ey attributes are dependent on the composite $ey order no! item
code
(3) if order no is the only $ey we cannot find 8ty& ordered! price/unit! deli"ery
time
(4) if item code is the only $ey we cannot find order no& uni8uely
8.4.2 The relation :@PP>%": in ?ini#case e!ample 1 of :ection 1-.1- re*uires
normali1ation because
(1) it has a composite $ey with three attributes
(2) the non0$ey attributes are dependent on part of composite $ey
(3) the attributes item code and order no of the composite $ey ha"e multi"alued
dependency
(4) "endor code and order no ha"e a multi"alued dependency
-./<
8.4.3 T"A;A":#;&@$:": relation in ?ini#case e!ample 7 is in
(1) 6 3@& Does not need any further normali#ation
(2) )C3@
(3) . 3@
(4) unnormali#ed form
8.4.4 T"A;A"$#:T@/"(T relation in ?ini#case e!ample 7 is re*uired because
(1) it is in 6 3@
(2) it has a multi"alued $ey
(3) it has a composite $ey with multi"alued dependency relation
(4) Cithout this relation database is incomplete and some 8ueries cannot be
answered
8.5.1 'y redundancy in a file based system we mean that
(1) unnecessary data is stored
(2) same data is duplicated in many files
(3) data is una"ailable
(4) files ha"e redundant data
8.5.2 /ata integrity in a file based system may be lost because
(1) the same "ariable may ha"e different "alues in different files
(2) files are duplicated
(3) unnecessary data is stored in files
(4) redundant data is stored in files
8.5.3 /ata availability is often difficult in file based system
(1) as files are duplicated
(2) as unnecessary data are stored in files
(3) as one has to search different files and these files may be in different update
states
(4) redundant data are stored in files
8.5.4 ?anagement policy changes are difficult to implement in a file based system
because
(1) relating data in different files is difficult
(2) files are duplicated
(3) redundant data are stored
(4) unnecessary data is stored
8.5.5 :ome of the ob+ectives of a database management system are to
(1) minimi1e duplication of data
(2) ensure centrali1ed management control of data
(3) ease retrieval of data
(4) maintain a data dictionary
(a i and ii (b i! ii and i"
(c i and iii (d i! ii and iii
8.5.6 A database is a
(1) collection of files
(2) collection of inputs and outputs of application
(3) collection of related data necessary to manage an organi#ation
(4) data resource of an organi#ation
-./+-
8.5.7 A database models data so that it is
(1) appropriate for application
(2) independent of application program
(3) optimi#ed for most fre8uent applications
(4) optimi#ed for all applications
8.5.8 A database should be designed to allow providing
(1) different "iews of portions of data re8uested by an application
(2) data only to selected applications as decided by an organi#ation
(3) a uniform "iew of data to all applications
(4) data to all applications
8.5.9 The abbreviation /'?: stands for
(1) Data )ase Manipulation System
(2) Data )an$ Manipulating System
(3) Data )ase Management System
(4) Data )an$ Management System
8.5.10 A /'?: is
(1) another name for database system
(2) independent of a database
(3) dependent on application programs
(4) is a set of procedures which manage a database
8.5.11 A /'?:
(1) is a set of procedures
(2) manages a database
(3) is a set of procedures to manage a database to pro"ide data as re8uired by
applications
(4) pro"ides data to applications
8.5.12 &ne of the main ob+ectives of a /'?: is to
(1) Create a database for an organi#ation
(2) @acilitate sharing of a database by current and future applications
(3) Allow sharing application programs
(4) 'eplace file based systems
8.5.13 /atabase is
(1) an important resource of an organi#ation
(2) not rele"ant to e1isting programs
(3) not rele"ant for future programs
(4) not as good as files as there is redundancy
8.5.14 'y data independence we mean application programs
(1) do not need data
(2) may be de"eloped independent of data
(3) may be de"eloped without $nowing the organi#ation of data
(4) may be de"eloped with independent data
8.5.15 /ata independence allows
(1) no changes in application programs
(2) change in database without affecting application programs
-./++
(3) hardware to be changed without affecting application programs
(4) system software to be changed without affecting application programs
(a i! ii (b ii! iii
(c ii! iii! i" (d i! ii! i"
8.5.16 /ata independence allows
(1) sharing the same database by se"eral applications
(2) e1tensi"e modification of applications
(3) no data sharing between applications
(4) elimination of se"eral application programs
8.5.17 Among ob+ectives of /'?: are ensuring
(1) data integrity
(2) data redundancy
(3) data security
(4) easy data retrieval
(a i! ii (b i! iii
(c i! iii! i" (d i! ii! iii
8.5.18 /'?:
(1) does not allow replication of data
(2) allows controlled replication of data if it impro"es performance
(3) does not allow common data to be duplicated
(4) does not allow replication as it ad"ersely affects reliability
8.5.19 'y data integrity we mean
(1) maintaining consistent data "alues
(2) integrated data "alues
(3) banning improper access to data
(4) not lea$ing data "alues
8.5.20 /ata integrity is ensured by
(1) good data editing
(2) propagating data changes to all data items
(3) pre"enting unauthori#ed access
(4) pre"enting data duplication
8.5.21 'y data security in /'?: we mean
(1) pre"enting access to data
(2) allowing access to data only to authori#ed users
(3) pre"enting changing data
(4) introducing integrity constraints
8.5.22 /'?: must implement management controls to
(1) control access rights to users
(2) implement audit trail when changes are made
(3) allow data to be used e!tensively in the organi1ation
(4) duplicate databases
(a i! ii (b ii! iii
(c iii! i" (d i! i"
8.9.1An "#$ modelling for given application leads to
-./+4
(1) conceptual data model
(2) logical data model
(3) e1ternal data model
(4) internal data model
8.9.7A conceptual data model is converted using a $elational /ata 'ase
?anagement :ystem to a
(1) logical data model
(4) an entity0relation data model
8.9.5A subset of logical data model accessed by programmers is called a
(4) an entity0relation data model
8.9.,Bhen a logical model is mapped into a physical storage such as a disk store the
resultant data model is known as
(4) dis$ data model
8.9.)A /'?: has the following components
(1) a data definition language
(2) a *uery language
(3) a security system
(4) audit trail
(a i! ii (b i! ii! iii
(c i! ii! iii! i" (d i! ii! i"
8.9.9A check pointing system is needed
(1) to ensure system security
(2) to reco"er from transient faults
(3) to ensure system pri"acy
(4) to ensure system integrity
8.6.7 A database administrator
(1) administers data in an organi#ation
(2) controls all inputs and all outputs of programs
(3) is controller of data resources of an organi#ation
(4) controls all data entry operators
8.6.8 The responsibilities of a database administrator includes
(1) maintenance of data dictionary
(2) ensuring security of database
(3) ensuring privacy and integrity of data
(4) obtain an "#$ model
-./+6
(c i! ii! iii! i" (d ii! iii! i"
8.6.9 Access right to a database is controlled by
(1) top management
(2) system designer
(3) system analyst
(4) database administrator
8.6.10 The se*uence followed in designing a /'?: are
(1) physical model conceptual model logical model
(2) logical model physical model conceptual model
(3) conceptual model logical model physical model
(4) conceptual model physical model logical model
8.6.11 /esigning physical model of /'?: re*uires information on
(1) data volume
(2) fre*uency of access to data
(3) programming language used
(4) secondary memory characteristics
(c i! ii! iii! i" (d i! ii! i"
8.9.17A good database design
(1) caters primarily to current needs
(2) caters to current and future needs as organi1ations grow
(3) has to be modified when hardware is upgraded
(4) ensures data security
(c ii! i" (d iii! i"
8.6.13 A good database design
(1) is e!pandable with growth and changes in organi1ation
(2) easy to change when software changes
(3) ensures data integrity
(4) allows access to only authori1ed users
(a i! ii (b ii! iii
(c i! ii! iii! i" (d i! ii! iii
-./+.
Dey ?o Ebjecti"e Questions
8.1.1 b 8.1.7 c 8.1.5 b 8.1., c 8.1.) a 8.1.9 d
8.1.= a 8.1.8 c 8.1. c 8.1.1- a 8.1.11 b 8.1.17 c
8.1.15 b 8.1.1, c 8.1.1) d 8.7.1 b 8.7.7 a 8.7.5 b
8.7., b 8.7.) a 8.7.9 b 8.7.= c 8.7.8 d 8.7. a
8.7.1- b 8.7.11 b 8.7.17 b 8.5.1 a 8.5.7 b 8.5.5 b
8.5., d 8.5.) c 8.5.9 b 8.5.= d 8.5.8 a 8.5. b
8.5.1- a 8.5.11 a 8.5.17 c 8.5.15 c 8.5.1, c 8.5.1) a
8.5.19 c 8.5.1= c 8.5.18 b 8.5.1 c 8.5.7- d 8.5.71 c
8.5.77 d 8.5.75 d 8.5.7, a 8.5.7) a 8.5.79 b 8.5.7= b
8.5.78 c 8.5.7 a 8.,.1 a 8.,.7 c 8.,.5 a 8.,., d
8.).1 b 8.).7 a 8.).5 c 8.)., a 8.).) d 8.).9 c
8.).= b 8.).8 a 8.). c 8.).1- d 8.).11 c 8.).17 b
8.).15 a 8.).1, c 8.).1) c 8.).19 a 8.).1= c 8.).18 b
8.).1 a 8.).7- b 8.).71 b 8.).77 a 8.9.1 a 8.9.7 a
8.9.5 b 8.9., c 8.9.) c 8.9.9 b 8.9.= c 8.9.8 b
8.9. d 8.9.1- c 8.9.11 d 8.9.17 c 8.9.15 c
-./+5

MCQ m8

Загружено:

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

Исходное описание:

Оригинальное название

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

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

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

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

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

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

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

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

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

MCQ m8

Загружено:

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

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

System Analysis and Design/ Logical Database Design Multiple Choice Questions

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