BI THC HNH MN CNG NGH PHN MM Yu cu: Sinh vin t lp nhm, mi nhm gm 03 sinh vin.

. Chun b bo co gm: bn word in np v slide trnh by bo co. Ni dung: Bi tp 1: Cng ty IT quyt nh sn xut mt my tnh mi cung cp mt mi trng m phng cho cc h thng thi gian thc. Cng ty cn cc cng ngh v h iu hnh mi sn xut my tnh. Phn mm h thng cung cp giao din gia h iu hnh v phn cng cn phi c pht trin. Cng ty quyt nh s dng ngn ng lp trnh Java vit phn mm h thng. Tuy nhin, Java c mt s hn ch trong lp trnh h thng. Nhm pht trin xc nh mt s tnh nng m rng cn c tch hp thm vo chng trnh dch Java lp trnh h thng. c t yu cu c th thay i trong qu trnh pht trin d n. Cc thnh vin pht trin phn mm cho my tnh mi cn chng trnh dch Java bin dch phn mm. Hu ht cc yu cu ca phn mm u cn cc m rng ca chng trnh dch Java chy trn h iu hnh mi. Hy xc nh m hnh pht trin phn mm ph hp pht trin my tnh mi. Yu cu cc sinh vin chia nhm v tho lun. Bi tp 2: Tm hiu v trnh by cc vn sau (ty theo ti): 1. Khi nim, mc ch, nguyn tc, c trng 2. Qui trnh, phng php, cng c 3. ng dng T chn mt trong cc ti trong danh sch sau. STT 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 1. 11. Tn ti Qun l cu hnh phn mm (Configuration Management) Qun l phin bn m ngun Qun l thay i. Qun l ri ro. m bo cht lng phn mm Qun l tin d n phn mm. Nghin cu kh thi. Lp k hoch d n phn mm c lng d n phn mm. Cc m hnh c lng d n. Cng c CASE (Computer Aided Software Engineering ). Khi nim, cc loi cng c CASE v gii thiu mt vi cng c CASE ph bin. M hnh CMM v CMMI

Bi tp 3: Cu 3.1 Hy c t bi iu kin trc v sau cc hm: a. Sp xp mt danh sch cc s nguyn. b. o ngc cc phn t ca mt danh sch c. m s phn t c gi tr e trong mt danh sch cc s nguyn Cu 3.2 Hy c t cc kiu tru tng:

a. c t kiu tru tng cy nh phn b. c t kiu tru tng tp hp Cu 3.3 Hy s dng ngn ng Z c t mt s h thng qun l: a. Qun l thng tin on vin n gin c mt s tnh nng nh: thm, xa, chnh sa mt on vin, tm kim (theo nhiu tiu ch khc nhau) Qun l th vin n gin gm mt s tnh nng nh qun l thm, sa, xa c gi; thm, sa, xa sch; qun l vic thu mn sch,. Bi tp 4: Cu 4.1 Mt chng trnh thng k phn tch mt tp cha tn v im ca sinh vin trong mt nm hc. Tp ny cha nhiu nht 100 trng. Mi trng cha tn ca mi sinh vin (20 k t), gii tnh (1 k t) v im ca 5 mn hc (t 0 n 10). Mc ch chng trnh: tnh im trung bnh mi sinh vin tnh im trung bnh chung (theo gii tnh v theo mn hc) tnh s sinh vin ln lp (im trung bnh trn 5)

Xy dng tp d liu th cho chng trnh trn bi k thut kim th gi tr bin. Cu 4.2 Mt chng trnh dch, trong c cu lnh FOR, c t cu lnh FOR nh sau: Lnh FOR ch chp nhn mt tham s duy nht l bin m. Tn bin khng c s dng qu hai k t khc rng. Sau k hiu = l cn di v cn trn ca bin m. Cc cn trn v cn di l cc s nguyn dng v c t gia t kha TO. Xy dng d liu th kim th cu lnh FOR theo k thut kim th lp tng ng. Cu 4.3 Xy dng d liu th tha mn tiu chun ph tt c cc l trnh ca chng trnh sau:

int pat (char[] subject, char[] pattern) { // Post: if pattern is not a substring of subject, return -1 // else return (zero-based) index where the pattern (rst) // starts in subject nal int NOTFOUND = -1; int iSub = 0, rtnIndex = NOTFOUND; boolean isPat = false; int subjectLen = subject.length; int patternLen = pattern.length; while (isPat == false && iSub + patternLen - 1 < subjectLen){ if (subject [iSub] == pattern [0]){ rtnIndex = iSub; // Starting at zero isPat = true; for (int iPat = 1; iPat < patternLen; iPat ++) { if (subject[iSub + iPat] != pattern[iPat]){ rtnIndex = NOTFOUND; isPat = false; break; // out of for loop } } } iSub ++; } return (rtnIndex); } }