Microsoft 98-364 Exam Reduce Your Chances of Failure

Microsoft 98-364-DEMO Microsoft Database Fundamentals Fundamentals

To purchase Full version of ractice e!am clic" belo#$

http://www.prepare4result.com/98-364-practice-exam.html

Our Exclusive quality products provide an opportune way to overcome all the concerns and worries. Superior quality is the prominent aspect that is never nev er com compro promis mised ed by us, del delive iverin ring g a che cheris rishin hing g exp experi erienc ence e for our custom cus tomers ers.. Su Surel rely; y; ou our r pro produc ducts ts sta stand nd wa way y ahe ahead ad of all ot other her oe oers, rs, serving the customers with ever best quality. quality.  Our !"#$%& 'rac 'ractice tice (est produ products cts assur assure e )irst#ra )irst#rated ted quali quality ty..  !"# !"#$%& $%& *ues *uesti tion ons s an and d +n +nsw swer ers s ' ') ), te test sted ed and appro approve ved d by senio senior r pros.  -/ acc accura uracy cy,, the the hall hall mar0 mar0 of of our our !"#$%& !"#$%& ') ') produ products cts..  1o 1omp mple lete te co cove vera rage ge on !"# !"#$% $%& & ex exam am..  2p to to ate ate pro produ duct cts, s, rel relia iable ble an and d veri veri3e 3ed. d.

Prepare4Result - 98-364 98-364 Exam Exam Questions and Answers

1

(housands (housa nds have cli climbe mbed d the ladder ladder of suc succes cess s wit with h ou our r !"# !"#$%& $%& exa exam m products, produc ts, prepare with our masterly crafted crafted !"#$%& exam products and give surety to a rising career. 4emar0able success record is ample proof for our unmatched competence.


2

%uestion& ' John wors as a !ata"ase Administrator #or $luewell %n&' (he &ompan) has a *Q+ *er,er data"ase' A ta"le in the data"ase has a &andidate e) and an attri"ute that is not a &onstituent o# the &andidate e)' (he non-e) attri"ute depends upon the whole o# the &andidate e) rather than ust a part o# it' .hi&h o# the #ollowin/ normal #orms is represented in the s&enario0 A' 4  $' 2  ' 1  !' 3 

(ns#er& ) Explanation *e&ond normal #orm 52 is used in data"ase normali7ation' A ta"le that is in rst normal #orm must meet additional &riteria i# it is to uali#) #or se&ond normal #orm' *pe&i&all): a 1 ta"le is in 2 i# and onl) i#: /i,en an) &andidate e) and an) attri"ute that is not a &onstituent o# a &andidate e): the non-e) attri"ute depends upon the whole o# the &andidate e) rather than ust a part o# it'

(ns#er& * is incorrect' (he 1 is a normali7ation #orm in whi&h ea&h &olumn in a row &ontains a sin/le ,alue: i'e': ea&h attri"ute o# the entit) is sin/le ,alued' *in/le *in/le ,alued ,alued attri" attri"ute utes s are are also also nown nown as atomi& atomi& attri" attri"ute utes: s: as the) the) &annot &annot "e de&omposed into smaller units' (here are mainl) three inds o# attri"utes that pre,ent a ta"le #rom "ein/ in the rst normal #orm' (he) are as #ollows omposite attri"utes Plural attri"utes 5attri"utes that ha,e more than one ,alue Attri"utes with &omplex data t)pes (he ta"le "elow is in 1 : as all the &olumns in ea&h row row &ontain a sin/le ,alue' ,alue'

(ns (n s#er #er&& D is in inco corr rrec ectt'

(hir (hird d nor normal mal #or #orm 53 53 is used used in data data"a "ase se normali7ation' A ta"le is in 3 i# and onl) i# the relation * 5ta"le is in se&ond normal #orm 52 and e,er) non-prime attri"ute o# * is non-transiti,el) dependent on e,er) e) o# *'


3

(ns#er& ( is incorrect ' ourth normal #orm 54 is a normal #orm used in data"ase normali7ation' %ntrodu&ed ") Ronald a/in in 19;;: 4 is the next le,el o# normali7ation a#ter $o)&e-odd normal #orm 5$' .hereas the se&ond: third: and $o)& $o)&ee-o odd dd norm normal al #orm #orms s are are &on& &on&er erne ned d with with #un& #un&ti tion onal al depe depend nden en&i &ies es:: 4 4 is &on& &on&er erne ned d with ith a mor more /ene /enera rall t)pe t)pe o# depe depend nden en&) &) now nown n as a mult multi, i,al alue ued d dependen&)' *)m"oli&all): it &an "e represented as #ollows %# A -< < $=: then A -< $ and A -<  >ere: A: $: and  are attri"utes'

%uestion& + ?ou ?ou wor as a !ata"ase !esi/ner #or [email protected] [email protected] %n&' (he &ompan) has a *Q+ *er,er data"ase' ?ou are assi/ned the tas o# &reatin/ a data model o# an enterprise "ased on a spe&i& data model' (he model to "e &reated should "e independent o# a parti&ular !$*' .hi&h o# the #ollowin/ data"ase desi/ns will help )ou a&&omplish the tas0 A' +o/i&al data"ase desi/n $' on&eptual data"ase desi/n ' Ph)si&al data"ase desi/n !' Appli&ation desi/n

(ns#er& ( Explanation +o/i&al data"ase desi/n is the pro&ess o# &reatin/ a data model o# an enterprise "ased on a spe& spe&i i& & data data mode model: l: "ut "ut inde indepe pend nden entt o# a part parti& i&ula ularr !$* !$*'' %n the the lo/i& lo/i&al al data"a data"ase se desi/n desi/n sta/e: sta/e: users users &an dene dene ta"les ta"les and relat relation ionshi ships ps that that reBe& reBe&tt the &on&eptual desi/n'

(ns#er& * is incorrect' Ph)si&al data"ase desi/n is the pro&ess o# produ&in/ a des&ription o# the data"ase implementation on se&ondar) stora/e' %t des&ri"es "ase relations: le or/ani7ations: and indexes used to a&hie,e eC&ient a&&ess to data' %t also des&ri"es an) asso&iated inte/rit) &onstraints and se&urit) measures: tailored to a spe&i& !$* s)stem' (his in,ol,es the a&tual pro/rammin/ o# the data"ase: tain/ into a&&ount the #eatures and limitations o# the !$* and the &lient'

(ns (n s#er #er&& ) is in inco corr rrec ectt'

on& on&ep eptu tual al data data"a "ase se desi desi/n /n is the the pro& pro&es ess s o# &onstru&tin/ a model #or the data at a hi/h le,el o# a"stra&tion without usin/ !$*' %t &onsists o# the &onstru&tion o# an Entit)-Relationship s&hema: pro,idin/ an optimal des&ription o# the user reuirements'

(ns#er& D is incorrect' Appli&ation desi/n is a desi/n o# the user inter#a&e and the appli&ation pro/rams that use and pro&ess the data"ase' !ata"ase and appli&ation desi/n desi/n are parallel a&ti,ities a&ti,ities'' Appli&atio Appli&ation n desi/n desi/n in&ludes in&ludes two important important a&ti,ities a&ti,ities transa&tion desi/n and user inter#a&e desi/n'

%uestion& 3 Prepare4Result - 98-364 98-364 Exam Exam Questions and Answers

4

.hi&h o# the #ollowin/ steps in data"ase plannin/ helps to determine the reuirements reuirements o# the data"ase throu/h inter,iewin/0 A' Datherin/ in#ormation $' %denti#)in/ the relationship "etween o"e&ts ' %denti#) the o"e&ts !' %denti#)in/ the t)pe o# in#ormation #or ea&h o"e&ts E' odelin/ the o"e&t

(ns#er& ( Explanation Dather Datherin/ in/ in#or in#ormat mation ion is the rst rst step step o# data"a data"ase se planni plannin/ n/ and reuir reuires es a /ood /ood unde unders rsta tand ndin in/ / o# what what tas tass s are are to "e per# per#or orme med d in the the data data"as "ase' e' %n &ase &ase the the data"a data"ase se has to repla repla&e &e a paper paper-"a -"ased sed or a manual manual s)stem s)stem:: the old s)stem s)stem &an pro,ide all the ne&essar) in#ormation' oreo,er: all those who were in,ol,ed with the pre,ious s)stem should "e inter,iewed to determine what the) did and what is now needed #or the new data"ase' (he limitations: pro"lems: and "ottlene&s o# the old s)stem should also "e identied'

(ns#e (n s#er& r& * is in incor corre rect ct'

%n the the o"e o"e&t &t iden identi ti& &at ation ion pro& pro&es ess s in data data"a "ase se plan planni nin/ n/:: it is ne&e ne&ess ssar ar) ) to iden identi ti##) the the e) o"e o"e&t &ts s or enti entiti ties es #or #or data data"a "ase se mana mana/e /eme ment nt'' (her (here e are are /ene /enera rall) ll) a #ew #ew prim primar ar) ) o"e o"e&t &ts: s: and and on&e on&e thes these e are are identied: the related items "e&ome ,isi"le'

(ns#er& E is incorrect' @"e&t modelin/ is the third step in data"ase plannin/ in whi&h o"e&ts are identied in the s)stem' A user should re&ord an o"e&t in su&h a wa) that it is represented ,isuall) in the s)stem' >e &an use the data"ase model as a re#eren&e re#eren&e durin/ implementation o# the data"ase' !ata"ase de,elopers use tools su&h as pen&ils: paper: word pro&essin/ et&': as well as &reate so#tware pro/rams #or data modelin/ o# the data"ase'

(ns#er& D is incorrect' %denti#)in/ in#ormation #or o"e&ts is the #ourth step in data"ase plannin/ where the in#ormation #or ea&h o"e&t is stored' %n a ta"le: there are #our &olumns that &ontain dierent t)pes o# in#ormation #or o"e&ts 1'ate/ori&al &olumn %n this &olumn: data is &lassied and /rouped: and a limited sele&tion o# data is stored' 2'Rela 2'Relatio tional nal or re#e re#ere renti ntial al &olumn &olumn %n this this &olumn &olumn:: a lin lin is esta"l esta"lish ished ed "etwee "etween n in#ormation in one ta"le and related in#ormation in#ormation in another ta"le' 3'%dentier &olumn %n this &olumn: ea&h item stored in the ta"le is identied' 4'Raw data &olumn %n this &olumn: tan/i"le in#ormation is stored and is determined ") a sour&e that is external to the data"ase'

(ns#er& ) is incorrect' %denti#)in/ relationships "etween o"e&ts is the last step in data"ase plannin/: whi&h is the a"ilit) to relate in#ormation a"out ,arious items in the data"ase' %solated t)pes o# in#ormation &an "e stored separatel): "ut the data data &an &an "e &om" &om"in ined ed a&&o a&&ord rdin in/ / to the the reui euirremen ements ts o# the the data data"as "ase e en/i en/ine ne'' %denti#)in/ the relationship "etween o"e&ts in the desi/n pro&ess ne&essitates looin/ at the ta"les: determinin/ determinin/ how the ta"les are lo/i&all) related: related: and addin/ relational relational &olumns to the ta"les that esta"lish a lin #rom one ta"le to another' another'


F

%uestion& 4 onsider the &ase o# a #ruit ui&e  ui&e &ompan)' &ompan)' (he &ompan) manu#a&tures manu#a&tures #ruit ui&es and supp suppli lies es them them to whol wholes esal aler ers' s' (he (he !ata !ata"a "ase se !esi !esi/n /ner er &rea &reate tes s a ta"l ta"le e name named d Produ&tion' (he &ode is /i,en "elow 1'REA(E (a"le (a"le Produ&tion 2'5ruitGt)pe Harhar: 3'ruitGname har52I: 4'Quantit) %nt53 .hi&h o# the a"o,e-mentioned lines has an error0 error0 A' +ine 3 $' +ine 2 ' +ine 1 !' +ine 4

(ns#er& ) Explanation %n line 2: ruitGt)pe is de&lared as Harhar' A Harhar datat)pe should alwa)s spe&i#) the maximum len/th o# the &olumn' >owe,er: in this &ase: the maximum len/th has not "een spe&ied'

%uestion& , John wors as a !ata"ase Administrator #or [email protected] [email protected] %n&' (he &ompan) has a *Q+ *er,er data"ase' John wants to insert re&ords in a ta"le where the data"ase is stru stru&t &tur ured ed in a xed xed #orm #ormat at'' .hi& .hi&h h o# the the #oll #ollow owin in/ / data data mode models ls will will he use use to a&&omplish the tas0 A' @"e&t relational data model $' Entit)-Relationship odel ' etwor data model !' Relational model

(ns#er& D Explanation A relat elatio iona nall mode modell uses uses a &oll &olle& e&ti tion on o# ta"l ta"les es to repr epresen esentt "oth "oth data data and and the the relationship "etween those data' E,er) ta"le has multiple &olumns: and ea&h &olumn has a uniue name' A relational model is an example o# a re&ord-"ased model' Re&ordRe&ord"ased models are so named "e&ause the data"ase is stru&tured in a xed #ormat' Ea&h ta"le in the data"ase &ontains re&ords o# a parti&ular t)pe and ea&h re&ord t)pe denes a xed num"er o# elds or attri"utes' (his model is the most widel) used data model: and most data"ase s)stems are "ased on this model' (his model is at a lower le,el o# a"stra&tion than the E-R odel'


6

(ns#er& ) is incorrect' (he Entit)-Relationship odel is a &olle&tion o# o"e&ts &alled entities and the relationships "etween these o"e&ts' Entities in a data"ase are nown as attri"utes' A relationship is an asso&iation amon/ se,eral entities' %t is a &on&ep &on&eptua tuall repr represe esenta ntatio tion n o# stru&t stru&tur ured ed data' data' Entit) Entit)-r -relat elations ionship hip modeli modelin/ n/ is a relational s&hema data"ase modelin/ method that is used in so#tware en/ineerin/ to produ&e a t)pe o# &on&eptual data model o# a s)stem: o#ten a relational data"ase' (he lo/i&al stru&ture o# a data"ase &an "e expressed /raphi&all) ") an E-R dia/ram: whi&h has the #ollowin/ &omponents Re&tan/le %t represents entit) sets' Ellipse %t represents represents attri"utes' !iamond %t represents represents relationships amon/ entit) sets' +ine %t lins attri"utes to entit) sets'

(ns#er& ( is incorr incorrect ect' An o"e&t relational data model 5@R! is similar to a relational data model: "ut with an o"e&t-oriented data"ase model' @"e&ts: &lasses: and and inhe inheri rita tan& n&e e are are dire& dire&tl tl) ) supp suppor orte ted d in data data"a "ase se s&he s&hema mas s and and in the the uer uer) ) lan/ua/e'

(ns#er& * is incorrect'

(he networ data model model &ontains &ontains lo/i&al lo/i&al in#ormati in#ormation on su&h as &onne&ti,it) relationships amon/ nodes and lins: dire&tions o# lins: and &osts o# nodes and lins' A node represents an o"e&t o# interest and a lin represents a relationship "etween two nodes'

%uestion& 6 ?ou ?ou mana/e a data"ase named ustomers: whi&h in&ludes a ta"le named @rders' (he @rders ta"le is #reuentl) ueried: "ut onl) orders with a sales total o# more than 1III'II are reuired in the uer)' ?ou want to &reate an index to speed up these t)pes o# ueries at the same time: ensurin/ the index is as small as possi"le' .hat t)pe o# index should )ou use0 A' on-&lustered $' iltered ' lustered !' K+

(ns#er& ) Explanation A ltered index is used to lter out unwanted data in the index' (hese indexes are ideall) suited to impro,e ueries on data that is mostl) L++ ,alues' A ltered uer) onl) indexes the rows that ha,e non-null data in the indexed &olumn' (he ltered index would "e dened as a non-&lustered index' iltered indexes &onsume less spa&e in the s)stem: and also reuire less pro&essin/ power to uer)' oreo,er: ltered indexes indexes are mainl) &reated on &olumns &on/ured as sparse &olumns' %n this &ase: the lter within the REA(E %!EK statement &ould loo somethin/ lie .>ERE *ales(otal < 1III'

(ns#er& * is incorrect' A &lustered index is or/ani7ed as a $-tree stru&ture' (he index &onsists o# a root pa/e: intermediate intermediate le,els: and lea# le,els' (he lea# le,el


;

nodes &ontain the data pa/es o# the underl)in/ ta"le' (he root and intermediate le,el nodes &ontain index pa/es that hold index rows' Ea&h index row &ontains a e) ,alue and a pointer' A &lustered &lustered index is use#ul when )ou want to optimi7e ueries "ased on ran/ ran/es es sin& sin&e e it orde orders rs the the data data "ase "ased d on the the &lus &luste terred inde index' x' >owe >owe,e ,er: r: the the &lustered index would in&lude all o# the rows and will ne,er "e smaller than a ltered index'

(ns#er& ( is incorrect' A non&lustered index has the same $-tree stru&ture as the &lustered index' (he index &onsists o# a root pa/e: intermediate le,els: and a lea# le,el' (he lea# le,el o# a non&lustered index does not &ontain the a&tual data' %t &ontains pointers to the data that is stored in the data pa/es' A non&lustered index does not ph)si&all) rearran/e the data' A non-&lustered index &an "e used to impro,e per#orman&e o# ueries' >owe,er: a non-&lustered index would in&lude all o# the rows and will ne,er "e smaller than a ltered index' .hile a ltered index must "e a non&lustered index: all non-&lustered indexes do not in&lude .>ERE &lauses and are not ltered indexes'

(ns#er& ( is incorrect' A non&lustered index has the same $-tree stru&ture as the &lustered index' (he index &onsists o# a root pa/e: intermediate le,els: and a lea# le,el' (he lea# le,el o# a non&lustered index does not &ontain the a&tual data' %t &ontains pointers to the data that is stored in the data pa/es' A non&lustered index does not ph)si&all) rearran/e the data' A non-&lustered index &an "e used to impro,e per#orman&e o# ueries' >owe,er: a non-&lustered index would in&lude all o# the rows and will ne,er "e smaller than a ltered index' .hile a ltered index must "e a non&lustered index: all non-&lustered indexes do not in&lude .>ERE &lauses and are not ltered indexes'

(ns#er& D is incorrect' (he K+ &olumn pro,ides /reat a"ilit) to retrie,e data #rom within the K+ &olumn usin/ ,arious uer) methods' (o support the uer)in/ o# K+ data: users &an &reate indexes on these &olumns' (here are #our dierent t)pes o# K+ indexes supported supported ") *Q+ *er,er 2IIFM2II8' (here is a sin/le primar) K+ index and three dierent Ba,ors o# se&ondar) K+ indexes' (he primar) K+ index is a &lustered index on an internal ta"le nown as the node ta"le that users &annot use dire&tl) #rom their (-*Q+ statements' (he primar) K+ index "asi&all) &ontains one row #or ea&h node in the K+ instan&e'A#ter the primar) K+ index has "een &reated: users &an &reate supplementar) three inds o# se&ondar) K+ indexes' (he se&ondar) K+ indexes help in spe&i& t)pes o# KQuer) pro&essin/' (hese are &alled the PA(>: PR@PER(?: and HA+LE indexes' An K+ index is onl) appropriate #or K+ data'

%uestion&  .hi&h .hi&h o# the #ollow #ollowin/ in/ data"a data"ase se terms terms is des&r des&ri"e i"ed d in the statem statemen entt "elow0 "elow0 N%t pre,ents the &urrent data"ase operation #rom readin/ or writin/ a data item while the data item is "ein/ a&&essed ") another operation'N A' +o& $' En&r)ption ' onstraint !' !eadlo&


8

(ns#er& ( Explanation +o& +o& is the pro&e pro&ess ss to pre, pre,ent ent the &urre &urrent nt data"a data"ase se operat operation ions s #rom #rom readi readin/ n/ and writin/ a data while that data item is "ein/ a&&essed ") another operation' A lo& is used when multiple users need to a&&ess a data"ase &on&urrentl)' %t pre,ents data #rom /ettin/ &orrupt or in,alidated: when multiple users tr) to write to the data"ase' .hen a lo& is applied: a sin/le user &an onl) modi#) that re&ord to whi&h the lo& is applied' %t /i,es the user ex&lusi,e a&&ess to the re&ord until the lo& is released' +o&in/ also pre,ents readin/ o# unnished 5un&ommitted data'

(ns#er& ) is incorrect'

En&r) En&r)pti ption on pro,i pro,ides des an additi additiona onall se&uri se&urit) t) la)er: la)er: prote&tin/ the data #rom unauthori7ed ,iewin/ with the help o# an al/orithm &alled &ipher' E,en i# a&&ess to the data"ase is o"tained: it will not "e eas) to de&ipher en&r)pted data into a reada"le #orm'

(ns#e (n s#er& r& D is in incor corre rect ct'

A dead deadlo lo& & is a situ situat atio ion n wher wherei ein n two two or mor more &ompetin/ a&tions wait #or the other to nish: and neither e,er does'

(ns#er& * is incorrect' A &onstraint en#or&es the inte/rit) o# a data"ase' %t denes the rules re/ardin/ the ,alues allowed in the &olumns o# a ta"le' A &onstraint is the standard me&hanism #or en#or&in/ inte/rit)'

%uestion& 8 ?our ?our ompan) is desi/nin/ and de,elopin/ a num"er o# data"ases #or a sto& ex&han/e' @ne o# the data"ases will &ontain hi/hl) sensiti,e data #or whi&h hi/h le,el o# se&ur se&urit) it) will will "e reui reuire red' d' Althou Althou/h /h hi/h hi/h pro&e pro&essi ssin/ n/ speed speed is one o# the prime reuirements o# the &ustomer: #or this data"ase: se&urit) o# the data will tae priorit) o,er the pro&essin/ speed' %t needs to "e ensured that e,en i# unauthori7ed a&&ess to the data"ase is o"tained: the ro/ue user is una"le to read the data' .hi&h o# the #ollowin/ prote&tion te&hniues will )ou su//est #or this data"ase0 A' Authenti&ation $' En&r)ption ' ati,e auditin/ !' %nte/rit) &ontrols

(ns#er& ) Explanation A&&ordin/ to the uestion: the data"ase &ontains hi/hl) sensiti,e data and that needs to "e prote&ted #rom "ein/ read ") a ro/ue user e,en i# he is a"le to a&&ess data"ase un-aut un-author horita itati, ti,el) el)'' %n order order to a&&omp a&&omplis lish h this this tas: tas: )ou should should su//es su//estt appl)i appl)in/ n/ en&r) en&r)pti ption on o,er o,er the data"a data"ase' se' En&r) En&r)pti ption on pro,i pro,ides des an additi additiona onall se&uri se&urit) t) la)er la)er:: prote&tin/ the data #rom unauthori7ed ,iewin/ with the help o# an al/orithm &alled &ipher' E,en i# a&&ess to the data"ase is o"tained: it will not "e eas) to de&ipher en&r)pted data into a reada"le #orm'

(ns#er& (. D. and * ar e in&orre&t' (hese te&hniues will not help in prote&tin/ the data: in &ase a rou/e user has unauthori7ed a&&ess to the data"ase' 9 Prepare4Result - 98-364 98-364 Exam Exam Questions and Answers

%uestion& 9 .hi&h o# the #ollowin/ are the main approa&hes in the data"ase desi/n0 Ea&h &orre&t answer represents a &omplete solution' hoose three' A' (op-down approa&h $' $ottom-up approa&h ' iddle approa&h !' %nside-out approa&h

(ns#er& (. ). D Explanation (here are are #our dierent dierent t)pes o# approa&hes in data"ase desi/n: whi&h whi&h are as #ollows 1'(op-down approa&h 2'$ottom-up approa&h 3'%nside-out approa&h 4'ixed approa&h

%uestion& '/ ?ou ?ou wor as a *o#tware !e,eloper !e,eloper #or Ar&hi(e&h Ar&hi(e&h %n&' ?ou ?ou plan to &reate a well-desi/ned data"a data"ase se #or the the &ompan) &ompan)' ?ou implem implement ent normal normali7a i7atio tion n rules rules #or desi/n desi/nin/ in/ the data"ase' hoose the appropriate normali7ation rules #rom the hoose and Reorder window pane'

(ns#er&


1I

E!planation (he #ollowin/ are some normali7ation rules that &an "e made #or a&hie,in/ a welldesi/ned data"ase Ea&h ta"le in a data"ase should should ha,e a uniue row row identier: i'e' i'e' an %! &olumn in whi&h no two re&ords &an share the same %! ,alue' *u&h &olumn is nown as the primar) e) &olumn that ser,es as the uniue row identier #or the ta"le' ta"le' or examp example: le: Produ Produ&t% &t%! ! &an "e the prima primar) r) e e) ) &olumn &olumn #or the Produ Produ&ts &ts ta"le'Ea&h ta"le in a data"ase should store in#ormation #or a sin/le t)pe o# entit)' (oo mu&h in#ormation stored in one ta"le &an hinder the eC&ien&) and relia"ilit) o# data in the ta"le' or example: in a ta"le: the &olumns that &ontain in#ormation o# "oth sales order and &ustomer details &an lead to se,eral pro"lems' %t is a "est pra&ti&e to store "oth these in#ormation in separate ta"les #or "etter maintenan&e and a,oidan&e o# an) uer) issues'A ta"le in a data"ase should a,oid &ontainin/ nulla"le &olumns' >owe,er: >owe,er: some some &olumns &olumns o# a ta"le &an "e dened dened to allow null ,alues' ,alues' A ta"le in a data"a data"ase se should should not &ontai &ontain n repea repeated ted ,alues ,alues or &olumn &olumns s #or a spe&i spe&i& & pie&e pie&e o# in#ormation' or example: a produ&t ma) "e pur&hased #rom multiple ,endors' %# the produ&t name and the names o# all the ,endors are stored in one ta"le: it will &ontain &olu &olumn mns s #or #or all all the the ,end ,endor ors s with with repea epeati tin/ n/ prod produ& u&tt %!' %!' (his (his will will &rea &reate te se,e se,era rall pro"lems' (here#ore: it is a "est pra&ti&e to store produ&t in#ormation in one ta"le and the names o# all ,endors in another ta"le' or &reatin/ relationships "etween the two ta"les: a &ommon &olumn su&h as a s Produ&t%! should "e pla&ed in "oth the ta"les'

%uestion& '' 0ou are a !ata"ase Administrator o# )*Q+ data"ase' ew da)s "a&: )our ser,er &rashed' ow: it is up and online' ?ou need to &he& the inte/rit) o# ,arious ta"les used in the data"ase' ?ou need to issue the >EO (A$+E &ommand' or whi&h o# the #ollowin/ ta"les will this &ommand wor0 Ea&h &orre&t answer represents a &omplete solution' hoose two' A' E!ERA E !ERA(E! (E! $' )%*A ' ERDE !' %nno!$

(ns#er& D and ) Prepare4Result - 98-364 98-364 Exam Exam Questions and Answers

11

Explanation (he >EO (A$+E (A$+E &ommand wors wors #or the %nno!$ and )%*A )%*A ta"les' >EO (A$+E (A$+E is a "uilt-in tool pro,ided ") )*Q+ #or &he&in/ ta"les "e#ore an) attempts to repair the data"ase' %t &he&s ta"les #or stru&tural pro"lems and ensures that no ta"le data are &orrupt' %t is a *Q+ &ommand that is used in &onun&tion with the REPA%R (A$+E and @P(%%E (A$+E &ommands to &he&: repair: and optimi7e ta"les in a data"ase #or optimal per#orman&e' %t does not reuire that the data"ase ser,er "e shut down' %nstead: sin&e this &ommand &an onl) "e sent to the ser,er ,ia a &lient: the ser,er must "e runnin/ throu/hout the pro&ess'

(ns#er& * and ( are in &orre&t' &orre&t' (he >EO (A$+E (A$+E &ommand does not wor #or the ERDE and E!ERA(E! ta"les'

%uestion& '+ .hi& .hi&h h o# the the #ollo #ollowi win/ n/ &an &an "e used used to popu popula late te a ta"l ta"le0 e0 Ea&h Ea&h &orr &orre& e&tt answ answer er represents a &omplete solution' hoose all that appl)' A' !ata Pump $' *Q++oader ' %*ER( statement !' ERDE statement

(ns#er& *. ). (. and D Explanation (he %*ER( statement is a !ata anipulation +an/ua/e 5!+ statement that is used to add new rows o# data to a spe&ied data"ase ta"le' *)ntax %*ER( %(@ (a"leame  5olumname : olumname'''S  S HA+LE* 5 ,alue : ,alue'''S T where: (a"leame (a"leame spe&ies spe&ies the name o# o# the ta"le' olumname spe&ies the name o# the &olumn o# the ta"le: whi&h is to "e populated' ,alue spe&ies the ,alue #or the &orrespondin/ &olumn o# the ta"le' (he num"er and datat)pes o# ,alues spe&ied in the HA+LE* &lause must mat&h the num"er and datat)pes o# &orrespondin/ &olumns spe&ied in the %(@ &lause' %# the &olumns are not spe&ied: the ,alues in the HA+LE* &lause must "e in the order in whi&h the &olumns are dened in the ta"le' *Q++oader 5slldr is a utilit) that is used #or #or hi/h hi/h per# per#or orma man& n&e e data data load loads' s' (he (he data data &an &an "e in the the #orm #orm o# a text text le le or em"edded into a data"ase' $) usin/ the in#ormation stored in the data le and the &ontrol le: slldr loads the data into a data"ase' (he ar&hite&ture o# *Q++oader is /i,en "elow


12

%n the /ure: 1 depi&ts the parameter le: 2 depi&ts the data le: 3 depi&ts the &ontrol le: 4 depi&ts the lo/ le: F depi&ts the "ad le: and 6 depi&ts the dis&ard le'ote .hile pro&essin/ the in#ormation: *Q++oader stores messa/es in the lo/ le: "ad rows in the "ad le: and dis&arded rows in the dis&ard le' !ata Pump is a new #eature introdu&ed in @ra&le 1I/ to mo,e data and meta data "etween data"ases and to or #rom operatin/ s)stem les ,er) eC&ientl)' %t pro,ides parallel import and export util utilit itie ies s 5imp 5impdp dp:: expd expdp p on the the &omm &omman andd-li line ne as well well as the the .e"-" e"-"as ased ed @r @ra& a&le le Enterprise ana/er exportMimport inter#a&e' %t is ideall) "ene&ial #or lar/e data"ases and data warehousin/ en,ironments' en,ironments' @ra&le !ata Pump #a&ilit) runs on the ser,er' ser,er' ollowin/ are some #un&tions per#ormed ") @ra&le !ata Pump 1'%t is used to &op) data #rom one s&hema to another "etween two data"ases or within a sin/le data"ase' 2'%t &an "e used to extra&t a lo/i&al &op) o# the entire data"ase: a list o# ta"lespa&es: a list list o# s&hem s&hemas as or a list list o# ta"les ta"les'' (he ERDE stateme statement nt is a !ata !ata anipu anipulati lation on +an/ua/e 5!+ statement that is used to update or insert rows &onditionall) into a ta"le' %t sele&ts rows #rom one ta"le and updates or inserts them into another ta"le' (he de&ision whether to update or insert rows in the tar/et ta"le is "ased on a &ondition in the @ &lause o# the ERDE statement'


13

Thank For Using the Demo of our Product 1isit Our 2ite to urchase the Full 2et of (ctual 98-364 E!am %uestions ith (ns#ers

http://www.prepare4result.com/98!"4practicee#am.html e (lso rovide ractice E!am 2oft#are That 2imulates 5eal E!am Environment (nd as Man7 2elf(ssessment Features Do#nload Free roduct Demo From&

http://www.prepare4result.com/98!"4practicee#am.html

$%%& 'one( )ack *uarantee:

+heck ,ut ,ur +ustomer Testimonials

httpsMM,imeo'&omM1I2F2134F


14


1F

Microsoft 98-364 Exam Reduce Your Chances of Failure

Recommend Documents