Syllabi & Scheme of Examination

MASTER OF COMPUTER APPLICATION

Department of Computer Science
Chaudhary Devi Lal University, Sirsa
MCA SEMESTER-I
Paer N!" N!#en$lature !% Paer Durati!n
!% E&a#
Ma&"
The!ry
T!tal
MCA-101
COMPUTER FUNDAMENTAL
& PROBLEM SOLVING
THROUGH C
3 Hours 0!"0#10$ 0
MCA-10%
COMPUTER ORGANISATION
3 Hours 0!"0#10$ 0
MCA-103
DISCREATE MATHMATICAL
STRUCTURES
3 Hours 0!"0#10$ 0
MCA-10&
STRUCTURED SYSTEM
ANALYSES AND DESIGN
3 Hours 0!"0#10$ 0
MCA-10"
COMPUTER ORIENTED
NUMERICAL AND
STATISTICAL METHODS
USING C
3 Hours 0!"0#10$ 0
MCA-10 Soft'are (aboratory & Hours &0
MCA-10) Soft'are (aboratory & Hours &0
MCA-10* Seminar %0
+otal &00
MCA SEMESTER 'II
Paer N!" N!#en$lature !% Paer Durati!n
!% E&a#
Ma&"
The!ry
T!tal
MCA-%01
DATA STRUCTURAL USING C
3 Hours 0!"0#10$ 0
MCA-%0%
SOFTWARE ENGINEERING
3 Hours 0!"0#10$ 0
MCA-%03
SYSTEM SIMULATION
3 Hours 0!"0#10$ 0
MCA-%0&
COMPUTER ORIENTED
OPTIMIZATION TECHNIQUES
3 Hours 0!"0#10$ 0
MCA-%0"
OBJECT ORIENTED
SYSTEMS AND C++
3 Hours 0!"0#10$ 0
MCA-%0 Soft'are (aboratory & Hours &0
MCA-%0) Soft'are (aboratory & Hours &0
MCA-%0* Seminar %0
+otal &00
MCA SEMESTER-III
Paer N!" N!#en$lature !% Paer Durati!n
!% E&a#
Ma&"
The!ry
T!tal
MCA-301 Data ,ase Systems 3 Hours 0 0
MCA-30% -isual .ro/rammin/ usin/
-,
3 Hours 0 0
MCA-303 Computer 0et'or1s 3 Hours 0 0
MCA-30& 2peratin/ System 3 Hours 0 0
MCA-30" 3in4o' .ro/rammin/ 5isual
C##
3 Hours 0 0
MCA-30 Soft'are (aboratory--
26AC(E
& Hours &0
MCA-30) Soft'are (aboratory--7
-7S8A( .6296AMM709
! ,ase4 on MCA-30% &
MCA-30"$
& Hours &0
MCA-30* Seminar %0
+otal &00
MCA SEMESTER 'I(
Paer N!" N!#en$lature !% Paer Durati!n
!% E&a#
Ma&"
The!ry
T!tal
MCA-&01 :A-A .ro/rammin/ an4
7nterne4 Applications
3 Hours 0 0
MCA-&0% Computer Architecture &
.arallel .rocessin/;
3 Hours 0 0
MCA-&03 (708< an4 Shell
.ro/rammin/
3 Hours 0 0
MCA-&0& Electi5e-7 3 Hours 0 0
MCA-&0" Electi5e-77 3 Hours 0 0
MCA-&0 Soft'are (aboratory--77
:A-A .ro/rammin/ !,ase4
on MCA-&01$;
& Hours &0
MCA-&0) Soft'are (aboratory--777
(708< & Shell
.ro/rammin/ ! ,ase4 on
MCA-&03$ an4 CASE +ools
& Hours &0
MCA-&0* Seminar %0
+otal &00
List !% Ele$tive Paers %!r MCA )
th
Se#ester
7; .rinciples of .ro/rammin/ (an/ua/es;
77; System .ro/rammin/
777; A45ance4 Database Systems
7-; Microprocessors an4 7nterfaces
-; Desi/n an4 Analysis of Al/orithms
-7; Soft'are .ro=ect Mana/ement
-77; Mana/ement 7nformation System
-777; Data Minin/ an4 3are housin/
7<; +heory of Computation
<; 0et'or1 Mana/ement & .ro/rammin/
MCA SEMESTER '(
Paer N!" N!#en$lature !% Paer Durati!n
!% E&a#
Ma&"
The!ry
T!tal
MCA-"01 Computer 9raphics an4
Multime4ia
3 Hours 0 0
MCA-"0% Artificial 7ntelli/ence 3 Hours 0 0
MCA-"03 3eb En/ineerin/ 3 Hours 0 0
MCA-"0& Electi5e-7 3 Hours 0 0
MCA-"0" Electi5e-77 3 Hours 0 0
MCA-"0 Soft'are (aboratory-7<
.62(29 .ro/rammin/ an4
9raphics !,ase4 on MCA-
"01 & MCA-"0%$;
& Hours &0
MCA-"0) Soft'are (aboratory-<
H+M(> C97 usin/ .E6(>
:S.> <M( ! ,ase4 on MCA-
"03$
& Hours &0
MCA-"0* Seminar %0
+otal &00
List !% Ele$tive Paers %!r MCA *
th
Se#ester
7; Compiler Construction
77; 7nternet an4 7ntranet En/ineerin/
777; .rinciples of ?inance & Accountin/
7-; E-Commerce
-; Soft'are +estin/ an4 @uality Assurance
-7; 0eural 0et'or1s
-77; ?uAAy (o/ic
-777; .ro/rammin/ in C B
7<; .rofessional 7ssues in 7; +;
<; Human Computer 7nteractionC
MCA SEMESTER-VI
MCA-601 Project (100 Evaluation, 50 Viva-voce, 50 Internal Ass.) 200
+rand T!tal %!r all Se#esters ,,--
MCA - 101
COMPUTER FUNDAMENTAL & PROBLEM SOLVING THROUGH C
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five questions. All questions shall carry equal mars.
Ma!"#" Ma$%& ' (0
T!") ' *H$&
!omputer "undamental : !omputer !omponents# !haracteristics $ !lassification of computers # hard%are $
soft%are# peripheral devices.
Algorithmic &evelopment: Techniques of problem solving# "lo%charting # decision table# structured
programming concept# 'odular programming# Algorithmic for searching# sorting and merging. (rogramming
methodologies: top do%n $ bottom up programming.
)lements of ! : ! character set# identifiers $ ey%ords# data types : declaration $ definition.
*perators : Arithmetic relational# logical# bit%ise# unary# assignment and conditional operators $ their hierarchy
$ associativity.
&ata input+output.
!ontrol statements: ,equencing# ,election: if and s%itch statement- iteration# .epeatition: for# %hile # and do/
%hile loop - brea # continue # goto.
"unctions : &efinition# prototype# passing parameters# recursion.
&ata structure : arrays# struct# union# string# data files.
(ointers : &elecration# operations on pointers# array of pointers# pointers to arrays.
.eferences:
0eri .. 1anly $)lliot (.2offman# (roblem ,olving $(rogram &esign in .!. 3rd )d.# Addision 4esley#
5000.
All 2elley# 6ra (ohl# A 7oo on !# (rograming in !# 8th )d.# Addition 4estley# 5000.
9ash%ant 2aneter# :et us !# 7(; (ublications.
<ottfsied# (rogramming %ith !# Tata 'c<ra% 1ill.
MCA -10+
COMPUTER ORGANISATION
Ma!"#" Ma$%& ' (0
T!") ' *H$&
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five questions. All questions shall carry equal mars.
6nformation .epresentation : Number systems# 7!& codes# character codes# error deletion and correcting
codes # fixed/point and floating point representation of information # 7inary arithmetic operation# 7ooths
multiplication.
7inary logic : 7oolean algebra# 7oolean functions# truth table# canonical and standard forms# simplification of
7oolean functions# digital logic gates.
!ombinational logic : &esign procedure # adders # subtractors# encoder #decoder# multiplexer # demultiplexer $
comparators.
,equential logic : "lip flops# shift registers and counters.
'emory system : 'emory parameters# semiconductor .A's# .*'s# magnetic $ optical storage devices.
!(= organisation : (rocessor organisation # 'achine instructions# instruction cycles # instruction formats and
addressing modes# microprogramming concepts# microprocessor sequence
6+* *raganisation : 6+* interface# interrupt structure# transfer of information bet%een !(=+memory $ 6+*
devices# and 6*(s.
.eferences:
'ano. '. 'orris &igital :ogic $ !omputer systems &esign# (rentice hall of 6ndia (vt. :td.# 5000.
.a>asaman# ;.# .adharishanan# T.# An 6ntroduction to digital computer design # (rentice hall of 6ndia
(vt. :td.#8th )d.
1ayes. 0.(.# !omputer architecture and oragination#'c<ra% 1ill#1??@#Third )d..
1euring# ;.(.# 0orden# 1.".# !omputer ,ystems &esign $ Architecture# Addition 4esley# 5000.
MCA - 10*
DISCREATE MATHMATICAL STRUCTURES
Ma!"#" Ma$%& ' (0
T!") ' *H$&
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five question. All questions shall carry equal mars.
<roup And ,ubgroups: <roup axioms# (ermutation groups# ,ubgroups# !o/sets# Normal subgroups #
,emigroups# ".)) ,emi/groups# Applications# Amodular arithmetic# error correcting codes# grammars #
language# "inite ,tate 'achine.
<raphs: &irected and undirected graphs# chains # !ircuits # (aths# !ycles# connectivity # Ad>acency $ incedence
matrices# 'inimaBs path Application A"lo% charts and state transition graphs# algorithms for determining cycle
and minimal paths# polish notations and trees# flo%s in net%or.C
:attice- and 7oolean algebra: .elational to (artial ordering# :attices m 1asse diagram# Axiomatic definition of
boolean algebra as algebraic structures %ith t%o operations basic results truth values and truth tables. The
algebra of propositional function. The 7oolean algebra of truth values # Application A,%itching circuits # <ate
circuitsC.
"inite "ields: &efinition .epresentation# ,tructure # 6nternal domain 6rreducible polynomial# (olynomial roots#
splitting field.
.eferences:
Alan &oerr# 2enneth :evaseur# Applied &iscreate ,tructures "or !omputer ,cience # <algotia
publication pvt. ltd.
,eymour :ipschutD# 'arc :ars :ipson# &iscreate mathematics # 'c<ra%/1ill international editions#
,chaumBs series.
7ernard 2olman# .obert !.7usbym# &iscrete 'athmatical structures for computer science # (rentice/
1all of 6ndia pvt. ltd.
2ennech <..osen: &iscreate mathmatics and its applications# 'a<ra%/1ill internal editions #
'athematics series.
MCA - 10,
STRUCTURED SYSTEM ANALYSES AND DESIGN
Ma!"#" Ma$%& ' (0
T!") ' *H$&
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five question. All questions shall carry equal mars.

,ystem concept and information system environment# The system development life cycle # .ole of the system
analyst# Automated tools for system development.
,ystem Analysis : .equirement determination and specification# feasibility study # 6nformation gathering #
structuring system requirements # process modelling# logic modelling and conceptual data modelling .
,ystem &esign : &esigning forms and reports# interface and dialogues# databases# process# output+input files.
6mplementation : (reparing for implementation# planning # test plans# program development # implementation
management# changeover and routine operations.
'aintenance and .evie%: Types of maintenance # cost of maintenance# performance evaluation.
.eferences:
'odern system analysis $ design# 1offer 0.A.#<eorge 0.".# ;alacich 0.,.# Addition/%esley# Addison/
%esley# ,econd )dition.
(ractical ,,A&' 8 3+e# A !omplete Tutorial <uide# (hilip 4eaver# Nicholas lambrou $ 'atthe%
4alley# Addison/4esley.
,ystems Analysis and &esign# A%ard ).'.# <algotia 7oosource.
)lement of system analysis# <ore '. $ ,tubbe 0.# <algotia 7oosource# Third )dition.
6ntroducing system analysis and design# :ee# <algotia 7oosource# !ombined ;olume ,et.

MCA - 10-
COMPUTER ORIENTED NUMERICAL AND STATISTICAL METHODS USING C
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five question. All questions shall carry equal mars.
Ma!"#" Ma$%& ' (0
T!") ' * .$&
!omputer Arithmetic : "loating point representation of numbers# arithmetic operations %ith normaliDed floating
point numbers and their consequences # )rror in number representation / pitfalls in computing.
6terative 'ethods : 7isection# "alse position# Ne%ton/.aphson methods# &iscussion of convergence#
(olynomial evaluation# ,olving polynomial equations A7airsto%Bs 'ethodC
,olving of ,imultaneous :inear )quations and ordinary &ifferential )quation# <auss elimination method# 6:: /
conditioned equations# <auss/,eidal iterative method# Taylors series and )uler methods# .unge/utta methods#
(redicator methods.
Numerical &ifferentiation and 6ntegration: &ifferentiation formulae based on polynomial fit# (itfalls in
differentiation# TrapeDoidal# ,impson rules and <aussian Quadrature.
6nterpolation and Approximation : (olynomial interpolation# &ifference tables # 6nverse interpolation# (olynomial
fitting and other curve fitting# Approximation of function by Taylor series and !hebyshev polynomials.
,tatistical methods : ,ample distributions# Test of ,ignificance# n5 # t and f test.
Analysis of ;ariance : &efinition# Assumptions# !ochranBs Theorem# *ne %ay classification# AN*;A Table# T%o/
%ay classification A%ith one observation per cell C.
Time ,eries Analysis : !omponents and Analysis of Time ,eries# 'easurement of Trend# ,easonal fluctuations
and !yclic movement.
.eference:
<upta ,.(. and 2apoor# ;.2.# "undamentals of Applied station statistics# ,ultan !hand $ ,ons# 1?EE.
<upta ,.(. and 2apoor# ;.2.# "undamentals of mathmatical statistics# ,ultan !hand $ ,ons.
.a>a.aman ;. # !omputer *riented Numerical 'ethods# (rentice 1all# 6ndia.
<raybill# 6ntroduction to ,tatistics# 'c<ra%.
Anderson# ,tatistical 'odeling# 'c<ra%.
MCA - +01
DATA STRUCTURAL USING C
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five question. All questions shall carry equal mars.
Ma!"#" Ma$%& ' (0
T!") ' * .$&
6ntroduction to &ata ,tructure# (rimitive and !omposite# Arrays# 'atrices# ,parse 'atrices# ,tring
representation and manipulation # ,tac# Queue# &equeue# :ined :ists # Trees# 7inary trees#Threaded 7inary
tree# 7alanced tree# &iffrent tree traversal algorithms# .epresentation of <raphs and Application # various
searching and sorting techniques# 1ashing # &ynamic memory management.
.eferences:
9edidyah :angsam# 'oshe 0 Augernstein and Aarson '.Tanenbaum# &ata ,tructures using ! and !F
F # (16# Ne% &elhi A1??GC.
Trembley# 0.(. and ,orenson (.<.An 6ntroduction to &ata ,tructures %ith Applications# 'c<ra%/1ill
6nternational ,tudent )dition# Ne% 9or A1?@8C.
,eymour :ischutD# &ata ,tructures # 'c<ra%/1ill 7oo !ompany # ,chaumBs *utline series# Ne% 9or
A1?@EC.
MCA - +0+
SOFTWARE ENGINEERING
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five question. All questions shall carry equal mars.
Ma!"#" Ma$%& ' (0
T!") ' * .$&
,oft%are and soft%are engineering / ,oft%are characteristics# soft%are crisis# soft%are engineering paradigms.
(lanning and soft%are pro>ect / ,oft%are cost estimation # pro>ect scheduling# personnel planning# team
structure.
,oft%are configuration management# quality assurance # pro>ect monitoring# ris management.
,oft%are requirement analysis / structured analysis# ob>ect oriented analysis and data modelling# soft%are
requirement specification# validation.
&esign and implementation of soft%are / soft%are design fundamentals# design methodology Astructured design
and ob>ect oriented design C# design verification# monitoring and control# coding.
,oft%are reliability / metric and specification# fault avoidance and tolerance# exception handling# defensive
programming.
Testing / Testing fundamentals# %hite box and blac box testing# soft%are testing strategies: unit testing #
integration testing# validation testing# system testing # debugging.
,oft%are maintenance / maintenance characteristics# maintainability# maintenance tass# maintenance side
effects. !A,) tools.
.eferences:
(ressman ,. .oger# ,oft%are )ngineering# Tata 'c<ra%/1ill.
0alote (ana># An integrated Approach to soft%are# )ngineering# Naro (ublishing 1ouse.
,ommeeville 6an# ,oft%are )ngineering# Hth )d.# Addison 4esley/5000 .
"airley .ichard# ,oft%are )ngineering !oncept# Tata 'c<ra% / 1ill.
MCA - +0*
SYSTEM SIMULATION
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five question. All questions shall carry equal mars.
Ma!"#" Ma$%& ' (0
T!") ' * .$&

6NT.*&=!T6*N : !oncept of system # stochastic activities# continuous and discrete systems# system
modeling# principles used in modeling.
,6'=:AT6*N *" ,9,T)' : !oncept of simulation of continuous system %ith the help of examples# use of
integration formulas# concepts of discrete systems simulation %ith the help of examples # <eneration of random
numbers# <eneration of non/uniformly distributed random numbers.
,imulation of queuing systems : 7asic concept of queuing theory# simulation of single server# t%o/server and
general queuing systems.
,imulation 6n 6nventory !ontrol and "orecasting: )lements of inventory theory# inventory models # <eneration of
(oison and )rlang variates forecasting and regression analysis.
&),6<N AN& );A:=AT6*N *" ,6'=:AT6*N )I().6')NT,: )xperimental layout and validation
,imulation :anguage : !ontinuous and discrete simulation language # 7lac/structured continuous simulation
languages# <(,,# ,6',!.6(T# ,6'=:A "actors in selection of discrete system simulation languages.
.eferences :
<ordon <. : J ,ystem simulation J# (rentice K 1all of 6ndia pvt. :td. Ne% &elhi 1??3.
Nar singh &eo : J ,ystem simulation %ith &igital computer J# (16# Ne% &elhi 1??3.
(ayn 0ames A. : 6ntroduction to simulation : (rogramming Techniques and methods of analysis# Ne%
9or A1??@C.
MCA / +0,
COMPUTER ORIENTED OPTIMIZATION TECHNIQUES
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five question. All questions shall carry equal mars.
Ma!"#" Ma$%& ' (0
T!") ' * .$&
6ntroduction : The historical development # Nature# meaning and management# Application of *peration
.esearch# 'odeling# 6tLs principle and approximation of *...'odels # 'ain characteristic and phases #
<eneration method of solving models # ,cientific methods # scope # rule on decision maing and development
of operation research in 6ndia.
:inear (rogramming: "ormulation # graphical solution # standard and matrix forms of linear programming
problems# simplex method and its flo% chart.
&uality : 6ntroduction # definition # <eneral rule for converting any primary into its dual #&ual simplex method
and its flo% chart.
6nteger (rogramming : 6mportance and application # <omorgLs all integer programming problem techniques #
branch and bound method.
Queuing models : 6ntroduction # Application # !haracteristics %aiting and idle time costs # transient and steady
state # Notations# '+'+! # '+)+1 and deterministic models .Ano mathematical derivations includedC.
().T $ !(' : 7asic steps in ().T $!(' # "or%ard and bac%ard computations# .epresentation in Tabular
forms # ,lac and !ritical path # difference bet%een !(' $ ().T # "loat.
.eferences :
<upta (.2. # 1ira and &.,.# *peration .esearch # ,ultan chand and sons # Ne% &elhi 1??8.
2anti ,%arup : <upta (.2. $'an 'ohan# *peration research# ,ultan chand and sons # Ne% &elhi
A1??0C.
'ittal #2.;.#*ptimiDation methods in operation research and system analysis # Ne% age international
ApC ltd. # Ne% &elhi 1??5.
.ao ,.,.#*ptimiDation theory and application # %iley eastern ltd.delhi 1??1
,harma # ,.&.# *peration research # 2adar nath and ram nath # meerut#1??E.
Taha.1.A.#*perational research K An introduction# 'c'illan (ublishing co#. Ne% 9or 1?@E.
7aDa # *perational research $ net%oring # %iley.
Avieoal # *ptimiDation Techniques.
MCA - +0-
OBJECT ORIENTED SYSTEMS AND C++
Note: Total 10 Question are to be set by the examiner covering the entire syllabus uniformly.
A candidate is required to attempt any five question. All questions shall carry equal mars.
Ma!"#" Ma$%& ' (0
T!") ' * .$&
*b>ect oriented concept : &ata abstraction # encapsulation # classes and ob>ects modularity# hierarchy# typing#
concurrency# persistence.
*b>ect oriented methodology : Advantages and disadvantages of ** 'ethodologies# 'odeling# &omain
analyses #*'T 'ethodology/ ob>ect model# lins and association # multiplicity# lin attributes #role names #
ordering qualification # aggregation # generaliDation and inheritance# abstract class# meta data # ob>ect
diagram # dynamic model K events# states# scenarios# event
traces # state diagram# functional model/ data flo% diagram # analysis# system design and ob>ect design.
(rogramming in !FF : &ata types# structs vs classes# static data and member function # constant parameters $
destruction # dynamic ob>ects# operator overloading # function overloading # inheritance # virtual functions#
abstract elms# virtual class#. Template functions $ template classes# exception handling file stream classes#
A,!66 $ 7inary files # sequential $ random access to a file.
.eferences :
.umbansh . 0.et. al.# *b>ect oriented modeling and design # (rentice hall of 6ndia 1??@.
7oocn. <rady# ob>ect oriented analysis $ design #addition %estley 1??8.
,troustrup# 7.# The !FF programming language # Addison K%esley1??3.
6ddppnin # cFF prime 3+e# Additison K 4esley.
7alarus%arri# e. ovhcet oriented programming in cFF : Tata 'c<ra%
,chilt# 1erbert# cFF : the complete reference #5+e+# Tata 'c<ra% K hill 1??@.
MCA-.-/ DATA0ASE S1STEMS
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
,asic ConceptsE A Historical perspecti5e> ?ile System 5s; D,MS> characteristics of the Data ,ase
Approach> Abstraction an4 Data 7nte/ration> Database users> A45anta/es an4 Disa45anta/es of a
D,MS> 7mplication of Data ,ase approach;
Data ,ase System concepts an4 ArchitectureE Data Mo4els> Schemas an4 7nstances> D,MS
architecture an4 Data 7n4epen4ence Data ,ase lan/ua/es & 7nterfaces> D,MS functions an4
component mo4ules;
Entity 6elationship Mo4elE Entity +ypes> Entity Sets> Attributes & Feys> 6elationships> 6elationships
+ypes> 6oles an4 Structural Constraints> Desi/n issues> 'ea1 entity types> E-6 Dia/rams; Desi/n of
an E-6 Data ,ase Schema> 6e4uction of an E-6 Schema to +ables> +he 8nifie4 Mo4elin/ (an/ua/e
!8M($;
6elational Data Mo4elE 6elational Mo4el concepts> 7nte/rity constraints o5er 6elations> 6elational
Al/ebra G ,asic operations;
S@( E Data Definition> constraints> & Schema chan/es in S@(> 7nsert> Delete & up4ate statements in
S@(> 5ie' in S@(> specifyin/ constraints an4 7n4exes in S@(> @ueries in S@(;
A 6elational Data ,ase Mana/ement System E 26AC(E G A Historical perspecti5e> ,asic Structure>
Data ,ase Structure an4 its manipulation in 26AC(E> Stora/e 2r/aniAation in 26AC(E
.ro/rammin/ 26AC(E Applications;
Con5entional Data Mo4elsE An o5er5ie' of 0et'or1 an4 Hierarchical Data Mo4els;
6elational Data ,ase Desi/nE ?unctional Depen4encies> Decomposition> Desirable properties of
4ecomposition> normal forms base4 on primary 1eys !1 0?> % 0?> 3 0? an4 ,C 0?$;
.ractical Data ,ase Desi/nE 6ole of 7nformation systems in or/aniAations> Data ,ase Desi/n process>
physical Data ,ase Desi/n in 6elational Data bases;
+ransaction .rocessin/ concepts E 7ntro4uction to +ransaction .rocessin/> +ransaction & System
Concepts> .roperties of +ransaction> Schemes an4 6eco5erability> SerialiAability of Sche4ules;
Concurrency Control +echniDuesE (oc1in/ +echniDues> +ime stamp or4erin/> Multi5ession
+echniDues> 2ptimistic +echniDues 9ranularity of Data 7tems;
6eco5ery +echniDuesE 6eco5ery concepts> reco5ery +echniDues in centraliAe4 D,MS;
Data ,ase SecurityE 7ntro4uction to Data ,ase Security issues;
Re%eren$e2
Elmasri & 0a5athe E ?un4amentals of Database System> 3
r4
E4ition> A44ison 3esley> 0e'
Delhi;
Forth & SilberschatAE Database System Concept> &
th
E4ition> Mc9ra' Hill 7nternational
E4ition;
6a/hu 6ama1rishnan & :ohannes 9ohr1eE Database Mana/ement system> %
n4
E4ition>
Mc9ra' Hill 7nternational E4ition;
C;:;DateE An 7ntro4uction to Database System )
th
E4ition> A44ison 3estern 0e' Delhi;
,ipin C DesaiE An 7ntro4uction to Database System> 9al/otia .ublication> 0e' Delhi;
Abbey Abramson & CoryE 26AC(E S7-A ,e/innerHs 9ui4e +ata Mc9ra' Hill .ublishin/
Company (t4;
?5an ,yrossE S@(> .(IS@(-+he .ro/ram (an/ua/e of 26AC(E> ,., .ublication> 0e'
Delhi;
MCA-.-, (ISUAL PRO+RAMIN+ 3IT4 (ISUAL 0ASIC
0oteE +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
Concepts of ob=ect base4 E5ent 2riente4 (an/ua/es> -isual ArchitectureE Metho4> Statement>
.roperties an4 E5entsJ ,asic concepts of 5isual .ro/ram Desi/n an4 comparison 'ith 0on--isuals;
+he -, 7nte/rate4 De5elopment En5ironment an4 its elementsE Menu bar> toolbars> pro=ect explorer>
tool box> properties in4o> form 4esi/ner> form layout etc;
+he -, lan/ua/e an4 its elementsE -ariables constants> arrays> collections> subroutines> functions>
ar/uments> an4 control structures;

Desi/nin/ a -, applicationE 3or1in/ 'ith -, forms> form properties> a44in/> 4eletin/> an4 mana/in/
forms at run time> co4in/ e5ent proce4ures> implementin/ co4e to e5ents> 4ynamic manu appearance;
Co4in/ a -, application E 7mplementin/ user interface controls> common controls an4 their properties>
4ynamic controls> custom controls> control arrays> usin/ 5ariable> subroutines> function an4 control
structures> accessin/ 4ata throu/h co4e an4 4ata controls> usin/ D((S in -, applications> buil4in/
Acti5e < clients> acti5e < ser5ers> Acti5e < controls> Acti5e < 4ocument> an4 'eb-enable4
applications> Multiple Document 7nterface 9raphics .ro/rammin/;
Database .ro/rammin/ !DA2DC> AD2DC$ an4 ob=ect oriente4 pro/rammin/ 'ith -,;
Re%eren$e2
-isual ,asic- by Ho'ar4 Ha'ee .H7
6each yourself -isual ,asic by 3arner +MH
Masterin/ -,- by E5an/els .etroutsos +MH
.ro/rammin/ in -,- by : C ,ra4ley +MH
-,- +he Complete 6eference by :er1e +MH
-isual ,asic by 9ery Corner
MCA-.-. COMPUTER NET3OR5S
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
0et'or1 Concepts E 9oals an4 applications of computer 0et'or1sJ +opolo/iesJ Cate/ories of
0et'or1s - (A0> MA0> 3A0 7nternet 'or1sJ point-to point> an4 broa4cast net'or1sJ 7ntro4uction
to SMDS> <E%" 0et'or1s 7SD0> frame relay an4 A+M net'or1s;
0et'or1s architectureE Concepts of protocols & ser5icesJ 2S7 mo4el an4 functions of its layersJ
+C.I7. reference mo4el;
Data communication conceptsE Components of a 4ata communication systemJ transmission mo4esJ
transmission me4ia G /ui4e4 an4 'ireless me4iaJ intro4uction to s'itchin/ !circuit> messa/e an4
pac1et$ an4 multiplexin/ !freDuency 4i5ision an4 time 4i5ision$J concept of Mo4ems;
?ramin/ an4 Error controlE ?ramin/ techniDuesJ Error control-error 4etection & correction;
Data (in1 ControlE Ac1no'le4/mentsJ Elementary 4ata-lin1 protocols Automatic 6epeat 6eDuestJ
sli4in/ 3in4o' protocols;
Me4ium Access Control an4 (A0s E Multiple Access protocols of MAC sub layer G A(2HA> 7n
persistent> p-persistent an4 non-persistent CSMA> CSMAICD> collision free protocols> limite4
contention protocols> 3a5elen/th Di5ision Multiple Access> MACA> 9SM> CD.D> CDMAJ 7EEE
Stan4ar4 *0% for (A0s an4 Mans-Ethernet> to1en ous> to1en rin/> D@D,> (o/ical (in1 ControlJ Hi/h
Sppe4 (A0s;
6outin/E Deterministic an4 A4apti5e routin/J CentraliAe4 an4 4istribute4 routin/J shortest-pathJ
floo4in/J flo' base4J optimalJ 4istance 5ector> lin1-state> hierarchicalJ routin/ for mobile hostsJ
broa4cast an4 multicast routin/;
Con/estion ControlE .rinciples of con/estion controlJ +raffic Shapin/J Cho1e pac1etsJ loa4 sha4in/J
6S-.;
+C.I7.E Elements of +ransport .rotocolsJ +ransmission Control .rotocol !+C.$J user 4ata/ram
protocol !8D.$J 7nternet .rotocol !7.$;
Re%eren$e2
Composer 0et'or1s G An4re's> +ananbaum> .H7;
Data Communications> Computer 0et'or1s an4 2pen Systems> fourth e4ition-?re4 Halsall>
A44ison 3esley;
7ntro4uction to Data Communications an4 0et'or1in/- ,ehrouA> ?roAen +ata MC-9ra' Hill;
Data an4 Computer Communications> "
th
e4ition-3illiam Stallin/> .H7;
MCA-.-) OPERATIN+ S1STEMS
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
7ntro4uctory ConceptsE 2peratin/ system functions an4 characteristics historical e5olution of
operatin/ systems> 6eal time systems> Distribute4 systems> Mytholo/ies for implementation of 2IS
ser5ice system calls> system pro/rams> interrupt mechanisms;
?ile SystemsE ?unction of the systems> ?ile access an4 allocation metho4s> Directory systemsE
Structure4 2r/aniAations> 4irectory an4 file protection mechanisms> implementation issuesE hierarchy
of file an4 4e5ice mana/ement;
C.8 sche4ulin/E (e5els of sche4ulin/> comparati5e stu4y of sche4ulin/ al/orithms> Multiple
processor sche4ulin/;
Stora/e Mana/ementE Stora/e allocation Metho4sE Sin/le conti/uous allocation> multiple conti/uous
allocations> .a/in/E Se/mentation combination of .a/in/ an4 se/mentation> -irtual memory concepts>
Deman4 .a/in/> .a/e 6eplacement Al/orithms> +hrashin/;
Har4'are Mana/ementE Har4'are or/aniAation> De5ice Sche4ule .olicies;
Dea4loc1sE Dea4loc1 characteriAation> Dea4loc1 .re5ention an4 a5oi4ance> Dea4loc1 4etection an4
reco5ery> practical consi4erations;
Concurrent .rocessesE Critical section problem> Semaphores> classical process co-or4ination problems
an4 their solutions> 7nter process communication;
.rotectionE 9oals of protection> mechanisms & policies implementation 4ynamic protection structures>
re5ocation protection schemes in 807<IM8(+7CS;
Case stu4iesE Comparati5e stu4y of D2S> 370D23> 807< & (708< System;
Re%eren$e2
.eterson> :;(; & SilberschatA> A> 2peratin/ System concept> A44ison 3esley rea4in/;
,rinsh> Hansen> 2peratin/ System .rinciples> .rentice Hall of 7n4io a;
Ha/eman> A;0;> 7ntro4ucin/ to 2peration System Desi/n 9al/otia .ublication> 0e' Delhi;
+aneobaum> A;S;> 2peratin/ system;
Hansen .;,;> Architecture Concurrent .ro/rams> .H7;
Sha'> A;C;> (o/ic 4esi/n of 2peratin/ Systems> .H7;
Deitel> H;M;> 2peratin/ System> :ohn 3ileyIA44ison 3esley;
MCA-.-* 3INDO3S PRO+RAMIN+ 3IT4 (ISUAL C66
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
3in4o's ,asic Concepts> 'in4o' A.7 DE? files> creatin/ 'in4o's> messa/e> x-'in4o's> Mouse an4
Feyboar4;
7ntro4uction to resources> 4esi/nin/ an4 creatin/ menus> pop-up menus> user 4efine4 resources;
,itmaps an4 4ialo/uesE 'in4o's animationJ font basicsJ 'in4o' controlsJ ?ont 4isplayE static
controls> e4it controls> list boxes> psychic 'in4o's;
25er5ie' an4 structure of 'in4o's pro/rammin/> co4in/ con5entionsJ Displayin/ text> mouse>
/raphics 4e5ice interfaces;
.ro/rammin/ usin/ 5isual C##;
Re%eren$e2
3in4o's pro/rammin/ by Charles .etAol;
3in4o's pro/rammin/ by :im Con/er;
-isual C## by Kash'ant Fanet1ar;
MCA-)-/ 7A(A PRO+RAMMIN+ AND INTERNET APPLICATIONS
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
7nternet Applications E 7ntro4uction to 7nternetJ E-Mail- Architecture & ser5ices> user a/ent> Massa/e
format & transfer> SM+.> 3orl4 'i4e 'eb !333$ G Domain 0ame System> +he client si4e> +he
ser5er si4e creatin/ an4 locatin/ information on the 'eb search en/ines> 86(Hs> H++.>?+.> +elnet
'eb ,ro'sers> chat & ,ulletin ,oar4> 8SE0E+ & 00+. !0et'or1 0e's +ransfer .rotocol$;
:A-A an4 the 7nternetJ +he :a5a .ro/rammin/ (an/ua/e an4 its characteristics> :a5a run-time
en5ironmentJ :a5a compilerJ :a5a 4e5elopers 1itJ runnin/ :a5a applications an4 :a5a applets;
:A-A .ro/rammin/E Elements of :a5aE Data types> scalar 4ata types> operators & expressions> control
structures; Class> ob=ects & metho4s> constructors> finaliAer> 5isibility controls> array> strin/ &
-ectors> 7nheritance> interfaces> pac1a/es multithrea4in/> applet pro/rammin/;
Exception han4lin/-4efinin/ an4 thro'in/ exceptions> creatin/ your o'n exceptions;;
7nputI2utputE streams> byte an4 character stream> the class .rint stream> 4ata streams Strin/ +o1eniAes
class> stream to1eniAes;
Dele/ation e5ent mo4elE A3+ classes> A3+ controls (ayout Mana/ers & meanness;
Re%eren$e2
Compiler 0et'or1s & 7nternet> %
n4
e4ition - Don/les E;Comet> A44ison 3esley> %000;
.ro/rammin/ the 7nternet 'ith :a5a> re5ise4 e4ition- Darrel 7nce & A4am ?reeman> A44ison
3esley> %000;
.ro/rammin/ 'ith :a5a GE;,ala/urus'ami %
n4
E4ition> +0H G 1LL*;
+he complete reference :a5a %> &
th
e4ition G Herbert Schil4t !+MH> %001$;
A .ro/rammerHs /ui4e to :a5a certification> Mu/ Hal F;A;> 6asmussen 6;3;> A44ison 3esley>
%000;

MCA -)-, COMPUTER AEC4ITECTURE 8 PARALLEL PROCESSIN+
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
?un4amentalsE Computational mo4el> E5olution of computer architecture> process threa4> concurrent
an4 parallel execution> types an4 le5els of parallelism> classifications of parallel architectures>
6elationships bet'een lan/ua/es an4 parallel architectures;
7nstruction -(e5el- .arallel .rocessorsE Depen4encies bet'een instructions; .rinciples of .ipeline4
instruction processin/> synchronous & asynchronous pipelinin/; (inear .ipeline-cloc1in/ an4 timin/
control> spee4up efficiency & throu/hput; 0on linear pipeline- reser5ation table> latency analysisE
collision free sche4ulin/> internal 4ata for'ar4in/; Superscalar pipeline 4esi/n- structure 4ata
4epen4encies pipeline stallin/> in or4er issue> out of or4er issue -(73 architecture; ,ranch han4lin/
4elaye4 han4lin/> branch processin/ multi'ay branchin/> /uar4e4 execution> co4e sche4ulin/ basis>
bloc1 sche4ulin/> loop sche4ulin/> /lobal sche4ulin/;
Memory Hierarchy +echnolo/yE 7nclusion> coherence an4 locality> 5irtual memory mo4els> +(,>
pa/in/ an4 se/mentation> memory replacement policies> cache a44ressin/ mo4els> cache performance
issues> interlea5e4 memory or/aniAation;
Are4- memory M7MD architecturesE Dynamic interconnection net'or1s-are4 path> s'itchin/
net'or1s- crossbar & multista/e net'or1s; Cache coherence problem> Har4'are base4 cache
coherence protocol-Snoopy cache protocol 4irectory scheme> scalable coherent interface> an4
hierarchical cache coherence protocol; 8MA> 08MA> CC-08MA an4 C2MA multiprocessors;
Re%eren$e2
Sima> D; et al;> A45ance4 Computer Architecture> A44ison 3esley> %000;
3an/> 1ai> A45ance4 Computer Architecture> Mc9ra' Hill> 7nternational E4;
3an/ 1ai> ,rin/s ?aye A;> Computer Architecture an4 .arallel .rocessin/> Mc9ra' Hill>
7nternational E4;
Main> 6ichar4 Ka> A45ance4 Computer Architecture> .H7> 1LLL;

MCA-)-. LINU9 8 S4ELL PRO+RAMMIN+
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
(inux Startup
Accounts> accessin/ (inux G startin/ an4 shuttin/ processes> lo//in/ in an4 la//in/ out> comman4
line> simple comman4s;
All pro/rammin/
(inux file systemE (inuxI8nix files> ino4esan4 structure an4 file system 4ate4 comman4s> shell as
comman4 processor> shell 5ariables> creatin/ comman4 substitution> scripts> functions> con4itionals>
loops> customiAin/ en5ironment;
6e/istrar Expressions an4 ?ilters
7ntro4ucin/ re/ular expressions patterns> syntax> character classes> Duantifiers> intro4uction to e/rep>
se4> pro/rammin/ 'ith a'1 an4 perl;
+he C En5ironment
+he !compiler> 5i e4itor> compiler options> mana/in/ pro=ects> memory mana/ement> ue of ma1e files>
4epen4ency calculations> memory mana/ement 4ynamic an4 static memory buil4in/ an4 usin/ static
an4 4ynamic libraries> usin/ 744> soname> 4ynamic loa4er> 4ebu//in/ 'ith /4b;
.rocesses in (inux
.rocess> startin/ an4 stoppin/ processes> initialiAation .rocesses> to processes re an4 init files> =ob
control G at> batch> cron> time> net'or1 files> securityI; .ri5ile/es> authentication> pass'or4
a4ministration> archi5in/> si/nals an4 si/nal han4lers> (inux 7I2 system;
Re%eren$e2
:ohn 9oerAenE (inux .ro/rammin/ ,ible> 7D9 ,oo1s> 0e' Delhi %000;
Sumi sabha 4assE Kour 8nix G +heb 8ltimate 9ui4e> +MH> %00
Aho> HopCoft an4 8llmanE +he Desi/n an4 Analysis of Computer Al/orithms> A44ison
3esley;
MCA-)-) 8 MCA-)-* :ELECTI(E-I; PRINCIPLES OF PRO+RAMMIN+ LAN+UA+ES
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
.reliminaries- lan/ua/e para4ise> lan/ua/e criteria> lan/ua/e 4esi/n tra4e-offs> influences on
lan/ua/e 4esi/n> bin4in/s> type chec1in/> an4 scopes> 5ariables an4 4ata typeE primiti5e 4ata types>
5ariables> structures 4ata typesE abstraction> control abstraction> proce4ural abstraction;
?ormal lan/ua/es an4 automata- +he Choms1y hierarchy of formal lan/ua/es> re/ularE /rammarE
re/ular expressions> finite automata> context-free /rammarE push4o'n automata> ambi/uous /rammars
7mperati5e pro/rammin/- structure4 pro/rammin/> proce4ure acti5ationE parameter passin/ metho4s>
scope rules> acti5ation recor4;
2b=ect oriente4 pro/rammin/- messa/es metho4s an4 encapsulation> classes an4 polymorphism>
inheritance an4 ob=ect orientation> 4esi/n issues for ob=ect oriente4 lan/ua/es;
?unctional pro/rammin/- ?eatures of functional lan/ua/es> implementin/ functional lan/ua/es>
application of functional lan/ua/es;
(o/ic pro/rammin/- formal lo/ical systems> implementations an4 applications;
(an/ua/es for 4atabases- manipulatin/ relational 4atabases usin/ S@(;
(an/ua/e constructs for parallel processin/- the para4i/m> multiple processes> synchroniAation of
cooperatin/ processes;
Re%eren$e2
Sebessa 3; 6obert> Concepts of pro/rammin/ lan/ua/es &
th
e4ition> !A44ison 3esley %000$;
Appleby Doris & -an4eFopple :; :ulius> .ro/rammin/ lan/ua/e- para4i/m an4 practice %
n4

e4ition> !A44ison 3esley %000$;
Sethi 6a5i> .ro/rammin/ lan/ua/es %
n4
e4ition> !A44ison 3esley-%000$;
MCA-)-) 8 MCA-)-* :ELECTI(E 'II; S1STEM PRO+RAMMIN+
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
7ntro4uction to system soft'areE 4efinition> components of system soft'are e5olution of system
soft'are;
AssemblerE Elements of assembly lan/ua/e pro/rammin/> o5er5ie' of assembly process> 4esi/n
options- one pass assembler & multi pass assembler;
Macro processorsE ,asic functions> 4esi/n options-6ecursi5e macro expansion> /eneral purpose macro
processors Macro processin/ 'ith lan/ua/e translators;
CompilersE 25er5ie' of compilation process> pro/rammin/ (an/ua/e /rammar> scannin/; .arsin/>
Stora/e allocation> Compilation of expressions> compilation of control structures> co4e optimiAation>
Desi/n options- compiler- compilers> .- co4e compiler> interpreters;
(oa4ers & (in1a/e E4itorsE (oa4in/> (in1in/ & relocation> pro/ram relocatibility> o5er5ie' of
lin1a/e e4itin/> lin1in/ for pro/ram o5er lays;
Soft'are +oolsE Spectrum of soft'are tools> text e4itors> pro/ram /enerators> 4ebu/s monitors>
pro/rammin/ en5ironments;
Re%eren$e2
,ec1 (;(elan4> system soft'are> 3
r4
!A44ison 3esley %000$;
Dono5an :;:ohn> System .ro/rammin/> !+ata Mc9ra' Hill$
Dham4her D; M;> System pro/rammin/ an4 operatin/ system> !+ata Mc9ra'-Hill$;
MCA-)-) 8 MCA-)-* :ELECTI(E 'III; DATA0ASE S1STEM
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
Exten4e4 E-6 Mo4elE Subclasses> super classes an4 7nheritance> specialiAation an4 9eneraliAation>
Constraints an4 Characteristics of SpecialiAation an4 /eneraliAation;
2b=ect-oriente4 Data Mo4el E 2b=ect 74entity> 2b=ect Structure> an4 +ype constructors> Encapsulation
of 2perations> Metho4s an4 .ersistence> +ype Hierarchies an4 7nheritance> Complex 2b=ects>
.olymorphism> Multiple 7nheritance> -ersions an4 Confi/urations;
2b=ect 6elational DatabasesE ,asic Concepts of 2b=ect-6elational systems> 2b=ect-6elational features
of 2racle> An o5er5ie' of S@(3> 2b=ect-6elational support in S@(3> 0este4 6elational Data Mo4el;
?urther 0ormaliAationE Hi/her 0ormal ?orms> Multi5alue4 Depen4encies an4 &
th
normal ?orm> :oin
Depen4encies an4 "
th
0ormal ?orms> Domain-1ey 0ormal ?orm;
Database System ArchitecturesE CentraliAe4 systems> Client-Ser5er Systems> Ser5er System
Architecture> .arallel Systems> an4 Distribute4 Systems;
Distribute4 Database an4 Client-Ser5er ArchitectureE Distribute4 Database concepts> Data
?ra/mentation> 6eplication an4 Allocation +echniDues for Distribute4 Database Desi/n> +ype of
Distribute4 Database System> 25er5ie' of Concurrency Control an4 reco5ery in Distribute4
Databases; An 25er5ie' of Client-Ser5er Architectures> Distribute4 Databases in 2racle;
3eb 7nterfaces to DatabasesE 3eb ?un4amentals> Databases an4 the 3eb> 3eb Ser5ers an4 Sessions>
.ro5i4in/ access to Database on 333; +he 2racle 3eb ser5er;
.erformance +unin/> .erformance ,enchmar1s;
Enhancies Data mo4els for A45ance4 ApplicationsE An 25er5ie' of acti5e Databases> Spatial
Databases> De4ucti5e Databases an4 Multime4ia Databases;
Re%eren$e2
Elmasri & 0a5atheE ?un4amentals of Database systems> 3
r4
E4ition> A44ison 3esley 0e'
Delhi;
Forth & SilberschatAE Database System Concepts> &
th
E4ition Mc9ra' Hill 7nternational
E4ition;
6a/hu 6ama1rishnan & :ohannes 9ehr1eE Database Mana/ement Systems> %
n4
e4ition>
Mc9ra' Hill 7nternational E4ition;
C;:; DateE An 7ntro4uction to Databases Systems )
th
E4ition> A44ison 3esley> 0e' Delhi;
,ipin C; DesaiE An 7ntro4uction to Database System> 9al/otia .ublication> 0e' Delhi;
Abbey Abramson & CoreyE 2racle *i-A ,e/innerHs 9ui4e +ata Mc9ra' Hill .ublishin/
Company (t4;
75an ,ayrossE S@(> .(IS@(-+he .ro/ram (an/ua/e of 2racle> ,., .ublication> 0e' Delhi;
MCA-)-) 8 MCA-)-* :ELECTI(E-I(; MICROPROCESSORS AND INTERFACES
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
7ntro4uction to Microprocessor an4 MicrocomputerE Historical ,ac1/roun4> mo4ern Microprocessors
an4 Microcomputers> architectures of .entium .rocessor> real an4 protecte4 mo4es of operations>
a44ressin/ mo4es an4 instruction set of .entium processor> concept of 67SC an4 C7SC
Microcomputer;
Memory 7nterfaceE Memory 4e5ices> a44ress 4eco4in/> *I1I3%I&- bit memory interfaces;
7nput-2utput 7nterfacesE 7ntro4uction to 7I2 interfaces> 7I2 mappe4 7I2 an4 memory mappe4 7I2>
basic 7nput interface an4 basic output interface> 7I2 port a44ress 4eco4in/> *I1I3%-birt 'i4e 7I2 ports>
*%c"" ..7;
7nterruptE StructureE ,asic 7nterrupt .rocessin/> interrupt instructions of .entium> operations of real
an4 protecte4 mo4e interrupts> *%"L .7C an4 its pro/rammin/> expan4in/ interrupt structure by
ransac1in/ *%"LHs;
Direct Memory AccessE DMA 4ata transfer an4 basic DMA operations> *%3) DMA Controller> its
pro/rammin/;
,us 7nterfaceE +he *I1 G bit 7SA bus an4 its interfacin/ 'ith 7nput & 2utput .otts> E+SA 3% G bit bus
an4 its interfacin/> -ESA an4 -( busses> .C7 an4 .CMC7A busses;
Re%eren$e2
+he 7ntel MicroprocessorsE Architecture> .ro/rammin/> an4 7nterface; ,y ,erry ,; ,rey
!.H7$;
Microcomputer SystemsE Architecture> .ro/rammin/> an4 Desi/n; ,y (iu an4 9abson !.H7$;
Microprocessors ,y D- Hall;
MCA-)-) 8 MCA-)-* :ELECTI(E-(; DESI+N AND ANAL1SIS OF AL+ORIT4MS
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours

7ntro4uctory ConceptsE 6e5ie' of important 4ata structures an4 pro/rammin/ techniDues> analyAin/
al/orithms> asymptotic notation> recurrence relations> intro4uctory concepts in pro/ram 5erification
an4 testin/> structure4 4esi/n metho4olo/y;
Desi/n StructuresE 2utline of the /eneral metho4> its illustration 'ith se5eral 'ell chosen examples for
the follo'in/ basic al/orithm 4esi/n strate/iesE Di5i4e & ConDuer> 9ree4y metho4> Dynamic
.ro/rammin/> ,asic search an4 tra5ersal +echniDues> ,asic trac1in/> ,ranch an4 ,oun4;
(o'er ?oun4 +heoryE Comparison trees> 2racles an4 a45ersary ar/uments> techniDues for al/ebraic
problems> lo'er boun4s on parallel computation;
7H Har4 an4 0.-Complete .roblemsE ,asic concepts> Coo1Hs theorem> examples of 0.-Har4
problems> approximation al/orithms;
Re%eren$e2
Horo'itA> Ellis an4 Sahni> Sarta=> ?un4amentals of computer Al/orithms> 9al/otia
.ublications;
Aho> Hopcroft> an4 8llman> the Desi/n an4 Analysis of Computer Al/orithms> A44ison
3esley;
Horo'itA> E; an4 Sahni> S;> ?un4amentals of Data Structure> 9al/otia .ublications;
+remoley an4 Sorenson> An 7ntro4uction of Data Structures> 'ith Applications> Mc9ra' Hill;
9oo4man> S;E;> an4 Hete4niemi> S;+;> 7ntro4uction to the Desi/n an4 Analysis of Al/orithms
Mc9ra' Hill;
MCA-)-) 8 MCA-)-* :ELECTI(E-(I; SOFT3ARE PRO7ECT MANA+EMENT
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
Con5entional Soft'are Mana/ement; E5olution of soft'are economics; 7mpro5in/ soft'are
economicsE re4ucin/ pro4uct siAe> soft'are processes> team effecti5eness> automation throu/h
soft'are en5ironments; .rinciples of mo4ern soft'are mana/ement;
A soft'are mana/ement process frame'or1E (ife cycle phases- inception> elaboration> construction
an4 trainin/ phase; Artifacts of the process the artifact sets> mana/ement artifacts> en/ineerin/
artifacts pra/matics artifacts mo4el base4 soft'are architectures; 3or1flo's of the process;
Chec1points of the process;
Soft'are mana/ement 4isciplinesE 7terati5e process plannin/; .ro=ect or/aniAations an4
responsibilities; .rocess automation; .ro=ect control an4 process instrumentation G core metrics>
mana/ement in4icators> life cycle expectations; .rocess 4iscriminants;
Re%eren$e2
Soft'are .ro=ect mana/ement> 'al1er 6oyce> A44ison 3esley> 1LL*;
.ro=ect Mana/ement %Ie> Maylor;
Mana/in/ the Soft'are .rocess> Humphrey;
Mana/in/ 9lobal Soft'are .ro=ects> 6amesh> +HM> %001;
MCA-)-) 8 MCA-)-* :ELECTI(E-(II; MANA+EMENT INFORMATION S1STEM
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
,ac1/roun4 meanin/> 0ature> 0ee4> 6ole> 7mportance> E5olution of Mana/ement throu/h information
systemJ 6elate4ness of M7S 'ith mana/ement acti5ities; Mana/ement functions an4 4ecision ma1in/;
Concept of balance M7S effecti5eness an4 efficiency criteria;
De5elopment of M7SE Metho4olo/y an4 +ools techniDues for systematic i4entification> e5aluation>
mo4ification of M7S;
Re%eren$e2
6obess 9; Mu4ric1> Coel E; 6oss> :ames 6; Cla//ett> 7nformation Systems for Mo4ern
Mana/ement;
:ames A; 2H,rien> Mana/ement 7nformation Systems;
MCA-)-) 8 MCA-)-* :ELECTI(E ' (III; DATA MININ+ AND 3ARE4OUSIN+
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E "0
+ime E 3 hours 7nternal Assessment E 10
7ntro4uctionE +he E5olution of Data 3arehousin/ !+he Historical Context$> +he Data 3arehouse- a
,rief History> +o4ayHs De5elopment En5ironment;
.rinciples of Data 3arehousin/ !Architecture an4 Desi/n +echniDues$E +ypes of Data an4 their uses>
conceptual Data Architecture> Desi/n +echniDues> intro4uction to the (o/ical Architecture;
Creatin/ the Data AssetE ,usiness Data 3arehouse Desi/n> .opulatin/ the Data 3arehouse;
8nloc1in/ the Data Asset for en4 users !+he use of ,usiness 7nformation$E Desi/nin/> ,usiness
7nformation 3arehouses> .opulatin/ ,usiness 7nformation 3arehouses> 8ser Access to 7nformation>
7nformation Data in Context;
7mplementin/ +he 3arehouse !Mana/in/ the .ro=ect an4 En5ironment$E 2bstacles to 7mplementation>
.lannin/ your implementation> =ustifyin/ the 'arehouse> 2r/aniAational 7mplications o Data
3arehousin/> +he Data 3arehouse in your 2r/aniAation> Data 3arehouse Mana/ement> (oc1in/ to
the ?uture;
Data Minin/E
7ntro4uctionE Moti5ation> 7mportance> 4ata minin/> 1in4 of 4ata> ?unctionalities> interestin/ patterns>
classification of 4ata minin/ system> Ma=or issues;
Data 'arehouse an4 2(A. +echnolo/y for 4ata minin/E 4ata 'arehouse> operational 4ata base
systems an4 4ata 'arehouse> Architecture> 7mplementation> 4e5elopment of 4ata cube technolo/y> 4ata
'arehousin/ to 4ata minin/> Data 'arehouse usa/e;
Data .reparationE .reprocess> Data cleanin/> Data 7nte/ration an4 transformation> Data re4uction>
DiscritiAation an4 concept hierarchy /eneration;
Data Minin/ .rimiti5es> (an/ua/es> an4 system Architectures> /raphical user interfaces;
Concept DescriptionE CharacteriAation an4 Comparison> Data 9eneraliAation an4 summariAation-base4
characteriAation> Analytical characteriAation> analysis of attribute rele5ance> minin/ class comparisons>
Minin/ 4escripti5e statistical measures in lar/e 4atabases;
Minin/ Association 6ules in (ar/e Database> Minin/ sin/le-4imensional ,oolean association rules
from transactional 4atabases> minin/ multile5el association rules from transaction 4atabases> Minin/
multi4imensional association rules from relational 4atabases an4 4ata 'arehouses> ?rom association
minin/ to correlation analysis> constraint-base4 association Minin/;
Classification an4 pre4iction> issues> classification by 4ecision in4uction> ,ayesian classification>
classification by bac1 propa/ation> classification base4 on concepts from association rule minin/ other
classification metho4s;
Re%eren$e2
Data Minin/> Ale ,erson> Stephen Smith> Forth +heorlin/> +MH;
Data Minin/> A4ruaans> A44ison-'esley (on/man;
Data 3arehousin/ in the 6eal 3orl4 Anahory> A44ison-'esley (on/man;
Data Minin/ an4 'arehousin/> Chanchal Sin/h> 3iley;
Data Minin/> :ohn E> Herbert .;
MCA-)-) 8 MCA-)-* :ELECTI(E-I9; T4EOR1 OF COMPUTATION
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
6e/ular sets an4 re/ular expressionsJ Deterministic an4 0on-Deterministic finite automata>
eDui5alence of 4eterministic an4 non-4eterministic finite acceptors> FleenHs characteriAation theory for
sets accepte4 by finite automata> finite state machines an4 their relations to combinatorial s'itchin/
circuits complicity> 6e/ular sets> State eDui5alence an4 state minimiAation of finite automata> Al/ebra
4ecomposition an4 structure theory> Hantmannis systems structure theory> Sem/roups an4 Frobu
6ho4's 4ecomposin/> /eneraliAe4 se/mental machines;
Choms1y to 9reibiech normal form theorems> Self embe44in/> ambi/uity> EDui5alence of context free
lan/ua/es an4 sets accepte4 by non-4eterministic push-4o'n store automata> closure properties of
context free lan/ua/es an4 sets accepte4 by non-4eterministic push 4o'n store automata> closure
properties of context free lan/ua/es> Co1e-1asami-youn/ al/orithm> top-4o'n an4 bottom-up
metho4s; Deterministic push-4o'n automata an4 parsin/> 4eterministic context free lan/ua/es>
6estrictions of push-4o'n automata> parsin/ al/orithms an4 compiler 4esi/n;
Multitu4e +urin/ machines an4 relate4 formalism for reco/nition> 8nsol5ability of the haltin/
problem> re4uction of post correspon4ence problem to the haltin/ problem; 8n4eci4able properties of
/rammars> pro/ram correctness> Al/orithms complexity;
Re%eren$e2
(e'isE H;6; & .apa4imitriou> C;H; Elements of the theory of computation; .H7;
Salomna> A;F; ?ormal lan/ua/es> Aca4emic press;
Hop croft> :;E; & 8llman> :;D; ?ormal (an/ua/e an4 their relation to Automata A44ison-
3esley;
E;-; Frishnamurthy 7ntro4uctory theory of computer science East-3est pres .5t; (t4;
Moha Mauna Mathematical theory of computation> 3iley inter-science;
:ohn Mins1y Mathematical theory of computation> .H7;
9reenber/ M;> 7ntro4uction to Automata +heory> A44ison 3esley;
MCA-)-) 8 MCA-)-* :ELECTI(E-9; NET3OR5 MANA+EMENT AND PRO+RAMMIN+

N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
+elecommunication 0et'or1 Architecture> +M0 Mana/ement layers> Mana/ement information
Mo4el> Mana/ement ser5icin/ an4 functions> structure of mana/ement information an4 +M0
information mo4el> S0M. -(> S0M.% & S0M.3> 6M201 & %; ,roa4ban4 0et'or1 Mana/ement
!A+M> H?C> DS(> AS0$;
7ntro4uction to net'or1in/> +C.I7. .rotocol Architecture> classful internet a44resses> subnets> super
nettin/> a44ress resolution .rotocol !6A.$ an4 6A6.> 7. 4ata/ram format> 8D. an4 +C.I4ata/rams>
7CM. its purpose> ?709E6> 0E+ S+A+ 4etailsE 7pconfi/> .in/> +6ACE6+> 628+E;
Soc1et intro4uction> elementary +C. soc1ets> +C. client ser5er> 7I2 functions> selectE .oll functions>
soc1et options> elementary 8D. soc1ets> elementary no4e & a44ress con5ersions> echo ser5ice !+C.>
8D.$;
Al/orithms an4 issue in ser5er soft'are 4esi/nE iterati5e connectionless ser5ers !8D.$> 7terati5e
connection oriente4 ser5ices !+C.$> sin/le process> concurrent ser5ers multiprotocol ser5ers !+C.>
8D.$> multi ser5ice ser5ers !+C.> 8D.$;
6emote proce4ure call concept !6C.$E 6C. mo4els> analo/y bet'een 6.C of client an4 ser5er>
remote pro/rams an4 proce4ures> their multiple 5ersions an4 mutual exclusion communication
semantics> 6.C retransmits> 4ynamic port mappin/ authentication;
0et'or1s file system> concept of 4ata lin1 access> 4ebu//in/ techniDues> 6outin/ soc1ets>
broa4castin/ to mobile net'or1;
Re%eren$e2
0et'or1 Mana/ement .rinciples & .ractices by Subramanian> Mani> an4 A3(;
S0M.> Stallin/ 3illaim> A3(;
S0M.E A /ui4e to 0et'or1 Mana/ement> M9H;
+elecom 0et'or1 Mana/ement by ,;,;3an/> M9H;
0et'or1 Mana/ement by 8; ,lac1> M9H;
8nix 0et'or1 .ro/rammin/ %
n4
e4ition> 3; 6ichar4 Ste5ens;
7nternet'or1in/ 'ith +C.I7. -ol; 7> Dou/lus E; Comer;
7nternet'or1in/ +C.I7. -ol; 777> Dou/lus E; Comer> Da5i4 (; Ste5ens;
7nternet'or1in/ 'ith +C.I7. -ol; 77> Dou/lus E; Comer;
MCA-*-/ COMPUTER +RAP4ICS AND MULTIMEDIA
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
7ntro4uctionE Sur5ey of computer 9raphics an4 its applicationsJ 7nteracti5e an4 passi5e /raphicsJ
7ntro4uction to 9FS .rimiti5esJ 4isplay processorsJ
9raphic De5icesE Display system-refresh C6+s> raster scan an4 ran4om scan monitors 9rey sha4es>
7nterlacin/> beam penetration sha4o' mas1 monitors> loc1 up tables> plasma panel> (ED an4 (CD
Monitors> (CD Monitors> -9A an4 S-9A resolutionJ Hai4 copy De5ices-printers> plottersJ
7nteracti5e 7nput De5ices-mouse> 4i/itiAin/ table> li/ht pen> touch panels> ima/e scanners> 5oice
systems> =oy stic1> trac1 ball;
Dra'in/ 9eometryE Coor4inate systemJ resolutionJ use of homo/eneous coor4inate systemJ scan
con5ersionE symmetrical DDA> simple DDA> ,resenhams line 4ra'in/ al/orithm> /eneration of
ellipse;
%-D +ransformationsE +ranslationJ rotationJ scalin/J mirror reflectionJ shearin/E Moomin/J pannin/J
input techniDues-pointin/> positionin/> rubber an4 metho4s an4 4ra//in/J t'eeAin/;
9raphic operationsE Clippin/-line clippin/ usin/ Sutherlan4-Cohen an4 mi4pointE sub-4i5ision
al/orithm> poly/on clippin/J 'in4o' an4 5ie' portJ 'in4o'in/ transformationJ ?illin/-stac1 base4
fill al/orithm> scan-line see4 fill al/orithmJ
3-D 9raphicsE 3D mo4elin/ of ob=ectsJ 3D 4isplay techniDuesJ coor4inate systemJ 3D transformation
matrices for translation> scalin/ an4 rotationJ parallel pro=ectionJ perspecti5e pro=ectionJ Hi44en-
surface remo5al G A- buffer> bac1 face> scan-line> 4epth-sortin/> area sub4i5isionJ sha4in/- mo4elin/
li/ht intensities> /ourau4 sha4in/> phon/ sha4in/;
Multime4iaE concepts of HypertextIHyperme4iaJ multime4ia applicationsJ multime4ia authorin/J
multime4ia har4'areJ ima/esJ bitmapsJ 'in4o's paint brush;
Re%eren$e2
Computer 9raphics- Donal4 Hearn> M;.auline ,a1er> .H7;
.rinciples of 7nteracti5e Computer 9raphics 0e'man & Sproull> Mc9ra' Hill;
Multime4ia systems- :ohn ?; Foe/el ,ufore> A44ison 3esley;
Computer 9raphics .rinciples &n .ractice- ?oleyIetc; A44ison 3esley;
.roce4ural elements of Computer 9raphics 6o/ers Mc9ra' Hill;
?un4amentals of computer 9raphics an4 Multime4ia G D;.; Mu1her=ee> .H7;
MCA-*-, ARTIFICAL INTELLI+ENCE
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours

+he pre4icate calculusE syntax an4 semantic for propositional lo/ic an4 ?C.(> Censual form>
inference rules> resolution an4 unification;
Fno'le4/eE representationE 0et'or1 representation-Associati5e net'or1 & concept of naphs>
structure4 representation ?rames & Scripts;
Search strate/iesE Strate/ies for state space search-4ata 4ri5en an4 /oal 4ri5en searchJ search
al/orithms- uninforme4 search !4epth first> brea4th first> 4epth first 'ith iterati5e 4eepenin/$ an4
informe4 search !Hill climbin/ best first> An al/orithm> mini-max etc;$> computational complexity>
.roperties of search al/orithms-A4missibility> Monotonicity> 2ptimality> Dominance> etc;
.ro4uction systemE +ypes of pro4uction system control of search in pro4uction system;
6ule base4 expert systemsE Architecture> 4e5elopment> mana/in/ uncertainty in expect systems
!,ayesian probability theory> Stanfor4 certainty factor al/ebra; 0onmnotonic lo/ic an4 reasonin/ 'ith
beliefs> ?uAAy lo/ic> DempterIShaffer an4 other approaches to uncertainty;
Fno'le4/e acDuisitionE +ypes of learnin/> learnin/ automata> /enetic al/orithms> intelli/ent e4itors>
learnin/ by in4uction;
.ro/rammin/ 'ith .rolo/;
Re%eren$e2
9eor/e ?; (u/er> 3illiam A; Stubblefiel4 Artificial 7ntelli/ence> +he ,en=aminICummin/s
.ublishin/ Company> 7nc;
Dan 3; .atterson 7ntro4uction to Artificial 7ntelli/ence an4 Expert system .H7;
Eu/ene Charnia1> Dre' McDermott 7ntro4uction to Artificial 7ntelli/ence A44ison 3esley-
%000;
3ils :; 0ilsson .rinciples of Artificial 7ntelli/ence 0arosa .ublishin/ house;
:ac1son .eter> 7ntro4uction to Expert systems> 3
r4
e4ition> !A44ison 3esley -%000$;
MCA-*-. 3E0 EN+INEERIN+
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
1; 7nformation Architecture +he 6ole of 7nformation Architect> Collaboration an4 Communication>
2r/aniAation information> 2r/aniAational challen/es> or/aniAin/ 3eb Sites an4 7ntranets> Creatin/
Cohesi5e 2r/aniAation Systems> Desi/nin/ 0a5i/ation Systems> +ypes of 0a5i/ation Systems>
7nte/rate4 0a5i/ation Elements> 6emote 0a5i/ation Elements> Desi/nin/ Ele/ant 0a5i/ation
Systems> Searchin/ your 3eb Site> Desi/nin/ the search 7nterface> 7n4exin/ the ?i/ht Stu> +o Search
or 0ot to Search> 9roupin/ Content> Conceptual Desi/nJ Hi/h-(e5el Architecture ,lueprints>
Architectural .a/e Mar1ups> Desi/n S1etches;
%; Dynamic H+M( an4 'eb Desi/nin/ H+M( ,asic Concept> 9oo4 3eb Desi/n> .rocess of 3eb
.ublishin/> .hases of 3eb Site De5elopment> Structure of H+M( 4ocuments> H+M( Elements G Core
attributes> (an/ua/e attributes> Core E5ents> ,loc1 (e5el E5ents; +ext (e5el E5ents> (in1in/ ,asics>
(in1in/ in H+M(> 7ma/es an4 Anchors> Anchor Attributes> 7ma/e Maps> Semantic (in1in/ Meta
7nformation> 7ma/e .reliminaries> 7ma/e Do'nloa4 issues> 7ma/es as ,uttons> 7ntro4uction to (ayoutE
,ac1/roun4s> Colors an4 +ext> ?onts> (ayout 'ith tables> A45ance4 (ayoutE ?rames an4 (ayers>
H+M( an4 other me4ia types; Au4io Support in ,ro'sers> -i4eo Support> 2ther binary ?ormat; Style
Sheets> .ositionin/ 'ith Style sheets; ,asic 7nteracti5ity an4 H+M(E ?26MS> forms control> 0e'
an4 emer/in/ ?orm Elements;
3; C97 usin/ .E6( 7ntro4uction to C,7> Alternati5e +echnolo/ies> +he Hypertext +ransport .rotocol>
86(s> H++.> ,ro'ser 6eDuests> Ser5er 6esponse> .roxies; Content 0e/otiation> the Common
9ate'ay 7nterface> +he C97 En5ironment> En5ironment -ariables; C97 2utput> ?orms an4 C97>
Sen4in/ Data to the Ser5er> ?orm +a/s> Deco4in/ ?orm 7nput> Architectural 9ui4elines> Efficiency
an4 2ptimiAation;
&; :a5a Ser5er .a/es ,asics> 7nte/ratin/ Scripts in :S.s> :S. 2b=ects an4 Components> confi/urin/
an4 troubleshootin/> :S.E 6eDuest an4 response ob=ects> 6etrie5in/ the Contents of a H+M( form>
6etrie5in/ a @uery strin/> 'or1in/ 'ith ,eans> Coo1ies> Creatin/ an4 6ea4in/ Coo1ies; 8sin/
Application 2b=ects an4 E5ents;
"; <M( 6elationship bet'een H+M(> S9M(> an4 <M(> ,asic <M(> 5ali4 Documents; 3ays to use
<M(> <M( for Data ?iles> Embe44in/ <M( into H+M( 4ocuments> Con5ertin/ <M( to H+M( as
<M(> +he future of <M(;
Re%eren$e2
+homas A .o'ell> H+M(-+he Complete 6eference> +ata Mc9ra' Hill;
Scote 9uelich> Shishir 9un4a5aram> 9unther ,irAnie1J C97 .ro/rammin/ 'ith .erl %Ie;
2H6eilly;
Dou/ +i4'ell> :ames snell> .a5el Fulchen1oJ .ro/rammin/ 3eb Ser5ices 'ith S2A.>
2H6eilly;
.ar4i> <M( in Action> 3eb +echnolo/y> .H7;
Kon/; <M( Step by Step> .H7;
Aaron 'eiss> 6ebecca +aply> Fim Daniels> Stu5en Mul4er> :eff Fanesh1i> 3eb Authorin/ Des1
6eference> +echme4ia .ublication
MCA-*-) 8 MCA-*-* :ELECTI(E-I; COMPILER CONSTRUCTION
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours

7ntro4uction to CompilationE Compilers an4 phases of compilation> analysis synthesis mo4el of
translation> compiler construction tools;
(exical AnalysisE .rocess of lexical analysis> finite state automata> D?A an4 0?A reco/nition of
re/ular expressions> (E<;
Syntax AnalysisE .rocess of syntax analysis> types of /rammar> top-4o'n an4 bottom-up parsin/
techniDues> parser /enerator;
7nterme4iate Co4e 9enerationE 7nterme4iate (an/ua/es> /eneratin/ interme4iate co4e for 4eclarati5e
statement; Assi/nment statement> ,oolean expression> an4 case statement;
Co4e 2ptimiAationE 7ntro4uction to co4e optimiAation> potential cases of co4e optimiAation>
optimiAation of basic bloc1s> loops in flo' /raphs> co4e impro5in/ transformation;
Co4e 9enerationE 7ssues in the 4esi/n of a co4e /eneration the tar/et machine> 4ynamic stora/e
mana/ement> translatin/ basic bloc1s> a simple co4e /enerator> peephole optimiAation> 4irecte4 acyclic
/raphs an4 basic bloc1s co4e /eneration from 4irecte4 acyclic /raphs;
25er5ie' of syntax 4irecte4 translation scheme;
Re%eren$e2
CompilersE .rinciples> +echniDues & +ools> ,y Aho> 8llman> & Sethi !A44ison 3esley$
.rinciples of Compiler Desi/n> ,y Aho & 8llman !0arosa .ublications$;
.ractice & .rinciples of Compiler ,uil4in/ 'ith C> ,y Hen1 Alblas et al;
.rinciples of Compiler Desi/n> ,y +rembley & Sorenson !Mc9ra' Hill$;
MCA-*-) 8 MCA-*-* :ELECTI(E-II; INTERNET AND INTRANET EN+INEERIN+
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
7nternet Architecture
7ntro4uction to 7nternet an4 7ntranets> 7nternet Architecture> 7nternet'or1in/ issues an4 components>
6e5ie' of +C.I7. mo4el> 7nternet a44ressin/> 7. a44ress hierarchy an4 classes> 7.5> 7nternet routin/>
7nterior an4 Exterior /ate'ay protocols> C7D6> Multi-castin/> Mobile 6outin/> A44ress 6esolution
.rotocol !A6.$> 7. 4ata/ram for'ar4in/;
7ntranet +echnolo/ies
7ntranets inte/rate4 'ith (A0 technolo/ies> E-Mail representation an4 transfer> SM+.> 0(ME> E-
Mail /ate'ays> ?ile transfer an4 remote file access> ?+.> 0et'or1 ?ile Systems !0?S$> 7ntro4uction to
0o5el 0et'are an4 3in4o's 0+I%000;
3eb Ser5er & Client- Ser5er +echnolo/y
3eb Ser5ers> 3eb Access> Ser5er Architectures> (in1s amon/ Ser5ers> the client-ser5er para4i/m> the
soc1et interface> D0S> C97 technolo/ies for 4ynamic 3eb 4ocuments> 333 pa/es an4 bro'sin/>
,ro'ser Architecture> ,ro'ser features an4 capabilities;
0et'or1 Security an4 Mana/ement
Aspects of Security> Secure 0et'or1s an4 policies> 7nte/rity mechanisms> Access control; Encryption
an4 Authentication> Ferberos> .ac1et filterin/> 7nternet fire'all> .roxy ser5ers> 7nternet control
messa/e protocol !7CM.$> 0et'or1 mana/ement an4 S0M.> M7,> Concept of 0et'or1 Mana/ement
Soft'are;
Re%eren$e2
7nternet an4 7ntranet En/ineerin/- +echnolo/y> .rotocols an4 Applications Dantel Minoli>
+MH;
Computer 0et'or1s an4 7nternets;
Computer 0et'or1s an4 7nternets- Dou/las E;Comer> A44ison 3esley;
An En/ineerin/ Approach to Computer 0et'or1in/-S;Fesha5> A44ison 3esley;
+he A,Cs of 7ntranets- Dyson> Coleman> 9ilbert> ,., .ublications;
,usiness Data Communications an4 0et'or1in/-:erry ?itA 9eral4J Alan Dennis> :ohn 3iley
an4 Sons;
7nternet Complete> ,.E .ublications;
MCA-*-) 8 MCA-*-* :ELECTI(E-III; PRINCIPLES OF FINANCE 8 ACCOUNTIN+
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
Accountin/-Meanin/> ob=ecti5es an4 ,asic Accountin/ +erms;
Accountin/ EDuation> 6ecor4in/ of ,usiness +ransactions in Subsi4iary ,oo1s> .reparation of (e4/er
an4 +rial ,alance;
.reparation of financial statements of a sole tra4er 'ith simple a4=ustments;
Analysis of financial statements-nee4 for analysis of financial statementsJ 5arious +ools of analysis G
comparati5e statements> +ren4 analysis> common siAe statements> 6atio analysis;
Statements of chan/es in financial positions; ?un4s flo' statement an4 cash flo' statements;
,u4/etary Control- 2b=ecti5es of ,u4/etary control> .reparation of Cash bu4/et> fixe4 ,u4/et an4
?lexible ,u4/et;
Re%eren$e2
A45ance4 Account by 6;(;9upta> -ol;7 & 77
A45ance4 Accounts by +;S;9re'al> -ol; 7
?inancial Mana/ement by Shashi F; 9upta;
MCA-*-) 8 MCA-*-* :ELECTI(E-I(; E-COMMERCE
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
Electronic Commerce ?rame'or1> Electronic Commerce an4 me4ia Con5er/ence> +he Anatomy of E-
commerce Applications;
Architectural ?rame'or1 for Electronic Commerce> 3orl4 3i4e 3eb as the Architecture> 3eb
,ac1/roun4E Hypertext publishin/> Security an4 the 3eb;
Client-Ser5er 0et'or1 Security> Emer/in/ Client-Ser5er Security +hreats> ?ire'alls an4 0et'or1
Security> Data an4 Messa/e Security> Di/ital s=ematures> Encrypte4 Documents an4 Electronic MailE
.9. an4 .EM;
(e/al Ethical an4 other public policy issues relate4 to Electronics CommerceE .rotectin/ pri5acy>
protectin/ 7ntellectual property> Copyri/ht> tra4emar1s an4 patents> +axation an4 encryption policies;
Consumer oriente4 Electronic commerceE Consumer oriente4 applications> Mercantile process mo4els>
Mercantile .rocess mo4els> Mercantile process mo4els> Mercantile mo4els from the ConsumerHs
perspecti5e-Mercantile mo4els from the Merchant perspecti5e;
+ypes of Electronic .ayment Systems> Di/ital +o1en base4 Electronic .ayment Systems> Smart car4s
an4 Electronic .ayment Systems> Cre4it Car4 ,ase4 Electronic .ayment Systems> 6is1 an4 Electronic
payment Systems> Desi/nin/ Electronic .ayment Systems;
Electronic Data 7nterchan/e> ED7 Applications in ,usiness> ED7E (e/al> Security an4 .ri5acy 7ssue>
ED7 an4 Electronic Commerce;
Re%eren$e2
6a5i Fala1ota> An4re' ,; 3hinstonE ?rontiers of Electronic Commerce> A44ison 3esley;
Efraim +urbon> :ae (ee> Da5i4 Fin/> Chun/E Electronic Commerce; A mana/erial perspecti5e>
.rentice-Hall 7nternational;
9reenstein> ?einnmanE Electronic Commerce> +ata Mc9ra' Hill;
:effrey ?; 6ayport> ,ernar4 :; :a'ors1iE e-commerce> +ata Mc9ra' Hill;
Da5i4 3hiteleyE e-commerce> +ata Mc9ra' Hill;
.ete (oshin> .aul A; MurphyE Electronic Commerce> :aico .ublishin/ House;
MCA-*-) 8 MCA-*-* :ELECTI(E-(; SOFT3ARE TESTIN+ AND <UALIT1 ASSURANCE
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
+estin/ an4 the relate4 conceptsE si/nificance an4 potentialJ +estability an4 features of +est casesJ
soft'are +estin/ techniDuesJ 3,+> ,,+> +rac1in/ ,ox testin/J static analysis> symbolic testin/>
pro/ram mutation testin/; 7nput space> partitionin/> functional pro/ram> testin/> 4ata flo' /ui4e4
testin/J soft'are testin/ strate/iesE Approach> 7ssues> 7rri/ation> incremental> system> alpha> ,eta
testin/ etc;> comparati5e e5aluation of techniDuesE testin/ tools> Dynamic analysis tools> test 4ata
/enerators> Debu//ers> test 4ri5ers etc; E +echnical Metrics for Soft'are Duality factors> frame'or1>
Metrics for analysis> 4esi/n> testin/ source co4e etc; 2b=ect 2riente4 +estin/E 22+ strate/ies an4
issuesE +est case 4esi/n> interface testin/J @uality assuranceE concept> importance an4 essenceJ ?+6>
structure4 'al1 throu/h techniDues etc;J S3 6eliability> 5ali4ation> safety an4 HaAar4 AnalysisJ
?eatures affectin/ Duality of soft'areJ S@A .lan> @uality mo4elsJ 7S2 L000 an4 SE7-CMM an4 their
rele5ance;
Re%eren$e2
Soft'are testin/ by ,oris ,eiAer> Aca4emic .ress;
Art of +estin/ by 9;:; Myers;
Soft'are @uality by 6obert H; Dunn;
Soft'are 6eliability by :;D; Musa> 21umota> :aino> Mc9ra' Hill;
Con4itional an4 Dualifie4 preposition> @uantifie4 propositions 7nte/ration Gbase4 information;
Applications-Approximate reasonin/> pattern reco/nition> fuAAy 4atabases an4 information
retrie5al systems> fuAAy linear pro/rammin/> ?uAAy re/ression> 7nterpersonal communication;
Re%eren$e2
9eor/e :; Feln> ,oyuan> ?uAAy sets an4 fuAAy lo/ic> .;H;7;
MCA-*-) 8 MCA-*-* :ELECTI(E-(III; PRO+RAMMIN+ IN C B
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
7ntro4uctionE C B en5ironment> characteristics of C B;
Data typesE Data types> 5alue types> reference types> 4efault 5alue> constants 5ariables> scope of
5ariables> boxin/ an4 unboxin/;
2perators an4 expressionsE Arithmetic> relational> lo/ical> bit'ise> special operators> e5olution of
expressions> operator prece4ence & associati5ity;
Control constructsE Decision ma1in/> loops;
Classes & metho4sE class> metho4s> constructors> 4estructors> o5erloa4in/ of operators & functions;
7nheritance & polymorphismE -isibility control> o5erri4in/> abstract class & metho4s> seale4 classes &
metho4s> interfaces;
A45ance4 features of C BE Exception han4lin/ & error han4lin/> interfacin/ 'ith C2M> automatic
memory mana/ement;
Re%eren$e2
.ro/rammin/ in C B by E; Eala/urus'amy> +ata Mc9ra' Hill;
+he Complete 9ui4e to C B .ro/rammin/ by -;.; :ain;
C BE A ,e/innerHs 9ui4e> Herbert Schil4t> +ata Mc9ra' Hill;
MCA-*-) 8 MCA-*-* :ELECTI(E-I9; PROFESSIONAL ISSUES IN IT
N!te2 +otal 10 Duestions are to be set by the examiner co5erin/ the entire syllabus uniformly; A
can4i4ate is reDuire4 to attempt any fi5e Duestions; All Duestions shall carry eDual mar1s;
Mar1s E 0 +heory .aper E 0
+ime E 3 hours
(e/al 7ssuesE 7ntro4uction to le/al concepts> ,asic outline of Criminal an4 Ci5il (a's> Concepts
relatin/ to la's of Contract an4 Commercial (a'> Substanti5e (e/al 7ssues> 7ntellectual property
7ssues> Cyber crime> Data