MASTER OF COMPUTER APPLICATIONS - MCA Course Structure and Scheme of Examination !e!f !e!f "#$%-$&
FIRST YEAR – FIRST SEMSTER Sub Code MCA1 MCA101 01
Name of the Subject Subject
MCA102
Fund Fundam amen enta tals ls of Computers Programming with C
MCA103 MCA10 MCA104 4
Int. Ext. Tota Marks Marks Marks 30 70 100
No of Cred!ts 4
"ours# $eek 4
30
70
100
5
4
Computer Organiation
30
70
100
5
4
!is" !is"re rete te Math Mathem emati ati"a "al l
30
70
100
5
4
30
70
100
4
4
MCA10%
A""o A""oun unta tan" n"$ $ and and Finan"ial Management PC #oftware &a'
30
70
100
3
%
MCA107
C Programming &a'
30
70
100
3
%
MCA10(
#eminar
50
))
50
1
3
'( )
*+)
, -)
)
-
#tru"tures MCA1 MCA105 05
T %T A &
FIRST YEAR – SEC%N/ SEMSTER Sub Code
Name of the Subject Subject
Int. Marks
Ext. Tota Mark Marks s 70 100
No of Cred!ts
"ours# $eek
4
4
MCA201
&anguage Pro"essors
30
MCA MCA202
30
70
100
5
4
30
70
100
5
4
30
70
100
5
4
30
70
100
4
4
30
70
100
3
%
MCA207
!ata *a *ase Ma Management #$stems !ata !ata #tru #tru"t "tur ures es usin using g C++ Operating #$stem Prin"iples Pro'a'ilit$ , #tatisti"s !ata !ata #tru #tru"t "tur ures es usin using g C++ &A* !*M# &A*
30
70
100
3
%
MCA20(
Communi"ation #-ills
50
))
50
1
3
'()
*+ )
,-)
)
-
MCA2 MCA203 03 MCA MCA204 MCA205 MCA2 MCA20% 0%
T% T A&
SEC%N/ YEAR – T"IR/ SEMSTER Sub Code
Name of the Subject Subject
MCA301
O'.e"t Ori Oriented Programming through /AA Computer etwor-s Operations esear"h Computer raphi"s Artifi"ial ntelligen"e /aa Programming &a' 6ni 6ni #hel #hell l Prog Progra ramm mmin ing g &A* #eminar
MCA302 MCA303 MCA304 MCA305 MCA30% MCA3 MCA307 07 MCA30(
Int. Ext. Tota Marks Marks Marks
T %T A &
30
70
100
No of Cred!ts 5
"ours# $eek
30 30 30 30
70 70 70 70
100 100 100 100
5 4 5 4
4 4 4 4
30 30
70 70
100 100
3 3
% %
50
))
50
1
3
'( )
*+ )
,-)
)
-
"ours# $eek
4
SEC%N/ YEAR – F%0RT" SEMSTER Sub Code
Name of the Subject Subject
MCA401
Prin"iples of Programming &anguages O'.e"t Oriented Modeling and !esign 6sing 6M& 8e' 9e"hnologies #oftware :ngineering rid and Cluster Computing
MCA402
MCA403 MCA404 MCA405;1 405;2
Cr$ptograph$ Cr$ptograph$ and etwor-s #e"urit$
405;3
#imulation Modeling and Anal$sis 8e' 9e"hnologies &a' isual Programming &a' #oft s-ills T % TA &
MCA40% MCA407 MCA40(
Int. Ext. Tota Marks Marks Marks
30
70
100
No of Cred!ts 4
30
70
100
5
4
30 30 30
70 70 70
100 100 100
5 5 4
4 4 4
30 30 50 ' ()
70 70 )) *+ )
100 100 50 ,-)
3 3 1 )
% % 3 -
4
T"IR/ YEAR – FIFT" SEMSTER Sub Code Name of the Subject Subject
MCA501 MCA502 MCA503
!ata 8are
MCA504;1
of Algorithms :m'edded #$stems
Int. Marks
Ext. Tota Marks Marks
30
70
100
No of Cred!ts 5
"ours# $eek
30 30
70 70
100 100
5 5
4 4
30
70
100
4
4
4
SEC%N/ YEAR – T"IR/ SEMSTER Sub Code
Name of the Subject Subject
MCA301
O'.e"t Ori Oriented Programming through /AA Computer etwor-s Operations esear"h Computer raphi"s Artifi"ial ntelligen"e /aa Programming &a' 6ni 6ni #hel #hell l Prog Progra ramm mmin ing g &A* #eminar
MCA302 MCA303 MCA304 MCA305 MCA30% MCA3 MCA307 07 MCA30(
Int. Ext. Tota Marks Marks Marks
T %T A &
30
70
100
No of Cred!ts 5
"ours# $eek
30 30 30 30
70 70 70 70
100 100 100 100
5 4 5 4
4 4 4 4
30 30
70 70
100 100
3 3
% %
50
))
50
1
3
'( )
*+ )
,-)
)
-
"ours# $eek
4
SEC%N/ YEAR – F%0RT" SEMSTER Sub Code
Name of the Subject Subject
MCA401
Prin"iples of Programming &anguages O'.e"t Oriented Modeling and !esign 6sing 6M& 8e' 9e"hnologies #oftware :ngineering rid and Cluster Computing
MCA402
MCA403 MCA404 MCA405;1 405;2
Cr$ptograph$ Cr$ptograph$ and etwor-s #e"urit$
405;3
#imulation Modeling and Anal$sis 8e' 9e"hnologies &a' isual Programming &a' #oft s-ills T % TA &
MCA40% MCA407 MCA40(
Int. Ext. Tota Marks Marks Marks
30
70
100
No of Cred!ts 4
30
70
100
5
4
30 30 30
70 70 70
100 100 100
5 5 4
4 4 4
30 30 50 ' ()
70 70 )) *+ )
100 100 50 ,-)
3 3 1 )
% % 3 -
4
T"IR/ YEAR – FIFT" SEMSTER Sub Code Name of the Subject Subject
MCA501 MCA502 MCA503
!ata 8are
MCA504;1
of Algorithms :m'edded #$stems
Int. Marks
Ext. Tota Marks Marks
30
70
100
No of Cred!ts 5
"ours# $eek
30 30
70 70
100 100
5 5
4 4
30
70
100
4
4
4
504;2 504;3 MCA505;1 505;2 505;3 MCA 50% MCA 507 MCA 50(
Mo'ile Computing Cloud Computing mage Pro"essing Mi"ropro"essors and nterfa"ing 8e' :ngineering ;et Programming &a' Adan"ed /aa &a' #eminar T % TA &
30
70
100
4
4
30 30 50 '( )
70 70 )) *+)
100 100 50 , -)
3 3 1 )
% % 3 -
T"IR/ YEAR 1 SI2T" SEMSTER Sub Code
MCA%01
Name of the Subject Pro.e"t 8or-
Int. Marks
))
Ext. Marks
150
Tota Marks
150
No of Cred!ts 10
"ours# $eek
Fie Months !uration
T%TA& MAR3S F%R T"E MCA C%0RSE T%TA T%TA& & CRE/ CRE/IT ITS S
F%R F%R T"E T"E MCA MCA C%0R C%0RSE SE
4 +)) 4 5() 5()
MCA 5)54 INF%RMATI%N TEC"N%&%6Y 0n!t – I 7us!ness and !nformat!on technoo89 7us!ness !n the !nformat!on a8e4 Pressures and responses= wh$ $ou need to -now a'out nformation 9e"hnolog$= what is an nformation #$stem> Informat!on technoo8!es !n the modern or8an!:at!on 7as!c conce;ts of !nformat!on s9stems or8an!:at!ons4 #tru"ture and 9 support= 9 support at different organiational leels= managing nformation 9e"hnolog$ in organiations= 9 people and "areers; 0n!t –II Com;uter hard
of hardware= the "entral "omputer hierar"h$= input
histor$ and Com;uter soft
signifi"an"e= s$stem issues= programming
Mana8!n8 or8an!:at!ona data and !nformat!on4 *asi"s of data arrangement and a""ess= the traditional file enironment= !ata'ases ? 9he modern approa"h= data'ase management s$stem= logi"al data models= data warehouses 0n!t – III
9he 9ele"ommuni"ations s$stem= Teecommun!cat!ons and net= the eolution of the nternet= the operation of the nternet= seri"es proided '$ the nternet= the 8orld 8ide 8e'= nternet Challenges= ntranets= :tranets= :nterprise information proto"ols= 9he Mo'ile nternet 0n!t – I> Funct!ona= Enter;r!se= and Inter %r8an!:at!ona S9stems4 nformation #$stems to support 'usiness fun"tions= transa"tion pro"essing; nformation s$stems= a""ounting and finan"e s$stems= mar-eting and sales s$stems= produ"tion and operations management s$stems= human resour"es management s$stems= integrated information s$stems and enterprise resour"e planning= inter organiational @glo'al information s$stems
Eectron!c Commerce4 Oeriew of : ? "ommer"e= 'usiness ? to ? "onsumer appli"ations= mar-et resear"h= adertising= and "onsumer seri"e= 'usiness ? to ? 'usiness "olla'oratie "ommer"e appli"ations= innoatie appli"ations of : ? "ommer"e= infrastru"ture and : ? "ommer"e support seri"e Com;uter based su;;9 cha!n mana8ement and !nformat!on s9stems !nte8rat!on4 #uppl$ "hain and their management= suppl$ "hain pro'lems and solutions= 9 suppl$ "hain support and s$stems integration /ata= 3no<ed8e= and /ec!s!on su;;ort4 Management and de"ision ma-ing= data transformation and management= de"ision support s$stems
?rescr!bed 7ook4
:FAM 9ur'an= ; ell$ ainer= i"hard :; Potter= BIntroduct!on to Informat!on Technoo89 = .ohn wile$ D200(E= "hapters 1 to = 10;1= 10;2= 10;3 and 11;1= 11;2= 11;3; Reference 7ooks4
1; 9& :du"ation #olutions &td;= Bntrodu"tion 9e"hnolog$= Pearson ndia D200(E;
to
nformation
2; !e'orah Morle$= Charless #; Par-er= B6nderstanding Computers 9oda$ and 9omorrow= 11th edition= 9homson D2007E; 3; A-so$= !eardis= Bntrodu"tion Cengage &earning D200(E;
to
nformation
9e"hnolog$=
4; A.o$ umar a$= 9in-u A"har$a= Bnformation 9e"hnolog$= P<;
Mode ?a;er MCA 5)54 Informat!on Technoo89 T!me4 "rs
Max. Marks4 ,) Sect!on – A
Ans D"E8hat are the "hara"teristi"s of Multimedia te"hnolog$> DdE8hat is networ-> DeE!ifferentiate 'etween the ntranet and the :tranet; DfE8hat do $ou mean '$ Glo'al nformation #$stemH> DgE!efine : ? "ommer"e and distinguish it from : ? 'usiness; Sect!on – 7 Ans
7M 7M
orB
D"E:numerate the different organiational responses with respe"t to nformation 9e"hnolog$; 7M DdE:plain the following; 7M DiE 9ransa"tion pro"essing s$stem; DiiE Management information s$stem; 0n!t –II . DaE :plain the t$pes of memor$ aaila'le and "ompare the effi"ien"$ of storing information on ea"h of these dei"es; 7M D'E*riefl$ eplain the issues asso"iated with "omputer software; 7M orB
D"E!is"uss arious leels of "omputer languages namel$ Ma"hine language= Assem'l$ language and :plain; 7M 0n!t –III
*. DaE!is"uss a'out arious t$pes of transmission medium used for tele"ommuni"ations; D'E8hat are different nternet appli"ations and seri"es;
7M 7M
orB
D"E8hat is a networ- topolog$> And what are the different t$pes of networ- topologies> 7M DdE :plain the following terms; 7M DiE nternet DiiE 6& DiiiE888 DiE <99P 0n!t – I> -. DaE!is"uss arious a"tiities of the <M department; 7M D'E!efine suppl$ "hain and des"ri'e the "omponents of a suppl$; 7M orB
D"E:plain the arious t$pes of : ? "ommer"e; DdE:plain the two phases of management de"ision ma-ing;
MCA 5)'4 ?R%6RAMMIN6 $IT" C
7M 7M
0n!t1I Introductor9 Conce;ts4 9$pes of Programming &anguages= ntrodu"tion to C= !esira'le Program Chara"teristi"s Introduct!on to C ?ro8ramm!n84 9he C Chara"ter #et= 8riting First Program of C= dentifiers and e$words= !atat$pes= Constants= aria'les and Arra$s= !e"larations= :pressions #tatements= #$m'oli" Constants %;erators and Ex;ress!ons4 Arithmeti" Operators= 6nar$ Operators= elational and &ogi"al Operators= Assignment Operators= 9he Conditional Operator= &i'rar$ Fun"tions; /ata In;ut and %ut;ut4 Preliminaries= #ingle Chara"ter nput)9he et"har Fun"tion= #ingle Chara"ter Output ? 9he Put"har Fun"tion= :nter nput !ata ? 9he #"anf Fun"tion= More A'out the #"anf Fun"tion= 8riting Output !ata ? 9he Printf Fun"tion= More A'out the Printf Fun"tion= 9he ets and Puts Fun"tions
I Planning a C Program= ?re;ar!n8 and Runn!n8 A Com;ete C ?ro8ram 8riting a C Program= :rror !iagnosti"s= !e'ugging 9e"hniJues 0n!t1II Contro Statements4 Preliminaries= *ran"hingI 9he F):&#: #tatement= &oopingI 9he while #tatement= More &oopingI 9he do)while #tatement= #till More &oopingI 9he for #tatement= ested Control #tru"tures= 9he #wit"h #tatement= 9he 'rea- #tatement= 9he "ontinue #tatement= 9he "omma #tatement= 9he goto #tatement; Funct!ons4 A *rief Oeriew= !efining a Fun"tion= A""essing a Fun"tion= Fun"tion Protot$pes= Passing Arguments to a Fun"tion= e"ursion ?ro8ram Structure4 #torage Classes= Automati" aria'les= :ternal Dlo'alE aria'les= #tati" aria'les; 0n!t1III Arra9s4 !efining an Arra$= Pro"essing an Arra$= Passing Arra$s to Fun"tions= Multidimensional Arra$s= Arra$s and #trings ?o!nters4 Fundamentals= Pointer !e"larations= Passing Pointers to a Fun"tion= Pointers and One)dimensional Arra$s= !$nami" Memor$ Allo"ation= Operations on Pointers= Pointers and Multidimensional Arra$s= Arra$s of Pointers= Passing Fun"tions to Other Fun"tions Structures and 0n!ons4 !efining a #tru"ture= Pro"essing a #tru"ture= 6ser)defined !ata 9$pes D9$pedefE= #tru"ture and Pointers= Passing #tru"tures to Fun"tions= #elf)referential #tru"tures= 6nions
/ata F!es4 8h$ Files= Opening and Closing a !ata File= eading and 8riting a !ata File= Pro"essing a !ata File= 6nformatted !ata Files= Con"ept of *inar$ Files 0n!t1I> &o<1&ee ?ro8ramm!n84 egister aria'les= *itwise Operations= *it Fields
:numerations= Command &ine Some Add!t!ona Features of C4 Parameters= More A'out &i'rar$ Fun"tions= Ma"ros= 9he C Pro"essor A;;end!x " &!brar9 Funct!ons
?rescr!bed 7ook4
*$ron # ottfriend= BProgramming with C= #e"ond :dition= #"haum Out &ines= 9A9A M" raw
1; *ehrou$ A; Foreu$an , i"hard F; il'erg= BComputer #"ien"e A stru"tured programming Approa"h using C= 9hird :dition= Cengage &earning D200(E; 2;
with
A#
and
9ur'o
C=
4; Mullish Cooper= B9he #pirit of C ? An ntrodu"tion to Moderen Programming= /ai"o *oo-s D200%E
Mode ?a;er MCA 5)'4 ?ro8ramm!n8 !n DC T!me4 "rs
Max. Marks4 ,)
Ans
,M ,M ,M ,M
0n!t –II . DaE:plain loop stru"tures in GCH; D'E8rite a program for sum of digits of a num'er and no;of digits a num'er; DorE D"E8rite a'out different storage "lasses in GCH; DdE8rite a program to pass n arguments to a fun"tion and return aerage of n alues;
,M in ,M ,M ,M
0n!t –III *. DaE:plain de"laration= a""essing and pro"essing of two dimensional arra$s in GCH; ,M D'E8rite a program to sort strings using pointers; ,M DorE D"E 8hat is a pointer > 8hat are the adantages of pointers>
0n!t – I>
-. DaE:plain File pro"essing in GCH; ,M D'E8rite a program to update a re"ord in a file; ,M DorE D"E8ith eamples eplain different pre)pro"essor dire"ties; ,M DdE8rite a program to "al"ulate no;of owels= words in a gien tet; ,M
K K K K K
MCA 5)4 C%M?0TER %R6ANIATI%N 0n!t1I /!8!ta &o8!c C!rcu!ts4 !igital Computers= &ogi" ates= *oolean Alge'ra= Map #implifi"ation= Com'inational Cir"uits= Flip)Flops= #eJuential Cir"uits; /!8!ta Com;onents4 ntegrated Cir"uits= !e"oders= Multipleers= egisters= #hift egisters= *inar$ Counters= Memor$ 6nit; /ata Re;resentat!on4 !ata 9$pes= Complements= Fied Point epresentation= Floating Point epresentation= Other *inar$ Codes= error !ete"tion Codes; DChaptersIE 0n!t1II Re8!ster Transfer and M!croo;erat!ons4 egister 9ransfer &anguages= egister 9ransfer= *us and Memor$ 9ransfer= Arithmeti" Mi"ro Operations= &ogi" Mi"ro Operations= #hift Mi"ro Operations= Arithmeti" &ogi" #hift 6nit 7as!c Com;uter %r8an!:at!on and /es!8n4 nstru"tion Codes= Computer egisters= Computer nstru"tions= 9iming and Control= nstru"tion C$"le= Memor$ eferen"e nstru"tions= nput)Output and nterrupt; DChaptersI 0n!t1III M!cro;ro8rammed Contro4 Control Memor$= Address #eJuen"ing= Mi"ro Program :ample= !esign of Control 6nit; Centra ?rocess!n8 0n!t4 ntrodu"tion= eneral Organiation= #ta"- Organiation= nstru"tion Format= Modes= !ata 9ransfer and Manipulation= Program Control; DChaptersI
egister Addressing
0n!t1I> Com;uter Ar!thmet!c4 Addition= #u'tra"tion= Multipli"ation= !iision Algorithms= Floating Point Arithmeti" Operations;
Peripheral !ei"es= nput)Output In;ut1%ut;ut %r8an!:at!on4 nterfa"e= As$n"hronous !ata 9ransfer= Modes of 9ransfer= Priorit$ nterrupt; Memor9 %r8an!:at!onI Memor$
Main
Memor$=
Auiliar$
?rescr!bed 7ook4
M;Morris Mano= BComputer #$stem Ar"hite"ture= 3rd :dition= Pearson :du"ation D200(E; Cha;ters 4 1=2=3= 4= 5;1 to 5;7= 7= (;1 to (;7= 10;2 to 10;5= 11;1 to 11;5= 12;1 to 12;5 Reference 7ooks4
1; ; a.araman= 9; adha rishnan= BComputer Organiation and Ar"hite"ture= P< 2; *ehroo Parhami= BComputer Ar"hite"ture= Oford D2007E 3; #! group= BComputer Organiation= a"e series= 9M< D2007E 4; 8illiam #tallings= BComputer Organiation and Ar"hite"ture ? !esigning for Performan"e= Pearson :du"ation D2005E 5; P;Cha-ra'ort$= BComputer Ar"hite"ture and Organiation= /ai"o *oo-s D200(E
Mode ?a;er MCA 5)4 Com;uter %r8an!:at!on T!me4 hours Max!mum4 ,) Marks. Ans
0n!ersa &o8!c 8ate. Tr!state 7uffer. Interru;t C9ce. RISC Character!st!cs. Assoc!at!e Memor9. ?erform (,B – *'B !n b!nar9 us!n8 's com;ement method. Instruct!on Format. Foat!n8 ;o!nt re;resentat!on.
0NIT1I '. aB S!m;!f9 the foo
0NIT1II . aB Ex;a!n about Instruct!on c9ce !n deta!. bB Ex;a!n ar!ous Memor9 reference !nstruct!ons. orB cB Ex;a!n an9 one sta8e of ar!thmet!c o8!c sh!ft un!t. dB $hat are ar!ous o8!c m!cro o;erat!ons and the!r !m;ementat!onL 0NIT1III *.aB Ex;a!n d!fferent address!n8 modes
( A + B ) ( C + D ) (A + C) 0NIT1I>
-.aB Ex;a!n 7ooth mut!;!cat!on A8or!thm
MCA 5)*4 /ISCRETE MAT"EMATICA& STR0CT0RES 0NIT1I4
Propositional &ogi" ? The Foundat!ons4 &o8!c and ?roofs4 Propositional :Juialen"es ? Predi"ates and Luantifiers ? ested Luantifiers ? ules of nferen"e ? ntrodu"tion to Proofs ? Proof Methods and #trateg$ 7as!c Structures4 Sets= Funct!ons= Se@uences and Sums4 #ets ? #et Operations ? Fun"tions ? #eJuen"es and #ummations The Fundamentas 4 A8or!thms = The Inte8ers and Matr!ces4 Algorithms ? 9he rowth of Fun"tions ? Compleit$ of Algorithms ? 9he ntegers And !iisions ? Primes and reatest Common !iisors ? ntegers and Algorithms ? Appli"ations of um'er 9heor$ ? Matri"es Introduct!on and Recurs!on I Mathemati"al ndu"tion ? #trong ndu"tion and 8ell)Ordering ? e"ursie !efinitions and #tru"tural ndu"tion ? e"ursie Algorithms ? Program Corre"tness 0NIT1II4 Count!n84 9he *asi"s of Counting ? 9he Pigeon 4 Trees4 ntrodu"tion to 9rees ? Appli"ations of 9raersal ? #panning 9rees ? Minimum #panning 9rees
9rees
7ooean A8ebraI *oolean Fun"tions ? epresenting Fun"tions ? &ogi" ates ? Minimiation of Cir"uits
?
9ree
*oolean
?rescr!bed 7ook4
enneth < osen= B!is"rete %th :dition= M"raw)
Mathemati"s
,
its
Appli"ations=
Cha;ters 4 1 to 10 Reference 7ooks4
1; alph P; rimaldi= *;; amana= B!is"rete and Com'inational Mathemati"s= 5th :dition= Pearson :du"ation D200(E; 2; #wapan umar #ar-ar= BA 9et *oo- of #;Chand D200(E; 3; !;#;Mali- and M;;#en= 9homson D200%E;
B!is"rete
!is"rete Mathemati"s=
Mathemati"al
#tru"tures=
Mode ?a;er MCA 5)*4 /!screte Mathemat!ca Structures T!me4 hours Ans
Max!mum4 ,) M. , x ' G 5* M * x 5* G -( M
5. aB F!nd the truth tabe of the ;ro;os!t!on ; @B ; ; and r are true and @ !s fase. 1 2 2 (b) Find the inverse of A = 2 3 0 0 1 2
rB !s
cB Ex;ress the !nte8er '- as a ;roduct of ;o
0NIT1I '. aB >er!f9
. aB Sho< that !f an9 f!e numbers from 5 to J are choosen then t
0NIT1III
*. aB
!B /ef!ne !rrefex!e reat!on 8!e an exam;e. !!B /eterm!ne
bB
&et A G 5='==* RG5='B '=B =*B '=5B F!nd the trans!t!e cosure of 3. orB cB Check
dB
Sho< that the sum of a ertex de8ree !s e@ua to t
-. aB Sho< a tree
cB 0se 31ma; for the ex;ress!on to f!nd a m!n!ma sum of ;roducts fa=b=cB G )=5=*=(B. dB 0se Hu!ne – mccusk9 to f!nd m!n!ma ex;ress!on for fa=b=cB G )='==,B
MCA 5)-4 ACC%0NTIN6 AN/ FINANCIA& MANA6EMENT 0NIT I4 Cost A""ounting 1;1A""ounting "on"epts 1;2!ou'le entr$ s$stem 1;3 /ournal)ledger= trial 'alan"e= preparation of final a""ounts Dpro'lemsE 1;4ature of finan"ial statement)preparation of trading)profit and loss a""ounts)'alan"e sheet of .oint sto"- "ompanies 0NIT II4 Cost A""ounting 1;1 "ost sheet 1;2 marginal "osting Dpro'lemsE 1;3 'udget and 'udgetar$ "ontrol 1;4 standard "osting DPro'lemsE 0NIT III4 Finan"ial Management 3;1 nature and s"ope of finan"e fun"tion)goals of finan"ial management)modern "on"ept of finan"e fun"tion; 3;2 ature of finan"ial de"isionsI "on"ept)ma.or finan"ial de"ision areas)inestment de"ision)finan"ing de"ision and diidend de"ision; 3;3Finan"ial anal$sisI "on"ept of finan"ial anal$sis)t$pes of anal$sis)ta'les of anal$sis)ratio anal$sis)ta'les of anal$sis)funds flow and "ash flow anal$sis DPro'lemsE 0NIT I>4 8or-ing "apital management 4;1 "on"epts of wor-ing "apital)importan"e of wor-ing "apital) "omponents of wor-ing "apital)determination of wor-ing "apital)sour"e of wor-ing "apital; 4;2 nentor$ management)a""ounts of re"eia'le management)"ash management 4;3 Fore"asting of wor-ing "apital management ?rescr!bed 7ook4
;a.eswara ao , ;Prasad= A""ounting pu'lishers= 2002 DChapters 1 to 1E
and
Reference 7ooks4 1; anherne , /ames C= /ohn M;8a"hewie Finan"ial management= P<= 2002
finana"e=
/;;=
/ai'harath
Fundamentals
of
2;
for
Management=
9hird
4; Paresh #hah= B*asi" Finan"ial A""ounting for Management= Oford
Mode ?a;er MCA 5)-4 Account!n8 and F!nanc!a Mana8ement T!me4 hours Max!mum4 ,) M Ans "E et present alue; dE 8hat is *;:;P > eE 6ses of "ash flow anal$sis; fE #ignifi"an"e of Gatio Anal$sisH; gE Funds flow anal$sis; 0NIT – I
2;
aE From the following 9rial *alan"e prepare 9rading and Profit and &oss A""ount for the $ear ended 31st Mar"h 200(; ?art!cuars
/eb!t Cred!t s; s; Opening #to"51=000 ))) Capital ))) 72=000 Pur"hases 2=50=000 ))) #ales ))) 4=00=000 Carriage inwards 12=000 8ages 50=000 #alaries 2%=000 Commission 3=000 *ad de'ts 2=000 nsuran"e 4=000 ent= ates and 9aes 12=000 Postage and 9elegram 2=(00 Carriage outwards 7=700 Ma"hiner$ 40=000 Furniture 5=000 !e'tors %0=000 Creditors ))) 53=500 )))))))))))) )))))))))))) 5=25=500 5=25=500 )))))))))))) )))))))))))) Additional information I DiE #to"- on 31)3)2007 was s;%0=000; DiiE !epre"iation on furniture is "harged at 10; DiiiE Out standing salaries s;4=000; DiE *ad de'ts s;1=000; DE esere for dou'tful de'ts N 5 on de'tors; DorE 'E
0NIT – II
3; aE From the following parti"ulars $ou are reJuired to Cal"ulate iE P@ atio iiE *:P for sales iiiE #ales reJuired to earn a profit s;40=000; DiE Margin of saft$ in se"ond $ear; ear #ales Profit s; s; 200% 2=40=000 1(=000 2007 2=(0=000 2%=000 DorE 'E !efine the terms G*udget and 'udgetar$ "ontrolH; Main o'.e"ties of 'udgetar$ "ontrol s$stem;
8rite
0NIT1III
4; aE !efine Finan"e fun"tion; finan"ial Manager> :plain;
8hat are the
fun"tions
of a
DorE 'E From the following information prepare a statement of *alan"e #heet; Current atio 2;5= &iJuidit$ ratio 1;5 Proprietar$ ratio 0;75 DFied assets @ Proprietar$ fundE 8or-ing Capital s;%0=000; eseres and surplus I s;40=000 9here is no long term loan; 0NIT1I>
5; aE!efine wor-ing "apital "on"epts; 8hat are the determinants of wor-ing "apital of a manufa"turing "ompan$ > DorE 'E :plain the "on"ept of wor-ing "apital; 8hat are the arious sour"es of wor-ing "apital> ie eamples for long term sour"es and short term sour"es of wor-ing "apital;
K K K K K
MCA 5)(4 5)(4 ?C S%FT$ARE S%FT$ARE &A7 MS1$%R/ 1. Design an Invitati Invitation on to invite Staff, Staff, students students to a seminar seminar on “Emerging Trends in Computers”. 2. Assignment Assignment using Mail merge. 3. Creation Creation of Bio-Data: Bio-Data: consisting consisting Name, email-id, email-id, Contact Contact Address, Carrier Objective, Educational qualifications, social activities, achievements. 4. Assignment Assignment to implement implement macro macro operations operations.
MS1?%$ER?%INT 1. Make a Power point point presentation presentation 2. Make a Power point point presentation presentation 3. Make a Power point point presentation presentation Company Profile. 4. Make a Power point point presentation presentation during student life.
on your your carrier carrier planning. planning. on any any Current affair. affair. to represen represent t a Software about about things things you learned learned
MS1ACCESS 1.
Create a database using MS-ACCESS with at least 5 records TABLE1 STRUCTURE: EMPLOYEE NUMBER NAME DOB GENDER DEPARTMENT TABLE2 STRUCTURE: EMPLOYEE NUMBER
BASIC HRA DA DEDUCTIONS GROSS SALARY
Maintain the relationship between two tables with REGISTER NUMBER as a Primary Key and answer the following quarries: Show the list of Employees with the following fields as one query EMPLOYEE NUMBER NAME GENDER GROSS SALARY 2. Maintain the relationship between above two tables with EMPLOYEE NUMBER as a Primary Key and generate following reports: Report 1 : EMPLOYEE NUMBER, NAME, BASIC HRA DA DEDUCTIONS Report 2 : EMPLOYEE NUMBER, DEPARTMENT, NET SALARY. Use forms to enter data in to tables 3. Create a table and form with following fields Book Number, Book Name, Author, Publisher, Price Generate the report with following fields All Books with price between Rs.500 and Rs.1000
MS1E2CE& 1. Create an electronic spreadsheet to convert a. Decimal Decimal Numbers Numbers to Hexa decimal, decimal, Octal, Octal, Binary Binary b. Binary to Decimal, Decimal, Octal, Hexadecimal Hexadecimal c. Hexadecimal Hexadecimal to Decimal, Decimal, Octal, Binary 2. The Cement Cement Company shows shows the sales of differen different t products products for 5 years. Create column chart, Pie Chart and Bar chart for the following data YEAR
PRODUCT-1
PRODUCT-2
PRODUCT-3
PRODUCT-4
2004
1 000
800
900
1000
2005
8 00
80
50 0
900
2006
1 200
190
400
8 00
2007
4 00
200
300
1000
2008
1 800
400
400
1200
3. Demonstrate Hyper Linking in Excel.
MCA 5), 4 C ?R%6RAMMIN ?R%6RAMMIN6 6 &A7
1; 2; 3; 4;
5; %; 7;
(; ;
10; 11; 12; 13; 14; 15; 1%; 17; 1(; 1; 20; 21; 21;
22; 23; 24; 25; 2%; 27;
Prog Progra ram m to "al"u "al"ula late te "om "ompo poun und d inte intere rest st; ; Progra Program m to to "al"u "al"ulat late e root roots s of of a Juadra Juadrati" ti" eJuati eJuation; on; Prog Progra ram m to aer aerag age e of GnH GnH num' num'er ers; s; Prog Progra ram m to fin find d whea wheath ther er the the gi gien en num num'e 'er r is DiE Prime num'er or not DiiE Perfe"t num'er or not DiiiE Armstrong num'er or not DiE Palindrome or not Progra Program m to demonst demonstrat rate e fun"t fun"tion ion "allin "alling g multi multiple ple times; times; Program to read two integer gers and print the Juotient and remainder of the first num'er diided '$ the se"ond num'er; Prog Progra ram m to to get get the the fol follo lowi wing ng outp output ut; ; ow 1 I 1 2 3 4 5 ow 2 I 1 2 3 4 5 ow 3 I 1 2 3 4 5 Prog Progra ram m for for sum sum of dig digit its s of an an inte intege ger r num' num'er er; ; Prog Progra ram m for for follo followi wing ng usin using g e" e"ur ursi sion on DiE Fa"torial of a num'er DiiE Fi'ona""i series Progra Program m to write write re"or re"ords ds in to to a file; file; Program Program to read read re"ords re"ords from from a file seJuent seJuentiall$; iall$; Progra Program m to sear"h sear"h a re"o re"ord rd in a file file; ; Progra Program m to update update a re"o re"ord rd in a file file; ; Progra Program m to delete delete a re"o re"ord rd in a file file; ; Program Program to "al"ulat "al"ulate e aerage aerage of n noHs in an arra$; Progra Program m for additio addition n of matr matri; i; Progra Program m for multipl multipli"a i"atio tion n of matri; matri; Progra Program m for for sortin sorting g an arra$; arra$; Program Program for row row and "olumn "olumn total total of a two two dimensiona dimensional l arra$; Progra Program m to sort string strings s using using pointer pointers; s; Prog Progra ram m to "al"u "al"ula late te DiE o;of lines DiiE o;of words DiiiE o;of spe"ial "hara"ters; Program Program to to demonstr demonstrate ate string palindrome; palindrome; Program Program to demonstrate demonstrate union in stru"tu stru"ture; re; Program Program for DiE #tring #tring Comparis Comparison on DiiE DiiE #tring #tring Cop$ Cop$ Program Program to demonstrat demonstrate e "all '$ '$ alue and "all "all '$ referen"e; referen"e; Program Program to "al"ulat "al"ulate e area of a
MCA 5)J4 5)J4 SEMINAR SEMINAR
MCA ')54 &AN60A6E ?R%CESS%RS 0n!t1I
ntrodu"tion ? &anguage pro"essing &an8ua8e ?rocessors4 a"tiities ? Fundamentals of language pro"essing ? Fundamentals of language spe"ifi"ation ? &anguage pro"essor deelopment tools;0 /ata Structures for an8ua8e Allo"ation data stru"tures;
;rocess!n84 #ear"h
data
stru"tures=
0n!t–II Scann!n8 and ;ars!n84 #"anning ? Parsing Assembers4 :lements of assem'l$ language programming ? A simple assem'l$ s"heme ? Pass stru"ture of assem'lers ? !esign of a two pass assem'ler ? A single pass assem'ler for *M PC; 0n!t–III Macros and Macro ;rocessors4 Ma"ro definition and "all ? Ma"ro epansion ? ested ma"ro "alls ? Adan"ed Ma"ro fa"ilities ? !esign of a ma"ro prepro"essor;
of "ompilation ? Memor$ Com;!ers and Inter;reters4 Aspe"ts allo"ation ? "ompilation of epressions ? "ompilation of "ontrol stru"tures ? "ode optimiation ? nterpreters; 0n!t1I> &!nkers4 elo"ation and lin-ing "on"epts ? !esign of a lin-er= self relo"ating programs ? A lin-er for M# !O# ? &in-er for oerla$s ? loaders; Soft
?rescr!bed 7ook4 !;M; !hamdhere= B#$stems programming and Operating s$stems= 2nd reised edition= 9M< D200(E;
Chapters I 1 through (
Mode ?a;er MCA ')54 &an8ua8e ?rocessor T!me4 "rs
Max. Marks4 ,)
Ans
aE Constru"t a parse tree for the epression a I '+i; 'E !efine 'inding; "E 8rite generi" sear"h pro"edure to sear"h for an element G#H; dE 8hat is redu"tion > eE 8rite an assem'l$ language pro'lem to find the 'iggest of 2os; fE !efine semanti" gap; gE Pure s impure interpreters; 0NIT 1 I
2; aE 'E "E dE
!is"uss different passes and phases of a language pro"essor; :plain in 'rief different allo"ation data stru"tures; DorE !is"uss arious "ollision handling methods; !efine language pro"essor deelopment tools; :plain &:Q; 0NIT – II
3; aE 'E "E dE
!efine !FA; Constru"t !FA for re"ogniting identifiers= unsigned integers , real nos with fra"tions; :plain Pass of an assem'ler; DorE :plain the features of assem'l$ language; 8rite a'out top down parsing with out 'a"- tra"-ing; 0NIT – III
4;
aE :plain different data stru"tures needed to design a ma"ro prepro"essor; 'E !is"uss different parameter passing me"hanism; DorE "E 8rite the pro"edure to a""ess non)lo"al aria'les; dE !is"uss epansion time aria'les; 0NIT 1 I>
5;
aE :plain the generation of intermediate "odes for epressions; 'E 8rite an algorithm for performing relo"ation; DorE "E :plain I !ead "ode elimination= freJuen"$ redu"tion and strength redu"tion; dE *riefl$ eplain different o'.e"t re"ord formats;
MCA ')'4 /ATA7ASE MANA6EMENT SYSTEMS 0n!t–I /atabases and /atabase 0sersI ntrodu"tion= Chara"teristi"s of the !ata'ase Approa"h= A"tors on the #"ene= 8or-ers 'ehind the s"ene= Adantages of the using the !*M# Approa"h; /atabase S9stem Conce;ts and Arch!tectureI !ata Models= #"hemas and nstan"es= 9hree #"hema ar"hite"ture and !ata ndependen"e= !ata'ase &anguages and nterfa"es= Centralied and Client@#erer Ar"hite"ture for !*M#= Classifi"ation of !ata'ase Management #$stems; /!sk Stora8e= 7as!c F!e Structures and "ash!n8I ntrodu"tion= #e"ondar$ #torage !ei"es= *uffering of *lo"-s= Pla"ing file e"ords on !is-= Operations on Files= Files of 6nordered e"ords= Files of Ordered e"ords=
:ntit$ t$pes= :ntit$ the :
The Enhanced Ent!t91Reat!onsh!; ModeI #u' "lasses= #uper "lasses and nheritan"e= #pe"ialiation and eneraliation= Constraints and Chara"teristi"s of #pe"ialiation and eneraliation !e
0n!t1III Funct!ona /e;endenc!es and Norma!:at!on for Reat!ona /atabases4 nformal !esign uidelines for elation #"hemas= Fun"tional dependen"ies= ormal Forms *ased in Primar$ e$s= eneral !efinitions of #e"ond and 9hird ormal Forms= *o$"e)Codd ormal Form; Reat!ona /atabase /es!8n A8or!thms and Further /e;endenc!es4 Properties of elational !e"ompositions= Algorithms fro elational !ata'ase #"hema !esign= Multialued !ependen"ies and Fourth ormal Form= /oin !ependen"ies and Fifth ormal Form= n"lusion !ependen"ies= Other !ependen"ies and ormal Forms; 0n!t1I> Introduct!on to Transact!on ?rocess!n8 Conce;ts and Theor94 ntrodu"tion to 9ransa"tion Pro"essing= 9ransa"tion and #$stem Con"epts= !esira'le Properties of 9ransa"tions= Chara"teriing #"hedules *ased on e"oera'ilit$= Chara"teriing s"hedules *ased on #erialia'ilit$; Concurrenc9 Contro Techn!@ues4 9wo Phase &o"-ing 9e"hniJues for Con"urren"$ Control= Con"urren"$ Control *ased on 9imestamp Ordering= Multiersion Con"urren"$ "ontrol te"hniJues= alidation "on"urren"$ "ontrol 9e"hniJues= ranularit$ of !ata tems and multiple ranularit$ &o"-ing; /!str!buted /atabases and C!ent Serer Arch!tectures4 !istri'uted !ata'ase Con"epts= !ata Fragmentation= epli"ation= and allo"ation 9e"hniJues for !istri'uted !ata'ase !esign= 9$pes of !istri'uted !ata'ase #$stems= An Oeriew if 3 9ier Client #erer Ar"hite"ture; ?rescr!bed Text 4
ame :lmasri= #ham-ant *; aathe= BFundamentals #$stems= Fifth :dition= Pearson :du"ation D2007E
of
!ata'ase
Cha;ters4 1;1 to 1;%= 2= 13;1 to 13;10= 14= 3;1 to 3;%= 3;= 4;1 to 4;5= 5= %= (= 10= 11= 17= 1(;1 to 1(;5= 25;1 to 25;3= 25;%
eferen"e *oo-s I 1; Peter o'= Carlos Coronel= B!ata'ase #$stems ? !esign= mplementation and Management= :igth :dition= 9homson D200(E; 2; C;/; !ate= A;annan= #; #wam$nathan= BAn ntrodu"tion to !ata'ase #$stems= :dition Pearson :du"ation D200%E; 3; aman A Mata ? 9oledo= Panline ; Cushman= B!ata'ase Management #$stems= #"haumHs Outlines= 9M< D2007E; 4; #teen Feuerstein= BOra"le P&@#L& ? Programming= 10th Anniersar$ :dition= O:&& D200(E;
Model Paper MCA ')'4 /atabase Mana8ement S9stems T!me4 "rs
Max. Marks4 ,)
Ans
6nit) '.aB /!scuss about three ee arch!tecture
6nit) .aB /!scuss about Ar!thmet!c funct!ons !n SH&
Fetch the /e;artment Numbers cons!st!n8 of more than three em;o9ees. Fetch the Em;o9ee a88re8ated saar9 for a de;artment.
orB cB /!scuss about >!e
6nit) -.aB $hat !s Funct!ona /e;endenc9L Ex;a!n the roe of F/s !n construct!on of Reat!ona Schema. bB Can I sa9 that 7CNF !s e@u!aent Norma Form for III NF= Pust!f9L orB cB $hat !s Non1&oss /e;endenc9L Ex;a!n
6nit) *.aB $hat !s &ockL /!scuss about Shared and Excus!e &ock!n8 ?rocess bB /!scuss about !. T
orB cB $hat !s /!rt91Read ?robemL Ex;a!n
MCA ') 4 /ATA STR0CT0RES 0SIN6 CKK 0n!t – I Soft
#eJuential ? *inar$ sear"h ? Search A8or!thms 4 #ear"h AlgorithmsI Performan"e of 'inar$ sear"h ? insertion into ordered listR
as
arra$s
?
Hueues 4 Lueues I Lueue operations ? mplementation of Lueues as arra$s R &in-ed implementation of Lueues R Priorit$ Lueue R Appli"ation of Lueues; Sort!n8 A8or!thms 4 #ele"tion #ort ? nsertion #ort ? Lui"- #ort ? Merge #ort ? Trees 4 *inar$ 9rees ? *inar$ 9ree 9raersal ? *inar$ #ear"h 9ree ? onre"ursie *inar$ 9ree 9raersal Algorithms ? A& 9rees; 6ra;hs 4 raph !efinitions and otations ? raph epresentation ? Operations on graphs ? raph as A!9 ? raph 9raersals ? shortest path Algorithm ? Minimal #panning 9ree;
Pres"ri'ed *oo-I !;#;Mali- = B !ata #tru"tures using C++ = Cengage &earning :dition D200(E; D Chapters 1= 3= 5= %= 7= (= = 10= 11 and 12;E
ndia
Reference 7ooks4
1; Mar- Allen 8eiss = B!ata stru"tures and Algorithem Anal$sis in C+ + = 9hird :dition = Pearson :du"ation D200(E; 2; Adam !rode- = !ata #tru"tures and Algorithms in C++B = Cengage &earning = ndia :dition ;
Mode ?a;er MCA ')4 /ata Structures T!me4 "rs
Max. Marks4 ,)
Ans dE 8rite the "ompleit$ of 'inar$ sear"h algorithm; eE 8hat are the appli"ations of #ta"-> fE Appli"ation of A& 9ree; gE !efine Multigraph; hE 8hat is the purpose of ar'age Colle"tion;
2;aE 'E
"E dE
69 ) 8hat is Class >
69 ? 3;aE 8rite pro"edure to insert an element in an ordered list; 'E :plain *a"- tra"-ing with an eample; DorE "E 8rite pro"edures to delete an element , "ount num'er of nodes in !ou'le &in-ed &ist; dE :plain different "ollision resolution te"hniJues;
4;aE 'E "E dE
5;aE 'E "E dE
69 ) !efine #ta"-; mplement operations on #ta"- using arra$s; 8rite the pro"edure for sele"tion sort; DorE 8hat is priorit$ Lueue; 8rite the pro"edure for implementing the operations on Priorit$ Lueue; 8rite a C++ program for sorting GnH elements using Merge #ort te"hniJue;
69 ) 8rite a pro"edure to find minimum , maimum element in a 'inar$ sear"h tree; 8rite the non)re"ursie algorithm for post order; DorE :plain !ifferent raph traersal te"hniJues; 6sing rus-alHs algorithm; !eelop minimum "ost spanning tree for the following graph; K K K K K
MCA ')*4 %?ERATIN6 SYSTEM ?RINCI?&ES 0NIT–I4 Introduct!on 4 8hat Operating #$stems !o ? Computer #$stem Orgraniation ? Computer s$stem Ar"hite"ture ? Operating #$stem #tru"ture ? Operating #$stem Operations ? Pro"ess Management ? Memor$ Management ? #torage Management ? Prote"tion and #e"urit$ ? !istri'uted #$stems ? #pe"ial purpose #$stems ? Computing :nironments; S9stem Structure4 Operating #$stem #eri"es ? 6ser Operating #$stem nterfa"e ? #$stem Calls ? 9$pes of #$stem Calls ? #$stem Programs ? Operating #$stem !esign and mplementation ? Operating #$stem #tru"ture ? irtual Ma"hine ? Operating #$stem eneration ? #$stem *oot; ?rocess Conce;t 4 Oeriew ? Pro"ess #"heduling ? Operations on Pro"esses ? nterpro"ess Communi"ation ? :amples of PC #$stems ? Communi"ation in Client #erer #$stems; 0NIT–II4 Mut!threaded ?ro8ramm!n8 4 Oeriew ? Multithreading Models 9hread &i'raries ? 9hreading ssues ? Operating #$stem :amples;
?
Con"epts ? #"heduling Criteria ? ?rocess Schedu!n84 *asi" #"heduling Algorithms ? Multiple Pro"essor #"heduling ? 9hread #"heduling; S9nchron!:at!on4 *a"-ground ? 9he Criti"al #e"tion Pro'lem ? PetersonHs solution ? #$n"hroniation !rtua Memor9 Mana8ement4 *a"-ground ? !emand Paging ? Cop$ 8rite ? Page epla"ement ? Allo"ation of Frames ? 9hrashing;
on
0NIT–I>4 F!e S9stem 4 File Con"ept ? A""ess Methods ? !ire"tor$ #tru"ture ? File #$stem Mounting ? File #haring ? Prote"tion;
Im;ement!n8 F!e S9stems 4File #$stem #tru"ture ? File #$stem mplementation ? !ire"tor$ mplementation ? Allo"ation Methods ? Free #pa"e Management ? :ffi"ien"$ and Performan"e ? e"oer$ ? &og stru"tured File #$stems; Secondar9 Stora8e Structure 4 Oeriew of Mass ? #torage #tru"ture ? !is- #tru"ture ? !is- Atta"hment ? !is- #"heduling ? !is- Management ? #wap #pa"e Management ? A! stru"ture; I#% S9stems4 Oeriew ? @O
?rescr!bed 7ook4
A'raham #il'ers"hat= Peter *aer alin= reg BOperating #$stem Prin"iples= #eenth :dition= 8ile$; Cha;ters4
agne;
1;1 ? 1;12= 2;1 ? 2;10= 3;1 ? 3;%= 4;1 ? 4;5= 5;1 ? 5;5= %;1 ? %; = 7;1 ? 7;7 = (;1 ? (;7= ;1 ? ;%= 10;1 ? 10;%= 11;1 ? 11;(= 12;1 ? 12;7= 13;1 ? 13;7
Reference 7ook4
1;
8illiam #tallings= BOperating #$stems ? nternals and !esign Prin"iples= Fifth :dition= Pearson :du"ation D2007E
2;
A"h$ut # od'ole= BOperating #$stems= #e"ond :dition= 9M< D2007E;
3;
Fl$nn@M"
4;
!eitel , !eitel= BOperating #$stems=9hird :dition= Pearson :du"ation D200(E;
Mode ?a;er MCA ')*4 %;erat!n8 S9stem ?r!nc!;es T!me4 "rs
Max. Marks4 ,)
Ans
Adantages of Multipro"essor #$stems; 8hat is s #$stem Call > mportan"e of PC* !ifferen"e 'etween 9hread and Pro"ess; Adantages of #egmentation; irtual Memor$ is &ogi"al or Ph$si"al= 8h$ > 8h$ Operating #$stem reJuires #e"ond #torage #upport for its Operation > hE 8hat are file attri'utes > 0NIT – I
2;aE :plain 9raditional "omputing= Client)#erer "omputing and peer) to)peer "omputing 'E !es"ri'e #torage dei"e
3;aE !is"uss different threading issues; 'E :plain semaphores with suita'le eamples; DorE "E Compare different t$pes of Pro"ess #"heduling Algorithms; 0NIT – III
4;aE :plain !eadlo"- aoidan"e me"hanisms; 'E !es"ri'e swapping with diagram; orB "E :plain segmentation; dE 8rite a'out &6 page repla"ement and Optimal page repla"ement; 0NIT 1 I>
5;aE :plain different file a""ess metods; 'E !es"ri'ed lin-ed file allo"ation methods; orB "E :plain different A! leels; dE !is"uss a'out interrupt drien @O "$"le;
MCA ')-4 ?R%7A7I&ITY AN/ STATISTICS 0n!t I4
of Pro'a'ilit$= Conditional Some ;robab!!t9 a
andom aria'les = !is"rete Pro'a'ilit$ and distri'ution parameters= *inomial distri'ution= simulating a !is"rete
Cont!nuous d!str!but!ons4 "ontinuous !ensities= :pe"tation and distri'ution parameters= eponential distri'ution = ormal distri'ution= 8ei'ull distri'ution and elia'ilit$; 0NIT II4 Est!mat!on4 Point estimation= interal estimation and "entral limit theorem; Inferences on the mean and the >ar!ance of a d!str!but!on4 <$pothesis 9esting= signifi"an"e testing= <$pothesis and signifi"an"e test on the mean= <$pothesis tests on the arian"e Inferences on ;ro;ort!ons4 estimating proportions= testing h$pothesis on a proportion= Comparing two proportionsI estimation= "omparing two proportionsI h$pothesis testing; 0NIT III4 Com;ar!n8 tar!anceI One)wa$ "lassifi"ation fied effe"ts model= "omparing arian"es= pair wise "omparisons= randomied "omplete 'lo"- design
0NIT I>4 S!m;e !near re8ress!on and correat!on 4 model and parameter estimation= inferen"es a'out slope= inferen"es a'out inter"ept= Co) effi"ient of determination Mut!;e !near re8ress!on modes4 least sJuare pro"edures for model fitting= a matri approa"h to least sJuares= interal estimation; ?rescr!bed book4
/ #usan Milton and /esse C; ArnoldI Bntrodu"tion to Pro'a'ilit$ and #tatisti"s= Fourth edition= 9M<=D2007E; Cha;ters4
2= 3;1 to 3;3= 3;5=3;(=3;=4;1=4;2=4;4=4;7;1=7;4= (;3 to (;%==10;1 to 10;3= 11;1= 11;3= 11;%= 12;1= 12;2= 12;4= 13;1 to 13;3=13;5;
Reference book4
8illiam Mendenhall= o'ert / *eaer= *ar'ara M *eaerI ntrodu"tion to Pro'a'ilit$ and #tatisti"s= 9welth edition= 9homson;
Mode ;a;er MCA ')-4 ?robab!!t9 and Stat!st!cs T!me4 hours
Max!mum4 ,) M.
Answer Luestion o;1 Compulsor$I Answer O: Luestion from ea"h unit I
( 2 14 M 4 14 5% M
1;
DaE f *CA then Proe that PD*E PDAE; D'E f two un'iased die are thrown then find the epe"ted alues of the sum of num'ers of points on them; D"E Conditional :pe"tations; DdE :stimator and :stimation; DeE Mathemati"al model of the andomied "omplete 'lo"design; DfE Properties of F)distri'ution; DgE Coarian"e; DhE 9$pe error and 9$pe error; 69)
2; DaE #tate and Proe the addition theorem for n eents; D'E n a "ertain town= Males and Females form 50 per"ent of the population; t is -nown that 20 per"ent of the males and 5 per"ent of the females are unemplo$ed; A resear"h student stud$ing the emplo$ment situation sele"ts unemplo$ed persons at random; 8hat is the pro'a'ilit$ that the person sele"ted is DaE Male D'E Female; DorE D"E Out of (00 families with 5 "hildren ea"h how man$ would $ou epe"t $ou hae DiE 3 'o$s DiiE 5 girls DiiiE :ither 2 or 3 girls Assume eJual pro'a'ilities for 'o$s and girls; DdE 9he distri'ution fun"tion of a random ariate Q is gien '$ the following fun"tion; fDE 0 R if S )2 1@2 R if ?2 S 0 3@4 R if 0 S 2 1 R 2 DiE #-et"h the group h of FDE DiiE O'tain P;!;F of fDE DiiiE Compute the pro'a'ilities PDQ 1ER PDQ 2ER PD1 Q 2E
69) 3; DaE !erie the 100 D1) E "onfiden"e interal limits of the mean in ormal distri'ution; D'E !efine the following terms I DiE Criti"al regionR Composite h$pothesisR leel of #ignifi"an"eR Power of the testR DiiE
DorE D"E
!ifferen"e of Proportions;
DdE andom samples of 400 men and %00 women were as-ed whether the$ would li-e to hae a fl$oer near their residen"e; 200 men 325 women were in faour of the proposal; 9est the h$pothesis= that proportions of men and women in faour of the proposal are same against that the$ are not= at 5 leel; 69) 4; DaE !erie the test statisti" on F test; D'E 9wo random samples drawn from two normal populations are #ample I 20 1% 2% 27 23 22 1( 24 25 #ample I 27 33 42 35 32 34 3( 2( 41 30 37 O'tain estimates of the arian"es of the populations and test whether the populations hae same arian"es; DorE D"E :plain the statisti"al anal$sis of one wa$ "lassifi"ation;
1 43
DdE 9he following data represent the num'er of units of produ"tion per da$ turned out '$ 5 different wor-men using different t$pes of ma"hines; 8or- Men
Ma"hine 9$pes A
B
C
D
1 4% 40 4 3( 2 4( 42 54 45 3 3% 3( 4% 34 4 35 40 4( 35 5 40 44 51 41 DiE 9est whether the mean produ"tiit$ is the same for the four 'rands of ma"hine t$pe; DiiE 9est whether 5 different wor-men differ with respe"t to
produ"tiit$; 69)
5; DaE !erie the ormal eJuations of "ure of egression on Q; D'E 9he relationship 'etween energ$ "onsumption and household in"ome was studied= $ielding the following data on household in"ome Q Din units of T 1000@earE and energ$ "onsumption Din 6nits of 10( *tu@earE; :nerg$ Consumption DE
MCA ')(4 /ATA STR0CT0RES 0SIN6 CKK &A7 1; 8rite a program for implementing the num'ers using "lasses;
operations on "omple
2; Program for finding the area of "ir"le= re"tangle and room using fun"tion oerloading; 3; Program for oerloading;
finding
the
olume
of
'o
using
"onstru"tor
4; Program for #orting GnH elements 6sing 'u''le sort te"hniJue; 5; #ort gien elements using #ele"tion #ort; %; #ort gien elements using nsertion #ort; 7; #ort gien elements using Merge #ort; (; #ort gien elements using Lui"- #ort; ;
mplement the following operations on single lin-ed list; DiE Creation DiiE nsertion DiiiE !eletion DiE !ispla$
10; mplement the following operations on dou'le lin-ed list; DiE Creation DiiE nsertion DiiiE !eletion DiE !ispla$ 11; mplement the following operations on "ir"ular lin-ed list; DiE Creation DiiE nsertion DiiiE !eletion DiE !ispla$ 12; Program for splitting gien lin-ed list; 13; Program for traersing the gien lin-ed list in reerse order; 14; Merge two gien lin-ed lists; 15; Create a lin-ed list to store the names of "olors; 1%; mplement #ta"- Operations 6sing Arra$s; 17; mplement #ta"- Operations 6sing &in-ed &ist; 1(; mplement Lueue Operations 6sing Arra$s; 1; mplement Lueue Operations 6sing &in-ed &ist; 20; mplement Operations on Cir"ular Lueue; 21; Constru"t and implement operations on Priorit$ Lueue; 22; mplement Operations on dou'le ended Lueue; 23; Conerting sta"-;
infi
epression
to
postfi
epression
'$
using
24; 8rite program to ealuate post fi epression; 25; mplement Operations on two wa$ sta"-; 2%; Add two pol$nomials using &in-ed &ist; 27; Multipl$ 9wo pol$nomials using &in-ed &ist; 2(; Constru"t *#9 and implement traersing te"hniJues re"ursiel$; 2; mplement preorder traersal on *#9 non re"ursiel$; 30; mplement inorder traersal on *#9 non re"ursiel$; 31; mplement postorder traersal on *#9 non re"ursiel$; 32; mplement 'inar$ sear"h te"hniJues re"ursiel$;
MCA '),4
/7MS &A7
C$"le)I AimI Mar-eting Compan$ wishes to "omputerie their operations '$ using following ta'les; 9a'le ameI ClientUMaster !es"riptionI 9his ta'le stores the information a'out the "lients; Column ame ClientUno
!ata 9$pe ar"har2
#ie %
ame Address1 Address2 Cit$ #tate Pin"ode *alUdue
ar"har2 ar"har2 ar"har2 ar"har2 ar"har2 um'er um'er
10 10 10 10 10 % 10=2
Attri'ute Primar$ e$ and first letter should starts with GCH ot null
ot null
9a'le ameIProdu"tUmaster !es"riptionI 9his ta'le stores the information a'out produ"ts; Column ame Produ"tUno
!ata 9$pe ar"har2
#ie %
!es"ription ProfitUper"ent 6nitUmeasure Lt$UonUhand e"ordUll #ellUpri"e CostUpri"e
ar"har2 um'er ar"har2 um'er um'er um'er um'er
10 2=2 10 ( ( (=2 (=2
Attri'ute Primar$ e$ and first letter should starts with GPH ot null ot null
ot null= "anHt 'e 0 ot null= "anHt 'e 0
9a'le ameI salesmanUmaster !es"riptionI 9his ta'le stores the salesmen wor-ing in the "ompan$ Column ame #alesmanUid
ame Address1 Address2 Cit$ #tate Pin"ode #alUamt 9argetUamt emar-s
!ata 9$pe ar"har2
ar"har2 ar"har2 ar"har2 ar"har2 ar"har2 um'er um'er um'er ar"har2 9a'le ameI !es"riptionI 9his ta'le stores the
#ie %
Attri'ute Primar$ e$ and first letter should starts with G#H ot null
10 10 10 10 10 % ot null (=2 #hould not null and ero %=2 #hould not null and ero 10 salesUorder information a'out orders
Column ame #UorderUno
!ata 9$pe ar"har2
#ie %
Attri'ute Primar$ e$ and fisrt "har is GOH
#UorderUdate ClientUno !eleUaddress #alesmanUno !eleUt$pe
!ate ar"har2 ar"har2 ar"har2 ar"har2
% 20 % 1
Foreign -e$
*illedU$n !eleUdate
Char !ate
1
OrderUstatus
ar"har2
10
Foreign -e$ !elier$I partDPE@FullDFE and default GFH CanHt 'e less than the sUorderUdate alues in G POC:##H= F6&F&&:!H= G*AC O!:= GCAC:&&:!H
9a'le ameI salesUorderUdetails !es"riptionI 9his ta'le stores the information a'out produ"ts ordered Column ame #UorderUno
!ata 9$pe ar"har2
#ie %
Produ"tUno
ar"har2
%
Lt$Uordered Lt$Udisp Produ"tUrate
um'er um'er um'er
( ( 10=2
Attri'ute Primar$ -e$= foreign -e$ referen"es salesUorder ta'le Primar$ -e$= foreign -e$ referen"es produ"tUmaster ta'le
9a'le ameI "hallanUmaster !es"riptionI 9his ta'le stores the information a'out "hallans made for orders; Column ame ChallanUno
!ata 9$pe ar"har2
#ie %
#UorderUno
ar"har2
%
ChallanUdate *illedU$n
!ate Char
1
Attri'ute Primar$ -e$= first two letters must start with GC
9a'le ameI ChallanU!etails !es"riptionI 9his ta'le stores the information a'out "hallan details; Column ame
!ata 9$pe
#ie
Attri'ute
ChallanUno
ar"har2
%
Produ"tUno
ar"har2
%
Lt$Udisp
um'er
4=2
Primar$ -e$= foreign -e$ referen"es "hallanUmaster ta'le Primar$ -e$= foreign -e$ referen"es produ"tUmaster ta'le ot null
#ole the following Jueries '$ using a'oe ta'les; 1; etriee the list of names and "ities of all the "lients; 2; &ist the arious produ"ts aaila'le from produ"tUmaster; 3; Find out the "lients who sta$ in a "it$ whose se"ond letter is GaH; 4; Find the list of all "lients who sta$ in the "it$ G C<:AH or G!:&<H; 5; &ist all the "lients lo"ated at GC<:AH; %; Print the information from sales order as the order the pla"es in the month of /anuar$; 7; Find the produ"ts with des"ription as GFlopp$ !rieH and GPen drieH; (; Find the produ"ts whose selling pri"e is grater than 2000 and less than or eJual to 5000; ; Find the produ"ts whose selling pri"e is more than 1500 and also find the new selling pri"e as original selling pri"e K15; 10;Find the produ"ts in the sorted order of their des"ription; 11;!iide the "ost of produ"t G540
31;Find the produ"t num'ers and des"riptions of non)moing produ"ts; 32;Find the "ustomer names and address for the "lients= who pla"ed the order G01001H; 33;Find the "lient names who hae pla"ed orders 'efore the month of Ma$= 200%; 34;Find the names of "lients who hae pla"ed orders worth of 10000 or more; 35;Find out if the produ"t is G1;44 drieH is ordered '$ an$ "lient and print the "lient num'er= name to whom it is sold; C$"le) AimI A Manufa"turing Compan$ deals with arious parts and arious suppliers suppl$ these parts; t "onsists of three ta'les to re"ord its entire information; 9hose are as follows #D#O=#AM:=C9=#9A96#E PDPO=PAM:=CO&O=8:9<=C9=CO#9E #PD#O=PO=L9E /D/O=/AM:=C9E #P/D#O=PO=/O=L9E 33; et #uppliers ames for #uppliers who suppl$ at least one red part; 34; et #uppliers ames for #uppliers who do not suppl$ part GP2H 35; 6sing roup '$ with
C$"leI An Airline #$stem would li-e to -eep tra"- their information '$ using the following relations; Flights DflnoI integer= fromI string= toI string= distan"eI integer= Pri"eI integerE Air"raft DaidI integer= anameI string= "ruisingUrangeI integerE
Certified DeidI integer= aidI integerE :mplo$ees DeidI integer= enameI string= salar$I realE ote that the emplo$ees relation des"ri'es pilots and other -inds of emplo$ees as wellR eer$ pilot is "ertified for air"raft and onl$ pilots are "ertified to fl$; esole the following JueriesI 1; For ea"h pilot who is "ertified for more than three air"raft= find the eidHs and the maimum "ruising range of the air"raft that he Dor #heE "ertified for; 2; Find the names of pilots whose salar$ is less than the pri"e of the "heapest route from &os Angeles to
:mplo$ee #alaries should not 'e dupli"ate li-e 5-=4-=4-=3-=2-E 12; !ispla$ those managers name whose salar$ is more than an aerage salar$ of his emplo$ees; 13; !ispla$ the names of the managers who is haing maimum num'er of emplo$ees wor-ing under him> 14; n whi"h $ear did most people .oin the "ompan$> !ispla$ the $ear and num'er of emplo$ees; 15; !ispla$ ename= dname een if there no emplo$ees wor-ing in a parti"ular departmentDuse outer .oinE; P&@#L& POAM# 1; 89: A P&@#L& POAM 9O C<:C 9<: : 6M*: # #9O O O9; 2; 89: A P&@#L& POAM 9O C<:C 9<: : #9 # PA&!OM: O O9; 3; 89: A P&@#L& POAM 9O #8AP 98O 6M*:# 89
6&&>
9P:
O9 6&& 6M*:D3E AC
#:U9AQ :9UAM9
6M*:D(=2E 6M*:D=2E
12; 89: A P&@#L& POC:!6: 9O P:PA: A 9:&:P 9P: ))))))))))))))))))))))))))))) )))))))) )))) 9:&UO O9 6&& 6M*:D%E CAM: AC
PA##I A&& MA# V 40 C&A##I 9O9A&V5 C&A##I 9O9A& *:98:: V40 A! S%0 C&A##I 9O9A& 40 A&#O MA9A 9<: !:9A&# A*#9AC9 9A*&:;
9A*&:# 6#:! 1; 9A*&: #9! AM: 6&&> 9P: ))))))))))))))))))))))))))))))) )))))))) )))) O O9 6&& 6M*: AM: AC
2; 9A*&: A*#9AC9 AM: 6&&> 9P: ))))))))))))))))))))))))))))))) )))))))) )))) #9!O 6M*: #9!AM: AC
!A9U:9: !A9: 15; C:A9: A AA= 8<C<
!ata 9$pe 6M*: C
A!!:##
O*/:C9
L6A&FCA9O
C
P
O*/:C9) AA
!:9A&#
#9::9 6M*: #9::9 AM: 9O8 !#9 A! #9A9:
MCA ')J4
C%MM0NICATI%N S3I&&S
?rescr!bed 7ooks 4
1; a$mond Murph$= B:ssential :nglish rammar= #e"ond :dition= Cam'ridge 6niersit$ Press D200(E 2; &eena #en= BCommuni"ation #-ills= #e"ond :dition= P< D200(E
Reference 7ooks 4
1;
A$sha iswamohan= B:nglish for 9e"hni"al Communi"ation= 9M< D200(E
2;
P; iranmai !utt= eetha a.eean= #-ills= Foundation *oo-s D2007E
3;
9;M; Farhathullah= BCommuni"ation #tudents= Orient &ongman D2002E
4;
:;#uresh umar= P; #reehari= BCommuni"atie :nglish= Orient &ongman D2007E
B*asi"
#-ills
Communi"ation
for
9e"hni"al
MCA )54 %bject %r!ented ?ro8ramm!n8 A 0NIT I Paa 7as!cs 1 4 Eent "and!n8 1 :ents= :ent &isteners= elationship 'etween
sour"es= :ent :ent sour"es
"lasses= :ent and &isteners=
!elegation eent model= #emanti" and &ow)leel eents= :amplesI handling a 'utton "li"-= handling mouse and -e$'oard eents= Adapter "lasses; A;;ets ? nheritan"e hierar"h$ for applets= differen"es 'etween applets and appli"ations= life "$"le of an applet ) Four methods of an applet= !eeloping applets and testing= passing parameters to applets= applet se"urit$ issues; 60I ?ro8ramm!n8
?rescr!bed Text 7ooks4 1; /aaI the "omplete referen"e= 7th editon=
1; Core /aa= olume 1)Fundamentals= eighth edition= Ca$ #;
M%/E& ?A?ER MCA )5 4 %bject %r!ented ;ro8ramm!n8 A T!me 4 hrs
Max Marks 4 ,)
Answer A&& the following Luestions; :a"h Luestion "arries :Jual mar-s; D7 K 2 14 E 1; aE nheritan"e s pol$morphism 'E !efine a'stra"t "lass; "E :plain '$testeam dE eplain .aa;io pa"-age eE !ifferen"es 'etween multiple pro"esses and multiple threads fE life "$"le of an applet gE eplain la$out manager
69 ? 2; aE :plain a'out final "lasses= final methods and final aria'les> 'E :plain a'out the a'stra"t "lass with eample program O 3; 8hat are the 'asi" prin"iples of O'.e"t Oriented Programming> :plain with eamples= how the$ are implemented in C++ 69 ? 4; s there an$ alternatie solution for nheritan"e; f so eplain the adantages and disadantages of it; O 5; DaE 8hat is a pa"-age> D'E 69 ? %; n /AA= is e"eption handling impli"it or epli"it or 'oth; :plain with the help of eample .aa programs; O 7; DaE 8ith the help of an eample= eplain multithreading '$ etending thread "lass; D'E mplementing unna'le interfa"e and etending thread= whi"h method $ou prefer for multithreading and wh$ 69 ? (; !ifferentiate following with suita'le eamplesI DaE Frame= /Frame D'E Applet= /Applet D"E Menu= /menu O ;
:plain the followingI DaE Creating an applet D'E Passing parameters to applets D"E Adding graphi"s and "olors to applets
MCA )'4
C%M?0TER NET$%R3S
0NIT – I Introduct!on 4 6ses of Computer etwor-sI *usiness Appli"ation=
0NIT – III The Net4 The A;;!cat!on &a9er4 !# I 9he !omain ame #$stem I 9he !# ame #pa"e ? esour"e e"ords ? ame #erers; :le"troni" Mail I Ar"hite"ture and #eri"es ? 9he 6ser Agent ? Message Formats ? Message 9ransfer ? Final !elier$; 9he 8orld 8ide 8e'I Ar"hite"ture Oeriew ? #tati" 8e' !o"uments ? !$nami" 8e' !o"uments ? <99P ? 9he <$per 9et 9ransfer Proto"ol ? Performan"e :nhan"ements ? 9he 8ireless 8e'; MultimediaI ntrodu"tion to !igital Audio ? Audio Compression ? #treaming Audio ? nternet adio ? oi"e Oer P ? ntrodu"tion to ideo ? ideo Compression ? ideo on !emand;
?rescr!bed 7ook4
Andrew #; 9anen'aum= BComputer etwor-s= Fourth :dition= P<; Cha;ters4
1;1 to 1;%= 2;2= 3;1 to 3;4= 3;%= 4;3= 4;4= 4;%= 4;7= 5;1= 5;2;1 to 5;2;= 5;5= 5;%;1 to 5;%;5= %;1;1 to %;1;3= %;2= %;4= %;5= 7;1 to 7;4
Reference 7ooks4
1; /ames F;urose= eith 8;oss= BComputer etwor-ing= 9hird :dition= Pearson :du"ation 2; *ehrou A Forouan= B!ata Communi"ations and etwor-ing= Fourth :dition= 9M< D2007E 3; Mi"hael A; allo= 8illiam M;
M%/E& ?A?ER
MCA )' 4 Com;uter Net
Max Marks 4 ,)
Answer A&& the following Luestions; :a"h Luestion "arries :Jual mar-s; D7 K 2 14 E 1; aE 'E "E dE eE fE gE hE
!ifferen"e 'etween Proto"ol and #eri"e; !es"ri'e :thernet; 8h$ epeaters are reJuired; ie an$ two appli"ations of *luetooth; 8hat are the pro'lems with Flooding; 8here 6!P proto"ol is used; !efine <99P; !efine 6ser Agent;
69 ? 2; aE Compare O# and 9CP@P referen"e models; 'E !es"ri'e o *a"- proto"ol;
D7ME D7ME
DorE "E :plain the ar"hite"ture of the nternet D7ME dE 8rite a'out design issues of a !ata &in- la$er; D7ME 69 ? 3; aE :plain #panning tree *ridges; D7ME 'E ie and eplain (02;11 frame stru"ture= seri"es D7ME DorE "E !es"ri'e ar"hite"ture=appli"ations= proto"ol sta"- of *luetooth DME dE :plain #wit"hed :thernet D5ME 69 ? 4; aE :plain P
D7ME D7ME D7ME D7ME
69 ? 5; aE :plain a'out !# 'E 8rite a'out 6&Hs
D7ME D7ME
DorE "E :plain :le"troni" Mail "on"ept dE!is"uss /P: Compression me"hanisam
MCA ) 4 %?ERATI%N RESEARC"
D7ME D7ME
0NIT I4 &!near ?ro8ramm!n8I ntrodu"tion= formulation of &inear Programming Models= raphi" solution of &inear programming Models= Maimiation with &ess)than)or)eJual to "onstraints= eJualities and reater than or eJual to "onstraints= Minimiation of the o'.e"tie fun"tion= the simple Method= properties of simple Method= transportation pro'lem= Assignment Pro'lem; 0NIT II4 /eterm!n!st!c !nentor9 Modes4 ntrodu"tion= nfinite !elier$ ate with o *a"-ordering= Finite delier$ ate with no *a"-ordering= nfinite !elier$ ate with *a"-ordering= finite !elier$ rate with *a"-ordering; 0NIT III4 6ame Theor94 ntrodu"tion= Minima )Mamini pure strategies= Mied #trategies and :pe"ted Pa$off= solution of 22 games= dominan"e= solution of 2n games= solution of m2 games= *rownHs algorithm 0NIT I>4 ?ERT4 ntrodu"tion= P:9 etwor-= 9ime :stimates for A"tiitiesD:9E= :arliest :pe"ted "ompletion of eentsD9:E= &atest Allowa'le :ent Completion timeD9&E= :ent #la"- 9imesD#:E=Criti"al path
?rescr!bed book4
*ell$ :; illett= Bntrodu"tion to Operations esear"h ) A "omputer) oriented algorithmi" approa"hB= 9M< D200(E; Cha;ters4 3;2 to 3;7= 3;10 to 3;12= %;1 to %;5= 11;1 to 11;4= 11;% to 11;= 12;1 to 12;7 Reference 7ook4
/ #harma= BOperation esear"h theor$ and appli"ations= 9hird edition= MACM&&A
Mode ?a;er MCA ) 4 %;erat!ons Research T!me4 "rs
Max. Marks4 ,)
Answer all the Juestions; :a"h Juestion "arries 14 Mar-s; 1;
a; '; "; d; e; f; g; h;
#tandard form of &;P;P; !egenera"$ in #imple Method; orth)8est Corner ule; 6n'alan"ed transportation pro'lem; !ominan"e Propert$; Pa$)Off matri; 9hree time estimates of P:9; 9otal float and Free float; 6nit)
2; a; #ole the following &;P;P '$ using raphi"al Method; Minimie W 31+52 #u'.e"t to "onstraints )31+42 ≤ 12R 21)2 ≥ )2R 21+32 ≥ 12 and 1 ≥ 0R 2 ≥ 0R '; #ole the following &;P;P '$ using simple method; Ma W 31+22 #u'.e"t to the "onstraints 41+22 ≤ 12R 41+2 ≤ (R 41)2 ≤ (R and 1= 2 ≥ 0 DorE "; :plain the pro"edure for
following Luestions I s this solution feasi'le; s this solution degenerate; s this solution optimum > f not find the Optimum #olution;
6nit)
3;a; :plain the Finite delier$ rate with o *ACO!:; '; #uppose a retailer has the following information Aaila'le I ! 350 6nits@ear C0 T50 per order C1 T13;75 per unit C2 T25 per unit &9 5 da$s; 9o minimie the total annual inentor$ "ost when 'a"ordering is allowed= how man$ units should 'e ordered ea"h time an order is pla"ed= and how man$ 'a"-orders should 'e allowed > DorE "; :plain infinite delier$ rate with O*ACO!:; d; :plain with Finite delier$ rate with *ACO!:;
6nit)
4; a; :plain 'riefl$ how "an $ou sole the 22 game; '; #ole the following game '$ using graphi"al method; Pla$er ? * Pla$er)A 1 3 0 % ?1 7 2 )1 5 )2 )2 1 DorE "; :plain the pro"edure for m2 game in the "ase of graphi"al method; d; :plain the *rownHs algorithm;
6nit)
5; a; :plain the 9ime "al"ulations in Criti"al path method; '; For the following etwor- diagram= dentif$ the Criti"al path and find the total pro.e"t duration;
DorE
"; 9he three time estimates of P:9 etwor- are as follows I A"tiit$ :stimated duration Dwee-sE i . Optimisti" time Most li-el$ time Pessimisti" time 1 1 1 2 3 4 5
2 3 4 5 5 % % !B !!B !!!B !B B
1 1 2 1 2 2 3
1 4 2 1 5 5 %
7 7 ( 1 14 ( 15
!raw the Pro.e"t networFind the epe"ted duration and arian"e of ea"h a"tiit$ Find the epe"ted pro.e"t length Cal"ulate the arian"e and standard deiation of the pro.e"t length 8hat is the pro'a'ilit$ that the pro.e"t will 'e com;eted at east *
' ' ' ' '
MCA )*4 C%M?0TER 6RA?"ICS 0n!t1I %er!e< of Com;uter 6ra;h!cs4 ideo !ispla$ !ei"es= aster #"an !ispla$s= andom #"an !ispla$s= Color C9 Monitors= !ire"t iew #torage 9u'es= Flat Panel !ispla$s= aster #"an #$stems= andom #"an #$stems= nput !ei"es; 6ra;h!ca 0ser Interfaces and Interact!e In;ut Methods4 9he 6ser !ialogue= 8indows and "ons= nput of raphi"al !ata= nput Fun"tions 0n!t1II
%ut;ut ?r!m!t!es4 Points and &ines= &ine)!rawing AlgorithmsI !!A Algorithm= *resenhamHs &ine Algorithm= &ine Fun"tion= Cir"le eneration Algorithms= :llipse eneration Algorithms Attr!butes of out;ut ?r!m!t!es4 &ine Attri'utes= ra$#"ale leels= Area Fill Attri'utes= Chara"ter *undled Attri'utes= Antialiasing;
Color and Attri'utes=
0n!t1III
T!e
Three /!mens!ona Conce;ts4 9hree !imensional !ispla$ Methods; Three /!mens!ona %bject Re;resentat!ons4 Pol$gon #urfa"es= Luadri" #urfa"es= #uperJuadri"s; Three /!mens!ona 6eometr!c and Mode!n8 Transformat!ons4 9ranslation= otation= #"aling= Other 9ransformations= Composite 9ransformations= 9hree !imensional 9ransformation Fun"tions;
Three /!mens!ona >!e
pipeline= iewing Coordinates=
?rescr!bed 7ook4
!onald
Cha;ters 4 2;1 to 2;5= (;1 to (;3= 3;1= 3;2= 3;4 to 3;%= 4= 5;1 to 5;4= %= ;1= 10;1= 10;3= 10;4= 11= 12;1= 12;2= 12;3= 12;5 Reference 7ook4 5. #halini oil)Pai= Prin"iples of Computer raphi"s ? 9heor$ and Pra"ti"e using open & and Ma$a= #pringer D2007E '. #! group= BComputer raphi"s= a"e series= 9M< D200%E . Amearendra D200(E
; #inha= Arun
!
6dai=
BComputer
raphi"s=
9M<
Mode ?a;er MCA )*4 Com;uter 6ra;h!cs T!me4 "rs Max. Marks4 ,) Answer the following Juestions; :a"h Juestion "arries 14 Mar-s; 1;aE 8hat is the differen"e 'etween Passie and ntera"tie raphi"s> 'E 8hat is Frame *uffer> "E 8hat are the draw'a"-s of !!A Algorithm> dE 8hat is world "oordinate s$stem> eE !efine t$pefa"e; fE 8hat are the attri'utes of a &ine> gE 8hat is pro.e"tion> hE 8hat is Juadri" surfa"e> 69)
2;aE !is"uss a'out Color Monitor> 'E 8hat is Computer raphi"s> 8hat are the ma.or "onsiderations in the stud$ of "omputer graphi"s> DOrE "E !is"uss a'out arious positioning dei"es; dE !es"ri'e the differen"e 'etween andom #"an !ispla$ dei"es and aster s"an displa$ dei"es; 69)
3;aE !es"ri'e the generation of ellipse; 'E llustrate the *resenhamHs line algorithm with end points D10=10E and D10=20E; DOrE "E 8hat is an output primitie> !is"uss a'out attri'utes of "hara"ter; dE !is"uss a'out area filling st$les;
69)
4;aE 8hat are two)dimensional transformations> :plain; 'E Perform a 45o rotation of a triangle AD0=0E= *D1=1E and "D5=2E i; A'out the origin ii; A'out the pointD)1=2E
DOrE "E 8rite a'out 8indow)to)iew port "oordinate transformation; dE !is"uss a'out pol$gon "lipping Algorithm 69)
5;aE !is"uss a'out 3! Pro.e"tion;
DOrE 'E !erie the "om'ined transformation matri of the followingI A 3! 9ranslation with 3 units along Q)ais= 4 units along ) ais= 5 units along W)ais followed '$ a X! rotation '$ 30o on Q Plane followed '$ 3! rotation of 45o around )ais;
MCA1)-4
ARTIFICIA& INTE&&I6ENCE
0n!t1I 4 $hat !s AIL 4 9he A Pro'lems= 9he 6nderl$ing Assumption= 8hat is A 9e"hniJue>= 9he leel of the Model= Criteria for #u""ess; ?robems= ?robem s;aces Q Search4 !efining the Pro'lem as a #tate #pa"e #ear"h= Produ"tion #$stems= Pro'lem Chara"teristi"s= Produ"tion #$stem Chara"teristi"s= ssues in the design of #ear"h Programs= Additional Pro'lems; "eur!st!c search techn!@ues4 enerate and 9est=
and in
Mappings= nowledge
#imple Fa"ts in &ogi"= 0s!n8 ?red!cate &o8!c4 epresenting epresenting nstan"e and sa elationships= Computa'le Fun"tions and Predi"ates= esolution= atural !edu"tion Re;resent!n8 kno<ed8e us!n8 Rues4 Pro"edural ersus !e"laratie nowledge= &ogi" Programming= Forward ersus *a"-ward easoning= Mat"hing= Control nowledge 0n!t1III 4 S9mbo!c Reason!n8 under 0ncerta!n!t94 ntrodu"tion to onmonotoni" easoning= &ogi"s for onmonotoni" easoning= mplementation ssues= Augmenting a Pro'lem #oler= mplementationI !epth)First #ear"h= mplementationI *readth)First #ear"h $eak sot Q f!er Structures4 #emanti" ets= Frames ?ann!n8 4 Oeriew= An :ample !omain I 9he *lo"-s 8orld= Components of a Planning #$stem= oal #ta"- Planning= onlinear Planning 6sing Constraint Posting=
0n!t1I> 4 Natura &an8ua8e ?rocess!n84 ntrodu"tion= #$nta"ti" #emanti" Anal$sis= !is"ourse and Pragmati" Pro"essing Commonsense4 Lualitatie Ph$si"s= Organisation= Case)*ased easoning
Commonsense
Pro"essing=
Ontologies=
Memor$
Ex;ert S9stems4 epresenting and 6sing !omain nowledge= #$stem #hells= :planation= nowledge A"Juisition
:pert
?rescr!bed 7ook 4
night = BArtifi"ial ntelligen"e= 9M< D11E Cha;ters 4 1 through 7= = 13= 15= 10 and 20
Reference 7ook 4
1; Mi"hael egneits-$= BArtifi"ial ntelligen"e ? A uide to ntelligent #$stems= #e"ond :dition= Pearson :du"ation D200(E 2; 8inston P;<= BArtifi"ial ntelligen"e= Addision 8esle$ D13E
Mode ?a;er MCA )-4 Art!f!c!a Inte!8ence T!me4 "rs
Max. Marks4 ,)
Answer all the Juestions; :a"h Juestion "arries 1% Mar-s; 1;
a; i; .; -; l; m; n; o;
8hat is A'du"tion in easoning > 8hat is meant '$ 9uring 9est > Adantages of !epth)First #ear"h; 8rite a'out produ"tion s$stem t$pes and eplain; !efine and eplain nherita'le -nowledge; !efine inferential AdeJua"$ and A"Juisional effi"ien"$; 8hat is meant '$ pragmati" Anal$sis > !is"uss the importan"e of -nowledge representation in A;; s$stem deelopment; 6nit)
2;a; 8hen $ou "all a te"hniJue is a A; te"hniJue > 8hat is meant '$ A; pro'lem eplain in detail; '; !is"uss a'out pro'lem edu"tion Algorithm; D or E "; :plain !epth)First sear"h and *readth ?First sear"h in easoning; '; :plain on linear planning using "onstraint posting; 6nit)
3;a; Adantages and disadantages of Forward "haining; 8hen "ompared to 'a"-ward "haining; '; :plain ssues in -nowledge epresentation; D or E "; 8rite prin"iples of resolution with eample; 6nit) 4;a; :plain "onersion of Clause from with the help of :ample; DorE ' 8rite 6nifi"ation algorithm with the help of eample; 6nit)
4;a; iE !efine and eplain 'elow terms Morphologi"al Anal$sis #$nta"ti" Anal$sis #emanti" Anal$sis !is"ourse Anal$sis Pragmati" Anal$sis iiE :plain oal #ta"- planning; D or E '; :plain a'out :pert s$stems in detailed; ' ' ' ' '
MCA )(4 Paa ?ro8ramm!n8 &ab
1; 8rite a /aa Program to define a "lass= des"ri'e its "onstru"tor= oerload the "onstru"tors and instantiate its o'.e"t; 2; 8rite a /aa Program to define a "lass= define instan"e methods for setting and retrieing alues of instan"e aria'les and instantiate its o'.e"t 3; 8rite a .aa program to pra"ti"e using #tring "lass and its methods 4; 8rite a .aa program to implement inheritan"e and demonstrate use of method oerriding 5; 8rite a .aa program to implement multileel inheritan"e '$ appl$ing arious a""ess "ontrols to its data mem'ers and methods; %; 8rite a program to demonstrate use of implementing interfa"es 7; !esign a /aa interfa"e for A!9 #ta"-; !eelop two different "lasses that implement this interfa"e= one using arra$ and the other using lin-ed)list; Proide ne"essar$ e"eption handling in 'oth the implementations; (; 8rite a /aa program to implement the "on"ept of importing "lasses from user defined pa"-age and "reating pa"-ages ; 8rite a program to implement the "on"ept of threading '$ implementing unna'le nterfa"e 10; write a .aa program to store and read o'.e"ts from a file 11; 8rite a /aa program that displa$s the num'er of "hara"ters= lines and words in a tet file; 12; write a .aa program to illustrate o'.e"t serialiation 13; Create a .aa program to illustrate user defined e"eption 14; 8rite a .aa program to "reate a thread using runna'le interfa"e 15; 8rite a /aa program that "reates three threads; First thread displa$s Bood Morning eer$ one se"ond= the se"ond thread displa$s B
1(; 8rite a Program 9hat wor-s as a simple "al"ulator using rid la$out to arrange 'uttons for the digits and +=)=K operations; Add a tet field to print the result; 1;
*uild and run YCelsiusConerterY sample appli"ation using swings
20; !eelop an applet that re"eies an integer in one tet field= and "omputes its fa"torial alue and returns it in another tet field= when the 'utton named BCompute is "li"-ed
MCA ),4 0NI2 S"E&& ?R%6RAMMIN6 &A7 1E 8rite a shell s"ript to a""ept two num'ers and perform all arithmeti" operations on it 2E 8rite a shell s"ript to find largest of three num'ers using "onditional ee"ution operators 3E 8rite a shell s"ript to "he"- whether a parti"ular user has logged in or not; f he has logged in= also "he"- whether he has eligi'ilit$ to re"eie a message or not 4E 8rite a shell s"ript to a""ept the name of the file from standard input and perform the following tests on it aE File ee"uta'le 'E File reada'le "E File writa'le dE *oth reada'le , writa'le 5E 8rite a shell s"ript whi"h will displa$ the username and terminal name who login re"entl$ in to the uni s$stem %E 8rite a shell s"ript to find no; of files in a dire"tor$ 7E 8rite a shell s"ript to print the following format 1 12 123 1234 (E 8rite a shell s"ript to print prime num'ers up to a gien range using arguments E 8rite a shell s"ript whi"h will displa$ the num'er of da$s in the gien month and $ear 10E 8rite a shell s"ript to "he"- whether a gien num'er is perfe"t or not 11E 8rite a menu drien shell s"ript to "op$= edit= rename and delete a file 12E 8rite a shell s"ript for "on"atenation of two strings 13E 8rite a shell s"ript whi"h will displa$ fi'ona""i series up to a gien num'er of argument 14E 8rite a shell s"ript to a""ept student num'er= name= mar-s in 5 su'.e"ts; Find total= aerage and grade; !ispla$ the result of student and store in a file "alled stu;dat ulesI agV(0 then grade A AgS(0,,AgV70 then grade * AgS70,,AgV%0 then grade C AgS%0,,AgV50 then grade ! AgS50,,AgV40 then grade : :lse grade F 15E 8rite a shell s"ript to a""ept empno=empname='asi"; Find !A=<A=9A=PF using following rules; !ispla$ empno= empname= 'asi"= !A=<A=PF=9A=O## #A& and :9#A&; Also store all details in a file "alled emp;dat ulesI <A is 1( of 'asi" if 'asi" V 5000 otherwise 550 !A is 35 of 'asi" PF is 13 of 'asi" 9 is 14 of 'asi" 9A is 10 of 'asi" 1%E 8rite a shell s"ript to demonstrate 'rea- and "ontinue statements
17E 8rite a shell s"ript to satisf$ the following menu options a; !ispla$ "urrent dire"tor$ path '; !ispla$ toda$s date "; !ispla$ users who are "onne"ted to the uni s$stem d; Luit 1(E 8rite a shell s"ript to delete all files whose sie is ero '$tes from "urrent dire"tor$ 1E 8rite a shell s"ript to displa$ string palindrome from gien arguments 20E 8rite a shell s"ript whi"h will displa$ Armstrong num'ers from gien gien arguments 21E 8rite a shell s"ript to displa$ reerse num'ers from gien argument list 22E 8rite a shell s"ript to displa$ fa"torial alue from gien argument list 23E 8rite a shell s"ript whi"h will find maimum file sie in the gien argument list 24E 8rite a shell s"ript whi"h will greet $ou Bood Morning= ood Afternoon= Bood :eningH and Bood ight a""ording to "urrent time 25E 8rite a shell s"ript whi"h will displa$ total sie of dire"tories 2%E 8rite a shell s"ript to sort the elements in a arra$ using 'u''le sort te"hniJue 27E 8rite a shell s"ript to find largest element in a arra$ 2(E 8rite an aw- program for displa$ the lines in an$ file "entre alignment 2E 8rite an aw- program to print sum= ag of students mar-s list 30E 8rite an aw- program to displa$ total num'er of users and their names in uni s$stem 31E 8rite an aw- program to displa$ students pass@fail report 32E 8rite an aw- program to "ount the no; of owels in a gien file 33E 8rite an aw- program whi"h will find maimum word and its length in the gien input File 34E 8rite a shell s"ript to generate the mathemati"al ta'les; 35E 8rite a shell s"ript to "he"- whether gien num'er is strong or not 3%E 8rite a shell s"ript to sort elements of gien arra$ '$ using sele"tion sort; 37E 8rite a shell s"ript to sear"h gien num'er using 'inar$ sear"h; 3(E 8rite a shell s"ript to find num'er of owels= "onsonants= num'ers= white spa"es and spe"ial "hara"ters in a gien string; 3E 8rite a shell s"ript to lo"- the terminal; 40E 8rite a shell s"ript whi"h merge the "ontents of file1= file2= file3= sort them and displa$ the sorted output on the s"reen page '$ page;
MCA )J4 Sem!nar
MCA *)54
?RINCI?&ES %F ?R%6RAMMIN6 &AN60A6ES
0NIT – I Introduct!on 4 8hat is a programming language= A'stra"tions in programming languages= Computational paradigms= &anguage definition= &anguage translation= &anguage design; "!stor9 4 :arl$
'inding and semanti" fun"tions= 9he s$m'ol ta'le= ame resolution &ifetimes and the enironment= !angling referen"es and gar'age;
/ata T9;es 4 !ata t$pes and t$pe information= #imple t$pes= 9$pe "onstru"tors= 9$pe eJuialen"e= 9$pe Che"-ing= 9$pe "onersion= Pol$morphi" t$pe "he"-ing= :pli"it pol$morphism; 0NIT 1 II Contro – I 4 Ex;ress!ons and Statements 4 :pressions= Conditional #tatements and uards= &oops and ariation on Bwhile= 9he Bgoto "ontroers$= :"eption handling; Contro – II 4 ?rocedures and En!ronments 4 Pro"edure definition and a"tiation= Pro"edure semanti"s= Parameter passing me"hanisms= Pro"edure enironments= a"tiations and allo"ation= !$nami" memor$ management= :"eption handling and enironments; Abstract data t9;es and Modues 4 9he alge'rai" spe"ifi"ation of a'stra"t data t$pes= A'stra"t data t$pe me"hanisms and modules= #eparate "ompilation in C= C++ name spa"es and /aa pa"-ages= Ada pa"-ages= Modules in M&= Modules in earlier languages= Pro'lems with a'stra"t data t$pe me"hanisms= 9he mathemati"s of a'stra"t data t$pes;
0NIT 1 III %bject – %r!ented ?ro8ramm!n8 4 #oftware reuse and independen"e= /aa I o'.e"ts= Classes and methods= nheritan"e= !$nami" 'inding= C++= #mall 9al-= !esign issues in o'.e"t ? oriented languages= mplement ation issues in o'.e"t ? oriented languages;
Programs as fun"tions= Fun"tional Funct!ona ?ro8ramm!n84 programming in an imperatie language= #"hemeI A !iale"t of &#P= M&I Fun"tional programming with stati" t$ping= !ela$ed :aluation=
0NIT 1 I> Forma Semant!cs4 A #ample small language= Operational semanti"s= !enotational semanti"s= Aiomati" semanti"s= Proofs of program "orre"tions; ?arae ;ro8ramm!n8 4 ntrodu"tion to parallel pro"essing= Parallel pro"essing and programming languages= 9hreads= #emaphores= Monitors= Message passing= Parallelism in non)imperatie languages;
?rescr!bed 7ook 4
enneth C; &ouden= BProgramming &anguages Prin"iples and Pra"ti"e= #e"ond :dition= Cengage &earning D200(E; Cha;ters 4 1 through 14 Reference 7ooks4
1; 9erren"e 8; Pratt , Merin ; Wel-owit= BProgramming &anguages !esign and mplementation= Fourth :dition= Pearson :du"ation D200(E 2; o'ert 8; #e'esta= BCon"epts of Programming #eenth :dition= Pearson :du"ation D2007E
&anguages=
Mode ?a;er MCA *)54 ?r!nc!;es of ?ro8ramm!n8 &an8ua8es T!me4"rs.
Max. Marks 4 J)M
Ans
aE 'E "E dE eE fE gE hE
8hat are !angling referen"es > /ustif$ the need of s$m'ol ta'le; !efine O'soles"en"e; !efine *inding; Classes s !ata t$pes; 8hat are a"tiation re"ords > !efine an e"eption;H Orthoganalit$; Sect!on – 7 0n!t – I
'. aE !is"uss the issues regarding language translation; D7ME 'E Present some reasons supporting t$pe "he"-ing; D7ME DorE "E !is"uss gar'age "olle"tion pro"edure in a programming language; D7ME dE !efine 'inding times; :plain arious t$pes of 'inding times; D7ME 0n!t – II . aE 8hat is an e"eption and e"epting handling>
D7ME *. aE !istinguish 'etween inheritan"e and pol$morphism; 'E :plain the pro'lems asso"iated with logi" programming;D7ME DorE "E !is"uss dela$ed ealuation; D7ME dE :plain whether a fun"tion haing no side effe"ts are reall$ transparent; D7ME
0n!t – I> -. aE !is"uss redu"tion rules for integer arithmeti" epressions; D7ME 'E:plain threading in /aa; D7ME DorE "E 8rite a prolog program that sorts a list of integers a""ording to the merge sort algorithm; D7ME dE 8rite a short notes on Monitors; D7ME
K K K K K
MCA *)'4
%7PECT %RIENTE/ M%/E&IN6 AN/ /ESI6N 0SIN6 0M&
0n!t1I Introduct!on4 what is O'.e"t Orientation= 8hat is OO !eelopment= OO 9hemes= :iden"e for 6sefulness of OO !eelopment; Mode!n8 as /es!8n Techn!@ue4 Modeling= A'stra"tion= 9hree Models Cass Mode!n84 O'.e"t and Class Con"epts= &in- and Asso"iation "on"epts= eneraliation and nheritan"e= A #ample Class Model; Adanced Cass Mode!n84 Adan"ed O'.e"t and Class Con"epts= Asso"iation :nds= )Ar$ Asso"iation= Aggregation= a'stra"t Classes= Multiple nheritan"e= Metadata= eifi"ation= Constraints= !eried data= Pa"-ages; 0n!t1II State Mode!n84 :ents= #tates= 9ransitions and Conditions= state diagrams= state diagram 'ehaior; Adanced State Mode!n84 ested #tate !iagrams= ested signal generaliation= "on"urren"$= A #ample #tate Model; Interact!on Models;
Mode!n84 6se
Case
Models=
#eJuen"e Models=
Adanced Interact!on Mode!n84 6se Case elationships= #eJuen"e Models= #pe"ial Constru"ts for A"tiit$ Models;
states=
A"tiit$
Pro"edural
0n!t1III ?rocess %er!e<4 !eelopment #tages= !eelopment &ife C$"le; S9stem Conce;t!on4 !eising a s$stem Con"ept= :la'orating a Con"ept= Preparing a Pro'lem #tatement; /oma!n Ana9s!s4 Oeriew of anal$sis= !omain Class Model= !omain #tate model= !omain ntera"tion Model= terating the Anal$sis; A;;!cat!on Ana9s!s4 Appli"ation ntera"tion Model= Appli"ation Class Model= Appli"ation #tate Model= Adding Operations;
0n!t1I> S9stem /es!8n4 Oeriew of s$stem !esign= :stimating Performan"e= Ma-ing a euse Plan= *rea-ing a #$stem into #u's$stem= dentif$ing Con"urren"$= Allo"ation of #u's$stems= Management of data storage=
9esting. ?ro8ramm!n8 St9e4 O'.e"t Oriented #t$le= eusa'ilit$= o'ustness= :tensi'ilit$= Programming)in the &arge; ?rescr!bed 7ook4
Mi"hael *laha= /ames um'augh= BO'.e"t Oriented Modeling and !esign with 6M&= #e"ond :dition= P<; Cha;ters 4 1;1 to 1;4= 2= 3;1 to 3;4=4= 5= %;1 to %;5= 7= (= 10= 11= 12= 13= 14= 15= 17= 20 Reference 7ooks4
1; Meilir Page)/ones= BFundamentals of O'.e"t Oriented !esign in 6M&= Pearson :du"ation D200(E; 3;
BModeling
#oftware
#$stems
6sing
6M&2=
5; #imon *enett= #tee M" o''= BO'.e"t Oriented #$stems Anal$sis and !esign using 6M&= #e"ond :dition= 9M< D2007E; %; Mar- Priestle$= BPra"ti"al O'.e"t Oriented !esign with 6M&= #e"ond :dition= 9M< D200(E; 7; rad$ *oo"h= /ames um'augh 6ser uide= Pearson D200(E;
B9he 6nified Modeling
&anguage
Mode ?a;er MCA *)'4 %bject %r!ented Mode!n8 and /es!8n
Max. Marks4 ,)
Answer the following Juestions; :a"h Juestion "arries 14 Mar-s; 1;aE 'E "E dE eE fE gE
!istinguish 'etween o'.e"t diagram and :)diagram; !efine Meta "lass; !istinguish 'etween Aggregations ersus generaliation; :plain Constraints; 8hat is anal$sis do"ument> eed for #tate)transition diagram> !efine modeling> hE 8hat is multipli"it$>
6nit) 2;aE 8hat is Modeling> 8hat are different O'.e"t Modeling 9e"hniJues; 'E !is"uss how was o'.e"t oriented deelopment methodolog$ is different from 9raditional approa"h; DorE "E :plain the following termsI i; Asso"iation; ii; Aggregation; iii; eneraliation; i; Composition;
3;aE 'E "E dE
6nit) 8hat is #tate modeling> 8hat is an :ent> !is"uss a'out t$pes of :ents with eample> DorE 8hat is 6se Case> !is"uss the "on"urren"$ with the help of an eample;
6nit) 4;aE !is"uss a'out the steps inoled in Anal$sis of a #$stem; DorE 'E !efine state diagram for A9M Model; "E !is"uss a'out nested state diagram;
5;aE 'E "E dE
6nit) 8hat is the tas- of a design> !is"uss a'out #$stem 9esting> DorE !is"uss the programming st$le in the large "omple s$stems; !is"uss a'out good programming st$le;
MCA *)4 $E7 TEC"N%&%6IES 0NIT I "TM&4 Common Ta8s4 &ist= 9a'les= images= forms= Frames= Cas"ading #t$le #heetsR Paa Scr!;t4 ntrodu"tion to /aa #"ripts= O'.e"ts in /aa #"ript= !$nami" <9M& with /aa #"ript; 0NIT II 2M&4 !o"ument t$pe definition= QM& #"hemas= !o"ument O'.e"t model= Presenting QM&= 6sing QM& Pro"essorsI !OM and #AQ C6I Scr!;t!n84 8hat is C> ? !eeloping C appli"ations ? Pro"essing C ? eturning a *asi" <9M& page ? ntrodu"tion to C;pm ? C;pm methods ? Creating <9M& pages d$nami"all$; 0NIT III
ntrodu"tion to /!*C ? Conne"tions ? nternal !ata'ase P/7C4 Conne"tions ? #tatements ? esults #ets ) Prepared #tatements ) Calla'le #tatements; wh$ networ-ed /aa ? *asi" etwor Net $eb Serers and Serets4 9om"at we' serer= ntrodu"tion to #erletsI &ife"$"le of a #erlet= /#!= 9he #erlet AP= 9he .aa;serlet Pa"-age= eading #erlet parameters= eading nitialiation parameters; 9he .aa;serlet <99P pa"-age=
Introduct!on to PS?I 9he Pro'lem with #erlet; 9he Anatom$ of a /#P Page= /#P Pro"essing; /#P Appli"ation !esign with MC #etting 6p and /#P :nironmentI nstalling the /aa #oftware !eelopment it= 9om"at #erer , 9esting 9om"at
?rescr!bed Textbooks
1; 8e' Programming= 'uilding internet appli"ations= Chris *ates 2nd edition= 8&: !reamte"h Dunits = E 2; /aa Programming with /!*C R!onald *ales= OHeill$ D6nit E 3; /aa etwor- Programming= elliotte ust$
Reference Textbooks
1; o'e o'ert rt 8; #e'e #e'est sta= a= BPro BProgr gram ammi ming ng the the 8orl 8orld d 8ide 8ide 8e' 8e'= = 9hir 9hird d :dition= Pearson :du"ation D2007E; 2; Anders Anders Moller Moller and Mi"hae Mi"hael l s"hwar s"hwart' t'a"h a"h= = An ntrodu" ntrodu"tio tion n to QM& and 8e' 9e"hnologies= Addison 8esle$ D200%E 3; Chris Chris *ates= *ates= B8e' B8e' Program Programmin ming?* g?*uil uildin ding g ntern nternet et Appli" Appli"ati ations onsB= B= #e"ond :dition= 8ile$ D2007E; 4; /eff /effre re$ $ C; /a"/a"-so son= n= B8e' B8e' 9e"h 9e"hno nolo logi gies es ? A Comp Comput uter er #"ie #"ien" n"e e Perspe"tie= Pearson :du"ation D200(E; 5; <;M;!eitel= <;M;!eitel= P;/;!eitel= P;/;!eitel= B/aa B/aa
Mode ?a;er MCA *)4
Max. Marks4 ,)
Answer the following Luestions; :a"h Luestion "arries 14 Mar-s; 1; DaE D'E (c) (d) (e) (f) (g)
What are HTML tags? What are the features of JavaScript? What is XML? How is it different from HTML? What is DTD? What is meant ! Session? List the JS" imp#icit o$ects? Define Serv#et
2; DaE Create Create a simple <9M& page page whi"h demonstrat demonstrates es the use of the arious t$pes of lists; 9r$ adding a definition list whi"h uses an unordered list to define terms; D'E !eelop a .aas"ript to determine whether a gien num'er is an GAM#9O 6M*:H or not; O 3; DaE (; DaE 8hat are the limitations of #erlets> :plain
MCA *)* 4
S%T$ARE S%T$ARE EN6INEERIN6 EN6INEERIN6
0n!t1I4 Introduct!on to Soft!e< of ?rocess4 #oft #oftwa ware re :ngi :ngine neer erin ing) g)A A &a$e &a$ere red d 9e"hno 9e"hnolog log$= $= A Pro"es Pro"ess s Frame Frame 8or-= 8or-= 9he "apa'i "apa'ilit lit$ $ Maturi Maturit$ t$ Model Model ntegration DCMME= Pro"ess Patterns= Pro"ess Assessment= Personal and and 9eam 9eam Pro" Pro"ess ess Mode Models lsI I Pers Person onal al #oft #oftwa ware re Pro" Pro"es ess s DP#P DP#PE= E= 9eam 9eam #oftware Pro"ess D9#PE= Pro"ess 9e"hnolog$= Produ"t and Pro"ess;
Pres Pres"r "rip ipti tie e Mode Models ls= = 9he 9he 8ate 8aterf rfal all l Mode Model= l= ?rocess M od e s4 n"remental Pro"ess ModelsI 9he n"remental Model= 9he A! Model= :ol :olut utio iona nar$ r$ Pro" Pro"es ess s Mode ModelI lI Prot Protot ot$p $pin ing= g= 9he 9he #pir #piral al Mode Model= l= 9he 9he Con"urrent Con"urrent !eelopment !eelopment Model= #pe"ialied #pe"ialied Pro"ess ModelsI ModelsI Component Component *ased !eelopment= 9he formal Methods Model= 9he 6nified Pro"ess; An A8!e >!e< of ?rocess4 8hat is Agilit$> 8hat is Agile Pro"ess> Agil Agile e Pro" Pro"es ess s Mode Models lsI I :tr :trem eme e Prog Progra ramm mmin ing= g= Adap Adapti tie e #oft #oftwa ware re !eelo !eelopme pment= nt= !$nami !$nami" " #$stem #$stems s !eelop !eelopmen ment t Method Method= = #"rum= #"rum= Cr$sta Cr$stal= l= Feature !rien !eelopment= Agile Modeling; 0n!t1II
#oftwa ware re :ngin :nginee eeri ring ng Soft Soft
Pra" Pra"ti ti"e "e= = Pra"ti Pra"ti"es "es= =
S9stem En8!neer!n8 En8!neer!n8I Computer *ased #$stems= 9he #$stem :ngineering
0n!t1III Test!n8 Strate8!es4 A strategi" Approa"h to #oftware 9esting= #trategi" ssues= 9est #trategies for "onentional #oftware= 9esting #trategies for O'.e"t Oriented #oftware= alidation 9esting= #$stem 9esting= the Art of !e'ugging; Test!n8 Tact!cs4 #oftware 9esting Fundamentals= *la"- *o and 8hite *o 9esting= 8hite *o 9esting= *asis Path 9esting= Control #tru"ture 9esting= *la"- *o 9esting= O'.e"t Oriented 9esting Methods= 9esting Methods Appli"a'le at the "lass leel= nterClass 9est Case !esign= 9esting for #pe"ialied :nironments= Ar"hite"tures and Appli"ations= 9esting Patterns; ?roject Mana8ement4 9he Management #pe"trum= 9he People= Produ"t= 9he Pro"ess= 9he Pro.e"t= 9he 85<< Prin"iples;
9he
Metr!cs for ?rocess and ?rojects4 Metri"s in the Pro"ess and Pro.e"t !omains= #oftware MeasurementZ Metri"s for #oftware Lualit$= ntegrating Metri"s within #oftware Pro"ess= Metri"s for #mall Organiations= :sta'lishing a #oftware Metri"s Program; 0n!t1I> Est!mat!on4 O'serations on :stimations= 9he pro.e"t planning pro"ess= #oftware #"ope and Feasi'ilit$= esour"es= #oftware Pro.e"t :stimation= !e"omposition 9e"hniJues= :mpiri"al :stimation Models= :stimations for O'.e"t Oriented Pro.e"ts= #pe"ialied :stimation 9e"hniJues= 9he Ma-e@*u$ !e"ision Hua!t9 Mana8ement4 Lualit$ Con"epts= #oftware Lualit$ Assuran"e= #oftware eiews= Formal 9e"hni"al eiews= Formal Approa"hes to #LA= #tatisti"al #oftware Lualit$ Assuran"e= #oftware elia'ilit$= 9he #O 000 Lualit$ #tandards= the #LA Plan Forma Methods4 *asi" Con"epts= O'.e"t Constraint &anguage DOC&E= 9he W spe"ifi"ation language= 9he 9en Commandments for Formal Methods; Ceanroom Soft
Mode ?a;er MCA *)*4 Soft
Max. Marks4 ,)
Answer the following Luestions; :a"h Luestion "arries 14 Mar-s; 1;aE 'E "E dE eE fE g hE
!efine is #oftware Crisis> &ist the adantages of Formal Methods> 8hat is meant '$ BProdu"t is ight> ie the "hara"teristi"s of a good design> :plain top)down integration> oals of #oftware :ngineering> !ifferen"e 'etween :rror and *ug> 8hat is the importan"e of Certifi"ation> 6nit)
2;aE !es"ri'e #oftware Chara"teristi"s; 'E :plain agile software pro"ess; DorE "E :plain #piral Model and its suita'ilit$ dE 8h$ #oftware M$ths 'e"omes "onstraints to software pro"ess; 6nit) 3;aE 8hat is 6se Case> !is"uss a'out the importan"e of 6se Cases in #oftware :ngineering; 'E 8hat is Class> :palin Class esponsi'ilit$ Colla'orator Modeling; DorE "E !is"uss different &eels of !ata Flow !iagrams with the help of an eample; 6nit) 4;aE 8hat is the role of *asis Path 9esting in software testing> 'E 8hat is 9est Case> Prepare a 9est Case for Fa"torial of a num'er; DorE "E !is"uss a'out Fun"tion Oriented Metri"s; dE 8hat is !e'ugging> :plain a'out !e'ugging #trategies; 6nit) 5;aE 8hat are the attri'utes of the Lualit$> 'E :plain Cleanroom software engineering approa"h; DorE "E !es"ri'e the COCOMO Model> dE 8h$ software Lualit$ Assuran"e is important>
MCA *)-.5 4
6RI/ AN/ C&0STER C%M?0TIN6
0n!t1I Introduct!on 4 9he !ata Centre= the rid and the !istri'uted @ = 9he Ar"hite"ture of O#A)!A for Offering rid !ata'ase #eri"es
0n!t1III $hat !s Custer Com;ut!n8L 4 Approa"hes to Parallel Computing= Categories of Clusters Custer M!dde
0n!t1I> Sett!n8 0; and Adm!n!ster!n8 a Custer 4 = !esign Considerations for the Front :nd of a Cluster= #etting 6p odes= Clusters of Clusters or Meta"lusters= #$stem Monitoring= !ire"tor$ #eri"es nside the Clusters , !C:= lo'al Clo"-s #$n"= Administering
C;#;;Pra'hu ? Brid and Cluster Computing)P<D200(E Cha;ters4 1 to 13= 1%= 17; Reference 7ook4
/an-iram= Brid Computing Models I A esear"h Monograph= 9M< D2005E
Mode ?a;er MCA *)-.5 4 6r!d and Custer Com;ut!n8 T!me4 "rs.
Max. Marks4 J)
Ans
8hat is e)s"ien"e> Compare lo'us and &egion; 8hat is a 8e' #eri"e> 8rite different "ategories of Clusters; !efine Cluster middleware; Compare iga'it :thernet with A9M; 8hat is a 8at"hdog timer> 8hat is dou'le faulting> 0NIT – I
2; aE 8hat is meta"omputing> 8hat is its relationship with the grid> 'E 8hat is datagram ar"hite"ture> :plain its main features; DorE "E Compare and "ontrast Condor= Condor= imrod= imrod and M; dE 8hat are the o'.e"ties= fun"tions and a"hieements of lo'al rid Forum DFE> 0NIT 1 II
3; aE :plain what is #OA and how it fun"tions> 'E 8hat is 8#F> 8hat are its 'enefits> 8here is it aaila'le> DorE "E :plain the ar"hite"ture and fun"tionalit$ modules of lo'us 9ool-it D94E; dE 0NIT 1 III
4; aE 8hat is Cluster "omputing > 8h$ is it needed> 'E :plain Cluster middleware design o'.e"ties; DorE "E :plain Condor ar"hite"ture; dE 8hat are the different design issues in etwor-ing@#wit"hing>
inter"onne"tion
0NIT 1 I>
5; aE 8hat are the design "onsiderations for the front end of a "luster> 'E :plain the arious "luster ar"hite"tures and "onfiguration for high aaila'ilit$; DorE "E :plain stati" and d$nami" load sharing approa"h; dE 8hat is !#M> 8h$ is it reJuired in "luster and what are the arious issues in !#M>
K K K K K
MCA *)-.'4
CRYT%6RA?"Y AN/ NET$%R3 SEC0RITY
0n!t1I Introduct!on4 #e"urit$ trends= the O# se"urit$ ar"hite"ture= se"urit$ atta"-s= se"urit$ seri"es= se"urit$ me"hanisms= a model for networ- se"urit$;
Classi"al en"r$ption te"hniJues4 S9mmetr!c c!;her mode=Subst!tut!on techn!@ues= Trans;os!t!on techn!@ues= Rotor mach!nes= Ste8ano8ra;h9. 7ock c!;her and the data encr9;t!on standard4*lo"-"ipher prin"iples= the strength of !:#= !ifferential and linear "r$ptanal$sis= *lo"- "ipher design prin"iples; Conf!dent!a!t9 us!n8 S9mmetr!c Encr9;t!on4 Pla"ement of en"r$ption fun"tion= 9raffi" "onfidentialit$= -e$ distri'ution= random num'er generator; 0NIT1II ?ub!c ke9 cr9;to8ra;h9 and RSA4 Prin"iples of pu'li" -e$ "r$pto s$stems= 9he #A algorithm 3e9 mana8ement4%ther ;ub!c1ke9 !iffie)
cr9;to
s9stems4 e$
management=
Authenti"ation Messa8e authent!cat!on and hash funct!ons4 reJuirements= Authenti"ation fun"tions= message authenti"ation "odes=
Prett$ good pria"$= #@MM:
I? secur!t94 P se"urit$ oeriew= P se"urit$ ar"hite"ture= Authenti"ation header= :n"apsulating se"urit$ pa$load= "om'ining se"urit$ asso"iations= -e$ management; $eb secur!t94 8e' se"urit$ "onsiderations= #e"ure #o"-et &a$er and transport la$er se"urit$= #e"ure ele"troni" transa"tion;
0NIT1I> Intruders4
ntruders= ntrusion dete"tion= password management
Ma!c!ous Soft
8illiam #tallings= BCr$ptograph$ and etwor- #e"urit$= Fourth edition= P<; Cha;ters 4 1=2=3=7==10=11=13=14=15=1%=17=1(=1=20 Reference 7ooks4
1; 8illiam #tallings= Betwor- #e"urit$ :ssentials ? Appli"ations and #tandards= 9hird :dition= Pearson :du"ation D2007E; 2; Chris M"a'= Betwor- #e"urit$ Assessment= 2nd :dition= Oeill$ D2007E; 3; /on :ri"-son= B
Mode ?a;er MCA *)-.'4 Cr9;to8ra;h9 and Net
Max. Marks4 ,)
Ans
eE fE gE hE
A''reiate 6#; 8hat is meant '$ inter"eption> 8hat are the arious pla"es where the data "an get ha"-ed> 8hat is the differen"e 'etween authenti"ation and authoriation> :plain the role pla$ed '$ the "ertifi"ate management authorit$ in proiding se"urit$ for the data; #:PP ar"hite"ture; 8hat are the different elements inoled in "r$ptograph$> !igital signatures; Sect!on17 0n!t1 I
2;aE !is"uss arious wa$s of ha"-ing the data; 'E !is"uss the wa$ to en"r$pt data using su'stitution te"hniJues; :plain it with suita'le eample; DorE "E 8rite the stru"ture of stream "ipher; dE !is"uss the pro"ess of en"r$ption using triple !:# method; 0n!t1 II .aB Ex;a!n /!ff!e1"eman ke9 exchan8e a8or!thm. bB $hat !s hash!n8L $r!te the ;rocedure to cacuate the hash aue !n br!ef.
DorE "E !is"uss different authenti"ation proto"ols; 0n!t1III
4;aE!is"uss #)MM: fun"tionalit$; :plain how it differs from MM:> 'E 8hat is dual signature> :plain the pro"ess of "al"ulating it; DorE "E !is"uss in detail a'out the P se"urit$;
0n!t1I> 5; aE 8rite the rules for sele"ting passwords; Also eplain how a password "an 'e managed> 'E !is"uss arious irus preention measures; DorE "E !es"ri'e firewall design prin"iples;
MCA *)-.4
SIM0&ATI%N M%/E&IN6 AN/ ANA&YSIS
0NIT I4
*asi" simulation ModelingI #$stems = models and simulation= !is"rete):ent simulation = #imulation of an inentor$ s$stem= Pro'lem statements= program organiation and &ogi"= C program= simulation output and dis"ussion= #teps in a #ound #imulation #tud$ Other t$pes of simulationI Continuous simulation= Com'ined !is"rete "ontinuous simulations= Monte Carlo #imulation= #preadsheet simulation= Adantages = disadantages and Pitfalls of #imulation 0NIT II4
Modeling Comple #$stemsI ntrodu"tion= &ist Pro"essing in #imulation= A simple #imulation &anguageI simli'= #ingle #erer Lueueing #imulation with simli'= 9ime)#hared Computer Model= Multiteller *an- with /o"-e$ing= /o')#hop Model= :ffi"ient :ent &ist Manipulation; 0NIT III4
#imulation #oftwareI ntrodu"tion= Comparison of simulation pa"-ages with Programming languages = Classifi"ation of #imulation #oftware; eneral purpose ersus Appli"ation Oriented #imulation Pa"-ages= Modeling Approa"hes= Common Modeling :lements= !esira'le #oftware features= eneral Capa'ilities= #tatisti"al "apa'ilities= Customer support and do"umentation= O'.e"t)Oriented #imulation; 0NIT I>4
andom)um'er eneratorsI ntrodu"tion= &inear Congruential generators = Mied generators= Multipli"atie generators= Composite generators= :mpiri"al 9ests= 9heoreti"al tests= enerating random ariatesI eneral approa"hes to generating random ariates= nerse 9ransform= A""eptan"e ?e.e"tion = enerating "ontinuous andom ariates= 6niform = :ponential= wei'ull and normal; ?rescr!bed 7ook4
1; Aerill M &aw= B#imulation Modeling and Anal$sis= Fourth :dition= 9M< D200(E Cha;ters4 1= 2= 3= 7= ( Reference 7ook 4
/err$ *an-s= /ohn #;Carson And *err$ &; elson , !aid M; i"ol= B!is"rete :ent #$stem #imulation= 3rd :dition= Pearson :du"ation
Mode ?a;er
MCA *)-.4 S!muat!on Mode!n8 And Ana9s!s T!me4 "rs
Max. Marks4,)
Answer the following Juestions; :a"h Juestion "arries 14 Mar-s; 1;aE 'E "E dE eE fE gE hE
ie an$ four appli"ations of #imulation> !efine #$stem #tate; Compare the #imulation Pa"-ages with Programming &anguages; 8hat is the differen"e 'etween erifi"ation and alidation> 8hat is andom aria'le> !es"ri'e the "andidate generation in Jueuing s$stem> !efine *ernouli Prin"iple for andom ariate; 8hat is <$pothesis> 6nit)
2;aE !is"uss a'out steps inoled in simulation stud$> 'E :plain the simulation of nentor$ #$stem> DorE "E 8hat is !is"rete :ent #imulation> !is"uss a'out simulation pro"ess of an$ real world s$stem; dE 8hat are the adantages and disadantages of simulation; 6nit) 3;aE !is"uss a'out the simulation of single serer Jueueing pro"ess; DorE 'E #hips arrie at a har'or with interarrial times that are ! eponential random aria'les with a mean of 1;25da$s; 9he har'or has a do"with two 'erths and two "ranes for unloading the shipsR ships arriing when 'oth 'erths are o""upied .oin a FFO Jueue; 9he time for one "rane to unload a ship is distri'uted uniforml$ 'etween 0;5 and 1;5 da$s; f onl$ one ship is in the har'or= 'oth "ranes unload the ship and the DremainingE unloading time is "ut in half; 8hen two ships are in the har'or= one "rane wor-s on ea"h ship; f 'oth "ranes are unloading one ship when a se"ond ship arries= one of the "ranes immediatel$ 'egins sering the se"ond ship and the remaining seri"e time of the first ship is dou'led; Assuming that no ships are in the har'or at time 0= run the simulation for 0 da$s and "ompute the minimum= maimum= and aerage time that ships are in the har'or Dwhi"h in"ludes their time in 'erthE; Also estimate the epe"ted utiliation of ea"h 'erth and of the "ranes; 6se stream for the interarrial times and stream 2 for the unloading times; 69 4;aE !es"ri'e a'out different "lassifi"ations of #imulation #oftware; DorE 'E ie the features of #$stem #imulation #oftware> 6nit) 5;aE !is"uss a'out different -inds of testing methods andom um'er enerators; DorE 'E :plain the following distri'utions i; ormal !istri'ution;
to "he"- the
ii;
Poisson !istri'ution;
MCA *)( 4 $E7 TEC"N%&%6IES &A7
MCA *)4 $E7 TEC"N%&%6IES 0NIT I "TM&4 Common Ta8s4 &ist= 9a'les= images= forms= Frames= Cas"ading #t$le #heetsR Paa Scr!;t4 ntrodu"tion to /aa #"ripts= O'.e"ts in /aa #"ript= !$nami" <9M& with /aa #"ript; 0NIT II 2M&4 !o"ument t$pe definition= QM& #"hemas= !o"ument O'.e"t model= Presenting QM&= 6sing QM& Pro"essorsI !OM and #AQ C6I Scr!;t!n84 8hat is C> ? !eeloping C appli"ations ? Pro"essing C ? eturning a *asi" <9M& page ? ntrodu"tion to C;pm ? C;pm methods ? Creating <9M& pages d$nami"all$; 0NIT III ntrodu"tion to /!*C ? Conne"tions ? nternal !ata'ase P/7C4 Conne"tions ? #tatements ? esults #ets ) Prepared #tatements ) Calla'le #tatements; Net $eb Serers and Serets4 9om"at we' serer= ntrodu"tion to #erletsI &ife"$"le of a #erlet= /#!= 9he #erlet AP= 9he .aa;serlet Pa"-age= eading #erlet parameters= eading nitialiation parameters; 9he .aa;serlet <99P pa"-age=
Introduct!on to PS?I 9he Pro'lem with #erlet; 9he Anatom$ of a /#P Page= /#P Pro"essing; /#P Appli"ation !esign with MC #etting 6p and /#P :nironmentI nstalling the /aa #oftware !eelopment it= 9om"at #erer , 9esting 9om"at
5; %; 7; (;
?rescr!bed Textbooks 8e' Programming= 'uilding internet appli"ations= Chris *ates 2nd edition= 8&: !reamte"h Dunits = E /aa Programming with /!*C R!onald *ales= OHeill$ D6nit E /aa etwor- Programming= elliotte ust$
Reference Textbooks 3; o'ert 8; #e'esta= BProgramming :dition= Pearson :du"ation D2007E;
the
8orld
8ide
8e'=
9hird
4; Anders Moller and Mi"hael s"hwart'a"h= An ntrodu"tion to QM& and 8e' 9e"hnologies= Addison 8esle$ D200%E 5; Chris *ates= B8e' Programming?*uilding nternet Appli"ationsB= #e"ond :dition= 8ile$ D2007E; %; /effre$ C; /a"-son= B8e' 9e"hnologies ? A Computer #"ien"e Perspe"tie= Pearson :du"ation D200(E; 7; <;M;!eitel= P;/;!eitel= B/aa
%& !eelop and demonstrate a <9M& do"ument that illustrates the
use eternal st$le sheet= ordered list= ta'le= 'orders= padding= "olor= and the SspanV tag; '& 8rite <9M& "ode to proide intra do"ument lin-ing; & Create a form with the following spe"ifi"ationsI
aE Our form uses frames= one to hold the of the 'rowser window; 'E Other is a larger frame that proides "E 9he lin-s 'ar should "ontain 5 lin-s= should displa$ the appropriate <9M& file
lin-s 'ar at the top the main iew; whi"h when "li"-ed= in the larger frame;
& to "reate a we'page with the following using html
a; to em'ed an image in we' page '; to fi the hot spots "; show all the related information when a hot spot is "li"-ed in the map *& !eelop a <9M& Form= whi"h a""epts an$ Mathemati"al
epression; 8rite /aa#"ript "ode to :aluates the epression and !ispla$s the result; +& Create a <9M& form that has num'er of 9et'oes; 8hen the form
runs in the *rowser fill the tet'oes with data; 8rite /aa#"ript "ode that erifies that all tet'oes has 'een filled; f a tet'oes has 'een left empt$= popup an alert indi"ating whi"h tet'o has 'een left empt$; ,& 8rite a /aa#"ript "ode to find the sum of natural um'ers;
D6se user)defined fun"tionE -& 8rite a /aa#"ript "ode to find fa"torial of ; D6se re"ursie
fun"tionE .& 8rite a /aa#"ript "ode 'lo"- using arra$s and generate the
"urrent date in words= this should in"lude the da$= month and $ear; %/& Create a we' page using two image files= whi"h swit"h 'etween
one another as the mouse pointer moes oer the images; 6se the onMouseOer and onMouseOut eent handlers; %%& !esign an QM& do"ument to store information a'out a student in
an engineering "ollege affiliated to A6; 9he information must in"lude "ollege id= ame of the College= *ra"h= ear of /oining= and e)mail id; Ma-e up sample data for 3 students; Create a C## st$le sheet and use it to displa$ the do"ument;
%'& Create an QM& do"ument= whi"h "ontains 10 users information;
mplement a program= whi"h ta-es 6ser d as an input and returns the user details '$ ta-ing the user information from the QM& do"ument %& write a program for implementing student information usng QM& %& write
a .aa program "onne"tiit$ using /!*C
to
illustrate
.aa
to
data'ase
%*& 8rite a program to print the Fi'ona""i num'ers using M; %+& 8rite a program using M to a""ess the data'ase using the
primar$ -e$ alue and return the data to the "lient; %,& 8rite a html program for ino-ing serlet from applet %-& write a .aa serlet program to "ondu"t online eamination and
to displa$ student mar- list aaila'le in a data'ase %.& Create a .aa program to "reate an airline reseration seri"e
and a trael agent and the trael agent is sear"hing for an airline using we'seri"es and data'ase; '/& 8rite a .sp program to "al"ulate in"ome ta= login and data
"apture;
MCA *), 4
>IS0A& ?R%6RAMMIN6 &A7
1; !eelop an isual *asi" Appli"ation to displa$ the Profile of a alid 6ser; ConditionsI i; ii;
Che"- the 6ser with his 6ser ame and Pass 8ord; !ispla$ the Profile of the 6ser; DoteI Profile of the user will 'e an$ of B:A!= B89: and B:A! A! 89:
2; !eelop an isual *asi" Appli"ation to sear"h an item from list of items using *inar$ #ear"h; 3; !eelop an isual *asi" Appli"ation to demonstrate the #ta"Operations; 4; !eelop an isual *asi" Appli"ation to demonstrate the Lueue Operations; 5; !eelop an isual *asi" Appli"ation to "he"- the gien string is palindrome or not; %; !eelop an isual *asi" Appli"ation to find out the fa"torial of the gien num'er '$ using fun"tions 7; !eelop an isual *asi" Appli"ation to Che"- the gien num'er in one of "ategories li-e i; #trong um'er; ii; Perfe"t um'er; iii; Palindrome; DoteI 6se #u' Program Con"eptE (; !eelop an isual *asi" Appli"ation for "op$ing the elements from one list to the other list and i"e)ersa; DoteI mplement #ingle :lement= Multiple :lement 9ransfer 'etween the listsE ; !eelop an isual *asi" Appli"ation to Cal"ulator operations '$ using Control Arra$;
implement
the
10;!eelop an isual *asi" Appli"ation to mplement the 9raffi" #ignal Operations '$ using the following "onditions i; 9hree 9raffi" #ignal named B:!= B:: and B:&&O8 ii; #ignal Flow should 'e :!)V:&&O8)V::; iii; 9ime Out for ed signal is 10= reen signal is 10 and ellow signal is 5; i; Alwa$s ellow #ignal follows either ed or reen; ; ed and reen #ignals will not appear one '$ one; 11;!eelop an isual *asi" Appli"ation to sort the gien list of num'ers; D!Ht use the #ort option of the &ist ControlE
12;!eelop an isual *asi" Appli"ation to read and Print the user data '$ using nput *o and Message *o; 13;!eelop an isual *asi" Appli"ation to ead the !etails of the Candidate using following Conditions i;
ead the ame= Father ame= Address= Lualifi"ations and respe"tie per"entages and :perien"e if an$; ii; Candidate ma$ "hoose an$ 98O O# 9$pes DMAQE iii; Candidate ma$ Choose an$ 9<:: !ata'ase DMAQE i; Candidate ma$ "hoose an$ F: Programming &anguages DMAQE DoteI o Control in the Form will 'e 6&&E 14;!eelop an isual *asi" Appli"ation to generate the 9elephone *ill; 15;!eelop a isual *asi" Appli"ation to ma-e sure$ on different age groups; :ampleI Age groups ma$ 'e D25)34E= D35)44E= D45)54E and V55 and displa$ the no of people on a parti"ular age group; 1%;!eelop an isual *asi" Appli"ation to implement the Arithmeti" operations; i; ii;
Pro.e"t Consists of Four Forms Form1 is used to ead the num'ers and read the operation; iii; Operations are partitioned into two "ategories li-e nteger Arithmeti" and eal Arithmeti" should follow the normaliation prin"iples; i; Choose the appropriate arithmeti" operation under nteger and eal arithmeti" under Addition= #u'tra"tion= Multipli"ation and !iision; ; Form2 is for doing nteger Arithmeti" and Form3 is for doing eal Arithmeti"; i; Form 4 is for !ispla$ the result; 17;!eelop an isual *asi" Appli"ation to ma-e the following data'ase operations '$ using A!O= i; nsert an ew :mplo$ee into the data'ase; ii; !elete an :isting :mplo$ee from the data'ase; iii; 6pdate the emplo$ee information on the 'asis of :mplo$ee num'er; i; #ear"h an emplo$ee details on the 'asis of department num'er;
1(;!eelop an isual *asi" Appli"ation to ma-e the following operations on :mplo$ee data'ase; i; ii;
#ear"h an :mplo$ee on the 'asis of :mplo$ee num'er; aigate and displa$ the re"ords on MO: F#9= MO: :Q9= MO: P:O6#= MO: &A#9;
1;!eelop an isual !ata'ase appli"ation '$ using !ata :nironment and P&@#L& pro"edures; i; nsert the emplo$ee details into the data'ase '$ using P&@#L& Pro"edure; ii; 6pdate the emplo$ee information in 'asis of emplo$ee num'er '$ using P&@#L& pro"edure; iii; !elete a emplo$ee information in 'asis of emplo$ee num'er '$ using P&@#L& pro"edure; i; enerate a report for a; e"entl$ .oined emplo$ees '; !epartment wise and in the order of eperien"e; "; Complete :mplo$ee !etails; 20;!eelop an !ata'ase appli"ation for 9elephone *illing #$stem.
MCA *)J 4 S%FT S3I&&S
?rescr!bed 7ooks 4
1; 8alla"e= Masters= BPersonalit$ !eelopment= Cengage &earning D200(E 2; :dgar 9horpe= #howi"- 9horpe= B8inning at nteriews= #e"ond :dition= Pearson :du"ation D2007E
Reference 7ooks 4
1; Peter 6rs *ender= !r; o'ert A; 9ra"= B#e"rets of Fa"e to Fa"e Communi"ation= Ma"millan D2007E 2; !eepi-a elson= B:ssential e$ for Corporate 9hreshold= *# Pu'li"ations D200(E
MCA -)5 4 /ATA $ARE"%0SIN6 AN/ /ATA MININ6 0n!t – I
8arehouseI 8hat is it= 8ho eed t= and 8h$>= 9hings to Consider= Managing the !ata 8arehouse= !ata 8arehouse !esign Methodolog$= !ata Marts and #tart #"hema !esign= Fundamentals of :9& Ar"hite"ture= Partitioning !ata= ndeing !ata; 0n!t – II
!ata mining ? ntrodu"tion= !ata mining on what -ind of data = !ata mining fun"tionalities "lassifi"ation of !ata mining s$stems= Ma.or issues in !ata mining Mining Asso"iation rules in large data'ases ) Asso"iation rule mining= Mining single)!imensional *oolean asso"iation rules from 9ransa"tional data'ases= Mining multi)!imensional Asso"iation rules from relational !ata'ases and !ata 8arehouses 0n!t – III
Classifi"ation and Predi"tion ) ntrodu"tion "lassifi"ation '$ de"ision tree indu"tion= *a$esian Classifi"ation; Other "lassifi"ation methods= "lassifi"ation '$ 'a"propagation= Predi"tion= "lassifier a""ura"$ 0n!t – I>
Cluster anal$sis ? ntrodu"tion t$pes of data in "luster anal$sis a "ategoriation of ma.or "lustering methods portioning methods= hierar"hi"al methods= !ensit$ 'ased methods=I !*#CA= rid)'ased method I #9 = Model 'ased "lustering methodI #tatisti"al Approa"h= outlier anal$sis; ?rescr!bed 7ooks 4
1; Mi"hael Core$= Mi"hael A''e$= an A'ramson= *en 9au'= BOra"le (i !ata 8arehousing= 9M< DFor 6nit)E 2; /iawei
1
#;;#ianandam= #;#umathi= B!ata Mining ? Con"epts= 9as-s and 9e"hniJues= 9homson D200%E; 2 alph im'all= B9he !ata 8arehousing 9ool-it= 8ile$; 3 Margaret <; !unham= B!ata mining ) ntrodu"tor$ and adan"ed topi"s=Pearson :du"ation; 4 !;
Mode ?a;er MCA -)5 4 /ata $arehous!n8 and /ata M!n!n8 T!me4 "rs Max. Marks4 J) Answer the following Juestions; :a"h Luestion Carries 1% Mar-s;
1;DaE D'E D"E DdE DeE DfE DgE DhE
8hat is O&AP> !is"uss a'out O&AP operations; 8hat is Multidimensional Model> 8hat is eneralied ule> :plain a'out different "luster "ategories; 8hat -inds of data used in !ata Mining> 8hat is Meta data> !es"ri'e the t$pes of Metadata; 8hat is :pisode !is"oer$> 6nit)
2;DaE 8hat is !ata 8arehouse> !is"uss the differen"e 'etween 8arehouse and !ata'ase; D'E 8hat is 8arehouse #"hema> !is"uss a'out #tar #"hema; DorE D"E !is"uss a'out the phases of 8arehouse Ar"hite"ture; DdE !is"uss a'out ndeing 9e"hniJues used to organie the data in the !ata 8arehouse; 6nit) 3;DaE !is"uss and Compare i; Priori Algorithm; ii; PAM Algorithm D'E 8hat is Asso"iation ule> s eer$ su'set of an$ itemset must "ontain either a freJuent set or a 'order set; /ustif$; DorE D'E !is"uss a'out FP)9ree rowth Algorithm; D"E !is"us a'out arious "ategories of Asso"iation ules 6nit) 4;DaE 8hat is !e"ision 9ree> !is"uss a'out !e"ision 9ree Constru"tion Algorithms; D'E !is"uss a'out *a$esian Classifi"ation; DorE D"E 8hat is the purpose of eural etwor-> !is"uss a'out t$pes of eural etwor-s> DdE !is"uss a'out salient features of the generi" algorithm>
5;DaE D'E D"E DdE
6nit) 8hat is "lustering> !is"uss a'out arious "ategories of "lustering; !is"uss a'out !*#CA Algorithm; DorE !is"uss a'out *C< "lustering !is"uss a'out #9 Algorithm with eample;
MCA -)' 4 .NET ?R%6RAMMIN6 0NIT1I4 >!sua bas!c '))-4 6ett!n8 started !sua 7as!c '))-4 Arithmeti" Operators= !ata t$pe= #tatements= Control #tatements= &oops= Arra$s= #tru"tures=al and #tru"ture fun"tions= Creating isual studio Appli"ations= #aing isual *asi" 2005 Appli"ation; %bject %r!ented ?ro8ramm!n84 *asi" Prin"iples of O'.e"t Oriented Programming= Mem'er A""ess Modifiers= !efine Class= "reating O'.e"ts= Constru"tors= nheritan"e= A'stra"t Classes= nterfa"es= Pol$morphism $!ndo
7utton= Combo7ox and &!st7ox Contros4 &a'el Control= Com'o*o Control= &ist*o Control=
Panel Control= ?ane= ?!cture7ox= ?ro8ress 7ar and T!mer Contros4 Pi"ture 'o Control= Progress *ar Control= 9imer Control= Pro.e"t Checkbox= rad!o button= and 8rou; box contros 4Che"-'o "ontrol= adio 'utton "ontrol= Progress 'ar "ontrol= 9imer "ontrol= Pro.e"t; Menus= bu!t1!n d!ao8 box= ;r!nt!n8 and tree !e< contros4 Menus= Folder *rowser !ialog Control= Open File !ialog Control #ae File !ialog Control= Font File !ialog Control= Color File !ialog Control= Print !o"ument Control= 9ree iew Control= Pro.e"t Mouse Eents and 3e9board Eents4
Mouse :ents= e$'oard :ents
"and!n8 Errors and Exce;t!ons4 :rrors= :"eptions
0NIT1II 4 AS?.NET '.) AS?.NET '.) Essent!as4 ntrodu"tion to Asp;:9= *enefits Asp;:9= 8hatHs new Asp;:9>= ntrodu"tion Asp;:9 2;0 !:
of
/eeo;!n8 a $eb A;;!cat!on 4<9M&= !<9M&= P
ntrodu"tion to standard "ontrols= &a'el Standard Contros4 Control= 9et*o Control= *utton Control= mage *utton Control &ist*o Control= adio *utton Control
Na!8at!on Contros4 ntrodu"tion to aigation Controls= #ite Map Path Controls= Menu Controls= 9ree iew Controls >a!dat!on Contros4 ntrodu"tion to alidation "ontrol= *ase alidator "lass= eJuired field alidator "ontrol= ange alidator "ontrol= egular :pression alidator "ontrol= Compare alidator "ontrol= Custom alidator "ontrol= alidation summar$ "ontrol &o8!n contros4 ntrodu"tion to login "ontrols= &ogin "ontrol &ogin iew "ontrol= &ogin name "ontrol= &ogin status "ontrol Password re"oer$ "ontrol
eed for Master Pages and 9hemes= Master ;a8es and Themes4 Creating a #imple Master Page= Creating a ested Master Page 9hemes= Creating 9hemes= Appl$ing 9hemes on "ontrols at un time 0NIT1III4 C '))Introduct!on to >!sua C '))-4ntrodu"tion= Features of isual CX 2005= Creating isual CX 2005= e$ words= dentifiers= !ata 9$pes= aria'les= #"ope of aria'les= Constants= Operators Operator Pre"eden"e and Asso"iatiit$= :pressions= Pun"tuators Control #tatements= &oops= nterrupting &oops using /ump #tatements= Creating Arra$s= Creating :numerations= Creating #tru"tures= Methods %bject %r!ented ?ro8ramm!n8 4 *asi" Prin"iples of O'.e"t Oriented Programming= Mem'er A""ess Modifiers= !efining a Class= Creating O'.e"ts= Constru"tors= #tati" Mem'ers= nheritan"e= A'stra"t Class=nterfa"es= Pol$morphism= Operator Oerloading $!ndo
0NIT1I> 4 A/%.Net Q /ata 7!nd!n8 4
8hat are !ata'ases> Access!n8 /ata us!n8 A/%.NET C '))-B4 *asi" #L& #tatements= 8or-ing with A!O;:9= Oeriew of A!O;:9 O'.e"ts !ata rid iew Control= A""essing !ata using #erer :plorer= Creating a new data "onne"tion= A""essing data using data adaptors and data sets= Preiewing data from data adaptors Conne"ting to an M# /et data'ase ntrodu"tion= #imple !ata /ata 7!nd!n8C '))-B4 Comple !ata *inding= mplementing !ata *inding= Pro.e"t
*inding=
$ork!n8 8or-ing with A!O;:9= Oeriew of A!O;:9 O'.e"ts= *asi" #L& statements= A#P;:9 2;0 data displa$ "ontrols= A#P;:9 2;0 data sour"e "ontrols= A""essing data with serer eplorer= Creating a we' appli"ations using data displa$ "ontrols Access!n8 data us!n8 A/%.NET >!sua 7as!c '))-B4 8hat are !ata'ases>= *asi" #L& statements= 8or-ing with A!O;:9= Oeriew of A!O;:9 o'.e"ts= !ata rid iew Control= A""essing data using serer eplorer= Creating a new data "onne"tion= A""essing data using !ata Adapters and !atasets= Preiewing data from !ata Adapters= Conne"ting to an M# /et data'ase /ata 7!nd!n8 >!sua 7as!c '))-B4 ntrodu"tion= #imple !ata *inding= Comple !ata *inding= mplementing !ata *inding= Pro.e"t
?rescr!bed 7ook4
i-as upta= B;et Programming= !ream 9e"h D200(E; Cha;ters 4 69 ? ) 1 to (= 11 "hapters in isual *asi" 2005 69 ? ? 1 to 7= "hapters in A#P;:9 2;0 69 ? ? 1 to (= 11 "hapters in CX 2005 69 ? ? = 10 "hapters in isual *asi" 2005= ( "hapter in A#P;:9 2;0= = 10 "hapters in CX 2005 Reference 7ooksI
1;
Que *ai= Mi"hael :-edah= B9he Programming= 9homson D200%E;
2;
ogent #olutions n";=;et Programming= *la"- *oo-= !ream 9e"h D200(E;
3;
/oe !uff$= BProfessional;et Programming 2;0= 8ile$;
4;
eorge #tepherd= BA#P;:9 3;5 Mi"rosoft= P< D200(E; Mode ?a;er
8e'
8arrior
uide
to
8e'
MCA -)'4 .Net ?ro8ramm!n8 T!me4 "rs
Max. Marks4 J)
Ans
1;aE 'E "E dE eE fE
!efine data 'inding :plain login "ontrols 8hat is master page !es"ri'e !ata Adapter :plain do"-ing and an"horing "ontrols ie the differen"e 'etween "he"- 'o radio 'utton and group 'o "ontrols gE !efine eent and write different t$pes of eent hE 8hat are the "hara"teristi"s of interfa"e 0n!t1I
2;aE *riefl$ eplain a'out data t$pes and -e$words; 'E 8rite the pro"edure for an appli"ation whi"h "he"-s whether the entered user is alid or not; DOrE "E :plain the following "ontrols i; Menus ii; 9imer iii; Pi"ture*o i; 9ree iew "E :plain mouse eents and -e$ 'oard eents; n!t)II
3; aE :plain all the alidation "ontrols; 'E 8rite the pro"edure to design the appli"ation whi"h allows the alid user to enter into it; DorE "E *riefl$ eplain a'out master pager and themes dE 8ith suita'le eample eplain the naigation "ontrols; 0n!t)III
4;aE 8hat are the "on"epts of o'.e"t oriented programming; 'E :plain the following "ontrols i; Com'o*o ii; &ist*o iii; Panel i; *uiltin dialog*o DorE "E :plain the steps inoled in windows form design and interfa"e dE 8rite the pro"edure for "offee shop 'illing appli"ation Duse "he"-'oE
0n!t)I>
5;aE 8hat is data 'inding> :plain the t$pes of data 'inding how data 'inding "an 'e implemented; 'E 8hat are the A!O;:9 o'.e"ts; DorE "E !eelop an appli"ation for student details whi"h i; Can a""ess data'ase ii; Can 'ound to the "ontrols iii; Can displa$ the details in a form
K K K K K
MCA -)4 /ESI6N AN/ ANA&YSIS %F A&6%RIT"MS 0n!t1I Introduct!on 4 8hat is Algorithm ? Algorithm #pe"ifi"ation I Pseudo"ode Conentions ? e"ursie Algorithms R Performan"e Anal$sisI #pa"e Compleit$ ? 9ime Compleit$ ? As$mptoti" notation ? Performan"e MeasurementR andomied Algorithms I *asi"s of pro'a'ilit$ theor$ ? andomied algorithms ? dentif$ing the repeated element= Primalit$ 9esting ? Adantages and !isadantages; Eementar9 /ata Structures4 #ta"-s and Lueues R 9rees I 9erminolog$ ? *inar$ 9rees R !i"tionaries I *inar$ #ear"h 9rees R Priorit$ Lueues I
0n!t–I> 7ranch and 7ound I 9he MethodI &east Cost sear"h ? 9he 15 pule ? "ontrol a'stra"tions for &C sear"h ? *ounding ? FFO *ran"h ? and ? *ound ? &C *ran"h and *oundR 0@1 -napsa"- pro'lemI &C *ran"h and *ound solution ? FFO *ran"h and *ound solutionR 9raeling #ales person; N?1"ard and N? – com;ex ;robems 4 *asi" "on"epts I on deter) ministi" algorithms ?9he "lasses P hard and P "omple R Coo-Hs theorem ? P hard graph pro'lems I CliJue !e"ision Pro'lem ? ode "oer de"ision pro'lem ? "hromati" num'er de"ision pro'lem ? !ire"ted
#arta. #ahni=Fundamentals of Computer Algorithms= #e"ond :dition= 6niersities Press D200(E Cha;ters 4 1 to ( and 11 Reference 7ooks 4
1;
Anan$ &eitin= Bntrodu"tion to the !esign , Anal$sis of Algorithms= #e"ond :dition= Pearson :du"ation D2007E;
2;
;Chandra Mohan= !esign and Anal$sis of Algorithms= P<;
3;
Pra'ha-ar upta= ineet Agrawarl= Algorithms= P<;
B!esign
and
Anal$sis of
4;
Parag
Anal$sis of
Algorithms=
and
Mode ?a;er MCA -)4 /es!8n /es!8n And Ana9s!s %f A8or!thms T!me 4 hrs
Max Marks 4 ,)
Ans
1; aE 'E "E dE
8hat 8hat are are :plain dominan"e rule; #tate the general method for d$nami" programming; 8rite the differen"e 'etween diide)and)"onJuer and the greed$ method; eE #tate the prin"iple of optimalit$ > fE 8rite the formulae deeloped '$ strassen to multipl$ matri"es > gE 8hat is the aerage time "ompleit$ for "onstru"ting a heap tree > 0NIT – II
2; aE :plain :plain "ontrol a'stra"ti a'stra"tion on for diide diide ? and ? "onJuer strateg$; D7ME 'E :plain the pro"ess of "onstru"ting "one hull; Also write its algorithm and "ompleit$ ; D7ME DorE "E !erie the aerage time "ompleit$ for Jui"- sort; D7ME dE 8rite a randomied algorithm to perform primalit$ testing; D7ME 0NIT – III 3; aE #tate the pro'lem pro'lem of Boptimal Boptimal storage storage on tapes; tapes; f three programs of length Dl1=l2=l3 E D5=10=3E;Find the optimal wa$ to store those programs on tapes using greed$ method; D7ME 'E Find optimal 'inar$ sear"h tree for the identifiers Ddo= if= whileE; &et pD1I3E D3=3=1E and JD0I3ED2=3=1=1E; #ole it using d$nami" programming D7ME DorE "E 8rite the pro'lem of tree erte splitting; Find the pla"es where 'oosters are needed for the following tree= for δ5 D7ME %
'
* + dE #ole O@ napsa"-= f the napsa"- instan"e n3
Dw1=w2=w3ED2=3=4E , Dp1=p2=p3ED1=2=5E and m%; D7ME 0NIT – I>
4; aE #ole sum sum of su'sets su'sets pro'lem pro'lem for n%=m30= n%=m30= w[1I%\]5=10=12=13=15=1(^; 'E Find "onne"ted "omponents , spanning tree for I
%
D7ME D7ME
*
'
DorE "E #ole ()Jueues pro'lem; dE 8rite different traersal te"hniJues for graphs;
D7ME D7ME
0NIT – >
5; aE 8rite a "omplete "omplete &C 'ran"h 'ran"h and 'ound algorithm algorithm for for napsa"pro'lem D7ME 'E 8rite an non)deterministi" algorithm to sort arra$ elements; D7ME DorE "E :plain the prin"iples of D7ME iE "ontrol a'stra"tion for &C sear"h iiE *ounding iiiE FFO 'ran"h , 'ound iE &C 'ran"h and 'ound dE 8rite the relationship 'etween P=P and P)"omplete= P)hard pro'lems; D7ME
K K K K K
MCA -)*.54 -)*.54 EM7E//E/ EM7E//E/ SYSTEMS 0n!t I
:m'edded s$stem oeriew=!es oeriew=!esign ign "hallenges=Pr "hallenges=Pro"esso o"essor r Introduct!on.4:m'edded te"hnolog$;=C te"hnolog$=!esign te"hnolog$=9rade offs; Custom s!n8e ;ur;ose ;rocessors4 "ard
ntrodu"t u"tion ion= = *asi" *asi" 6enera ;ur;ose ; ro c e ss o r s 4 Soft
ntrodu"t u"tion ion= = Commun Communi"a i"atio tion n 'asi"s= 'asi"s= Mi"rop Mi"ropro" ro"ess essor or Interfac!n84 ntrod interfa"ing ?@O addressing= Mi"r i"ropro"essor inter terfa"ing ? nterr nterrupt upts= s= Mi"rop Mi"ropro" ro"ess essor or interf interfa"i a"ing ng ? !MA= !MA= Ar'itr Ar'itrati ation= on= Multi Multi leel 'us ar"hite"tures= Adan"ed "ommuni"ation prin"iples= #erial proto"ols= Parallel proto"ols= 8ire less proto"ols 0n!t I> /!8!ta camera exam;e4 ntrodu"tion= ntrodu"tion to simple digital "amera= eJuirements spe"ifi"ations= !esign State mach!ne and concurrent ;rocess modes4 ntrodu"tion= Models s languages= tet s graphi"s= An introdu"tor$ eample= A 'asi" state ma"hine model)F#M= Finite state ma"hine with data path model)F#M!= 6sing state ma"hine=
Mode ?a;er MCA -)*.54 Embedded S9stems T!me4 "rs
Max. Marks4 ,)
Answer the following Juestions; :a"h Luestion Carries 14 Mar-s; 1;DaE !efine three main "hara"teristi"s of :m'edded #$stems; D'E 8hat is a design metri"> D"E !es"ri'e wh$ a general purpose pro"essor "ould "ost less than a single ? purpose pro"essor; DdE Compose 1 Q ( OM# into 1 Q 32 OM; DeE !efine eal)9ime "lo"-; DfE :plain the differen"e 'etween port 'ased @O and 'us)'ased @O; DgE !efine eal)9ime s$stems and real time operating s$stem; DhE !ifferen"e 'etween F#M and F#M!; 6nit) 2; aE !es"ri'e "ommon !esign metri"s of an em'edded s$stem; 'E :plain the importan"e of pro"essor te"hnolog$= C te"hnolog$ and !esign te"hnolog$ in designing a :m'edded #$stem; DorE "E 8hat are the steps inoled in designing "ustom single ? purpose pro"essor; dE :plain 9)leel "ustom single purpose pro"essor design; 6nit) 3; aE !es"ri'e steps inoled in designing a general)purpose pro"essor; 'E :plain different software design tools that are used '$ em'edded s$stem designers; DorE "E :plain pulse width modulators; dE :plain stepper Motor "ontrollers; 6nit) 4; aE !is"uss different t$pes of OMHs and AMHs; 'E 8hat is Ca"he > :plain Ca"he mapping te"hniJues; DorE "E !es"ri'e different t$pes of serial= parallel and wireless proto"ols; dE !is"uss different ar'itration methods; 6nit) 5; aE llustrate the !esign of a !igital Camera; DorE 'E :plain "ommuni"ation and s$n"hroniation among pro"esses; "E !es"ri'e F#M with eample;
MCA -)*.'4 M%7I&E C%M?0TIN6 0n!t – I Introduct!on4 Mo'ilit$ of 'its and '$tes= 8ireless ? the 'eginning= mo'ile "omputing= dialogue "ontrol= networ-s= middleware and gatewa$s= appli"ations and seri"es= deeloping mo'ile "omputing appli"ations= se"urit$ in mo'ile "omputing= standards ? wh$ is it ne"essar$= standard 'odies= pla$ers in the wireless spa"e Mob!e com;ut!n8 arch!tecture4 o!ce oer Internet ;rotoco and coner8ence4 oi"e oer P= <;323 frame worfor oi"e oer P= #ession initiation proto"ol D#PE="omparison 'etween <;323 and #P= real time proto"ols= "onergen"e te"hnologies= "all routing= oi"e oer P appli"ations= P Multi media su's$stem DM#E= mo'ile oP Secur!t9 !ssues !n mob!e com;ut!n84 ntrodu"tion= information se"urit$= se"urit$ te"hniJues and algorithms= se"urit$ proto"ols= pu'li" -e$ infrastru"ture= trust= se"urit$ models= se"urit$ framewor-s for mo'ile enironment
?rescr!bed 7ook4 Com;ut!n8 9M< D200(E Aso-e 9alu-der and oopa aagal= Mob!e B Cha;ters4
1 to 10= 17=1(;
Reference 7ook 4
a.-amal= BMo'ile Computing= Oford D200(E;
Mode ?a;er MCA -)*.' Mob!e com;ut!n8 T!me 4 "rs
Max. Marks4 ,) Sect!on – A
Ans D"E!efine inter leaing; DdE#M# s; MM#; DeE8hat is transport la$er proto"ol that supports nternet 9elephon$> DfE8hat are Ad DgE8rite some of the appli"ations of P#; Sect!on – 7 0n!t – I '. DaE8rite the ar"hite"ture of mo'ile "omputing; D'E8rite the middle ware software and gatewa$s needed in mo'ile "omputing; orB D"E!eelop a theatre 'oo-ing appli"ation; DdECompare wireless networ-s with wired networ-s;
,M ,M ,M ,M
0n!t –II . DaE:plain the *luetooth proto"ol sta"-; ,M D'E ,M orB D"E:plain tunneling operations in mo'ile P and also the relation 5*M ship 'etween mo'ile P and "ellular P; 0n!t – III *. DaE:plain MM# enironment; D'E&ist out 3 appli"ations;
,M ,M orB
D"E:plain 8A: logi"al model; DdE:plain the appli"ations for P#;
,M ,M
0n!t –I> -. DaECompare 'etween <;323 and #P; D'E!is"uss the features of 8i ? Fi; orB D"E!is"uss the arious se"urit$ models in mo'ile "omputing;
,M ,M
5*M
MCA -)*. 4 C&%0/ C%M?0TIN6 0NIT – I INTR%/0CTI%N4 Cloud Computing ntrodu"tion= From= Colla'oration to "loud= 8or-ing of "loud "omputing= pros and "ons= 'enefits= deeloping "loud "omputing seri"es= Cloud seri"e deelopment= dis"oering "loud seri"es; 0NIT – II C&%0/ C%M?0TIN6 F%R E>ERY%NE4 Centraliing email "ommuni"ations= "loud "omputing for "ommunit$= "olla'orating on s"hedules= "olla'orating on group pro.e"ts and eents= "loud "omputing for "orporation= mapping s"hedulesm managing pro.e"ts= presenting on road; 0NIT – III 0SIN6 C&%0/ SER>ICES4 Colla'orating on "alendars= #"hedules and tas- management= eploring on line s"heduling and planning= "olla'orating on eent management= "olla'orating on "onta"t management= "olla'orating on pro.e"t management= "olla'orating on word pro"essing= spreadsheets= and data'ases; 0NIT – I> %0TSI/E T"E C&%0/ 4 :aluating we' mail seri"es= :aluating instant messaging= :aluating we' "onferen"e tools= "reating groups on so"ial networ-s= :aluating on line groupware= "olla'orating ia 'logs and wi-is 0NIT – > ST%RIN6 AN/ S"ARIN6 4 6nderstanding "loud storage= ealuating on line file storage= eploring on line 'oo- mar-ing seri"es= eploring on line photo editing appli"ations= eploring photo sharing "ommunities= "ontrolling it with we' 'ased des-tops;
?rescr!bed book 4
Mi"hael Miller= BCloud Computing= Pearson :du"ation= ew
REFERENCES4 5.
Mode ?a;er MCA -)*.4 Coud Com;ut!n8 T!me4 "rs
Max. Marks4 ,)
Ans
%& aE 'E "E dE eE fE gE
Peer)to)peer Computing Colla'oratie Computing #oftware as a #eri"e /otlet prioritie *list e$e O#
Ans
69 ? 2; :plain the whole eolution of simple des-top "omputing to Cloud Computing during different points of time in the histor$; 3; aE 8ho 'enefits from Cloud Computing > 'E !is"uss a'out the Pros and Cons of Cloud #eri"e !eelopment; 69 ? 4; aE :la'orate on usage of Cloud "omputing for "olla'orating on "onta"t lists; 'E !is"uss a'out the usage of Cloud Computing "olla'orating on s"hedules;
in the "ontet of
5; aE !is"uss a'out Managing Pro.e"ts; 'E 8hat do $ou understand '$ a irtual Compan$ in the "ontet of Cloud Computing eplain in detail; 69 ) %; Compare and Contrast different online Calendar appli"ations; 7; aE !is"uss a'out different online s"heduling appli"ations; 'E :plore Online Planning and 9as- Management; 69 ? (;aE:aluate different 8e' Mail #eri"es; 'E:aluate different 8e' Conferen"ing 9ools; ;:plain a'out the features of different #o"ial etwor-ing #ites
MCA -)-.54 IMA6E ?R%CESSIN6 0NIT I4
ntrodu"tion= mage #hape=
#tatisti"al Operations)ntrodu"tion= ra$)&eel 9ransformations=
Morphologi"al And Other Area Operations)ntrodu"tion= *asi" Morphologi"al Operations= Opening And Closing Operations= Finding *asi" #hapes)Com'ining :dges= 4
FreJuen"$ !omain)ntrodu"tion=
ntrodu"tor$ Computer ision And mage Pro"essing ? Adrian &owI= MC raw
1;
!igital mage Pro"essing ? o.ele ? Addison 8esle$;
2;
*;Chanda= !;!utta Ma.under= B!igital mage Pro"essing= P< D200(E;
MCA -)-.'4 MICR%?R%SS%RS AN/ INTERFACIN6 0NIT 1 I Introduct!on 4 Oeriew of Mi"ro"omputer #$stems4 #oftware= Addresses ? eneral Operation of a Mi"ropro"essors in !igital #$stem !esign;
? ?
J)J( Arch!tecture4 CP6 Ar"hite"ture ? nternal Operation = Ma"hine &anguage nstru"tionI Addressing modes ? nstru"tion Formats; Assember &an8ua8e ?ro8ramm!n84 Assem'ler nstru"tion Format ? !ata 9ransfer nstru"tions = Arithmeti" nstru"tionsI *inar$ Arithmeti" ? Pa"-ed *C! Arithmeti" ? 6npa"-ed *C! Arithmeti"= *ran"h nstru"tionsI Conditional *ran"h nstru"tions ) 6n"onditional *ran"h nstru"tions= &oop nstru"tions ? OP and <&9 nstru"tions ? Flag Manipulation nstru"tions ? &ogi"al nstru"tions ? #hift and otate nstru"tions = !ire"ties and OperatorsI !ata !efinition and #torage allo"ation ? #tru"tures ? e"ords ? Assigning ames to :pressions ? #egment !efinitions ? Program 9ermination ? Alignment !ire"ties ? alue returning attri'ute operators; 0NIT 1 II Moduar ?ro8ramm!n84 &in-ing and elo"ationI #egment Com'ination ? A""ess to :ternal dentifiers= #ta"-s = Pro"eduresI "alls= returns= and Pro"edure !efinitions ? #aing and estoring egisters ? Pro"edure Communi"ation ? e"ursie Pro"edures= nterrupts and nterrupt outines= Ma"rosI A#M)(% Ma"ro Fa"ilities ? &o"al &a'els ? ested Ma"ros ? Controlled :pansion and Other Fun"tions; I#% ?ro8ramm!n84 Fundamental @O Considerations ? Programmed @O ? nterrupt @O ? *lo"- 9ransfers and !MA; 0NIT 1 III S9stem 7us Structure4 *asi" (0(%@(0(( ConfigurationsI Minimum Mode ? Maimum Mode= #$stem *us 9iming= nterrupt Priorit$ ManagementI nterrupt #$stem *ased on a #ingle (25A; I#% Interfaces4 #erial Communi"ation nterfa"esI As$n"hronous Communi"ation ? #$n"hronous Communi"ation ? Ph$si"al Communi"ation #tandards ? (251A Programma'le Communi"ation nterfa"e= Parallel Communi"ationI (255A Programma'le Peripheral nterfa"e ) A@! and !@A :ample= Programma'le 9imers and :ent CountersI ntelHs (254 Programma'le nteral 9imer ? nteral 9imer Appli"ation to A@!= !MA Controllers;
0NIT 1 I> Adanced M!cro;rocessors4 9he (03(% I ntrodu"tion ? Operating Modes ? Pro"essor Model ? Programming Model= 9he (04(% I ntrodu"tion ? Pro"essor Model ? Programming Model= 9he Pentium I ntrodu"tion ? Pro"essor Model ? Programming Model ? 9he Pentium :oles ? 9he Pentium MMQ= 9he P% Pro"essors I ntrodu"tion ? Oeriew ? Pro"essor Model ? ew Ar"hite"tural Features;
?rescr!bed 7ooks 4
1; u)Cheng &iu= lenn A i'son= BMi"ro"omputer #$stemsI 9he (0(%@(0(( Famil$= #e"ond :dition= Pearson :du"ation D200(E Cha;ters 4 1;1= 1;3 ? 1;5= 2;1 ) 2;3= 3;1 ? 3;10= 4;1 ? 4;5= %;1 ? %;4= (;1 ? (;2= (;3;1= ;1;1= ;1;2= ;1;4= ;2= ;3= ;5
2; /ohn 6ffen'e"-= B9he (0(% Famil$ !esign= Programming and nterfa"ing= 9hird :dition= Pearson :du"ation D200%E Cha;ters4 3;3= 3;5 ? 3;7
Reference 7ook4
1;
!ouglas
2;
;Mathianan= BMi"ropro"essors= PC
3;
enneth /; A$ala= B 9he (0(% Mi"ropro"essor I Programming , nterfa"ing 9he PC= Cengage &earning D200(E
4;
*arr$ *; *re$= B9he ntel Mi"ropro"essors= #eenth :dition= P<
Mode ?a;er MCA -)-.'4 M!cro;rocessors and Interfac!n8 T!me4 "rs
Max. Marks4 ,)
Ans
ole of address lines; !ifferen"e 'etween "ontrol flag and status flag; ie and eplain the instru"tion to a""ess sta"- pointer; !ifferen"e 'etween 9 and 9O instru"tions; 8h$ an interfa"ing is reJuired; !ifferen"e 'etween Pentium and Pentium MMQ; 8hat is the width of Pentium address 'us> 0NIT 1 I
2;aE :plain addressing modes of (0(% with suita'le eample; 'E !es"ri'e the memor$ segmentation in (0(%; orB "E 8ith suita'le eample eplain data transfer and logi"al group instru"tions of (0(%; dE :plain different assem'ler dire"ties of (0(% assem'ler; 0NIT 1 II .aB Ex;a!n the conce;t of stack. bB "o< J)J( macros are decared and used !n the ;ro8ram. DorE "E !es"ri'e interrupt @O; 0NIT – III
4;aE !raw and eplain timing diagram for input operation in (0(% minimum mode; 'E :plain operation of (0(% in its maimum mode; orB "E !raw and eplain fun"tions of (255A programma'le peripheral interfa"e;
69 ) 5;aE !es"ri'ed Ar"hite"tural details of Pentium pro"essor; orB 'E !es"ri'ed the ar"hite"tural details of (04(%;
MCA -)-. 4 $E7 EN6INEERIN6 0n!t1I $eb17ased S9stems4 9he 8e'= 8e' Appli"ations $eb En8!neer!n84 8hat is 8e' :ngineering= :ngineering= 8e' :ngineering *est Pra"ti"es
9he
Components of 8e'
A $eb En8!neer!n8 ?rocess4 !efining the Framewor-= n"remental Pro"ess Flow= eneri" A"tions and 9as-s for the 8e': FrameworCommun!cat!on4 9he Communi"ation A"tiit$= Formulation :li"itation= dentif$ing 8e'App n"rements= egotiation 0n!t1II ?ann!n8 4 6nderstanding #"ope= efining Framewor- A"tiities= *uilding a 8e': 9eam= Managing is-= !eeloping a #"hedule= Managing Lualit$= Managing Change= 9ra"-ing the Pro.e"t= Outsour"ing 8e': 8or-; Ana9s!s Mode!n8 for $ebA;;s4 6nderstanding Anal$sis in the Contet of 8e':= Anal$sis Modeling for 8e'Apps= 6nderstanding the 6sers= 9he Content Model= 9he ntera"tion Model= 9he Fun"tional Model= 9he Configuration Model= elationship)aigation Anal$sis; $ebA;; /es!8n 4 !esign for 8e'Apps= !esign oals= !esign and 8e'App Lualit$= 9he !esign Pro"ess= nitial !esign of the Con"eptual Ar"hite"ture= nitial !esign of the 9e"hni"al Ar"hite"ture 0n!t1III Interact!on /es!8n 4 nterfa"e !esign Prin"iples and uidelines= nterfa"e !esign 8or-flow= nterfa"e !esign Preliminaries= nterfa"e !esign #teps= Aestheti" !esign= 6sa'ilit$= !esign ssues; Informat!on /es!8n 4 nformation Ar"hite"ture= Organiing Content= #tru"turing the information #pa"e= *lueprints I Adding !etail to a stru"ture= A""essing nformation= 8ireframe Models= aigation !esign I Creating the !etailed stru"ture= #ummariing the !esign Pro"ess; Funct!ona /es!8n 4 8e'App Fun"tionalit$= 9he ature of 8e'App Fun"tionalit$= Fun"tional !esign in the !esign Pro"ess= Fun"tional Ar"hite"ture= !etailed Fun"tional !esign
0n!t1I> Construct!on and /e;o9ment 4 Constru"tion and !eplo$ment within the 8e': Pro"ess= Constru"tion= Constru"tion Prin"iples and Con"epts= !eplo$ment= Constru"tion and the 6se of Components= Component)&eel !esign uidelines= Component !esign #teps Technoo8!es and Toos 4 eneral ssues= mplementation 9ools and 9e"hnologies= !eelopment 9ools and 9e"hnologies Test!n8 $ebA;;s 4 9esting Con"epts= 9he 9esting Pro"ess)An Oeriew= Content 9esting= 6ser nterfa"e 9esting= 6sa'ilit$ 9esting= Compati'ilit$ 9esting= Component)&eel 9esting= aigation 9esting= Configuration 9esting= #e"urit$ and Performan"e 9esting
?rescr!bed 7ook4
oger # Pressman= !aid Approa"h= 9M< D200(E
&owe=
B8e'
Cha;ters4 1 to 5= 7 to 12= 14= 15;
:ngineering
A
Pra"titionerHs
Mode ?a;er MCA -)-.4$eb En8!neer!n8 T!me4 "rs
Max. Marks4 ,)
Ans
1; 8rite short notes on aE Agile 'E Modelling "E :li"itation dE Managing ris-s eE 6sa'ilit$ fE Constru"tion gE Content 9esting hE Organiing "ontent Ans 8h$ > DdE:plain me"hanism for dentif$ing 8e'App n"rements;
,M ,M ,M ,M
0n!t 1 II . DaE
,M ,M ,M ,M
0n!t 1 III *. DaE:plain a'out nterfa"e !esign #teps; ,M D'E!es"ri'e the importan"e of fun"tional design in design pro"ess;,M DorE D"E!es"ri'e the nformation Ar"hite"ture; ,M ,M DdE!es"ri'e the A""essing nformation; 0n!t 1 I> -. DaE:plain a'out Component !esign #teps; D'E:plain a'out mplementation 9ools , 9e"hnologies; DorE D"E:plain a'out 6sa'ilit$ 9esting; DdE:plain a'out Component ? &eel 9esting;
K K K K K
MCA -)( 4 .NET ?R%6RAMMIN6 &A7
,M ,M ,M ,M
>7 .NET4
1E !eelop an appli"ation whi"h is similar to Botepad using menus;
2E DaE !eelop an appli"ation for fa"ilitating pur"hasing order whi"h will loo- li-e as shown 'elow I
D'E !eelop an appli"ation for 'illing s$stem in "offee shops whi"h will loo- li-e as shown 'elow I
3E DaE!eelop an appli"ation whi"h is similar to login form in"luding the progress 'ar "ontrols;
D'E
!eelop an appli"ation for fruits 'illing s$stem whi"h will looli-e as shown 'elow I
4E !eelop an appli"ation whi"h is helpful for "al"ulating the insuran"e;
5E DaE !eelop an appli"ation using font dialog "ontrol
D'E !eelop an appli"ation using "olor dialog "ontrol
%E !eelop an appli"ation to displa$ the file sele"ted '$ the user in a we' 'rowser "ontrol;
7E !eelop an appli"ation using the data reader to read from a data'ase;
AS?.NET4
(E !esign an appli"ation for d$nami"all$ populating a "he"-'o list;
E !eelop an appli"ation for sele"ting a single da$ in the "alendar "ontrol;
10E !esign an appli"ation '$ using the new s"roll 'ar feature with the panel serer "ontrol;
11E !esign an appli"ation with simple 'ulleted list "ontrol;
12E !esign an appli"ation for uploading files using new file
upload "ontrol;
13E!esign an appli"ation for 'uilding a form in the wiard "ontrol;
14E!esign an appli"ation '$ using the "ompare alidator to test alues against "ontrol alues;
15E!esign an appli"ation using the images= sounds for error notifi"ations;
1%E!esign an appli"ation using the grid iew "ontrol in an A#P;et we' page;
17E!esign an appli"ation for adding an insert "ommand to the sJl data sour"e "ontrol;
1(E !esign a we' site using the "on"ept of master pages;
C.NET4
1E !eelop a pro.e"t for performing arithmeti"= relational= logi"al operations; 20E !eelop a pro.e"t for demonstrating pol$morphism= a'stra"tion; 21E !eelop a pro.e"t for demonstrating swit"h statements; 22E !eelop a pro.e"t for implementing inheritan"e using a'stra"t "lasses; 23E !eelop a pro.e"t for implementing interfa"es using multiple inheritan"e; 24E Create a form that is the main window of a program using window "lass; 25E Create a form that is the main window with 'utton program; 2%E Create a form that is the main window of a program using the standard "ontrols; 27E Create a form whi"h displa$s the gien inputs in the form of a tree iew stru"ture; 2(E !eelop a pro.e"t for implementing e"eption handling in CX; 2E !eelop a pro.e"t whi"h displa$s the student information in the releant fields from the data'ase whi"h alread$ eists;
MCA -), 4 A/>ANCE/ PA>A &A7 1;DaE 8rite a program to download a we' page;
D'E 8rite a program to download a we' page using a 6& Conne"tion; 2;DaE 8rite a program to print the so"-et information; D'E 8rite a program to print the information in the !atagram 3; !eelop a Client= #erer Appli"ation to satisf$ the reJuests from multiple "lients; 4; 8rite a program to implement a serer that will simpl$ e"ho 'a"- whateer is t$ped '$ the "lient aE9CP 'E6!P 5; 8rite a program to hae "hat appli"ation aE 9CP 'E6!P %; 8rite a program to add Coo-ie and get Coo-ie; 7; 8rite a program to print the Fi'ona""i num'ers using RM ; (; !eelop Multithreaded Message Appli"ation 6sing Paa Sockets ; !eelop Multi"ast Communi"ation using Paa Mut!cast cass 10; !eelop !istri'uted Programming using Paa RMI 11; !eelop !ata'ase Programming using P/7C and Paa s
MCA -)J 4 SEMINAR
MCA ()54 ?R%PECT $%R3
9he Master of Computer Appli"ations DMCAE programme prepares the students to ta-e up positions as #$stems Anal$sts= #$stems !esigners= #oftware :ngineers= Programmers and Pro.e"t Managers in an$ field related to information te"hnolog$; 9he MCA students are en"ouraged to spend at least fie months wor-ing on a pro.e"t prefera'l$ in a software industr$ or an$ resear"h organiation; The foo
Page #pe"ifi"ation ID8ritten paper and sour"e "odeE &eft margin ) 2;5 "ms ight margin) 1;5 "ms 9op margin ) 2;5 "ms *ottom margin ) 2;5 "ms Page num'ers ) All tet pages as well as Program sour"e "ode listing should 'e num'ered at the 'ottom "enter of the pages; ormal *od$ 9etI Font #ie I 12= 9imes ew oman= !ou'le #pa"ing= /ustified; % point a'oe and 'elow para spa"ing Paragraph
9he pro.e"t do"umentation ma$ 'e a'out 100 to 125 pages De"luding "odingE; 9he pro.e"t do"umentation details should not 'e too generi" in nature; Appropriate pro.e"t report do"umentation should 'e done= li-e= how $ou hae done the anal$sis= design= "oding= use of testing te"hniJues@strategies= et";= in respect of your project; 9o 'e more spe"ifi"= whateer the theor$ in respe"t of these topi"s is aaila'le in the referen"e 'oo-s should 'e aoided as far as possi'le; 9he pro.e"t do"umentation should 'e in respe"t of $our pro.e"t onl$; 9he pro.e"t do"umentation should in"lude the topi"s gien 'elow; :a"h and eer$ "omponent shown 'elow "arries "ertain weightage in the pro.e"t report ealuation;
• • •
9a'le of Contents@nde with page num'ering ntrodu"tion@O'.e"ties #$stem Anal$sis ♦ dentifi"ation of eed ♦ Preliminar$ nestigation ♦ Feasi'ilit$ #tud$ ♦ Pro.e"t Planning
