1

TRNG I HC HNG HI VIT NAM KHOA CNG NGH THNG TIN B MN H THNG THNG TIN

-----***-----

BI GINGPHN TCH & THIT K H THNG HNG I TNG

TN HC PHN

: PHN TCH & THIT K H THNG HNG I TNG M HC PHN : 17407 TRNH O TO : I HC CHNH QUY DNG CHO SV NGNH : CNG NGH THNG TIN

HI PHNG - 2011

2

MC LCNi dung Chng 1. M hnh i tng 1.1. S pht trin ca m hnh i tng 1.2. Nn tng ca m hnh i tng 1.3. Phn t c bn trong m hnh i tng Chng 2. Lp v i tng 2.1. C bn v i tng 2.2. Mi quan h gia cc i tng 2.3. C bn v lp 2.4. Mi quan h gia cc lp 2.5. S tng tc ln nhau ca lp v i tng Chng 3. S phn loi (Classification). 3.1. Tm quan trng ca s phn loi 3.2. Xc nh cc lp v i tng Chng 4. Phn tch thit k h thng hng i tng s dng UML (Unified Model Language) 4.1. Ngn ng m hnh thng nht (UML) 4.2. Cc biu (Diagrams) Chng 5. Quy trnh phn tch v thit k 5.1. Nn tng 5.2. Quy trnh v m: Vng i ca trin khai phn mm 5.3. Quy trnh vi m: Qu trnh phn tch v thit k Chng 6. Mt s bi ton c th 6.1. H thng iu khin: Qun l h thng giao thng 6.2. ng dng mng li: H thng theo di k ngh Trang 5 5 8 9 12 12 12 13 15 15 16 16 16 18 18 23 37 37 37 40 44 44 46

3

Tn hc phn: Phn tch & Thit k h thng hng i tng Loi hc phn: 2 B mn ph trch ging dy: H thng Thng tin Khoa ph trch: CNTT. M hc phn: 17407 Tng s TC: 2 TS tit L thuyt Thc hnh/ Xemina T hc Bi tp ln n mn hc 45 30 15 0 0 0 Hc phn hc trc: Phn tch v Thit k h thng Hc phn tin quyt: Khng yu cu. Hc phn song song: Khng yu cu. Mc tiu ca hc phn: Cung cp cc kin thc c bn v phn tch, thit k h thng thng tin tin hc ho theo m hnh hng i tng s dng UML. Ni dung ch yu: Phng php lun phn tch thit k h thng hng i tng; Nguyn tc v cng c m hnh ho h thng; Thit k v ci t h thng hng i tng; Cc v d minh ho. Ni dung chi tit: PHN PHI S TIT TN CHNG MC TS LT TH BT KT Chng 1. M hnh i tng 2 2 1.1. S pht trin ca m hnh i tng 1.2. Nn tng ca m hnh i tng 1.3. Phn t c bn trong m hnh i tng Chng 2. Lp v i tng 2 2 2.1. C bn v i tng 2.2. Mi quan h gia cc i tng 2.3. C bn v lp 2.4. Mi quan h gia cc lp 2.5. S tng tc ln nhau ca lp v i tng Chng 3. S phn loi (Classification). 2 3.1. Tm quan trng ca s phn loi 3.2. Xc nh cc lp v i tng Chng 4. Phn tch thit k h thng hng i 18 16 2 tng s dng UML (Unified Model Language) 4.1. Ngn ng m hnh thng nht (UML) 4.2. Cc biu (Diagrams) Chng 5. Quy trnh phn tch v thit k 2 2 5.1. Nn tng 5.2. Quy trnh v m: Vng i ca trin khai phn mm 5.3. Quy trnh vi m: Qu trnh phn tch v thit k Chng 6. Mt s bi ton c th 4 3 1 6.1. H thng iu khin: Qun l h thng giao thng 6.2. ng dng mng li: H thng theo di k ngh Nhim v ca sinh vin: Tham d cc bui hc l thuyt v thc hnh, lm cc bi tp c giao, lm cc bi thi gia hc phn v bi thi kt thc hc phn theo ng quy nh. Ti liu hc tp: 1. Grady Booch, Robert A.Maksimchuk, Michael W.Engle, Bobbi J.Young, Ph.D, Jim Conallen, Kelli A.Houston, Object-Oriented Analysis And Design with Application, Third Edition. 2. Robert V. Stumpf, Lavette C. Teague, Object-Oriented Systems Analysis and Design with UML, Pearson Prentice Hall 3. on Vn Ban, Phn tch v thit k h thng hng i tng, Nh xut bn HQG H Ni, 2006.

4

4. Nguyn Vn V, Phn tch v thit k cc h thng thng tin hin i, Nh xut bn Thng K, H Ni, 2002. Hnh thc v tiu chun nh gi sinh vin: - Hnh thc thi: thi vit. - Tiu chun nh gi sinh vin: cn c vo s tham gia hc tp ca sinh vin trong cc bui hc l thuyt v thc hnh, kt qu lm cc bi tp c giao, kt qu ca cc bi thi gia hc phn v bi thi kt thc hc phn. Thang im: Thang im ch A, B, C, D, F. im nh gi hc phn: Z = 0,3X + 0,7Y.

Bi ging ny l ti liu chnh thc v thng nht ca B mn H thng Thng tin, Khoa Cng ngh Thng tin v c dng ging dy cho sinh vin.

Ngy ph duyt:

/

/

Trng B mn

5

CHNG I: M HNH I TNG1.1. S pht trin ca m hnh i tngTrong mc ny chng ta kho st s pht trin ca cc cng c gip chng ta hiu s thnh lp v cc nt ni bt ca k thut hng i tng. Trong qu trnh pht trin cng ngh phn mm chng ta c th v nghin cu theo 2 hng sau: - Pht trin cc chng trnh nh ti cc chng trnh ln - S pht trin ca cc ngn ng lp trnh bc cao hn. Hu ht tt c cc chng trnh phn mm ngy cng i hi cao vo phc tp hn. Chnh iu ny thc y vic nghin cu trong lnh vc cng ngh phn mm, m c bit quan tm ti s phn tch, tru tng v t chc cho h thng. i i vi iu ny, vic pht trin cc ngn ng lp trnh cng p ng c phn no v gii quyt yu cu phc tp ca h thng. Wenger phn loi ra mt s ngn ng lp trnh bc cao ph bin v sp xp theo th t ty thuc v mt s c tnh ca tng loi ngn ng: - Th h ngn ng th nht (1954 -195) FORTRAN I ALGOL 58 Flowmatic IPL V - Th h ngn ng th hai (1959 1961) FORTRAN II Cc th tc con, tch ring r cc m hnh phc tp ALGOL 60 COBOL Lisp - Th h ngn ng th ba (1962 1970) PL/1 ALGOL 68 Pascal Simula FORTRAN + ALGOL + COBOL K tha nghim ngt t ALGOL 60 K tha n gin t ALGOL 60 Lp, tru tng d liu Cu trc khi, kiu d liu M t d liu Con tr, Biu thc ton hc Biu thc ton hc Biu thc ton hc Biu thc ton hc

- Giai on (1970 -1980): Trong giai on ny c rt nhiu ngn ng khc nhau uc pht minh ra. Tuy nhin c mt s ngn ng sau c s dng rng ri: C FORTRAN 77 Hiu qu, c th thc thi uc Theo chun ANSI

6

Pascal Simula - Giai on hng i tng (1980 1990) Smalltalk C++ Ada83 Eiffel

K tha n gin t ALGOL 60 Lp, tru tng d liu Ngn ng hng i tng Pht trin t C v Simula Mnh hn Pascal Pht trin t Ada v Simula

- Giai on Framework (1990 ngy nay): Nhiu ngn ng mi uc pht trin v yu cu cn phi tun theo mt tiu chun no . Do dn n vic lp trnh theo cc Framework.. Visual Basic D dng pht trin cc giao din ha cho cc ng dng Windows Java Python K tha t Oak Ngn ng kch bn hng i tng J2EE Da trn cc Framework c bn ca Java .NET Da trn cc i tng Framework c bn ca Microsoft Visual C# Visual Basic .NET Visual Basic cho Framework ca Microsoft .NET By gi chng ta xem xt cu trc ca mi th h ngn ng lp trnh. Trong hnh 1-1, chng ta c th thy kin trc ca cc ngn ng lp trnh th h th nht v u thi k th 2. V kin trc, chng c xy dng bi cc khi c bn v cc phn c lin kt vi nhau nh th no. Trong hnh ny, chng ta c th thy rng cc khi c bn xy dng ln cc ng dng l cc chng trnh con.

7

Cc ng dng c vit bi nhng ngn ng ny thng thng c thit k vi cc chng trnh con v d liu ton cc. Cc mi tn trn hnh v ni rng cc chng trnh ph thuc vo cc kiu d liu khc nhau. Trong sut qu trnh thit k d liu ca mt chng trnh con c th tch bit vi d liu ca cc chng trnh con khc. Mt li trong mt phn ca chng trnh c th nh hng ti ton b h thng bi v cu trc d liu ton cc c s dng cho tt cc cc chng trnh con. Khi chng ta cn chnh sa mt h thng ln, kh c th duy tr tnh ton vn ca thit k gc. Kin trc ca ngn ng lp trnh cui giai on 2 v u giai on 3 Gia nm 1960, cui cng th cc chng trnh cng c cng nhn l trung gian gia vn v my tnh. Chng trnh u tin, gi c gi l th tc. cc chng trnh con c xut trong giai on 1950 nhng n vn cha c coi nh l mt abstraction thi im . Subprograms c nh gi nh l mt hng tip cn tch cc chc nng ca chng trnh. Cc subprogram c th phc v nh l mt k thut tm tt c 3 h qu quan trng. Th nht, cc ngn ng lp trnh c h tr vi nhiu cc truyn tham s khc nhau. Th hai, nn tng ca lp trnh cu trc l sp xp, b tr r rng thng qua cc chng trnh con. Th ba, phng php cu trc th hin c u im, cung cp cc nh hng cc nh thit k c gng xy dng mt h thng phc tp thng qua cc chng trnh nh hn c coi l cc khi chng trnh c bn. Kin trc lp trnh trong giai on ny ch ra mt vi iu khng ph hp ca cc ngn ng trc .

8

Kin trc ngn ng lp trnh cui giai on 2 u giai on 3 Kin trc ca ngn ng lp trnh cui giai on th 3 Trong giai on ny, vic phn tch thit k cc chng trnh mang tnh quy m ln ngy cng nhiu v i hi nhiu i, nhiu nhm phai tham gia cng mt lc, do vy rt cn thit phi chia chng trnh ra thnh cc phn khc nhau. Do , hnh thnh vic chia cc chng trnh ra thnh cc module nh nh c hin th hnh di y:

Kin trc ngn ng lp trnh ca cui giai on 3 Kin trc ca i tng c bn v ngn ng lp trnh hng i tng Tru tng ha d liu l quan trng kim sot s phc tp ca d liu.

1.2. Nn tng ca m hnh hng i tngThit k h thng theo hng cu trc gip nhng nh lp trnh vin xy dng cc h thng phc tp s dng thut ton nh l cc khi c bn. Tng t, thit k h thng theo hng i tng gip ngi lp trnh vin khai thc c nhng im mnh ca i tng c bn v ngn ng lp trnh hng i tng, s dng lp v i tng nh l cc khi xy dng c bn.

9

Trn thc t, m hnh i tng b chi phi bi mt s tc nhn, khng ch l ngn ng lp trnh hng i tng. Thc vy, nh tho lun phn trc, nn tng m hnh hng i tng, m hnh i tng chng mnh l mt khi nim thng nht trong khoa hc my tnh, khng ch thch hp vi ngn ng lp trnh m cn thch hp vi thit k giao din ngi dng, c s d liu, v ngay c vi kin trc ca my tnh. Nguyn nhn ca vic c a chung ph bin l hng i tng gip chng ta i ph vi cc k tha phc tp trong nhiu loi h thng khc nhau. Phn tch v thit k hng i tng theo a ra s pht trin tin tin hn. N khng ph v cc cu trc ca chng trnh c thit k trc . Tuy nhin, hu ht cc lp trnh vin khng c hun luyn kht khe k nng phn tch v thit k hng i tng.

1.3. Cc phn t ca m hnh i tngHu ht cc lp trnh vin lm vic trn mt ngn ng v s dng ch mt phong cch lp trnh. H lp trnh theo m hnh mu ca ngn ng m h s dng. Phong cch lp trnh c xem nh l mt cch t chc chng trnh da trn mt s cc m hnh ca lp trnh v ngn ng vit ra chng trnh mt cch r rng. Theo thng k th c mt s kiu lp trnh sau y: + Hng th tc + Hng i tng + Hng Logic + Hng lut + Hng rng buc Cc thut ton Cc lp v i tng Cc mc ch Cc lut Ifthen Cc quan h bt bi, khng i.

Khng c mt kiu lp trnh no m tt nht i vi tt cc cc loi ng dng. V d: Lp trnh theo hng th tc th tt i vi vic thit k cc chng trnh lin quan ti vic tnh ton T trc ti nay v ang tn ti nhiu phng php c p dng phn tch thit k mt h thng thng tin. Mt trong nhng phng php l hng th tc, c s dng trong vic gii quyt cc vn ca h thng hin ti hoc cho vic xy dng mt h thng mi. C nhiu phng php c s dng cho vic thit k v pht trin h thng thng tin bao gm: Systems Development Life Cycle (SDLC), Rapid Application Development (RAD), Object-Oriented Analysis and Design. Phng php SDLC c s dng ph bin nht l Structured System Analysis and Design. Phng php cu trc cho php nh phn tch chia nh h thng phc tp ra thnh cc h thng nh hn, r rng hn, v qun l cng d dng hn. Phng php OOAD ch yu l phn tch theo hng i tng hn l hng th tc nh l phng php SSAD. Mt i tng l mt ngi, a im hay mt s vt c m t hay tn ti trong h thng m c 3 iu cn quan tm: Ci g phn bit, nhn bit n (nh danh ca n v ton b cc thuc tnh).

10

-

Quan h vi cai g (Quan h ca n vi cc i tng khc). N lm nhng ci g (Cc phng thc ca n thc hin vi CSDL).

Phn tch hng i tng l qu trnh pht trin mt m hnh hng i tng m trong m hnh ny cc i tng ban u biu din cc thc th v cc phng thc lin quan ti vn cn gii quyt. Thit k hng i tng l qu trnh pht trin mt m hnh hng i tng, trong giai on ny phi xc nh c cc yu cu. Ni tm li trong OOAD chng ta cp ti thut ng i tng nhiu hn l chc nng. Phn tch v thit k h thng theo hng truyn thng System development life Cycle (SDLC) hoc Structured Systems Analysis and Design (SSAD) l nn tng cho mi hot ng v nhim v cn thit hon thnh vic pht trin mt h thng thng tin. Phng php ny nh cp phn trc c gi l m hnh thc nc. Cc vn c bn trong SSAD c th c tm tt nh sau: iu u tin trong SSAD l s phn tch theo hng t trn xung di. y, h thng c coi mt tng th ban u. Ch yu vic phn tch giai on ny hiu c nhng c tnh ca h thng, b qua nhng phn nh v ch tit. Nhng phn ny s c phn tch sau. Tip theo, phm vi ca h thng c nh ngha l ni h thng c trin khai. Nh phn tch tp trung vo 2 mc ch chnh: H thng mi cn phi lm nhng g v H thng mi lm n nh th no? Phng php ny yu cu ngi dng theo st t u ti khi d n hon thnh. Nh phn tch s gp g vi ngi dng v gii quyt vn , xc nht nhng vn m ngi dng cn. Hai vn chnh trong vic pht trin h thng thng tin l cc quy trnh v d liu c xy dng c lp vi phng php ny. Cc quy trnh c xy dng bi cc lc lung d liu, lc ny m phng lung d liu gia quy trnh v d liu lu tr v n c thay i nh th no. M hnh d liu c nh ngha bng vic quan h gia cc thc th (ERD), ERD m t d liu (thc th) v s phi kt hp gia chng. Phn tch thit k h thng hng i tng Phng php tip cn theo hng i tng pht trin mt h thng xem h thng nh l mt tp cc i tng tng tc vi nhau, lm vic cng nhau hon thnh nhim v. Khng c s tch bit gia quy trnh v chng trnh. Khng c s tch bit gia thc th d liu v tp tin. Mt i tng l mt vn trong h thng my tnh. Phng php OOAD c th chia ra lm 2 lnh vc chnh:

11

-

Phn tch hng i tng: iu ny lin quan ti pht trin m hnh hng i tng ca ng dng. iu ny xc nh i tng biu din cc thc th v quan h gia cc i tng v phng php cn thit gii quyt vn .

-

Thit k hng i tng: iu ny lin quan ti pht trin m hnh hng i tng ca h thng cn thit thc hin cc yu cu. Cc nh phn tch v lp trnh phi ngh thut ng i tng nhiu hn l chc nng.

M hnh i tng da trn cc yu t c bn bao gm: abstraction, encapsulation, modularity, hierarchyMc tiu tp trung a m hnh i tng l phn tch i tng. Mt h thng hng i tng s c mt s i tng, mi i tng ny s kt hp vi cc i tng khc hon thnh mt nhim v.

Bi tp1) Trnh by s pht trin ca cc m hnh lp trnh? 2) Trnh by nn tng ca m hnh i tng? 3) Cc thnh phn ca m hnh i tng?

12

CHNG II: LP V I TNG2.1. C bn v i tngTrong kha hc ny, nhng chng ta cp t chng trc, i vi s dng OOAD th ngi phn tch v lp trnh s dng thut ng i tng rt rt nhiu. Vy ta t hi, i tng l g? i tng l mt trng hp ca mt s vic c kiu c th. Chng ta ly mt v d v i tng l An, mt sinh vin trng i hc Hng hi. An l mt trng hp trong tt c cc sinh vin ca trng i hc Hng hi. Chng ta cng c th ni i tng l ci g m chng ta mun ly thng tin v chng. V d, ti mun qun l cc kha hc khc nhau ti trng i hc Hng hi. Theo ti phi to cc i tng m c th lu tr thng tin v cc kha hc ny, chng ta c th theo di hay ly thng tin v cc kha hc khc nhau. Nh vy, mt i tng c th l tn ti dng vt cht, nh l mt sinh vin, mt kha hc, hay mt quyn sch hoc tn ti dng tru tng nh l cm xc

Trong UML chng ta xy dng i tng bng vic s dng mt hnh ch nht vi 2 phn. Phn trn cha tn ca i tng v tn ca lp m i tng thuc vo lp . C php chun l: tn i tng: tn lp. Phn di lit k cc thuc tnh ca i tng .

2.2. Mi quan h gia cc i tngTon b h thng c xy dng t rt nhiu lp v i tng. Hot ng ca h thng thu c thng qua s phi hp ca cc i tng trong h thng. Cc mi quan h cung cp cc ng dn cc i tng tng tc vi nhau. C hai loi quan h gia cc i tng l : - lin kt(link) - kt tp (aggregation) Mi quan h lin kt (link)

13

Mi quan h lin kt l s kt ni vt l hoc logic gia cc i tng. Mt i tng phi hp vi cc i tng khc thng qua cc lin kt ca n vi cc i tng ny. Ni mt cch khc, mt lin kt biu din mt lin hp (association) xc nh, trong mt i tng(client) s dng nhng dch v ca i tng khc (supplier). Thng thng, thng ip c truyn gia hai i tng l mt chiu, i khi c th l c hai chiu. Cc thng ip c khi to pha client, sau c a ti supplier, cn d liu c th dch chuyn theo c hai chiu trn lin kt. Vi mi lin kt, mt i tng c th c mt trong ba vai tr: Actor: Mt i tng c th hot ng trn cc i tng khc ch khng b thao tc bi cc i tng khc. Server: Mt i tng khng bao gi hot ng trn cc i tng khc; n ch c th b thao tc bi cc i tng khc. Agent: L i tng va c th hot ng trn cc i tng khc, li va c th b cc i tng khc thao tc. Mi quan h kt tp (aggregation) Mi quan h kt tp ch l mt dng c bit ca mi quan h lin hp trong mt i tng l s tng hp ca cc i tng thnh phn. V d: Mt chic xe t c 4 bnh, mt cn li, mt hp s, mt ng c ...

2.3. C bn v lpLp l mt s tru tng trong m hnh hng i tng v trong ngn ng hng i tng. Mt lp bao gm cu trc v hnh vi. Cc lp c th nh ngha thng qua cc lp khc bng vic s dng tnh cht k tha. Mt lp l m t cho mt tp i tng c thuc tnh v hot ng ging nhau. N phc v nh l mt mu khi m to mt i tng mi. Mc ch ca n l nh ngha mt tp cc thuc tnh v thao tc m m t y cu trc v hnh vi ca cc i tng. Trong cch ni khc th i tng l mt trng hp c th ca lp. N lun lun bt ngun t lp. N c cu trc v hnh vi ty theo s m t trong lp. Trong UML mt lp c biu din nh l mt hnh ch nht vi 3 phn ring bit c phn tch bi dng k ngang. Phn trn cng th hin tn lp, phn gia nh ngha tt c cc thuc tnh ca lp, phn cui cng cha cc nh ngha thao tc.

14

Lp l mt loi i tng c bit. N l mt tp hp cc i tng c to. N c dng to v hu cc i tng thuc v n. N cng c th c dng lu d liu v cung cp cho cc dnh v trong cng nhm. Mt ng dng c th truy cp cc dch v ca n thng qua tn lp.

2.2.1. Cc phng php c s dng xc nh lp Trong thc t c rt nhiu phng php c th xc nh c lp trong mt h thng. Tuy nhin y ti cp ti 2 phng php hay c dng nht: Xc nh cc danh t. Xc nh lp da trn khi nim v danh sch lp.

15

2.4. Mi quan h gia cc lpQuan h gia cc lp c 4 loi: Lin h ( Association) Khi qut ho (Generalization) Ph thuc (Dependency) Nng cp (Refinement) Mt lin h l mt s ni kt gia cc lp, cng c ngha l s ni kt gia cc i tng ca cc lp ny. Trong UML, 1 lin h c nh ngha l mt mi quan h m t mt tp hp cc ni kt trong khi ni kt c nh ngha l mt s lin quan v ng ngha gia mt nhm cc i tng. Khi qut ho l mi quan h gia mt yu t mang tnh khi qut cao hn v mt yu t chuyn bit hn. C th cha ch cc thng tin b sung mt thc th (mt i tng l mt thc th ca mt lp) ca yu t mang tnh chuyn bit hn c th c s dng bt c ni no m i tng mang tnh khi qut ho hn c php. S ph thuc l mt quan h gia cc yu t gm mt yu t mang tnh c lp v mt yu t mang tnh ph thuc mt s thay i trong yu t c lp s nh hng n yu t ph thuc. Mt s nng cp l mt quan h gia hai li m t ca cng mt s vt, nhng nhng mc tru tng ho khc nhau.

2.5. S tng tc ln nhau ca lp v i tngLp vi tng, mc d c mi lin h tngng ln nhau, nhng bn cht li khc nhau: Lp l s tru tng ho ca cc i tng. Trong khi , i tng l mt th hin ca lp. i tng l mt thc th c th, c thc, tn ti trong h thng. Trong khi , lp l mt khi nim tru tng, ch tn ti dng khi nim m t ccc tnh chung ca mt s i tng. Tt c cc i tng thuc v cng mt lp c cng cc thuc tnh v cc phng thc. Mt lp l mt nguyn mu ca mt i tng. N xc nh cc hnh ng kh thi v cc thuc tnh cn thit cho mt nhm cc i tng c th. Ni chung, lp l khi nim tn ti khi pht trin h thng, mang tnh khi nim, tru tng. Trong khi , i tng l mt thc th c th tn ti khi h thng ang hot ng.

Bi tp1) i tng l g? Mi quan h gia cc i tng? 2) Lp l g? Mi quan h gia cc lp? 3) Trnh by mi quan h gia Lp v i tng?

16

CHNG III: S PHN LOIS phn loi c thc hin da trn nhng g hiu bit ca chng ta. Trong thit k hng i tng, vic phn loi cc i tng cng vi cc tng tc ca n trong h thng l v cng quan trng. Nu nh chng ta phn loi khng ng th h thng chng ta s cng knh, hot ng khng hiu qu, kh khn trong vic trin khai v lp trnh. Tuy nhin nu chng ta c ci nhn tt v vic phn loi cc i tng, xy dng cc lp chnh xc s dn ti h thng chng ta thit k r rng, v trin khai cng d hn, nhanh hn, trnh c vic trng lp cng vic. Khng c mt quy nh chung no tm ra c s phn loi tt nht, tt c u phi da trn kinh nghim v yu cu ca h thng hin ti.

3.1. Tm quan trng ca vic phn loi hp lVic xc nh cc lp v cc i tng l mt trong nhng phn y th thch ca phn tch v thit k hng i tng. Kinh nghim cho thy rng xc nh bao gm c pht hin v sng to. Thng qua pht hin, chng ta c th nhn ra c nhng lp tru tng v k thut m to nn vn . Thng qua sng to, chng ta a ra nhng khi qut tru tng cng nh cc k thut mi xc nh cc i tng cng tc nh th no. Cui cng, pht hin v sng to l cc vn trong phn loi v vic phn loi l i tm nhng vn tng t nhau. Khi chng ta phn loi, chng ta tm n nhng nhm s vic m c chung mt cu trc hoc cc hnh vi chung, ph bin. Phn loi gip chng ta cch xc nh nhng lp tng qut, v s phn cp gia cc lp vi nhau. Bng vic nhn ra cc tng tc chung gia cc i tng, chng ta a ra cc k thut c coi l quyt nh trong vic thc hin. Vic phn loi cng hng dn chng ta trong vic a ra nhng quyt nh v module ha. Chng ta c th chn v t ton b cc lp v i tng trong cng mt module hoc trong cc module khc nhau, ty thuc vo s ging nhau m chng ta tm thy gia cc lp v i tng . Phn loi cng ng vai tr trong vic ch nh cc quy trnh x l. Chng ta c th t ton b cc quy trnh cng vi nhau trong mt b x l hoc cc b x l khc nhau, ty thuc vo vic ng gi, chc nng hoc l tin cy.

3.2. Xc nh cc lp v i tngVn phn loi c v s cc nh trit hc, ngn ng hc, cc nh khoa hc v c cc nh ton hc c bit quan tm. Chng ta c th tham kho nhng kinh nghim ca h trong lnh vc phn loi ny vo vic thit k hng i tng nh s phn loi. Phng php tip cn c in v hin i C 3 hng tip cn ph bin thng c dng phn loi:

17

-

Loi c in. Nhm khi nim. L thuyt nguyn mu

Loi c in Trong hng tip cn c in phn loi, Tt c cc thc th m c mt thuc tnh hoc mt tp cc thuc tnh ging nhau to ln mt loi. Nh l cc thuc tnh cn thit v nh ngha mt loi. Nhm khi nim. Vi hng tip cn ny th cc lp c to ra do vic xy dng cc khi nim m t u tin ca lp ny v sau phn loi cc thc th theo cc m t. L thuyt mu Mt lp ca cc i tng c miu t bi mt i tng nguyn mu, v mt i tng c coi nh l mt thnh vin ca lp nu v ch nu n n tng t vi cc mu ny.

Bi tp1) S phn loi l g? Tm quan trng ca s phn loi? 2) Trnh by phng php xc nh lp v i tng?

18

CHNG IV: PHN TCH V THIT K HNG I TNG S DNG UML4.1. Ngn ng m hnh thng nht UMLUML l ngn ng chun cho vic quy nh cc tiu chun, hnh dung, xy dng, v ti liu ca mt h thng phn mm. UML l vit tt ca Unified Modeling Language. UML hon ton khc vi cc ngn ng lp trnh hng i tng nh C++, java UML c s dng cho vic to cc bn k hoch cho vic pht trin phn mm. UML khng phi l ngn ng lp trnh, nhng cc cng c c th c dng sinh ra m lnh trong cc ngn ng khc nhau. UML c mi lin quan mt thit vi phn tch v thit k h thng hng i tng. V vy trong bi ging ny ti s dng UML nh l mt cng c chnh trong vic thit k v ging dy. 4.1.1 Cc khi c bn trong UML UML ng vai tr quan trng trong vic to nn m hnh khi nim. M hnh khi nim ca UML c th c to bi 3 phn t chnh sau: Cc khi UML Cc lut, nguyn tc kt ni gia cc khi K thut chung ca UML.

Cc khi ca UML c th c nh ngha l: Things. Relationships. Diagrams.

4.1.2. Things Things l cc khi quan trng ca UML. Things c th l: Structural, Behavioral, Grouping v Annotational. Structural things: Structural things nh ngha phn c nh ca m hnh. Chng th hin cc phn t vt l v khi nim. C mt s Strutural things sau: Class: biu din cho mt tp cc i tuwngj c cng trch nhim, nhim v. Phn trn cng biu din tn lp. Phn th 2 biu din cc thuc tnh ca lp. Phn th 3 c dng m t cc thao tc c th c thc hin. Phn th 4 l phn la chn dng hin th thm cc thnh phn ph thm

19

-

Interface: nh ngha mt tp cc thao tc m c t r trch nhim ca h thng. c biu din bng mt hnh trn, bn di ghi tn ca giao din. c dng m t cc chc nng, m t ci chung nht. Trong giao din cha c vit m lnh thc thi.

-

Collaboration: nh ngha s tng tc ln nhau gia cc phn t. Collaboration c biu din bng hnh eclips nt t. Tn ca n c ghi bn trong hnh.

-

Use case: biu din mt tp cc hot ng c thc hin bi mt h thng cho mt mc ch xc nh. Use case c biu din bng hnh eclip lin nt vi tn c ghi bn trong hnh.

20

-

Actor c th c nh ngha nh l cc thc th bn trong hoc bn ngoi tng tc vi h thng.

-

K hiu bt u: c dng khi to, bt u mt quy trnh x l.

-

K hiu kt thc: c dng bo hiu kt thc mt qu trnh x l.

-

Active class: c cu to ging vi class nhng ng vin bn ngoi m hn. c dng miu t hnh ng hin hnh ca h thng.

-

Component: M t phn vt l ca h thng. Tn ca n c ghi bn trong hnh v c th add thm cc phn t khc nu cn thit.

21

-

Node: m t phn t vt l m tn ti trong thi gian chy chng trnh. Node c biu din bi hnh vung vi tn c ghi trong hnh.

Behavioral things: Behavioral thing gm c cc phn ng ca m hnh UML. Theo c mt s loi behavioral things sau: Interaction: c nh ngha nh l mt hot ng bao gm mt nhm cc thng ip c chuyn gia cc phn t hon thnh mt nhim v r rng, ring bit. State machine: State machine nh ngha mt chui cc trng thi m mt i tng phi tri qua trong vic p ng s kin. Cc s kin l nhng tc nhn bn ngoi chu trch nhim thay i. Grouping things: c th c nh ngha nh l mt k thut nhm cc phn t ca m hnh UML li vi nhau. Ch c duy nht mt loi Grouping thing: Package. Annotation things: c th c nh ngha nh l mt k thut nh du, ch thch, m t ca cuc phn t UML. Note l Annotational thing duy nht. 4.1.3. Quan h Quan h gia cc phn t cng l mt khi quan trng ca UML. N cho thy cc phn t c lin kt vi nhau nh th no v s kt hp ny m t chc nng ca chng trnh. C 4 loi quan h c cp sau y: Dependency: l loi quan h gia 2 s vic m khi c mt phn t thay i th cng nh hng ti mt phn t khc.

22

-

Association l lin kt c bn c dng kt ni gia cc phn t trong m hnh UML. N cng m t cc i tng lin kt vi nhau nh th no.

-

Generalization: c th c nh ngha nh l mt quan h m kt ni mt phn t chuyn dng vi nhng phn t chung. N m t quan h k tha ca cc i tng.

-

Realization: c th c nh ngha nh l mt quan h trong 2 phn t c lin kt vi nhau. Mt phn t m t mt s trch nhim m cha c thc thi v mt phn t khc th thc thi chng. Kiu quan h ny tn ti trong trng hp interface.

4.1.4. UML Diagram Tt c cc phn t, quan h gia chng to nn mt biu UML hon chnh v lc ny biu din mt h thng. Biu UML l 1 phn quan trong trong ton b quy trnh. UML bao gm 9 lc sau: Class diagram. Object diagram. Use case diagram. Sequence diagram. Collaboration diagram. Activity diagram. Statechart diagram. Deployment diagram. Component diagram.

4.1.5. Kin trc UML Bt k h thng no cng c s dng bi nhng ngi dng khc nhau. Ngi dng c th l lp trnh vin, pht trin, kim th, nh u t, nh phn tchV vy trc khi thit k mt h thng c hnh thnh vi cc phi cnh khc nhau trong suy ngh ca tng ngi dng. UML ng vai tr quan trng trong vic m t cc cch nhn nhn khc nhau ca h thng. C mt s cch nhn nhn sau y:

23

-

Design ca mt h thng bao gm cc lp, giao din v cc cng tc. UML cung cp biu lp, biu i tng h tr cch thit k ny. Implementation nh ngha cc thnh phn c sp xp li vi nhau to nn mt h thng vt l hon chnh. Biu thnh phn UML c dng h tr thc thi theo cch ny.

-

Process nh ngha lung ca h thng. S dng cc phn t ging nh trong Design. Deployment biu din cc nt vt l ca h thng m to nn phn cng. Lc trin khai c s dng h tr kha cnh ny.

4.2. Cc biu 4.2.1. Class diagram Gii thiu Biu lp l mt dng biu tnh. N biu din ci nhn tnh ca mt ng dng. Biu lp khng ch c dng cho vic m t bn ngoi, lp ti liu ca cc nh hng khc nhau ca h thng m cn xy dng nn m lnh cho ng dng. Trong biu lp miu t cc thuc tnh v cc thao tc ca mt lp v cng ging buc vi h thng. Biu lp c s dng rng ri trong vic thit k m hnh hng i tng bi v ch c biu UML mi c th nh x trc tip sang ngn ng hng i tung. Biu lp biu din mt tp cc lp, giao din, kt hp, cng tc, v ging buc. Biu lp c xem nh l biu cu trc. Mc ch Mc ch ca biu lp l xy dng ln cch nhn tnh ca ng dng. Biu lp l biu m c th nh x trc tip sang ngn ng lp trnh hng i tng. Mc ch ca biu lp c th tm tt nh sau: Phn tch v thit k cch nhn tnh ca ng dng. M t cc trch nhim, chc nng ca h thng. Lm nn tng cho biu thnh phn v biu trin khai.

V biu lp nh th no? Biu lp c nhiu thuc tnh cn phi ch trong khi v nhng y, trong ti liu ny ch cp ti nhng thuc tnh c bn nht v hay dng nht. Mt s im cn ch khi v biu lp: Tn ca biu lp nn t sao cho c th m t c din mo ca h thng. Mi mt phn t v cc quan h ca n phi r rng. Kh nng ca lp (thuc tnh v thao tc) phi r rng v duy nht.

24

-

Ch biu din nhng thuc tnh c bit ca lp, bi v nhng nu chng ta biu din c nhng thuc tnh khng quan trng s lm cho h thng phc tp, ri v kh trin khai.

-

S dng note khi c yu cu m t din mo ca biu . Bi v mc ch cui cng l lm cho ngi dng v lp trnh vin c th hiu c h thng c m t nh th no.

V d: V biu lp ca mt h thng n t hng trong mt ng dng bn hng. H thng ny c m t nh sau: u tiu tt c cc Order (n t hng) v Customer (Khch hng) c xc nh nh l 2 phn t ca h thng v chng c quan h 1-n bi v khch hng c th c nhiu Order (n t hng). Chng ta hy tng tng lp Order l mt lp tru tng v n c 2 lp thc t tn ti (K tha t lp Order) l SpecialOrder v NormalOrder. Hai lp k tha c tt c cc thuc tnh ca lp Order. Thm vo chng c thm cc chc nng nh l dispatch() v receive().

4.2.2. S Object S Object thu c t s lp v vy s i tng c c l da trn s lp. Cc s i tng biu din mt trng hp ca mt s lp. V c bn s lp v s i tng l tng t nhau. S i tng cng biu din cch nhn tnh ca mt h thng nhng hng nhn tnh ny l snapshot ca h thng ti cc thi im khc nhau. S i tng c dng a ra mt tp cc i tng v quan h gia chng.

25

Mc ch Mc ch ca vic s dng s l lm cho chng ta c th hiu c r rng trin khai h thng mt cch hiu qu. Mc ch ca s i tng cng ging nh mc ch ca s lp. S khc nhau gia 2 s l s lp biu din mt m hnh tru tng bao gm cc lp v quan h gia chng. Nhng s i tng biu din mt trng hp ti mt thi im c th. C ngha l s i tng miu t st vi h thng thc hn. Mc ch l ly c hng nhn tnh ca h thng ti mt thi im ring bit. Chuyn ti v nhn li t cc k s phn mm Biu din quan h gia cc i tng ca mt h thng. Hng nhn tnh mt tng tc. Hiu cc hot ng ca i tng v quan h gia chng.

V s i tng nh th no? Nh chng ta cp phn trc, mt s lp l mt trng hp ca s lp. iu ng ni rng, mt s i tng bao gm cc trng hp ca s vic c s dng trong s lp. C hai s c to t cc thnh phn c bn nhng cch thnh lp khc nhau. Trong s lp cc phn t l dng tru tng miu t bn k hoch hoc s v trong s i tng cc phn t l tn ti hin hu biu din i tng trong th gii thc. ly c cc h thng ring bit, s s lp c gii hn. Nhng n chung ta theo di s i tng th chng ta c th khng gii hn cc trng hp ca s ny. T nhng g a ra trn th mt s i tng n khng th ly c tt c cc trng hp hay khng th m t c ht tt c cc i tng ca h thng. V th gii php gii quyt vn ny l: u tin, phn tch h thng v quyt nh trng hp no c d liu v mi lin kt quan trng. Tip theo, theo di cc trng hp ny cng vi tt c cc chc nng c th. La chn mt s trng hp tt nht. S i tng cha cc i tng. Lin kt trong s i tng c dng kt ni cc i tng. Cc i tng v cc lin kt l 2 phn t dng xy dng ln mt s i tng. V d: Chng ta s dng v d phn S lp Order management System (H thng qun l n t hng). Khi c khch hng ti t mua hng, ti thi im s c nhng i tng sau: Customer (Khch hng).

Trc khi v s i tng chng ta nn nh mt s iu sau y:

26

-

Order (n t hng). SpecialOrder. NormalOrder.

By gi i tng khch hng (C) c lin kt vi 3 i tng n t hng (O1, O2, v O3). Nhng i tng n t hng ny c lin kt vi n t hng c bit hoc l bnh thng (S1, S2 v N1). Khch hng c 3 n t hng vi cc s lng khc nhau (12, 32 v 40) cho tng thi im theo di.

Khch hng c th tng s lng n t hng ln trong thi gian ti v trong trng hp s lng s i tng s phn nh rng: nu n t hng, i tng n t hng c bit hoc l bnh thng c theo di th chng ta s tm thy chng c mt vi gi tr. Vi cc n t hng c gi tr l 12, 32 v 40 cho thy rng cc i tng c gi tr ti thi im c quan st. 4.2.3. S thnh phn Cc s thnh phn c dng xy dng ln din mo vt l ca h thng. Vy chng ta t hi din mo vt l ca h thng l g? Din mo vt l ca h thng l cc thnh phn ging nh cc tp tin, cc th vin, cc ti liu, cc tp tin c th thc thi tn ti bn trong node. V vy, cc s thnh phn c dng m t mng tng v cch t chc v mi quan h gia cc thnh phn trong h thng. Nhng s ny cng c dng to cc h thng c th thc thi. Mc ch S thnh phn l mt loi s c bit trong UML. Mc ch ca n cng khc vi cc s khc. N khng miu t cc chc nng ca h thng nhng n miu t cc thnh phn c dng to nn cc chc nng . S thnh phn c th c miu t nh l s thi hnh tnh ca h thng. S thi hnh tnh biu din cch t chc cc thnh phn ti cc thi im ring bit. Mt s thnh phn n khng th biu din c toan b h thng nhng mt tp hp cc s c dng biu din ton b h thng. V th nhng mc ch ca s thnh phn c th c tm tt nh sau:

27

-

Hnh dung cc thnh phn ca h thng. Xy dng kh nng c th thc thi bng vic chuyn ti v nhn li t cc k s phn mm. M t cch t chc v quan h gia cc thnh phn.

V s thnh phn nh th no? S thnh phn c dng m t cc phn vt l ca h thng. Cc phn ny c th l tp tin, file thc thi, th vinV th mc ch ca s ny c khc, S thnh phn c s dng trong sut giai on thi hnh ca ng dng. Ban u, h thng c thit k bng vic s dng cc s UML khc v sau khi cc dng c l cc s thnh phn c s ly mt tng ca vic thi hnh. S ny rt quan trng bi v nu khng c n khng mt ng dng no c thi hnh mt cch hiu qu. V vy trc khi v s thnh phn cc dng c sau phi c xc nh r rng: Cc tp tin c dng trong h thng. Cc th vin v cc dng c khc lin quan ti ng dng. Quan h gia cc vt dng. S dng mt tn y ngha xc nh thnh phn cho mi s c v Chun b cc ti liu trc khi s dng cng c. S dng node ghi ch nhng im quan trng.

Sau khi xc nh cc dng c, vt dng, mt s im sau cn c lu :

Di y l s thnh phn cho h thng qun l n t hng ca v d phn trc. y dng c l cc tp tin. V th s biu din cc tp tin trong ng dung v mi quan h gia chng. Trong thc t s thnh phn cha dlls, cc th vin, cc th mc Trong s thnh phn di y 4 tp tin c xc inh v quan h gia chng c to ra. S thnh phn khng ging nh cc s UML khc bi v n c mc ch khc cc s trc.

28

4.2.4. S trin khai S trin khai c dng hnh dung cu trc ca cc thnh phn vt l ca h thng ni m cc thnh phn phn mm c trin khai. V vy, cc s trin khai c s dng miu t hng nhn trin khai tnh ca h thng. S trin khai bao gm cc node v cc mi quan h gia chng. Mc ch T trin khai bn thn n cng m t c mc ch ca s . S trin khai c dng m t cc thnh phn phn cng ni m phn mm c trin khai. S thnh phn v s trin khai c quan h cht ch vi nhau. S thnh phn c dng miu t cc thnh phn v s trin khai miu t cc thnh phn c trin khai nh th no trong phn cng. UML c s dng thit k tp trung v cc dng c phn mm ca h thng. Nhng 2 s l 2 s c bit c to ra tp trung vo cu trc phn cng ca h thng. S trin khai c s dng bi cc k s h thng. C th tm tt cc mc ch ca s trin khai nh sau: Hnh dung cu trc phn cng ca h thng. M t cc thnh phn phn cng ca h thng c dng trin khai cc thnh phn phn mm. Miu t qu trnh thc thi. V s trin khai nh th no?

29

S trin khai biu din hng nhn trin khai ca h thng. N lin quan ti s thnh phn. Bi v cc thnh phn c trin khai s dng s trin khai. Mt s trin khai bao gm cc nt. Cc nt l nothing nhng l cc phn cng vt l c dng trin khai ng dng. Cc s trin khai rt hu ch cho cc k s h thng. Mt s trin khai tt l rt quan trng n nh hng ti cht lng ca ng dng. N nh hng ti cc chc nng sau: Vic thc thi. Kh nng m rng Kh nng bo tr Portable

Khi v mt s trin khai chng ta nn xc nh Cc nt Quan h gia cc nt

Di y l mt v d v s trin khai ca h thng qun l n t hng. Chng ta xc nh cc nt sau: Mn hnh. Modem Caching Server Server

Gi s ng dng c trin khai di dng WEB v chia ra cc lm 3 cm server: server 1, server 2, server 3. Ngi dng s kt ni ti ng dng qua ng truyn internet. Vic iu khin s c iu khin t caching server ti cc cm.

30

4.2.5. S Use Case xy dng mt h thng, iu quan trng l phi x l v theo di c nhng hnh vi ng. Hnh vi ng ngha l nhng hnh vi ca h thng khi chng trnh chy hoc hot ng. V vy ch c hnh vi tnh th khng xy dng ln mt h thng m chng ta cn phi c c nhng hnh vi ng. Trong UML c 5 s xy dng hnh vi ng ca h thng v s use case l mt trong s . C nhng tc nhn bn trong v bn ngoi h thng c bit nh l nhng actors. V th s use case bao gm cc actors, use case v cc mi quan h gia chng. S ny c s dng xy dng ln h thng hoc cc h thng con ca ng dng. Mt s use case biu th mt chc nng ring bit ca h thng. V th xy dng ton b h thng th chng ta cn phi xy dng nhiu hn mt s use case. Mc ch Mc ch ca s Use case l nm bt cc kha cnh ng ca h thng. N c dng thu thp nhng yu cu ca h thng bao gm nhng tc nhn bn trong hoc bn ngoi. Nhng yu cu ny phn ln l yu cu thit k. V vy khi phn tch h thng thu thp nhng chc nng c th cc use case c chun b v cc tc nhn (actors) c xc nh. C th tm tt cc mc ch ca vic s dng s use case nh sau: c dng thu thp cc yu cu ca h thng. c s dng c ci nhn khch quan t bn ngoi ca h thng. Xc nh cc yu t bn trong v bn ngoi nh hng ti h thng. Ch ra tng tc gia cc yu cu v cc tc nhn.

V s Use case nh th no? S use case c xem nh l phn tch yu cu mc cao ca h thng. v vy, khi yu cu ca h thng c phn tch cc chc nng c thu thp li trong use case. Trong s tc nhn, cc tc nhn c th l ngi dng, cc ng dng bn trong khc, hoc cc ng dng bn ngoi. V vy khi v s use case ta cn xc nh mt s phn t sau. Chc nng c biu din nh mt use case. Cc tc nhn. Quan h gia cc use case v tc nhn. Tn ca use case rt quan trng. Chn tn sao cho c th xc nh c chc nng c thc hin. t tn cho cc tc nhn mt cch d nh. Ch ra cc mi quan h v c lp trong s . S dng note khi yu cu lm r mt vn quan trng no .

Khi v s use case chng ta cn ch mt s im sau:

31

Tip theo v d trn, ta v s use case th hin h thng qun l n t hng. Trong v ny ta xc nh c 3 use cases (Order, SpecialOrder, NormalOrder) v mt tc nhn l Customer. SpecialOrder v NormalOrder use cases c suy ra t Order use cases. Vi vy chng c quan h m rng vi nhau. Mt im quan trng khc l xc nh ranh gii ca h thng. Tc nhn customer nm ngoi h thng c xem nh l ngi dng ngoi h thng.

4.2.6. S tng tc Ngay t ci tn l s tng tc chung ta cng c th hiu c s ny c dng miu r cc kiu tng tc gia cc thnh phn khc nhau trong m hnh. V vy tng tc l mt phn ca hnh vi ng ca h thng. Hnh vi tng tc c biu din trong UML bng 2 s c bit nh l Sequence diagram v Collaboration diagram. Sequence diagram nhn mnh v cc chui thng bo v collaboration diagram nhn mnh v cu trc t chc ca cc i tng m gi v nhn thng bo. Mc ch Mc ch ca biu tng tc l hnh dung hnh vi tng tc ca h thng. Hnh dung cc hnh vi tng tc l cng vic kh. V vy gii php l s dng cc m hnh khc nhau nm bt c cc din mo khc nhau ca qu trnh tng tc. l v ti sao sequence v collaboration diagram c s dng nm bt bn cht ng nhng khc vi di chuyn. V vy mc ch ca vic dng s tng tc c th c miu t ngn gn nh sau: nm bt cc hnh vi ng ca h thng. m t lung thng bo trong h thng. m t cu trc t chc ca cc i tng. M t s tng tc gia cc i tng.

32

V s tng tc nh th no? Nh chng ta tho lun t trc mc ch ca s tng tc l nm bt nhng din mo thay i ca h thng. V vy nm bt nhng din mo thay i chng ta cn hiu ci g l din mo ng v n c hnh dung nh th no. Din mo ng c th c nh ngha nh l chp nhanh li din mo ca h thng ang chy ti cc thi im ring bit. Chng ta c 2 loi s tng tc trong UML. Mt l s trnh t v ci khc l s cng tc. Chng ta cn phi xc nh cc things trc khi v s : Cc i tng trong qu trnh tng tc. Cc lung thng bo gia cc i tng. Trnh t trong cc thng bo c truyn i. T chc i tng.

V d: Chng ta thc hin v s tng tc cho bi ton h thng qun l n t hng. S v u tin l s trnh t v th 2 l s cng tc. S trnh t: i vi s trnh t s c 4 i tng cn quan tm (Customer, Order, SpecialOrder v NormalOrder). u tin, khch hnh s gi mt n t hng ti i tng Order. i tng s gi mt lnh xc nhn confirm() ti SpecialOrder. i tng SpecialOrder s gi mt lnh Dispatch() ti chnh n.

S cng tc: Biu ny biu din cch t chc cc i tng

33

4.2.7. S statechart Mc ch ca vic s dng s Statechart l miu t cc trng thi khc nhau ca mt thnh phn trong h thng. Cc trng thi l l ring bit, c th i vi mt thnh phn, i tng ca mt h thng Vic s dng s statechart cng th hin c cc trng thi ca tng thnh phn, i tng trong h thng c iu khin bi cc s kin trong v ngoi h thng nh th no. Mc ch: S trng thi l mt trong 5 s UML c dng xy dng ln tnh nng ng ca mt h thng. S trng thi nh ngha cc trng thi khc nhau ca mt i tng trong sut vng i ca n. V nhng trng thi ny c thay i bi cc s kin. V vy, s trng thi rt hu ch trong vic xy dng ln h thng tc ng tr li. H thng tc ng tr li c th c nh ngha nh l mt h thng m p tr li cc s kin bn ngoi v bn trong. S trng thi m t lung iu khin t trng thi u tin ti trng thi khc. Cc trng thi c nh ngha nuh l mt iu kin trong mt i tng tn ti v i tng thay i khi mt vi s kin c gy ra. V vy mc ch quan trng nht ca s trng thi l xy dng vng i ca mt i tng t khi khi to ti khi kt thc. Tm li, mc ch ca s trng thi ca th m t tm tt nh sau: xy dng din mo thay i ca h thng. xy dng vng i ca mt h thng tng tc. M t cc trng thi khc nhau ca i tng trong sut thi gian sng ca n. nh ngha trng thi ca b my xy dng ln trng thi ca mt i tng.

V s trng thi nh th no? S trng thi c s dng m t cc trng thi ca cc i tng khc nhau trong ton b vng i ca n. V vy, im ni bt c a ra l trng thi thay i da trn cc s kin

34

trong v ngoi h thng. Trng thi ca cc i tng ng vai tr quan trng trong vic phn tch v trin khai chng mt cch ng n, chnh xc. Trc khi v mt s trng thi chng ta phi r rng mt s im sau: Nhn bit cc i tng quan trng c phn tch. Nhn bit cc trng thi. Nhn bit cc s kin.

V d di y m t s trng thi ca i tng Order. Trng thi u tin l trng thi khi u m t tin trnh bt u. Cc trng thi tip theo c n t cc s kin nh l send request, confirm request, v dispatch order. Nhng s kin ny chu trch nhim cho vic thay i trng thi ca i tng Order. Trong sut ton b vng i ca h thng n i qua mt chui cc trng thi v c th b thot khng ng quy trnh. Vic thot khng ng quy trnh c th xy ra trong mt vi trng hp ca h thng. Khi ton b vng i c hon thnh n c xem nh l hon thnh mt giao dch. S trng thi ca i tng Order c m t nh hnh di y:

4.2.8. S hot ng S hot ng l mt s quan trng khc trong UML m t hin mo thay i ca h thng. S hot ng c bn l mt lung biu biu din lung bt u t hot ng u tin ti hot ng khc. Hot ng ny c th c m t nh l hot ng ca h thng. V vy iu khin lung c v t mt thao tc ti thao tc khc. S hot ng gii quyt tt c cc lung iu khin bng vic s dng cc thnh phn nh l fork, join Mc ch:

35

S hot ng khng ch s dng cho vic cung cp ci nhn trc quan v h thng m cn c s dng xy dng ln h thng c th thc thi bng vic chuyn tip v o ngc. Mc ch ca s hot ng c th c tm tt nh sau: V lung hot ng ca h thng. M t chui t mt hot ng vi mt hot ng khc. M t lung song song, nhnh v ng thi ca h thng.

V s hot ng nh th no? S hot ng c s dng nh l mt flow chart bao gm cc hot ng c thc hin bi h thng. Nhng s hot ng khng chnh xc l mt flow chart. Trc khi v mt s hot ng chng ta phi hiu r v cc phn t c s dng trong s hot ng. Phn t chnh ca mt s hot ng l hot ng ca bn thn n. Mt hot ng l mt chc nng c thc hin bi h thng. Sau khi xc nh cc hot ng chng ta cn hiu chng kt hp vi cc rng buc v iu kin nh th no. Nh vy khi v s hot ng chng ta phi xc nh c cc phn t sau: Cc hot ng. Lin kt, kt hp Cc iu kin Cc ging buc. Gi n t hng ti khch hng. Nhn n t hng. Xc nhn n Gi n t hng i.

S di y c v vi 4 hot ng chnh.

Sau khi nhn c n t hng, iu tra iu kin c thc hin kim tra xem n t hng l 1 trong 2 loi normal hay special order. Sau khi loi n t hng c xc nh hnh ng gi i c thc hin v c xem nh l kt thc mt tin trnh hot ng.

36

Bi tp1) Biu lp l g? Mc ch v cch v biu lp (Class diagram)? 2) Biu i tng l g? Mc ch v cch v biu i tng (Object diagram)? 3) Biu Use case l g? Mc ch v cch v biu Use case? 4) Biu tun t l g? Mc ch v cch v biu tun t (Sequence diagram)?

37

CHNG V: QUY TRNH PHN TCH V THIT K5.1. Nn tngPhn tch yu cu l cng vic bao gm cc tc v xc nh cc yu cu cho mt h thng mi hoc c thay i, da trn c s l cc yu cu (c th mu thun) m nhng ngi c vai tr quan trng i vi h thng, chng hn ngi s dng, a ra. Vic phn tch yu cu c ngha quan trng i vi thnh cng ca mt d n. Vic phn tch yu cu mt cch c h thng cn c gi l k ngh yu cu (requirements engineering). i khi n cn c gi mt cch khng tht chnh xc bng nhng ci tn nh thu thp yu cu (requirements gathering, requirements capture), hoc c t yu cu (requirements specification). Thut ng "phn tch yu cu" cn c p dng c th cho cng vic thun ty phn tch (thay v cc vic khc chng hn nh lm r yu cu hay vit ti liu yu cu). Ty theo mc phc tp ca phn mm lm ra, ngi thit k phn mm s t nhiu dng n cc phng tin to ra mu thit k theo mun (chng hn nh l cc s khi, cc lu , cc thut ton v cc m gi), sau mu ny c m ho bng cc ngn ng lp trnh v c cc trnh dch chuyn thnh cc khi lnh (module) hay/v cc tp kh thi. Tp hp cc tp kh thi v cc khi lnh lm thnh mt phn mm. Thng khi mt phn mm c to thnh, cho hon ho th phn mm phi c iu chnh hay sa cha t khu thit k cho n khu to thnh phin bn phn mm mt s ln. Mt phn mm thng thng s tng thch vi mt hay vi h iu hnh, ty theo cch thit k, cch vit m ngun v ngn ng lp trnh c dng.

5.2. Quy trnh v m: Vng i ca trin khai phn mmMc ch ca quy trnh v m l hng dn ton b trin khai h thng. Mt cch c bn l hng dn to ra h thng. Phm vi ca quy trnh v m l t mt tng ban u ca h thng phn mm m thc hin trin khai tng . 5.2.1. Quy trnh v m theo ni dung Quy trnh v m theo ni dung bao gm mt s cc giai on sau: Yu cu (Requirements): Thit lp v duy tr s tha thun vi cc khch hng v cc nh u t khc trn nhng g h thng nn lm. Thit lp gii hn ca h thng. Phn tch v thit k: Bin i nhng yu cu trong thit k h thng, ci m phc v nh l mt c t ca s thi hnh trong mi trng thi hnh chn. Thi hnh (Implementation): thi hnh, kim tra v tch hp h thng, kt qu mt h thng c th thc thi.

38

-

Kim nh: Kim nh thc thi m bo rng hon thnh cc yu cu. Xc nhn thng qua cc bn demo m phn mm thc hin cc chc nng nh thit k. Trin khai: m bo rng sn phm phn mm l sn sng cho ngi dng cui ca n.

Cc quy tc sau s c thc hin qua vng i ca phn mm Qun l d n: Qun l d n pht trin phn mm, bao gm: ln k hoch, phc v v gim st d n cng nh qun l ri ro. Qun l cu hnh v s thay i: Xc nh cu hnh cc mc, iu khin s thay i ca cc mc v qun l cu hnh ca cc mc . Mi trng: Cung cp mi trng pht trin phn mm bao gm c cc quy trnh v cng t m h tr cho i trin khai.

5.2.2. Quy trnh v m theo thi gian Mc v giai on a. Giai on bt u (Inception): Mc ch: Mc ch ca giai on khi u l m bo rng d n c tnh ng dng v kh thi.

Hot ng: Trong sut giai on Khi u, bn thit lp v u tin nhng yu cu ct yu ca h thng, t c tha thun vi khch hng trn nhng g c xy dng, m bo rng bn hiu v nm c nhng ri ro km theo vic xy dng mt h thng v quyt nh mi trng trin khai no c s dng (gm c quy trnh v cng c).

39

Sn phm (Work Products): Sn phm chnh ca giai on khi u l tm nhn v nhng g c xy dng, cc thuc tnh hnh vi, mt danh sch ri ro, xc nh kiu kin trc k thut v mi trng pht trin. Tm nhn cung cp mt cch m t r rng v nhng g c xy dng bao gm phm vi ca n, c trng, nh hng qua li v quan h vi cc h thng tn ti cng nh l bt k cc rng buc phi c theo di, xem xt. Mc (Milestone): Phm vi c hiu. Giai on Khi to c hon thnh khi c s hiu r rng v nhng g c xy dng (ton b phm vi v cc yu cu chnh ca h thng), hiu r s u tin ca cc yu cu lin quan. b. Chi tit b sung (Elaboration): Mc ch: iu u tin l nhng g cn xy dng phi c hiu v t c s ng , chp thun. Hot ng: Giai on Elaboration bao gm vic quyt nh a ra kin trc, thit lp phn nn tng ca kin trc, trin khai phn ct li, kim nh v tinh chnh nn tng xy dng h thng da trn kt qu ca vic kim nh. Sn phm (Work Product): Trong sut giai on Elaboration, kin trc c ph duyt bng vic tao ra mt chui kin trc c th thc thi. Kt qu ca giai on Elaboration khng ch cung cp mt ti liu v kin trc m cn bao gm nhng n phm thc t ca h thng. Mc: Giai on Elaboration c hon thnh khi kin trc c xc lp tnh hp l vi tt c cc yu cu ca h thng v v chc nng v khng chc nng, v khi tt c cc ri ro c gim bt xc nh gi v lch biu cho qu trnh trin khai h thng. c. Xy dng (Construction) Mc ch: Xy dng mt kin trc n nh, tp trung vo vic chuyn t hiu vn v xc nh nhng gii php chnh ti vic trin khai mt sn phm c th trin khai. Hot ng: Trong sut giai on xy dng, vic pht trin h thng c hon thnh da trn kin trc c s c xy dng t giai on trc. Sn phm: Trong sut giai on ny, mt chui cc n bn c th thc thi c a ra p ng nhng kch bn, yu cu ca ngi dng cui. Mc: H thng sn sng cho ngi dng cui kim tra: Giai on xy dng hon thnh khi cc chc nng v cht lng ca cc n bn l cn thit trin khai ti ngi dng cui cho mt s ngi dng cui khc kim tra. d. Chuyn giao. Mc ch: Giai on chuyn giao c thc hin khi bn chc chn sn phm c th c chp nhn bi ngi dng cui. Hot ng: Trong sut giai on chuyn tip, sn phm c cung cp ti ngi dng cho vic nh gi v kim nh. Sau nhm trin khai thu thp nhng phn hi ca ngi dng. Trong giai on ny ch yu tp chung vo lm cho chng trnh khp vi yu cu,

40

thit lp cu hnh, ci t v hng dn s dng. Cc ti liu h tr dng chng trnh c hon thin v gi cho ngi dng cui. Sn phm: Sn phm c a ra trong sut giai on chuyn giao bao gm sn phm ng gi, ti liu h tr, ti liu hng dn. Mc: H thng sn sng cho vic trin khai. 5.2.3. Quy trnh v m theo thi gian Lp i lp li Trong quy trnh v m, cc mc t c bng vic thc hin 1 hoc nhiu ln lp li v nhng ln lp li ny c th bao gm cc hot ng trong bt k vo trong ton b quy tc. Tuy nhin, thi gian lp li s dng trong cc quy tc khc nhau ph thuc vo xut hin trong giai on lp no. Nu qu trnh lp li c thc hin trong giai on khi u, phn ln thi gian s c s dng trn vic x l cc yu cu. Nu qu trnh lp li c thc hin trong giai on chi tit, phn ln thi gian s c s dng trn vic phn tch v thit k. Nu qu trnh lp li c thc hin trong giai on xy dng th phn ln thi gian c s dng trn vic trin khai v kim nh. Tt nhin, i vi mt s disciplines, nh l cu hnh v thay i quan l, mi trng, qun l d n, c thc hin thng qua vng i ca chng trnh.

Hnh trn miu t mt d n di chuyn thng qua mt chui qu trnh c lp i lp li. Kch thc ca cc hp trong mi giai on biu th lng thi gian c s dng trn giai on .

5.3. Quy trnh vi m: Qu trnh phn tch v thit kNh hnh m t di y, qu trnh phn tch v thit k h thng c thc hin trong ton b qu trnh pht trin phn mm. Qu trnh v m cung cp u vo cho qu trnh vi m v s dng u ra ca qu trnh vi m. c bit qu trnh vi m ly yu cu c cung cp bi qu trnh v m v sn xut ra c t thit k m c thc hin, kim th v trin khai trong qu trnh v m.

41

Chng ta m t qu trnh v m trong 2 lnh vc l thi gian v ni dung, y chng ta cng s m t qu trnh vi m trong 2 lnh vc l khi nim v ni dung.

5.3.1. Mc tru tng, khi nim Trong qu trnh vi m, cc giai on ph bin, truyn thng ca phn tch v thi k l tp trung vo vic lm m v thay th c thc hin ti cc mc khc nhau ca tru tng. Phn tch ly cc yu cu ca h thng v a ra mt gii php ban u, v thit k ly kt qu ca qu rnh phn tch v a ra mt c t m c hiu qu trong vic thc hin. Vic phn tch c xem nh l hon thnh khi n biu din ng n, chnh xc cc yu cu ca h thng, l ph hp v c th phc v tt cho vic thit k. Vic thit k c xem nh l hon thnh khi n m t chi tit thc hin v kim nh. Phn tch tp trung vo hnh vi ch khng phi cu to. Trong phn tch, bn tm n xy dng mt th gii bng vic xc nh cc phn t m to nn cc vn trong h thng v m t chc nng ca chng, trch nhim v s cng tc. Trong thit k, bn sng to ra cc phn t m cung cp cc hnh vi m cc phn t trong giai on phn tch yu cu. Bn bt u qu trnh thit k ngay khi bn hon thnh vic xy dng m hnh cc hnh vi ca h thng. Phn tch v thit k c thc hin ti cc mc ca tru tng qua vng i pht trin. S mc khng th xc nh, n ph thuc vo phm vi ca h thng.

42

Cc hnh ng Qu trnh vi m bao gm mt tp cc hnh ng, m c thc hin cho phm vi xc nh v ti mc tru tng xc nh. Xc nh cc phn t? Tm hiu, khm ph hoc xut cc phn t s s dng. nh ngha s kt hp gia cc phn t: M t cc phn t kt hp vi nhau nh th no cung cp cc hnh vi m h thng yu cu. nh ngha cc mi quan h gia cc phn t. nh ngha cc mi quan h gia cc phn t, h tr cho s kt hp cc phn t. nh ngha semantic ca cc phn t: Thit lp cc hnh vi v cc thuc tnh ca cc phn t, chun b cc phn t cho mc tru tng tip theo. Cc hot ng ca qu trnh vi m c m t bi hnh sau:

Sn phm C 2 sn phm chnh s c sinh ra trong qu trnh vi m: M t kin trc: M t kin trc ca h thng, bao gm c vic miu t k thut chung. Vic m t bao gm cu trc cn thit cho din mo ca m hnh phn tch v thit k.

43

-

M hnh phn tch thit k bao gm cc phn t phn tch thit k ca gii php phn mm v vic t chc chng, cng nh cc mi quan h m miu t hnh vi yu cu ca h thng c thc hin nh th no trong cc phn t .

Qu trnh vi m v mc tru tng Qu trnh vi m p dng nh nhau i vi kin trc s d n v k s ng dng, s khc bit l mc tru tng c cp. T gc nhn ca kin trc s, qu trnh vi m cung cp mt khun mu cho pht trin v khm ph kin trc thay th. T quan im ca k s, qu trnh vi m cung cp cc hng dn trong vic ra quyt nh thch ng vi tng kiu cu trc. Khi thc hin phn tch kin trc, qu trnh vi m tp trung vo vic to mt phin bn ban u ca kin trc, nhng kin trc ny thc y cc kin trc tn ti hoc cc kin trc nn tng ban u. Trong qu trnh thit k kin trc, kin trc ban u c pht trin t kin trc phn tch m c lc, la chn da trn nhng kinh nghim trong sut qu trnh phn tch kin trc. Qu trnh vi m tp trung vo vic chn lc cc phn t c phn tch r rng, cc phn t thit k v trch nhim ca chng. Cc phn t thit k c nh ngha ti mc ny biu din cc khi chnh ca ton b kin trc nn tng v cc mi quan h ca chng xc nh ton b cu trc ca h thng. Cc k thut phn tch cng c chn la vo trong k thut thit k m thc y cc cng ngh trc . Vic s dng li cng ng vai tr quan trng. Trong thnh phn phn tch, qu trnh vi m tp trung vo vic phn tch cc phn t xc nh v trch nhim cng nh l tng tc gia chng. Vic phn tch cc phn t ny miu t gn ng cc thnh phn ca h thng m c s dng trong qu trnh thit k thnh phn d xc nh vic thit k cc phn t. Trong thnh phn thit k, qu trnh vi m tp trung vo vic chn lc vic thit kt cc thnh phn bng vic nh ngha n trong cc lp m c th thc thi trc tip bng cc k thut thc hin chn. Trong sut qu trnh thit k chi tit, bn tip tc chn la cc lp thng qua lm vic vi cc ni dung, hnh vi v quan h ca chng. Qu trnh chn la nn dng li khi c chi tit cho vic thit k cc lp c thc thi.

Bi tp1) Trnh by quy trnh xy dng phn mm? 2) Trnh by quy trnh phn tch v thit k trong xy dng phn mm?

44

CHNG VI: P DNG PHN TCH BI TON C TH6.1. H thng iu khin: Qun l h thng giao thngKhi u mt s nc tin tin th vic s dng h thng xe la c coi nh l ph bin. Ngi dn vn thch s dng h thng xe la i li nhng cung ng di. Hn na, vic s dng xe la i li cng c coi nh l phng tin an ton nht trong cc phng tin ng b. Chng ta c th thy rng h thng xe la cc nc pht trin rt mnh bi v n mang li hiu qu kinh t cao hn so vi cc phng tin khc. V vy, i vi mt h thng xe la cn phi c gim st cht ch, bi v mi chuyn sc vn chuyn c n c th ln ti hng trm thm ch hng ngn ngi. Trong bi ny chng ta tp phn tch mt h thng qun l ng xe la bng vic xc nh cc yu cu v h thng tc nhn. Yu cu cho h thng qun l tuyn ng xe la: H thng qun l tuyn ng xe la c 2 chc nng chnh: Dn ng v gim st tuyn ng. Cc chc nng lin quan bao gm lp k hoch, d bo li, theo di vt tuyn ng, gim st giao thng, trnh va chm, xung t tuyn ng v ghi li nht k. T nhng chc nng trn, chng ta c th a ra 8 use cases sau: Route Train: Thit lp mt k hoch, k hoch ny vch r cc tuyn ng m xe la s i qua. Plan Traffice: Thit lp mt k hoch giao thng m cung cp hng dn trong vic trin khai k hoch tuyn xe la ti mt thi gian nht nh v mt vng nht nh. Monitor Train Systems: Gim st h thng xe la cho nhng chc nng thch hp. Predict Failure: Thc hin phn tch nhng iu kin ca h thng v a ra nhng cnh bo li lin quan ti k hoch vn hnh ca tng tuyn xe la. Track Train Location: Gim st v tr ca cc xe la. Monitor Traffic: Gim st tt c cc tuyn xe la trong mt vng. Avoid Collision: a ra bin php, c th l t ng hoc lm th cng trnh nhng v va chm trn tuyn xe la. Log Maintenance: a ra bin php ghi li nhng nht k thc hin trn tuyn xe la. Nhng use cases ny thit lp cc yu cu chc nng c bn cho h thng qun l giao thng xe la. Chng cho ta bit h thng phi lm nhng g i vi ngi s dng n. Thm vo chng ta

45

c nhng yu cu khng c chc nng v ging buc m tc ng ln cc yu cu c nh r bi cc use case ca chng ta: Nhng yu cu khng c chc nng: Vn chuyn hnh khch v hng ha an ton. H tr tc xe la ln ti 250 dm/gi. Cung cp mt h thng hot ng chnh xc mc 99.99% Cung cp cc y cc chc nng, trch d tha. Cung cp v tr chnh xc ca tu trong vng 10 yards. Cung cp chnh xc vn tc ca xe la. p ng u vo trong vng 10s. p ng cc tiu chun quc gia Ph hp v gi thnh c v phn cng v phn mm.

Nhng rng buc.

By gi chng ta c nhng yu cu ca bi ton. Quay li bi ton qun l h thng ng xe la ca chng ta. Qua tm hiu v phn tch th chng ta c th a ra 3 kiu ngi dng khc nhau tc ng ti h thng: Dispatcher, TrainEngineer, v Maintainer. Ngoi ra h thng cn giao tip, tng tc vi thit b ngoi, Navstar GPS. Cc tc nhn ng vai tr sau trong h thng. Dispatcher: Thit lp tuyn ng xe la v theo di vic tin hnh ca tng xe la ring bit. TrainEngineer: Gim st tnh trng hot ng ca xe la. Maintainer: Gim st tnh trng duy tri h thng xe la. Navstar GPS: Cung cp dch v nh v dng theo di tu ha.

46

6.2. ng dng Web: H thng theo di k nghNgy nay, i vi nhiu doanh nghip, s t ch v c lp ca cng nhn ngy cng tng. Mi cng nhn c th tham gia vo nhiu d n v th phi phn chia thi gian sao cho hp l. Tng ng vi s thi gian lm vic th i hi thi gian ngh ngi cng phi hp l. V vy, cc nh qun l c t thi gian gp c cng nhn, do vic qun l thi gian lm vic cng nh thi gian ngh gp nhiu kh khn. Gii php c a ra l chng ta xy dng mt h thng cho php theo di thi gian lm vic cng nh k ngh ca mi cng nhn. Khi u Yu cu ca h thng l c miu t mt cch tm tt cc ti liu, cc c tnh ch yu, cc m hnh use case, cc c t use case chnh v cc kin trc cn thit. Yu cu:

47

H thng theo di k ngh s cung cp tng nhn vin ring bit cng vi kh nng qun l thi gian ngh ca h, ngh vic v au m, v thi gian ngh thng nin. H thng s cung cp cc c tnh chnh sau: Thc thi mt cch linh hot cho vic kim chng v xc minh li thi gian yu cu. Cho php qun l ph duyt. Cho php ngi dng c th truy cp li thi gian trc v cho php yu cu c thc hin n mt nm ri trong tng lai. S dng e-mail thng bo yu cu qun l ph duyt v thng bo cho nhn vin bit trng thi thay i. S dng phn cng hin ti. c thc hin, trin khai m rng ca mng ni b hin ti v s dng tnh nng ng nhp mt ln cho tt c cc c ch xc thc. Lu gi li nhng bn ghi cho tt c cc giao dch. Cho php ngi qun l trc tip tng thi gian ngh thm cho nhn vin. Cung cp mt dch v giao din Web cho cc h thng ni b khc truy vn v a ra bt k thi gian ngh ca nhn vin no. M hnh use case mc cao nht cha 4 tc nhn v 8 use case c miu t hnh di y:

Nhn vo s trn, chng ta thy c 4 tc nhn sau; Employee: l ngi s dng h thng ch yu. Mt nhn vin s dng h thng qun l thi gian ngh ca h.

48

-

Manager: l mt nhn vin cng s dng h thng nh cc nhn vin khc vi mc ch tng t nhng c thm mt s quyn cao hn nhn vin bnh thng. C th qun l thi gian gian ngh ca mt nhm nhn vin.

-

Clerk: Mt thnh vin ca h thng qun l ngi c y cc quyn xem h s, d liu c nhn ca mt nhn vin v chu trch nhim cho tt c cc thng tin v nhn vin. Mt th k c th thm hoc loi b bt k mt bn ghi no trong h thng.

-

System Admin: C vai tr chu trch nhim cho h thng chy n nh, trn, khng b li

S trn cn m t cc use case chnh sau: Bi tp 1) p dng phn tch v thit k h thng vo bi ton qun l H s sinh vin? 2) p dng phn tch v thit k h thng vo bi ton qun l Kt qu hc tp ca sinh vin? Manage Time: Miu t cc nhn vin yu cu v xem thi gian ngh nh th no. Approve Request: Miu t mt qun l p ng yu cu ca mt nhm nh th no. Edit Employee Record: Miu t mt Clerk ca h thng chnh sa thng tin ca mt nhn vin nh th no. Manage Locations: Miu t mt Clerk qun l cc bn ghi nh th no. Manage Leave Categories: Override Leave Records: Back Up System Logs. Miu t Admin sao lu d liu.

49

MT S THI MU

50

Trng i Hc Hng Hi Vit Nam Khoa Cng ngh Thng tin B MN H THNG THNG TIN -----***-----

THI KT THC HC PHNTn hc phn: PHN TCH& THIT K HT HNG I TNG Nm hc: x Thi gian: 60 pht Cu 1: (2 im) So snh Phn tch thit k h thng hng cu trc vi Phn tch thit k h thng hng i tng? Cu 2: (2 im) i tng l g? Mi quan h gia cc i tng? Cu 3: (3 im) Trnh by cc phng php phn loi? Ly v d? Cu 4: (3 im) Trnh by cc khi c bn trong UML? ----------------------------***HT***---------------------------Lu : - Khng sa, xa thi, np li sau khi thi thi s: K duyt : x x

51

Trng i Hc Hng Hi Vit Nam Khoa Cng ngh Thng tin B MN H THNG THNG TIN -----***-----

THI KT THC HC PHNTn hc phn: PHN TCH& THIT K HT HNG I TNG Nm hc: x Thi gian: 60 pht Cu 1: (2 im) Trnh by nhng u v nhc im ca Phn tch v thit k h thng hng i tng? Cu 2: (2 im) Lp l g? Mi quan h gia cc lp? Cu 3: (3 im) Lit k cc loi biu (Diagrams) trong UML? Mc ch ca tng loi biu ? Cu 4: (3 im) Biu lp l g? Trnh by mc ch v cch v biu lp trong UML? ----------------------------***HT***---------------------------Lu : - Khng sa, xa thi, np li sau khi thi thi s: K duyt : x x

52

Trng i Hc Hng Hi Vit Nam Khoa Cng ngh Thng tin B MN H THNG THNG TIN -----***-----

THI KT THC HC PHNTn hc phn: PHN TCH& THIT K HT HNG I TNG Nm hc: x Thi gian: 60 pht Cu 1: (2 im) i tng l g? Lp l g? Trnh by mi quan h gia Lp v i tng? Cho v d? Cu 2: (2 im) Trnh by cc khi nim: Use case, Actor trong UML? Cho v d? Cu 3: (3 im) Vng i ca xy dng phn mm? Cu 4: (3 im) Biu tun t (Sequence) l g? Trnh by mc ch v cch v biu tun t trong UML? ----------------------------***HT***---------------------------Lu : - Khng sa, xa thi, np li sau khi thi thi s: K duyt : x x