w.e.f.

2010-2011 academic year

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVER IT!" #A#INA$A #A#INA$A-%&&00&' A(d)ra *rade+) ,I(diaIN.OR/ATION TECHNOLOG! COURSE STRUCTURE IV B.Tech I Semester S.No 1 2 3 4 % Subject Cryptography and Network Security UML & Design Patterns Data are !ousing and Data Mining Mo"i#e Co$puting Open Elective i& 'pen Source So(tware ) Elective I: i& , *+S 2 2 4 P C Credits 4 4 4 4 4

UML & Design Patterns La" Mo"i#e .pp#ication De/e#op$ent La"

!"!#!$%!% NE#$& TEC#NO%O'IC!% &NIVE$SIT( )!)IN!*! IV (e+r B. Tech. Computer Science +nd En,ineerin, I Sem.

C$(PTO'$!P#( !N* NET"O$) SEC&$IT( &NIT-I: Introduction: Security .ttacks0 Security Ser/ices0 Security Mechanis$s0 and a Mode# (or Network Security0 Non1Cryptographic Protoco# 2u#nera"i#ities 1 DoS0 DDoS0 Session !i3acking and Spoo(ing0 So(tware 2u#nera"i#ities 1 Phishing0 4u((er '/er(#ow0 5or$at String .ttacks0 S6L *n3ection0 4asics o( Cryptography 1 Sy$$etric Cipher Mode#0 Su"stitution 7echni8ues0 7ransportation 7echni8ues0 'ther Cipher Properties 1 Con(usion0 Di((usion0 4#ock and Strea$ Ciphers& &NIT-II: Secret )e. Cr.pto,r+ph.: Data 9ncryption Standard:D9S;0 Strength o( D9S0 4#ock Cipher Design Princip#es and Modes o( 'perations0 7rip#e D9S0 *nternationa# Data 9ncryption a#gorith$0 4#ow(ish0 C.S7112-0 .9S &NIT-III Number Theor.: Pri$e and +e#ati/e#y Pri$e Nu$"ers0 Modu#ar .rith$etic0 5er$at<s and 9u#er<s 7heore$s0 the Chinese +e$ainder 7heore$0 Discrete Logarith$s& &NIT-IV Public )e. Cr.pto,r+ph.: Princip#es o( Pu"#ic =ey Cryptosyste$s0 +S. .#gorith$0 Di((ie1!e##$an =ey 9>change0 *ntroduction to 9##iptic Cur/e Cryptography& &NIT-V: Cr.pto,r+phic #+sh /unctions: .pp#ications o( Cryptographic !ash 5unctions0 Secure !ash .#gorith$0 Message .uthentication Codes 1 Message .uthentication +e8uire$ents and 5unctions0 !M.C0 Digita# signatures0 Digita# Signature Sche$es0 .uthentication Protoco#s0 Digita# Signature Standards& &NIT-VI: !uthentic+tion !pplic+tions: =er"eros0 =ey Manage$ent and Distri"ution0 ?&%@A Directory .uthentication ser/ice0 Pu"#ic =ey *n(rastructure0 9#ectronic Mai# SecurityB Pretty Cood Pri/acy0 SDM*M9& &NIT-VII: IP Securit.: '/er/iew0 .rchitecture0 .uthentication !eader0 9ncapsu#ating Security Pay#oad0 Co$"ining security .ssociations0 *nternet =ey 9>change0 7ransport Layer Security0 9#ectronic Pay$ent& &NIT-VIII: S.stem Securit.: *ntruders0 *ntrusion Detection0 Password Manage$ent0 Ma#icious So(tware 1 7ypes0 2iruses0 2irus Counter$easures0 Te0t Boo1s: 1& Cryptography and Network SecurityB Princip#es and Practice0 %th 9dition0 2@11& 2& Network Security and Cryptography0 4ernard MeneEes0 Cengage Learning0 2@11& 3& Cryptography and Network0 2nd 9dition0 4ehrouE .& 5ourouEan and De"deep Mukhopadhyay0 McCraw1!i##0 2@1@& $e2erence Boo1s: 1& 5unda$enta#s o( Network Security "y 9ric Maiwa#d :Drea$tech press; 2& Princip#es o( *n(or$ation Security0 hit$an0 7ho$son& 3& *ntroduction to Cryptography0 4uch$ann0 Springer& 4& .pp#ied Cryptography0 2nd 9dition0 4ruce Schneier0 Fohnwi#ey & Sons& !"!#!$%!% NE#$& TEC#NO%O'IC!% &NIVE$SIT( )!)IN!*! i##ia$ Sta##ings0 Pearson 9ducation0 or$s0 5irewa##s 1 Characteristics0 7ypes o( 5irewa##s0 P#ace$ent o( 5irewa##s0 5irewa## Con(iguration0 7rusted syste$s& e" SecurityB e" Security Considerations0 Secure Sockets Layer and

IV (e+r B. Tech. Computer Science +nd En,ineerin, I Sem. &3% !N* *ESI'N P!TTE$NS

&NIT-4 :*ntroduction B

hat *s a Design PatternG0 Design Patterns in S$a##ta#k M2C0 Descri"ing Design Patterns0 7he

Cata#og o( Design Patterns0 'rganiEing the Cata#og0 !ow Design Patterns So#/e Design Pro"#e$s0 !ow to Se#ect a Design Pattern0 !ow to Use a Design Pattern& UN*712 . Case StudyB Designing a Docu$ent19ditorB Design Pro"#e$sH Docu$ent Structure0 5or$attingH 9$"e##ishing the User *nter(ace& Supporting Mu#tip#e Look1and15ee# Standards& Supporting Mu#tip#e Spe##ing Checking and !yphenation& Su$$ary& &NIT-5: Creationa# Patterns B ."stract 5actory0 4ui#der0 5actory Method0 Prototype0 Sing#eton0 Discussion o( creationa# design patterns &NIT-678B Structura# PatternsB .dapter0 4ridge0 Co$posite0 Decorator0 5aIade0 5#yweight0 Pro>y& &NIT-97:: 4eha/ioura# Patterns B Chain o( +esponsi"i#ity0 Co$$and0 *nterpreter0 *terator0 Mediator0 Me$ento0 '"ser/er0 Strategy0 7e$p#ate Method0 &NIT-; hat to 9>pect (ro$ Design Patterns& . 4rie( !istory& 7he Pattern Co$$unity .n *n/itation0 . Parting 7hought& hat to 9>pect (ro$ Design Patterns indow Syste$s& User 'perations

http:<<===..outube.com<=+tch>v?vN#psC8n,@EAlist?P%/BC9EDC94:8C:EC:Ainde0?4 Te0t Boo1s: 1& 7he uni(ied Mode#ing #anguage user guide "y Crady 4ooch0 Fa$es +u$"augh 0 */ar Faco"son0 P9. 2& Design Patterns 4y 9rich Ca$$a0 Pearson 9ducation $e2erence Boo1s: 1. SatEingerB '"3ect 'riented .na#ysis and Design0 C9NC.C9

!"!#!$%!% NE#$& TEC#NO%O'IC!% &NIVE$SIT( )!)IN!*! IV (e+r B. Tech. Computer Science +nd En,ineerin, I Sem. *!T! "!$E#O&SIN' !N* *!T! 3ININ' &nit IB *ntroduction to Data MiningB hat is data $ining0 $oti/ating cha##enges0 origins o( data $ining0 data $ining

tasks 0 7ypes o( Data1attri"utes and $easure$ents0 types o( data sets0 Data 6ua#ity : 7an; &nit II: Data preprocessing0 Measures o( Si$i#arity and Dissi$i#arityB 4asics0 si$i#arity and dissi$i#arity "etween si$p#e attri"utes0 dissi$i#arities "etween data o"3ects0 si$i#arities "etween data o"3ects0 e>a$p#es o( pro>i$ity $easuresB si$i#arity $easures (or "inary data0 Faccard coe((icient0 Cosine si$i#arity0 9>tended Faccard coe((icient0 Corre#ation0 9>p#oring Data B Data Set0 Su$$ary Statistics :7an; &nit III: Data arehouseB "asic conceptsB0 Data arehousing Mode#ingB Data Cu"e and 'L.P0 Data arehouse i$p#e$entation B e((icient data cu"e co$putation0 partia# $ateria#iEation0 inde>ing 'L.P data0 e((icient processing o( 'L.P 8ueries& : ! & C; &nit IV: C#assi(icationB 4asic Concepts0 Cenera# approach to so#/ing a c#assi(ication pro"#e$0 Decision 7ree inductionB working o( decision tree0 "ui#ding a decision tree0 $ethods (or e>pressing attri"ute test conditions0 $easures (or se#ecting the "est sp#it0 .#gorith$ (or decision tree induction& Mode# o/er (ittingB Due to presence o( noise0 due to #ack o( representation sa$p#es0 e/a#uating the per(or$ance o( c#assi(ierB ho#dout $ethod0 rando$ su" sa$p#ing0 cross1/a#idation0 "ootstrap& :7an; &nit V: C#assi(ication1.#ternati/e techni8uesB &nit VI: .ssociation .na#ysisB Pro"#e$ De(inition0 5re8uent *te$1set generation1 7he .priori princip#e 0 5re8uent *te$ set generation in the .priori a#gorith$0 candidate generation and pruning0 support counting :e#uding support counting using a !ash tree; 0 +u#e generation0 co$pact representation o( (re8uent ite$ sets0 5P1Crowth .#gorith$s& :7an; &nit VII: '/er/iew1 types o( c#ustering0 4asic =1$eans0 = K$eans Kadditiona# issues0 4isecting k1$eans0 k1$eans and di((erent types o( c#usters0 strengths and weaknesses0 k1$eans as an opti$iEation pro"#e$& &nit VIII: .gg#o$erati/e !ierarchica# c#ustering0 "asic agg#o$erati/e hierarchica# c#ustering a#gorith$0 speci(ic techni8ues0 D4SC.NB 7raditiona# densityB center1"ased approach0 strengths and weaknesses :7an; Te0t Boo1s: 1& *ntroduction to Data Mining B Pang1Ning tan0 Michae# Stein"ach0 2ipin =u$ar0 Pearson 2& Data Mining 0Concepts and 7echni8ues0 3De0 Fiawei !an 0 Miche#ine =a$"er 0 9#se/ier $e2erence Boo1s: 1& *ntroduction to Data Mining with Case Studies 2nd edB C= CuptaL P!*& 2& Data Mining B *ntroductory and .d/anced 7opics B Dunha$0 Sridhar0 Pearson& 4ayesian C#assi(ierB 4ayes theore$0 using "ayes theor$ (or c#assi(ication0 NaJ/e 4ayes c#assi(ier0 4ayes error rate0 4ayesian 4e#ie( NetworksB Mode# representation0 $ode# "ui#ding :7an;

3& Data

arehousing0 Data Mining & 'L.P0 .#e> 4erson0 Stephen F S$ith0 7M!

4& Data Mining 7heory and Practice0 So$an0 Diwakar0 .3ay0 P!*0 2@@)& !"!#!$%!% NE#$& TEC#NO%O'IC!% &NIVE$SIT( )!)IN!*! IV (e+r B. Tech. Computer Science +nd En,ineerin, I Sem. 3OBI%E CO3P&TIN'

UN*711B *ntroductionB Mo"i#e Co$$unications B .n '/er/iew 1 Mo"i#e Co$$unication 1 guided trans$ission0 unguided trans$ission 1 signa# propagation (re8uencies0 antennae0 $odu#ation0 $odu#ation $ethods and standards (or /oice1 oriented data co$$unication standards0 $odu#ation $ethods and standards (or data and /oice co$$unication0 $o"i#e co$puting 1 no/e# app#ications and #i$itations0 $o"i#e co$puting architecture& $o"i#e syste$ networks& Unit12 Mo"i#e de/ices and syste$s B Ce##u#ar networks and (re8uency reuse0 Mo"i#e s$art phones& S$art $o"i#es and syste$s& !andhe#d pocket co$puters& !andhe#d de/ices0 S$art syste$s0 Li$itations o( $o"i#e de/ices& UN*713 CSM and other 2C .rchitectures B CSM 1 ser/ices and syste$ architecture0 +adio inter(aces o( CSM& Protoco#s o( CSM0 Loca#iEation& Ca## hand#ing& CP+&S syste$ architecture& UN*714 ire#ess $ediu$ access contro#0 CDM.& 3C and 4C co$$unication Modu#ation0 Mu#tip#e>ing0 Contro##ing the $ediu$ access& Spread spectru$& Coding $ethods0 *M712@@@ 3C wire#ess co$$unication standards0 co$$unication standards& CDM. 3C co$$unication standards& 4road"and wire#ess access0 4Cnetworks& &NIT V: Mo"i#e *P Network #ayerB *P and Mo"i#e *P network #ayersB 'S* #ayer (unctions0 7CPD*P and *nternet protoco#0 Mo"i#e internet protoco#L Packet de#i/ery and !ando/er Manage$entL Location Manage$entB .gent Disco/eryL Mo"i#e 7CP& &NIT VI: SynchroniEationB SynchroniEation in $o"i#e co$puting syste$s0 Usage $ode#s (or SynchroniEation in $o"i#e app#ication0 Do$ain1dependent speci(ic ru#es (or data synchroniEation0 Persona# in(or$ation $anager0 synchroniEation and con(#ict reso#ution strategies0 synchroniEerL Mo"i#e agentB $o"i#e agent design0 ag#etsL .pp#ication Ser/er& &NIT VII: *ntroduction to Mo"i#e .dhoc networkB (i>ed in(rastructure architecture0 M.N97 in(rastructure architectureL M.N97B properties0 spectru$0 app#icationsL Security in .d1hoc networkL sensor network app#ications& ire#ess sensor networksL CDM. 3 C

&NIT VIII:

ire#ess app#ication protoco# : .P;B

.P1&1 architecture0 wire#ess datagra$ protoco# : DP;0 wire#ess ire#ess ire#ess networking and wire#ess L.N0 L.N architecture0

transport #ayer security :wt#s;0 wire#ess transaction and session #ayers0 wire#ess app#ication en/iron$entL L.N0 -@2&11 architecture and protoco# #ayersB *999-@2&110 protoco# #ayers0 physica# #ayer -@2&11E Te0t Boo1:

1& .S'=9 = 7.LU=D9+0 !.S.N .!M9D0 +''P. + M.2.C.L0 NMo"i#e Co$puting0 7echno#ogy .pp#ications and Ser/ice CreationO Second 9dition0 Mc Craw !i##& :Unit110 $E/E$ENCE BOO)S: 1& U 9 !ans$ann0 Lother Merk0 Martin S& Nock#ous0 7ho$as Sto"er0 NPrincip#es o( 9dition0 Springer& 2& Fochen Schi##er0 NMo"i#e Co$$unications0O second edition0 Pearson Mo"i#e Co$puting0O Second Unit120 Unit130 Unit14; Unit1-; 2& +.F =.M.L0 NMo"i#e Co$puting0O second edition0 '>(ord& :Unit1%0 Unit1)0 Unit1,0

!"!#!$%!% NE#$& TEC#NO%O'IC!% &NIVE$SIT( )!)IN!*! IV (e+r B. Tech. Computer Science +nd En,ineerin, I Sem. OPEN SO&$CE SO/T"!$E &NIT I: INT$O*&CTION : *ntroduction to 'pen sources K Need o( 'pen Sources K .d/antages o( 'pen SourcesK .pp#ication o( 'pen Sources& 'pen source operating syste$sB L*NU?B *ntroduction K Cenera# '/er/iew K =erne# Mode and user $ode

&NIT II: L*NU?B Process K .d/anced Concepts K Schedu#ing K Persona#ities K C#oning K Signa#s K De/e#op$ent with Linu>& &NIT III : OPEN SO&$CE *!T!B!SE : MyS6LB *ntroduction K Setting up account K Starting0 ter$inating and writing your own S6L progra$s K +ecord se#ection 7echno#ogy K 6uery +esu#ts K Cenerating Su$$ary K orking with strings K Date and 7i$eK Sorting e"& orking with $etadata K Using se8uences K MyS6L and

&NIT IV: OPEN SO&$CE P$O'$!33IN' %!N'&!'ES : P!PB *ntroduction K Progra$$ing in we" en/iron$ent K /aria"#es K constants K data types K operators K State$ents K 5unctions K .rrays K ''P K String Manipu#ation and regu#ar e>pression K 5i#e hand#ing and data storage &NIT V: P!P and S6L data"ase KP!P and LD.P K P!P Connecti/ity K Sending and recei/ing 91$ai#s K De"ugging and error hand#ing K Security K 7e$p#ates& &NIT VI: P(T#ON : Synta> and Sty#e K Python '"3ects K Nu$"ers K Se8uences K Strings K Lists and 7up#es K Dictionaries K Conditiona#s and Loops &NIT VII: 5i#es K *nput and 'utput K 9rrors and 9>ceptions K 5unctions K Modu#es K C#asses and ''P K 9>ecution 9n/iron$ent& &NIT VIII: PE$% : Per# "ackgrounder K Per# o/er/iew K Per# parsing ru#es K 2aria"#es and Data K State$ents and Contro# structures K Su"routines0 Packages0 and Modu#es1 Te0t Boo1s: 1& +e$y Card0 9ric Du$as and 5rank Me/e#0 N7he Linu> =erne# 4ookO0 2& Ste/e Suchring0 NMyS6L 4i"#eO0 Fohn $e2erences: 1& +as$us Lerdor( and Le/in 7atroe0 NProgra$$ing P!PO0 '<+ei##y0 2@@2 2& es#ey F& Chun0 NCore Phython Progra$$ingO0 Prentice !a##0 2@@1 3& Martin C& 4rown0 NPer#B 7he Co$p#ete +e(erenceO0 2nd 9dition0 7ata McCraw1!i## Pu"#ishing Co$pany Li$ited0 *ndian +eprint 2@@A& 4& Ste/en !o#Ener0 NP!PB 7he Co$p#ete +e(erenceO0 2nd 9dition0 7ata McCraw1!i## *ndian +eprint 2@@A& %& 2ikra$ 2aswani0 NMMS6LB 7he Co$p#ete +e(erenceO0 2nd 9dition0 7ata McCraw 1!i## Pu"#ishing Co$pany Li$ited0 *ndian +eprint 2@@A& Pu"#ishing Co$pany Li$ited0 i#ey0 2@@2 i#ey Pu"#ications0 2@@3 orking with 5i#es KData Manipu#ation&

*N5'+M.7*'N +97+*92.L SMS79MS UN*7 11 *ntroductionB De(inition& '"3ecti/es& 5unctiona# '/er/iew& +e#ations D4MS& Digita# #i"raries and Data arehouses&

UN*7 12 *n(or$ation +etrie/a# Syste$ Capa"i#itiesB Search& 4rowse0 Misce##aneous Cata#oging and *nde>ingB '"3ecti/es0 *nde>ing Process0 .uto$atic *nde>ing& *n(or$ation 9>traction& UN*7 13 Data StructuresB *ntroduction0 Ste$$ing .#gorith$s& *n/erted ti#e structures& N1gra$ data structure& P.7 data structure& Signature (i#e structure& !yperte>t data structure&

UN*71*2B .uto$atic *nde>ingB C#asses o( auto$atic inde>ing0 Statistica# inde>ing& Natura# #anguage& Concept inde>ing0 !yperte>t #inkages UN*71% Docu$ent and 7er$ C#usteringB *ntroduction& 7hesaurus generation& *te$ c#ustering0 !ierarchy o( c#usters& UN*7 1) User Search 7echni8uesB Search state$ents and "inding& Si$i#arity $easures and ranking& +e#e/ance (eed"ack0 Se#ecti/e disse$ination o( in(or$ation search& eighted searches o( 4oo#ean syste$s& Searching the *nternet and hyperte>t& UN*7 K , *n(or$ation 2isua#iEationB *ntroduction& Cognition and perception& *n(or$ation /isua#iEation techno#ogies& UN*7 K 7e>t Search .#gorith$sB *ntroduction0 So(tware te>t search a#gorith$s& !ardware te>t search syste$s& In2orm+tion S.stem Ev+lu+tionB *ntroduction0 Measures used in syste$ e/a#uation0 Measure$ent e>a$p#e 7+9C resu#ts&

&3% A *ESI'N P!TTE$NS %!B 1& 7o create a UML diagra$ o( .7M .PPL*C.7*'N& 2& 7o create a UML diagra$ o( L*4+.+M M.N.C9M9N7 SMS79M& 3& 7o create a UML diagra$ o( 'NL*N9 4''= S!'P 4& 7o create a UML diagra$ o( +.*L .M +9S9+2.7*'N SMS79M %& 7o create a UML diagra$ (or 4.N=*NC SMS79M
6.

7o design a Docu$ent 9ditor

,& Using UML design ."stract (actory design pattern -& Using UML design 4ui#der Design pattern A& Using UML design 5acade Design pattern 1@& Using UML design 4ridge Design pattern 11& Using UML design Decorator Design pattern 12& User gi/es a print co$$and (ro$ a word docu$ent& Design to represent this chain o( responsi"i#ity design pattern

!"!#!$%!% NE#$& TEC#NO%O'IC!% &NIVE$SIT( )!)IN!*! IV (e+r B. Tech. Computer Science +nd En,ineerin, I Sem. 3OBI%E !PP%IC!TION *EVE%OP3ENT %!B 1& 2& rite a F2M9 progra$ to show how to change the (ont siEe and co#our& rite a F2M9 progra$ which creates the (o##owing kind o( $enu& P cut P copy P past P de#ete P se#ect a## P unse#ect a## 3& Create a F2M9 $enu which has the (o##owing options :9/ent !and#ing;B cut 1 can "e onDo(( copy 1 can "e onDo(( paste 1 can "e onDo(( de#ete 1 can "e onDo(( se#ect a## 1 put a## 4 options on unse#ect a## 1 put a##

4& Create a M*DP app#ication0 which draws a "ar graph to the disp#ay& Data /a#ues can "e gi/en at intQR array& Mou can enter (our data :integer; /a#ues to the input te>t (ie#d& %& Create an M*DP app#ication which e>a$ine0 that a phone nu$"er0 which a user has entered is in the gi/en (or$at :*nput checking;B P .rea code shou#d "e one o( the (o##owingB @4@0 @410 @%@0 @4@@0 @44 P 7here shou#d )1- nu$"ers in te#ephone nu$"er :S area code; )& rite a sa$p#e progra$ to show how to $ake a S'C=97 Connection (ro$ F2M9 phone& 7his F2M9 sa$p#e progra$ shows how to how to $ake a S'C=97 Connection (ro$ a F2M9 Phone& Many a ti$es there is a need to connect "ackend !77P ser/er (ro$ the F2M9 app#ication& Show how to $ake a S'C=97 connection (ro$ the phone to port -@& ,& Login to !77P Ser/er (ro$ a F2M9 Progra$& 7his F2M9 sa$p#e progra$ shows how to disp#ay a si$p#e L'C*N SC+99N on the F2M9 phone and how to authenticate to a !77P ser/er& Many F2M9 app#ications (or security reasons re8uire the authentication o( the user& 7his (ree F2M9 sa$p#e progra$0 shows how a F2M9 app#ication can do authentication to the "ackend ser/er& NoteB Use .pache 7o$cat Ser/er as e" Ser/er and MyS6L as Data"ase Ser/er&

-& 7he (o##owing shou#d "e carried out with respect to the gi/en set o( app#ication do$ainsB :.ssu$e that the Ser/er is connected to the we##1$aintained data"ase o( the gi/en do$ain& Mo"i#e C#ient is to "e connected to the Ser/er and (etch the re8uired data /a#ueDin(or$ation; T Students Marks 9n8uiry T 7ownDCity Mo/ie 9n8uiry T +ai#wayD+oadD.ir :5or e>a$p#e PN+; 9n8uiryDStatus T Sports :say0 Cricket; Update T 7ownDCity eather Update

T Pu"#ic 9>a$s :say *nter$ediate or SSC;D 9ntrance :Say 9.MC97; +esu#ts 9n8uiry Di/ide Student into 4atches and suggest the$ to design data"ase according to their do$ains and render in(or$ation according the re8uests& A& 1@& rite an .ndroid app#ication progra$ that disp#ays !e##o rite an .ndroid app#ication progra$ that disp#ays !e##o or#d using 7er$ina#& or#d using 9c#ipse&

11& rite an .ndroid app#ication progra$ that accepts a na$e (ro$ the user and disp#ays the he##o na$e to the user in response as output using 9c#ipse& 12& rite an .ndroid app#ication progra$ that de$onstrates the (o##owingB :i; LinearLayout :ii; +e#ati/eLayout :iii; 7a"#eLayout :i/; Crid2iew #ayout 13& 14& rite an .ndroid app#ication progra$ that con/erts the te$perature in Ce#sius to 5ahrenheit& rite an .ndroid app#ication progra$ that de$onstrates intent in $o"i#e app#ication de/e#op$ent&