Scheme and Syllabus

(With effect from 2010-2011)

Master of Computer Applications

V SV!SVA"A#A $!C%&'(') CA( *& V!"S $#+ ,!()A*M

SC%!M! '- $!AC% &) A&. !/AM &A$ '& MAS$!" '- C'M0*$!" A00( CA$ '&S S!M!S$!" S. No. Subject Code Title Teaching Hrs / Week Theory Pract ical %' %' %' %' %' ( ( ( +% ( ( ( ( ( %) %) %) %7 Examination uration "# $ + ) ' * 3 5 6 $%!C#$$ $%!C#$+ $%!C#$) $%!C#$' $%!C#$* $%!C#$3 $%!C#$5 $%!C#$6 Problem Sol&ing using C iscrete !athematics ,undamentals o- Com.uter /rgani0ation "ntroduction to 1nix Pro-essional Communication 2 Ethics C Programming 4aboratory 1nix 4aboratory "T and igital Electronics 4aboratory Total %) %) %) %) %) %) %) %) *% *% *% *% *% *% *% *% '%% !arks Exam $%% $%% $%% $%% $%% *% *% *% 3*% Total $*% $*% $*% $*% $*% $%% $%% $%% $%*%

SC%!M! '- $!AC% &) A&. !/AM &A$ '& MAS$!" '- C'M0*$!" A00( CA$ '&S S!M!S$!" S. No. Subject Code Title Teaching Hrs / Week Theory Practical uration Examination !arks "# $ + ) ' * 3 5 6 $%!C#+$ $%!C#++ $%!C#+) $%!C#+' $%!C#+* $%!C#+3 $%!C#+5 $%!C#+6 8usiness ata Processing 9ith C/8/4 /bject /riented Programming 9ith C: : ata Structures using C !anagement "n-ormation Systems /.erations ;esearch C/8/4 Programming 4aboratory ata Structures 1sing C 4aboratory /bject /riented Programming 9ith C: : 4aboratory Total %' %' %' %' %' ( ( ( +% ( ( ( ( ( %) %) %) %7 %) %) %) %) %) %) %) %) *% *% *% *% *% *% *% *% '%% Exam $%% $%% $%% $%% $%% *% *% *% 3*% Total $*% $*% $*% $*% $*% $%% $%% $%% $%*%

SC%!M! '- $!AC% &) A&. !/AM &A$ '& MAS$!" '- C'M0*$!" A00( CA$ '&S S!M!S$!" S. No. Subject Code Title Teaching Hrs / Week Theory Practica l %' %' %' %' %' ( ( ( +% ( ( ( ( ( %) %) %) %7 Examination uration "# %) %) %) %) %) %) %) %) *% *% *% *% *% *% *% *% '%% !arks Exam $%% $%% $%% $%% $%% *% *% *% 3*% Total $*% $*% $*% $*% $*% $%% $%% $%% $%*%

$ + ) ' * 3 5 6

$%!C#)$ $%!C#)+ $%!C#)) $%!C#)' $%!C#)* $%!C#)3 $%!C#)5 $%!C#)6

Systems So-t9are Com.uter Net9orks Programming 9ith <a&a atabase !anagement Systems /.erating Systems Systems Programming 4aboratory <a&a Programming 4aboratory 8!S 4aboratory Total

SC%!M! '- $!AC% &) A&. !/AM &A$ '& MAS$!" '- C'M0*$!" A00( CA$ '&S V S!M!S$!" S. No. Subject Code Title Teaching Hrs / Week Theory Practic al %' ( %' ( %' ( %' ( %' ( ( %) ( %) ( %) +% %7 Examination uration %) %) %) %) %) %) %) %) "# *% *% *% *% *% *% *% *% '%% !arks Exam Total $%% $*% $%% $*% $%% $*% $%% $*% $%% $*% *% $%% *% $%% *% $%% 3*% $%*%

$ + ) ' * 3 5 6

$%!C#'$ $%!C#'+ $%!C#') $%!C#'' $%!C#'* $%!C#'3 $%!C#'5 $%!C#'6

To.ics in Enter.rise #rchitectures = " So-t9are Engineering Web Programming esign and #nalysis o- #lgorithms Electi&e " <+EE 4aboratory Web .rogramming 4aboratory #lgorithms 4aboratory Total $%!C#'*$ $%!C#'*+ $%!C#'*) $%!C#'*' $%!C#'** $%!C#'*3

!lecti1e Com.uter >ra.hics and ?isuali0ation 1N"@ system Programming !ultimedia Systems Pattern ;ecognition Princi.les o- 1ser "nter-ace esign #d&anced Com.uter Net9orks

SC%!M! '- $!AC% &) A&. !/AM &A$ '& MAS$!" '- C'M0*$!" A00( CA$ '&S V S!M!S$!" S. No. Subject Code $%!C#*$ Title Teaching Hrs / Week Theory Practi cal %' ( %' %' %' %' ( ( ( +' $%!C#**$ $%!C#**+ $%!C#**) $%!C#**' $%!C#*** $%!C#**3 ( ( ( ( %) %) %) %3 uration %) %) %) %) %) %) %) %) Examination !arks "# Exam *% $%% *% *% *% *% *% *% *% '%% $%% $%% $%% $%% *% *% *% 3*%

$ + ' * 3 5 6 $%!C#*'$ $%!C#*'+ $%!C#*') $%!C#*'' $%!C#*'* $%!C#*'3

/bject(/riented !odeling and esign Patterns $%!C#*+ System Simulation and !odeling $%!C#*) To.ics in Enter.rise #rchitectures ("" $%!C#*' Electi&e "" $%!C#** Electi&e """ $%!C#*3 So-t9are esign 4aboratory $%!C#*5 .Net 4aboratory $%!C#*6 !ini Project Total !lecti1e "n-ormation ;etrie&al ata Warehousing and ata !ining Su..ly Chain !anagement Net9ork !anagement Com.iler esign So-t9are #rchitectures

Total $*% $*% $*% $*% $*% $%% $%% $%% $%*%

!lecti1e "n-ormation 2 Net9ork Security So-t9are Testing Ser&ices /riented #rchitecture Wireless Net9orks and !obile Com.uting Storage #rea Net9orks Web +.% 2 ;ich "nternet #..lications

SC%!M! '- $!AC% &) A&. !/AM &A$ '& MAS$!" '- C'M0*$!" A00( CA$ '&S V S!M!S$!" S. No. Subject Code Title Teaching Hrs / Week Theory Practic al ( %) Examination uration "# $ Project Work %) *% !arks issertation $+* ?i&a 5* Total +*%

&'$!2 Students ha1e to re3ister for one !lecti1e from each of the $hree !lecti1e )roups

444

S!M!S$!"
0roblem Sol1in3 *sin3 C
Sub5ect Code2 10MCA11 %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am Mar7s2 100 !;am %ours2 <

Al3orithms and -lo=charts 2 %ours The meaning o- algorithmsA ,lo9charts and their needA Writing algorithms and dra9ing -lo9charts -or sim.le exercises like -inding biggest o- three numbersA to -ind roots o- gi&en Buadratic eBuationA to -ind the biggest and smallest o- gi&en set o- numbers and such other sim.le exam.les Constants+ Variables and .ata $ypes : %ours Character setA C tokensA key9ords 2 identi-iersA structure o- C .rogramA executing a C .rogram. ConstantsA &ariablesA data ty.esA declaration o- &ariablesA declaration o- storage classesA assigning &alues to &ariables de-ining symbolic constantsA declaring a &ariable as constantA declaring a &ariable as &olatileA o&er-lo9 and under-lo9 o- data. 'perators and !;pressions < %ours #rithmetic o.eratorsA relational o.eratorsA logical o.eratorsA assignment o.eratorA increment and decrement o.eratorA conditional o.eratorA bit9ise o.eratorsA comma o.eratorA s.ecial o.eratorsA arithmetic ex.ressionsA e&aluation o- ex.ressionsA .recedence o- arithmetic o.eratorsA ty.e con&ersions in ex.ressionsA o.erator .recedence and associati&ityA mathematical -unctions Mana3in3 nput and 'utput 'perations : %ours The scanf() & printf() -unctions -or in.ut and out.ut o.erationsA reading a characterA 9riting a characterA Cthe getchar() & putchar() -unctionsD A the address o.eratorC&DA -ormatted in.ut and out.ut using -ormat s.eci-iersA Writing sim.le com.lete C .rograms. Control Statements : %ours ecision making 9ith if statementA sim.le i- statementA the if..else statementA nesting o- if..else statementsA the else..if ladderA the switch statementA the ?2 o.eratorA the goto statementA the break statementA .rogramming exam.les (oop Control Structures < %ours The 9hile statementA the do..9hile statementA the -or statementA nested loo.sA jum.s in loo.sA the continue statementA .rogramming exam.les Arrays < %ours The meaning o- an arrayA one dimensional and t9o dimensional arraysA declaration and initiali0ation oarraysA reading A 9riting and mani.ulation o- abo&e ty.es o- arraysA multidimensional arraysA dynamic arraysA .rogramming exam.les. Character Arrays and Strin3s < %ours eclaring and initialing string &ariablesA reading string -rom terminalA 9riting string to screenA arithmetic o.erations on charactersA .utting strings togetherA com.arison o- t9o stringsA string handling -unctionsA table o- stringsA other -eatures o- stringsA .rogramming exam.les. *ser .efined -unctions > %ours Need -or user de-ined -unctionsA a multi -unction .rogramA elements o- 1ser de-ined -unctionsA de-ining -unctionsA return &alues and their ty.esA -unction callsA -unction declarationA category o- -unctionsA no arguments and no return &aluesA arguments but no return &aluesA arguments 9ith return &aluesA no arguments 9ith return &alueA -unctions that return multi.le &aluesA nesting o- -unctionsA recursionA .assing arrays to -unctionsA .assing string to -unctionsA .rogramming exam.les. Structures and *nions < %ours e-ining a structureA declaring structure &ariablesA accessing structure membersA structure initiali0ationA co.ying and com.aring structure &ariablesA o.erations on indi&idual membersA array o- structuresA structures 9ithin structuresA structures and -unctionsA 1nionsA si0e o- structuresA bit -ieldsA .rogramming exam.les

444
0ointers 8 %ours 1nderstanding .ointersA accessing the address s.ace o- a &ariableA declaring and initiali0ation .ointer &ariablesA accessing a &ariable through its .ointerA chain o- .ointersA .ointer ex.ressionsA .ointers and arraysA .ointer and character stringsA array o- .ointersA .ointer as -unction argumentsA -unctions returning .ointersA .ointers to -unctionsA .ointers and structuresA .rogramming exam.les -ile Mana3ement in C > %ours e-ining and o.ening a -ileA closing a -ileA in.ut/out.ut o.erations on -ilesA error handling during "// o.erationsA random access -ilesA command line argumentsA .rogramming exam.les. .ynamic Memory Allocation : %ours ynamic memory allocationA allocating a block o- memoryE malloc, allocating multi.le blocks o- memoryE callocA releasing the used s.aceE FreeA altering the si0e o- a blockE reallocA .rogramming exam.les $he 0reprocessor 2 %ours "ntroductionA macro substitutionA -iles inclusionA com.iler control directi&esA #NS" additionsA .rogramming exercises. $e;t ,oo7s2 $. 8alagurusamyE Programming in #NS" CA 'th EditionA Tata !c>ra9 HillA +%%6. CCha.tersE +A )A 'A *A 3A 5A 6A 7A $%A $$A $+A $).$($).3 2 $'D +. ? ;ajaramanE Com.uter Programming in CA PH"A +%%%. CCha.tersE $.$A $.)A +.$A +.)A ).$A ).+ and ).)D "eference ,oo7sE $. 8ehrou0 # ,orou0an and ;ichard , >ilbergE Structured Programming #..roach CA +nd EditionA ThomsonA +%%*. +. ! > ?enkateshmurthyE Programming TechniBues through CAPearson EducationA +%%*. ). "&or HortonE 8eginning C -rom No&ice to Pro-essionalA 'th EditionA S.ringerA +%%*. '. #shok N FamthaneE Programming 9ith #NS" and Turbo CA Pearson EducationA +%%+. *. F ; ?enugo.alA S ; PrasadE !astering CA Tata !c>ra9 HillA +%%3.

.iscrete Mathematics
Sub5ect Code2 10MCA12 %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am Mar7s2 100 !;am %ours2 < > %ours iagramsA # ,irst Word

Set $heory Sets and SubsetsA Set /.erations and the 4a9s o- Set TheoryA Counting and ?enn on ProbabilityA Countable and 1ncountable Sets

-undamentals of (o3ic 1< %ours 8asic Connecti&es and Truth TablesA 4ogic EBui&alence = The 4a9s o- 4ogicA 4ogical "m.lication = ;ules o- "n-erenceG The 1se o- Huanti-iersA Huanti-iersA e-initions and the Proo-s o- Theorems 0roperties of the nte3ers ? %ours !athematical "nductionA The Well /rdering Princi.le = !athematical "nductionA ;ecursi&e e-initions "elations and -unctions 1: %ours Cartesian Products and ;elationsA ,unctions = Plain and /ne(to(/neA /nto ,unctions = Stirling Numbers othe Second FindA S.ecial ,unctionsA The Pigeon(hole Princi.leA ,unction Com.osition and "n&erse ,unctionsG Pro.erties o- ;elationsA Com.uter ;ecognition = Iero(/ne !atrices and irected >ra.hsA Partial /rders = Hasse iagramsA EBui&alence ;elations and Partitions )roups+ Codin3 $heory and "in3s > %ours e-initionsA Exam.lesA and Elementary Pro.ertiesA Homomor.hismsA "somor.hismsA and Cyclic >rou.sA CosetsA and 4agrangeJs Theorem Elements o- Coding TheoryA The Hamming !etricA The Parity CheckA and >enerator !atrices

444
)roup Codes+ "in3s and Modular Arithmetic > %ours ecoding 9ith Coset 4eadersA Hamming !atrices The ;ing Structure = e-inition and Exam.lesA ;ing Pro.erties and SubstructuresA The "ntegers !odulo n $e;t ,oo72 $. ;al.h P. >rimaldiE iscrete and Combinatorial !athematicsA *th EditionA Pearson EducationA +%%'. CCha.ter ).$A ).+A ).)A ).'A #..endix )A Cha.ter +A Cha.ter '.$A '.+A Cha.ter *.$ to *.3A Cha.ter 5.$ to 5.'A Cha.ter $3.$A $3.+A $3.)A $3.* to $3.7A and Cha.ter $'.$A $'.+A $'.)D. "eference ,oo7s2 $. Fenneth H. ;osenEA iscrete !athematics and its #..licationsA 3th EditionA !c>ra9 HillA +%%5. +. <ayant >angulyE # Treatise on iscrete !athematical StructuresA Sanguine(PearsonA +%$%. ). .S. !alik and !.F. SenE iscrete !athematical StructuresE Theory and #..licationsA ThomsonA +%%'. '. Thomas FoshyE iscrete !athematics 9ith #..licationsA Else&ierA +%%*A ;e.rint +%%6.

-undamentals of Computer 'r3ani@ation

Sub5ect Code2 10MCA1< %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am Mar7s2 100 !;am %ours2 <

&umber Systems and (o3ic )ates ? %ours Counting in ecimal and 8inaryA Place ?alueA 8inary to ecimal Con&ersionA ecimal to 8inary Con&ersionA Hexadecimal NumbersA /ctal NumbersA 8itsA 8ytesA NibblesA and Word Si0eA The #N >ateA The /; gateA The in&erter and 8u--erA The N#N gateA the N/; >ateA The exclusi&e /; gateA The Exclusi&e N/; >atesA The N#N >ate as an uni&ersal >ateA >ates 9ith !ore than t9o in.utsA 1sing "n&erters to con&ert gates. Combinin3 (o3ic )ates and Arithmetic Circuits A %ours Constructing Circuits -rom 8oolean Ex.ressionA ra9ing a circuit -rom a !axterm 8oolean Ex.ressionA Truth Tables and 8oolean Ex.ressionsA Sam.le Problem Sim.li-ying 8ooleanEx.ressionA Farnaugh !a.sA Farnaugh !a.s 9ith three &ariablesA Farnaugh !a.s 9ith -our &ariablesA more Farnaugh !a.sA using emorganJs TheoremA 8inary #dditionA Hal- #ddersA ,ull #ddersA Three 8it #ddersA 8inary SubtractionA Parallel SubtractorsA "C #ddersA 8inary !ulti.licationA 8inary !ulti.liersA +s Com.lement NotationA #ddition and SubtractionA +s Com.lement adders/subtractor ,asic Structure of Computer > %ours Com.uter Ty.esA ,unctional 1nitsA 8asic /.erational Conce.tsA 8us structuresA Per-ormanceA !emory 4ocation and #ddresses Machine nstruction and 0ro3rammes B %ours !emory /.erationsA "nstructions 2 "nstruction SeBuencingA #ddressing !odesA #ssemble 4anguageA 8asic "n.ut//ut.ut /.erations nput9'utput 'r3ani@ation #ccessing "// e&icesA "nterru.tsA irect !emory #ccessesA 8uses +'%A "nter-ace Circuits B %ours

Memory Systems B %ours Some 8asics conce.tsA Semiconductors ;#! !emoriesA ;ead(/nly !emoriesA Cache !emoriesA ?irtual !emories Arithmetic *nit > %ours #ddition 2 subtraction o- Signed NumbersA esign o- ,ast addersA !ulti.lication o- Positi&e NumbersA Signed(/.erand !ulti.licationA ,ast !ulti.licationA "nteger di&ision ,loating(Point Numbers 2 /.erations $e;t ,oo7s2 $. TokheimE igital Electronics Princi.les and #..licationsA !c>ra9 HillA 3th EditionA +%%'. CCha.tersE +.$ to +.'A +.3 to +.6A ).$ to ).$%A '.$ to '.7A '.$3A $%.$ to $%.$$D +. Carl HamacherA I ?arnesic and S IakyE Com.uter /rgani0ationA *th EditionA !c>ra9 HillA +%%+. CCha.tersE $.$ to $.'A $.3A +.+ to +.5A '.$A '.+A '.' to '.3A *.$ to *.*A *.5A 3.$ to 3.5D

444
"eference ,oo7s2 $. ! !orris !anoE igital 4ogic and Com.uter esignA $%th EditionA PearsonA +%%6. +. !orris !anoA and Charles ; FimeE 4ogic and Com.uter esign ,undamentalsA +nd EditionA Pearson EducationA +%%$.

ntroduction to *& /
Sub5ect Code2 10MCA1: %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am Mar7s2 100 !;am %ours2 <

10 %ours )eneral 0urpose *tilities2 bannerA calA dateA calendarA 9hoA .rint-A ttyA sttyA unameA .ass9dA lockA echoA t.utA bcA scri.tA s.ell and is.ell. &a1i3atin3 the -ile System2 The -ileA 9hatJs in a -ilenameK the .arent(child relationshi.A .9dA the Home directoryA #bsolute .athnamesA using absolute .athnames -or a commandA cdA mkdirA rmdirA ;elati&e .athnamesA The 1N"@ -ile system %andlin3 'rdinary -iles2 catA c.A rmA m&A moreA l.A -ileA 9cA odA s.litA cm.A comm.A di--. > %ours $he 1i editor2 The Three !odesA "n.ut !odeA Sa&ingA The ;e.eat ,actorA Command !odeA eletionA Na&igationA Pattern SearchA <oining linesA ;e.eating the 4ast commandA undoing the 4ast Editing "nstructionsA Search and ;e.lace. ,asic -ile Attributes2 ls =lA the =d o.tionA ,ile PermissionsA chmod. Security and -ile 0ermission2 users and grou.sA security le&elA changing .ermissionA user masksA changing o9nershi. and grou. > %ours Shell 0ro3rammin32 Shell Scri.tsA readA Command 4ine #rgumentsA Exit Status o- a CommandA The 4ogical /.erators 22 and LLA exitA i-A and case conditionsA ex.rA slee. and 9aitA 9hileA untilA -orA MA NA redirectionA The here documentA setA tra.A Sam.le ?alidation and ata Entry Scri.ts. $he 0rocess: .rocess basicsA PSA internal and external commandsA running jobs in backgroundA niceA at and batchA cronA time commands Customi@in3 the !n1ironment: System ?ariablesA .ro-ileA styA PW A #liasesA Command HistoryA /n(4ine Command Editing B %ours More file attributes2 hard linkA symbolic linkA umaskA -ind Simple filters2 P;A headA tailA cutA .asteA sortA uniBA tr commands ? %ours -ilters usin3 "e3ular !;pression and the 3rep -amily2 gre.A ;egular Ex.ressionA egre.A -gre.A a sed instructionA 4ine #ddressingA "nserting and Changing TestA Context addressingA 9riting selected lines to a -ileA The =- o.tionA SubstitutionA Pro.erties o- ;egular Ex.ressions ? %ours !ssential Shell 0ro3rammin3E shell scri.tA readA exitA the i- conditionalA using Tests and OP to e&aluate ex.ressionA the case conditional ex.rA 9hileE loo.ingA -orE loo.ing 9ith a listA set and shi-tA tra.A debugging shell scri.ts 9ith Set ( @. !ssential System Administration: rootA administartorJs .ri&ilegesA startu. 2 Shutdo9nA managing disk s.aceA c.ioA tar > %ours a=7-Ad1anced -ilters2 Sim.le a9k ,ilteringA S.litting a 4ine in to ,ieldsA .rint-A the 4ogical and ;elational /.eratorsA Number ProcessingA ?ariablesA The (- o.tionA The 8E>"N and EN Positional ParametersA get lineA 8uilt(in &ariablesA #rraysA ,unctionsA "nter-ace 9ith the ShellA Control ,lo9. Ad1anced Shell 0ro3rammin32 The sh commandA ex.ortA cdA the CommandA ex.rA Conditional Parameter SubstitutionA !erging StreamsA Shell ,unctionsA e&alA Exec Statement. 2 %ours

444
Ad1anced 1i2 /.eratorsA the ex modeA named bu--ered A Numbered 8u--ersA Entering Control CharactersA Searching -or a CharacterA !arking Text Customi0ingA &i $e;t ,oo7s2 $. Sumitabha asE 1N"@ Conce.ts and #..licationsA 'th EditionA Tata !c>ra9 HillA +%%3. CCha.tersE $.+A +A )A 'A *A 3A 5A 6A 7A $%A $$A $+A $)A $'A +$A +%A +$D +. 8ehrou0 # ,orou0an and ;ichard , >ilbergE 1N"@ and Shell ProgrammingA Thomson Course TechnologyA +%%*. CCha.terE 'D "eference ,oo7s2 $. Fenneth ;oson et alE 1N"@ ( The Com.lete ;e-erenceA /sborne/!c>ra9 HillA $777. +. Ste&e !ontsuguE 1sing 1N"@A +nd EditonA Prentice Hall "ndiaA $777. ). ! > ?enkateshmurthyE 1N"@ and Shell ProgrammingA Pearson EducationA +%%*.

0rofessional Communication and !thics

Sub5ect Code2 10MCA18 %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am Mar7s2 100 !;am %ours2 < 8 %ours

0rofessional 9 $echnical Communication ,asics of $echnical Communication "ntroductionA Process o- CommunicationA 4anguage as a ToolA 4e&els o- CommunicationA 4e&els o- CommunicationA Communication Net9orksA "m.ortance o- Technical Communication ,arriers to Communication e-inition o- NoiseA Classi-ication o- 8arriers

< %ours

$echnolo3y in Communication : %ours "m.act o- TechnologyA So-t9are -or Creating !essagesA So-t9are -or Writing ocumentsA So-t9are -or Presenting ocumentsA Transmitting ocumentsA E--ecti&e use o- #&ailable Technology Acti1e (istenin3 < %ours "ntroductionA Ty.es o- 4isteningA Traits o- good 4istenerA #cti&e &ersus .assi&e listeningA im.lications oe--ecti&e listening !ffecti1e 0resentation Strate3ies 8 %ours "ntroductionA e-ining .ur.oseA #naly0ing #udience and 4ocaleA /rgani0ing ContentsA .re.aring outlineA ?isual #idsA 1nderstanding Nuances o- eli&eryA FinesicsA ProxemicsA ParalinguisticJsA ChronemicsA Sam.le s.eech )roup Communication 8 %ours "ntroductionA >rou. iscussionA /rgani0ational >rou. discussionA >rou. discussion as .art o- selection .rocess !eetingsA con-erences. "esearch paper+ .issertation and $hesis "ntroductionA ;esearch .a.erA issertationA Thesis !thics2 An '1er1ie= of !thics What are EthicsK Ethics in the 8usiness WorldA Ethics in "n-ormation Technology C"TD !thics for $ 0rofessionals and $ users "T .ro-essionalsA The Ethical beha&ior o- "T .ro-essionalsA "T 1sers 0ri1acy Pri&acy Protection and the 4a9A Fey Pri&acy and #nonymity "ssues Soft=are .e1elopment Strategies to Engineer Huality s/9A Fey "ssues : %ours

< %ours

: %ours < %ours < %ours

444
!mployer9!mployee ssues 1se o- Nontraditional 9orkersA Whistle 8lo9ing Case Studies and .iscussion < %ours ? %ours

$e;t ,oo7s2 $. !eenakshi ;aman and Sangeeta SharmaE Technical Communication ( Princi.les and PracticesA /x-ord 1ni&ersity PressA +%%'. CCha.tersE $A +A )A 'A *A 5A $3D +. >eorge ;eynoldsE Ethics in "n-ormation TechnologyA +nd EditionA Thomson Course TechnologyA +%%5. CCha.tersE $A +A 'A 5A 6D "eference ,oo7s2 $. !.#shra- ;i0i&iE E--ecti&e Technical CommunicationA Tata !c>ra9 HillA +%%*. +. !ike W !artin and ;onald Schin0ingerE Ethics in EngineeringA ) rd EditionA Tata !c>ra9 HillA +%%5.

C 0ro3rammin3 (aboratory
Sub5ect Code2 10MCA1> %ours9Wee72 < $otal %ours2 :2 0art A $. +. ). '. *. a. Write a .rogram to -ind the area o- a triangle C>i&en the three sidesD. b. Write a .rogram to -ind the area o- a circle C>i&en the radiusD. Write a .rogram to -ind the Sim.le interestA gi&en the .rinci.leA time and rate o- interest 9ith a..ro.riate &alidations. Write a .rogram to -ind out 9hether a gi&en year is a lea. year or not. Write a .rogram to -ind the roots o- a Buadratic eBuation 9ith a..ro.riate error messages. Write a .rogram to dis.lay the -ollo9ing -iles o- current directory. iD 6E@E -iles iiD 68#T -iles iiiD 6/8< -iles i&D 68#F -iles. 8y using system /S command. Write a .rogram to -ind >C and 4C! o- gi&en t9o numbers. Write a .rogram to -ind the &alue o- Sin CxD using the series. Sin CxD Q x = x)/)R : x*/*R = x5/5R : SSSSS. Write a .rogram to .rint all .rime numbers bet9een m and n. Write a .rogram to re&erse a number and check 9hether it is .alindrome or Not. 6A6 Mar7s2 80 !;am Mar7s2 80 !;am %ours2 <

3. 5. 6. . 7.

$%. Write a .rogram to generate and .rint -irst n ,ibonacci numbers using -unction. $$. Write a .rogram to -ind a -actorial o- a gi&en number using recursi&e -unction. $+. Write a .rogram to con&ert 1PPE;C#SE al.habets to 4/WE;C#SE al.habets in a gi&en string and &ice(&ersa. $). Write a .rogram to read t9o strings and concatenate them C9ithout using library -unctionsD. $'. Write a .rogram to read a sentence and count the number o- &o9els and constants.

444
0A"$ - , $. +. Write a .rogram to read N integers C0eroA : &e and =&eD into an array and -ind sum o- .ositi&e numbersA sum o- negati&e numbers and a&erage o- all in.ut numbers6 Write a .rogram to in.ut N real numbers and to -ind the meanA &ariance and standard de&iationA 9hereA !ean Q xi / N Cxi = meanD+ ?ariance Q (((((((((((((((( N e&iation Q &ariance and % i U n ). Write a .rogram to in.ut N numbers Cintegers or realD and store them in an array. Conduct a 4inear search -or a gi&en key number and re.ort success or -ailure in the -orm o- a suitable message. Write a .rogram to sort N numbers in ascending or descending order using bubble sort. Write a .rogram to acce.t N numbers sorted in ascending order and search -or a gi&en number using binary search. ;e.ort success or -ailure in the -orm o- suitable messages. Write a .rogram to read t9o matrices # and 8 o- si0e ! x N and .er-orm .roduct o- t9o gi&en matrices. Write a .rogram to list the names o- students 9ho ha&e scored more than 3%T o- total marks in three subjects using structure &ariables. Write a .rogram to com.ute the sum o- t9o com.lex numbers = .assing a structure to a -unction. e-ine a book structure ha&ing title o- the bookA "S8NA authorA .rice and month and year o.ublication as its members. 1se a substructure to store the month and year o- Publication in-ormation. e&elo. a .rogram to acce.t a date Cin the -orm o- month and yearD and list out all the book titles Calong 9ith .rice and "S8ND .ublished during that date. e-ine a student structure ha&ing the nameA 1SN Cuni&ersity seat numberDA marks in -i&e subjectsA total and .ercentage o- marks as its members. !arks o- all the subjects are to be stored in an array. e&elo. a .rogram to list the names o- all the students 9ho ha&e -ailed.

'. *. 3. 5. 6. 7.

$%.

$$. Write a .rogram to read N integers and store them in an arrayA -ind the sum o- all these elements using .ointer. /ut.ut the gi&en array and the com.uted sum 9ith suitable heading. $+. Write a .rogram to read and 9rite to a -ile. $). Write a .rogram to Create and count number o- characters in a -ile. $'. Write a .rogram to handle -iles 9ith mixed data ty.e. &ote2 Students are reCuired to e;ecute one Cuestion from 0art A and one from 0art ,

*& / 0ro3rammin3 (aboratory

Sub5ect Code2 10MCA1? %ours9Wee72 < $otal %ours2 :2 6A6 Mar7s2 80 !;am Mar7s2 80 !;am %ours2 <

444
$. a. b. Write a non(recursi&e shell scri.t 9hich acce.ts any number o- arguments and .rints them in the re&erse order C,or exam.leA i- the scri.t is named ragsA then executing args # 8 C should .roduce C 8 # on the standard out.utD. Write a shell scri.t that acce.ts t9o -ile names as argumentsA checks i- the .ermissions -or these -iles are identical and i- the .ermissions are identicalA out.ut common .ermissions and other9ise out.ut each -ile name -ollo9ed by its .ermissions. Write a shell scri.t that takes a &alid directory name as an argument and recursi&ely descend all the subdirectoriesA -inds the maximum length o- any -ile in that hierarchy and 9rites this maximum &alue to the standard out.ut. Write a shell scri.t that acce.ts a .ath name and creates all the com.onents in that .ath name as directories. ,or exam.leA i- the scri.t is named m.cA then the command m.c a/b/c/d should create directories aA a/bA a/b/cA a/b/c/d.

+.

a. b.

). a. Write a shell scri.t 9hich acce.ts &alid log(in names as arguments and .rints their corres.onding home directoriesA i- no arguments are s.eci-iedA .rint a suitable error message. b. Write shell scri.t to im.lement terminal locking Csimilar to the lock commandD. "t should .rom.t the user -or a .ass9ord. #-ter acce.ting the .ass9ord entered by the userA it must .rom.t again -or the matching .ass9ord as con-irmation and i- match occursA it must lock the key9ord until a matching .ass9ord is entered again by the userA Note that the scri.t must be 9ritten to disregard 8;E#FA control( . No time limit need be im.lemented -or the lock duration. '. a. b. *. a. Create a scri.t -ile called -ile(.ro.erties that reads a -ile name entered and out.uts it .ro.erties. Write a shell scri.t that acce.t one or more -ilenames as argument and con&ert all o- them to u..ercaseA .ro&ided they exist in current directory. Write a shell scri.t that dis.lays all the links to a -ile s.eci-ied as the -irst argument to the scri.t. The second argumentA 9hich is o.tionalA can be used to s.eci-y in 9hich the search is to begin. "this second argument is not .resentA the search is to begin in current 9orking directory. "n either caseA the starting directory as 9ell as all its subdirectories at all le&els must be searched. The scri.t need not include any error checking. Write a shell scri.t that acce.ts as -ilename as argument and dis.lay its creation time i- -ile exist and i- it does not send out.ut error message.

b. 3. a.

Write a shell scri.t to dis.lay the calendar -or current month 9ith current date re.laced by V or VV de.ending on 9hether the date has one digit or t9o digits. b. Write a shell scri.t to -ind smallest o- three numbers that are read -rom keyboard. a. b. Write a shell scri.t using ex.r command to read in a string and dis.lay a suitable message i- it does not ha&e at least $% characters. Write a shell scri.t to com.ute the sum o- number .assed to it as argument on command line and dis.lay the result. Write a shell scri.t that com.ute gross salary o- an em.loyeeA accordingly to rule gi&en belo9. "- basic salary is U $*%%% then H;#Q$%T o- basic 5 #Q7%T o- basic. "- basic salary is WQ$*%%% then H;#Q*%% o- basic 2 #Q76T o- basic. Write a shell scri.t that delete all lines containing a s.eci-ic 9ord in one or more -ile su..lied as argument to it. Write a shell scri.t that gets executed dis.lays the message either X>ood !orningY or X>ood #-ternoonY or X>ood E&eningY de.ending u.on time at 9hich the user logs in. Write a shell scri.t that acce.t a list o- -ilenames as its argumentA count and re.ort occurrence oeach 9ord that is .resent in the -irst argument -ile on other argument -iles. Write a shell scri.t that determine the .eriod -or 9hich a s.eci-ied user is 9orking on system. Write a shell scri.t that re.orts the logging in o- a s.eci-ied user 9ithin one minute a-ter he/she log in. The scri.t automatically terminate i- s.eci-ied user does not log in during a s.eci-ied .eriod otime.

5.

6.

a.

b. 7. a. b. $%. a. b.

$$. a. Write a shell scri.t that acce.ts t9o integers as its argument and com.ute the &alue o- -irst number raised to the .o9er o- second number.

444
b. Write a shell scri.t that acce.t the -ile nameA starting and ending line number as an and dis.lay all the lines bet9een the gi&en line number. argument

$+. a. Write a shell scri.t that -olds long lines into '% columns. Thus any line that exceeds '% characters must be broken a-ter '%thA a XZY is to be a..ended as the indication o- -olding and the .rocessing is to be continued 9ith the residue. The in.ut is to be su..lied through a text -ile created by the user. b. Write an a9k scri.t that acce.ts date argument in the -orm o- mm(dd(yy and dis.lays it in the -orm i- dayA monthA and year. The scri.t should check the &alidity o- the argument and in the case o- errorA dis.lay a suitable message. $). a. Write an a9k scri.t to delete du.licated line -rom a text -ile. The order o- the original lines must remain unchanged. b. Write an a9k scri.t to -ind out total number o- books sold in each disci.line as 9ell as total book sold using associate array do9n table as gi&en belo9. i. Electrical )' ii. !echanical 35 iii. Electrical 6% i&. Com.uter Science ') &. !echanical 3* &i. Ci&il $76 &ii. Com.uter Science 3' $'. Write an a9k scri.t to com.ute gross salary o- an em.loyee accordingly to rule gi&en belo9. "- basic salary is U $%%%% then H;#Q$*T o- basic 2 #Q'*T o- basic. "- basic salary is WQ$%%%% then H;#Q+%T o- basic 2 #Q*%T o- basic. &ote2 n the e;amination each student pic7s one Cuestion from a lot of all the 1: Cuestions6

$ and .i3ital !lectronics (aboratory

Sub5ect Code2 10MCA1B %ours9Wee72 < $otal %ours2 :2 0A"$ - A !;ercises on 'ffice $ools 21 %ours 6A6 Mar7s2 80 !;am Mar7s2 80 !;am %ours2 <

&ote2 !;ercises on the follo=in3 topics to be conducted in the laboratory usin3 any of the 1ery =idely used current soft=are pac7a3es Word 0rocessin3 Pre.aration o- business lettersA .roject .ro.osalsA etc. Ex.erimenting 9ith all mani.ulation -acilities like bold -acingA "talici0ingA #lignment cut and .asteA s.ell checking including headers and -ootersA etc.A 1se o!ail(merge -acility. Computer 0resentation 4earning commandsA Pre.aration o- slidesA inserting textsA gra.hsA etc.A color changingA automatic .resentation o- slidesA changing time settingsA object linking and embeddingA etc .atabase Mana3ement System Creation o- atabase (TablesA -ieldsA keysA 8asic Bueries ( insertA deleteA u.dateA design o- data entry -orms 0A"$ - , !;ercises on .i3ital !lectronics $. +. ;eali0ation o- @(/; and @(N/; o.erations using basic gates. esign o- Hal- #dder and ,ull adder using +(in.ut N#N gates. 21 %ours

444
). '. *. ?eri-y addition o- t9o binary numbers using '(bit adder chi.. esign and im.lement Excess() to 8C code con&erter using '(bit adder chi.. Construct and "m.lement the 8oolean ex.ression using #N A/; and N/T gates C#:8D.CCJ: JD.C#J:CD Q [ 3. Construct and "m.lement the 8oolean ex.ression using only N#N gates #J8CJ J:#J8JCJ :#J8JC :#J8C J:#8JCJ :#8JC Q [ &ote2 Students are reCuired to e;ecute one Cuestion from 0art A and one from 0art ,

S!M!S$!" ,usiness .ata 0rocessin3 =ith C','( Sub5ect Code2 10MCA21 %ours9Wee72 : $otal %ours2 82 A Mar7s2 80 !;am Mar7s2 100 !;am %ours2 <

ntroduction < %ours Coding ,ormat -or C/8/4 ProgramsA Structure o- a C/8/4 ProgramA Character SetA C/8/4 9ordsA ata Names and "denti-iersA 4iteralA ,igurati&e ConstantsA Continuation o- lines and notations dentification+ !n1ironment and .ata .i1ision 8 %ours >eneral ,ormatsA Con-iguration SectionA "n.ut(/ut.ut SectionA 4e&el StructureA ata escri.tion entriesA Picture ClauseA ?alue ClauseA ,ile SectionA Working=storage SectionA Editing characters o- di--erent data and exam.lesA S.ecial=names Paragra.hA Classes and Categories o- ata 0rocedure .i1ision and ,asic Verbs > %ours Structure o- the Procedure i&isionA ata !o&ement ?erb and other o.tions o- !o&e StatementsA #rithmetic ?erbsA SeBuence Control ?erbsA "n.ut and /ut.ut ?erbsA Conditional ?erbE sim.le ",A categories o- C/8/4 statements. .ifferent $ypes of Clauses and other Verbs : %ours 1sage ClauseA Synchroni0ed ClauseA <usti-ied ClauseA ;ede-ines Clause and ;enames ClauseA Huali-ication o- ata NamesA Sign ClauseA Elementary and >rou. !o&esA Corres.onding /.tionE !o&e Corres.ondingA #dd Corres.onding and Subtract Corres.ondingA ;ounded /.tionA /n Si0e Error /.tionA Com.ute ?erb Computation and .ecision Ma7in3 B %ours "nteracti&e Processing using Screen SectionsA "ntrinsic ,unctionsA ConditionsE ;elational ConditionA Class ConditionA Condition Name ConditionA Negated Sim.le ConditionA Com.ound ConditionA Sign ConditionA "StatementsA #lter StatementA Per-orm StatementsA Exit Statement Array 0rocessin3 and $able %andlin3 > %ours /ccurs Clause and Subscri.tingA assigning &alues to table elementsA !ulti imensional TablesA Per-orm and Table HandlingA "ndexed Tables and "ndexingA Set ?erbA Search ?erbA /ccurs e.ending ClauseA "ndex data item SeCuential -ile 0rocessin3+ Sortin3 and Mer3in3 of -iles 10 %ours ,ile CharacteristicsA ,ile Control EntriesA ,ile escri.tionA Statements -or SeBuential ,ilesA SeBuential ,ile 9ith ?ariable 4ength ;ecordsA "(/ Control Paragra.hA Sim.le Sort ?erbA ,ile u.dationA ?ariation ou.dationA sim.le !erge ?erbA "n.ut and /ut.ut Procedure in Sort StatementA !erge ?erb 9ith /ut.ut Procedure nde;ed and "elati1e -ile 0rocessin3+ "eport Writer+ and Subroutines 10 %ours ,ile Control Paragra.h -or ;elati&e ,ilesA Procedure i&ision Statements -or ;elati&e ,ilesA "ndexed SeBuential ,ilesA >eneral ,ormat o- a ;e.ortA ,ile SectionA ;e.ort ClauseA /utline o- ;e.ort SectionA ;e.ort Section ( ;e.ort escri.tion EntryA ;e.ort >rou. escri.tionA Procedure i&ision StatementsA Sam.le ProgramA Structure o- a C/8/4 SubroutineA Calling o- a SubroutineA State o- Subroutine and Cancel StatementA #d&antages and isad&antages o- C/8/4 Subroutines $e;t ,oo7s2

444
$. ! F ;oy and >hosh astidarE C/8/4 Programming "ncluding !S C/8/4 and C/8/4(6*A +nd EditionA Tata !c>ra9 HillA +%%$. CCha.tersE ).$ to ).$%A'.$A '.+A *.$ to *.5A 3.$ to 3.5A 6.$ to 6.5A 7.$ to 7.*A $%.$ to $%.3A $$.$ to $$.$%A $).$ to $).'A $).3A $'.$ to $'.5A $3.$A $3.+A $6.$ to $6.5A $7.$ to $7.3D +. Nancy Stern and ;obert # SternE Structured C/8/4 ProgrammingA $$th EditionA Willey PublicationsA +%%3. CCha.tersE $A 3A and 5D "eference ,oo7s2 $. Shelly Cashman ,oremanE Structural C/8/4 ProgrammingA +nd EditionA Thomson Course Technology. +. a&id !. Collo.yE "ntroduction to C/8/4A # >uide to !odular Structured ProgrammingA Pearson EducationA +%%%.

'b5ect 'riented 0ro3rammin3 =ith CDD

Sub5ect Code2 10MCA21 %ours9Wee72 : $otal %ours2 82 A Mar7s2 80 !;am Mar7s2 100 !;am %ours2 <

ntroduction > %ours /&er&ie9 o- C::A Sam.le C:: .rogramA i--erent data ty.esA o.eratorsA ex.ressionsA and statementsA arrays and stringsA .ointers 2 user(de-ined ty.es ,unction Com.onentsA argument .assingA inline -unctionsA -unction o&erloadingA recursi&e -unctions Classes E 'b5ects 1: %ours Class S.eci-icationA Class /bjectsA Sco.e resolution o.eratorA #ccess membersA e-ining member -unctionsA ata hidingA ConstructorsA estructorsA Parameteri0ed constructorsA Static data membersA ,unctionsG ,riend -unctionsA Passing objects as argumentsA ;eturning objectsA #rrays o- objectsA ynamic objectsA Pointers to objectsA Co.y constructorsA >eneric -unctions and classesA #..lications /.erator o&erloading using -riend -unctions such as :A ( A .re(incrementA .ost(incrementA O P etc.A o&erloading UUA WW. nheritance 12 %ours 8ase ClassA "nheritance and .rotected membersA Protected base class inheritanceA "nheriting multi.le base classesG ConstructorsA estructors and "nheritanceA Passing .arameters to base class constructorsA >ranting accessA ?irtual base classes Virtual functions+ 0olymorphism ? %ours ?irtual -unctionA Calling a ?irtual -unction through a base class re-erenceA ?irtual attribute is inheritedA ?irtual -unctions are hierarchicalA Pure &irtual -unctionsA #bstract classesA 1sing &irtual -unctionsA Early and late binding. 9' System ,asics+ -ile 90 > %ours C:: stream classesA ,ormatted "//A "// mani.ulatorsA -stream and the ,ile classesA ,ile o.erations !;ception %andlin3+ S$( Exce.tion handling -undamentalsA Exce.tion handling o.tions ST4E #n o&er&ie9A containersA &ectorsA listsA ma.s. $e;t ,oo7s2 $. Herbert SchildtE The Com.lete ;e-erence C::A 'th EditionA Tata !c>ra9 HillA +%%). "eference ,oo7s2 $. Stanley 8.4i..mannA <osee 4ajoreE C:: PrimerA 'th EditionA #ddison WesleyA +%%*. +. Paul < eitelA Har&ey ! eitelE C:: -or ProgrammersA Pearson EducationA +%%7. ). F ; ?enugo.alA ;ajkumar 8uyyaA T ;a&i ShankarE !astering C::A Tata !c>ra9 HillA $777. ? %ours

.ata Structures usin3 C

444
Sub5ect Code2 10MCA2< %ours9Wee72 : $otal %ours2 82 6A Mar7s2 80 !;am Mar7s2 100 !;am %ours2 <

,AS C C'&C!0$S B %ours Pointers and ynamic !emory #llocationA #lgorithm S.eci-icationA ata #bstractionA Per-ormance #nalysisA Per-ormance !easurement A""A#S and S$"*C$*"!S > %ours #rraysA ynamically #llocated #rraysA Structures and 1nionsA PolynomialsA S.arse !atricesA ;e.resentation o- !ultidimensional #rrays S$ACFS A&. G*!*!S StacksA Stacks 1sing ynamic #rraysA HueuesA Circular Hueues 1sing Ex.ressionsA !ulti.le Stacks and Hueues. > %ours ynamic #rraysA E&aluation o-

( &F!. ( S$S > %ours Singly 4inked lists and ChainsA ;e.resenting Chains in CA 4inked Stacks and HueuesA PolynomialsA #dditional 4ist o.erationsA S.arse !atricesA oubly 4inked 4ists $"!!S+ )raphs 12 %ours "ntroductionA 8inary TreesA 8inary Tree Tra&ersalsA Threaded 8inary TreesA Hea.s. 8inary Search TreesA Selection TreesA ,orestsA ;e.resentation o- isjoint SetsA Counting 8inary TreesA The >ra.h #bstract ata Ty.e. 0" '" $# G*!*!S > %ours Single( and ouble(Ended Priority HueuesA 4e-tist TreesA 8inomial Hea.sA ,ibonacci Hea.sA Pairing Hea.s. !-- C !&$ , &A"# S!A"C% $"!!S /.timal 8inary Search TreesA #?4 TreesA ;ed(8lack TreesA S.lay Trees. B %ours

$e;t ,oo72 $. Horo9it0A SahniA #nderson(,reedE ,undamentals o- ata Structures in CA +nd EditionA 1ni&ersity PressA +%%5. CCha.ters $A +.$ to +.3A )A 'A *.$ to *.)A *.* to *.$$A 3.$A 7.$ to 7.*A $%D "eference ,oo7s2 $. ebasis SamantaE Classic ata StructuresA +nd EditionA PH"A +%%7. +. ;ichard ,. >ilberg and 8ehrou0 #. ,orou0anE ata Structures # Pseudocode #..roach 9ith CA ThomsonA +%%*. ). ;obert Fruse 2 8ruce 4eungE ata Structures 2 Program esign in CA Pearson EducationA +%%5.

Mana3ement nformation System

Sub5ect Code2 10MCA2: %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am Mar7s2 100 !;am %ours2 <

Systems !n3ineerin3 : %ours System conce.tsA system controlA ty.es o- systemsA handling system com.lexityA Classes o- systemsA >eneral model o- !"SA Need -or system analysisA System analysis -or existing system 2 ne9 reBuirementA system de&elo.ment modelA !"S 2 system analysis nformation and Fno=led3e : %ours

444
"n-ormation conce.tsA classi-ication o- in-ormationA methods o- data and in-ormation collectionA &alue oin-ormationA in-ormationE # Buality .roductA >eneral model o- a human as in-ormation .rocessorA Fno9ledge+ ntroduction of M S : %ours !"SE Conce.tA e-initionA ;ole o- the !"SA "m.act o- !"SA !"S and the userA !anagement as a control systemA !"S su..ort to the managementA !anagement e--ecti&eness and !"SA /rgani0ation as system. !"SE organi0ation e--ecti&eness Strate3ic Mana3ement of ,usiness < %ours Conce.t o- cor.orate .lanningA Essentiality o- strategic .lanningA e&elo.ment o- the business strategiesA Ty.e o- strategiesA short(range .lanningA tools o- .lanningA !"SE strategic business .lanning .e1elopment of M S : %ours e&elo.ment o- long range .lans o- the !"SA #scertaining the class o- in-ormationA etermining the in-ormation reBuirementA e&elo.ment and im.lementation o- the !"SA !anagement o- in-ormation Buality in the !"SA /rgani0ation -or de&elo.ment o- !"SA !"S de&elo.ment .rocess model .e1elopin3 ,usiness9 $ Strate3ies9 $ Solutions 8 %ours Planning -undamentals Creal 9orld casesDA /rgani0ational .lanningA .lanning -or com.etiti&e ad&antageA CSW/T #nalysisDA 8usiness models and .lanning. 8usiness/"T .lanningA identi-ying business/"T strategiesA "m.lementation ChallengesA Change management.A e&elo.ing business systemsA Creal 9orld caseDA S 4CA .rototy.ingA System de&elo.ment .rocessA im.lementing business system ,usiness 0rocess "e-!n3ineerin3 2 %ours "ntroductionA 8usiness .rocessA .rocess model o- the organi0ationA &alue stream model o- the organi0ationA 9hat delay the business .rocessA rele&ance o- in-ormation technologyA !"S and 8P; $echnolo3y of nformation System : %ours "ntroductionA ata .rocessingA Transaction .rocessingA #..lication .rocessingA in-ormation system .rocessingA TH! o- in-ormation systemsA Human -actors 2 user inter-aceA Strategic nature o- "T decisionA !"S choice o- in-ormation technology .ecision Ma7in3 and .SS < %ours ecision making conce.tsG decision making .rocessA decision(making by analytical modelingA 8eha&ioral conce.ts in decision makingA organi0ational decision(makingA ecision structureA SS com.onentsA !anagement re.orting alternati&es. .ata resource Mana3ement < %ours !anaging data sourcesA ,oundation conce.ts o- dataA ty.es o- databasesA traditional -ile .rocessingA 8!S a..roachA atabase structureA atabase de&elo.ment !lectronic ,usiness systems : %ours Enter.rise business system = "ntroductionA cross(-unctional enter.rise a..licationsA real 9orld caseA ,unctional business systemA ( "ntroductionA marketing systemsA sales -orce automationA C"!A H;!A online accounting systemA Customer relationshi. managementA E;PA Su..ly chain management Creal 9orld cases -or the abo&eD !nterprise ,usiness Systems Electronic commerce -undamentalsA e(Commerce a..lications and "ssuesA Creal 9orld casesD > %ours

Client Se1er Architecture and !-business $echnolo3y > %ours Client ser&er architectureA im.lementation strategiesA "ntroduction to E(businessA model o- E(businessA internet and World Wide WebA "ntranet/ExtranetA ElectronicA "m.act o- Web on Strategic managementA Web enabled business managementA !"S in Web en&ironment. $e;t ,oo7s2 $. Waman S <ha9adekarE !anagement "n-ormation SystemA )rd EditionA Tata !c>ra9 HillA . CCha.tersE $A )A *A 3A 5A6A$%A $$A $3.$ to $3.5A $3.$% to $3.$+A $6.5A $6.6A +%D +. <ames # /J8rien and >eorge ! !arakasE !anagement "n-ormation SystemA 5th EditionA Tata !c>ra9 HillA +%%3 CCha.tersE $A *A 5A 6A 7A $%A $$D

444
"eference ,oo7s2 $. ;al.h ! Stair and >eorge W ;eynoldsE Princi.les o- "n-ormation SystemsA 5th EditionA ThomsonA+%$% . +. Ste&en #lterE "n-ormation Systems ( The ,oundation o- E(8usinessA 'th EditionA Pearson EducationA +%%$ ). !ahadeo <ais9al and !onika !italE !anagement "n-ormation SystemA A /x-ord 1ni&ersity Press. '. E--y /0E !anagement "n-ormation SystemsA *th EditionA Thomson Course TechnologyA+%%3.

'perations "esearch
Sub5ect Code2 10MCA28 %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am Mar7s2 100 !;am %ours2 <

ntroduction and '1er1ie= of the '" Modelin3 Approach < %ours The origin o- /;A the nature o- /;A the im.act o- /;A de-ining the .roblem and gathering dataA ,ormulating a mathematical modelA deri&ing solutions -rom the modelA testing the modelA .re.aring to a..ly the modelA im.lementation . ntroduction to (inear 0ro3rammin3 > %ours ,ormulation o- linear .rogramming .roblem C4PPDA exam.lesA >ra.hical solutionA the 4P !odelA S.ecial cases o- >ra.hical methodA assum.tions o- 4inear Programming C4PDA additional exam.le Sol1in3 (00 - the Simple; Method 12 %ours The essence o- the sim.lex methodA setting u. the sim.lex methodA algebra o- the sim.lex methodA the sim.lex method in tabular -ormA s.ecial cases in the sim.lex methodA tie breaking in the sim.lex methodA ado.ting to other model -orms CT9o Phase methodA 8ig(! methodDA .ost o.timality analysis. $heory of the Simple; Method : %ours ,oundation o- the sim.lex methodA the re&ised sim.lex methodA a -undamental insight .uality $heory and Sensiti1ity Analysis A %ours The essence o- duality theoryA economic inter.retation o- dualityA .rimal dual relationshi.A ada.ting to other .rimal -ormsA the role o- duality in sensiti&e analysisA the dual sim.lex method $ransportation and Assi3nment 0roblems > %ours The trans.ortation .roblemA a stream line sim.lex method -or the trans.ortation .roblemA the assignment .roblemA a s.ecial algorithm -or the assignment .roblem Metaheuristics > %ours The nature o- !etaheuristicsA Tabu SearchA Simulated #nnealingA >enerating #lgorithms )ame $heory > %ours The -ormulation o- t9o .ersonsA 0ero sum gamesA sol&ing sim.le games( a .rototy.e exam.leA games 9ith mixed strategiesA gra.hical solution .rocedureA sol&ing by linear .rogrammingA extensions $e;t ,oo7s2 $. ,rederick S.Hillier 2 >erald <.4iebermanE "ntroduction to /.erations ;esearchA 6th EditionA Tata !c>ra9 HillA +%%3. CCha.ters $.$A $.+A $.)A +.$A +.+A +.)A +.'A +.*A +.3A ).+A ).)A ).'A '.$A '.+A '.)A '.'A '.*A '.3A '.5A *.$A *.+A *.)A 3.$A 3.+A 3.)A3.'A 3.*A 3.3A 3.5A 5.$A 6.$A 6.+A 6.)A 6.'A $).$A $).+A $).)A $).'A $'.$A $'.+A $'.)A $'.'A $'.*A $'.3D "eference ,oo7s2 $. Wayne 4. WinstonE /.erations ;esearch #..lications and #lgorithmsA 'th EditionA Thomson Course TechnologyA +%%). +. Hamdy # TahaE /.erations ;esearch ( #n "ntroductionA 6th EditionA Pearson EducationA +%%5. ). Theory and Problems o- /.erations ;esearchA ;ichard 8ronson and >o&indasami NaadimuthuA SchaumJs /utlineA Tata !c>ra9 HillA +nd EditionA $775.

444 C','( 0ro3rammin3 (ab

Sub5ect Code2 10MCA2> %ours9Wee72 < $otal %ours2 :2 $. 6A Mar7s2 80 !;am Mar7s2 80 !;am %ours2 <

Write a .rogram -or the -ollo9ingE a. E&aluate the -ollo9ing eBuation using C/!P1TE &erb. IQC# = 8D V C b. To ,ind the sum o- indi&idual digits in the gi&en \nJ digit decimal number. Write a .rogram -or the -ollo9ingE a. >enerating odd and e&en numbers bet9een the gi&en limits by using PE;,/;! statement. b. Sorting numeric numbers. Write a .rogram to search a record in the -ile 9ithout using SE#;CH &erb. 8y using table handling conce.tsA 9rite a .rogram -or a. Sorting al.hanumeric data. b. Searching a numeric number using SE#;CH &erb. 8y using table handling conce.tsA 9rite a .rogram -or matrix addition and matrix subtraction. 8y using table handling conce.tsA 9rite a .rogram -or matrix multi.lication. Write a .rogram -or the -ollo9ingE a. To sort records in the -ile using S/;T &erb. b. To merge -iles using !E;>E &erb. Write a .rogram to read em.loyee -ile as seBuential -ile and calculate >ross Pay and Net Pay -or em.loyees in the organi0ation. Write a .rogram to store studentJs details 9ith results in a -ile 9ith seBuential -ile handling techniBues.

+.

). '.

*. 3. 5.

6. 7.

$%. 1sing the index -ile organi0ationA 9rite a .rogram to store em.loyee details. $$. 1sing the index -ile organi0ationA 9rite a .rogram to u.date the em.loyee salary Cincrease # o- )TD. $+. Write a .rogram -or the -ollo9ingE a. To delete a record in the index -ile. b. To search a record in the index -ile. $). Write a .rogram to calculate Net Pay and >ross Pay by reading relati&e -ile containing -ields Em.]noA Em.]nameA 8asic] .ay. Store the out.ut in relati&e -ile. $'. Write a .rogram to -ind sim.le interest and com.ound interest using subroutine conce.t. $*. Write a .rogram to generate a sales re.ort. &ote2 n the e;amination each student pic7s one Cuestion from a lot of all the 18 Cuestions6

.ata Structures usin3 C (aboratory

Sub5ect Code2 10MCA2? %ours9Wee72 < $otal %ours2 :2 $. 6A Mar7s2 80 !;am Mar7s2 80 !;am %ours2 <

Write a C Program to construct a stack o- integers and to .er-orm the -ollo9ing o.erations on itE

444
a. Push b. Po. c. is.lay The .rogram should .rint a..ro.riate messages -or stack o&er-lo9A stack under-lo9A and stack em.ty. +. Write a C Program to con&ert and .rint a gi&en &alid .arenthesi0ed in-ix arithmetic ex.ression to .ost-ix ex.ression. The ex.ression consists o- single character o.erands and the binary o.erators : C.lusDA ( CminusDA V Cmulti.lyD and / Cdi&ideD. Write a C Program to e&aluate a &alid su--ix/.ost-ix ex.ression using stack. #ssume that the su--ix/.ost-ix ex.ression is read as a single line consisting o- non(negati&e single digit o.erands and binary arithmetic o.erators. The arithmetic o.erators are : CaddDA ( CsubtractDA V Cmulti.lyD and / Cdi&ideD. Write a C .rogram using recursi&e -unction -or the -ollo9ingE a. To calculate >C and 4C! o- + integer numbers. b. To sol&e To9ers o- Hanoi .roblem. c. To search an element in a list using binary search Write a C Program to simulate the 9orking o- a Bueue o- integers using an array. Pro&ide the -ollo9ing o.erationsE a. "nsert b. elete c. is.lay Write a C Program to simulate the 9orking o- a circular Bueue o- integers using an array. Pro&ide the -ollo9ing o.erationsE a. "nsert b. elete c. is.lay Write a .rogram to design a .riority Bueue 9hich is maintained as a set o- Bueues Cassume a maximum o- ) BueuesD. The elements are inserted based u.on the gi&en .riority. The deletion o- an element is to be done starting -rom the $st BueueA i- it is not em.ty. "- it is em.tyA the elements -rom the + nd Bueue 9ill be deleted and so on. Write a C Program using dynamic &ariables and .ointersA to construct a singly linked list consisting othe -ollo9ing in-ormation in each nodeE student id CintegerDA student name Ccharacter stringD and semester CintegerD. The o.erations to be su..orted areE a. The insertion o.eration i. #t the -ront o- a list ii. #t the back o- the list iii. #t any .osition in the list b. eleting a node based on student id. "- the s.eci-ied node is not .resent in the list an error message should be dis.layed. 8oth the o.tions should be demonstrated. c. Searching a node based on student id and u.date the in-ormation content. "- the s.eci-ied node is not .resent in the list an error message should be dis.layed. 8oth situations should be dis.layed. d. is.laying all the nodes in the list. Write a C Program using dynamic &ariables and .ointersA to construct an ordered CascendingD singly linked list based on the rank o- the studentA 9here each node consists o- the -ollo9ing in-ormation E student id CintegerDA student name Ccharacter stringD and rank CintegerD.

).

'.

*.

3.

5.

6.

7.

$%. Write a C Program using dynamic &ariables and .ointers to construct a stack o- integers using singly linked list and to .er-orm the -ollo9ing o.erationsE a. Push b. Po. c. is.lay The .rogram should .rint a..ro.riate messages -or stack o&er-lo9 and stack em.ty.

444
$$. Write a C Program to su..ort the -ollo9ing o.erations on a doubly linked list 9here each node consists o- integersE a. Create a doubly linked list by adding each node at the -ront. b. "nsert a ne9 node to the le-t o- the node 9hose key &alue is read as an in.ut. c. elete the node o- a gi&en dataA i- it is -oundA other9ise dis.lay a..ro.riate message. d. is.lay the contents o- the list. CNoteE /nly either CaA b and dD or CaA c and dD may be asked in the examinationD $+. Write a C Program a. To construct a binary search tree o- integers. b. To tra&erse the tree using all the methods i.e.A inorderA .reorder and .ostorder. c. To dis.lay the elements in the tree. $). Write a C Programs -or searching an element on a gi&en list o- integers using the a. 8inary Search. b. 4inear search $'. Write a C .rogram to sort a list o- N integers using the Buick sort algorithm. $*. Write a C .rogram to tra&erse the nodes in a gra.h using 8readth ,irst Search. &ote2 n the e;amination each student pic7s one Cuestion from a lot of all the 18 Cuestions6

'b5ect 'riented 0ro3rammin3 =ith CDD (aboratory

Sub5ect Code2 10MCA2? %ours9Wee72 < $otal %ours 2 :2 6A Mar7s2 80 !;am Mar7s2 80 !;am %ours2 <

$. >i&en that an E!P4/[EE class contains the -ollo9ing membersE a. ata !embersE Em.loyee]NumberA Em.loyee]NameA 8asicA #A "TA Net]Sal b. !ember ,unctionsE to read dataA to calculate Net]Sal and to .rint data members +. Write a C:: .rogram to read data on N em.loyees and com.ute the Net]Sal o- each C # Q *+T o- 8asic and "ncome Tax Q )%T o- the gross salaryD em.loyee

). e-ine a ST1 ENT class 9ith 1SNA NameA and !arks in ) tests o- a subject. eclare an array o$% ST1 ENT objects. 1sing a..ro.riate -unctionsA -ind the a&erage o- the t9o better marks -or each student. Print the 1SNA Name and the a&erage marks o- all the students. '. Write a C:: .rogram to create a class called C/!P4E@ and im.lement the -ollo9ing o&erloading -unctions # that return a com.lex numberE a. # CaA s+D = 9here \aJ is an integer Creal .artD and s+ is a com.lex number b. # Cs$A s+D = 9here s$ and s+ are com.lex numbers +. Write a C:: .rogram to create a class called 4"ST Clinked listD 9ith member -unctions to insert an element at the -ront as 9ell as to delete an element -rom the -ront o- the list. emonstrate all the -unctions a-ter creating a list object. ). Write a C:: .rogram to create a tem.late -unction -or Huicksort and demonstrate sorting ointegers and doubles. '. Write a C:: .rogram to create a class called ST#CF using an array o- integers. "m.lement the -ollo9ing o.erations by o&erloading the o.erators \:J and \(\E a. s$ Q s$ : elementG 9here s$ is an object o- the class ST#CF and element is an integer to be .ushed on the to. o- the stack b. s$ Q s$( G 9here s$ is an object o- the class ST#CF. \(\ o.erator .o.s the element. Handle the ST#CF em.ty and -ull conditions. #lso dis.lay the contents o- the stack a-ter each o.erationA by o&erloading the UU o.erator.

444
*. Write a C:: .rogram to create a class called #TE. #cce.t t9o &alid dates in the -orm dd/mm/yy. "m.lement the -ollo9ing o.erations by o&erloading the o.erators \:J and \(\. #-ter e&ery o.eration dis.lay the results by o&erloading the o.erator UU. a. no]o-]days Q d$ = d+G 9here d$ and d+ are #TE objectsA and no]o-]days is an integer b. d+ Q d$ : no]o-]daysG 9here d$ is a #TE object and no]o-]days is an integer 3. Create a class called !#T;"@ using t9o(dimensional array o- integers. "m.lement the -ollo9ing o.erations by o&erloading the o.erator :: 9hich checks the com.atibility o- t9o matrices to be added and subtracted. Per-orm the addition and subtraction by o&erloading the : and = o.erators res.ecti&ely. is.lay the results by o&erloading the o.erator UU. "- Cm$QQm+D then m) Q m$:m+ and m' Q m$(m+ else dis.lay error. 5. Write a C:: .rogram to create a class called /CT#4 9hich has the characteristics o- an octal number. "m.lement the -ollo9ing o.erations by 9riting an a..ro.riate constructor and an o&erloaded o.erator :. a. /CT#4 h Q xG 9here x is an integer. b. int y Q h : kG 9here h is an /CT#4 object and k is an integer is.lay the /CT#4 result by o&erloading the o.erator UU . #lso dis.lay the &alues o- h and y. 6. Write a C:: .rogram to create a class called H1E1E 9ith member -unctions to add an element and to delete an element -rom the Bueue. 1sing the member -unctionsA im.lement a Bueue o- integers and double. emonstrate the o.erations by dis.laying the contents o- the Bueue a-ter e&ery o.eration. 7. Write a C:: .rogram to create a class called 4"ST Cdoubly 4inked 4istD 9ith member -unctions to insert a node at a s.eci-ied .osition and delete a node -rom a s.eci-ied .osition o- the list. emonstrate the o.erations by dis.laying the content o- the list a-ter e&ery o.eration. $%. Write a C:: .rogram to create a class called ST1 ENT 9ith data members 1SNA Name and #ge. 1sing inheritanceA create the classes 1>ST1 ENT and P>ST1 ENT ha&ing -ields as SemesterA ,ees and Sti.end. Enter the data -or at least * students. ,ind the semester(9ise a&erage age -or all 1> and P> students se.arately. $$. Write a C:: .rogram to create a class called ST;"N> and im.lement the -ollo9ing o.erations. is.lay the results a-ter e&ery o.eration by o&erloading the o.erator UU. a. ST;"N> s$ Q X?T1Y b. ST;"N> s+ Q X8E4>#1!Y c. ST;"N> s) Q s$ : s+ C1se co.y constructorD $+. Write a C:: .rogram to create a class called 8"N]T;EE C8inary TreeD 9ith member -unctions to .er-orm in(orderA .reorder and .ost(order tra&ersals. Create a 8"N]T;EE object and demonstrate the tra&ersals. $). Write a C:: .rogram to create a class called E@P;ESS"/N. 1sing a..ro.riate member -unctions con&ert a gi&en &alid "n-ix ex.ression into .ost-ix -orm. is.lay the in-ix and .ost-ix ex.ressions. &ote2 n the e;amination each student pic7s one Cuestion from a lot of all the 1< Cuestions6 S!M!S$!" Systems Soft=are Sub5ect Code2 10MCA<1 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

Machine Architecture > %ours "ntroductionA System So-t9are and !achine #rchitectureA Sim.li-ied "nstructional Com.uter CS"CD ( S"C !achine #rchitectureA S"C/@E !achine #rchitectureA S"C Programming Exam.les. Assemblers 12 %ours

444
8asic #ssembler ,unction ( # Sim.le S"C #ssemblerA #ssembler #lgorithm and ata StructuresA !achine e.endent #ssembler ,eatures ( "nstruction ,ormats 2 #ddressing !odesA Program ;elocation. !achine "nde.endent #ssembler ,eatures = 4iteralsA Symbol( e-inition StatementsA Ex.ressionA Program 8locksA Control Sections and Programming 4inkingA #ssembler esign /.erations ( /ne(Pass #ssemblerA !ulti(Pass #ssemblerA "m.lementation Exam.les ( !#S! #ssembler. (oaders and (in7ers B %ours 8asic 4oader ,unctions ( esign o- an #bsolute 4oaderA # Sim.le 8ootstra. 4oaderA !achine( e.endent 4oader ,eatures = ;elocationA Program 4inkingA #lgorithm and ata Structures -or a 4inking 4oaderG !achine("nde.endent 4oader ,eatures ( #utomatic 4ibrary SearchA 4oader /.tionsA 4oader esign /.tions ( 4inkage EditorA ynamic 4inkageA 8ootstra. 4oadersA "m.lementation Exam.les ( !S( /S 4inker. !ditors And .ebu33in3 Systems > %ours Text Editors ( /&er&ie9 o- Editing ProcessA 1ser "nter-aceA Editor StructureA "nteracti&e ebugging Systems ( ebugging ,unctions and Ca.abilitiesA ;elationshi. With /ther Parts /- The SystemA 1ser("nter-ace Criteria Macro 0rocessor B %ours 8asic !acro Processor ,unctions ( !acro e-initions and Ex.ansionA !acro Processor #lgorithm and ata StructuresA !achine("nde.endent !acro Processor ,eatures ( Concatenation o- !acro ParametersA >eneration o- 1niBue 4abelsA Conditional !acro Ex.ansionA Fey9ord !acro ParametersA !acro Processor esign /.tions ( ;ecursi&e !acro Ex.ansionA >eneral(Pur.ose !acro ProcessorsA !acro Processing Within 4anguage TranslatorsA "m.lementation Exam.les ( !#S! !acro ProcessorA #NS" C !acro Processor. (e; and #acc 12 %ours 4ex and [acc ( The Sim.lest 4ex ProgramA ;ecogni0ing Words With 4E@A Symbol TablesA >rammarsA Parser(4exer CommunicationA The Parts o- S.eech 4exerA # [#CC ParserA The ;ules SectionA ;unning 4E@ and [#CCA 4E@ and Hand( Written 4exersA 1sing 4E@ ( ;egular Ex.ressionA Exam.les o- ;egular Ex.ressionsA # Word Counting ProgramA Parsing a Command 4ine. 1sing [#CC = >rammarsA ;ecursi&e ;ulesA Shi-t/;educe ParsingA What [#CC Cannot ParseA # [#CC Parser ( The e-inition SectionA The ;ules SectionA Symbol ?alues and #ctionsA The 4E@E;A Com.iling and ;unning a Sim.le ParserA #rithmetic Ex.ressions and #mbiguityA ?ariables and Ty.ed Tokens. $e;t ,oo7s2 $. 4eland.4.8eckE System So-t9areA )rd EditionA #ddison(WesleyA $775. CCha.ters $.$ to $.)A + Cexce.t +.*.+ and +.*.)DA ) Cexce.t ).*.+ and ).*.)DA ' Cexce.t '.'.)DD +. <ohn.;.4e&ineA Tony !ason and oug 8ro9nE 4ex and [accA /^;eillyA SP A $776. CCha.ters $A + CPage +('+DA ) CPage *$(3*DD "eference ,oo7s2 $. .!. hamdhereE System Programming and /.erating SystemsA +nd EditionA Tata !c>ra9 ( HillA $777. Computer &et=or7s Sub5ect Code2 10MCA<2 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

-oundation B %ours 8uilding a Net9orkG #..licationsG ;eBuirementsG Net9ork #rchitectureG "m.lementing Net9ork so-t9areG Per-ormance .irect (in7 &et=or7s 12 %ours Physically connecting hostsG Hard9are building blocksG EncodingG ,ramingG Error detectionG ;eliable transmissionG Ethernet C6%+.)DG ;ingG C6%+.*A , "A 6%+.$5DG Wireless C6%+.$*.$A 6%+.$$A 6%+.$3A Cell Phone TechnologiesD. 0ac7et S=itchin3 S9itching and -or9ardingG 8ridges and 4#N S9itches ? %ours

444
nternet=or7in3 Sim.le internet9orking C"PDG ;outingG >lobal "nternet !nd Hto-!nd 0rotocolsI "esource Allocation ssues Sim.le demulti.lexer C1 PDG ;eliable byte stream CTCPDG "ssues in resource allocation 12 %ours ? %ours

Applications > %ours #..lication(4ayer o&er&ie9G omain Name SystemG ;emote 4ogin .rotocolsG Electronic mailG ,ile trans-er and ,TPG World Wide Web and HTTPG /&er&ie9 o- ?o"P tele.honyG ?o"P signaling .rotocols. $e;t ,oo7s2 $. 4arry 4. Peterson and 8ruce S. a&idE Com.uter Net9orks = # Systems #..roachA ' th EditionA Else&ierA +%$%. CCha.ters $A +A ).$A ).+A '.$A '.+A '.)A *.$A *.+A 3.$D +. Nader ,. !irE Com.uter and Communication Net9orksA Pearson EducationA +%%5. CCha.ters 7.$ to 7.3A $6.$A $6.+D "eferences2 $. 8ehrou0 #. ,orou0anE ata Communications and Net9orkingA 'th EditionA Tata !c>ra9(HillA +%%3. +. William StallingsE ata and Com.uter CommunicationA 6th EditionA Pearson EducationA +%%5. ). #lberto 4eon(>arcia and "ndra WidjajaE Communication Net9orks (,undamental Conce.ts and Fey architecturesA +nd Edition Tata !c>ra9(HillA +%%'. 0ro3rammin3 =ith Ja1a Sub5ect Code2 10MCA<< %ours9Wee72 : $otal %ours2 82 A Mar7s2 80 !;am %ours2 0< !;am Mar7s2 100

An '1er1ie= of Ja1a : %ours /bject(/riented ProgrammingA # ,irst Sim.le ProgramA # Second Short ProgramA 1sing 8locks o- Code 4exical "ssuesA The <a&a Class 4ibraries. ata Ty.esA ?ariablesA and #rraysE <a&a "s a Strongly Ty.ed 4anguageA The Primiti&e Ty.esA # Closer 4ook at 4iteralsA ?ariablesA Ty.e Con&ersion and castingA #utomatic Ty.e .romotion in Ex.ressionA #rraysA # -e9 9ords about Strings. /.eratorsE #rithmetic /.eratorsA The 8it9ise /.eratorsA ;elational /.erators 8oolean 4ogical /.eratorsA The #ssignment /.eratorA The K /.eratorA /.erator PrecedenceA 1sing Parentheses. Control StatementsE <a&aJs SelectionA "teration StatementsA <um. Statements. ntroducin3 Classes2 ? %ours Class ,undamentalsA eclaring /bjectsA #ssigning /bject ;e-erence ?ariables "ntroducing !ethodsA ConstructorsA The this Fey9ordA >arbageA The -inali0eC D !ethod # Stack Class. # Closer 4ook at !ethods and ClassesE /&erloading !ethodsA /&erloading ConstructorsA 1sing /bjects as ParametersA # Closer 4ook at #rgument PassingA ;eturning /bjectsA ;ecursionA "ntroducing #ccess ControlA 1nderstanding staticA "ntroducing -inalA #rrays ;e&isitedA "ntroducing Nested and "nner ClassesA Ex.loring the String ClassA 1sing Command(4ine #rgumentsA ?arargs nheritance2 ? %ours "nheritance 8asicsA 1sing su.erA 1sing su.er Creating a !ultile&el HierarchyA When Constructors #re CalledA !ethod /&erridingA ynamic !ethod is.atchA 1sing #bstract ClassesA 1sing -inal 9ith "nheritanceA The /bject Class. Packages and "nter-acesE PackagesA #ccess ProtectionA #n #ccess Exam.le "m.orting PackagesA "nter-aces. Exce.tion HandlingE Exce.tion(Handling ,undamentalsA Exce.tion Ty.esA 1ncaught Exce.tions 1sing try and catchA !ulti.le catch ClausesA Nested try StatementsA thro9A thro9sA -inallyA <a&aJs 8uilt(in Exce.tionsA Creating [our /9n Exce.tion SubclassesA Chained Exce.tionsA 1sing Exce.tions. Multithreaded 0ro3rammin32 > %ours The <a&a Thread !odelA The !ain ThreadA Creating a ThreadA Creating !ulti.le ThreadsA 1sing is#li&eC D and joinC DA Thread PrioritiesA Synchroni0ationA "nterthread CommunicationA Sus.endingA ;esumingA and Sto..ing ThreadsA 1sing !ultithreading.

444
"n.ut//ut.utE Ex.loring ja&a.ioE The <a&a "// Classes and "nter-acesA ,ileA The Closable and ,lushable "nter-acesA The Stream ClassesA The 8yte StreamsA The Character StreamsA The Console ClassA 1sing Stream "//A Seriali0ationA Stream 8ene-its. !numeration+ Autobo;in32 > %ours EnumerationA Ty.e Wra..ersA #utoboxing. >enericsE What are >enericsKA # Sim.le >enerics Exam.leA # >enerics Class 9ith t9o Ty.e ParametersA The >eneral ,orm o- a >eneric Class. String HandlingE The String ConstructorsA String 4engthA S.ecial String /.erationsA Character ExtractionA String Com.arisonA Searching StringsA !odi-ying a StringA ata Con&ersion 1sing &alue/-C DA Changing the Case o- Characters Within a StringA #dditional String !ethodsA String8u--erA String 8uilder. !;plorin3 5a1a6lan32 ? %ours Primiti&e Ty.e Wra..ersA SystemA /bjectA ClassA Class 4oaderA !athA ThreadA Thread>rou.A ;unnableA Thro9able. The Collections ,rame9orkE Collections /&er&ie9A The Collection "nter-acesA The 4ist "nter-aceA The Hueue "nter-aceA The Collection ClassesA The #rray4ist ClassA The 4inked4ist ClassA The HashSetA The TreeSet Class. &et=or7in32 8 %ours Net9orking 8asicsA The Net9orking Classes and "nter-aces "net#ddressA TCP/"P Client SocketsA 1;4A 1;4ConnectionA HTTP 1;4 ConnectionA TCP/"P Ser&er SocketsA CookiesA "net'#ddress and "net3#ddressA The 1;" ClassA ;!". $he Applet Class2 ? %ours The #..let ClassA E&ent HandlingE T9o E&ent Handling !echanismsA The elegation E&ent !odelA E&ent ClassesA Sources o- E&entsA E&ent 4istener "nter-acesA 1sing the elegation E&ent !odelA #da.ter ClassesA "nner Classes. S9ingE "ntroducing S9ingA Ex.loring S9ing. $e;t ,oo7s2 $. Herbert SchildtE The Com.lete ;e-erence <#?#A 5th EditionA Tata !c>ra9 HillA +%%3. CCha.tersE +A )A 'A *A 3A 5A 6A 7A $%A $$A $+A $)A $'A $*A $5A $7A +%A +$A ++A +5A +7A )%D "eference ,oo7s2 $. <ames P CohoonA <ack W a&idson E Programming in <#?# *.%A Tata !c>ra9 HillA +%%5. +. Cay S HorstmannA >ary CornellE Core <a&a + ( ?olume $A 5th EditionA Pearson EducationA +%%*. ). Cay S HorstmannA >ary CornellE Core <a&a + ( ?olume +A 6th EditionA Pearson EducationA +%%6. '. [. aniel 4iangE "ntroduction to <#?# ProgrammingA 3th EditionA Pearson EducationA +%%5. .atabase Mana3ement Systems Sub5ect Code2 10MCA<: %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction ? %ours "ntroductionG #n exam.leG Characteristics o- atabase a..roachG #ctors on the screenG Workers behind the sceneG #d&antages o- using 8!S a..roachG # brie- history o- database a..licationsG 9hen not to use a 8!S. ata modelsA schemas and instancesG Three(schema architecture and data inde.endenceG atabase languages and inter-acesG The database system en&ironmentG Centrali0ed and client(ser&er architecturesG Classi-ication o- atabase !anagement systems. !ntity-"elationship Model ? %ours 1sing High(4e&el Conce.tual ata !odels -or atabase esignG #n Exam.le atabase #..licationG Entity Ty.esA Entity SetsA #ttributes and FeysG ;elationshi. ty.esA ;elationshi. SetsA ;oles and Structural ConstraintsG Weak Entity Ty.esG ;e-ining the E; esignG E; iagramsA Naming Con&entions and esign "ssuesG ;elationshi. ty.es o- degree higher than t9o. "elational Model and "elational Al3ebra B %ours ;elational !odel Conce.tsG ;elational !odel Constraints and ;elational atabase SchemasG 1.date /.erationsA Transactions and dealing 9ith constraint &iolationsG 1nary ;elational /.erationsE SE4ECT and P;/<ECTG ;elational #lgebra /.erations -rom Set TheoryG 8inary ;elational /.erations E </"N and

444
"?"S"/NG #dditional ;elational /.erationsG Exam.les o- Hueries in ;elational #lgebraG ;elational atabase esign 1sing E;( to(;elational !a..ing. SG( 1> %ours SH4 ata e-inition and ata Ty.esG S.eci-ying basic constraints in SH4G Schema change statements in SH4G 8asic Bueries in SH4G !ore com.lex SH4 Hueries. "nsertA elete and 1.date statements in SH4G S.eci-ying constraints as #ssertion and TriggerG ?ie9s C?irtual TablesD in SH4G #dditional -eatures o- SH4G atabase .rogramming issues and techniBuesG Embedded SH4A ynamic SH4G atabase stored .rocedures and SH4 / PS!. .atabase .esi3n B %ours "n-ormal esign >uidelines -or ;elation SchemasG ,unctional e.endenciesG Normal ,orms 8ased on Primary FeysG >eneral e-initions o- Second and Third Normal ,ormsG 8oyce(Codd Normal ,orm $ransaction Mana3ement > %ours The #C" Pro.ertiesG Transactions and SchedulesG Concurrent Execution o- TransactionsG 4ock( 8ased Concurrency ControlG Per-ormance o- lockingG Transaction su..ort in SH4G "ntroduction to crash reco&ery. $e;t ,oo7s2 $. Elmasri and Na&atheE ,undamentals o- atabase SystemsA * th EditionA Pearson EducationA +%%5. CCha.ters $A +A ) exce.t ).6A *A 3.$ to 3.*A 5.$A 6A 7.$A 7.+ exce.t SH4<A 7.'A $%D +. ;aghu ;amakrishnan and <ohannes >ehrkeE atabase !anagement SystemsA )rd EditionA !c>ra9(HillA +%%). CCha.ters $3A $5.$A $5.+A $6D "eference ,oo7s2 $. Silberschat0A Forth and SudharshanE ata base System Conce.tsA *th EditionA !c(>ra9HillA +%%3. +. C.<. ateA #. FannanA S. S9amynathamE # "ntroduction to atabase SystemsA 6 th EditionA Pearson educationA +%%3.

'peratin3 Systems
Sub5ect Code2 10MCA<8 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction to 'peratin3 Systems+ System structures > %ours What o.erating systems doG Com.uter System organi0ationG Com.uter System architectureG /.erating System structureG /.erating System o.erationsG Process managementG !emory managementG Storage managementG Protection and securityG istributed systemG S.ecial(.ur.ose systemsG Com.uting en&ironments./.erating System Ser&icesG 1ser ( /.erating System inter-aceG System callsG Ty.es o- system callsG System .rogramsG /.erating System design and im.lementationG /.erating System structureG ?irtual machinesG /.erating System generationG System boot. 0rocess Mana3ement ? %ours Process conce.tG Process schedulingG /.erations on .rocessesG "nter(.rocess communication. !ulti( Threaded ProgrammingE /&er&ie9G !ultithreading modelsG Thread 4ibrariesG Threading issues. Process SchedulingE 8asic conce.tsG Scheduling criteriaG Scheduling algorithmsG !ulti.le(Processor schedulingG Thread scheduling. 0rocess Synchroni@ation ? %ours Synchroni0ationE The Critical section .roblemG PetersonJs solutionG Synchroni0ation hard9areG Sema.horesG Classical .roblems o- synchroni0ationG !onitors. .eadloc7s > %ours eadlocksE System modelG eadlock characteri0ationG !ethods -or handling deadlocksG eadlock .re&entionG eadlock a&oidanceG eadlock detection and reco&ery -rom deadlock. Memory Mana3ement ? %ours

444
!emory !anagement StrategiesE 8ackgroundG S9a..ingG Contiguous memory allocationG PagingG Structure o- .age tableG Segmentation. ?irtual !emory !anagementE 8ackgroundG emand .agingG Co.y(on(9riteG Page re.lacementG #llocation o- -ramesG Thrashing. -ile System+ mplementation of -ile System ? %ours ,ile SystemE ,ile conce.tG #ccess methodsG irectory structureG ,ile system mountingG ,ile sharingG Protection. "m.lementing ,ile SystemE ,ile system structureG ,ile system im.lementationG irectory im.lementationG #llocation methodsG ,ree s.ace management Secondary Stora3e Structures+ 0rotection > %ours !ass storage structuresG isk structureG isk attachmentG isk schedulingG isk managementG S9a. s.ace management.ProtectionE >oals o- .rotectionA Princi.les o- .rotectionA omain o- .rotectionA #ccess matrixA "m.lementation o- access matrixA #ccess controlA ;e&ocation o- access rightsA Ca.ability(8ased systems. Case Study2 $he (inu; 'peratin3 System > %ours 4inux historyG esign .rinci.lesG Fernel modulesG Process managementG SchedulingG !emory managementG ,ile systemsA "n.ut and out.utG "nter(.rocess communication. $e;t ,oo7sE $. #braham Silberschat0A Peter 8aer >al&inA >reg >agneE /.erating System Princi.lesA 5th editionA Wiley "ndiaA +%%3. +. CCha.tersE $A +A ).$ to ).' A '.$ to '.'A *.$ to *.*A 3.$ to 3.5A 5A 6.$ to 6.3A 7.$ to 7.3A $%A $$.$ to $$.*A $+.$ to $+.3A $5.$ to $5.6A +$.$ to +$.7D "eference ,oo7s2 $. .! hamdhereE /.erating systems ( # conce.t based #..roachA +nd EditionA Tata !c>ra9( HillA +%%+. +. P.C.P. 8hattE /.erating SystemsA +nd EditionA PH"A +%%3. ). Har&ey ! eitalE /.erating systemsA )rd EditionA Pearson EducationA $77%.

Systems 0ro3rammin3 (aboratory

Sub5ect Code2 10MCA<> %ours9Wee7 2 0< $otal %ours 2 :2 0A"$- A !;ecute of the follo=in3 pro3rams usin3 (!/2 $. +. ). '. *. 3. 5. Program to count the number o- &o9els and consonants in a gi&en string. Program to count the number o- charactersA 9ordsA s.aces and lines in a gi&en in.ut -ile. Program to count number oa. Positi&e and negati&e integers b. Positi&e and negati&e -ractions Program to count the numbers o- comment lines in a gi&en C .rogram. #lso eliminate them and co.y that .rogram into se.arate -ile. Program to count the number o- \scan-J and \.rint-J statements in a C .rogram. ;e.lace them 9ith \read-J and \9rite-J statements res.ecti&ely. Program to recogni0e a &alid arithmetic ex.ression and identi-y the identi-iers and o.erators .resent. Print them se.arately. Program to recogni0e and count the number o- identi-iers in a gi&en in.ut -ile. 0A"$- , 6A6 Mar7s2 80 !;am %ours 2 0< !;am Mar7s 2 80

444
!;ecute of the follo=in3 pro3rams usin3 #ACC2 $. +. ). Program to test the &alidity o- a sim.le ex.ression in&ol&ing o.erators :A (A V and /. Program to recogni0e nested ", control statements and dis.lay the number o- le&els o- nesting. Program to recogni0e a &alid arithmetic ex.ression that uses o.erators :A (A V and /.

'. Program to recogni0e a &alid &ariableA 9hich starts 9ith a letterA -ollo9ed by any number o- letters or digits. *. 3. 5. Program to e&aluate an arithmetic ex.ression in&ol&ing o.erators :A (A V and /. Program to recogni0e strings \aaabJA \abbbJA \abJ and \aJ using the grammarE Can bn A nWQ%D Program to recogni0e the grammar Can bA nWQ$%D.

nstructions2 "n the examinationA a combination o- one 4E@ and one [#CC .roblem has to be asked based on lots. 8oth 9ill ha&e eBual 9eightages. Ja1a 0ro3rammin3 (aboratory Sub5ect Code2 10MCA<? %ours9Wee72 < $otal %ours2 :2 $. +. ). 6A Mar7s2 80 !;am Mar7s2 80 !;am %ours2 <

a. Write a <#?# Program to demonstrate Constructor /&erloading and !ethod o&erloading. b. Write a <#?# Program to im.lement "nner class and demonstrate its #ccess Protections. a. Write a <#?# Program to demonstrate "nheritance. b. Write a <#?# Program to demonstrate Exce.tion Handling C1sing Nested try catch and -inallyD. Write a <#?# .rogram 9hich has i. # Class called #ccount that creates account 9ith *%%;s minimum balanceA a de.ositCD method to de.osit amountA a 9ithdra9CD method to 9ithdra9 amount and also thro9s 4ess8alanceExce.tion i- an account holder tries to 9ithdra9 money 9hich makes the balance become less than *%%;s. ii. # Class called 4ess8alanceExce.tion 9hich returns the statement that says 9ithdra9 amount C]]];sD is not &alid. iii. # Class 9hich creates + accountsA both account de.osit money and one account tries to 9ithdra9 more money 9hich generates a 4ess8alanceExce.tion take a..ro.riate action -or the same. Write a <#?# .rogram using Synchroni0ed ThreadsA 9hich demonstrates Producer Consumer conce.t. Write a <#?# .rogram 9hich has i. # "nter-ace class -or Stack /.erations ii. # Class that im.lements the Stack "nter-ace and creates a -ixed length Stack. iii. # Class that im.lements the Stack "nter-ace and creates a ynamic length Stack. i&. # Class that uses both the abo&e Stacks through "nter-ace re-erence and does the Stack o.erations that demonstrates the runtime binding. Write a <#?# .rogram 9hich has i. + classes 9hich initiali0es a String in its constructor ii. # >eneric class 9ith + ty.e Parameters iii. Create a >eneric Class re-erence -or t he abo&e + Class and try to .rint the message inside the constructor C1se to string methodD.

'. *.

3.

444
5. 6. 7. Write <#?# .rograms 9hich demonstrates utilities o- 4inked4ist Class Write a <#?# Program 9hich uses ,ile"n.utStream / ,ile/utPutStream Classes. Write a <#?# Program 9hich 9rites a object to a -ile Cuse transient &ariable alsoD.

$%. Write a <#?# .rogram 9hich uses atagram Socket -or Client Ser&er Communication. $$. Write <#?# #..let .rograms 9hich handles !ouseE&ent $+. Write <#?# #..let .rograms 9hich handles Fey8oardE&ent $). Write a <#?# .rogram 9hich im.lements ;!". $'. Write a S9ing #..lication 9hich uses i. <Tabbed Pane ii. Each Tab should use <PanelA 9hich includes any one com.onent gi&en belo9 in each Panel iii. Combo8ox / 4ist / Tree / ;adiobutton &ote2 All the abo1e Components should (isten to any one of their respecti1e e1ents and print appropriate messa3e6 .,MS (aboratory Sub5ect Code2 10MCA<B %ours9Wee7 2 0< $otal %ours 2 :2 $. 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 80

Consider the -ollo9ing relationsE Student Csnum: integerA sname: stringA major: stringA level: stringA age: integerD Class Cname: stringA meets at: stringA room: stringA d: integerD Enrolled Csnum: integerA cname: stringD ,aculty C-idE integerA fname: stringA deptid: integerD The meaning o- these relations is straight-or9ardG -or exam.leA Enrolled has one record .er student(class .air such that the student is enrolled in the class. 4e&el is a t9o character code 9ith ' di--erent &alues Cexam.leE <uniorE <; etcD Write the -ollo9ing Bueries in SH4. No du.licates should be .rinted in any o- the ans9ers. i. ,ind the names o- all <uniors Cle&el Q <;D 9ho are enrolled in a class taught by Pro-. Harshith ii. ,ind the names o- all classes that either meet in room ;$+6 or ha&e -i&e or more Students enrolled. iii. ,ind the names o- all students 9ho are enrolled in t9o classes that meet at the same time. i&. ,ind the names o- -aculty members 9ho teach in e&ery room in 9hich some class is taught. &. ,ind the names o- -aculty members -or 9hom the combined enrollment o- the courses that they teach is less than -i&e. The -ollo9ing relations kee. track o- airline -light in-ormationE ,lights Cno: integerA from: stringA to: stringA distance: integerA Departs: timeA arrives: timeA price: realD #ircra-t Caid: integerA aname: stringA cruisingrange: integerD Certi-ied Ceid: integerA aid: integerD Em.loyees Ceid: integerA ename: stringA salary: integerD Note that the Em.loyees relation describes .ilots and other kinds o- em.loyees as 9ellG E&ery .ilot is certi-ied -or some aircra-tA and only .ilots are certi-ied to -ly. Write each o- the -ollo9ing Bueries in SH4.

+.

444
i. ii. iii. i&. &. &i. ). ,ind the names o- aircra-t such that all .ilots certi-ied to o.erate them ha&e salaries more than ;s.6%A %%%. ,or each .ilot 9ho is certi-ied -or more than three aircra-tsA -ind the eid and the maximum cruisingrange o- the aircra-t -or 9hich she or he is certi-ied. ,ind the names o- .ilots 9hose salary is less than the .rice o- the chea.est route -rom 8engaluru to ,rank-urt. ,or all aircra-t 9ith cruisingrange o&er $%%% FmsA .-ind the name o- the aircra-t and the a&erage salary o- all .ilots certi-ied -or this aircra-t. ,ind the names o- .ilots certi-ied -or some 8oeing aircra-t. ,ind the aids o- all aircra-t that can be used on routes -rom 8engaluru to Ne9 elhi.

Consider the -ollo9ing database o- student enrollment in courses 2 books ado.ted -or each course. ST1 ENT CregnoE stringA nameE stringA majorE stringA bdateEdateD C/1;SE Ccourse _EintA cnameEstringA de.tEstringD EN;/44 C regnoEstringA course_EintA semEintA marksEintD 8//F ] # /PT"/N Ccourse_ EintA semEintA book("S8NEintD TE@T Cbook("S8NEintA book(titleEstringA .ublisherEstringA authorEstringD i. Create the abo&e tables by .ro.erly s.eci-ying the .rimary keys and the -oreign keys. ii. Enter at least -i&e tu.les -or each relation. iii. emonstrate ho9 you add a ne9 text book to the database and make this book be ado.ted by some de.artment. i&. Produce a list o- text books Cinclude Course _A 8ook("S8NA 8ook(titleD in the al.habetical order -or courses o--ered by the \CSJ de.artment that use more than t9o books. &. 4ist any de.artment that has all its ado.ted books .ublished by a s.eci-ic .ublisher. &i. >enerate suitable re.orts. &ii. Create suitable -ront end -or Buerying and dis.laying the results. The -ollo9ing tables are maintained by a book dealer. #1TH/; Cauthor(idEintA nameEstringA cityEstringA countryEstringD P184"SHE; C.ublisher(idEintA nameEstringA cityEstringA countryEstringD C#T#4/> Cbook(idEintA titleEstringA author(idEintA .ublisher(idEintA category(idEintA yearEintA .riceEintD C#TE>/;[ Ccategory(idEintA descri.tionEstringD /; E;( ET#"4S Corder(noEintA book(idEintA BuantityEintD i. Create the abo&e tables by .ro.erly s.eci-ying the .rimary keys and the -oreign keys. ii. Enter at least -i&e tu.les -or each relation. iii. >i&e the details o- the authors 9ho ha&e + or more books in the catalog and the .rice othe books is greater than the a&erage .rice o- the books in the catalog and the year o.ublication is a-ter +%%%. i&. ,ind the author o- the book 9hich has maximum sales. &. emonstrate ho9 you increase the .rice o- books .ublished by a s.eci-ic .ublisher by $%T. &i. >enerate suitable re.orts. &ii. Create suitable -ront end -or Buerying and dis.laying the results. Consider the -ollo9ing database -or a banking enter.rise 8;#NCHCbranch(nameEstringA branch(cityEstringA assetsErealD #CC/1NTCaccnoEintA branch(nameEstringA balanceErealD EP/S"T/;Ccustomer(nameEstringA accnoEintD C1ST/!E;Ccustomer(nameEstringA customer(streetEstringA customer(cityEstringD 4/#NCloan(numberEintA branch(nameEstringA amountErealD 8/;;/WE;Ccustomer(nameEstringA loan(numberEintD i. Create the abo&e tables by .ro.erly s.eci-ying the .rimary keys and the -oreign keys ii. Enter at least -i&e tu.les -or each relation iii. ,ind all the customers 9ho ha&e at least t9o accounts at the Main branch. i&. ,ind all the customers 9ho ha&e an account at all the branches located in a s.eci-ic city. &. emonstrate ho9 you delete all account tu.les at e&ery branch located in a s.eci-ic city. &i. >enerate suitable re.orts. &ii. Create suitable -ront end -or Buerying and dis.laying the results. Instructions: $. The exercises are to be sol&ed in an ; 8!S en&ironment like /racle or 8+.

'.

*.

444
+. Suitable tu.les ha&e to be entered so that Bueries are executed correctly. ). ,ront end may be created using either ?8 or ?#< or any other similar tool. '. The student need not create the -ront end in the examination. The results o- the Bueries may be dis.layed directly. *. ;ele&ant Bueries other than the ones listed along 9ith the exercises may also be asked in the examination. 3. Huestions must be asked based on lots. V S!M!S$!" $opics in !nterprise Architecture Sub5ect Code2 10MCA:1 %ours9Wee72 : $otal %ours2 82 A Mar7s2 80 !;am Mar7s2 100 !;am %ours2 <

J.,C 'b5ect 8 %ours The Conce.t o- < 8CA < 8C ri&er Ty.esA < 8C PackagesA # 8rie- /&er&ie9 o- < 8C ProcessA atabase ConnectionA #ssociating the < 8C// 8C 8ridge 9ith the atabaseA Statement /bjectsA ;esultSetA Transaction ProcessingA !etadataA ata Ty.esA Exce.tions. J.,C and !mbedded SG( 8 %ours !odel ProgramsA TablesA "ndexingA "nserting ata into TablesA Selecting ata -rom a TableA !etadataA 1.dating TablesA eleting ata -rom a TableA <oining TablesA Calculating ataA >rou.ing and /rdering ataA SubBueriesA ?"EW. Ser1lets > %ours "ntroductionA #d&antages o- Ser&lets o&er C>"A "nstalling Ser&letsA The Ser&lets 4i-e CycleA Ser&let #P"A Handling HTTP >ET ;eBuestA Handling HTTP P/ST ;eBuestA Ser&let Context. Ser1lets - Sessions CookiesA Session TrackingA ,ilter #P"A !ulti(tier #..lications 1sing atabase Connecti&ity 8 %ours

Ja1a Ser1er 0a3es (JS0) B %ours "ntroductionA #d&antages o- <SPA e&elo.ing ,irst <SPA <SP Scri.ting Elements( C irecti&esA eclarati&esA Scri.letsA Ex.ressionsA "m.licit ?ariablesDA Page irecti&esA <ST4A Standard #ctionA Custom Tags. Ja1a ,eans ? %ours What is a <a&a 8eanK #d&antages o- <a&a 8eansA The <a&a 8eans #P" = "ntros.ectorA .ro.erty escri.torA E&ent escri.torA !ethod escri.torA # 8ean Exam.leA <SP 9ith <a&a 8eans !nterprise Ja1a ,eans B %ours e.loyment escri.torsG Session <a&a 8eanA Entity <a&a 8eanG !essage( ri&en 8eanG The <#; ,ile. J2M! B %ours

$e;t ,oo7s2 $. Web TechnologiesE HtmlA <a&ascri.tA Ph.A <a&aA <s.A #SP. NetA @ml and #jaxA 8lack 8ook by Fogent 4earning Solutions "nc.A +%%7. CCha.tersE 7A $%A $$A $+A $) C1N"T $(3DD +. htt.E//ja&a.sun.com/j+ee/tutorial/$])(-cs/doc/E<8Conce.ts.htmlA htt.E//999.roseindia.net/ejb/A htt.E//999.roseindia.net/strutstutorial/introduction.shtml C1N"T 5 2 6D "eference ,oo7s2 $. <im FeoghE The com.lete ;e-erence <+EE C<+EE$.'DA Tata !c>ra9 HillA +%%+. +. <ames !c>o&ernA ;ahim #datiaA [ako& ,ainA <ason >ordonA Ethan HenryA Walter HurstA #shish <ainA !ark 4ittleA ?aidyanathan NagarajanA Harshad /akA 4ee #nne Philli.sE <a&a + Enter.rise Edition $.' C<+EE $.'D 8ibleA WileyA +%%). ). 8ondA 4a9A 4ongsha9A Hay9oodA ;oxburghE Teach [oursel- <+EE C<+EE $.'DA +nd EditionA Pearson EducationA +%%'.

444
Soft=are !n3ineerin3 Sub5ect Code2 10MCA:2 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

'1er1ie= > %ours "ntroductionE ,#H^s about so-t9are engineeringA Pro-essional and ethical res.onsibility. Socio(Technical systemsE Emergent system .ro.ertiesG Systems engineeringG /rgani0ationsA .eo.le and com.uter systemsG 4egacy systems. Soft=are 0rocesses : %ours So-t9are ProcessesE !odelsA Process iterationA Process acti&itiesG The ;ational 1ni-ied ProcessG Com.uter #ided So-t9are Engineering. "eCuirements B %ours So-t9are ;eBuirementsE ,unctional and Non(-unctional reBuirementsG 1ser reBuirementsG System reBuirementsG "nter-ace s.eci-icationG The so-t9are reBuirements document. ;eBuirements Engineering ProcessesE ,easibility studiesG ;eBuirements elicitation and analysisG ;eBuirements &alidationG ;eBuirements management. System models+ 0ro5ect Mana3ement B %ours System !odelsE Context modelsG 8eha&ioral modelsG ata modelsG /bject modelsG Structured methods. Project !anagementE !anagement acti&itiesG Project .lanningG Project schedulingG ;isk management Soft=are .esi3n ? %ours #rchitectural esignE #rchitectural design decisionsG System organi0ationG !odular decom.osition stylesG Control styles. /bject(/riented designE /bjects and /bject ClassesG #n /bject(/riented design .rocessG esign e&olution. .e1elopment > %ours ;a.id So-t9are e&elo.mentE #gile methodsG Extreme .rogrammingG ;a.id a..lication de&elo.ment. So-t9are E&olutionE Program e&olution dynamicsG So-t9are maintenanceG E&olution .rocessesG 4egacy system e&olution. Verification and Validation ? %ours ?eri-ication and ?alidationE PlanningG So-t9are ins.ectionsG #utomated static analysisG ?eri-ication and -ormal methods. So-t9are testingE System testingG Com.onent testingG Test case designG Test automation. Mana3ement > %ours !anaging Peo.leE Selecting sta--G !oti&ating .eo.leG !anaging .eo.leG The Peo.le Ca.ability !aturity !odel. So-t9are Cost EstimationE Producti&ityG Estimation techniBuesG #lgorithmic cost modelingA Project duration and sta--ing. $e;t ,oo7s2 $. "an Sommer&illeE So-t9are EngineeringA 6th EditionA Pearson EducationA +%%5. CCha.ters(E $A +A )A 'A *A 3A 5A 6A $$A $'A $5A +$A ++A +)A +*A +3D "eference ,oo7s2 $. ;oger.S.PressmanE So-t9are Engineering(# Practitioners a..roachA 5th EditionA !c>ra9 HillA +%%5. +. Pankaj <aloteE #n "ntegrated #..roach to So-t9are EngineeringA )rd EditionA Narosa Publishing HouseA +%%*. Web 0ro3rammin3

444
Sub5ect Code2 10MCA:< %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

-undamentals of Web+ /%$M(+ CSS 1< %ours "nternetA WWWA Web 8ro9sers and Web Ser&ersA 1;4sA !"!EA HTTPA SecurityA The Web Programmers Toolbox. @HT!4E 8asic syntaxA Standard structureA 8asic text marku.A "magesA Hy.ertext 4inks. 4istsA TablesA ,ormsA ,rames. CSSE "ntroductionA 4e&els o- style sheetsA Style s.eci-ication -ormatsA Selector -ormsA Pro.erty &alue -ormsA ,ont .ro.ertiesA 4ist .ro.ertiesA ColorA #lignment o- textA The box modelA 8ackground imagesA The Us.anW and Udi&W tagsA Con-lict resolution. Ja1ascript > %ours /&er&ie9 o- <a&ascri.tA /bject orientation and <a&ascri.tA Syntactic characteristicsA Primiti&esA o.erationsA and ex.ressionsA Screen out.ut and keyboard in.utA Control statementsA /bject creation and modi-icationA #rraysA ,unctionsA ConstructorsA Pattern matching using regular ex.ressionsA Errors in scri.tsA Exam.les. Ja1ascript and %$M( .ocuments+ .ynamic .ocuments =ith Ja1ascript ? %ours The <a&ascri.t execution en&ironmentA The ocument /bject !odelA Element access in <a&ascri.tA E&ents and e&ent handlingA Handling e&ents -rom the 8ody elementsA 8utton elementsA Text box and Pass9ord elementsA The /! + e&ent modelA The na&igator objectA /! tree tra&ersal and modi-ication. "ntroduction to dynamic documentsA Positioning elementsA !o&ing elementsA Element &isibilityA Changing colors and -ontsA ynamic contentA Stacking elementsA 4ocating the mouse cursorA ;eacting to a mouse clickA Slo9 mo&ement o- elementsA ragging and dro..ing elements. /M( > %ours "ntroductionA SyntaxA ocument structureA ocument ty.e de-initionsA Names.acesA @!4 schemasA is.laying ra9 @!4 documentsA is.laying @!4 documents 9ith CSSA @S4T style sheetsA @!4 .rocessorsA Web ser&ices. 0erl+ C) 0ro3rammin3 ? %ours /rigins and uses o- PerlA Scalars and their o.erationsA #ssignment statements and sim.le in.ut and out.utA Control statementsA ,undamentals o- arraysA HashesA ;e-erencesA ,unctionsA Pattern matchingA ,ile in.ut and out.utG Exam.les. The Common >ate9ay "nter-aceG C>" linkageG Huery string -ormatG C>"..m moduleG # sur&ey exam.leG Cookies. atabase access 9ith Perl and !ySH4 0%0 > %ours /rigins and uses o- PHPA /&er&ie9 o- PHPA >eneral syntactic characteristicsA Primiti&esA o.erations and ex.ressionsA /ut.utA Control statementsA #rraysA ,unctionsA Pattern matchingA ,orm handlingA ,ilesA CookiesA Session trackingA atabase access 9ith PHP and !ySH4. "uby+ "ails ? %ours /rigins and uses o- ;ubyA Scalar ty.es and their o.erationsA Sim.le in.ut and out.utA Control statementsA #rraysA HashesA !ethodsA ClassesA Code blocks and iteratorsA Pattern matching. /&er&ie9 o- ;ailsA ocument reBuestsA Processing -ormsA ;ails a..lications 9ith atabasesA 4ayouts. $e;t ,oo7s2 $. ;obert W. SebestaE Programming the World Wide WebA 'th EditionA Pearson educationA +%%6. C4isted to.ics only -rom Cha.ters $ to 7A $$ to $*D "eference ,oo7s2 $. !. eitelA P.<. eitelA #. 8. >oldbergE "nternet 2 World Wide Web Ho9 to ProgramA ) rd EditionA Pearson educationA +%%'. +. Chris 8atesE Web Programming 8uilding "nternet #..licationsA )rd EditionA Wiley "ndiaA +%%3. ). @ue 8ai et alE The 9eb Warrior >uide to Web ProgrammingA ThomsonA +%%). .esi3n and Analysis of Al3orithms

444
Sub5ect Code2 10MCA:: %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction ? %ours Notion o- #lgorithmA ;e&ie9 o- #sym.totic NotationsA !athematical #nalysis o- Non(;ecursi&e and ;ecursi&e #lgorithms 8rute ,orce #..roachesE "ntroductionA Selection Sort and 8ubble SortA SeBuential Search and 8rute ,orce String !atching. .i1ide and ConCuer i&ide and ConBuerE >eneral !ethodA its .er-ormance. > %ours e-ecti&e Chess 8oardA 8inary SearchA !erge SortA Huick Sort and

$he )reedy Method ? %ours The >eneral !ethodA Fna.sack ProblemA <ob SeBuencing 9ith eadlinesA !inimum(Cost S.anning TreesE PrimJs #lgorithmA FruskalJs #lgorithmG Single Source Shortest Paths. .ynamic 0ro3rammin3 > %ours The >eneral !ethodA WarshallJs #lgorithmA ,loydJs #lgorithm -or the #ll(Pairs Shortest Paths ProblemA Single(Source Shortest PathsE >eneral WeightsA %/$ Fna.sackA The Tra&eling Sales.erson .roblem. .ecrease-and-ConCuer Approaches+ Space-$ime $radeoffs ? %ours ecrease(and(ConBuer #..roachesE "ntroductionA "nsertion SortA e.th ,irst Search and 8readth ,irst SearchA To.ological SortingA S.ace(Time Tradeo--sE "ntroductionA Sorting by CountingA "n.ut Enhancement in String !atching. (imitations of Al3orithmic 0o=er and Copin3 =ith them ? %ours 4o9er(8ound #rgumentsA ecision TreesA PA NPA and NP(Com.lete ProblemsA Challenges o- Numerical #lgorithms. Copin3 =ith (imitations of Al3orithmic 0o=er > %ours 8acktrackingE n ( Hueens .roblemA Hamiltonian Circuit ProblemA Subset = Sum Problem. 8ranch(and(8oundE #ssignment ProblemA Fna.sack ProblemA Tra&eling Sales.erson Problem. #..roximation #lgorithms -or NP(Hard Problems = Tra&eling Sales.erson ProblemA Fna.sack Problem 0"AM Al3orithms > %ours "ntroductionA Com.utational !odelA Parallel #lgorithms -or Pre-ix Com.utationA 4ist ;ankingA and >ra.h Problems $e;t ,oo7s2 $. #nany 4e&itinE "ntroduction to The esign 2 #nalysis o- #lgorithmsA +nd EditionA Pearson EducationA +%%5. C4isted to.ics only -rom the Cha.ters $A +A )A *A 5A 6A $%A $$D +. Ellis Horo9it0A Sartaj SahniA Sanguthe&ar ;ajasekaranE ,undamentals o- Com.uter #lgorithmsA +nd EditionA 1ni&ersity .ressA +%%5. C4isted to.ics only -rom the Cha.ters )A 'A *A $)D "eference ,oo7s2 $. "ntroduction to #lgorithmsA Thomas H. CormenA Charles E. 4eisersonA ;onal 4. ;i&estA Cli--ord SteinA +nd EditionA PH"A +%%3. +. "ntroduction to the esign and #nalysis o- #lgorithms # Strategic #..roachA ;.C.T. 4eeA S.S. TsengA ;.C. Chang 2 [.T.TsaiA Tata !c>ra9 HillA +%%*. Computer )raphics and Visuali@ation Sub5ect Code2 10MCA:81 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 08 !;am %ours2 0< !;am Mar7s2 100

444
ntroduction ? %ours #..lications o- com.uter gra.hicsG # gra.hics systemG "magesE Physical and syntheticG "maging SystemsG The synthetic camera modelG The .rogrammerJs inter-aceG >ra.hics architecturesG Programmable Pi.elinesG Per-ormance Characteristics >ra.hics ProgrammingE The Sier.inski gasketG Programming T9o imensional #..lications. $he 'pen)( > %ours The /.en>4 #P"G Primiti&es and attributesG ColorG ?ie9ingG Control -unctionsG The >asket .rogramG Polygons and recursionG The three(dimensional gasketG Plotting "m.licit ,unctions nput and nteraction ? %ours "nteractionG "n.ut de&icesG Clients and Ser&ersG is.lay 4istsG is.lay 4ists and !odelingG Programming E&ent ri&en "n.utG !enusG PickingG # sim.le C# .rogramG 8uilding "nteracti&e !odelsG #nimating "nteracti&e ProgramsG esign o- "nteracti&e ProgramsG 4ogic /.erations )eometric 'b5ects and $ransformations 11 %ours ScalarsA PointsA and ?ectorsG Three(dimensional Primiti&esG Coordinate Systems and ,ramesG !odeling a Colored CubeG #--ine Trans-ormationsG ;otationA Translation and ScalingG >eometric /bjects and Trans-ormationsG Trans-ormation in Homogeneous CoordinatesG Concatenation oTrans-ormationsG /.en>4 Trans-ormation !atricesG "nter-aces to three(dimensional a..licationsG Huaternions Vie=in3 ? %ours Classical and com.uter &ie9ingG ?ie9ing 9ith a Com.uterG Positioning o- the cameraG Sim.le .rojectionsG Projections in /.en>4G Hidden(sur-ace remo&alG "nteracti&e !esh is.laysG Parallel(.rojection matricesG Pers.ecti&e(.rojection matricesG Projections and Shado9s. (i3htin3 and Shadin3 > %ours 4ight and !atterG 4ight SourcesG The Phong 4ighting modelG Com.utation o- &ectorsG Polygonal ShadingG #..roximation o- a s.here by recursi&e subdi&isionsG 4ight sources in /.en>4G S.eci-ication o- materials in /.en>4G Shading o- the s.here modelG >lobal "llumination. mplementation B %ours 8asic "m.lementation StrategiesG ,our major tasksG Cli..ingG 4ine(segment cli..ingG Polygon cli..ingG Cli..ing o- other .rimiti&esG Cli..ing in three dimensionsG ;asteri0ationG 8resenhamJs algorithmG Polygon ;asteri0ationG Hidden(sur-ace remo&alG #ntialiasingG is.lay considerations. $e;t ,oo7s2 $. Ed9ard #ngelE "nteracti&e Com.uter >ra.hics # To.( o9n #..roach 9ith /.en>4A *th EditionA Pearson EducationA +%%6. CCha.ters $ to 5D "eference ,oo7s2 $. onald Hearn and Pauline 8akerE Com.uter >ra.hics( /.en>4 ?ersionA )rd EditionA Pearson EducationA +%%'. +. ,.S. Hill <r.E Com.uter >ra.hics 1sing /.en>4A +nd EditionA Pearson educationA +%%$. ). <ames ,oleyA #ndries ?an amA Ste&en F ,einerA <ohn , HughesA Com.uter >ra.hicsA #ddison( Wesley $775. *& / Systems 0ro3rammin3 Sub5ect Code2 10MCA:82 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction > %ours 1N"@ and #NS" StandardsE The #NS" C StandardA The #NS"/"S/ C:: StandardsA i--erence bet9een #NS" C and C::A The P/S"@ StandardsA The P/S"@.$ ,"PS StandardA The @//.en Standards. 1N"@ and P/S"@ #P"sE The P/S"@ #P"sA The 1N"@ and P/S"@ e&elo.ment En&ironmentA #P" Common Characteristics.

444
*& / -iles > %ours ,ile Ty.esA The 1N"@ and P/S"@ ,ile SystemA The 1N"@ and P/S"@ ,ile #ttributesA "nodes in 1N"@ System ?A #..lication Program "nter-ace to ,ilesA 1N"@ Fernel Su..ort -or ,ilesA ;elationshi. o- C Stream Pointers and ,ile escri.torsA irectory ,ilesA Hard and Symbolic 4inks. *& / -ile A0 s ? %ours >eneral ,ile #P"sA ,ile and ;ecord 4ockingA irectory ,ile #P"sA e&ice ,ile #P"sA ,",/ ,ile #P"sA Symbolic 4ink ,ile #P"sA >eneral ,ile ClassA reg-ile Class -or ;egular ,ilesA dir-ile Class -or irectory ,ilesA ,",/ ,ile ClassA e&ice ,ile ClassA Symbolic 4ink ,ile ClassA ,ile 4isting Program. *& / 0rocesses ? %ours The En&ironment o- a 1N"@ ProcessE "ntroductionA main -unctionA Process TerminationA Command(4ine #rgumentsA En&ironment 4istA !emory 4ayout o- a C ProgramA Shared 4ibrariesA !emory #llocationA En&ironment ?ariablesA setjm. and longjm. ,unctionsA getrlimitA setrlimit ,unctionsA 1N"@ Fernel Su..ort -or Processes. 0rocess Control ? %ours "ntroductionA Process "denti-iersA -orkA &-orkA exitA 9aitA 9ait.idA 9aitedA 9ait)A 9ait' ,unctionsA ;ace ConditionsA exec ,unctionsA Changing 1ser " s and >rou. " sA "nter.reter ,ilesA system ,unctionA Process #ccountingA 1ser "denti-icationA Process Times. Process ;elationshi.sE "ntroductionA Terminal 4oginsA Net9ork 4oginsA Process >rou.sA SessionsA Controlling TerminalA tcget.gr.A tcset.gr.A and tcgetsid ,unctionsA <ob ControlA Shell Execution oProgramsA /r.haned Process >rou.s. Si3nals and .aemon 0rocesses ? %ours SignalsE The 1N"@ Fernel Su..ort -or SignalsA signalA Signal !askA sigactionA The S">CH4 Signal and the 9ait.id ,unctionA The sigsetjm. and siglongjm. ,unctionsA FillA #larmA "nter&al TimersA P/S"@.lb Timers. aemon ProcessesE "ntroductionA aemon CharacteristicsA Coding ;ulesA Error 4oggingA Single(instance daemonsG aemon con&entionsG Client(Ser&er !odel. nterprocess Communication > %ours "ntroductionG Pi.esA .o.enA .close ,unctionsG Co.rocessesG ,",/sG @S" "PCG !essage HueuesG Sema.hores &et=or7 0C2 Soc7ets > %ours "ntroductionG Socket escri.torsG #ddressingG Connection establishmentG ata trans-erG Socket o.tionsG /ut( o-(band dataG Nonblocking and asynchronous "//. $e;t ,oo7s2 $. Terrence ChanE 1nix System Programming 1sing C::A Prentice(Hall o- "ndia / Pearson EducationA $777. CCha.ters $A *A 3A 5A 6A 7D +. W.;ichard Ste&ensA Ste.hen #. ;agoE #d&anced Programming in the 1N"@ En&ironmentA + nd EditionA Pearson Education / Prentice(Hall o- "ndiaA +%%*. CCha.ters 5A 6A 7A $)A $*A $3D "eference ,oo7s2 $. !arc <. ;ochkindE #d&anced 1N"@ ProgrammingA +nd EditionA Pearson EducationA +%%*. +. !aurice.<.8achE The esign o- the 1N"@ /.erating SystemA Pearson EducationA $765. ). 1resh ?ahaliaE 1N"@ "nternalsA Pearson EducationA +%%$. Multimedia Systems Sub5ect Code2 10MCA:8< %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction+ Media and .ata Streams+ Audio $echnolo3y ? %ours !ultimedia ElementsG !ultimedia #..licationsG !ultimedia Systems #rchitectureG E&ol&ing Technologies -or !ultimedia SystemsG e-ining /bjects -or !ultimedia SystemsG !ultimedia ata "nter-ace StandardsG The need -or ata Com.ressionG !ultimedia atabases.

444
!ediaE Perce.tion !ediaA ;e.resentation !ediaA Presentation !ediaA Storage !ediaA Transmission !ediaA "n-ormation Exchange !ediaA Presentation S.aces 2 ?aluesA and Presentation imensionsG Fey Pro.erties o- a !ultimedia SystemE iscrete 2 Continuous !ediaA "nde.endence !ediaA Com.uter Controlled SystemsA "ntegrationG Characteri0ing ata StreamsE #synchronous Transmission !odeA Synchronous Transmission !odeA "sochronous Transmission !odeG Characteri0ing Continuous !edia ata Streams. SoundE ,reBuencyA #m.litudeA Sound Perce.tion and PsychoacousticsG #udio ;e.resentation on Com.utersG Three imensional Sound ProjectionG !usic and !" " StandardsG S.eech SignalsG S.eech /ut.utG S.eech "n.utG S.eech Transmission. )raphics and ma3es+ Video $echnolo3y+ Computer-,ased Animation ? %ours Ca.turing >ra.hics and "mages Com.uter #ssisted >ra.hics and "mage ProcessingG ;econstructing "magesG >ra.hics and "mage /ut.ut /.tions. 8asicsG Tele&ision SystemsG igitali0ation o- ?ideo SignalsG igital Tele&isionG 8asic Conce.tsG S.eci-ication o- #nimationsG !ethods o- Controlling #nimationG is.lay o- #nimationG Transmission o#nimationG ?irtual ;eality !odeling 4anguage. .ata Compression 12 %ours Storage S.aceG Coding ;eBuirementsG SourceA Entro.yA and Hybrid CodingG 8asic Com.ression TechniBuesG <PE>E "mage Pre.arationA 4ossy SeBuential CT(based !odeA Ex.anded 4ossy CT(based !odeA 4ossless !odeA Hierarchical !ode. H.+3$ CPx3'D and H.+3)E "mage Pre.arationA Coding #lgorithmsA ata StreamA H.+3): and H.+3)4G !PE>E ?ideo EncodingA #udio CodingA ata StreamA !PE>(+A !PE>('A !PE>(5G ,ractal Com.ression. 'ptical Stora3e Media > %ours History o- /.tical StorageG 8asic TechnologyG ?ideo iscs and /ther W/;!sG Com.act isc igital #udioG Com.act isc ;ead /nly !emoryG C (;/! Extended #rchitectureG ,urther C (;/!(8ased e&elo.mentsG Com.act isc ;ecordableG Com.act isc !agneto(/.ticalG Com.act isc ;ead/WriteG igital ?ersatile isc. Content Analysis > %ours Sim.le ?s. Com.lex ,eaturesG #nalysis o- "ndi&idual "magesG #nalysis o- "mage SeBuencesG #udio #nalysisG #..lications. .ata and -ile -ormat Standards ? %ours ;ich(Text ,ormatG T",, ,ile ,ormatG ;esource "nterchange ,ile ,ormat C;",,DG !" " ,ile ,ormatG <PE> "8 ,ile ,ormat -or Still and !otion "magesG #?" "ndeo ,ile ,ormatG !PE> StandardsG TW#"N Multimedia Application .esi3n ? %ours !ultimedia #..lication ClassesG Ty.es o- !ultimedia SystemsG ?irtual ;eality esignG Com.onents o!ultimedia SystemsG /rgani0ing !ultimedia atabasesG #..lication Work-lo9 esign "ssuesG istributed #..lication esign "ssues. $e;t ,oo7s2 $. ;al- Steinmet0A Flara NarstedtE !ultimedia ,undamentalsE ?ol $(!edia Coding and Content ProcessingA +nd EditionA Pearson EducationA +%%). CCha.ters +A )A 'A *A 3A 5A 6A 7D +. Prabhat F. #ndleighA Firan ThakrarE !ultimedia Systems esignA PH"A +%%). CCha.ters $A )A 5D "eference ,oo7s2 $. F.; ;aoA Ioran S. 8ojko&ic and ragorad #. !ilo&ano&icE !ultimedia Communication SystemsE TechniBuesA StandardsA and Net9orksA Pearson EducationA +%%+. +. Nalin F SharadE !ultimedia in-ormation Net9orkingA PH"A +%%+. 0attern "eco3nition Sub5ect Code2 10MCA:8: %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

444
ntroduction > %ours !achine .erce.tionA an exam.leG Pattern ;ecognition SystemG The esign CycleG 4earning and #da.tation ,ayesian .ecision $heory ? %ours "ntroductionA 8ayesian ecision TheoryG Continuous ,eaturesA !inimum error rateA classi-icationA classi-iersA discriminant -unctionsA and decision sur-acesG The normal densityG iscriminant -unctions -or the normal density Ma;imum-li7elihood and ,ayesian 0arameter !stimation ? %ours "ntroductionG !aximum(likelihood estimationG 8ayesian EstimationG 8ayesian .arameter estimationE >aussian CaseA general theoryG Hidden !arko& !odels &on-parametric $echniCues > %ours "ntroductionG ensity EstimationG Par0en 9indo9sG kn = Nearest( Neighbor EstimationG The Nearest( Neighbor ;uleG !etrics and Nearest(Neighbor Classi-ication (inear .iscriminant -unctions ? %ours "ntroductionG 4inear iscriminant ,unctions and ecision Sur-acesG >enerali0ed 4inear iscriminant ,unctionsG The T9o(Category 4inearly Se.arable caseG !inimi0ing the Perce.tion Criterion ,unctionsG ;elaxation ProceduresG Non(se.arable 8eha&iorG !inimum SBuared(Error .roceduresG The Ho(Fashya. .rocedures Stochastic Methods > %ours "ntroductionG Stochastic SearchG 8olt0mann 4earningG 8olt0mann Net9orks and >ra.hical !odelsG E&olutionary !ethods &on-Metric Methods > %ours "ntroductionG ecision TreesG C#;TG /ther Tree !ethodsG ;ecognition 9ith StringsG >rammatical !ethods *nsuper1ised (earnin3 and Clusterin3 ? %ours "ntroductionG !ixture ensities and "denti-iabilityG !aximum(4ikelihood EstimatesG #..lication to Normal !ixturesG 1nsu.er&ised 8ayesian 4earningG ata escri.tion and ClusteringG Criterion ,unctions -or Clustering $e;t ,oo7s2 $. ;ichard /. udaA Peter E. HartA and "nterscienceA +%%$. a&id >.StorkE Pattern Classi-icationA + nd EditionA Wiley(

"eference ,oo7s2 $. Earl >oseA ;ichard <ohnsonbaughA Ste&e <ostE Pattern ;ecognition and "mage #nalysisA Pearson EducationA +%%5. 0rinciples of *ser nterface .esi3n Sub5ect Code2 10MCA:88 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction B %ours *sability of nteracti1e Systems2 "ntroductionA 1sability ;eBuirementsA 1sability measuresA 1sability !oti&ationsA 1ni&ersal 1sabilityA >oals -or our .ro-ession )uideline+ principles+ and $heoriesE "ntroductionA >uidelinesA .rinci.lesA TheoriesA /bject(#ction "nter-ace !odel .e1elopment 0rocesses 8 %ours Mana3in3 .esi3n 0rocesses2 "ntroductionA /rgani0ational esign to su..ort 1sabilityA The Three .illars odesignA e&elo.ment !ethodologiesA Ethnogra.hic /bser&ationA Partici.atory esignA Scenario e&elo.mentA Social "m.act statement -or Early esign ;e&ie9A 4egal "ssues. !1aluatin3 nterface .esi3ns ? %ours "ntroductionA Ex.ert ;e&ie9sA 1sability Testing and 4aboratoriesA Sur&ey "nstrumentsA #cce.tance TestsA E&aluation uring #cti&e 1seA Controlled Psychologically /riented Ex.eriments.

444
Soft=are $ools2 "ntroductionA S.eci-ication !ethodsA "nter-ace(8uilding ToolsA E&aluation and CritiBuing Tools. nteraction Styles B %ours .irect Manipulation and Virtual !n1ironments2 "ntroductionA Exam.les o- irect !ani.ulationA ) "nter-acesA Teleo.erationA ?irtual and #ugmented ;eality. Menu Selection+ -orm -illin+ and .ialo3 ,o;es2 "ntroductionA Task(;elated !enu /rgani0ationA Single !enusA Combinations o- !ulti.le !enusA Content /rgani0ationA ,ast !o&ement Through !enusA ata Entry 9ith !enusE ,orm ,illinA ialog 8oxesA and #lternati&esA #udio !enus and !enus -or small is.lays. Command and &atural (an3ua3es B %ours "ntroductionA ,unctionality to Su..ort 1serJs TasksA Command(/rgani0ation StrategiesA The 8ene-its oStructureA Naming and #bbre&iationsA Natural 4anguage in Com.uting. nteraction .e1ices2 "ntroductionA Feyboards and Fey.adsA Pointing e&icesA S.eech and #uditory inter-acesA is.lays(Small and 4argeA Printers. .esi3n ssues > %ours Guality of Ser1ice2 "ntroductionA !odels o- ;es.onse(Time "m.actsA Ex.ectations and #ttitudesA 1ser Producti&ityA ?ariability in ;es.onse TimeA ,rustrating Ex.eriences. ,alancin3 -unction and -ashion2 "ntroductionA Error !essagesA Nonanthro.omor.hic esignA is.lay esignA Windo9 esignA Color. *ser Manuals+ 'nline %elp+ and $utorials 8 %ours "ntroductionA Pa.er &ersus /nline !anualsA ;eading -rom Pa.er ?erses -rom is.laysA Sha.ing the Content o- the !anualsA /nline !anuals and Hel.A /nline TutorialsA emonstrationsA and >uidesA /nline Communities -or 1ser #ssistanceA The e&elo.ment Process. nformation Search and Visuali@ation2 "ntroductionA Search in Textual ocuments and atabase HueryingA !ultimedia #d&anced ,iltering and Search "nter-acesA "n-ormation ?isuali0ation 8 %ours ocument SearchesA

$e;t ,oo7s2 $. 8en ShneidermanE esigning the 1ser "nter-aceA 'rd EditionA Pearson EducationA +%%7. CCha.ters $ to 7 and $$ to $'D "eference ,oo7s2 $. #lan < ix et. al.E Human(Com.uter "nteractionA "" EditionA Prentice(Hall "ndiaA $776. +. EbertsE 1ser "nter-ace esignA Prentice(HallA $77'. ). Wilber / >alit0E The Essential >uide to 1ser "nter-ace esign ( #n "ntroduction to >1" esignA Princi.les and TechniBuesA Wiley( reamtech "ndia P&t. 4tdA $776. Ad1anced Computer &et=or7s Sub5ect Code2 10MCA:8> %ours9Wee72 0: $otal %ours2 82 A Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100 8 %ours

"e1ie= of &et=or7 Models 4ayered tasksG The /S" model and layers in the /S" modelG TCP / "P .rotocol suiteG #ddressing

S'&!$ 9 S.% 8 %ours #rchitectureG S/NET layersG S/NET -ramesG STS multi.lexingG S/NET net9orksG ?irtual tributaries -rame "elay and A$M ,rame relayG #T! and #T! 4#Ns : %ours

01>+ Address Mappin3 and !rror "eportin3 > %ours "P&3E #d&antagesA Packet -ormatA and Extension headersG Transition -rom "P&' to "P&3E ual stackA TunnelingA and Header translationG #ddress ma..ingE #;PA ;#;PA 8//TPA and HCPG Error re.ortingE "C!P.

444
Multicast "outin3 0rotocols 1nicastA multicast and broadcastG #..licationsG !ulticasting routingG ;outing .rotocols. : %ours

SC$0 : %ours SCTP ser&icesG SCTP -eaturesG Packet -ormatG #n SCTP associationG ,lo9 controlG Error controlG Congestion control. Con3estion Control and Guality of Ser1ice > %ours ata tra--icG Congestion and congestion controlG Congestion control in TCPA ,rame relayG Huality oSer&iceG TechniBues to im.ro&e HoSG "ntegrated ser&icesG i--erentiated ser&ices Multimedia > %ours igiti0ing audio and &ideoG #udio and &ideo com.ressionG Streaming stored audio / &ideoG Streaming li&e audio / &ideoG ;eal(time interacti&e audio / &ideoG ;TPG ;TCPG ?o"P. Mobile Ad-%oc &et=or7s+ Wireless Sensor &et=or7s 12 %ours /&er&ie9 o- 9ireless ad(hoc net9orksG ;outing in ad(hoc net9orksG ;outing .rotocols -or ad(hoc net9orksG Security o- ad(hoc net9orks.Sensor net9orks and .rotocol structuresG Communication energy modelG Clustering .rotocolsG ;outing .rotocolsG Iigbee technology and "EEE 6%+.$*.' $e;t ,oo7s2 $. 8ehrou0 #. ,orou0anA ata Communications and Net9orkingA 'th EditionA Tata !c>ra9(HillA +%%3. CCha.ters +A $5A $6A +%.)A +%.'A +$.$A +$.+A ++.'A +).'A +'A +7D +. Nader ,. !irE Com.uter and Communication Net9orksA PearsonA +%%5. CCha.ters $7A +% excluding +%.*D "eferences2 $. William StallingsE ata and Com.uter CommunicationA 6th EditionA Prentice Hall "ndiaA +%%5. +. William #. ShayE 1nderstanding ata Communications and Net9orksA )rd EditionA ThomsonA +%%). ). >odboleE ata Communications and Net9orksA Tata !c>ra9(HillA +%%+. '. !icael #. >allo 2 William !. HandcockE Com.uter Communications and Net9orking TechnologiesA ThomsonA +%%). J2!! (aboratory Sub5ect Code2 10MCA:> %ours9Wee72 < $otal %ours2 :2 $. +. ). '. *. 3. 5. 6. 6A Mar7s2 80 !;am %ours2 0< !;am Mar7s2 80

Write a <#?# Program to insert data into Student #T# 8#SE and retrie&e in-o based on .articular Bueries CBueries can be gi&en 9hich co&ers all the to.ics o- +nd 1N"TD. Write a <#?# Ser&let Program to im.lement a dynamic HT!4 using Ser&let Cuser name and .ass9ord should be acce.ted using HT!4 and dis.layed using a Ser&letD. Write a <#?# Ser&let Program to o9nload a -ile and dis.lay it on the screen C# link has to be .ro&ided in HT!4A 9hen the link is clicked corres.onding -ile has to be dis.layed on ScreenD Write a <#?# Ser&let Program to im.lement ;eBuest is.atcher object Cuse includeCD and -or9ardCD methodsD. Write a <#?# Ser&let Program to im.lement and demonstrate getCD and Post methodsC1sing HTTP Ser&let ClassD. Write a <#?# Ser&let Program to im.lement send;edirectCD methodCusing HTTP Ser&let ClassD. Write a <#?# Ser&let Program to im.lement sessions C1sing HTTP Session "nter-aceD. a. Write a <#?# <SP Program to .rint $% e&en and $% odd number.

444
b. Write a <#?# <SP Program to im.lement &eri-ication o- a .articular user login and dis.lay a 9elcome .age. 7. Write a <#?# <SP Program to get student in-ormation through a HT!4 and create a <#?# 8ean ClassA .o.ulate 8ean and dis.lay the same in-ormation through another <SP.

$%. Write a <#?# <SP Program 9hich uses Ujs.E.luginW tag to run a a..let. $$. Write a <#?# <SP Program 9hch im.lements nested tags and also uses TagSu..ort Class. $+. #n E<8 a..lication that demonstrates Session 8ean. $). #n E<8 a..lication that demonstrates Entity 8ean. $'. #n E<8 a..lication that demonstrates ! 8. Web 0ro3rammin3 (aboratory Sub5ect Code2 10MCA:? %ours9Wee7 2 0< $otal %ours 2 :2 $. 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 80

e&elo. and demonstrate a @HT!4 -ile that includes <a&ascri.t scri.t -or the -ollo9ing .roblemsE aD "n.utE # number n obtained using .rom.t # number n obtained using .rom.t /ut.utE The -irst n ,ibonacci numbers bD "n.utE /ut.utE # table o- numbers -rom $ to n and their sBuares using alert

+. aD e&elo. and demonstrateA using <a&ascri.t scri.tA a @HT!4 document that collects the 1SN C the &alid -ormat isE # digit -rom $ to ' -ollo9ed by t9o u..er(case characters -ollo9ed by t9o digits -ollo9ed by t9o u..er(case characters -ollo9ed by three digitsG no embedded s.aces allo9edD o- the user. E&ent handler must be included -or the -orm element that collects this in-ormation to &alidate the in.ut. !essages in the alert 9indo9s must be .roduced 9hen errors are detected. bD !odi-y the abo&e .rogram to get the current semester also Crestricted to be a number -rom $ to 6D ). aD e&elo. and demonstrateA using <a&ascri.t scri.tA a @HT!4 document that contains three short .aragra.hs o- textA stacked on to. o- each otherA 9ith only enough o- each sho9ing so that the mouse cursor can be .laced o&er some .art o- them. When the cursor is .laced o&er the ex.osed .art o- any .aragra.hA it should rise to the to. to become com.letely &isible. bD !odi-y the abo&e document so that 9hen a .aragra.h is mo&ed -rom the to. stacking .ositionA it returns to its original .osition rather than to the bottom. '. aD esign an @!4 document to store in-ormation about a student in an engineering college a--iliated to ?T1. The in-ormation must include 1SNA NameA Name o- the CollegeA 8rachA [ear o<oiningA and e(mail id. !ake u. sam.le data -or ) students. Create a CSS style sheet and use it to dis.lay the document. bD Create an @S4T style sheet -or one student element o- the abo&e document and use it to create a dis.lay o- that element. *. aD Write a Perl .rogram to dis.lay &arious Ser&er in-ormations like Ser&er NameA Ser&er So-t9areA Ser&er .rotocolA C>" ;e&ision etc. bD Write a Perl .rogram to acce.t 1N"@ command -rom a HT!4 -orm and to dis.lay the out.ut o- the command executed. 3. aD Write a Perl .rogram to acce.t the 1ser Name and dis.lay a greeting message randomly chosen -rom a list o- ' greeting messages. bD Write a Perl .rogram to kee. track o- the number o- &isitors &isiting the 9eb .age and to dis.lay this count o- &isitorsA 9ith .ro.er headings.

444
5. Write a Perl .rogram to dis.lay a digital clock 9hich dis.lays the current time o- the ser&er. 6. Write a Perl .rogram to insert name and age in-ormation entered by the user into a table created using !ySH4 and to dis.lay the current contents o- this table. 7. Write a PHP .rogram to store current date(time in a C//F"E and dis.lay the \4ast &isited onJ date(time on the 9eb .age u.on reo.ening o- the same .age. $%. Write a PHP .rogram to store .age &ie9s count in SESS"/NA to increment the count on each re-reshA and to sho9 the count on 9eb .age. $$. Create a @HT!4 -orm 9ith NameA #ddress 4ine $A #ddress 4ine +A and E(mail text -ields. /n submittingA store the &alues in !ySH4 table. ;etrie&e and dis.lay the data based on Name. $+. 8uild a ;ails a..lication to acce.t book in-ormation &i0. #ccession numberA titleA authorsA edition and .ublisher -rom a 9eb .age and store the in-ormation in a database and to search -or a book 9ith the title s.eci-ied by the user and to dis.lay the search results 9ith .ro.er headings. &ote2 n the e;amination each student pic7s one Cuestion from the lot of all 12 Cuestions6

A()'" $%MS (A,'"A$'"# Sub5ect Code2 10MCA:B %ours9Wee7 2 0< $otal %ours 2 :2 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 80

.esi3n+ de1elop and implement the specified al3orithms for the follo=in3 problems usin3 C9CDD (an3ua3e in ( &*/ 9 Windo=s en1ironment6 $. Sort a gi&en set o- elements using the Huicksort method and determine the time reBuired to sort the elements. ;e.eat the ex.eriment -or di--erent &alues o- nA the number o- elements in the list to be sorted and .lot a gra.h o- the time taken &ersus n. The elements can be read -rom a -ile or can be generated using the random number generator. 1sing /.en!PA im.lement a .aralleli0ed !erge Sort algorithm to sort a gi&en set o- elements and determine the time reBuired to sort the elements. ;e.eat the ex.eriment -or di--erent &alues o- nA the number o- elements in the list to be sorted and .lot a gra.h o- the time taken &ersus n. The elements can be read -rom a -ile or can be generated using the random number generator.

+.

3. '. *. 3. 5. 6.

a. /btain the To.ological ordering o- &ertices in a gi&en digra.h.

b. Com.ute the transiti&e closure o- a gi&en directed gra.h using Warshall^s algorithm. "m.lement %/$ Fna.sack .roblem using ynamic Programming.

,rom a gi&en &ertex in a 9eighted connected gra.hA -ind shortest .aths to other &ertices using ijkstra^s algorithm. ,ind !inimum Cost S.anning Tree o- a gi&en undirected gra.h using Fruskal^s algorithm. a. Print all the nodes reachable -rom a gi&en starting node in a digra.h using 8,S method. b. Check 9hether a gi&en gra.h is connected or not using ,S method. ,ind a subset o- a gi&en set S Q `slAs+A.....Asna o- n .ositi&e integers 9hose sum is eBual to a gi&en .ositi&e integer d. ,or exam.leA i- SQ `$A +A *A 3A 6a and d Q 7 there are t9o solutions`$A+A3aand`$A6a.# suitable message is to be dis.layed i- the gi&en .roblem instance doesn^t ha&e a solution. "m.lement any scheme to -ind the o.timal solution -or the Tra&eling Sales.erson .roblem and then sol&e the same .roblem instance using any a..roximation algorithm and determine the error in the a..roximation.

7.

444
$%. ,ind !inimum Cost S.anning Tree o- a gi&en undirected gra.h using PrimJs algorithm. $$. "m.lement #ll(Pairs Shortest Paths Problem using ,loyd^s algorithm. Paralleli0e this algorithmA im.lement it using /.en!P and determine the s.eed(u. achie&ed. $+. "m.lement N Hueen^s .roblem using 8ack Tracking. &ote2 n the e;amination each student pic7s one Cuestion from the lot of all 12 Cuestions6

V S!M!S$!" 'b5ect-'riented Modelin3 and .esi3n 0atterns Sub5ect Code2 10MCA81 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction+ Modelin3 Concepts+ class Modelin3 ? %ours What is /bject /rientationK What is // de&elo.mentK // themesG E&idence -or use-ulness o- // de&elo.mentG // modeling history !odeling as esign TechniBueE !odelingG abstractionG The three models. Class !odelingE /bject and class conce.tsG 4ink and associations conce.tsG >enerali0ation and inheritanceG # sam.le class modelG Na&igation o- class modelsG Practical ti.s. Ad1anced Class Modelin3+ State Modelin3 > %ours #d&anced object and class conce.tsG #ssociation endsG N(ary associationsG #ggregationG #bstract classesG !ulti.le inheritanceG !etadataG ;ei-icationG ConstraintsG eri&ed dataG PackagesG Practical ti.s. State !odelingE E&entsA StatesA Transitions and ConditionsG State diagramsG State diagram beha&iorG Practical ti.s. Ad1anced State Modelin3+ nteraction Modelin3 > %ours #d&anced State !odelingE Nested state diagramsG Nested statesG Signal generali0ationG ConcurrencyG # sam.le state modelG ;elation o- class and state modelsG Practical ti.s. "nteraction !odelingE 1se case modelsG SeBuence modelsG #cti&ity models. 1se case relationshi.sG Procedural seBuence modelsG S.ecial constructs -or acti&ity models. 0rocess '1er1ie=+ System Conception+ .omain Analysis ? %ours Process /&er&ie9E e&elo.ment stagesG e&elo.ment li-e cycle. System Conce.tionE e&ising a system conce.tG Elaborating a conce.tG Pre.aring a .roblem statement. omain #nalysisE /&er&ie9 o- analysisG omain class modelG omain state modelG omain interaction modelG "terating the analysis. Application Analysis+ System .esi3n ? %ours #..lication #nalysisE #..lication interaction modelG #..lication class modelG #..lication state modelG #dding o.erations. /&er&ie9 o- system designG Estimating .er-ormanceG !aking a reuse .lanG 8reaking a system in to sub( systemsG "denti-ying concurrencyG #llocation o- sub(systemsG !anagement o- data storageG Handling global resourcesG Choosing a so-t9are control strategyG Handling boundary conditionsG Setting the trade(o-.rioritiesG Common architectural stylesG #rchitecture o- the #T! system as the exam.le. Class .esi3n+ mplementation Modelin3+ (e3acy Systems ? %ours Class esignE /&er&ie9 o- class designG 8ridging the ga.G ;eali0ing use casesG esigning algorithmsG ;ecursing do9n9ardsA ;e-actoringG esign o.timi0ationG ;ei-ication o- beha&iorG #djustment oinheritanceG /rgani0ing a class designG #T! exam.le. "m.lementation !odelingE /&er&ie9 o- im.lementationG ,ine(tuning classesG ,ine(tuning generali0ationsG ;eali0ing associationsG Testing. 4egacy SystemsE ;e&erse engineeringG 8uilding the class modelsG 8uilding the interaction modelG 8uilding the state modelG ;e&erse engineering ti.sG Wra..ingG !aintenance.

444
.esi3n 0atterns+ dioms 12 %ours What is a .attern and 9hat makes a .atternK Pattern categoriesG ;elationshi.s bet9een .atternsG Pattern descri.tion Communication PatternsE ,or9arder(;ecei&erG Client( is.atcher(Ser&erG Publisher(Subscriber. !anagement PatternsE Command .rocessorG ?ie9 handler. "diomsE "ntroductionG 9hat can idioms .ro&ideK "dioms and styleG Where to -ind idiomsG Counted Pointer exam.le $e;t ,oo7s2 $. !ichael 8lahaA <ames ;umbaughE /bject(/riented !odeling and esign 9ith 1!4A +nd EditionA Pearson EducationA +%%*. CCha.ters $ to $5A +)D +. ,rank 8uschmannA ;egine !eunierA Hans ;ohnertA Peter SommerladA !ichael StalE Pattern( /riented So-t9are #rchitectureA # System o- PatternsA ?olume $A <ohn Wiley and SonsA +%%3. CCha.ters $A ).*A ).3A 'D "eference ,oo7s2 $. >rady 8ooch et alE /bject(/riented #nalysis and esign 9ith #..licationsA )rd EditionA PearsonA +%%5. +. 8rahma athanA Sarnath ;amnathE /bject(/riented #nalysisA esignA and "m.lementationA 1ni&ersities PressA +%%7. ). Hans(Erik ErikssonA !agnus PenkerA 8rian 4yonsA a&id ,adoE 1!4 + ToolkitA Wiley( reamtech "ndiaA +%%'. '. Simon 8ennettA Ste&e !c;obb and ;ay ,armerE /bject(/riented Systems #nalysis and esign 1sing 1!4A +nd EditionA Tata !c>ra9(HillA +%%+. System Modelin3 and Simulation Sub5ect Code2 10MCA82 %ours9Wee72 0: $otal %ours2 82 A Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction B %ours When simulation is the a..ro.riate tool and 9hen it is not a..ro.riateG #d&antages and disad&antages oSimulationG #reas o- a..licationG Systems and system en&ironmentG Com.onents o- a systemG iscrete and continuous systemsG !odel o- a systemG Ty.es o- !odelsG iscrete(E&ent System SimulationG Ste.s in a Simulation Study. The basics o- S.readsheet simulationA Simulation exam.leE Simulation o- Bueuing systems in a s.readsheet. )eneral 0rinciples+ Simulation Soft=are > %ours Conce.ts in iscrete(E&ent SimulationE The E&ent(Scheduling / Time(#d&ance #lgorithmA World ?ie9sA !anual simulation 1sing E&ent SchedulingG 4ist .rocessing. Simulation in <a&aG Simulation in >PSS Statistical Models in Simulation ;e&ie9 o- terminology and conce.tsG 1se-ul statistical modelsG distributionsG Poisson .rocessG Em.irical distributions. > %ours iscrete distributionsG Continuous

Gueuin3 Models > %ours Characteristics o- Bueuing systemsG Hueuing notationG 4ong(run measures o- .er-ormance o- Bueuing systemsG Steady(state beha&ior o- !/>/$ BueueG Net9orks o- BueuesG ;ough(cut modelingE #n illustration.. "andom-&umber )eneration+ "andom-Variate )eneration B %ours Pro.erties o- random numbersG >eneration o- .seudo(random numbersG TechniBues -or generating random numbersG Tests -or ;andom Numbers ;andom(?ariate >enerationE "n&erse trans-orm techniBueG #cce.tance(;ejection techniBueG S.ecial .ro.erties.

444
nput Modelin3 > %ours ata CollectionG "denti-ying the distribution 9ith dataG Parameter estimationG >oodness o- ,it TestsG ,itting a non(stationary Poisson .rocessG Selecting in.ut models 9ithout dataG !ulti&ariate and Time(Series in.ut models. !stimation of Absolute 0erformance > %ours Ty.es o- simulations 9ith res.ect to out.ut analysisG Stochastic nature o- out.ut dataG #bsolute measures o.er-ormance and their estimationG /ut.ut analysis -or terminating simulationsG /ut.ut analysis -or steady( state simulations. Verification+ Calibration+ and ValidationI 'ptimi@ation > %ours !odel buildingA &eri-ication and &alidationG ?eri-ication o- simulation modelsG Calibration and &alidation omodels. /.timi0ation &ia Simulation $e;t ,oo7sE $. <erry 8anksA <ohn S. Carson ""A 8arry 4. NelsonA SimulationA *th EditionA PearsonA +%$%. C4isted to.ics only -rom Cha.ters$ to $+D

a&id !. NicolE

iscrete(E&ent System

"eference ,oo7sE $. 4a9rence !. 4eemisA Ste.hen F. ParkE iscrete = E&ent SimulationE # ,irst CourseA Pearson / Prentice(HallA +%%3. +. #&erill !. 4a9E Simulation !odeling and #nalysisA'th EditionA Tata !c>ra9(HillA +%%5. $opics in !nterprise Architecture Sub5ect Code2 10MCA8< %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

$he philosophy of 6&!$ > %ours 1nderstanding the Pre&ious State o- #--airsA The .NET SolutionA The 8uilding 8lock o- the .NET Plat-orm CC4;ACTSA and C4SDA The ;ole o- the .NET 8ase Class 4ibrariesA What C_ 8rings to the TableA #n /&er&ie9 o- .NET 8inaries C aka #ssemblies DA the ;ole o- the Common "ntermediate 4anguage A The ;ole o- .NET Ty.e !etadataA The ;ole o- the #ssembly !ani-astA Com.iling C"4 to Plat-orm =S.eci-ic "nstructionsA 1nderstanding the Common Ty.e SystemA "ntrinsic CTS ata Ty.esA 1nderstanding the Common 4anguages S.eci-icationA 1nderstanding the Common 4anguage ;untime # tour o- the .NET Names.acesA "ncreasing [our Names.ace NomenclatureA e.loying the .NET ;untime ,uildin3 CK Applications > %ours The ;ole o- the Command 4ine Com.lier Ccsc.exeDA 8uilding C _ #..lication using csc.exe Working 9ith csc.exe ;es.onse ,ilesA >enerating 8ug ;e.orts A ;emaining C_ Com.iler /.tionsA The Command 4ine ebugger Ccordbg.exeD 1sing theA ?isual Studio .NET " EA /ther Fey #s.ects o- the ?S.NET " EA C_ XPre.rocessorEY irecti&esA #n "nteresting #sideE The System. En&ironment Class CK (an3ua3e -undamentals6 B %ours The #natomy o- a 8asic C_ ClassA Creating objectsE Constructor 8asicsA The Com.osition o- a C_ #..licationA e-ault #ssignment and ?ariable Sco.eA The C_ !ember "nitiali0ation SyntaxA 8asic "n.ut and /ut.ut 9ith the Console ClassA 1nderstanding ?alue Ty.es and ;e-erence Ty.esA The !aster NodeE SystemA /bjectA The System ata Ty.es Cand C_ #liasesDA Con&erting 8et9een ?alue Ty.es and ;e-erence Ty.esE 8oxing and 1nboxingA e-ining Program ConstantsA C_ "teration ConstructsA C_ Controls ,lo9 ConstructsA The Com.lete Set o- C_ /.eratorsA e-ining Custom Class !ethodsA 1nderstating Static !ethodsA !ethods Parameter !odi-iesA #rray !ani.ulation in C _A String !ani.ulation in C_A C_ EnumerationsA e-ining Structures in C_A e-ining Custom Names.aces. 'b5ect- 'riented 0ro3rammin3 =ith CK > %ours ,orms e-ining o- the C_ ClassA e-inition the X e-ault Public "nter-aceY o- a Ty.eA ;eca..ing the Pillars o- //PA The ,irst PillarsE C_Js Enca.sulation Ser&icesA Pseudo( Enca.sulationE Creating ;ead(/nly ,ieldsA

444
The Second PillarE C_Js "nheritance Su..ortsA kee.ing ,amily SecretsE The XProtectedY Fey9ordA Nested Ty.e e-initionsA The Third PillarE C _Js Polymor.hic Su..ortA Casting 8et9een . !;ceptions and 'b5ect (ifetime > %ours /de to ErrorsA 8ugsA and Exce.tionsA The ;ole o- .NET Exce.tion HandingA the System. Exce.tion 8ase ClassA Thro9ing a >eneric Exce.tionA Catching Exce.tionA C4; System = 4e&el Exce.tionCSystem. System Exce.tionDA Custom #..lication(4e&el Exce.tionCSystem. System Exce.tionDA Handling !ulti.le Exce.tionA The ,amily 8lockA the 4ast Chance Exce.tion ynamically "denti-ying #..lication = and System 4e&el Exce.tion ebugging System Exce.tion 1sing ?S. NETA 1nderstanding /bject 4i-etimeA the C"T o- Xne9JA The 8asics o- >arbage CollectionAA ,inali0ation a Ty.eA The ,inali0ation ProcessA 8uilding an #d Hoc estruction !ethodA >arbage Collection /.timi0ationsA The System. >C Ty.e. nterfaces and Collections > %ours e-ining "nter-aces 1sing C_ "n&oking "nter-ace !embers at the object 4e&elA Exercising the Sha.es HierarchyA 1nderstanding Ex.licit "nter-ace "m.lementationA "nter-aces #s Polymor.hic #gentsA 8uilding "nter-ace HierarchiesA "m.lementingA "m.lementationA "nter-aces 1sing ?S .NETA understanding the "Con&ertible "nter-aceA 8uilding a Custom Enumerator C"Enumerable and EnumeratorDA 8uilding Cloneable objects C "CloneableDA 8uilding Com.arable /bjects C " Com.arable DA Ex.loring the system. Collections Names.aceA 8uilding a Custom Container C;etro-itting the Cars Ty.eD. Callbac7 nterfaces+ .ele3ates+ and !1ents+ Ad1anced $echniCues B %ours 1nderstanding Callback "nter-acesA 1nderstanding the .NET elegate Ty.eA !embers o- System. !ulticast elegateA The Sim.lest Possible elegate Exam.leA A 8uilding !ore a Elaborate elegate Exam.leA 1nderstanding #synchronous elegatesA 1nderstanding Cand 1singDE&ents. The #d&ances Fey9ords o- C_A # Catalog o- C_ Fey9ords 8uilding a Custom "ndexerA # ?ariation o- the Cars "ndexer "nternal ;e.resentation o- Ty.e "ndexer . 1sing C_ "ndexer -rom ?8 .NET. /&erloading o.eratorsA The "nternal ;e.resentation o- /&erloading /.eratorsA interacting 9ith /&erload /.erator -rom /&erloaded( /.erator( Challenged 4anguagesA Creating Custom Con&ersion ;outinesA e-ining "m.licit Con&ersion ;outinesA The "nternal ;e.resentations o- Customs Con&ersion ;outines *nderstandin3 6&!$ Assembles6 > %ours Problems 9ith Classic C/! 8inariesA #n /&er&ie9 o- .NET #ssemblyA 8uilding a Sim.le ,ile Test #ssemblyA # C_. Client #..licationA # ?isual 8asic .NET Client #..licationA Cross 4anguage "nheritanceA Ex.loring the Car4ibraryJsA !ani-estA Ex.loring the Car4ibraryJs Ty.esA 8uilding the !ulti-ile #ssemblyA 1sing #ssemblyA 1nderstanding Pri&ate #ssembliesA Probing -or Pri&ate #ssemblies CThe 8asicsDA Pri&ate # #ssemblies @!4 Con-igurations ,ilesA Probing -or Pri&ate #ssemblies C The etailsDA 1nderstanding Shared #ssemblyA 1nderstanding Shared NamesA 8uilding a Shared #ssemblyA 1nderstanding elay SigningA "nstalling/;emo&ing Shared #ssemblyA 1sing a Shared #ssembly $e;t ,oo7s2 $. #ndre9 TroelsenE Pro C_ 9ith .NET ).%A S.ecial EditionA ream tech PressA "ndiaA +%%5. Cha.tersE $ to $$ Cu. to ...)37D +. E. 8alagurusamyE Programming in C_A A *th ;e.rintA Tata !c>ra9 HillA +%%'. CProgramming Exam.les ).5A ).$%A *.*A 3.$A 5.+A 5.'A 5.*A 5.3A 6.$A 6.+A 6.)A 6.*A 6.5A 6.6A 7.$A 7.+A 7.)A 7.'A $%.+A $%.'A $$.+A $$.'A $+.$A $+.'A $+.*A $+.3A $).$A $).+A $).)A $).3A $'.$A $'.+A $'.'A $*.+A $*.)A $3.$A $3.+A $3.)A $6.)A $6.*.$6.3D "eference ,oo7s2 $. Tom #rcherE "nside C_A WP PublishersA +%%$. +. Herbert SchildtE C_ The Com.lete ;e-erenceA Tata !c>ra9 HillA +%%'. nformation "etrie1al Sub5ect Code2 10MCA8:1 %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am %ours2 < !;am Mar7s2 100

ntroduction+ "etrie1al Strate3ies 1< %ours "ntroductionG ;etrie&al StrategiesE ?ector S.ace !odelG Probabilistic ;etrie&al strategiesA Some !ore ;etrie&al StrategiesE 4anguage !odelsG "n-erence Net9orksG Extended 8oolean ;etrie&alG 4atent Semantic "ndexingG Neural Net9orksG >enetic #lgorithmsG ,u00y Set ;etrie&al.

444
"etrie1al *tilities ? %ours ;ele&ance -eedbackG ClusteringG Passage(8ased ;etrie&alG N(>ramsG ;egression #nalysisG ThesauriG Semantic Net9orksG Parsing. nde;in3 and Searchin3 > %ours "ntroductionG "n&erted ,ilesG /ther indices -or textG 8oolean BueriesG SeBuential searchingG Pattern matchingG Structural BueriesG Com.ression. Cross-(an3ua3e nformation "etrie1al and !fficiency > %ours "ntroductionG Crossing the language barrierG Cross(4anguage retrie&al strategiesG Cross language utilities. u.licate ocument etection. nte3ratin3 Structured .ata and $e;t > %ours ;e&ie9 o- the relational modelG # historical .rogressionG "n-ormation retrie&al as a relational a..licationG Semi(structured search using a relational schemaG !ulti(dimensional data model. 0arallel nformation "etrie1al+ .istributed nformation "etrie1al ? %ours Parallel text scanningG Parallel indexingG Clustering and classi-icationG 4arge .arallel systemsG # theoretic model o- distributed in-ormation retrie&alG Web searchG ;esult -usionG Peer(to(Peer in-ormation systemsG /ther architectures. Multimedia " ? %ours "ntroductionG data modelingG Huery languagesG S.atial access methodsG # general multimedia indexing a..roachG /ne(dimensional time seriesG T9o(dimensional color imagesG #utomatic .icture extraction. $e;t ,oo7s2 $. a&id #. >rossmanA /.hir ,riederE "n-ormation ;etrie&al #lgorithms and HeuristicsA +nd EditionA S.ringerA +%%'. CCha.ters $A +A )A 'A *A 3A 5A 6D +. ;icardo 8ae0a([atesA 8erthier ;ibeiro(NetoE !odern "n-ormation ;etrie&alA Pearson EducationA $777 CCha.ters 6A $$A $+D "eference ,oo7s2 $. William 8. ,rakesA ;icardo 8ae0a([ates CEditorsDE "n-ormation ;etrie&al #lgorithmsA Prentice Hall PT;A $77+. .ata Warehousin3 and .ata Minin3 Sub5ect Code2 10MCA8:2 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100 ata Structures 2

.ata Warehousin3 > %ours "ntroductionA /.erational ata Stores C/ SDA Extraction Trans-ormation 4oading CET4DA ata Warehouses esign "ssuesA >uidelines -or ata Warehouse "m.lementationA ata Warehouse !etadata 'nline Analytical 0rocessin3 ('(A0) > %ours "ntroductionA Characteristics o- /4#P systemsA !ultidimensional &ie9 and ata cubeA ata Cube "m.lementationsA ata Cube o.erationsA "m.lementation o- /4#P and o&er&ie9 on /4#P So-t9ares. .ata Minin3 "ntroductionA ChallengesA ata !ining TasksA Ty.es oand issimilarityA ata !ining #..lications ataA > %ours ata Pre.rocessingA !easures o- Similarity

Association Analysis2 ,asic Concepts and Al3orithms B %ours ,reBuent "temset >enerationA ;ule >enerationA Com.act ;e.resentation o- ,reBuent "temsetsA #lternati&e methods -or generating ,reBuent "temsetsA ,P >ro9th #lgorithmA E&aluation o- #ssociation Patterns Classification 12 %ours

444
8asicsA >eneral a..roach to sol&e classi-ication .roblemA ecision TreesA ;ule 8ased Classi-iersA Nearest Neighbor Classi-iers. 8ayesian Classi-iersA Estimating Predicti&e accuracy o- classi-ication methodsA "m.ro&ing accuracy oclari-ication methodsA E&aluation criteria -or classi-ication methodsA !ulticlass Problem. Clusterin3 $echniCues B %ours /&er&ie9A ,eatures o- cluster analysisA Ty.es o- ata and Com.uting istanceA Ty.es o- Cluster #nalysis !ethodsA Partitional !ethodsA Hierarchical !ethodsA ensity 8ased !ethodsA Huality and ?alidity oCluster #nalysis Web Minin3 > %ours "ntroductionA Web content miningA Text !iningA 1nstructured TextA Text clusteringA !ining S.atial and Tem.oral atabases. $e;t ,oo7s2 $. Pang(Ning TanA !ichael SteinbachA ?i.in FumarE "ntroduction to ata !iningA #ddison(WesleyA +%%*. +. >. F. >u.taE "ntroduction to ata !ining 9ith Case StudiesA )rd EditionA PH"A Ne9 elhiA +%%7. "eference ,oo7s2 $. #run F PujariE ata !ining TechniBues 1ni&ersity PressA +nd EditionA +%%7. +. <ia9ei Han and !icheline FamberE ata !ining ( Conce.ts and TechniBuesA +nd EditionA !organ Fau-mann PublisherA +%%3. ). #lex 8erson and Ste.hen <. SmithE ata WarehousingA ata !iningA and /4#P Com.uting !c >ra9Hill PublisherA $775. Supply Chain Mana3ement Sub5ect Code2 10MCA8:< %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction to Supply Chain+ 0erformance of Supply Chain > %ours What is a Su..ly ChainG ecision .hases in a su..ly ChainG Process &ie9 o- a Su..ly ChainG The im.ortance o- Su..ly Chain ,lo9sG Exam.les o- Su..ly Chains. Com.etiti&e and Su..ly Chain strategiesG #chie&ing strategic -itG Ex.anding strategic sco.e. Supply Cain dri1ers and 'bstacles+ .esi3nin3 .istribution &et=or7 > %ours ri&ers o- Su..ly Chain Per-ormanceG # -rame9ork -or structuring dri&ersG ,acilitiesA "n&entoryA Trans.ortationA and "n-ormationG /bstacles to achie&e strategic -it The role o- distribution in the Su..ly ChainG -actors in-luencing distribution net9ork designG esign o.tions -or a distribution net9orkG the &alue o- distributors in the Su..ly ChainG istribution Net9orks in .ractice. &et=or7 .esi3n ? %ours The role o- net9ork design in the Su..ly ChainG ,actors in-luencing Net9ork design ecisionsG # -rame9ork -or Net9ork esign ecisionsG !odels -or -acility 4ocation and Ca.acity #llocationG making Net9ork esign decisions in .ractice. The im.act o- uncertainty on Net9ork designG iscounted cash -lo9 analysisG ;e.resentations ouncertaintyG E&aluating Net9ork esign decisions using ecision TreesG !aking Su..ly Chain decisions under uncertainty in .ractice. .emand -orecastin3+ A33re3ate 0lannin3 ? %ours The role o- -orecasting in a Su..ly ChainG Characteristics o- -orecastG Com.onents o- a -orecast and -orecasting methodsG 8asic a..roach o- emand -orecastingG Time series -orecasting methodsG !easures o-orecast errorsG The role o- aggregate .lanning in a su..ly ChainG The aggregate .lanning .roblemG #ggregate .lanning strategies. n1entory Mana3ement > %ours The role o- cycle in&entory in a su..ly ChainG Economies o- scale to ex.loit -ixed costsA Buantity discountsG Short(term discountingG !anaging multi(echelon cycle in&entoryG Estimating cycle in&entory related costs in .ractice.

444
$ransportation ? %ours The role o- trans.ortation in the Su..ly ChainG ,actors a--ecting trans.ortation decisionsG !odes otrans.ortation and their .er-ormance characteristicsG esign o.tions -or a trans.ortation net9orkG Trade(o--s in trans.ortation designG Tailored trans.ortationG ;outing and scheduling in trans.ortationG !aking trans.ortation decisions in .ractice. 0ricin3 and "e1enue Mana3ement+ Coordination ? %ours The role o- re&enue management in Su..ly ChainG re&enue management -or multi.le customer segmentsA .erishable assetsA seasonal demandA and bulk and s.ot contractsG 1sing re&enue management in .ractice 4ack o- Su..ly Chain coordination and 8ull9hi. e--ectG E--ect o- lack o- coordination on .er-ormanceG /bstacles to coordination in the Su..ly ChainG managerial le&ers to achie&e coordinationG 8uilding strategic .artnershi.s and trust 9ithin a su..ly ChainG #chie&ing coordination in .ractice. $+ nternet and Supply Chain > %ours The role o- "T in the Su..ly ChainG The Su..ly Chain "T -rame9orkG C;!G "nternal SC!G Su..lier ;elationshi. !anagementG The transaction management -oundationG The -uture i- "T in SC!G Su..ly Chain "t in .ractice. The role o- E(8usiness in Su..ly ChainG The E(8usiness -rame9orkG The 8+8 addition to the E(8usiness -rame9orkG E(8usiness in .ractice $e;t ,oo7s2 $. Sunil Cho.raA Pter !eindlE Su..ly Chain !anagement StrategyA PlanningA and /.erationA + nd EditionA Prentice(Hall o- "ndiaA +%%'. CCha.ters $A +A 'A 'A *A 3A 5A 6.$ to 6.)A $%A $'A $*A $3A $5A $6D "eference ,oo7s2 $. a&id Simchi(4e&iA Phil. FaminkyA Edith Simchi(4e&iE esigning and !anaging The Su..ly Chain Conce.tsA Strategies 2 Case StudiesA )rd EditionA Tata !c>ra9 HillA +%%). +. ;.P. !ohantyA S.>. eshmukhE Su..ly Chain !anagement Theories 2 PracticesA 8i0mantraA +%%*. ). ;ahul ?. #ltekarE Su..ly Chain !anagement Conce.ts and CasesA PH"A +%%*. '. ! !artin Christo.herE 4ogistics and Su..ly Chain !anagementA +nd EditionA Pearson EducationA $776. &et=or7 Mana3ement Sub5ect Code2 10MCA8:: %ours9Wee7 2 0: $otal %ours 2 82 A Mar7s2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction ? %ours #nalogy o- Tele.hone Net9ork !anagementA ata and Telecommunication Net9ork istributed com.uting En&ironmentsA TCP/"P(8ased Net9orksE The "nternet and "ntranetsA Communications Protocols and Standards( Communication #rchitecturesA Protocol 4ayers and Ser&icesG Case Histories o- Net9orking and !anagement = The "m.ortance o- to.ology A ,iltering oes Not ;educe 4oad on NodeA Some Common Net9ork ProblemsG Challenges o- "n-ormation Technology !anagersA Net9ork !anagementE >oalsA /rgani0ationA and ,unctions( >oal o- Net9ork !anagementA Net9ork Pro&isioningA Net9ork /.erations and the N/CA Net9ork "nstallation and !aintenanceG Net9ork and System !anagementA Net9ork !anagement System .lat-ormA Current Status and ,uture o- Net9ork !anagement. ,asic -oundations2 Standards+ Models+ and (an3ua3e > %ours Net9ork !anagement StandardsA Net9ork !anagement !odelA /rgani0ation !odelA "n-ormation !odel = !anagement "n-ormation TreesA !anaged /bject Pers.ecti&esA Communication !odelG #SN.$( TerminologyA SymbolsA and Con&entionsA /bjects and ata Ty.esA /bject NamesA #n Exam.le o- #SN.$ -rom "S/ 66+'G Encoding StructureG !acrosA ,unctional !odel. S&M011 &et=or7 Mana3ement 1< %ours !anaged Net9orkE The History o- SN!P !anagementA "nternet /rgani0ations and standardsA "nternet ocumentsA The SN!P !odelA The /rgani0ation !odelA System /&er&ie9. The "n-ormation !odel = "ntroductionA The Structure o- !anagement "n-ormationA !anaged /bjectsA !anagement "n-ormation 8ase.

444
The SN!P Communication !odel = The SN!P #rchitectureA #dministrati&e !odelA SN!P S.eci-icationsA SN!P /.erationsA SN!P !"8 >rou.A ,unctional !odel S&M0 Mana3ement H "M'& > %ours ;emote !onitoringA ;!/N S!" and !"8A ;!/N"$( ;!/N$ Textual Con&entionsA ;!/N$ >rou.s and ,unctionsA ;elationshi. 8et9een Control and ata TablesA ;!/N$ Common and Ethernet >rou.sA ;!/N Token ;ing Extension >rou.sA ;!/N+ = The ;!/N+ !anagement "n-ormation 8aseA ;!/N+ Con-ormance S.eci-icationsG #T! ;emote !onitoringA # Case Study o- "nternet Tra--ic 1sing ;!/N. ,roadband &et=or7 Mana3ement2 A$M &et=or7s > %ours 8roadband Net9orks and Ser&icesA #T! Technology = ?irtual Path(?irtual CircuitA T! Packet Si0eA "ntegrated Ser&iceA S/NETA #T! 4#N EmulationA ?irtual 4#NG #T! Net9ork !anagement = The #T! Net9ork ;e-erence !odelA The "ntegrated 4ocal !anagement "nter-aceA The #T! !anagement "n-ormation 8aseA The ;ole o- SN!P and "4!" in #T! !anagementA !$ "nter-aceE !anagement o- #T! Net9ork ElementA !+ "nter-aceE !anagement o- Pri&ate Net9orksA !) "nter-aceE Customer Net9ork !anagement o- Public Net9orksA !' "nter-aceE Public Net9ork !anagementA !anagement o- 4#N EmulationA #T! igital Exchange "nter-ace !anagement. ,roadband &et=or7 Mana3ement > %ours 8roadband #ccess Net9orks and Technologies = 8roadband #ccess Net9orksA roadband #ccess TechnologyG H,CT Technology = The 8roadband 4#NA The Cable !odemA The Cable !odem Termination SystemA The H,C PlantA The ;, S.ectrum -or Cable !odemG ata /&er Cable ;e-erence #rchitectureG H,C !anagement = Cable !odem and C!TS !anagementA H,C 4ink !anagementA ;, S.ectrum !anagementA S4 TechnologyG #symmetric igital Subscriber 4ine Technology = ;ole o- the # S4 #ccess Net9ork in an /&erall Net9orkA # S4 #rchitectureA # S4 Channeling SchemesA # S4 Encoding SchemesG # S4 !anagement = # S4 Net9ork !anagement ElementsA # S4 Con-iguration !anagementA # S4 ,ault !anagementA # S4 Per-ormance !anagementA SN!P(8ased # S4 4ine !"8A !"8 "ntegration 9ith "nter-aces >rou.s in !"8(+A # S4 Con-iguration Pro-iles. &et=or7 Mana3ement Applications B %ours Con-iguration !anagement( Net9ork Pro&isioningA "n&entory !anagementA Net9ork To.ologyA ,ault !anagement( ,ault etectionA ,ault 4ocation and "solation TechniBuesA Per-ormance !anagement = Per-ormance !etricsA ata !onitoringA Problem "solationA Per-ormance StatisticsG E&ent Correlation TechniBues = ;ule(8ased ;easoningA !odel(8ased ;easoningA Case(8ased ;easoningA Codebook correlation !odelA State Transition >ra.h !odelA ,inite State !achine !odelA Security !anagement = Policies and ProceduresA Security 8reaches and the ;esources Needed to Pre&ent ThemA ,ire9allsA Cry.togra.hyA #uthentication and #uthori0ationA Client/Ser&er #uthentication SystemsA !essages Trans-er SecurityA Protection o- Net9orks -rom ?irus #ttacksA #ccounting !anagementA ;e.ort !anagementA Policy(8ased !anagementA Ser&ice 4e&el !anagement. $e;t ,oo7s2 $. !ani SubramanianE Net9ork !anagement( Princi.les and PracticeA Pearson EducationA +%%). "eference ,oo7s2 $. <. ;ichard 8urkeE Net9ork management Conce.ts and PracticesE a Hands(/n #..roachA PH"A +%%6. Compiler .esi3n Sub5ect Code2 10MCA8:8 %ours9 Wee72 0: $otal %ours2 82 A Mar7s2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction+ (e;ical analysis B %ours 4anguage .rocessorsG The structure o- a Com.ilersG The e&olution o- .rogramming languagesG The science o- building a com.ilerG #..lications o- Com.iler technologyG Programming language basicsG 4exical analysisE The ;ole o- 4exical #naly0erG "n.ut 8u--eringG S.eci-ications o- TokensG ;ecognition oTokens. Synta; Analysis - 1 "ntroductionG Context(-ree >rammarsG Writing a >rammarG To.(do9n Parsing > %ours

444
Synta; Analysis H 2 8ottom(u. ParsingG "ntroduction to 4; ParsingE Sim.le 4;. Synta; Analysis H < !ore .o9er-ul 4; .arsersG 1sing ambiguous grammarsG Parser >enerators. Synta;-.irected $ranslation Syntax( irected de-initionsG E&aluation order -or S Syntax(directed translation schemes > %ours > %ours

> %ours sG #..lications o- Syntax(directed translationG

ntermediate Code )eneration B %ours ?ariants o- syntax treesG Three(address codeG Ty.es and declarationsG Translation o- ex.ressionsG Ty.e checkingG Control -lo9G 8ack .atchingG S9itch statementsG "ntermediate code -or .rocedures. "un-$ime !n1ironments > %ours Storage /rgani0ationG Stack allocation o- s.aceG #ccess to non(local data on the stackG Hea. managementG "ntroduction to garbage collection Code )eneration > %ours "ssues in the design o- Code >eneratorG The Target languageG #ddresses in the target codeG 8asic blocks and ,lo9 gra.hsG /.timi0ation o- basic blocksG # Sim.le Code >enerator. $e;t ,oo7s2 $. #l-red ? #hoA !onica S. 4amA ;a&i SethiA <e--rey 1llmanE Com.ilers( Princi.lesA TechniBues and ToolsA +nd EditionA #ddison(WesleyA +%%5. CCha.ters $A ).$ to ).'A 'A *.$ to *.'A 3A 5.$ to 5.*A 6.$ to 6.3D "eference ,oo7s2 $. Charles N. ,ischerA ;ichard <. le8lancA <r.E Cra-ting a Com.iler 9ith CA Pearson EducationA $77$. +. #ndre9 W #..leE !odern Com.iler "m.lementation in CA Cambridge 1ni&ersity PressA $775. ). Fenneth C 4oudenE Com.iler Construction Princi.les 2 PracticeA Thomson EducationA $775. Soft=are Architectures Sub5ect Code2 10MCA8:> %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction > %ours The #rchitecture 8usiness CycleE Where do architectures come -romK So-t9are .rocesses and the architecture business cycleG What makes a XgoodY architectureK What so-t9are architecture is and 9hat it is notG /ther .oints o- &ie9G #rchitectural .atternsA re-erence models and re-erence architecturesG "m.ortance o- so-t9are architectureG #rchitectural structures and &ie9s. Architectural Styles and Case Studies ? %ours #rchitectural stylesG Pi.es and -iltersG ata abstraction and object(oriented organi0ationG E&ent(basedA im.licit in&ocationG 4ayered systemsG ;e.ositoriesG "nter.retersG Process controlG /ther -amiliar architecturesG Heterogeneous architectures. Case StudiesE Fey9ord in ContextG "nstrumentation so-t9areG !obile roboticsG Cruise controlG Three &ignettes in mixed style. Guality > %ours ,unctionality and architectureG #rchitecture and Buality attributesG System Buality attributesG Huality attribute scenarios in .racticeG /ther system Buality attributesG 8usiness BualitiesG #rchitecture Bualities. #chie&ing HualityE "ntroducing tacticsG #&ailability tacticsG !odi-iability tacticsG Per-ormance tacticsG Security tacticsG Testability tacticsG 1sability tacticsG ;elationshi. o- tactics to architectural .atternsG #rchitectural .atterns and styles. Architectural 0atterns H 1 "ntroductionG ,rom mud to structureE 4ayersA Pi.es and ,iltersA 8lackboard. Architectural 0atterns H 2 ? %ours ? %ours

444
istributed SystemsE 8rokerG "nteracti&e SystemsE !?CA Presentation(#bstraction(Control Architectural 0atterns H < #da.table SystemsE !icrokernelG ;e-lection. > %ours

Some .esi3n 0atterns > %ours Structural decom.ositionE Whole = PartG /rgani0ation o- 9orkE !aster = Sla&eG #ccess ControlE Proxy. .esi3nin3 and .ocumentin3 Soft=are Architecture ? %ours #rchitecture in the li-e cycleG esigning the architectureG ,orming the team structureG Creating a skeletal system. 1ses o- architectural documentationG ?ie9sG Choosing the rele&ant &ie9sG ocumenting a &ie9G ocumentation across &ie9s. $e;t ,oo7s2 $. 4en 8assA Paul ClementsA ;ick Fa0manE So-t9are #rchitecture in PracticeA +nd EditionA Pearson EducationA +%%). CCha.ters $A +A 'A *A 5A 7D +. ,rank 8uschmannA ;egine !eunierA Hans ;ohnertA Peter SommerladA !ichael StalE Pattern( /riented So-t9are #rchitectureA # System o- PatternsA ?olume $A <ohn Wiley and SonsA +%%3. CCha.ters +A ).$ to ).'D ). !ary Sha9 and a&id >arlanE So-t9are #rchitecture( Pers.ecti&es on an Emerging isci.lineA Prentice Hall o- "ndia / Pearson EducationA +%%5. CCha.ters $.$A +A )D "eference ,oo7s2 $. E. >ammaA ;. HelmA ;. <ohnsonA <. ?lissidesE esign Patterns( Elements o- ;eusable /bject( /riented So-t9areA #ddison(WesleyA $77*. +. Web site for 0atterns2 htt.E//999.hillside.net/.atterns/ nformation and &et=or7 Security Sub5ect Code2 10MCA881 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

0lannin3 for Security > %ours "ntroductionG "n-ormation Security PolicyA StandardsA and PracticesG The "n-ormation Security 8lue PrintG Contingency .lan and a model -or contingency .lan. Security $echnolo3y 12 %ours "ntroductionG Physical designG ,ire9allsG Protecting ;emote Connections "ntroductionG "ntrusion etection Systems C" SDG Honey PotsA Honey NetsA and Padded cell systemsG Scanning and #nalysis Tools Crypto3raphy B %ours "ntroductionG # short History o- Cry.togra.hyG Princi.les o- Cry.togra.hyG Cry.togra.hy ToolsG #ttacks on Cry.tosystems. ntroduction to &et=or7 Security+ Authentication Applications B %ours #ttacksA ser&icesA and !echanismsG Security #ttacksG Security Ser&icesG # model -or "nternet9ork SecurityG "nternet Standards and ;,Cs FerberosA @.*%7 irectory #uthentication Ser&ice. !lectronic Mail Security Pretty >ood Pri&acy CP>PDG S/!"!E > %ours

0 Security > %ours "P Security /&er&ie9G "P Security #rchitectureG #uthentication HeaderG Enca.sulating Security PayloadG Combining Security #ssociationsG Fey !anagement.

444
Web Security > %ours Web security reBuirementsG Secure Socket layer CSS4D and Trans.ort layer Security CT4SDG Secure Electronic Transaction CSETD $e;t ,oo7s2 $. !ichael E. Whitman and Herbert <. !attordE Princi.les o- "n-ormation SecurityA + nd EditionA ThomsonA +%%*. CCha.ters *A 3A 5A 6G Exclude the to.ics not mentioned in the syllabusD +. William StallingsE Net9ork Security EssentialsE #..lications and StandardsA Pearson EducationA +%%%. CCha.tersE $A 'A *A 3A 5A 6D "eference ,oo72 $. 8ehrou0 #. ,orou0anE Cry.togra.hy and Net9ork SecurityA S.ecial "ndian EditionA Tata !c>ra9(HillA +%%5. Soft=are $estin3 Sub5ect Code2 10MCA882 %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am %ours2 < !;am Mar7s2 100

A 0erspecti1e on $estin3+ !;amples2 > %ours 8asic de-initionsA Test casesA "nsights -rom a ?enn diagramA "denti-ying test casesA Error and -ault taxonomiesA 4e&els o- testing. Exam.lesE >enerali0ed .seudocodeA The triangle .roblemA The Next ate -unctionA The commission .roblemA The S#T! CSim.le #utomatic Teller !achineD .roblemA The currency con&erterA Saturn 9indshield 9i.er. ,oundary Value $estin3+ !Cui1alence Class $estin3+ .ecision $able-,ased $estin32 ? %ours 8oundary &alue analysisA ;obustness testingA Worst(case testingA S.ecial &alue testingA Exam.lesA ;andom testingA EBui&alence classesA EBui&alence test cases -or the triangle .roblemA Next ate -unctionA and the commission .roblemA >uidelines and obser&ations. ecision tablesA Test cases -or the triangle .roblemA Next ate -unctionA and the commission .roblemA >uidelines and obser&ations. 0ath $estin3+ .ata -lo= $estin32 ? %ours .athsA Test co&erage metricsA 8asis .ath testingA guidelines and obser&ations. e-inition(1se testingA Slice(based testingA >uidelines and obser&ations. (e1els of $estin3+ nte3ration $estin32 > %ours Traditional &ie9 o- testing le&elsA #lternati&e li-e(cycle modelsA The S#T! systemA Se.arating integration and system testing. # closer look at the S#T! systemA ecom.osition(basedA call gra.h(basedA Path(based integrations. System $estin3+ nteraction $estin32 ? %ours ThreadsA 8asic conce.ts -or reBuirements s.eci-icationA ,inding threadsA Structural strategies and -unctional strategies -or thread testingA S#T! test threadsA System testing guidelinesA #S, C#tomic System ,unctionsD testing exam.le. Context o- interactionA # taxonomy o- interactionsA "nteractionA com.ositionA and determinismA Client/Ser&er Testing. 0rocess -rame=or72 ? %ours ?alidation and &eri-icationA egrees o- -reedomA ?arieties o- so-t9are. 8asic .rinci.lesE Sensiti&ityA redundancyA restrictionA .artitionA &isibilityA ,eedback. The Buality .rocessA Planning and monitoringA Huality goalsA e.endability .ro.ertiesA #nalysisA TestingA "m.ro&ing the .rocessA /rgani0ational -actors. -ault-,ased $estin3+ $est !;ecution2 > %ours /&er&ie9A #ssum.tions in -ault(based testingA !utation analysisA ,ault(based adeBuacy criteriaA ?ariations on mutation analysis. Test ExecutionE /&er&ie9A -rom test case s.eci-ications to test casesA Sca--oldingA >eneric &ersus s.eci-ic sca--oldingA Test oraclesA Sel-(checks as oraclesA Ca.ture and re.lay. 0lannin3 and Monitorin3 the 0rocess+ .ocumentin3 Analysis and $est2 > %ours

444
Huality and .rocessA Test and analysis strategies and .lansA ;isk .lanningA !onitoring the .rocessA "m.ro&ing the .rocessA The Buality teamA /rgani0ing documentsA Test strategy documentA #nalysis and test .lanA Test design s.eci-ications documentsA Test and analysis re.orts. $!/$ ,''FS2 $. Paul C. <orgensenE So-t9are TestingA # Cra-tsmanJs #..roachA )rd EditionA #uerbach PublicationsA +%%6. C4isted to.ics only -rom Cha.ters $A +A *A 3A 5A 7A $%A $+A $)$'A $*D +. !auro Pe00eA !ichal [oungE So-t9are Testing and #nalysis = ProcessA Princi.les and TechniBuesA Wiley "ndiaA +%%6. C4isted to.ics only -rom Cha.ters +A )A 'A $3A $5A +%A +'D "!-!"!&C! ,''FS2 $. #ditya P !athur2 ,oundations o- So-t9are TestingA PearsonA +%%6. +. Srini&asan esikanA >o.alas9amy ;ameshE So-t9are testing Princi.les and PracticesA +nd EditionA PearsonA +%%5. ). 8rian !arrickE The Cra-t o- So-t9are TestingA PearsonA $77*.

Ser1ices 'riented Architecture Sub5ect Code2 10MCA88< %ours9Wee72 : $otal %ours2 82 6A6 Mar7s2 80 !;am %ours2 < !;am Mar7s2 100

ntroduction o S'A+ !1olution of S'A ? %ours ,undamental S/#G Common Characteristics o- contem.orary S/#G Common tangible bene-its o- S/#G #n S/# timeline C-rom @!4 to Web ser&ices to S/#DG The continuing e&olution o- S/# CStandards organi0ations and Contributing &endorsDG The roots o- S/# Ccom.aring S/# to Past architecturesD. Web Ser1ices and 0rimiti1e S'A > %ours The Web ser&ices -rame9orkG Ser&ices Cas Web ser&icesDG Ser&ice descri.tions C9ith WS 4DG !essaging C9ith S/#PD. Web Ser1ices and Contemporary S'A 1< %ours !essage exchange .atternsG Ser&ice acti&ityG CoordinationG #tomic TransactionsG 8usiness acti&itiesG /rchestrationG Choreogra.hy. #ddressingG ;eliable messagingG CorrelationG PolicesG !etadata exchangeG SecurityG Noti-ication and e&enting 0rinciples of Ser1ice H 'rientation ? %ours Ser&ices(orientation and the enter.riseG #natomy o- a ser&ice(oriented architectureG Common Princi.les oSer&ice(orientationG Ho9 ser&ice orientation .rinci.les inter(relateG Ser&ice(orientation and object( orientationG Nati&e Web ser&ice su..ort -or ser&ice(orientation .rinci.les. Ser1ice (ayers > %ours Ser&ice(orientation and contem.orary S/#G Ser&ice layer abstractionG #..lication ser&ice layerA 8usiness ser&ice layerA /rchestration ser&ice layerG #gnostic ser&icesG Ser&ice layer con-iguration scenarios ,usiness 0rocess .esi3n ? %ours WS(8PE4 language basicsG WS(Coordination o&er&ie9G Ser&ice(oriented business .rocess designG WS( addresing language basicsG WS(;eliable!essaging language basics S'A 0latforms S/# .lat-orm basicsG S/# su..ort in <+EEG S/# su..ort in .NETG "ntegration considerations $e;t ,oo7s2 $. Thomas ErlE Ser&ice(/riented #rchitecture = Conce.tsA TechnologyA and EducationA +%%*. > %ours

esignA Pearson

444
"eference ,oo7s2 $. Eric Ne9comerA >reg 4omo9E 1nderstanding S/# 9ith Web Ser&icesA Pearson educationA +%%*. Wireless &et=or7s and Mobile Computin3 Sub5ect Code2 10MCA88: %ours9Wee72 0: $otal %ours2 82 A Mar7s2 80 !;am %ours2 0< !;am Mar7s2 100 > %ours esign Considerations -or

Mobile Computin3 Architecture2 Ty.es o- Net9orksA #rchitecture -or !obile Com.utingA )(tier #rchitectureA !obile Com.utingA

Wireless &et=or7s H 12 )SM and SMS ? %ours >lobal Systems -or !obile Communication C >S! and Short Ser&ice !essages C S!SDE >S! #rchitectureA EntitiesA Call routing in >S!A P4!N "nter-aceA >S! #ddresses and "dentitiesA Net9ork #s.ects in >S!A !obility !anagementA >S! ,reBuency allocation. "ntroduction to S!SA S!S #rchitectureA S! !TA S! !/A S!S as "n-ormation bearerA a..lications Wireless &et=or7s H 22 )0"S > %ours >P;S and Packet ata Net9orkA >P;S Net9ork #rchitectureA >P;S Net9ork /.erationsA ata Ser&ices in >P;SA #..lications -or >P;SA 8illing and Charging in >P;S Wireless &et=or7s H <2 C.MA+ <) and WiMA/ S.read S.ectrum technologyA "S(7*A C !# &ersus >S!A Wireless #..lications on )>A "ntroduction to Wi!#@. ? %ours ataA Third >eneration Net9orksA

Mobile Client > %ours !o&ing beyond deskto.A !obile handset o&er&ie9A !obile .hones and their -eaturesA P #A esign Constraints in a..lications -or handheld de&ices. !obile "PE "ntroductionA disco&eryA ;egistrationA TunnelingA Cellular "PA !obile "P 9ith "P&3 Mobile 'S and Computin3 !n1ironment ? %ours Smart Client #rchitectureA The ClientE 1ser "nter-aceA ata StorageA Per-ormanceA ata Synchroni0ationA !essaging. The Ser&erE ata Synchroni0ationA Enter.rise ata SourceA !essaging. !obile /.erating SystemsE WinCEA Palm /SA Symbian /SA 4inuxA Pro.rietary /S Client e&elo.mentE The de&elo.ment .rocessA Need analysis .haseA esign .haseA "m.lementation and Testing .haseA e.loyment .haseA e&elo.ment ToolsA e&ice Emulators. ,uildin3+ Mobile nternet Applications > %ours Thin clientE #rchitectureA the clientA !iddle9areA messaging Ser&ersA Processing a Wireless reBuestA Wireless #..lications Protocol CW#PD /&er&ie9A Wireless 4anguagesE !arku. 4anguagesA H !4A W!4A HT!4A cHT!4A @HT!4A ?oice@!4. J2M! ? %ours "ntroductionA C CA C4 CA !" PG Programming -or C4 CA !" let modelA Pro&isioningA !" let li-e( cycleA Creating ne9 a..licationA !" let e&ent handlingA >1" in !" PA 4o9 le&el >1" Com.onentsA !ultimedia #P"sG Communication in !" PA Security Considerations in !" P. $e;t ,oo7s2 $. r. #shok TalukderA !s ;oo.a [a&agalA !r. Hasan #hmedE !obile Com.utingA TechnologyA #..lications and Ser&ice CreationA +d EditionA Tata !c>ra9 HillA +%$%. +. !artyn !allikE !obile and Wireless esign EssentialsA WileyA +%%). "eference ,oo7s2 $. ;aj kamalE !obile Com.utingA /x-ord 1ni&ersity PressA +%%5. +. "ti Saha !israE Wireless Communications and Net9orksA )> and 8eyondA Tata !c>ra9 HillA +%%7. Stora3e Area &et=or7s

444
Sub5ect Code2 10MCA888 %ours9Wee7 2 0: $otal %ours 2 82 6A6 Mar7s 2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction to nformation Stora3e and Mana3ement+ Stora3e System !n1ironment ? %ours "n-ormation StorageA E&olution o- Storage Technology and #rchitectureA ata Center "n-rastructureA Fey Challenges in !anaging "n-ormationA "n-ormation 4i-ecycle Com.onents o- Storage System En&ironmentA isk ri&e Com.onentsA isk ri&e Per-ormanceA ,undamental 4a9s >o&erning isk Per-ormanceA 4ogical Com.onents o- the HostA #..lication ;eBuirements and isk Per-ormance. .ata 0rotection+ ntelli3ent Stora3e system "m.lementation o- ;#" A ;#" #rray Com.onentsA ;#" 4e&elsA ;#" isk Per-ormanceA Hot S.ares Com.onents o- an "ntelligent Storage SystemA "ntelligent Storage #rray > %ours Com.arisonA ;#" "m.act on

.irect-Attached Stora3e+ SCS + and Stora3e Area &et=or7s ? %ours Ty.es o- #SA #S 8ene-its and 4imitationsA isk ri&e "nter-acesA "ntroduction to Parallel SCS"A /&er&ie9 o- ,ibre ChannelA The S#N and "ts E&olutionA Com.onents o- S#NA ,C Connecti&ityA ,ibre Channel PortsA ,ibre Channel #rchitectureA IoningA ,ibre Channel 4ogin Ty.esA ,C To.ologies. &AS+ 0 SA& > %ours >eneral = Pur.ose Ser&ice &s. N#S e&icesA 8ene-its o- N#SA N#S ,ile " / /A Com.onents o- N#SA N#S "m.lementationsA N#S ,ile(Sharing ProtocolsA N#S "// /.erationsA ,actors #--ecting N#S Per-ormance and #&ailability. iSCS"A ,C"P. Content-Addressed Stora3e+ Stora3e Virtuali@ation > %ours ,ixed Content and #rchi&esA Ty.es o- #rchi&eA ,eatures and 8ene-its o- C#SA C#S #rchitectureA /bject Storage and ;etrie&al in C#SA C#S Exam.les. ,orms o- ?irtuali0ationA SN"# Storage ?irtuali0ation TaxonomyA Storage ?irtuali0ations Con-igurationsA Storage ?irtuali0ation ChallengesA Ty.es o- Storage ?irtuali0ationA ,usiness Continuity+ ,ac7up and "eco1ery > %ours "n-ormation #&ailabilityA 8C TerminologyA 8C Planning 4i-ecycleA ,ailure #nalysisA 8usiness "m.act #nalysisA 8C Technology Solutions. 8acku. Pur.oseA 8acku. ConsiderationsA 8acku. >ranularityA ;eco&ery ConsiderationsA 8acku. !ethodsA 8acku. ProcessA 8acku. and restore /.erationsA 8acku. To.ologiesA 8acku. in N#S En&ironmentsA 8acku. Technologies. (ocal "eplication+ "emote "eplication ? %ours Source and TargetA 1ses o- 4ocal ;e.licasA ata ConsistencyA 4ocal ;e.lication TechnologiesA ;estore and ;estart ConsiderationsA Creating !ulti.le ;e.licasA !anagement "nter-aceA !odes o- ;emote ;e.licationA ;emote ;e.lication TechnologiesA Net9ork "n-rastructure. Securin3 the Stora3e nfrastructure+ Mana3in3 the Stora3e nfrastructure ? %ours Storage Security ,rame9orkA ;isk TriadA Storage Security omainsA Security "m.lementations in Storage Net9orking !onitoring the Storage "n-rastructureA Storage !anagement #cti&itiesA Storage "n-rastructure !anagement ChallengesA e&elo.ing an "deal Solution. $e;t ,oo7s2 $. >. SomasundaramA #lok Shri&asta&a CEditorsDE "n-ormation Storage and !anagementA E!C Education Ser&icesA Wiley( "ndiaA +%%7. "eference ,oo7s2 $. 1l- Tro..ensA ;ainer Erkens and Wol-gang !ullerE Storage Net9orks Ex.lainedA Wiley "ndiaA +%%). +. ;ebert S.aldingE Storage Net9orksA The Com.lete ;e-erenceA Tata !c>ra9 HillA +%%). ). ;ichard 8arker and Paul !assigliaE Storage #rea Net9orks Essentials # Com.lete >uide to 1nderstanding and "m.lementing S#NsA Wiley "ndiaA +%%+.

444
Web 260 and "ich nternet Applications Sub5ect Code2 10MCA88> %ours9 Wee72 0: $otal %ours2 82 A Mar7s2 80 !;am %ours2 0< !;am Mar7s2 100

ntroduction+ A5a; - 1 > %ours Web +.% and ;ich "nternet #..licationsA /&er&ie9 o- #jaxA Exam.les o- usage o- #jaxE 1.dating 9eb .age textA Chatting in real timeA ragging and dro..ingA o9nloading images. Creating #jax #..licationsE #n exam.leA #nalysis o- exam.le ajax.htmlA Creating the <a&aScri.tA Creating and o.ening the @!4Htt.;eBuest objectA ata do9nloadA is.laying the -etched dataA Connecting to the ser&erA #dding Ser&er(side .rogrammingA Sending data to the ser&er using >ET and P/STA 1sing #jax together 9ith @!4. A5a; H 2 ? %ours Handling multi.le @!4Htt.;eBuest objects in the same .ageA 1sing t9o @!4Htt.;eBuest objectsA 1sing an array o- @!4Htt.;eBuest objectsA 1sing inner -unctionsA o9nloading <a&aScri.tA connecting to >oogle SuggestA Creating google..h.A o9nloading -rom other domains 9ith #jaxA HT!4 header reBuest and #jaxA e-eating cachingA Exam.les. 8uilding @!4 and 9orking 9ith @!4 in <a&aScri.tA >etting the document elementA #ccessing any @!4 elementA Handling 9hites.ace in ,ire-oxA Handling cross(bro9ser 9hites.aceA #ccessing @!4 data directlyA ?alidating @!4A ,urther exam.les o- ;ich "nternet #..lications 9ith #jax. A5a; H < > %ours ra9ing userJs attention to do9nloaded textA Styling textA colors and background using CSSA Setting element location in the 9eb .agesA Setting the stacking order o- 9eb .age elementsA ,urther exam.les ousing #jax. is.laying all the data in an HT!4 -ormA Working 9ith PHP ser&er &ariablesA >etting the data in to array -ormatA Wra..ing a..lications in to a single PHP .ageA ?alidating in.ut -rom the userA ?alidating integers and textA /!A #..ending ne9 elements to a 9eb .age using the /! and #jaxA ;e.lacing elements using the /!A Handling timeouts in #jaxA o9nloading images 9ith #jaxA Exam.le .rograms. -le; - 1 ? %ours "ntroductionE 1nderstanding ,lex #..lication TechnologiesA 1sing ,lex ElementsA Working 9ith ata Ser&ices C4oading ata at ;untimeDA The i--erences bet9een Traditional and ,lex Web #..licationsA 1nderstanding Ho9 ,lex #..lications WorkA 1nderstanding ,lex and ,lash #uthoring. 8uilding #..lications 9ith the ,lex ,rame9orkE 1sing ,lex Tool SetsA Creating ProjectsA 8uilding #..licationsA e.loying #..lications ,rame9ork ,undamentalsE 1nderstanding Ho9 ,lex #..lications #re StructuredA 4oading and "nitiali0ing ,lex #..licationsA 1nderstanding the Com.onent 4i-e CyclesA 4oading /ne ,lex #..lication into #nother ,lex #..licationA i--erentiating 8et9een ,lash Player and the ,lex ,rame9orkA Caching the ,rame9orkA 1nderstanding #..lication omainsA 4ocali0ationA !anaging 4ayoutE ,lex 4ayout /&er&ie9A !aking ,luid "nter-acesA Putting "t #ll Together. -le; H 2 ? %ours !@!4E 1nderstanding !@!4 Syntax and StructureA !aking !@!4 "nteracti&e Working 9ith 1" Com.onentsE 1nderstanding 1" Com.onentsA 8uttonsA ?alue SelectorsA Text Com.onentsA 4ist(8ased ControlsA Po.(1. ControlsA Na&igatorsA Control 8ars Customi0ing #..lication #..earanceE 1sing StylesA Skinning com.onentsA Customi0ing the .reloaderA ThemesA ;untime CSS -le; - < > %ours #ctionScri.tE 1sing #ctionScri.tA !@!4 and #ctionScri.t CorrelationsA 1nderstanding #ctionScri.t SyntaxA ?ariables and Pro.ertiesA "nheritanceA "nter-acesA Handling E&entsA Error HandlingA 1sing @!4 -le; - : ? %ours !anaging StateE Creating StatesA #..lying StatesA e-ining StatesA #dding and ;emo&ing Com.onentsA Setting Pro.ertiesA Setting StylesA Setting E&ent HandlersA 1sing #ction Scri.ts to e-ine StatesA !anaging /bject Creation PoliciesA Handling State E&entsA 1nderstanding State 4i-e CyclesA When To 1se States. 1sing E--ects and TransitionsE 1sing E--ectsA Creating Custom E--ectsA 1sing TransitionsA Creating Custom Transitions.

444
-le; - 8 > %ours Working 9ith ataE 1sing ata !odelsA ata 8indingA Enabling ata 8inding -or Custom ClassesA ata 8inding Exam.lesA 8uilding data binding .roxies. ?alidating and ,ormatting ataE ?alidating user in.utA ,ormatting ata. $e;t ,oo7s2 $. Ste&en Hol0nerE #jaxE # 8eginnerJs >uideA Tata !c>ra9 HillA +%%7. C4isted to.ics -rom Cha.ters )A 'A 3A 5A $$A $+D +. Cha-ic Fa0on and <oey 4ottE Programming ,lex )A /J;eillyA +%%7. C4isted to.ics -rom Cha.ters $ to 6A $+ to $*D "eference ,oo7s2 $. >etting Started 9ith ,lex )A <ack Herrington and Emily FimA /J;eillyA $st EditionA +%%6. +. ,lex )E # 8eginnerJs >uideA !ichele E. a&is and <ohn #. Philli.sA Tata !c>ra9(HillA +%%6. ). Essential #ctionscri.t ).% = Colin !oockA /J;eilly PublicationsA +%%5. '. Pro-essional #jaxA Nicholas C Iakas et alA Wrox PublicationsA +%%3.

Soft=are .esi3n (aboratory Sub5ect Code2 10MCA8> %ours9Wee72 < $otal %ours2 :2 6A Mar7s2 80 !;am %ours2 0< !;am Mar7s2 80

The student has to dra9 the necessary analysis and design diagrams in 1!4A using any suitable 1!4 ra9ing Tool and im.lement in <a&a /; C:: /; C_ a .rogram to demonstrate the esign Pattern s.eci-ied by the Examiner. ,or each .atternA an exam.le is listed here. %o=e1er+ student is free to choose to sol1e any suitable problem to demonstrate the specified pattern6 $he .esi3n 0attern is allotted based on lots from the follo=in3 list2 $D Publisher(Subscriber Exam.leE #n embedded a..licationG #n interru.t(dri&en module kee.s track o- tem.erature o- the -urnace. When the tem.erature is beyond .reset u..er / lo9er limitsA a module that controls the heating element must be in-ormed. #nother module that dis.lays an indicator also needs to kno9 osuch a change. ,urtherA a log module also needs this in-ormation. +D Command Processor Exam.leE # sim.le Text EditorG ,acilities .ro&ided include making the text boldA making the text in to all u..er caseG #n 1ndo -eature is to be im.lemented. )D ,or9arder(;ecei&er Exam.leE # sim.le .eer(to(.eer message exchange scenarioG 1nderlying communication .rotocol is TCP/"P. 'D Client( is.atcher(Ser&er Exam.leE # sim.li-ied im.lementation o- ;PC *D Proxy Exam.leE # highly sim.li-ied im.lementation o- a .roxy 9eb ser&er. 3D Whole(Part Exam.leE "m.lementation o- any collection like a set. 5D !aster(Sla&e Exam.leE # multithreaded im.lementation o- any .aralleli0ed di&ide(and(conBuer algorithm 6&et (aboratory Sub5ect Code2 10MCA8? %ours9Wee72 < $otal %ours2 :2 $. 6A Mar7s2 80 !;am %ours2 0< !;am Mar7s2 80

Write a Program in C_ to Check 9hether a number is Palindrome or not.

444
+. ). '. *. 3. 5. 6. 7. Write a Program in C_ to demonstrate Command line arguments Processing. Write a Program in C_ to -ind the roots o- Huadratic EBuation. Write a Program in C_ to demonstrate boxing and un8oxing. Write a Program in C_ to im.lement Stack o.erations. Write a .rogram to demonstrate /.erator o&erloading. Write a Program in C_ to -ind the second largest element in a single dimensional array. Write a Program in C_ to multi.ly to matrices using ;ectangular arrays. ,ind the sum o- all the elements .resent in a jagged array o- ) inner arrays. handling.

$%. Write a .rogram to re&erse a gi&en string using C_. $$. $$. 1sing TryA Catch and ,inally blocks 9rite a .rogram in C_ to demonstrate error $+. $). esign a sim.le calculator using S9itch Statement in C_. emonstrate 1se o- ?irtual and o&erride key 9ords in C_ 9ith a sim.le .rogram

$'. "m.lement linked lists in C_ using the existing collections name s.ace. $*. Write a .rogram to demonstrate abstract class and abstract methods in C_. $3. Write a .rogram in C_ to build a class 9hich im.lements an inter-ace 9hich is already existing. $5. Write a .rogram to illustrate the use o- di--erent .ro.erties in C_. $6. emonstrate arrays o- inter-ace ty.es 9ith a C_ .rogram. &ote2 n the e;amination each student pic7s one Cuestion from the lot of all 1B Cuestions6

Mini 0ro5ect Sub5ect Code2 10MCA8B 6A Mar7s2 80 %ours9Wee72 < !;am %ours2 0< $otal %ours2 :2 !;am Mar7s2 80 &'$!S2 # team o- $W' students must de&elo. the mini .roject. Ho9e&erA during the examinationA each student must demonstrate the .roject indi&idually. The team may im.lement a mini .roject o- their choice. The team must submit a ,rief 0ro5ect "eport C+* to )% PagesD that must include the -ollo9ingE o "ntroduction o ;eBuirements o So-t9are e&elo.ment Process !odel #do.ted o #nalysis and esign !odels o "m.lementation o Testing The ;e.ort must be e&aluated -or $% marksA emonstration -or )% marks and ?i&a -or $% marks.