Final Year Projects, Final Year Engineering Projects, Final Year Student Projects, Final Year Projects-Engineering Projects, MCA Projects, Students Projects Chennai, Final Year Projects Chennai, Em...
Full description
Full description
2103 bndjcbDescripción completa
Descripción: Imagenología UCE
Full description
CONVERTIR MCA A PSIDescripción completa
Descripción completa
Property credit to Atty. TiamsonFull description
vra and vro
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
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
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
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
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>
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
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;
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
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;
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
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
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
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
#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