Placement Cell Final 15

Full text

(1)c . PLACEMENT CELL PROJECT REPORT.

(2)

(3)

(4)

(5)

(6)

(7)

(8)

(9) a !

(10) " #"

(11) V

(12)

(13) .

(14)

(15) th gui of !"#$%&'&( Ltu i CSE Ju 2011. DEPARTMENT OF COMPTER SCIENCE & ENGINEERING.

(16)

(17) . . 1.

(18) c . MSALIAR COLLEGE OF ENGINEERING & TECHNOLOGY PATHANAMTHITTA, KERALA 689645 V)* ) )+ V ) ,- ../ *V V V+ ) ). *V *V . This is to tify tht th pojt titl ³'&$ ( #0V ''1 is bo fi o of wo o by V"" &"&( 2 0, "34"%& &', 4 "# 5&# 64, "'(" &(5 ' fo th ptil fulfillm t of th uim ts fo th w of g &$4 ' "# $4#'

(19) % "# V(650 $" #$ +#

(20) "# "#

(21) 7&4&0(&)&#34"#"8 "0%-00&%&( !"#$%&'&( . . . . . . 7 534 6-5(& . 9 $0)5"3 . . . . . . &3704 3 6&0( #0. .

(22)

(23) . . 2.

(24) c .

(25) a

(26)

(27)

(28)

(29)

(30)

(31)

(32)

(33)

(34)

(35)

(36) ÷

(37)

(38)

(39)

(40)

(41) .

(42)

(43) .

(44) !-

(45)

(46)

(47)

(48)

(49)

(50)

(51)

(52) ! "

(53)

(54)

(55)

(56) #$%&'( #)'*#' + '*,)*''()*,. '-(%'* . .

(57)

(58) . . 3.

(59) c . V- :)

(60)

(61)

(62)

(63)

(64)

(65)

(66)

(67)

(68)

(69)

(70) 3 '("

(71) 40%

(72)

(73)

(74) ). :

(75) 7 -

(76)

(77)

(78) !-

(79)

(80)

(81) ! V?.

(82)

(83)

(84)

(85)

(86) ! "

(87)

(88)

(89)

(90) . V V V + ) ) .

(91)

(92) . . 4.

(93) c . V V / V $ ; V $ ; < ; * % ; ;= ) &' ; > && > ) ; > ) &( > ; ) &) > > ) &) > ) (( ; V ) ! (% ;* : V (* / V ) . )// V/ V .> V V * V.

(94)

(95) . . 5.

(96) c . V V This pojt is im t lopi g . pplitio. fo th Ti i g Plm t. Dptm t of th Collg- Th systm is pplitio tht b ss thoughout th og iztio with pop logi poi- This systm b us s pplitio fo th Ti i g Plm t Offis (TPO) of th ollg to m g th stu t i fomtio with g to plm t- Stu ts loggi g shoul b bl to uplo thi i fomtio i th fom of CV- Th y ftu of this pojt is tht it is o tim gisttio - Ou pojt pois th fility of mi ti i g th tils of th stu ts- It lso pois ust list of its to uit th stu ts bs o gi uy-. Ami istto loggi g i. my lso sh y. i fomtio put up by th stu ts- This pojt will i ollgs to pti full IT ploym tThis will lso hlp i fst ss pous i plm t lt tiitis-. ; V This pojt is to filitt stu ts i ollg to gist, sh pply fo jobs- Th uss ss sily to this th t b ti sily i. o tim- I th mi pg. th optio s fo w gist, gist stu t to itly logi usi g us m psswo, submit sum- I. th stu t gisttio. fom, w . gi pso l tils,. utio l ulifitio s, pofssio l sills uplo sum- Th job tils of th pl stu ts will b poi by th mi istto- Th mi istto plys impot t ol i ou pojt- Thy poi ppol of stu t gisttio upti g-. V !* V Computs i fomtio th ology hs mjo i flu o th soity th soity is bomi g mo mo p t o th ology- Goi g o is of simplifyi g lmost ll omplit wos usi g omputs- Th lst fw ys h wit ss tm ous i s i th pbilitis us of omputs- M ul possi g ms th poss slow oth poblms suh s i o sist y mbiguity o optio s- Th popos systm i t s us.

(97)

(98) . . 6.

(99) c . fi ly optio s whih my sol mbiguity- By o sii g ll this ftos, th pplitio s pou, whih pfoms th soil si simply fftily-. 29 $0"8 704 70?& y? Hlp i fst ss pous i plm t lt tiitis y? Th fility of mi ti i g th tils of th stu ts y? This pojt will i ollgs to pti full IT ploym t-.

(100)

(101) . . 7.

(102) c . ; < Systm lysis is til stuy of ious optio pfom by systm th ltio ship withi outsi of th systm- O spt of lysis is fi i g th bou is of systm tmi i g whth o ot it systm shoul o si oth lt systm- A lysis bgi s wh us o m g bgi s stuy of th pogms usi g isti g systm- Systm lysis is pplitio of systm ppoh to th poblm soli g usi g omputs- Th i gi ts th systm lm ts, poss th ologyDui g lysis t is ollt o th ious fils, isio poi ts t stio s h l by th ps t systms- This m s tht to o systm wos, o is to u st th systm o pts how th og iztio s opt s systm th sig ppopit omput bs systm tht will m th og iztio. uim ts- It is tully. ustomiz ppoh to th us of omput poblm soli g- A lysis b fi s th sptio of subst i to pts fo stuy i tpttio , til mi tio - Systm lopm t ols ou lif yl tht bi g with th og istio of us ms- Th itil phs of m gi g systm pojt is pl. i g- To lu h systm i stigtio , w . mst pl tili g stps t , th popl to b ustio outom pt- Systm lysis b tgoiz i to fou pts: y? Systm pl. i g i itil i stigtio. y? I fomtio gthi g y? A lyzi g tools fo stutu lysis y? Fsibility stuy y? Cost B fit A lysis Systm stuy o systm lysis is th fist mo g th fou lif yl phss of systmSystm lysis bgi s wh us o m g ust stuyi g of pogm i ith isti g systm o pojt o - It i ols stuyi g th bs of th og iztio u tly opti g, tii g possi g t to pou i fomtio with gol of tmi i g how to m it wo btt- Systm lysis itslf bs ow i to stgs plimi y til

(103)

(104) . . 8.

(105) c . Dui g plimi y lysis, th lyst th us list th objtis of th systm- To i t plimi y pot, th lyst i tiws y pso. l i th og iztio shuli g. mti gs with th uss m gm tTh objti of lysis phs of th systm lysis sig. is is th. stblishm t of th uim t fo th systm to b ui, lop i stll- I bif lysis of th systm hlps lyst to m l iw of isti g systm thby gi suggstio s fo th impom t of th w systm i fomtio bout th og iztio s, poliis, gols, objtis stutu pli s th i of io m t tht pomots th i toutio of th omput bs systm- It is ssy tht th lyst must b fmili with th objtis, tiitis fu tio s of th og iztio s-. ; * O you fi poblm you h to lyz whth this is fsibl o ot, bus ll possibl solutio s ot fsibl fsibl o is ot lwys possibl- Th til stuis i out to h th wo bility of popos systm- A fsibility stuy is tst of systm poposl gi g to its wo bility, impt o th og iztio bility to mt us s ffti us of sous- Thus wh w pplitio is popos it omlly gos though fsibility stuy bfo it is ppo fo ploym tThus ui g fsibility lysis fo this pojt, followi g pimy s of i tst to b o si- I stigti g th isti g systm i th u i stigtio g ti g is bout w systm os this-. &? $4#"$&'* &"2"'"0% A stuy of sou ilbility tht my fft th bility to hi ptbl systm- This lutio tmi s whth th th ology fo th popos systm is ilbl o oty? It will oi multipl fil h li g y? Rpot g tio is y sy.

(106)

(107) . . 9.

(108) c . y? Th w systm pois full suity of o fi til t. 2?$#("$&'* &"2"'"0% Comput Sis Dptm t will lop th popos systm- Th systm will b lop opt i th isti g hw softw i fstutu- So th is o fo poui g itio l hw softw fo th systm- Th popos will pl th hti ost m pow i ol i th isti g systm- Th mploys will b ti i usi g opti g th systm, thus limi ti g th fo uiti g mploysThus th pojt is o omilly fsibl fo th lopm t fo th omp y. $?$4 35' 3* &"2"'"0% A lutio of th tim, whih is to b t i th lopm t of th pojt- Th tim shul ui fo th lopm t fo this pojt is y impot t si mo lopm t tim ffts mhi tim, ost us ly i th lopm t of oth systms so th pojt is o shoul b omplt withi fi shul tim s th omp y is o - Bsis this, th pojt is ssig to th stu t s mi is to omplt withi fi shul of tim-. #0"0%@ '&0"#4"6"&

(109) &( Pt Ch oigi lly popos E tity Rltio ship Digm (ERD) fo th sig of ltio l t bs systm- Th E R Dtbs mol is bs o pptio of l wol tht o sist of st of bsi objts ll titis ltio ships mo g ths objts- Sts of pimy ompo ts i tifi fo th ERD ; Dt objts, ttibuts, ltio ships ious typ i itos- Th ERD bls us to i tify t tity ltio ships usi g gphil ottio - This mol o sist of th i tlt pis of i fomtio #0"0% &0&29 $0. A Dt Objt is ps ttio of y omposit i fomtio tht must b u stoo by softw .

(110)

(111) . . 10.

(112) c . 00"250 It fi s th poptis of tity ts o o of th iff t htistisThy b us to m i st of th t objt, sib th i st m f s to oth i st i oth tbl '&0"#4"6 E titis o t to o oth i ity of iff t wys y? Ci lity y? Molity. ; ;= ) Th isti g systm is oi g ll th posss m ully- Th pso. l shoul f ll. th os pt fo ys go to simply ow tils- This so tious tim o sumi g- This poss is so iffiult wh th umb of uss i ss-. &?2&$A7B"0"#

(113) %0 ( Th lot of limittio s fo th isti g systms y? Tim o sumi g y? Not ut y? Eo po y? Lg mou ts of os to b pt y? Complit pou y? My ot omplt i tim y? Pp wo is y tious y? Rpot poutio is y slow.

(114)

(115) . . 11.

(116) c . y? All th gists pt fo lo g pio y? Shi g fo fil o o is y iffiult Du to ll this so s w moi g fo th popos systm-. ; > Th popos systm m t to gi mo si ss to th uss tht thy ti i fomtio so uily- Th mi ly th typs of uss thy mi istto, stu t uit- Th mi istto is th mst us; h gts th most umb of pioitis th th oth uss- Th iff t fu tio s i ol th s of mi istto upti g, ppol- Th mi istto iw ppo th ious pplitio foms- Stu ts gist iw th tils- Th uit iw th tils of th stu ts ppo o jt thi pplitio s-. 38&#0&

(117) 766 3%0 ( Th popos systm is i t to oi ll th wbs of isti g systm- It will som mo ftus th th isti g systm- Th popos systm is ost ffti wy of oi g th m ul posss o i th isti g systm- This hlps th og iztio to wi th w i th isti g omptiti wol- Th popos systm is i t to o th followi g: y? E bl to mt hll gs y? Pp pou ut outputs y? Ru th tim y? Ru th p ss y? M i fomtio flow ffii t y? Esy pot g tio y? Attti us i tf-.

(118)

(119) . . 12.

(120) c . > ) Th sig is solutio , th t sltio of uim t i to wys of mti g thm- Th sig will tmi th suss of th systm- Bs o th popos systm objtis, th mjo mouls i tifi th optio s to b i out tmi - I th sig phs of th systm th us i ttio s , t bs tbls, i puts, outputs s sig by usi g ll th ssy fils i ompt m - Th u y uplitio of fils oiSystm sig i ols fist logil sig th physil o stutio s of th systmAft logil sig , til spifitio of th systm, whih sibs th i puts, outputs, fils lop- Dui g th sig phs of th systm th followi g ftos o si? Dt Floos ± th mom t of t i to, ou out of th systm? Dt Stos tmpoy pm t olltio of t? Possos tiitis to pt m ipult li t i fomtio ? Pous mthos outi s to hi th i t sults Th impot of softw sig b stt with si gl wo ulity- Dsig is pl wh ulity is fost i softw lopm t- Dsig is th o ly wy whos uim ts tully t slt i to fi ish softw pout o systm-. > ) Th i put sig is th li tht tis i fomtio systm i to th wol of its uss- I put sig o sist of lopi g spifi pous fo t pptio , stps. ssy to put th. t stio t i th fom tht is usbl fo omput possi g- Mi objtis tht guis i th i put sig stgs : ? Co tolli g th mou t of I puts ? Aoii g i oi t ly.

(121)

(122) . . 13.

(123) c . ? Co tolli g os Th uy of th output p s o th uy of th i put its possi g- Thus, fo this popos systm, th i put sig is i th fomt of wb pgs fo th us i fomt of fom fo th mi isttoVlitio hs to b built i th systm to oi y o tis fom th uss- H th i put sig is th poss of o ti g us oi t i puts to omput bs fomt- So, i put i tf sig ts impot t ol i o tolli g th os Customiz mssgs gi i pl of systm mssgs, whil th t m ipultio is bi g i out- E foi g i tgity, t litio pous o i suh wy tht us is f suh ily o- Th fo, th i put i tf sig shoul b m i suh wy tht it b sily u st bl to th us by usi g m i gful ppopit wos-. > ; ) Comput output is th most impot t it sou of i fomtio to th mi isttoEffii t, i tlligibl output sig shoul impo th systms ltio ship with th ppisl- A mjo fom output, pots, is h opy fom pi t- Wh sig i g output, systm lyst must omplish th followi gy? Dtmi wht i fomtio shoul b ps t y? Di whth to isply, pi t th i fomtio slt th output mium y? A g th ps ttio of i fomtio i ptbl fomt y? Di how to istibuts th outputs. > > ) Dt bs is sig to m g lg bois of i fomtio - Th m gm t of t i ols both th fi itio s of stutus fo th stog of i fomtio - I itio th t bs systm must poi fo th sfty of th i fomtio sol, spit systm shs o u to ttmpts.

(124)

(125) . . 14.

(126) c . t u uthoiz ss- Fo lopi g ffii t tbs w h to fulfill ti o itio s suh s o toll u y)? Dfi i g th t b)? I putti g th t )? Loti g th t )? Assi g th t )? Commu iti g th t f)? Risi g th t. 29 $0"8 7&0&2& 3 "

(127) # I this t bs sig sl objtis sig suh s : )? Es of us b)? Co tol of t i tgity )? Co tol of u y )? Co tol of suity )? Dt i p (logil & physil) f)? Dt stog pottio g)? Systm pfom h)? Systm fu tio s i)? Systm omptibility Fo hii g th bo m tio iti s w h to m us of ious ftus tht ilbl with th RDBMS by foi g i tgity o sti s, w su t i tgity.

(128)

(129) . . 15.

(130) c . u t i o sist y to gt t . &0& (&'"&0"# Nomliztio is th tm obti fom th Lti wo ³NORMA´ whih m s tht su us by th p t- Nomliztio is th poss of simplifyi g th ltio ship btw t lm ts i o- Though omliztio olltio of t i o stutu is pl by sussi o stutus tht simpl b m g ffii tlyWhil sig i g th t bs, w h to implm t th o pt of omliztio to oi u y i tbs- Nomliztio is bi g i out fo fou so s; y? To stutu th t so tht y pti t ltio ship btw. titis . b. ps ty? To pmit simpl til of t i spo s to uy pots uiy? To simplify t mi t pou suh s i stio , ltio upti gy? To u th. to b stutu o og iz t with. w pplitio. uim ts isTh mjo omliztio sttgis : ()? Fist Noml Fom (b)?So Noml Fom ()? Thi Noml Fom ()?Boy

(131) Co Noml Fom (BCNF) *"0 (&'*(.

(132)

(133) . . 16.

(134) c . Fist Noml Fom is hi wh ll pti g goups i o mo, so tht o is of fi l gth- A pti g goup, ou of t itm o goup of t itm withi o i its oth ltio $#3 (&'*( It is hi wh o is i fist oml fom h itm i th o is fu tio lly p y- A t itm is fu tio lly p t of its lu is u iuly ssoit with spifi itm- To hi so oml fom y olum i tbl tht is ot p t o th pimy y of th o shoul b mo us to fom spt ltio 4"3 (&'*( Thi Noml Fom is hi wh ll t siti p is mo fom oTht is, if A is fu tio lly p t o B B is fu tio lly p t o C, th A is fu tio lly p t o C%$ CV33 (&'*( BCNF is oft us to isti guish th w 3NF fom th ol- A ttibut possibl omposit is ll s µtmi t , if oth ttibuts fully fu tio lly tmi this ttibut(o o whih som oth ttibut is fully fu tio lly p t o this ttibut)A tbl i BCNF, if y tmi t is it y- To hi tbl i BCNF, mo fils whih fully fu tio lly p t o tmi t, whih os ot t s it y-. .

(135)

(136) . . 17.

(137) c . . *" '3. &0&0%6 . "D . $"60"#. $#0&"#0. Collg m. h. 50. Nm of th ollg Pimyy. Pl. h. 50. Pl m. Not ull. Distit. h. 50. Distit m. Not ull. Stt. h. 50. Stt m. Not ull. Dsiptio. h. 50. Dsiptio. bout Not ull. ollg Ph o. Bigi t. Emil. h. Wbsit. h. Pho umb. Not ull. 50. Emil. Not ull. 50. Wbsit. Not ull. *" '3. &0&0%6 . "D . $"60"#. V#0&"#0. si. Vh. 50. s i. Not ull.

(138)

(139) . . 18.

(140) c . Psswo. Vh. 50. Psswo. Not ull. ) *" '3. &0&0%6 . "D . $"60"#. V#0&"#0. m. Vh. 50. s m. Not ull. V *" '3. &0&0%6 . "D . $"60"#. V#0&"#0. Comp y i. i t. 10. Comp y i. Pimyy. Comp y m. h. 50. Comp y m. Not ull. Fil of sop. h. 50. Fil of sop. Not ull. Dsiptio. h. 50. Comp y siptio. Not ull. P tg. Flot. P tg of ms. Not ull. Y. I t. 10. Y. Not ull. Pf . h. 50. Pf . Not ull. Post. h. 50. Post. Not ull. Bo pio. Numi. 18,0. Bo pio. Not ull.

(141)

(142) . . 19.

(143) c . Numb. of i t. 10. Numb of is. Not ull. is. V *" '3. &0&0%6 . "D . $"60"#. V#0&"#0. Am o. I t. 10. Amissio. Not ull. Cmp yi. Vh. 50. Comp y i. Nm. Vh. 50. Nm of th stu t Not ull. Cmp y m. Vh. 50. Nm. umb. of. Not ull. th Not ull. omp y Post. Vh. 50. Post. Not ull. Bo pio. I t. 10. Bo pio. Not ull. Y. I t. 10. Y. Not ull. Sm. Vh. 50. Smst. Not ull. Plt. Vh. 50. Pl t. Not ull.

(144)

(145) . . 20.

(146) c . *" '3. &0&0%6 . "D . $"60"#. $#0&"#0. Am o. I t. 10. Amissio. Pimy y. Nm. Vh. 50. Stu t m. Not ull. Sm. Vh. 50. Smst. Not ull. B h. Vh. 50. B h. Not ull. Y. I t. 10. Y. Not ull. Roll o. I t. 10. Roll umb. Not ull. Ag. I t. 10. Ag. Not ull. Dob. ttim. Dt of bith. Not ull. G . Ch. 10. G . Not ull. Ass. Vh. 50. Ass. Not ull. Ph o. Bigi t. Pho umb. Not ull. Mob o. Bigi t. Mobil umb. Not ull. Emil. Vh. 50. Emil. Not ull. Kysill. Vh. 50. Ky sill. Not ull. Sttus. Vh. 50. Sttus. Not ull.

(147)

(148) . . umb. 21.

(149) c . - *" '3. &0&0%6 . "D . $"60"#. V#0&"#0. Am o. I t. 10. Amissio. Foig y. Ssl. Flot. Ms of SSLC. Not ull. Hs. Flot. Ms of HSE. Not ull. S1s2. Flot. Ms of S1S2. Not ull. S3. Flot. Ms of S3. Not ull. S4. Flot. Ms of S4. Not ull. S5. Flot. Ms of S5. Not ull. S6. Flot. Ms of S6. Not ull. S7. Flot. Ms of S7. Not ull. S8. Flot. Ms of S8. Not ull. umb. V *" '3. &0&0%6 . "D . $"60"#. V#0&"#0. Am o. I t. 10. Amissio. Not ull. ompli t. Vh. M. Compli ts bout Not ull. umb. th plm t ll.

(150)

(151) . . 22.

(152) c . > *:) * A t flow igm is gphil th iu tht pits i fomtio flow t sfoms tht ppli s t mo fom i put to output- Th DFD is lso ow s Dt Flow Gphs o Bubbl Cht- Th DFD is us to ps t i si g i fomtio flow fu tio l tils- Also DFD b stts s th stti g poi t of th sig phs tht fu tio lly omposs th uim ts spifitio s ow to th lowst ll of tilA ll zo lso ll th fu m tl systm mol o o t t ll DFD tht ps t th ti softw lm ts s si gl bubbl with i put output t i it by i omi g outgoi g ows, sptily- Aitio l poss i fomtio flow pts ps t i th t ll, i--, ll 1 DFD- Eh of th posss ps t t ll 1 sub fu tio s of oll systm pit i th o t t mol- A y posss tht t\ ompl i ll 1 will b futh ps t i to sub fu tio s i th t ll, i--, ll 2Dt Flow Digm is m s of ps ti g systm t y ll of til with gphi two of symbols showi g t flows, t stos, t posss t sous- Th pupos of t flow igm is to poi sm ti big btw uss systm lops- Th igm is th bsis of stutu systm lysis- A DFD sibs wht t flows th th how thy poss, so it os ot p o hw, softw, t stutu o fil og iztio -. V(6# #07&0&*'?"&

(153) &( Th fou symbols tht us i th wi g of t flow igms y? E titis. E t l titis ps t th sous of t tht t th systm o th ipi ts of t tht l th systm.

(154)

(155) . . 23.

(156) c . y? Poss. Posss ps t tiitis i whih t is m ipult by bi g sto o ti o t sfom i som wy- A il ps ts it- Th poss will show th t t sfomtio o h gy? Dtbs. Dtbss ps t stog of t withi th systm y? Dt Flow. A t flow shows flow of i fomtio. fom its sou to its sti tio - A li . ps ts t flow, with ow hs showi g th itio of flow-.

(157)

(158) . . 24.

(159) c . 8 ' ust. spo s. Plm t ll. SE. SE 8 ' Ami. Ruit. s m SER psswo . Pl m t. LOGI N. Stu t. Histoy 8 ';. Ami. s m. Logi. psswo . Ami. s m psswo . Stu t uptio. Stu t tils Stu t ms. Ruit Rgisttio. Logi. Comp y tils. 8 ';.

(160)

(161) . . 25.

(162) c . Ami. Ami. s m Pssw o. s m Pssw o. Ami istt o gisttio. Logi. Ami uptio. Logi. Ami istto . 8 ';. Ami. s m. Ruit ptio. Logi. psswo. Plm t. s m. Ami. Logi. Sltio. pss wo. Stu t Dtils Stu t ms.

(163)

(164) . . . 26.

(165) c . Th tm Implm ttio hs iff t m i gs gi g fom th o stio of bsi pplitio to omplt plm t of omput systm- Th pous how, itully th sm- Implm ttio i lus ll thos tiitis tht t pl to o t fom ol systms to wTh w systm my b totlly w pli g isti g m ul o utomt systm o it my b mjo moifitio to isti g systm- Th mtho of implm ttio tim sl to b opt is fou out i itilly- Nt th systm is tst poply t th sm tim th uss ti i th w pou- Pop implm ttio is ss til to poi libl systm to mt og iztio uim tSussful ffii t utiliztio. i. th systm . b hi o ly though pop. implm ttio of th systm i th og iztio - So implm ttio phs is lso impot t li oth phss suh s lysis, sig , oi g tsti g-.

(166)

(167) . . 27.

(168) c . y? Cful pl. i g. y? I stigtio of th systm its o sti ts y? Dsig th mthos to hi th h g o y? Ti i g th stff i th h g phs y? E sui g th us hs u stoo pt th h gs y? Gtti g omplt fb ui g tst u sui g ythi g i pft fo th fi l h g o-. V ) ! &3?& 6 $"7"$&0"# Mhi . : IBM PC Comptibl. Posso : I tl P tium Clo sp: 120 MHz High RAM. : 512MB. H Dis : 80GB Moth bo: I tl moth bo. 70?& 6 $"7"$&0"# Opti g Systm: Wi ows XP L gug: JAVA Fo t E : NtB s 5-5 B : Miosoft SQL S. .

(169)

(170) . . 28.

(171) c . ;* : V ! J ws lop t Su Miosystms- Wo o J i itilly bg with th gol of ti g pltfom i p t l gug OS fo o sum lto is- Th oigi l i t ws to us C++, but s wo pogss i this itio , lops i tifi tht ti g thi ow l gug woul s thm btt- Th ffot tows o sum lto is l th J tm, th ow s Fist Pso I -, tows lopi g b

(172) w s

(173) w fo th liy of io o m with Tim W fotu tly (o fotu tly fo us) Tim W slt Silio. Gphis s th. o fo io o m pojt- This st b lft th Fist Pso tm with i tsti g pi of s

(174) w (J) o mt to pl it- E tully, th tul sy gis of th J l gug th www w oti, J fou mtToy J is both pogmmi g l gug io m t fo uti g pogms witt i J L gug- li titio l ompils, whih o t sou o i to mhi ll i stutio s, th J ompil t slts J sou o i to i stutio s tht i tupt by th u tim J Vitul Mhi - J is i tpt l gugJ is th fist pogmmi g l gug sig fom gou up with pogmmi g i. two. mi - Th o API fo J i lus lsss i tfs tht poi. u ifom ss to is st of two potools- As th I t t two pogmmi g h ol, J hs mi ti its - Nw APIs toolits h p th ilbl optio s fo th J two pogmm-. :4%&8&E I o of thi ly pps bout th l gug, Su sib J s follows: J : A simpl, objt oi t, istibut, i tpt, obust, su, hittu utl, potbl, high pfom , multi th y mi l gug-.

(175)

(176) . . 29.

(177) c . Su owlgs tht this is uit sti g of buzzwos, but th ft is tht, fo th most pt, thy ptly sib th l gug- I o to u st why J is so i tsti g, lt s t loo t th l gug ftus bhi th buzzwosi)?. OBJECT ± ORIENTED J is objt oi t pogmmi g l gug- As pogmm, this m s tht you. fous o th t i you pplitio s mthos tht m ipult tht t, th th thi i g stitly i tms of pous- I objt oi t systm, lss is olltio of t mthos tht opt o tht t- T togth, th t mthos sib th stt bhio of objt- Clsss g i hihy, so tht sub lss i hit bhio fom its sup lss- J oms with t si st of lsss, g i pgs tht you us i you pogms- Fo mpl, J pois lsss tht t gphil us i tf ompo ts (th j-wt pg), lsss tht h l i put output (th j-io pg), lsss tht suppot twoi g fu tio lity (th j- t pg)- Most thi gs i J objts; th pimiti umi, ht th Bool typs th o ly ptio s- Sti gs ps t by objts i J, s oth impot t l gug o stuts li ths- A lss is th bsi u it of ompiltio of utio i J; ll J pogms lsss- Fo omplt siptio of th objt oi t ftus of J, Th objt oi t l gug us to t utbl o t ts suh s pplitio s ppltsii)?. INTERPRETED J is i tpt l gug: th J ompil g ts byt os fo th J. Vitul Mhi (JVM), th tht ti mhi o- To tully u J pogm, you us th J I tpt to ut th ompil byt os- Bus J byt os pltfom i p t, J pogms u o y pltfom tht th JVM (th i tpt u tim systm) hs b pot to- I i tpt io m t, th st ³li ´ phs of pogm lopm t ptty muh ishs- If J hs li phs t ll, it is o ly th poss of loi g th w lsss i to th io m t, whih is i m tl, light wight poss tht ous t u timiii)?. ARCHITECTRE NETRAL AND PORTABLE.

(178)

(179) . . 30.

(180) c . Bus J pogms ompil to hittu utl byt o fomt, J pplitio u o y systm, s lo g s tht systm implm ts th J Vitul Mhi - This is ptiully impot t fo pplitio s istibut o th i t t o htog ous twos- But th hittu utl ppoh is usful byo th sop of two bs pplitio s- As pplitio lop i toy s softw mt, you pobbly w t to lop sio s of you pplitio tht u o PCs, Ms NIX wosttio s- Th ft tht J is i tpt fi s st , hittu utl, byt o fomt is o big pt of bi g potbl- But J gos futh, by mi g su tht th o ³implm ttio p t´ spts of th l gug spifitio i)?. DYNAMIC AND DISTRIBTED J is y mi l gug- A y J lss b lo i to u. i g J i tpt. t y tim- Ths y milly lo lsss b th y milly i st tit- Nti o libis lso b y milly lo- Clsss i J ps t by th Clss; you y milly obti i fomtio bout lss t u tim- J is lso ll istibut l gug- This m s, simply, tht it pois lot of high ll suppot fo twoi g- I J 1-1, th Rmot Mtho I otio (RMI) API llows J pogm to i o mthos of mot J objts, s if thy w lol objts- Th istibut tu of J lly shi s wh ombi with its y mi lss loi g pbilitis- Imgi Wh multi mi wo posso witt i J pogm is s to isply som typ of t tht it hs ou t bfo, it might y milly ow lo lss fom th two tht ps th t, th y milly ow lo oth lss tht isply th t withi ompou oum t- A pogm li this uss istibut sous o th two to y milly gow pt to th s of its us)?. SIMPLE J is simpl l gug- Th j sig s w tyi g to t l gug tht . pogmm oul l. uily, so th. umb of l gug o stuts hs b. pt. ltily smll- I o to p th l gug both smll fmili, th J sig s mo umb of ftus ilbl i C C++- J os ot us h fils it limi ts th C pposso- J lso limi ts th opto oloi g multipl.

(181)

(182) . . 31.

(183) c . i hit ftus of C++- J os ot us poi ts- Si J os ot h stutus, ys sti gs objts, th s o fo poi ts- J utomtilly h ls th f i g f i g of objts fo you- J lso implm ts utomti gbg olltio , so you o t h to woy bout gli g poi ts, i li poi t f s, mmoy ls, so you . sp you tim lopi g th fu tio lity of you. pogmsROBST. i)?. J hs b sig fo witi g highly libl o obust softw- J ti ly os t limi t th fo softw ulity ssu ; it s still uit possibl to wit buggy softw i J- J is sto gly typ l gug, whih llows fo t si ompil tim h fo pot til typ mismth poblms- J uis pliit mtho ltio sThs sti g t uim ts su tht th ompil th mtho i otio os, whih ls to mo libl pogms- L of poi ts poi t ithmti i ss th obust ss of J pogms by bolishi g ti lss of poi t ± lt bugs- Similly, ll sss to ys sti gs h t u tim to su tht thy i bou s, limi ti g th possibility of o witi g mmoy oupti g t- Csts of objts fom o typ to oth lso h t u tim to su tht thy lgl- J s utomti gbg olltio p ts mmoy ls oth p iious bug lt to mmoy llotio lotio - E ptio h li g is oth ftu i J tht ms fo mo obust pogms- A ptio is sig l tht som sot of ptio l o itio -. ii)?. SECRE. O of th most highly tout spts of J is tht it s su l gug- This is spilly impot t bus of th istibut tu of J- Without ssu of suity, you ti ly oul t w t to ow lo o fom om sit o th i t t lt it u o you omput- Yt this is tly wht popl o with J pplts y y- J ws sig with suity i mi , pois sl lys of suity o tols tht pott gi st mliious o, llow us to omfotbly u u tust pogms suh s pplts- At th lowst ll, suity gos h i h with obust ss- As w h ly s , J pogms ot fog poi ts to mmoy, o oflow ys, o .

(184)

(185) . . 32.

(186) c . mmoy outsi of th bou s of y o sti g- This ftu is o of J s mi f ss gi st mliious o- By totlly isllowi g y it ss to mmoy, ti hug, mssy lss of suity tts is ul outTh so li of f s gi st mliious o is th byt o ifitio poss tht th J i tpt pfoms o y u tust o it los- This ifitio stps su tht th o is wll fom tht it os t o flow o u flow th st o o ti illgl byt os- A oth ly of suity pottio is ommo ly f to s th ³s bo mol´: u tust o is pl i ³s bo ´, wh it ply sfly, without oi g y mg to th ³l wol´, o full J io m t- Wh pplt, o oth u tust o, is u. i g i th s bo -. Fi lly, i J 1-1, th is oth possibl solutio to th poblm of suity- By tthi g igitl sig tu to J o, th oigi of tht o b stblish i yptogphilly to su u fogibl wy- If u hs spifi tht you tust pso o og iztio , th o tht bs th igitl sig tu of tht tust tity is tust, wh lo o th two, my b u without th stitio of th s bo molOf ous, suity is t bl & whit thi g- Just s pogm . b gu t to. b 100 % bug f, o l gug o io m t b gu t 100 % su- With tht si, how, J os sm to off ptil ll of suity fo most pplitio s- It tiipts. . f s. gi st. most. of. th. th ius. -. iii) HIGH PERFOMANCE J is i tpt l gug, so it is goi g to b s fst s ompil l gug li C- This sp is mo th. ut to u. i tti, GI . two bs. pplitio s, wh th pplitio is oft il, witi g fo th us to o somthi g, o witi g fo t fom th two- Futhmo, th sp itil sssio s of J u tim io m t, tht o thi gs li sti g o t tio ompiso , implm t with ffii t ti o- As futh pfom boost, m y J i tpts ow i lu ³just i tim´ ompils tht t slt J Byt os i to mhi os fo ptiul CP t u tim- Th J byt o fomt ws sig with ths ³just i tim´.

(187)

(188) . . 33.

(189) c . ompils i mi , so th poss of g ti g mhi o is fily ffii t it pous so bly goo o- If you willi g to sifi o pobbility to gi sp, you lso wit potio s of you pogm i C o C++ us J ti mthos to i tf with this ti o- Wh you o sii g pfom , its impot t to mmb wh J flls i th sptum of ilbl pogmmi g l gugs- J flls i th mil of th sptum- Th pfom of J s i tpt byt os is muh btt th th high ll sipti g l gugs ( Pl), but it still offs th simpliity pobbility of thos l gugsi )?. MLTITHREADED J is multi th l gug; it pois suppot fo multipl ths of utio. (somtims ll light wight posss) tht h l iff t tss- A impot t b fit of multithi g is tht it impos th i tti pfom of gphil pplitio s fo th us- J ms pogmmi g with ths muh si, by poii g built i l gug suppot ths- Th J l gug sy t lso suppots ths itly with th sy ho iz ywo- This ywo ms it tmly sy to m stio s of o o ti mthos tht shoul o ly b u by si gl th t tim- J ms ths so sy to us; th J lss libis ui thi us i umb of pls- Fo mpl, y pplt tht pfoms imtio os so with th- Similly, J os ot suppot sy ho ous, o bloi g I

(190) O with otifitio though sig ls o i tupts²you must i st t th tht blos o y I

(191) O h l you i tst i JAVA RNTIME ENVIRONMENT. )?. Th u tim io m t us to ut th o- It is m up of th j l gug j itul mhi - It is potbl its pltfom utlJAVA TOOLS. i)?. It is us by th lops to t j o- Thy i lu j ompil, j i tpt, lsss, libis pplt iw ii)?. JAVA APPLICATION.

(192)

(193) . . 34.

(194) c . Compili g th sou o i to byt o usi g jE uti g byt o pogm usi g j i tpt iii)?. JAVA APPLETS. J pplts pis of j o tht mb i HTML oum t usi g th pplt tg- Wh th bows ou ts suh o it utomtilly ow lo it ut it i)?. JAVA VIRTAL MACHINE. It is spifitio to whih j os must b witt - All j o is to b ompil to b us i this o ist t itul mhi - Witi g th o whih ompils i JVM sus pltfom i p )?. BILT IN NETWORKING. J ws sig with twoi g i mi oms with m y lsss to lop sophistit I t t ommu itio s- Ftus suh s limi ti g mmoy poi ts by hi g y limits gtly hlp to mo pogm bugs- Th gbg ollto lis pogmms of th big job of mmoy m gm t- Ths th oth ftus l to big sp up i pogm lopm t omp to C

(195) C++ pogmmi gADVANTAGES OF JAVA i)?. JAVA IS ROBST. J is l i tms of typ hi g i tms of pogmmi g os- J is stit bout typ ltio s os ot llow utomti typ sti g- Also it uss poi t mol tht os ot o wit mmoy o oupt tii)?. JAVA IS PLATFORM INDEPENDENCE. Th wit o Ru A ywh il hs ot b hi (tu i g fo iff t pltfoms usully ui), but los th with oth l gugsiii)?. COMPILER

(196) INTERPRETER COMBO.

(197)

(198) . . 35.

(199) c . Co is ompil to byt os tht i tpt by J itul mhi s (JVM)- This pois potbility to y mhi fo whih itul mhi hs b witt - Th two stps of ompiltio i tpttio llow fo t si o hi gi)?. JAVA IS SECRE. Poi ts mmoy llotio s mo ui g ompil timAll byt os ifi by th i tpt bfo uti gAll J pplts tt s u tust o uti g i tust io m tPogms u i si th itul mhi s bo Ay i limit hi g J ws witt to suppot istibut pplitio s o th omput twos, it b us with ity of CP opti g systm hittu utl objt fils fom J oJAVA IS PORTABLE. )?. )? J pimiti t typs th bhio of ithmti optio s o ths t typs pliitly spifib)? Th J libis i lu potbl i tfs fo h pltfom o whih th u tim io m t is ilbl, )? Th ti J systm itslf is potbli)?. JAVA IS SMALL. Bus j ws sig to u o smll omputs, j systm is ltily smll fo pogmmi g l gug- It u ffii tly o PCs with 4MB RAM o mo- Th J i tpt ts up o ly fw hu ilo bytsii)?. JAVA IS GARBAGE COLLECTED.

(200)

(201) . . 36.

(202) c . J pogms o t h to woy bout mmoy m gm t- Th j systm hs built i pogm ll th gbg ollto, whih s s th mmoy utomtilly fs th mmoy hu s tht ot i usiii)?. JAVA IS DYNAMIC. Fu m tlly istibut omput io m ts must b y mi- J is pbl of y milly li i g. w libis, mthos i st ibls s it gos without. bi gTh li i g of t mthos to wh thy lot is o t u timNw lsss b lo whil pogm is u libis ompil, th is o. i g- Li i g is o o th fly- E if. to ompil o tht uss lsss i thos. libis- This iffs fom C++, whih us stti bi i g- This sult i fgil lsss fo ss wh li o is h g mmoy poi ts th poi t to wo g sss-. NETBEANS Th NtB s IDE is f, op sou I tgt Dlopm t E io m t fo softw lops- Th IDE u s o m y pltfoms i lui g Wi ows, Li u , Solis th MOS- Th NtB s IDE pois lops with ll th tools thy. to t. pofssio l oss pltfom stop, tpis, wb mobil pplitio ssi g I tgt Dlopm t E io m t (IDE) fo lopi g pplitio s ss you tim by m gi g wi ows, stti gs, t- Dg op ftus m ti g gphil us i tf (GI) ompo ts o ssi g tbss sy, highlight o buggi g ftus lt you to os i you oTh NtB s IDE is op sou is witt i th J pogmmi g l gug- It pois th sis ommo to ti g stop pplitio s suh s wi ow m u m gm t, stti gs stog is lso th fist IDE to fully suppot JDK 5-0 ftus- Th.

(203)

(204) . . 37.

(205) c . NtB s pltfom IDE f fo ommil o ommil us, thy suppot by Su Miosystms-. i)?. SWING GI BILDER (Fomly Pojt Mtiss). Dsig Swi g GI i tuitily by ggi g oppi g GI ompo ts fom pltt o to s, th li i to JLbls, JButto s, JT tFils it th t t itly i plYou us th GI buil to pototyp GIs ight i fo t of ustoms- Th NtB s IDE oms with built i suppot fo GI loliztio ssibilityii)?. WEB APPLICATION DEVELOPMENT. Ct omplt fu tio l JSF pg fo m ipulti g t fom tbs i fw stpsSuppots J S Fs (JSF), Psist its, Stuts, th J S Pgs St Tg Liby (JSTL)- Coms with isul ito fo lopm t siptos HTTP mo ito to bug wb pplitio siii)?. ENTERPRISE DEVELOPMENT. s Blupi ts, tmplts wizs to uily t E tpis J B s (EJB 3) JAX WS wb sis- Full suppot fo J EE 1-3, 1-4 1-5 st si)?. VERSION CONTROL. Vsio o tol is tightly i tgt i to th IDE s woflow: Th IDE og izs you isti g CVS woi g itois utomtilly- s th built i CVS o gt th Subsio moul fom th pt C t)?. DEVELOPER COLLABORATION. With NtB s Dlop Collbotio (ilbl fom th pt C t), you sh whol pojts fils i l tim o th two- Allow you o wos to m mot h gs wth thm typ u you pplitio - Riw you pt s wo s i st t mssgs i. pli. t t, XML, HTML, o J omplt with sy t. highlighti gi) ADVANCED SORCE CODE EDITOR.

(206)

(207) . . 38.

(208) c . Th l gug w ito i ts, omplts, sy t highlights you sou o- It pss you o li, mths wos bts, ms os, isplys hi ts jo- Th ito b fully ustomiz split tilly o hoizo tlly, offs wll i tgt Rftoi g, Dbuggi g J it tsti g-. < 8 ' SQL S is moul tht o sist of tliz t bs systm sl fu tio l pogms- SQL s tools o fou mjo i s of wo thy : y? Dt bs m gm t y? Dt ss m ipultio y? Pogmmi g y? Co tiity y? SQL S tools y? E tpis M gm t y? Quy A lyz E tpis m g is wi ow m gm t o sol to t w t bs, uss, suity stitio s tiggs, pous, uls t-- it gis GI bs sig with suityIt llows logi fo li uss, us t t bss uss usi g wiz with goo s- It gis t stutu li wi ows plo igtio is y sy- It lso llows to ti g w ols logi s whih b us fo suity spts usi g tpis m g w impot pot t bs fom o to thi RDBMSQuy lyz is oth tool with SQL S, whih t s th pbilitis of ANSI st fo SQL- If is pplitio tht og iz ut SQL omm s th spiliz T SQL omm s tht . b us to t t bs objts usi g SQL. omm y? W us uy lyz omm s to.

(209)

(210) . . 39.

(211) c . y? E t, Eit, Sol, Rti, Ru SQL omm s y? Fomt, Pfom, Clultio , Sto Pi t Quy sols y? List olum fi itio fo y tbl. V ) ? pg plm tll; impot j-sl- ; impot j-util-g - ; publi lss uptmi t s j -swi g-JFm { Co tio o ; Sttm t st,st2; RsultSt s,s2; publi uptmi () { i itCompo ts(); ty { Clss-foNm("su -jb-ob-JbObDi"); mbFill(); } th(E ptio ).

(212)

(213) . . 40.

(214) c . { jOptio P 1-showMssgDilog(this,-gtMssg(),"Eo",1); } }. pit oi t tplFousLost(j-wt- t-FousE t t) { if(isVliNm(t tpl-gtT t())) { } ls { jOptio P 1-showMssgDilog(this,"O ly hts sps - llow","W i g",1); t tpl-stT t(""); } } pit oi t tmilFousLost(j-wt- t-FousE t t) { if(isEmilVli(t tmil-gtT t())) { } ls { jOptio P 1-showMssgDilog(this,"Fomt gmil-om llow","W i g",1); t tmil-stT t(""); } } pit oi t tph oFousLost(j-wt- t-FousE t t) { if(isPho NumbVli(t tph o-gtT t())) { } ls { jOptio P 1-showMssgDilog(this,"O ly 11 igits llow","W i g",1); t tph o-stT t(""); } } pit oi jButto 6Atio Pfom(j-wt- t-Atio E t t) { t tpl-stT t(" "); t tistit-stT t(" "); t tstt-stT t(" ");.

(215)

(216) . . 41.

(217) c . t ts-stT t(" "); t tph o-stT t(" "); t tmil-stT t(" "); t twb-stT t(" "); } pit oi jButto 2Atio Pfom(j-wt- t-Atio E t t) { ty { o DiM g-gtCo tio ("jb:ob:p","s","mt"); sto -tSttm t(); i t st- utpt("lt fom mi istto wh ollg m"+mbollg-gtSltItm()); i t pst- utpt("lt fom mi istto wh ollg m"+mbollg-gtSltItm()); jOptio P 1-showMssgDilog(this,"SCCESFLLY COMPLETED","Mssg",1); } th(E ptio ) { jOptio P 1-showMssgDilog(this,-gtMssg(),"Eo",1); } } pit oi jButto 3Atio Pfom(j-wt- t-Atio E t t) { ty { o DiM g-gtCo tio ("jb:ob:p","s","mt"); sto -tSttm t(); sst- utQuy("slt fom mi istto wh ollg m"+mbollg-gtSltItm()+""); whil(s- t()) {. t tpl-stT t(s-gtSti g(2)); t tistit-stT t(s-gtSti g(3)); t tstt-stT t(s-gtSti g(4)); t ts-stT t(s-gtSti g(5)); t tph o-stT t(Sti g-luOf(s-gtLo g(6))); t tmil-stT t(s-gtSti g(7)); t twb-stT t(s-gtSti g(8)); } jOptio P 1-showMssgDilog(this,"SCCESFLLY COMPLETED","Mssg",1); } th(E ptio ).

(218)

(219) . . 42.

(220) c . { jOptio P 1-showMssgDilog(this,-gtMssg(),"Eo",1); } } pit oi jButto 1Atio Pfom(j-wt- t-Atio E t t) { Doubl gDoubl-psDoubl(t tph o-gtT t()); ty { o DiM g-gtCo tio ("jb:ob:p","s","mt"); sto -tSttm t(); i t st- utpt("pt mi istto st pl"+t tpl-gtT t()+",istit"+t tistit-gtT t()+",stt"+t tstt-gtT t()+",sip tio "+t ts-gtT t()+",ph o"+g+",mil"+t tmil-gtT t()+",wbsit"+t twb-gtT t() +" wh ollg m"+mbollg-gtSltItm()); jOptio P 1-showMssgDilog(this,"SCCESFLLY COMPLETED","Mssg",1); } th(E ptio ) { jOptio P 1-showMssgDilog(this,-gtMssg(),"Eo",1); } } pit oi jButto 5Atio Pfom(j-wt- t-Atio E t t) { hom3 ob w hom3(); ob-show(); } publi stti bool isPho NumbVli(Sti g pho Numb){ bool isVli fls; Sti g pssio "^\$?(\\{4})\$?[ ]?(\\{3})[ ]?(\\{4})$"; ChSu i putSt pho Numb; Ptt ptt Ptt -ompil( pssio ); Mth mth ptt -mth(i putSt); if(mth-mths()){ isVli tu; } tu isVli; } publi stti bool isPi NumbVli(Sti g pho Numb){ bool isVli fls; Sti g pssio "^?\\{2}?(\\{4})$"; ChSu i putSt pho Numb; Ptt ptt Ptt -ompil( pssio ); Mth mth ptt -mth(i putSt); if(mth-mths()){ isVli tu; } tu isVli;.

(221)

(222) . . 43.

(223) c . } publi stti bool isEmilVli(Sti g mil){ bool isVli fls; Sti g pssio "^[\\w\\- ]+ ([\\w\\ ]+\\-)+[A ]{2,4}$"; ChSu i putSt mil; Ptt ptt Ptt -ompil( pssio ,Ptt -CASE_INSENSITIVE); Mth mth ptt -mth(i putSt); if(mth-mths()){ isVli tu; } tu isVli; } publi stti bool isNumi(Sti g umb){ bool isVli fls; Sti g pssio "^?[0 9] \\-?[0 9]+$"; ChSu i putSt umb; Ptt ptt Ptt -ompil( pssio ); Mth mth ptt -mth(i putSt); if(mth-mths()){ isVli tu; } tu isVli; } publi bool isVlisNm(ChSu s) { i t l s-l gth(); fo(i t i0;i<l ;i++) { h s-hAt(i); if(0< && <9) o ti u; if(< && <z) o ti u; if(A< && <) o ti u; if( ) o ti u; if(_) o ti u; tu fls; } tu tu; } publi bool isVliNm(ChSu s) { i t l s-l gth(); fo(i t i0;i<l ;i++) { h s-hAt(i); if(< && <z) o ti u; if(A< && <) o ti u; if( ) o ti u; if(-) o ti u; tu fls;.

(224)

(225) . . 44.

(226) c . } tu tu; } publi stti oi mi (Sti g gs[]) { j-wt-E tQuu-i oLt( w Ru bl() { publi oi u () { w uptmi ()-stVisibl(tu); } }); }. publi oi mbFill() { ty { o DiM g-gtCo tio ("jb:ob:p","s","mt"); st2o -tSttm t(); s2st2- utQuy("slt ollg m fom mi istto"); whil(s2- t()) {. mbollg-Itm(s2-gtSti g(1));. } } th(E ptio ) { jOptio P 1-showMssgDilog(this,-gtMssg(),"Eo",1); } }} . 2) ADMINISTRATOR pg plm tllV? impot j-sl- ; impot j-util-g - ; publi lss mi t s j -swi g-JFm { Co tio o ,o 1; Sttm t st,st1; RsultSt s;.

(227)

(228) . . 45.

(229) c . publi mi () { i itCompo ts(); ty { Clss-foNm("su -jb-ob-JbObDi"); } th(E ptio ) { jOptio P 1-showMssgDilog(this,-gtMssg(),"Eo",1); } }. pit oi t tplFousLost(j-wt- t-FousE t t) { if(isVliNm(t tpl-gtT t())) { } ls { jOptio P 1-showMssgDilog(this,"O ly hts sps - llow","W i g",1); t tpl-stT t(""); } } pit oi t tmilFousLost(j-wt- t-FousE t t) { if(isEmilVli(t tmil-gtT t())) { } ls { jOptio P 1-showMssgDilog(this,"Fomt gmil-om llow","W i g",1); t tolg m-stT t(""); } } pit oi t tph oFousLost(j-wt- t-FousE t t) { if(isPho NumbVli(t tph o-gtT t())) { } ls { jOptio P 1-showMssgDilog(this,"O ly 11 igits llow","W i g",1); t tph o-stT t(""); }.

(230)

(231) . . 46.

(232) c . } pit oi t tolg mFousLost(j-wt- t-FousE t t) { if(isVliNm(t tolg m-gtT t())) { } ls { jOptio P 1-showMssgDilog(this,"O ly hts sps - llow","W i g",1); t tolg m-stT t(""); } } pit oi jButto 4Atio Pfom(j-wt- t-Atio E t t) { hom3 ob w hom3(); ob-show(); } pit oi jButto 6Atio Pfom(j-wt- t-Atio E t t) { t tolg m-stT t(" "); t tpl-stT t(" "); t tistit-stT t(" "); t tstt-stT t(" "); t ts-stT t(" "); t tph o-stT t(" "); t tmil-stT t(" "); t twb-stT t(" "); } pit oi jButto 5Atio Pfom(j-wt- t-Atio E t t) { Systm- it(0); } pit oi jButto 1Atio Pfom(j-wt- t-Atio E t t) { ty { if(t tolg m-gtT t()-uls("")||t tpl-gtT t()-uls("")||t tistit-gtT t()-uls("")||t tstt-gt T t()-uls("")||t ts-gtT t()-uls("")||t tph o-gtT t()-uls("")||t tmil-gtT t()-uls("")|| t twb-gtT t()-uls("")) { jOptio P 1-showMssgDilog(this,"E t All th Vlus","W i g",1); } ls { o DiM g-gtCo tio ("jb:ob:p","s","mt"); sto -tSttm t();.

(233)

(234) . . 47.

(235) c . sst- utQuy("slt ollg m fom mi istto wh ollg m"+t tolg m-gtT t()+""); if(s- t()) { jOptio P 1-showMssgDilog(this,"Aly Rgist","Mssg",1); } ls { o 1DiM g-gtCo tio ("jb:ob:p","s","mt"); st1o 1-tSttm t(); i t s1st1- utpt("i st i to mi istto lus ("+t tolg m-gtT t()+","+t tpl-gtT t()+","+t tistit-gtT t()+","+t tstt-gtT t()+","+t. ts-gtT t()+","+t tph o-gtT t()+","+t tmil-gtT t()+","+t twb-gtT t()+")"); if(s1>1) { jOptio P 1-showMssgDilog(this,"SCCESFLLY COMPLETED","Mssg",1); } } st-los(); o -los(); } } th(E ptio ) { jOptio P 1-showMssgDilog(this,-gtMssg(),"Eo",1); } } publi stti bool isPho NumbVli(Sti g pho Numb){ bool isVli fls; Sti g pssio "^\$?(\\{4})\$?[ ]?(\\{3})[ ]?(\\{4})$"; ChSu i putSt pho Numb; Ptt ptt Ptt -ompil( pssio ); Mth mth ptt -mth(i putSt); if(mth-mths()){ isVli tu; } tu isVli; } publi stti bool isPi NumbVli(Sti g pho Numb){ bool isVli fls; Sti g pssio "^?\\{2}?(\\{4})$"; ChSu i putSt pho Numb; Ptt ptt Ptt -ompil( pssio ); Mth mth ptt -mth(i putSt); if(mth-mths()){ isVli tu; } tu isVli; }.

(236)

(237) . . 48.

(238) c . publi stti bool isEmilVli(Sti g mil){ bool isVli fls; Sti g pssio "^[\\w\\- ]+ ([\\w\\ ]+\\-)+[A ]{2,4}$"; ChSu i putSt mil; Ptt ptt Ptt -ompil( pssio ,Ptt -CASE_INSENSITIVE); Mth mth ptt -mth(i putSt); if(mth-mths()){ isVli tu; } tu isVli; } publi stti bool isNumi(Sti g umb){ bool isVli fls; Sti g pssio "^?[0 9] \\-?[0 9]+$"; ChSu i putSt umb; Ptt ptt Ptt -ompil( pssio ); Mth mth ptt -mth(i putSt); if(mth-mths()){ isVli tu; } tu isVli; } publi bool isVlisNm(ChSu s) { i t l s-l gth(); fo(i t i0;i<l ;i++) { h s-hAt(i); if(0< && <9) o ti u; if(< && <z) o ti u; if(A< && <) o ti u; if( ) o ti u; if(_) o ti u; tu fls; } tu tu; } publi bool isVliNm(ChSu s) { i t l s-l gth(); fo(i t i0;i<l ;i++) { h s-hAt(i); if(< && <z) o ti u; if(A< && <) o ti u; if( ) o ti u; if(-) o ti u; tu fls; }.

(239)

(240) . . 49.

No results found