MCA II III Year 9 9 2011

Uttarakhand 1echnical University
COURSES OF S1UDY, SCHEME OF EXAMINA1ION &SYLLABUS FOR M.C.A.

1
S.N
U.
SUBJECT
CUDE
SUBJECT
CUNTACT
HRS.
CREDIT
1 MCA-301 Computer Network 3-1-0 4
2 MCA-302 Analysis&Designof Algorithm 3-1-0 4
3 MCA-303 E-Governance 2-0-0 2
4 MCA-304 EnterpriseResourcePlanning 2-0-0 2
5 MCA-305 GraphTheory 3-1-0 4
6 MCA-306 DataBasemanagement Systems 3-1-0 4
PRACTICALS
7 MCA-311 Computer Network Lab 0-0-2 2
8 MCA-312 ADALab 0-0-2 2
9 MCA-313 DBMSLab 0-0-2 2
10 MCA-314 Minor Project I 0-0-4 4
Total 30
YEAR - II, SEMESTER - III
CUURSES UF STUDY
2
SCHEME UF EXAMINATIUN
S.
Nu.
CUURSE
CUDE
SUBJECT
PERIU
DS
EVALUATIUN SCHEME
SESSIUNAL
EXAM
ESE
Sub|ec
t
Tutal
L T P
C
T
TA Tutal
1. MCA-301 Computer Networks 3 1 0
3
0
20 50 100 150
2. MCA-302
Analysis&Designof
Algorithm
3 1 0
3
0
20 50 100 150
3. MCA-303 E-Governance 2 0 0
1
5
10 25 50 75
4. MCA-304
EnterpriseResource
Planning
2 0 0
1
5
10 25 50 75
5. MCA-305 GraphTheory 3 1 0
3
0
20 50 100 150
6. MCA-306
DataBasemanagement
Systems
3 1 0
3
0
20 50 100 150
Total (Theory) 750
PARCTICALS
7 MCA-311 Computer Network Lab 0 0 2 25 25 25 50
8 MCA-312 ADALab 0 0 2 25 25 25 50
9 MCA-313 DBMSLab 0 0 2 25 25 25 50
10 MCA-314 Minor Project I 0 0 4 50 50 50 100
Total (Practical) 250
Tutal (Theory+Practical) 1 4 1 1
3
LAk - II, SLMLS1Lk - IV
CCUkSLS CI S1UD
S. NC.
SU8ILC1
CCDL
SU8ILC1
CCN1AC1
HkS.
CkLDI1
1 MCA-401 Ck
MCA-407
SofLware ro[ecL ManagemenL Ck .NL1
lramework & C# rogrammlng
3-1-0 4
2 MCA-402 MlCkCkCCLSSCk ANu S?S1LMS SCl1WAkL 3-1-0 4
3 MCA-403 SofLware Lnglneerlng 3-1-0 4
4 MCA-404 CompuLer Craphlcs & AnlmaLlon 3-1-0 4
5 LIective-I
(any one of Lhe fo||owlng)
*MCA 711/712/713/714/715
2-0-0 2
6 LIective-II
*MCA 721/722/723/724/725
2-0-0 2
kAC1ICALS
7 MCA-411 CompuLer Craphlcs Lab 0-0-2 2
8 MCA-412 Mlcroprocessor Lab 0-0-2 2
9 MCA-413 Ck
MCA-415
SofLware Lngg. Lab Ck .NL1 Lab 0-0-2 2
10 MCA-414 Mlnor ro[ecL ll 0-0-4 4
1oLa| 30
LIective-I (Any one of Lhe fo||owlng)
MCA 711 CompuLer ArchlLecLure
MCA 712 SysLem Ana|ysls & ueslgn
MCA 713 Aovanceo uaLabase ManagemenL SysLem
MCA 714 robabl|lLy ano SLochasLlc rocesses
MCA 715 Aovanceo CompuLer NeLworks
LIective-II (Any one of Lhe fo||owlng)
MCA 721 ara||e| CompuLlng
MCA 722 ulglLa| lmage rocesslng
MCA 723 lnformaLlon SecurlLy
MCA 724 ArLlflcla| lnLe||lgence
MCA 725 Mu|Llmeola SysLems
4
SCHLML CI LxAMINA1ICN
S.
No.
CCUkSL
CCDL SU8IL
C1
LkICDS
LVALUA1ICN SCHLML
SLSSICNAL LxAM LSL
Sub|ect
1otaI
L 1 C1 1A 1otaI
1
MCA-401 Ck
MCA-407
SofLware ro[ecL ManagemenL
Ck .NL1 lramework & C#
rogrammlng
3 1 0 30 20 50 100 150
2 MCA-402
MlCkCkCCLSSCk
ANu S?S1LMS
SCl1WAkL
3 1 0 30 20 50 100 150
3 MCA-403 SofLware Lnglneerlng 3 1 0 30 20 50 100 150
4 MCA-404
CompuLer Craphlcs
& AnlmaLlon
3 1 0 30 20 50 100 150
5 LIective-I
(any one of Lhe
fo||owlng)
*MCA
711/712/713/714/715
2 0 0 15 10 25 50 75
6 LIective-II
*MCA 721/722/723/724/725
2 0 0 15 10 25 50 75
1otaI (1heory) 7S0
kAC1ICALS
7 MCA-411
CompuLer Craphlcs &
AnlmaLlon Lab
0 0 2 25 25 25 50
8 MCA-412 Mlcroprocessor Lab 0 0 2 25 25 25 50
9 MCA-413 Ck
MCA-415
SofLware Lngg Lab Cr .NL1 Lab 0 0 2 25 25 25 50
10 MCA-414 Mlnor ro[ecL ll 0 0 4 50 50 50 100
1otaI (racticaI) 2S0
1otaI (1heory + racticaI)
16 4 10 1000
1A - 1eacher AssessmenL C1 - Cumu|aLlve 1esL LSL - Lno SemesLer LxamlnaLlon
NoLe: uuraLlon of LSL sha|| be 3 (1hree) hours.
5
YEAR - III, SEMESTER - V
CUURSES UF STUDY
S.
NU.
SUBJECT
CUDE
SUBJECT
CUNTAC
T HRS.
CREDIT
1 MCA-501 AdvancedSoftwareEngineering 3-1-0 4
2 MCA-502 WebTechnologies 2-0-0 2
3 MCA503 BusinessCommunication 2-0-0 2
4 Electtve-III
(anyoneof thefollowing)
*MCA-731/ 732/ 733/ 734/ 735
3-1-0
4
5 Electtve-IV
*MCA-741/ 742/ 743/ 743/ 745
3-1-0
4
6 Electtve-V
*MCA-751/ 752/ 753/ 754/ 755
3-1-0
4
PRACTICALS
7 MCA-511
AdvancedSoftwareEngineering/ UML
Lab
0-0-2 2
8 MCA-512 WebTechnologies Lab 0-0-2 2
9 MCA-513 BusinessCommunicationLab 0-0-2 2
10 MCA-515 General Proficiency 0-0-4 4
Total 30
Electtve-III (anyoneof thefollowing)
MCA731AdvancedComputer Architecture
MCA732DataWarehouse&DataMining
MCA733AdvancedOperatingSystems
MCA734Soft Computing
MCA735Mobile&AdhocComputing
Electtve-IV (anyoneof thefollowing)
MCA741EmbeddedSystems
MCA742PatternRecognition
MCA743CryptographyandNetworkSecurity
MCA744Natural languageProcessing
MCA745MultimediaCommunication
Electtve-V (anyoneof thefollowing)
MCA751Real TimeSystems
MCA752OperationResearch
MCA753Modeling&Simulation
MCA754BioInformatics
MCA755Client Server Computing
6
SCHEME OF EXAMINATION
S.
Nu.
CUURSE
CUDE
SUBJECT
PERIUDS
EVALUATIUN SCHEME
SESSIUNAL
EXAM ESE
Sub|ect
Tutal
L T P CT TA Tutal
1 MCA-501
AdvancedSoftware
Engineering
3 1 0 30 20 50 100 150
2 MCA-502 WebTechnologies 2 0 0 15 10 25 50 75
3 MCA503 BusinessCommunication 2 0 0 15 10 25 50 75
4 Electtve-III
*MCA-731/ 732/ 733/ 734/ 735
3 1 0 30 20 50 100 150
5 Electtve-IV
*MCA-741/ 742/ 743/ 743/ 745
3 1 0 30 20 50 100 150
6 Electtve-V
*MCA-751/ 752/ 753/ 754/ 755
3 1 0 30 20 50 100 150
Tutal {Theury] 75
PARCTICALS
7 MCA-511
AdvancedSoftware
EngineeringLab
0 0 2 25 25 25 50
8 MCA-512 WebTechnologiesLab 0 0 2 25 25 25 50
9 MCA-513
BusinessCommunication
Lab
0 0 2 25 25 25 50
10 MCA-514 General Proficiency 0 0 4 50 50 50 100
Tutal {Practtcal] 25
Tutal {Theury + Practtcal] 1 4 1 1
TA Teacher Assessment CT CumulativeTest ESE EndSemester Examination
Note: Durationof ESEshall be3(Three) hours.
7
YEAR -III, SEMESTER - VI
CUURSES UF STUDY
S.N
U.
SUBJECT
CUDE
SUBJECT
CUNTACT
HRS.
CREDIT
MCA601 Industrial Project workfor 16weeks* 30 30
S.
Nu.
CUURSE
CUDE SUBJECT
PERIUDS
EVALUATIONSCHEME
SESSIUNAL
EXAM ESE
Sub|ect
Tutal
L T P CT TA Tutal
1
MCA-
671
Industrial Project 0 0 0 - 500 500 500 1000
Tutal 5
Note: Durationof ESEshall be3(Three) Hours
8
YEAR II, SEMESTER -III
Untt-I
MCA 31 - CUMPUTER NETWURKS
L T P
3 1 0
Intruductury Cuncepts: Goals and Applications of Networks, Network structure and architecture, the OSI
reference model, services, networks topology, Physical Layer- transmission, switching methods,
Integratedservicesdigital networks, terminal handling.
Untt-II
Medtum access sub layer: Channel allocations, LAN protocols, ALOHA Protocols- Pure ALOHA, slotted
ALOHA, Carrier Sense Multiple Access Protocols, CSMA with Collision Detection, Collision free Protocols,
IEEE standards, FDDI, Data Link Layer- elementary data link protocols, sliding windows protocols, error
handling, High Level DataLink Control
Untt-III
Netwurk Layer: Point-to Point networks, routing algorithms, congestion control algorithms,
internetworking, TCP/ IP packet, IP addresses, IPv6.
Untt-IV
Transpurt Layer: Designissues, connectionmanagement, TCP windowManagement, User Datagram
Protocol, TransmissionControl Protocol.
Untt-V
Appltcattun Layer: Network Security, DES, RSA algorithms, Domain Name System, Simple Network
Management Protocol, Electronic mail, File Transfer Protocol, Hyper Text Transfer Protocol,
Cryptographyandcompression Techniques.
References
2. W. Stallings, DataandComputer Communication, MacmillanPress
3. Forouzan, DataCommunication andNetworking, TMH
9
MCA 32 - ANALYSIS AND DESICN UF ALCURITHM
L T P
3 1 0
Untt-I
Intruducttun:
Algorithms, Analysis of Algorithms, Design of Algorithms, and Complexity of Algorithms, Asymptotic
Notations, Growthof function, Recurrences
Sortingin polynomial Time: Insertionsort, Mergesort, Heapsort, andQuick sort
Sortingin Linear Time: Countingsort, RadixSort, Bucket Sort
Medians andorder statistics
Untt-II
Advanced Data Structure: Red-Black Trees, Augmenting Data Structure. B Trees, Binomial Heaps,
Fibonacci Heaps, DataStricturefor Disjoint Sets.
Untt-III
Advanced Destgn and Analysts Techntques: Dynamic programming, Greedy Algorithm, Backtracking,
Branch-and-Bound, Amortized Analysis
Untt-IV
Craph Algurtthms: Elementary Graph Algorithms, Breadth First Search, Depth First Search, Minimum
Spanning Tree, Kruskals Algorithms, Prims Algorithms, Single Source Shortest Path, All pair Shortest
Path, MaximumflowandTravelingSalesmanProblem.
Untt -V
RandomizedAlgorithms, StringMatching, NP-HardandNP-Completeness, Approximation Algorithms.
Text Buuks:
1. Coreman, Rivest, Lisserson, : Algorithm", PHI.
References
1MT Goodrich etal, Algorithms Design, John Wiley
2AVAhoetal, TheDesign andanalysis of Algorithms, Pearson Education
10
MCA 33 - E-Governance
L T P
2 1 0
Untt I
Overview of E-Government and E-Governance, Stages of E-Governance, National E- Governance Plan
(NeGP), Mission Mode Projects and their implementation status, E-Governance , Introduction to E-
governance, Roleof ICTs in e-governance, Need, importanceof E-governance
Untt II
Categories of E-governance, Key Issues of E-Governance, Technology, Policies,Infrastructure,Training,
Copyrights , Consulting Funds, E-governance Models, Model of Digital Governance, Broadcasting / Wider
DisseminationModel
Untt III
Critical FlowModel, Interactive-servicemodel/ Government to-Citizen-to-Government Model (G2C2G),
Major areas of E-governanceServices, PublicGrievances: Telephone, Rationcard, transportation, Rural
servicesLandRecords, Police: FIRregistration, Lost andfound, Social services: Death, domicile, school
certificates
Untt IV
Public information: employment, hospitals, railway, Agricultural sector: Fertilizers, Seeds, Utility
payments Electricity, water, telephone, Commercial: income tax, custom duty, excise duty-Governance
Infrastructure, stages in evolution and strategies for success, -Governance Infrastructure, stages in
evolutionandstrategiesfor success
Unit- V
Human Infrastructural preparedness, Challenges against E-governance, Studyof E-governanceinitiativesin
Indianstates, E-readiness, Legal Infrastructural preparedness
Reference buuks
(1) Geo-informationinternational publications
(2) E-governanceprojects, PHI publication
11
MCA-34 - Enterprtse Resuurce Planntng
L T P
2 1 0
Unit-I
Enterprisewideinformationsystem, Custombuilt andpackagedapproaches, Needs andEvolutionof ERP
Systems, Common myths andevolvingrealities, ERP andRelatedTechnologies, BusinessProcess
ReengineeringandInformationTechnology, Supply ChainManagement, RelevancetoDataWarehousing,
Data MiningandOLAP, ERP Drivers, Decisionsupport system
Untt-II
ERP Domain, ERP Benefits classification, Present global andIndianmarket scenario, milestones and
pitfalls,
Forecast, Market players andprofiles, Evaluation criterionfor ERP product, ERP LifeCycle: Adoption
Decision, Acquisition, Implementation, Use&Maintenance, Evolution andRetirement phases, ERP
Modules
Untt- III
Framework for evaluatingERP acquisition, Analytical HierarchyProcesses (AHP), Applications of AHP in
EvaluatingERP, Selection of Weights, Roleof consultants, vendors andusers in ERPimplementation;
Implementationvendors evaluationcriterion, ERP Implementationapproachesandmethodology, ERP
Implementationstrategies, ERP Customization, ERP-AmanufacturingPerspective
Untt- IV
Critical success andfailurefactors for implementation, Model for improvingERP effectiveness, ROI of ERP
Implementation, Hiddencosts, ERP success inhibitors andaccelerators, Management concernfor ERP
success,
StrategicGrid: Useful guidelines for ERP Implementations.
Untt- V
Technologies in ERP SystemsandExtendedERP, CaseStudiesDevelopment andAnalysis of ERP
Implementationsin focusingthevarious issues discussed inaboveunits throughSoft Systemapproachesor
QualitativeAnalysis tools, LearningandEmergingIssues, ERP andE-Commerce.
Rejerencex
1. A. Lexis Leon, EnterpriseResourcePlanning, TMH
2. Brady, Manu, Wegner, EnterpriseResourcePlanning, pearson
12
MCA-35 - CRAPH THEURY
L T P
3 1 0
Untt 1
Graphs, sub-graphs, some basic properties, Walks, Path & circuits, Connected graphs, Disconnected
graphs and component, Euler and Hamiltonian graphs, The traveling sales man problem, Various
operationon graphs.
Untt II
Trees and fundamental circuits, distancediameters, radius and pendent vertices, rooted andbinary trees, on
counting trees, spanning trees, fundamental circuits, finding all spanning trees of a graph and a
weightedgraph, algorithms of primes, Kruskal anddijkstraAlgorithms.
Cut-sets and cut vertices, some properties, All cut sets in a graph, Fundamental circuit and cut sets,
Connectivity and seperatability, Network flows, mincut theorem, Planar graphs, Combinatorial and
geometric dual, Kuratowski to graph detection of planarity, Geometric dual, Some more criterion of
planarity, Thickness andCrossings.
Untt III
Vector space of a graph and vectors, basis vector, cut set vector, circuit vector, circuit and cut set verses
subspaces, orthogonal vectors and subspaces, incidence matrix of graph, sub matrices of A(G), circuit
matrix, cut set matrix, path matrix and relationships among Af, Bf, and Cf, fundamental circuit matrix and
rankof B, adjacencymatrices, rank- nullitytheorem.
Untt IV
Coloring and covering partitioning of graph, Chromatic number, Chromatic partitioning, Chromatic
polynomials, Matching, covering, Four color problem.
Untt V
Directed graph, Types of directed graphs, Directed paths and connectedness, Euler digraph, Trees with
directed edges, Fundamental circuit in digraph, Matrices A, B, C of digraph adjacency matrix of digraph,
Enumeration and its types, Counting of labeled and unlabeled trees, Polyas theorem, Graph enumeration
withpolyas theorem, Graphtheoreticalgorithm.
References
3. Joshi K. D., Fundamental of discretemathematics, NewAgeInternational
4. JohnTruss, Discretemathematics for computer scientist
5. C. L. Liu, Discretemathematics
13
MCA 3 - Data Base management Systems
L T P
3 1 0
Untt- I
Intruducttun: An overview of database management system, Database SystemVs File System, Database
Systemconcepts and architecture, data models schema and instances, data independence and data base
languageandinterfaces, Datadefinitions language, DML, Overall DatabaseStructure
Data mudeltng ustng the Enttty Relattunshtp Mudel: ERmodel concepts, notation for ERdiagram,
mapping
constraints, keys, Concepts of Super Key, candidatekey, primarykey, Generalization, aggregation,
reductionof
An ERdiagramsto tables, extendedERmodel, relationships of higher degree.
Untt- II
Relattunal data Mudel and Language: Relational datamodel concepts, integrityconstraints: entity
integrity,
Referential integrity, Keys constraints, Domain constraints, relational algebra, relational calculus, tuple
anddomain calculus
Intruducttun tu SQL: Characteristics of SQL, Advantages of SQL, SQL datatypes andliterals, Typesof SQL
Commands, SQL operators andtheir procedure, Tables, views andindexes, Queriesandsubqueries,
Aggregate
Functions, Insert, updateanddeleteoperations, Joins, Unions, Intersection, Minus, Cursorsin SQL.
PL/ SQL, Triggers andclusters
Untt- III
Data Base Destgn & Nurmaltzattun: Functional dependencies, normal forms, first, second, thirdnormal
forms,
BCNF, inclusiondependencies, loss less joindecompositions, normalizationusingFD, MVD, andJDs,
alternativeapproaches to databasedesign
Untt- IV
Transacttun Prucesstng Cuncepts: Transaction system, testingof serializability, Serializabilityof
schedules,
Conflict &viewserializableschedule, recoverability, Recoveryfromtransactionfailures, logbased
recovery,
Checkpoints, deadlock handling
Untt- V
Cuncurrency Cuntrul Techntques: Concurrency control, lockingTechniques for concurrencycontrol,
Timestampingprotocols for concurrencycontrol, validationbasedprotocol, multiplegranularity, Multi-
version
Schemes, Recoverywithconcurrent transaction. Transaction Processingin Distributedsystem, data
fragmentation. Replication andallocationtechniques for distributedsystem, overviewof concurrency
control
andrecoveryin distrusted database
References
1DateCJ, An IntroductionToDatabaseSystem, Addison Wesley
4Paul BeynonDavies, DatabaseSystems, PalgraveMacmillan
8Bharti P.K, An introductionto DatabaseSystems, JPNP
14
MCA-311 CUMPUTER NETWURK LAB
Thelabis to beconductedin Perl programminglanguage, Perl works on all platforms
(includingwindows)
1. Writefewbasicprograms of Perl.
a. AHello WorldProgram
b. Writeaprogramto addto 10numbers.
L T P
0 0 2
c. Writeaprogramof readinginput fromthekeyboardanddisplayingthemonmonitor. d.
Writeaprogramto taketwostrings as input andcomparethem
2. Tounderstandadvanceconstructs of Perl
a. Writeaprogramtocreatealist of your course(all theory courses in current semester)
usingarrayandprint them.
b. Writeaprogramto accept tennumber, storeit intoahashtable(Perl haveitself) and
whenaskedbyuser tell himthat number exists or not. (donot storeduplicatenumbers)
c. Writeaprogramtocomputethenumber of lines in afile.
3. FindtheIP address of ahost or turnanIP address intoaname.
4. Connect toanFTP server andget or put files. Automatetheone-timetransfer of manyfiles to
downloadthefileeveryday, whichhavechangedsinceyesterday. (useNet:FTP)
5. Writeaprogramto sendmail. Theprograms shouldmonitor systemresources likedisk space
andnotifyadminbymail whendisk spacebecomesdangerouslylow. (useNet:mail)
6. Fetchmail fromaPOP3server (useNet:pop3)
7. Findout whoowns adomain(useNet:whois , Whois is aserviceprovidedbydomain name
registrationauthorities to identifyowners of domain names)
8. Test whether amachineis alive. MachinecanbespecifiedusingIP address or domainnameof
machine.
9. Writeaprogramto fetchcontent of aURL fromaperl script, convert it to ASCII text (bystripping
html tags) anddisplay it.
10. Writeprogramfor TCP Server, TCP Client andcreateasamplecodetoshowserver-client
communicationover TCP.
OR
The lab ts tu be cunducted tn prugrammtng languageJtuulsJplatefurm
11. Study oI complete network architecture oI your institution (including topology,
network devices cabling standards, protocol and security Ieatures).
12. Hands on experiment Ior conIiguring network interIace card Ior connecting two
systems.
13. Test the connectivity between two hosts.
14. Test all options oI ping.
15. Write a Program to Iind the IP address and domain name oI your system.
16. Write a Program to establish connection between a TCP client & server Ior studying
nature oI client server communication.
17. Write a Program to connect Itp server to get & put Iile.
18. Study IEEE standards & Iind out their implementation in networking environment.
19. Write a program to Iind an IP address oI host and turn on IP address into domain
name.
20. Make a report on LAN establishment in any oI organization including hardware &
networking aspects.
15
MCA-312 ANALYSIS AND DESICN UF ALCURITHM LAB
Perfurm any TEN prugram tn suttable language
1. Writeaprogramto drawalineusingDDA algorithm.
2. Writeaprogramfor implementingBresenhams algorithmfor linegeneration
3. Writeaprogramfor generationof circle.
4. Writeaprogramto demonstrateCohen- Sutherland lineclippingmethod.
5. Writeaprogramto implement Sutherland- Hodgeman polygon clippingalgorithm.
L T P
0 0 2
6. Writeaprogramto rotateatriangle. (By askingtheuser toinput thecoordinates of the Triangle
andtheangleof rotation)
7. Writeaprogramto performonepoint perspectiveprojectionof anobject.
8. Writeaprogramto implement Depth- Buffer method to display thevisiblesurfaces of agiven
polyhedron.
9. Writeaprogramto implement 3-Drotationof anobject.
10. Writeaprogramto drawploylineusinganyalgorithm.
11. Writeaprogramto drawaBezier curveandsurface.
12. Divideandconquer method (quick sort, mergesort,)
13. Greedymethod (knapsack problem, jobsequencing, optimal merge
patterns, minimal spanningtrees).
14. Dynamicprogramming(multistagegraphs, OBST, 0/ 1knapsack,
travelingsales personproblem).
15. Implement Back tracking
16. Sorting: Insertionsort, Heapsort, Radixsort
17. Searching: Sequential andBinary Search
18. Selection: Minimum/ Maximum, K thsmallest element.
19. Implement DepthFirst SearchandBreadthFirst Search.
20. Writeprogramto implement Prims algorithm.
21. Writeprogramto implement Prims algorithm.
Note: Students areadvisedtouseC, C++languagefor writingprogram; Useof open GL is desirable.
16
MCA 313 - DATABASE MANACEMENT SYSTEM LAB
Ltst uf Expertment:
1. Writethequeries for DataDefinitionandDataManipulation Language.
2. WriteSQL queries usinglogical operations (=,<,>,etc)
3. WriteSQL queries usingSQL operators
4. WriteSQL queryusingcharacter, number, dateandgroupfunctions
5. WriteSQL queries for relational algebra
6. WriteSQL queries for extractingdatafrommorethanonetable
7. WriteSQL queries for subqueries, nestedqueries
8. Writeprogrammebytheuseof PL/ SQL
9. Concepts for ROLL BACK, COMMIT &CHECK POINTS
10. CreateVIEWS, CURSORSandTRGGERS&writeASSERTIONS.
11. CreateFORMSandREPORTS
Note:
1. Thequeries to beimplementedon DBMS usingSQL 2. Students areadvisedto useDeveloper
2000/ Oracle9i or other latest versionfor aboveexperiments. However student mayusePower Builder/ SQL
SERVERor DB2.Mini Projects may alsobeplanned&carriedout throughout thesemester tounderstand
important concepts of database.
17
LAk II, SLMLS1Lk -IV
Unit I
MCA 401 - SCI1WAkL kCILC1 MANAGLMLN1
L T P
3 1 0
Introduction to Software ro|ect Management:
SofLware oeve|opmenL as a pro[ecL, SLakeho|oers ln sofLware pro[ecL, SofLware prooucL, process,
resources, qua|lLy, ano cosL, Cb[ecLlves, lssues, ano prob|ems re|aLlng Lo sofLware pro[ecLs.
Cverview of ro|ect Ianning:
SLeps ln pro[ecL p|annlng, ueflnlng scope ano ob[ecLlves, work breakoown sLrucLure, ue|lverab|es
ano oLher prooucLs, Llme, cosL, ano resource esLlmaLlon, A|LernaLlves ln |annlng
ro|ect LvaIuation:
SLraLeglc assessmenL, 1echnlca| assessmenL, CosL-beneflL ana|ysls, Cash f|ow forecasLlng, CosL-
beneflL eva|uaLlon Lechnlques, 8reak-even ana|ysls, klsk eva|uaLlon
Unit II
SeIection of Appropriate ro|ect Approach:
Chooslng oeve|opmenL Lechno|ogy ano meLhooo|ogy, cholce of process mooe|, kaplo app|lcaLlon
oeve|opmenL, WaLerfa|| mooe|, v-process mooe|, Splra| mooe|, roLoLyplng, lncremenLa| oe|lvery.
Software Lffort Lstimation
rob|em ln sofLware esLlmaLlon, LfforL esLlmaLlon Lechnlques, LxperL [uogmenL, LsLlmaLlon by
ana|ogy, ue|phl Lechnlque, A|gorlLhmlc meLhoos, 1op-oown ano boLLom-up esLlmaLlon, luncLlon
polnL ana|ysls, Cb[ecL polnLs, CCCCMC mooe|.
Unit III
Activity Ianning
NeLwork p|annlng mooe|, AcLlvlLy-on-arrow neLwork, receoence neLwork, lorwaro pass, 8ackwaro
pass, CrlLlca| paLh, S|ack ano f|oaL.
kisk AnaIysis and Management
NaLure ano caLegorles of rlsk ln sofLware oeve|opmenL, rlsk loenLlflcaLlon, klsk assessmenL, klsk
mlLlgaLlon, monlLorlng, ano managemenL, Lva|uaLlng scheou|e rlsk uslng Lk1.
kecourse AIIocation
NaLure of pro[ecL resources, loenLlfylng resource requlremenL of acLlvlLles, A||ocaLlng ano scheou|lng
resources, cosL of resources, SLanoaro, p|anneo, ano acLua| cosL, CosL varlance, Llme-cosL Lraoe-off. Unit
IV
ro|ect 1racking and ControI
MeasuremenL of physlca| ano flnancla| progress, Larneo va|ue ana|ysls, SLaLus reporLs, Ml|esLone
reporLs, Change conLro|.
Contact Management
CuLsourclng of prooucLs ano servlces, 1ypes of conLracLs, SLages ln conLracL p|acemenL, 1erms of
conLracL, ConLracL monlLorlng, AccepLance LesLlng
Unit V
Software uaIity Assurance
|annlng for qua|lLy, rooucL versus process qua|lLy managemenL, roceoura| ano quanLlLaLlve
approaches, uefecL ana|ysls ano prevenLlon, SLaLlsLlca| process conLro|, areLo ana|ysls, Causa|
ana|ysls, Cua|lLy sLanoaros, lSC 9000, Capabl|lLy MaLurlLy Mooe|, Cua|lLy auolL.
1. koberL 1. luLre||, uona|o l. Shafer, ano Llnoa l.. Shafer, Cua|lLy SofLware ro[ecL ManagemenL
2002, earson LoucaLlon Asla.
2. kamesh Copa|aswamy, Managlng C|oba| SofLware ro[ecLs, 2003, 1aLa McCraw-nl||
Ck
18
YEAR II, SEMESTER -IV L T P
3 1 0
MCA - 407 .Net FRAMEWORK AND C# PROGRAMMING
UNT
Introduction to C#, CLR, Visual studio console app, Simple windows forms, C# language fundamentals, Enumerations, structures,
Namespaces
UNT
C# Object oriented programming: OOPs, Encapsulation, nheritance, Polymorphism, Object Lifetime, Components, Modules,
Windows Forms, nterface, Cloneable objects, Comparable objects, Collections Namepaces
Advanced CIass Construction: Custom ndexer, Overloading operators, Delegates, Events
UNT
AssembIies, Thread, and AppDomains: C# assemblies, GAC, threads, contexts, Appdomains, Processes concepts, Concurrency
and synchronization- Locks, Monitors, ReaderWriterLock, Mutexes, Thread pooling,
UNT V
IO, Object seriaIization and remoting: System.O, Streams, TextWriter, TextReader, BinaryWirter, BinaryReader, Serialized
Object Persistence and formatters, Remoting
ADO.Net, C# windows forms for data controI: Grid, Datasource and databinding controls, Connected and disconnected
scenarios, ADO.Net system, Data, Dataset, connections, Adapters, commands, datareaders,
UNT V
ASP.net: ntroduction, Architecture, Web forms,Web servers, Server controls, Data connectivity using ASP.net, ntroduction of
XML, Using XML with ASP.nat
Text Books
1. A Guide to the Project Management Body of Knowledge (PMBOK), Project Management nstitute, PA, (2004).
2. Harold Kerzner, Frank P. Saladis, Project Management Workbook and PMP/CAPM Exam Study Guide , Wiley Publishers
(2006)
3. Addison Wesley C# Developers Guide to ASP.Net
4. Wiley, Beginning Visual C# 2008,Wrox
Reference Books
1. Claudia M. Baca, Patti, PMP: Project Management Professional Workbook, Sybex, Workbook (2003).
2. C#.Net Developers Guide- Greg Hack, Jason Werry, Saurabh Nandu. (SyngRess)
3. Wrox Press ProIessional C# 3rd Edition Simon Robinson, Jay Glynn
19
MCA 402 - MICkCkCCLSSCk AND SS1LMS SCI1WAkL
L T P
3 1 0
Unit-I
lnLrooucLlon Lo Mlcroprocessors, mlcrocompuLers ano Assemb|y |anguage, Mlcroprocessor
archlLecLure ano mlcrocompuLer sysLems. 8085 archlLecLure ano memory lnLerfaclng, lnLerfaclng l/C
oevlces,
Unit II
rogrammlng 8085: lnLrooucLlon Lo 8085 lnsLrucLlons: rogrammlng 1echnlques, CounLers ano 1lme
ue|ays, SLacks ano SubrouLlnes, lnLerrupLs, Cenera| purpose programmab|e perlphera| oevlces
Unit-III
lnLrooucLlon Lo sysLem sofLware: oeflnlLlon, feaLure of sysLem programmlng, sysLem programmlng vs.
app|lcaLlon programmlng ano Lype of sysLem programmes
Assemb|er: slng|e pass assemb|er, Lwo-pass assemb|er, ano genera| oeslgn proceoure of an
assemb|er.
Unit -IV
Macro processor: macro |anguage ano lLs feaLures, macro lnsLrucLlons, feaLures of macro facl|lLy,
lmp|emenLaLlon, one pass macro processor, Lwo pass macro processor, lmp|emenLaLlon.
Loaoers ano |lnkers: slmp|e |lnker vs. |oaoers, ano oeslgn ano lmp|emenLaLlon of olrecL |lnklng
|oaoer, subrouLlne |lnkage & oLher |oaoer schemes
Unit-V
Compl|ers: overvlew of compl|aLlon process, |exlca| ana|ysls, synLax ana|ysls, semanLlc ana|ysls ano
lnLermeolaLe cooe generaLlon ano cooe opLlmlzaLlon Lechnlques, compl|er vs. lnLerpreLer. lnLrooucLlon
Lo oevlce orlver, funcLlons ano sLrucLure of LexL eolLor.
keferences:
1. k.S Coankar, Mlcroprocessor archlLecLure, programmlng ano app|lcaLlon wlLh Lhe 8085,
en kam lnLernaLlona|.
2. Aho ano u|man, rlnclp|es of Compl|ers, Narosa ub|lshlng nouse, 1986.
20
MCA 403 - SCI1WAkL LNGINLLkING
L T P
3 1 0
Unit-I Introduction:
lnLrooucLlon Lo SofLware Lnglneerlng, SofLware ComponenLs, SofLware CharacLerlsLlcs, SofLware
Crlsls, SofLware Lnglneerlng rocesses, Slml|arlLy ano ulfferences from ConvenLlona| Lnglneerlng
rocesses, SofLware Cua|lLy ALLrlbuLes.
SofLware ueve|opmenL Llfe Cyc|e (SuLC) Mooe|s: WaLer la|| Mooe|, roLoLype Mooe|, Splra| Mooe|,
Lvo|uLlonary ueve|opmenL Mooe|s, lLeraLlve LnhancemenL Mooe|s.
Unit-II Software kequirement Specification:
L|lclLaLlon, Ana|ysls, uocumenLaLlon, kevlew ano ManagemenL of user Neeos, leaslbl|lLy SLuoy,
lnformaLlon Mooe|lng, uaLa l|ow ulagrams, LnLlLy ke|aLlonshlp ulagrams, ueclslon 1ab|es, SkS
uocumenL, lLLL SLanoaros for SkS.
SofLware Cua|lLy Assurance (SCA),SLl-CMM Mooe|.
Unit -III Software-Design:
ueslgn prlnclp|es, prob|em parLlLlonlng, absLracLlon, Lop oown ano boLLom up-oeslgn, sLrucLureo
approach, funcLlona| versus ob[ecL orlenLeo approach, Low Leve| ueslgn: Moou|arlzaLlon, ueslgn
SLrucLure CharLs, seuoo Cooes, l|ow CharLs, Coup|lng ano Coheslon Measures.
SofLware MeasuremenL ano MeLrlcs: varlous Slze CrlenLeo Measures: na|esLeao's SofLware Sclence,
luncLlon olnL (l) 8aseo Measures, ano Cyc|omaLlc Comp|exlLy Measures: ConLro| l|ow Craphs.
Unit-IV Coding:
1op-uown ano 8oLLom -up programmlng, sLrucLureo programmlng, lnformaLlon hlolng,
programmlng sLy|e ano lnLerna| oocumenLaLlon.
1esting: 1esLlng prlnclp|es, Leve|s of LesLlng, funcLlona| LesLlng, sLrucLura| LesLlng, LesL p|ane, LesL
case speclflcaLlon, re|labl|lLy assessmenL, sofLware LesLlng sLraLegles, verlflcaLlon & va|loaLlon, unlL
LesLlng, lnLegraLlon 1esLlng, A|pha & 8eLa LesLlng, sysLem LesLlng ano oebugglng.
Unit-V Software Maintenance and ro|ect Management:
Neeo for MalnLenance, CaLegorles of MalnLenance: revenLlve, CorrecLlve ano erfecLlve
MalnLenance, CosL of MalnLenance, SofLware ke-Lnglneerlng, keverse Lnglneerlng.
1he ManagemenL specLrum- (1he peop|e, Lhe prooucL, Lhe process, Lhe pro[ecL), cosL esLlmaLlon,
pro[ecL scheou|lng, sLafflng, sofLware conflguraLlon managemenL, SLrucLureo vs. unsLrucLureo
malnLenance, qua|lLy assurance, pro[ecL monlLorlng, rlsk managemenL.
keferences
1. Chezzl, Car|o ano CLhers, lunoamenLa|s of SofLware Lnglneerlng, nl
2. A|exls, Leon ano MaLhews Leon, lunoamenLa| of SofLware Lnglneerlng, vlkas
3. f|eerger, S, SofLware Lnglneerlng, Macml||an, 1987
20
MCA-404 CCMU1Lk GkAHICS & ANIMA1ICN
L T P
3 1 0
Unit - I
lnLrooucLlon ano Llne CeneraLlon:1ypes of CompuLer graphlcs, Craphlc ulsp|ays- kanoom scan
olsp|ays, kasLer scan olsp|ays, lrame buffer ano vloeo conLro||er, olnLs ano |lnes, Llne orawlng
a|gorlLhms, Clrc|e generaLlng a|gorlLhms, Mlo polnL clrc|e generaLlng a|gorlLhm, ano para||e| verslon of
Lhese a|gorlLhms.
Unit - II
1ransformaLlons: 8aslc LransformaLlon, MaLrlx represenLaLlons ano homogenous coorolnaLes,
ComposlLe LransformaLlons, kef|ecLlons ano shearlng. Wlnoowlng ano C|lpplng: vlewlng plpe|lne,
vlewlng LransformaLlons, 2-u C|lpplng a|gorlLhms- Llne c|lpplng a|gorlLhms such as Cohen SuLher|ano
|lne c|lpplng a|gorlLhm, Llang 8arsky a|gorlLhm, Llne c|lpplng agalnsL non recLangu|ar c|lp wlnoows,
o|ygon c|lpplng SuLher|ano noogeman po|ygon c|lpplng, Wel|er ano ALherLon po|ygon c|lpplng,
Curve c|lpplng, 1exL c|lpplng.
Unit - III
1hree ulmenslona|: 3-u geomeLrlc prlmlLlves, 3-u Cb[ecL represenLaLlon, 3-u 1ransformaLlon, 3-u
vlewlng, pro[ecLlons, 3-u C|lpplng.
Unit - IV
Curves ano Surfaces: Cuaorlc surfaces, Spheres, L||lpsolo, 8|obby ob[ecLs, lnLrooucLory concepLs of
Sp|lne, 8sp|lne ano 8ezler curves ano surfaces. nlooen Llnes ano Surfaces: 8ack lace ueLecLlon
a|gorlLhm, uepLh buffer meLhoo, A- buffer meLhoo, Scan |lne meLhoo, baslc l||umlnaLlon mooe|s -
AmblenL |lghL, ulffuse ref|ecLlon, Specu|ar ref|ecLlon ano hong mooe|, Comblneo approach, Warn
mooe|, lnLenslLy ALLenuaLlon, Co|or consloeraLlon, 1ransparency ano Shaoows.
Unit - V
CompuLer AnlmaLlons : ConvenLlona| ano compuLer asslsLeo anlmaLlon, oeslgn of anlmaLlon
sequences, lnLerpo|aLlon, slmp|e anlmaLlon effecLs, anlmaLlon |anguages ( key lrame SysLem,
arameLerlzeo sysLems), moLlon speclflcaLlons, meLhoos of conLro||lng anlmaLlon.
keferences:
1. ra[apaLl A. k, CompuLer Craphlcs, M Lo 2
2. kogers ano Aoams, MaLhemaLlca| L|emenLs of CompuLer Craphlcs, McCraw nl||
21
LIective-I (Any one of Lhe fo||owlng)
MCA 711 Aovanceo CompuLer ArchlLecLure
MCA 712 SysLem Ana|ysls & ueslgn
MCA 713 Aovanceo uaLabase ManagemenL SysLem
MCA 714 robabl|lLy ano SLochasLlc rocesses
MCA 715 Aovanceo CompuLer NeLworks
MCA 711 CCMU1Lk AkCHI1LC1UkL
Unit I: Introduction to Computer Architecture
L T P
2 0 0
Cvervlew ano hlsLory, enLlum ano power pc evo|uLlon, CompuLer sysLem componenLs, luncLlons,
lnLer connecLlon sLrucLure, 8us lnLer connecLlon, 8aslcs of Cl bus, 1he cosL facLor, erformance
meLrlcs ano eva|uaLlng compuLer oeslgns, Memory hlerarchy, Assemb|y / machlne |anguage, von
Neumann machlne cyc|e, Mlcroprogrammlng / flrmware, Memory aooresslng, C|asslfylng lnsLrucLlon seL
archlLecLures, klSC versus ClSC
Unit II: ipeIining
Cenera| consloeraLlons, Comparlson of plpe|lneo ano nonplpe|lneo compuLers, lnsLrucLlon ano
arlLhmeLlc plpe|lnes, examp|es, SLrucLura| hazaros ano oaLa oepenoencles, 8ranch oe|ay ano
mu|Llcyc|e lnsLrucLlons
Supersca|ar compuLers
Unit III: Memory System Design
Cache memory, 8aslc cache sLrucLure ano oeslgn, lu||y assoclaLlve, olrecL, ano seL assoclaLlve
mapplng
Ana|yzlng cache effecLlveness, kep|acemenL po|lcles, WrlLlng Lo a cache, Mu|Llp|e caches, upgraolng a
cache, Cache Coherence, Maln Memory, vlrLua| memory, sLrucLure, ano oeslgn, aglng, kep|acemenL
sLraLegles, Seconoary memory
Unit IV: MuItiprocessors and MuIti-Computers
SlSu, SlMu, ano MlMu archlLecLures, CenLra|lzeo ano olsLrlbuLeo shareo memory- archlLecLures,
supersca|ar archlLecLures, vLlW, mu|Ll-Lhreaoeo ano Lrace-baseo archlLecLures.
8ooks:-
2. nennessy ano aLLerson, CompuLer ArchlLecLure: A CuanLlLaLlve Approach, L|sevler
3. uezso ano Slma, Aovanceo CompuLer ArchlLecLure, earson
22
Unit I
MCA 712 SS1LM ANALSIS & DLSIGN
L T P
2 0 0
lnLrooucLlon Lo lnformaLlon SysLem ueve|opmenL: WhaL ls SysLem Ana|ysls ano ueslgn? 8uslness
SysLem concepLs, CaLegorles of lnformaLlon sysLems, SysLem oeve|opmenL SLraLegles. Managlng
Lhe app|lcaLlon oeve|opmenL porLfo|lo : now sysLem pro[ecLs have begun, Managlng pro[ecL revlew
ano se|ecLlon, re|lmlnary lnvesLlgaLlon, Se|ecLlng Lhe pro[ecL oeve|opmenL sLraLegles. SysLem
ueve|opmenL Llfe Cyc|e, WaLerfa|| Mooe| , Splra| Mooe|, leaslbl|lLy Ana|ysls, 1echnlca| leaslbl|lLy,
CosL- 8eneflL Ana|ysls, CCCCMC mooe|.
Unit II
1oo|s for oeLermlnlng sysLem requlremenL : WhaL ls requlremenLs oeLermlnaLlon? lacL
flnolng Lechnlques, 1oo|s for oocumenLlng proceoure ano oeclslon, SLrucLureo Ana|ysls oeve|opmenL
sLraLegles : SLrucLureo Ana|ysls. ueve|oplng uaLa f|ow olagrams, uaLa ulcLlonary, Lk ulagram.
rocess CrganlzaLlon & lnLeracLlons. SysLem ueslgn - rob|em arLlLlonlng, 1op-uown Ano 8oLLom- up
oeslgn , ueclslon Lree, oeclslon Lab|e ano sLrucLureo Lng|lsh, luncLlona| vs. Cb[ecL- CrlenLeo approach.
CompuLer Aloeo SysLems 1oo|s : ko|e of 1oo|s, CaLegorles of auLomaLeo 1oo|s, CASL 1oo|s, 8eneflLs of
CASL.
Unit III
1he Ana|ysls Lo oeslgn LranslLlons : Speclfylng App|lcaLlon requlremenLs, Cb[ecLlves ln oeslgnlng
lnformaLlon sysLems. WhaL feaLures musL be oeslgneo? ueslgn of compuLer ouLpuL : now Lo loenLlfy
compuLer CuLpuL neeos, now Lo presenL lnformaLlon, ueslgnlng prlnLeo ouLpuL, ueslgnlng vlsua|
concerns guloe lnpuL oeslgn, CapLurlng oaLa for lnpuL, lnpuL va|loaLlon.
Unit IV
SysLems Lnglneerlng ano Cua|lLy assurance : ueslgn ob[ecLlves, rogram sLrucLure charLs, ueslgn of
SofLware, Managlng Cua|lLy assurance, Managlng LesLlng pracLlces. Managlng sysLem
lmp|emenLaLlon: 1ralnlng, Converslon, posL lmp|emenLaLlon revlew. Managlng lnformaLlon sysLems
oeve|opmenL : LsLlmaLlon ano managemenL of oeve|opmenL Llme, LsLlmaLlon, ersonne| ano
oeve|opmenL managemenL. naroware ano SofLware se|ecLlon : naroware se|ecLlon, SofLware
Se|ecLlon.
kLILkLNCL 8CCk
1. Systems Analysis and Design, Kendall & Kendall, Pearson Education Inc.,
1. Systems Analysis and Design, Dennis, Wixom, Roth, 3rd Edition, John Wiley & Son Inc.,
L T P
2 0 0
23
MCA 713 ADVANCLD DA1A8ASL MANAGLMLN1 SS1LM
UNI1-1
ulsLrlbuLeo u8MS ConcepLs ano oeslgn: lnLrooucLlon, funcLlons ano archlLecLure of a uu8MS,
olsLrlbuLeo re|aLlona| oaLabase oeslgn, 1ransparencles ln a uu8MS, 1we|ve ru|es for a uu8MS.
Aovanceo concepLs: ulsLrlbuLeo LransacLlon managemenL, olsLrlbuLeo concurrency conLro|,
olsLrlbuLeo oeao|ock managemenL, olsLrlbuLeo oaLabase recovery, x/open olsLrlbuLeo 1ransacLlon
processlng mooe|, kep|lcaLlon servers, ulsLrlbuLeo query opLlmlzaLlon, Mobl|e oaLabases.
UNI1-2
Cb[ecL-CrlenLeo u8MS lnLrooucLlon, aovanceo oaLabase app|lcaLlons, weakness of ku8MS, sLorlng
ob[ecLs ln a re|aLlona| oaLabase, nexL-generaLlon oaLabase sysLems. ConcepLs ano oeslgn: CCu8MS
perspecLlves, perslsLence, lssues ln CCu8MS, aovanLages ano olsaovanLages of CCu8MS, Cb[ecL-
orlenLeo oaLabase oeslgn.
UNI1-3
SLanoaros ano sysLems: ob[ecL managemenL group, ob[ecL oaLabase sLanoaro CuMC 3.0 1999,
Cb[ecL sLore. Cb[ecL re|aLlona| u8MS: lnLrooucLlon, Lhlro generaLlon oaLabase manlfesLos, SCL8,
Cb[ecL orlenLeo exLenslons ln Crac|e, Comparlson of Cku8MS ano CCu8MS.
UNI1-4
Web Lechno|ogy ano u8MS, Web as a oaLabase App|lcaLlon |aLform: kequlremenLs for web-u8MS
lnLegraLlon, web-u8MS archlLecLure, aovanLages ano olsaovanLages of web-u8MS approach,
approaches Lo lnLegraLlng Lhe web ano u8MS, Crac|e lnLerneL App|lcaLlon Server (lAS).
8ooks:
1. Aoam, Nabl| k., 8hargava, 8haraL k., Aovanceo uaLabase SysLems, Sprlnger.
2. Car|o Zanlo|o, SLefano Cerl, Aovanceo uaLabase SysLems, Morgan kaufmann, 1997
24
MCA 714 kC8A8ILI1 AND S1CCHAS1IC kCCLSSLS
L T P
2 0 0
Unit-I
Introduction: robabl|lLy mooe|s, A|gebra of evenLs, probabl|lLy axloms, conolLlona| probabl|lLy,
8aye's ru|es, 8ernou||l LralLs.
Discrete kandom VariabIes: ulscreLe ranoom varlab|es, probabl|lLy mass funcLlons, olscreLe
olsLrlbuLlon funcLlons-8ernou||l, 8lnomla|, geomeLrlc, olsson, hyper geomeLrlc & unlform
olsLrlbuLlons, probabl|lLy generaLlng funcLlon.
Unit-II
Continuous kandom variabIe: LxponenLla| olsLrlbuLlon, memory |ess properLy, app|lcaLlon Lo
re|labl|lLy, hypo exponenLla|, Lr|ang, Camma, hyper exponenLla| & Norma| olsLrlbuLlons ,oroer
sLaLlsLlcs, olsLrlbuLlon of sums.
Lxpectation: LxpecLaLlon, varlance, momenLs of lmporLanL olsLrlbuLlon, LxpecLaLlon of funcLlons of
more Lhan one ranoom varlab|e, App|lcaLlon Lo Lhe compuLaLlon of M11l of serles sysLem para||e|
sysLem, sLanoby reounoancy, 1Mk & NMk sysLem.
Unit III
Stochastic process: c|asslflcaLlon of sLochasLlc process, Markov process, 8ernou||l process, olsson
process , renewa| processes.
Discrete arameter Markov Chains: CompuLaLlon of n-sLep LranslLlon probabl|lLy, sLaLe c|asslflcaLlon
& |lmlLlng olsLrlbuLlon of Llmes beLween sLaLe changes lrreouclb|e flnlLe chalns wlLh aperloolc sLaLes,
olscreLe parameLer blrLh-oeaLh processes, Ana|ysls of program execuLlon Llme, M|C|1 , Cueue,
po||ackek-khlnchln formu|a.
Unit IV
Continuous parameter Markov chains
8lrLh & oeaLh process, M|M|1 Cueue, M|M|m Cueue, cyc|lc Cueulng mooe| of a mu|Llprogrammlng
sysLem, Machlne repalrman mooe|, compuLaLlon of response Llme ln a Lermlna| orlenLeo sysLem.
Cueulng sysLem wlLh flnlLe popu|aLlons.
Networks of queues: lnLrooucLory concepL of open & c|oseo queulng neLworks.
keferences:
1. nlsashl kobayashl: Mooe|lng ano Ana|ysls-An lnLrooucLlon Lo sysLem performance Lva|uLlon
MeLhooo|ogy, Aoolson Wes|ey
2. W. le||er-An lnLrooucLlon Lo probabl|lLy Lheory & lLs app|lcaLlon (vo|1.)(!ohn Wl|ey & sons,
N?.)
3. u.N.8haL-L|emenLs of app|leo sLochasLlc processes, !ohn Wl|ey & sons, N?.
25
MCA 71S ADVANCLD CCMU1Lk NL1WCkkS
Unit I:
lnLrooucLlon: Cvervlew of compuLer neLwork, seven-|ayer archlLecLure, 1C/l sulLe of proLoco|, eLc.
Mac proLoco|s for hlgh-speeo LANS, MANs & WlkLLLSS LANs. (lor examp|e, luul, uCu8, nll, ClgablL
LLherneL, Wlre|ess LLherneL eLc.) lasL access Lechno|ogles. (lor examp|e, AuSL, Cab|e Mooem, eLc.)
Unit II:
lv6: why lv6, baslc proLoco|, exLenslon & opLlon, supporL for CoS, securlLy, eLc, nelghbor
olscovery, auLo-conflguraLlon, rouLlng. Change Lo oLher proLoco|s. App|lcaLlon programmlng
lnLerface for lv6. 6bone.
Unit III:
Mobl|lLy ln neLwork. Mobl|e. SecurlLy re|aLeo lssues.
l Mu|LlcasLlng. Mu|LlcasLlng rouLlng proLoco|s, aooress asslgnmenLs, sesslon olscovery, eLc.
1C exLenslons for hlgh-speeo neLworks, LransacLlon-orlenLeo app|lcaLlon, oLher new opLlon ln 1C.
Unit IV:
NeLwork securlLy aL varlous |ayers. Secure-n11, SSL, LS, AuLhenLlcaLlon heaoer, key olsLrlbuLlon
proLoco|s. ulglLa| slgnaLures, olglLa| cerLlflcaLes.
keferences:
1. W. k. SLevens, 1C/l l||usLraLeo, vo|ume 1: 1he proLoco|s, Aoolson Wes|ey 1994.
2. C. k. WrlghL. 1C/l l||usLraLeo, vo|ume 2: 1he lmp|emenLaLlon, Aoolson Wes|ey 1995
26
LIective-II (Any one of Lhe fo||owlng)
MCA 721 ara||e| CompuLlng
MCA 722 ulglLa| lmage rocesslng
MCA 723 lnformaLlon SecurlLy
MCA 724 ArLlflcla| lnLe||lgence
MCA 725 Mu|Llmeola SysLems
UNI1-I
MCA 721 AkALLLL CCMU1ING
L T P
2 0 0
lnLrooucLlon: WhaL ls para||e| ano olsLrlbuLeo compuLlng, Scope of para||e| ano olsLrlbuLeo
compuLlng, Scope of para||e| compuLlng. ara||e| rogrammlng |aLforms: lmp|lclL para||e|lsm,
ulchoLomy of para||e| compuLlng p|aLforms, hyslca| organlzaLlon for para||e| p|aLforms,
communlcaLlon cosL ln para||e| machlnes, rouLlng mechanlsm for lnLerconnecLlon neLworks.
UNI1-II
8aslc CommunlcaLlon CperaLlon: Cne-Lo-a|| broaocasL, A||-Lo-a|| broaocasL, keoucLlon ano preflx
sums, Cne-Lo-a|| persona|lzeo communlcaLlon, A||-Lo-a|| persona|lzeo communlcaLlon,
UNI1-III
erformance ano Sca|abl|lLy of ara||e| SysLems: erformance maLrlces for ara||e| sysLems? kun
Llme, Speeo up, Lfflclency ano CosL, 1he effecL of granu|arlLy on performance
SorLlng: SorLlng neLworks, 8ubb|e sorL ano lLs varlanLs, Culck sorL ano oLher sorLlng a|gorlLhms
UNI1-IV
uynamlc rogrammlng: Cvervlew of oynamlc programmlng, Serla| monaolc u lormu|aLlons: 1he
shorLesL paLh rob|em, Lhe 0/1 knapsack rob|em, Serla| o|yaolc u lormu|aLlon : a|| palr shorLesL
paLhs a|gorlLhms.
keferences:
1. vlpln kumar, AnanLh Crama, Anshu| CupLa ano Ceorge karypls, lnLrooucLlon Lo ara||e|
CompuLlng, 1he 8en[amln/Cummlng ub|lshlng Company, lnc., MasschachuseLLs
2. Ceorge Cou|ourls, !ean uo||lmore ano 1lm klnoberg, ulsLrlbuLeo SysLems ConcepLs ano
ueslgn, Aoolson-Wes|ey, MasschachuseLLs
3. S C Ak|, 1he ueclslon ano ana|ysls of para||e| a|gorlLhms, n Lng|ewooo C|lffs, New !ersey.
4. 1 C Lewls ano n L| ?kewlnl, lnLrooucLlon Lo ara||e| CompuLlng, renLlce-na||, Lng|ewooo
C|lffs, New !ersey.
27
MCA 722 DIGI1AL IMAGL kCCLSSING
L T P
2 0 0
UNI1-I Introduction and IundamentaIs
MoLlvaLlon ano erspecLlve, App|lcaLlons, ComponenLs of lmage rocesslng SysLem, L|emenL of
vlsua| ercepLlon, A Slmp|e lmage Mooe|, Samp|lng ano CuanLlzaLlon.
Image Lnhancement in SpatiaI Domain: lnLrooucLlon, 8aslc Cray Leve| luncLlons - lecewlse-
Llnear 1ransformaLlon luncLlons: ConLrasL SLreLchlng, nlsLogram SpeclflcaLlon, nlsLogram
Lqua|lzaLlon, Loca| LnhancemenL, LnhancemenL uslng ArlLhmeLlc/Loglc CperaLlons, lmage
SubLracLlon, lmage Averaglng, 8aslcs of SpaLla| ll|Lerlng, SmooLhlng - Mean fl|Ler, Croereo SLaLlsLlc
ll|Ler, Sharpenlng - 1he Lap|aclan.
UNI1-II
Image Lnhancement in Irequency Domain: lourler 1ransform ano Lhe lrequency uomaln, 8asls of
ll|Lerlng ln lrequency uomaln, ll|Lers - Low-pass, nlgh-pass, Corresponoence 8eLween ll|Lerlng ln
SpaLla| ano lrequency uomaln, SmooLhlng lrequency uomaln ll|Lers - Causslan Lowpass ll|Lers,
Sharpenlng lrequency uomaln ll|Lers - Causslan nlghpass ll|Lers, nomomorphlc ll|Lerlng.
Image kestoration: A Mooe| of kesLoraLlon rocess, Nolse Mooe|s, kesLoraLlon ln Lhe presence of
Nolse on|y-SpaLla| ll|Lerlng - Mean ll|Lers: ArlLhmeLlc Mean fl|Ler, CeomeLrlc Mean ll|Ler, Croer
SLaLlsLlc ll|Lers - Meolan ll|Ler, Max ano Mln fl|Lers, erloolc Nolse keoucLlon by lrequency uomaln
ll|Lerlng - 8anopass ll|Lers, Mlnlmum Mean-square Lrror kesLoraLlon.
UNI1-III
CoIor Image rocessing: Co|or lunoamenLa|s, Co|or Mooe|s, ConverLlng Co|ors Lo olfferenL mooe|s,
Co|or 1ransformaLlon, SmooLhlng ano Sharpenlng, Co|or SegmenLaLlon.
MorphoIogicaI Image rocessing: lnLrooucLlon, Loglc CperaLlons lnvo|vlng 8lnary lmages, ul|aLlon
ano Lroslon, Cpenlng ano C|oslng, Morpho|oglca| A|gorlLhms - 8ounoary LxLracLlon, keglon ll||lng,
LxLracLlon of ConnecLeo ComponenLs, Convex nu||, 1hlnnlng, 1hlckenlng
UNI1-IV
kegistration: lnLrooucLlon, CeomeLrlc 1ransformaLlon - |ane Lo |ane LransformaLlon, Mapplng,
SLereo lmaglng - A|gorlLhms Lo LsLab|lsh Corresponoence, A|gorlLhms Lo kecover uepLh.
Segmentation:lnLrooucLlon, keglon LxLracLlon, lxe|-8aseo Approach, Mu|Ll-|eve| 1hresho|olng,
Loca| 1hresho|olng, keglon-baseo Approach, Loge ano Llne ueLecLlon: Loge ueLecLlon, Loge
CperaLors, aLLern llLLlng Approach, Loge Llnklng ano Loge lo||owlng, Loge L|emenLs LxLracLlon by
1hresho|olng, Loge ueLecLor erformance, Llne ueLecLlon, Corner ueLecLlon.
8ooks:
1. ulglLa| lmage rocesslng ano CompuLer vlslon, k.!. Scha|koff. ub|lsheo by: !ohn Wl|ey ano Sons,
N?.
2. lunoamenLa|s of ulglLa| lmage rocesslng, A.k. !aln. ub|lsheo by renLlce na||, upper Saoo|e
klver, N!.
28
MCA 723 INICkMA1ICN SLCUkI1
L T P
2 0 0
UNI1-I
nlsLory of lnformaLlon SysLems ano lLs lmporLance, baslcs, Changlng NaLure of lnformaLlon
SysLems, Neeo of ulsLrlbuLeo lnformaLlon SysLems, ko|e of lnLerneL ano Web Servlces,
lnformaLlon SysLem 1hreaLs ano aLLacks, C|asslflcaLlon of 1hreaLs ano Assesslng uamages,
SecurlLy ln Mobl|e ano Wlre|ess CompuLlng- SecurlLy Cha||enges ln Mobl|e uevlces,
auLhenLlcaLlon Servlce SecurlLy, SecurlLy lmp|lcaLlon for organlzaLlons, LapLops SecurlLy
8aslc rlnclp|es of lnformaLlon SecurlLy, ConfloenLla|lLy, lnLegrlLy Aval|abl|lLy ano oLher Lerms ln
lnformaLlon SecurlLy, lnformaLlon C|asslflcaLlon ano Lhelr ko|es.
UNI1-II
SecurlLy 1hreaLs Lo L Commerce, vlrLua| CrganlzaLlon, 8uslness 1ransacLlons on Web, L
Covernance ano Lul, ConcepLs ln L|ecLronlcs paymenL sysLems, L Cash, CreolL/ueblL Caros.
hyslca| SecurlLy- Neeos, ulsasLer ano ConLro|s, 8aslc 1eneLs of hyslca| SecurlLy ano hyslca|
LnLry ConLro|s,
Access ConLro|- 8lomeLrlcs, lacLors ln 8lomeLrlcs SysLems, 8eneflLs, CrlLerla for se|ecLlon of
blomeLrlcs, ueslgn lssues ln 8lomeLrlc SysLems, lnLeroperabl|lLy lssues, Lconomlc ano Socla|
AspecLs, Lega| Cha||enges
UNI1-III
Mooe| of CrypLographlc SysLems, lssues ln uocumenLs SecurlLy, SysLem of keys, ub|lc key
CrypLography, ulglLa| SlgnaLure, kequlremenL of ulglLa| SlgnaLure SysLem, llnger rlnLs,
llrewa||s, ueslgn ano lmp|emenLaLlon lssues, o|lcles
NeLwork SecurlLy- 8aslc ConcepLs, ulmenslons, erlmeLer for NeLwork roLecLlon, NeLwork
ALLacks, Neeo of lnLruslon MonlLorlng ano ueLecLlon, lnLruslon ueLecLlon
vlrLua| rlvaLe NeLworks- Neeo, use of 1unne|lng wlLh vN, AuLhenLlcaLlon Mechanlsms,
1ypes of vNs ano Lhelr usage, SecurlLy Concerns ln vN
UNI1-IV
SecurlLy meLrlcs- C|asslflcaLlon ano Lhelr beneflLs, lnformaLlon SecurlLy & Law, lk, aLenL Law,
CopyrlghL Law, Lega| lssues ln uaLa mlnlng, SecurlLy, 8ul|olng SecurlLy lnLo SofLware Llfe Cyc|e LLhlcs-
LLhlca| lssues, lssues ln uaLa ano SofLware rlvacy, Cyber Crlme 1ypes & overvlew of Cyber Crlmes
keferences :
Schou, Shoemaker, lnformaLlon Assurance for Lhe LnLerprlse, 1aLa McCraw nl||
lurne||, CompuLer lnsecurlLy, Sprlnger
29
MCA 724 Ak1IIICIAL IN1LLLIGLNCL
L T P
2 0 0
UNI1 -I
Introduction
lnLrooucLlon Lo ArLlflcla| lnLe||lgence, Slmu|aLlon of sophlsLlcaLeo & lnLe||lgenL 8ehavlor ln olfferenL
area prob|em 3Clvlng ln games, naLura| |anguage, auLomaLeo reasonlng, vlsua| percepLlon, heurlsLlc
a|gorlLhm versus so|uLlon guaranLeeo a|gorlLhms.
UNI1 - II
unoersLanolng NaLura| Languages. arslng Lechnlques, ConLexL free ano LransformaLlona| grammars,
LranslLlon neLs, augmenLeo LranslLlon neLs, ll||more's grammars, Shanks ConcepLua| uepenoency,
grammar free ana|yzers, senLence generaLlon, ano Lrans|aLlon.
UNI1 III
knowIedge kepresentation
llrsL oroer preolcaLe ca|cu|us, norn C|auses, lnLrooucLlon Lo kCLCC, SemanLlc NeLs, arLlLloneo
NeLs, Mlnskey frames, Case Crammar 1heory, rooucLlon ku|es know|eoge 8ase, Lhe lnLerface
SysLem, lorwaro & 8ackwaro ueoucLlon.
UNI1 - IV
Lxpert System
LxlsLlng SysLems (uLNukAL, M?ClN), lnference Lnglne, oomaln exp|oraLlon MeLa know|eoge,
LxperLlse 1ransfer, Se|f Lxp|alnlng SysLem.
UNI1 - V
attern kecognition
lnLrooucLlon Lo aLLern kecognlLlon, SLrucLureo uescrlpLlon, Symbo|lc uescrlpLlon, Machlne
percepLlon, Llne llnolng, lnLercepLlon SemanLlc & Mooe|, Cb[ecL loenLlflcaLlon, Speech kecognlLlon.
rogrammlng Language, lnLrooucLlon Lo programmlng Language, LlS, kCLCC.
keferences:
1. WlnsLon, LlS, Aoolslon Wes|ey.
2. Marce||ous, LxperL Sys Lem rogrammlng, nl.
3. L|amle, ArLlflcla| lnLe||lgence, Acaoemlc ress.
30
MCA 72S MUL1IMLDIA SS1LMS
L T P
2 0 0
Unit-I: Introduction
lnLrooucLlon Lo Mu|Llmeola, Mu|Llmeola lnformaLlon, Mu|Llmeola Cb[ecLs, Mu|Llmeola ln buslness
ano work. Convergence of CompuLer, CommunlcaLlon ano LnLerLalnmenL prooucLs
Stages of MuItimedia ro|ects: Mu|Llmeola haroware, Memory & sLorage oevlces, CommunlcaLlon
oevlces, Mu|Llmeola sofLware's, presenLaLlon Loo|s, Loo|s for ob[ecL generaLlons, vloeo, souno, lmage
capLurlng, auLhorlng Loo|s, caro ano page baseo auLhorlng Loo|s.
Unit-II: MuItimedia 8uiIding 8Iocks
1exL, Souno Mlul, ulglLa| Auolo, auolo fl|e formaLs, Mlul unoer wlnoows envlronmenL Auolo & vloeo
CapLure.
Unit-III: Speech Compression & Synthesis
ulglLa| Auolo concepLs, Samp|lng varlab|es, Loss |ess compresslon of souno, |oss compresslon,
sl|ence compresslon & Speech SynLhesls.
Unit-IV: Images
Mu|Llp|e monlLors, blLmaps, vecLor orawlng, |ossy graphlc compresslon, lmage fl|e formaLlc
anlmaLlons lmages sLanoaros, !LC Compresslon, Zlg Zag Coolng, Mu|Llmeola uaLabase.ConLenL
baseo reLrleva| for LexL ano lmages,vloeo:vloeo represenLaLlon, Co|ors, vloeo Compresslon, MLC
sLanoaros, MnLC SLanoaro vloeo SLreamlng on neL, vloeo Conferenclng, Mu|Llmeola 8roaocasL
Servlces, lnoexlng ano reLrleva| of vloeo uaLabase, recenL oeve|opmenL ln Mu|Llmeola.
8ooks:
1. 8uforo Mu|Llmeola SysLems Aoolson Wes|ey.
2. Agrawa| & 1lwarl Mu|Llmeola SysLems Lxce|.
3. Mark Ne|son uaLa Compresslon 8ook 88.
4. S|elnrelLz Mu|Llmeola SysLem Aoolson Wes|ey.
31
MCA-411 CCMU1Lk GkAHICS & ANIMA1ICN LA8 L T P
0 0 2
1. lmp|emenLaLlon of |lne generaLlon uslng s|ope's meLhoo, uuA ano 8resenham's a|gorlLhms.
2. lmp|emenLaLlon of clrc|e generaLlon uslng Mlo-polnL meLhoo ano 8resenham's a|gorlLhm.
3. lmp|emenLaLlon of e||lpse generaLlon uslng Mlo-polnL meLhoo.
4. lmp|emenLaLlon of po|ygon fl||lng uslng l|ooo-fl||, 8ounoary-fl|| ano Scan-|lne a|gorlLhms.
5. lmp|emenLaLlon of 2u LransformaLlon: 1rans|aLlon, Sca|lng, koLaLlon, Mlrror kef|ecLlon ano
Shearlng (wrlLe a menu orlven program).
6. lmp|emenLaLlon of Llne C|lpplng uslng Cohen-SuLher|ano a|gorlLhm ano 8lsecLlon MeLhoo.
7. lmp|emenLaLlon of o|ygon C|lpplng uslng SuLher|ano-noogman a|gorlLhm.
8. lmp|emenLaLlon of 3u geomeLrlc LransformaLlons: 1rans|aLlon, Sca|lno ano roLaLlon.
9. lmp|emenLaLlon of Curve generaLlon uslng lnLerpo|aLlon meLhoos.
10. lmp|emenLaLlon of Curve generaLlon uslng 8-sp|lne ano 8ezler curves.
11. lmp|emenLaLlon of any one of 8ack face remova| a|gorlLhms such as uepLh-8uffer a|gorlLhm,
alnLer's a|gorlLhm, Warnock's a|gorlLhm, Scan-|lne a|gorlLhm)
MCA-412 MICkCkCCLSSCk LA8
SLuoy of 8085 or 8086/8088 klL.
Assemb|y Language rograms for 8088 klL
(l) aooress ano oaLa Lransfer.
(ll) aoolLlon, subLracLlon.
(lll) b|ock Lransfer.
(lv) flno greaLesL numbers.
(v) flno r's ano (r-1)'s comp|emenLs of slgneo ano unslgneo number
Assemb|y Language rograms for 8086/8088
(l) Mu|Llp|lcaLlon of Lwo oeclma|/blnary/hexaoeclma|/ocLa| numbers.
(ll) ulvlslon of Lwo oeclma|/blnary/hexaoeclma|/ocLa| numbers.
(lll) Converslon of |ower case Lo upper case characLer.
1esL Lhe performance of 8ooLh's A|gorlLhm for
(l) Slgneo numbers.
(ll) unslgneo numbers.
L T P
0 0 2
32
MCA-413 SCI1WAkL LNGINLLkING LA8
L T P
0 0 2
1opics to be covered:
1. rob|em Ana|ysls ano ro[ecL |annlng 1horough sLuoy of Lhe prob|em- loenLlfy pro[ecL
scope, lnfrasLrucLure.
2. SofLware kequlremenL Ana|ysls- uescrlbe Lhe lnolvloua| hases/moou|es of Lhe pro[ecL
oe|lverab|es.
3. uaLa Mooe|lng use work prooucLs - oaLa olcLlonary, use case olagrams ano acLlvlLy
olagrams,
bul|o ano LesL |ass olagrams, sequence olagrams ano aoo lnLerface Lo c|ass olagrams.
4. SofLware ueve|opmenLs ano uebugglng.
5. SofLware 1esLlng - repare LesL p|an, perform va|loaLlon LesLlng coverage ana|ysls,
memory
|eaks, oeve|op LesL case hlerarchy, SlLe check ano slLe monlLor.
6. uescrlbe: ke|evance of CASL Loo|s, hlgh - eno ano |ow - eno CASL Loo|s, auLomaLeo
supporL for oaLa olcLlonarles, ulu, Lk olagrams.
LlsL of LxperlmenLs :
1. Course keglsLraLlon SysLem
2. Cn|lne LlckeL reservaLlon sysLem
3. SLuoenLs marks ana|yzlng sysLem
4. |aLform asslgnmenL sysLem for Lhe Lralns ln a ral|way sLaLlon
5. ayro|| SysLem
6. noLe| managemenL sysLem
Ck
33
MCA- 415 .Net Lab: L T P
0 0 2
a.WAP to implement SET, Get Properties?
b. WAP to implement String Using array`s?
c. WAP to print the ARMSTRONG Number?
d. Create a console application to calculate area oI circle. Accept radius Irom user Calculate circle area and print it
Create a console application to build simple calculator Calculator will have Iollowing Iunctions Accept 2
numbers PerIorm Add/Sub/Div/Mult Print Result.
e. WAP to Use a Exception (PredeIined and User deIined).
I. WAP to implement the concept oI Abstract and Sealed Classes.
g. WAP to implement ADO.Net Database connectivity.
h. WAP to implement the concept oI Data Streams.
i. WAP to implement the Events and Delegates.
j. Design the WEB base Database connectivity Form by using ASP.NET.
k. WAP to implement Indexers.
34
YEAR - III, SEMESTER - V
CUURSES UF STUDY
S.
NU.
SUBJECT
CUDE
SUBJECT
CUNTAC
T HRS.
CREDIT
1 MCA-501 AdvancedSoftwareEngineering 3-1-0 4
2 MCA-502 WebTechnologies 2-0-0 2
3 MCA503 BusinessCommunication 2-0-0 2
4 Electtve-III
*MCA-731/ 732/ 733/ 734/ 735
3-1-0
4
5 Electtve-IV
*MCA-741/ 742/ 743/ 743/ 745
3-1-0
4
6 Electtve-V
*MCA-751/ 752/ 753/ 754/ 755
3-1-0
4
PRACTICALS
7 MCA-511
AdvancedSoftwareEngineering/ UML
Lab
0-0-2 2
8 MCA-512 WebTechnologies Lab 0-0-2 2
9 MCA-513 BusinessCommunicationLab 0-0-2 2
10 MCA-515 General Proficiency 0-0-4 4
Total 30
MCA733AdvancedOperatingSystems
MCA734Soft Computing
MCA735Mobile&AdhocComputing
MCA741EmbeddedSystems
MCA742PatternRecognition
MCA743CryptographyandNetworkSecurity
MCA744Natural languageProcessing
MCA745MultimediaCommunication
MCA751Real TimeSystems
MCA752OperationResearch
MCA753Modeling&Simulation
MCA754BioInformatics
MCA755Client Server Computing
34
SCHEME OF EXAMINATION
S.
Nu.
CUURSE
CUDE
SUBJECT
PERIUDS
EVALUATIUN SCHEME
SESSIUNAL
EXAM ESE
Sub|ect
Tutal
L T P CT TA Tutal
1 MCA-501
AdvancedSoftware
Engineering
3 1 0 30 20 50 100 150
2 MCA-502 WebTechnologies 2 0 0 15 10 25 50 75
3 MCA503 BusinessCommunication 2 0 0 15 10 25 50 75
4 Electtve-III
*MCA-731/ 732/ 733/ 734/ 735
3 1 0 30 20 50 100 150
5 Electtve-IV
*MCA-741/ 742/ 743/ 743/ 745
3 1 0 30 20 50 100 150
6 Electtve-V
*MCA-751/ 752/ 753/ 754/ 755
3 1 0 30 20 50 100 150
Tutal {Theury] 75
PARCTICALS
7 MCA-511
AdvancedSoftware
EngineeringLab
0 0 2 25 25 25 50
8 MCA-512 WebTechnologiesLab 0 0 2 25 25 25 50
9 MCA-513
BusinessCommunication
Lab
0 0 2 25 25 25 50
10 MCA-514 General Proficiency 0 0 4 50 50 50 100
Tutal {Practtcal] 25
Tutal {Theury + Practtcal] 1 4 1 1
Note: Durationof ESEshall be3(Three) hours.
35
YEAR -III, SEMESTER - VI
CUURSES UF STUDY
S.N
U.
SUBJECT
CUDE
SUBJECT
CUNTACT
HRS.
CREDIT
MCA601 Industrial Project workfor 16weeks* 30 30
S.
Nu.
CUURSE
CUDE SUBJECT
PERIUDS
EVALUATIONSCHEME
SESSIUNAL
EXAM ESE
Sub|ect
Tutal
L T P CT TA Tutal
1 MCA-671 Industrial Project 0 0 0 - 500 500 500 1000
Tutal 5
Note: Durationof ESEshall be3(Three) Hours
YEAR III, SEMESTER -V
36
MCA-51 ADVANCED SUFTWARE ENCINEERINC
L T P
3 1 0
UNIT I
UnifiedModelingLanguage, Basicstructures andmodelingclasses, common modelingtechniques, relationships,
commonmechanism, class diagrams
UNIT II
Advanced structured modeling, advanced classes and relationships, interfaces, types and roles, instances and
object diagram. Basicideaof behavioral modeling.
UNIT III
Object- oriented concepts and principles. Identifyingthe elements of an object model. Object oriented projects
metricsandestimation.
Designfor object orientedsystems. Thesystemdesignprocess.
Object oriented testing testing OOA and OOD models. The object oriented testing strategies. Inter class
testing.
UNIT IV
Technical metrics for O-O systems. Class oriented metrics and metrics for O-O projects. Advanced topics in
software engineering. Component based software engineering and development. Classifying and retrieving
components.
37
MCA-52 WEB TECHNULUCIES
L T P
2 0 0
UNIT I: Intruducttun and Web Develupment Strategtes
History of Web, Protocols governing Web, Creating Websites for individual and Corporate World, Cyber Laws,
Web Applications, Writing Web Projects, Identification of Objects, Target Users, Web Team, Planning and
Process Development.
UNIT II: HTML, XML and Scrtpttng
List, Tables, Images, Forms, Frames, CSS Document type definition, XML schemes, Object Models, Presenting
XML, Using XML Processors: DOM and SAX, Introduction to Java Script, Object in Java Script, Dynamic HTML
withJavaScript.
UNIT III: Java Beans and Web Servers
Introduction to Java Beans, Advantage, Properties, BDK, Introduction to EJB, Java Beans API Introduction to
Servelets, Lifecycle, JSDK, Servlet API, Servlet Packages: HTTP package, Working with Http request and
response, SecurityIssues.
UNIT IV: JSP
Introduction to JSP, JSP processing, JSP Application Design, Tomcat Server, Implicit JSP objects, Conditional
Processing, Declaring variables and methods, Error Handling and Debugging, Sharing data between JSP pages-
SharingSession andApplication Data.
UNIT V: Database Cunnecttvtty
Database Programming using JDBC, Studying Javax.sql.*package, accessing a database from a JSP page,
Application-specificDatabaseAction, DevelopingJavaBeans in aJSPpage, introductiontoStruts framework.
Buuks:
1. Burdman, Collaborative WebDevelopmentAddisonWesley.
2. Chris Bates, WebProgramingBuildingInternet Applications, 2nd Edition, WILEY, Dreamtech
38
MCA-53 BUSINESS CUMMUNICATIUN
Untt -I The Elements uf Bustness Cummuntcattun
L T P
2 0 0
1.1 patterns of communicationin thebusiness world: upward, downward, horizontal, grapevineetc
1.2 internal andexternal channels of communication; formal andinformal channels
1.3 cross-cultural communications
1.4 avoidinggender, racial andother formsof bias in communication
1.5 commonformsof oral andwrittencommunication in thebusiness world: Oral presentations, interviews
andgroupdiscussions Memos, reports, summariesandabstracts, e-mails
Untt-II Readtng and wrtttng
2.1 theimportanceof developingreadingskills
2.2 thesub-skills of reading:
a. understandingthemain ideaandsupportingdetails
b. readingbetweenthelines : inferential reading
c. understandingthewriters point of view
d. makingpredictions
e. guessingthemeanings of unfamiliar words
Untt-III - Nutes-maktng
3.1 theimportanceof writingskills
3.2 thedifferences betweenspeechandwriting
3.3 the qualities of effective writing: coherence, cohesion, logical structuringand organization, clarityof
language, stylisticvariationetc.
3.3 thewritingprocess : pre-writing, drafting, re-writing
Untt -IV Persunaltty develupment and suft sktlls
4.1 personalitytheories: Carl Rogers, Maslow, Eysenck, Murray
4.2 emotional Intelligence
4.3 skimmingandscanning
Untt-V
5.1 lateral thinking: Edward DeBono
5.2 soft skills: becomingagoodleader andteam-player
5.3 inter-relatingsoft skills andcommunication skills
Buuks recummended
1. Business Communication TodaybyBoveeet al ( Pearson)
2. Business Communication byMeenakshi RamanandPrakashSingh(Oxford)
3. Personality: Classic Theories and Modern Research by H.S.Friedman and M.W.Schustack (Pearson
Education)
4. PersonalityTheories byBarbaraEngler (Houghton Mifflin Company)
5. CrashCoursein Personal Development byBrianClegg( KoganPage)
6. Activities for DevelopingEmotional IntelligencebyAdeleB.Lynn (HRDPress)
7. Lateral ThinkingbyEdwardDeBono (Penguin)
39
MCA 731 AdvancedComputer Architecture
MCA733 AdvancedOperatingSystems
MCA 734 Soft Computing
MCA 735 Mobile&Adhoc Computing
Unit - I: Introduction and ipeIining
L T P
3 1 0
ara||e| CompuLlng, ara||e| CompuLer Mooe|, rogram ano NeLwork roperLles, ara||e| ArchlLecLura|
C|asslflcaLlon Schemes, l|ynn's & leng's C|asslflcaLlon, erformance MeLrlcs ano Measures, Speeoup
erformance Laws: Mu|Llprocessor SysLem ano lnLerconnecLlon NeLworks, lLLL CSlx 1hreaos: CreaLlng
ano LxlLlng 1hreaos, Slmu|Laneous LxecuLlon of 1hreaos, 1hreao SynchronlzaLlon uslng Semaphore ano
MuLex, Cance|lng Lhe 1hreaos.
8aslc ano lnLermeolaLe ConcepLs, lnsLrucLlon SeL rlnclp|e, lL: 8aslcs, Lxp|olLlng lL, LlmlLs on lL, Llnear
ano Non|lnear lpe|lne rocessors, Super Sca|ar ano Super lpe|lne ueslgn,
Unit - II: Memory Hierarchy, 1hread and rocess LeveI araIIeI Architecture
Memory nlerarchy ueslgn: Aovanceo CpLlmlzaLlon of Cache erformance, Memory 1echno|ogy ano
CpLlmlzaLlon, Cache Coherence ano SynchronlzaLlon Mechanlsms.
lnLrooucLlon Lo MlMu ArchlLecLure, Mu|LlLhreaoeo ArchlLecLures, ulsLrlbuLeo Memory MlMu
ArchlLecLures, Shareo Memory MlMu ArchlLecLure, C|usLerlng, lnsLrucLlon Leve| uaLa ara||e| ArchlLecLure,
SlMu ArchlLecLure, llne Cralneo ano Coarse Cralneo SlMu ArchlLecLure, AssoclaLlve ano Neura|
ArchlLecLure, uaLa ara||e| lpe|lneo ano SysLo|lc ArchlLecLures, vecLor ArchlLecLures.
Unit - III: araIIeI AIgorithms
kAM A|gorlLhms: ara||e| keoucLlon, reflx Sums, reoroer 1ree 1raversa|, Merglng Lwo SorLeo |lsLs, MaLrlx
Mu|Llp|lcaLlon: kow Co|umn CrlenLeo A|gorlLhms, 8|ock CrlenLeo A|gorlLhms, ara||e| Culck sorL, nyper
CulcksorL, So|vlng Llnear SysLems: Causslan L|lmlnaLlon, !acobl A|gorlLhm, ara||e| A|gorlLhm ueslgn
SLraLegles.
Unit -IV: DeveIoping araIIeI Computing AppIications
CpenM lmp|emenLaLlon ln 'C': LxecuLlon Mooe|, Memory Mooe|, ulrecLlves: ConolLlona| Compl|aLlon,
lnLerna| ConLro| varlab|es, ara||e| ConsLrucL, Work Sharlng ConsLrucLs, Comblneo ara||e| Work-Sharlng
ConsLrucLs, MasLer ano SynchronlzaLlon ConsLrucLs,
8ooks:-
1. kal nwang, Aovance CompuLer ArchlLecLure, 1Mn
2. MaLLhew, 8eglnnlng Llnux rogrammlng, Su/WkCx
3. nennessy ano aLLerson, CompuLer ArchlLecLure: A CuanLlLaLlve Approach, L|sevler
MCA 732 DATA WAREHUUSE & DATA MININC
L T P
3 1 0
Untt - I
Dss-Uses, definition, Operational Database. Introduction to DATA Warehousing. Data-Mart, Concept of Data-
Warehousing, Multi Dimensional Database Structures. Client/ Server Computing Model & Data Warehousing.
Parallel Processors &Cluster Systems. Distributed DBMS implementations.
Untt - II
40
DATA Warehousing. Data Warehousing Components. Building a Data Warehouse. Warehouse Database.
Mapping the Data Warehouse to a Multiprocessor Architecture. DBMS Schemas for Decision Support. Data
Extraction, Cleanup&Transformation Tools. Metadata.
Untt - III
Business Analysis. Reporting & Query Tools & Applications. On line Analytical Processing(OLAP). Patterns &
Models. Statistics. Artificial Intelligence.
Untt - IV
Knowledge Discovery, Data Mining. Introduction to Data-Mining. Techniques of Data-Mining. Decision Trees.
Neural Networks. Nearest Neighbor & Clustering. Genetic Algorithms. Rule Introduction. Selecting & Using the
Right Technique.
Untt - V
Multimedia Data-Mining, Multimedia-Databases, Mining Multimedia Data, Data-Mining and the World Wide
Web, Web Data-Mining, Mining and Meta-Data. Data Visualization & Overall Perspective. Data Visualization.
Applicationsof Data-Mining.
References:
1. Margaret H. Dunham, Data-Mining. Introductory&AdvancedTopics, PearsonEducation
2. Pieter Adriaans, Dolf Zantinge, Data-Mining, Pearson Education
L T P
3 1 0
41
UNIT-I
MCA 733 ADVANCED UPERATINC SYSTEMS
Architectures oI Distributed Systems - System Architecture types - issues in distributed operating systems -
communication networks communication primitives. Theoretical Foundations - inherent limitations oI a distributed
system lamp ports logical clocks vector clocks casual ordering oI messages global state cuts oI a distributed
computation termination detection. Distributed Mutual Exclusion introduction the classiIication oI mutual
exclusion and associated algorithms a comparative perIormance analysis.
UNIT-II
Distributed Deadlock Detection -Introduction - deadlock handling strategies in distributed systems issues in
deadlock detection and resolution control organizations Ior distributed deadlock detection centralized and
distributed deadlock detection algorithms hierarchical deadlock detection algorithms. Agreement protocols
introduction-the system model, a classiIication oI agreement problems, solutions to the Byzantine agreement problem,
applications oI agreement algorithms. Distributed resource management: introduction-architecture mechanism Ior
building distributed Iile systems design issues log structured Iile systems.
UNIT-III
Distributed shared memory-Architecture algorithms Ior implementing DSM memory coherence and protocols
design issues. Distributed Scheduling introduction issues in load distributing components oI a load distributing
algorithm stability load distributing algorithm perIormance comparison selecting a suitable load sharing
algorithm requirements Ior load distributing -task migration and associated issues. Failure Recovery and Fault
tolerance: introduction basic concepts classiIication oI Iailures backward and Iorward error recovery, backward
error recovery- recovery in concurrent systems consistent set oI check points synchronous and asynchronous check
pointing and recovery check pointing Ior distributed database systems- recovery in replicated distributed databases.
UNIT-IV
Protection and security -preliminaries, the access matrix model and its implementations.-saIety in matrix model-
advanced models oI protection. Data security cryptography: Model oI cryptography, conventional cryptography-
modern cryptography, private key cryptography, data encryption standard- public key cryptography multiple
encryption authentication in distributed systems.
UNIT-V
Multiprocessor operating systems - basic multiprocessor system architectures inter connection networks Ior
multiprocessor systems caching hypercube architecture. Multiprocessor Operating System - structures oI
multiprocessor operating system, operating system design issues- threads- process synchronization and scheduling
.Database Operating systems :Introduction- requirements oI a database operating system Concurrency control :
theoretical aspects introduction, database systems a concurrency control model oI database systems- the problem oI
concurrency control serializability theory- distributed database systems, concurrency control algorithms
introduction, basic synchronization primitives, lock based algorithms-timestamp based algorithms, optimistic
algorithms concurrency control algorithms, data replication.
REFERENCES
1. Andrew S.Tanenbaum, "Modern operating system", PHI, 2003
2. Pradeep K.Sinha, "Distributed operating system-Concepts and design", PHI, 2003.
3. Andrew S.Tanenbaum, "Distributed operating system", Pearson education, 2003
42
MCA 734 SUFT CUMPUTINC
L T P
3 1 0
Untt -I
Introduction to soft computing. Applications of Artificial Neural Networks, fuzzy logic, genetic algorithms and
other soft-computingtechniques. Their strengths andweaknesses. Synergyof soft computingtechniques.
Artificial neural networks: over viewof history, Mathematical Models of Neurons, ANNarchitecture.
Untt-II
Introduction to artificial neural network; Neural Networks: Learning rules, Learning Paradigms-Supervised,
Unsupervised and reinforcement Learning, ANN training Algorithms-perceptions, Training rules, Delta, Back
Propagation Algorithm, Multilayer Perceptron Model, Competitive learning networks, Kohonen self organizing
networks, Hebbianlearning; HopfieldNetworks,
Untt-III
Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets, Membership
Function, Fuzzyrulegeneration.
Operations on Fuzzy Sets: Compliment, Intersections, Unions, Combinations of Operations, Aggregation
Operations.
Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals &Numbers, Latticeof
FuzzyNumbers, FuzzyEquations.
Untt - IV
Genetic algorithms(Gas),Evolution strategies(Ess),Evolutionary programming(EP), Genetic Programming(GP),
Selecting, crossover, mutation, schema analysis, analysis of selection algorithms; convergence; Markov & other
stochasticmodels.
Untt - V
Other Soft computingapproaches Simulated Annealing, TabuSearch, Ant colonybasedoptimisation, etc.
Reference:
1. Introduction to the Theory of Neural Computation, Hertz J. Krogh, R.G. Palmer, Addison- Wesley,
California, 1991.
2. Neural Networks-AComprehensive Foundations, Prentice-Hall International, NewJersey, 1999.
3. Neural Networks: Algorithms, Applications andProgrammingTechniques, FreemanJ.A. &D.M. Skapura,
AddisonWesley, Reading, Mass, (1992).
43
MCA 735 MUBILE & ADHUC CUMPUTINC L T P
3 1 0
UNIT-I
Issues in Mobile Computing, Wireless Telephony, Digital Cellular Standards, GSM: air-interface, channel
structure, location management: HLR-VLR, hierarchical, handoffs, channel allocation in cellular systems, CDMA,
GPRS.
Untt II
Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth, Wireless multiple access
protocols, TCP over wireless, Wireless applications, data broadcasting, Mobile IP, WAP: Architecture, protocol
stack, applicationenvironment, applications.
Untt III
Data management issues, data replication for mobile computers, adaptive clustering for mobile wireless
networks, Filesystem, Disconnectedoperations.
Untt IV
Mobile Agents computing, security and fault tolerance, transaction processing in mobile computing
environment.
Untt V
What is Ad-hoc Network? , Problems with Message Routing in Wireless Ad-hoc Mobile Networks,
Routing scheme based on signal strength, Dynamic State Routing (DSR), Route Maintenance and Routing error,
FisheyeRouting(FSR), Ad-hocon DemandDistanceVector (AODV)
References:
1. Shambhu Upadhyaya, Abhijeet Chaudhary, Kevin Kwiat, Mark Weises, Mobile
Computing, Kluwer AcademicPublishers
2. UWE Hansmann, Lothar Merk, Martin-S-Nickious, Thomas Stohe, Principles of Mobile
Computing, Springer International Edition
44
MCA741 EmbeddedSystems
MCA 742PatternRecognition
MCA 743 CryptographyandNetwork Security
MCA 744 Natural languageProcessing
MCA 745 MultimediaCommunication
Untt-I
MCA 741 Embedded Systems
L T P
3 1 0
Introductionto embeddedsystems: Classification, Characteristics andrequirements
Untt-II
Timingandclocks in Embedded systems, Task Modelingandmanagement, Real timeoperatingsystemissues.
Untt-III
Signals, frequencyspectrumandsampling, digitization (ADC, DAC), Signal ConditioningandProcessing.
ModelingandCharacterization of Embedded ComputationSystem.
Untt-IV
Embedded Control andControl Hierarchy, Communication strategies for embeddedsystems: Encodingand
Flowcontrol.
Untt-V
Fault-Tolerance
Formal Verification.
Buuks:
1. H.Kopetz, Real-TimeSystems, Kluwer, 1997.
2. R.Gupta, Co-synthesis of HardwareandSoftwarefor EmbeddedSystems, Kluwer 1995.
3. Rajkamal, EmbeddedSystems, TMH, 2008
45
Unit - 1 Introduction
MCA 742 PATTERN RECUCNITIUN
L T P
3 1 0
Pattern recognition, classiIication and description, patterns and Ieatures extraction, training and learning in PR
systems, pattern recognition approaches.
Unit - 2 Pattern Discrimination
Decision regions and Iunctions, Ieature Space Metrics, The Covariance Matrix, Principal components, Ieature
assessment, dimensionality ratio problem
Data Clustering
Unsupervised classiIication, Standardization issues, tree clustering, dimensional reduction, K-means clustering, cluster
validation
Unit - 3 Statistical Classifications
Linear Discriminants, Bayesian classiIication, Model Iree techniques, Ieature selection, classiIier evaluation, tree
classiIier
Unit - 4 Syntactic pattern recognition
Introduction, quantiIying structure in pattern description, grammar based approach and applications, elements oI
Iormal grammars, recognition oI syntactic descriptions, parsing, CYK parsing algorithm
Unit - 5 Structural pattern recognition
Primitives, structural representations, syntactic analysis, structural matching
Text Books:
1. Pattern Recognition: Statistical, structural and neural approaches, Robert J. SchalkoII, WILEY 1992 .
2. Pattern Recognition: Concepts, Methods and applications, J.P. Marques, Springer 2008 .
3. Pattern Recognition: Techniques and applications, rajjan Shinghal, OxIord University Press, 2006 .
46
MCA 743 CRYPTUCRAPHY AND NETWURK SECURITY
L T P
3 1 0
Untt-I
Introduction to Cryptography: IntroductionToSecurity: Attacks, Services&Mechanisms, Security, Attacks, Security
Services. Conventional Encryption: Classical Techniques, Conventional Encryption Model, And
Steganography, Classical Encryption Techniques. Modern Techniques: Simplified DES, Block Cipher Principles,
DES Standard, DES Strength, Differential & Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher
ModesOf Operation.
Untt-II
Conventional Encryption Algorithms: Triples DES, Blowfish, International Data Encryption Algorithm, RCS,
CAST-128, RC2 Placement & Encryption Function, Key Distribution, Random Number Generation, Placement Of
EncryptionFunction.
Untt-III
Public Key Encryption: Public-Key Cryptography: Principles Of Public-Key Cryptosystems, RSA Algorithm, Key
Management, Fermats& EulersTheorm, Primality, The ChineseRemainder Theorem.
Untt-IV
Hash Functions: Message Authentication & Hash Functions: Authentication Requirements, Authentication
Functions, Message Authentication Codes, Hash Functions, Birthday Attacks, Security Of Hash Function & MACS,
MD5 Message Digest Algorithm, Secure Hash Algorithm (SHA), Digital Signatures: Digital Signatures,
AuthenticationProtocol, Digital SignatureStandard(DSS), Proof Of Digital SignatureAlgorithm.
Untt-V
Network & System Security: Authentication Applications: Kerberos X.509, Directory Authentication Service,
Electronic Mail Security, Pretty Good Privacy (PGP), S / Mime, Security: Architecture, Authentication Header,
Encapsulating Security Payloads, Combining Security Associations, Key Management, Web Security: Secure
Socket Layer & Transport Layer Security, Secure Electronic Transaction (Set), System Security: Intruders,
Viruses, Firewall Design Principles, TrustedSystems.
Rejerence Bookx:
1. Johannes A. Buchmann, Introduction tocryptography, Springer- Verlag.
2. Atul Kahate, CryptographyandNetwork Security, TMH
47
Untt-I
MCA 744 NATURAL LANCUACE PRUCESSINC
L T P
3 1 0
Introduction to Natural Language Understanding: The study of Language, Applications of NLP, Evaluating
Language Understanding Systems, Different levels of Language Analysis, Representations and Understanding,
Organizationof Natural languageUnderstandingSystems, LinguisticBackground: Anoutlineof Englishsyntax.
Untt-II
Introduction to semantics and knowledge representation, Some applications like machine translation, database
interface.
Untt-III
Grammars and Parsing: Grammars and sentence Structure, Top-Down and Bottom-Up Parsers, Transition
Network Grammars, Top-Down Chart Parsing. Feature Systems and Augmented Grammars: Basic Feature
system for English, Morphological Analysis and the Lexicon, Parsing with Features, Augmented Transition
Networks.
Untt-IV
Grammars for Natural Language: Auxiliary Verbs and Verb Phrases, Movement Phenomenon in Language,
Handling questions in Context-Free Grammars. Human preferences in Parsing, Encoding uncertainty,
DeterministicParser.
Untt-V
Ambiguity Resolution: Statistical Methods, Probabilistic Language Processing, Estimating Probabilities, Part-of-
Speech tagging, Obtaining Lexical Probabilities, Probabilistic Context- Free Grammars, Best First Parsing.
SemanticsandLogical Form, WordsensesandAmbiguity, EncodingAmbiguityinLogical Form.
Buuks:
1. James Allen, Natural LanguageUnderstanding, 2/ e, Pearson Education, 2003
2. L.M. Ivansca, S. C. Shapiro, Natural LanguageProcessingandLanguageRepresentation
3. T. Winograd, Languageas aCognitiveProcess, Addison-Wesley
48
MCA 745 Multtmedta Cummuntcattuns
L T P
3 1 0
UNIT I
Multtmedta Cummuntcattun: Multimedia information representation. Multimedia Networks, Multimedia
applications, Network QoSandapplication QoS.
UNIT II
Infurmattun Representattun: text, image, audio and video, text and image compression, compression
principles, text compression, image compression. Audio and Video compression. Audio compression. Video
compression. Video compression Principles, video compression standards: H.261. H.263.PI.323, MPEG1, MPEG
2, Other codingformatsfor text, speech, imageandvideo.
UNIT III
Detatled study uf MPEC 4: codingof audiovisual objects, MPEG 4 systems. MPEG 4 audio and video, profile and
levels. MPEG 7 standardization process of multimedia content description, MPEG 21 multimedia framework,
Significant features of JPEG2000, MPEG4transport across theinternet
Synchronization: notionof synchronization, presentationrequirements, referencemodel for synchronization
UNIT IV
Intruducttun tu SMIL: Multimedia operating System, Resource management and process management
techniques.
UNIT V
Multtmedta cummuntcattun acruss netwurks: Layered video coding, error relevant video coding techniques,
multimedia transport across IP networks and relevant products such as RSVP, RTP, RTCP, DVMRP, multimedia in
mobilenetworks, multimediabroadcast networks, andcontent basedretrieval indigital libraries.
References:
1. J.R. Ohm. "MultimediaCommunication Technology", Springer International Edition, 2005.
2. K.Sayood. "Introduction to DataCompressiojn", 2ndEd, Morgan Kauffman. IndianEdition, 2000.
3. FredHalsall, "Multimediacommunication", Pearson Education, 2001.
4. K.R. Rao, ZoramS. Bojkovic, DragoradA. Milovanovic, "MultimediaCommunicationSystem",
PearsonEducation, 2004.
49
MCA751 Real TimeSystems
MCA 752 Operation Research
MCA753 Modeling&Simulation
MCA754 BioInformatics
MCA 755 Client Server Computing
UNIT-I: Intruducttun
MCA 751 REAL TIME SYSTEMS
L T P
3 1 0
Definition, Typical Real Time Applications: Digital Control, High Level Controls, Signal Processing etc., Release
Times, Deadlines, and Timing Constraints, Hard Real Time Systems and Soft Real Time Systems, Reference
Models for Real Time Systems: Processors and Resources, Temporal Parameters of Real Time Workload,
PeriodicTask Model, PrecedenceConstraints andDataDependency.
UNIT-II: Real Ttme Schedultng
Common Approaches to Real Time Scheduling: Clock Driven Approach, Weighted Round Robin Approach,
Priority Driven Approach, Dynamic Versus Static Systems, Optimality of Effective-Deadline-First (EDF) and
Least-Slack-Time-First (LST) Algorithms, Offline Versus Online Scheduling, Scheduling Aperiodic and Sporadic
jobsin PriorityDrivenandClock DrivenSystems.
UNIT-III: Resuurces Access Cuntrul
Effect of Resource Contention and Resource Access Control (RAC), Nonpreemptive Critical Sections, Basic
Priority-Inheritance and Priority-Ceiling Protocols, Stack Based Priority-Ceiling Protocol, Use of Priority-Ceiling
Protocol in Dynamic Priority Systems, Preemption Ceiling Protocol, Access Control in Multiple-Unit Resources,
ControllingConcurrent Accesses to DataObjects.
UNIT-IV: Multtprucessur SystemEnvtrunment
Multiprocessor and Distributed System Model, Multiprocessor Priority-Ceiling Protocol,Schedulability of Fixed-
Priority End-to-End Periodic Tasks, Scheduling Algorithms for Endto-End Periodic Tasks, End-to-End Tasks in
Heterogeneous Systems, Predictability and Validation of Dynamic Multiprocessor Systems, Scheduling of Tasks
withTemporal DistanceConstraints.
UNIT-V: Real Ttme Cummuntcattun
Model of Real Time Communication, Priority-Based Service and Weighted Round-Robin Service Disciplines for
Switched Networks, Medium Access Control Protocols for Broadcast Networks, Internet and Resource
Reservation Protocols, Real Time Protocols, Communication in Multicomputer System, An Overview of Real
TimeOperatingSystems.
Text Buuks:
1. Real TimeSystemsbyJaneW. S. Liu, PearsonEducationPublication.
2. Real-TimeSystems: Scheduling, Analysis, andVerificationbyProf. Albert M. K. Cheng, JohnWileyandSons
Publications.
50
UNIT I
MCA 752 UPERATIUNS RESEARCH L T P
3 1 0
Linear programming : graphical methods Ior two dimensional problems central problem oI linear programming
various deIinitions statements oI basic theorems and properties phase i and phase ii oI the simplex method
revised simplex method primal and dual dual simplex method sensitivity analysis transportation problem and its
solution assignment problem and its solution by Hungarian method.
UNIT II
Integer programming: Gomory cutting plane methods branch and bound method.Queuing theory: characteristics oI
queuing systems steady state m/m/1,m/m/1/k and m/m/c queuing models.Replacement theory : replacement oI items
that deteriorate replacement oI items that Iail group replacement and individual replacement.
UNIT III
Inventory theory : costs involved in inventory problems single item deterministic models economic lot size models
without shortages and with shortages having partition rate inIinite and Iinite.
UNIT IV
Pert and CP/M : arrow network- time estimates earliest expected time, latest allowable occurrence time, latest
allowable occurrence time and slack critical path probability oI meeting scheduled date oI completion oI project
calculation oI CP/M network various Iloats Ior activities critical path updating project operation time cost trade
oII curve selection oI schedule based on cost analysis
UNIT V
Game Theory: The Iormation oI Twoperson, Zerosum games, solving simple games, games with mixed strategies,
Graphical solution Procedure, Solving by LP.
Reference Books:
1. Gross D., and Harris, C. M., 'Fundamentals oI queueing theory ', John Willey and Sons, NY.
2. Hillier F., and Lieberman, G. J. , 'Introduction to Operation Research, Holden Day ,NY.
3. Taha, H. A., 'Operations Research An Introduction, McMillan Publishing Company, NY
51
.
MCA 753 MUDELINC & SIMULATIUN L T P
3 1 0
Unit-I Introduction to Modeling and Simulation Nature oI Simulation. Systems , Models and Simulation,
Continuous and Discrete Systems, system modeling, concept oI simulation, Components oI a simulation study,
Principles used in modeling ,Static and Dynamic physical models, Static and Dynamic Mathematical models
Introduction to Static and Dynamic System simulation , Advantages ,Disadvantages and pitIalls oI Simulation.
Unit-II System Simulation and Continuous System Simulation Types oI System Simulation, Monte Carlo Method,
Comparision oI analytical and Simulation methods, Numerical Computation techniques Ior Continuous and Discrete
Models, Distributed Lag Models, Cobweb Model. Continuous System models, Analog and Hybrid computers, Digital-
Analog Simulators, Continuous system simulation languages ,Hybrid simulation ,Real Time simulations.
Unit -III System Dynamics & Probability concepts in Simulation Exponential growth and decay models, logistic
curves ,Generalization oI growth models , System dynamics diagrams, Multi segment models , Representation oI Time
Delays. Discrete and Continuous probability Iunctions, Continuous UniIormly Distributed Random Numbers,
Generation oI a Random numbers, Generating Discrete distributions, Non-UniIorm Continuously Distributed Random
Numbers, Rejection Method.
Unit-IV Simulation of Queueing Systems and Discrete System Simulation Poisson arrival patterns, Exponential
distribution, Service times, Normal Distribution Queuing Disciplines, Simulation oI single and two server queue.
Application oI queuing theory in computer system . Discrete Events ,Generation oI arrival patterns ,Simulation
programming tasks , Gathering statistics, Measuring occupancy and Utilization , Recording Distributions and Transit
times .
Unit-V Introduction to Simulation languages and Analysis of Simulation output GPSS: Action times, Succession oI
events, Choice oI paths, Conditional transIers ,program control statements . SIMSCRIPT: Organization oI
SIMSCRIPT Program, Names & Labels, SIMSCRIPT statements . Estimation methods , Relication oI Runs , Batch
Means , Regenerative techniques , Time Series Analysis , Spectral Analysis and Autoregressive Processes.
References/ Suggested Reading / Books:
Seila, Simulation Modeling, Cengage Learning
Law .,Simulation Modeling And Analysis, McGraw Hill
Deo, System Simulation with Digital Computer, PHI
Severance, ' System Modeling & Simulation, Willey Pub
52
MCA 754 BIU INFURMATICS
Untt I:
L T P
3 1 0
Intruducttun: Bioinformatics objectives and overviews, Interdisciplinary nature of Bioinformatics, Data
integration, Dataanalysis, Major Bioinformatics databases andtools. Metadata: Summary
& referencesystems, findingnewtype of dataonline.
Mulecular Btulugy and Btutnfurmattcs: Systems approach in biology,Central dogma of molecular biology,
problems in molecular approach and the bioinformatics approach, Overview of the bioinformatics
applications.
Untt II:
The Infurmattun Mulecules and Infurmattun Fluw:Basic chemistry of nucleic acids, Structure of
DNA, Structure of RNA, DNA Replication, -Transcription, -Translation, Genes- the functional elements in
DNA, Analyzing DNA,DNA sequencing. Proteins: Amino acids, Protein structure, Secondary, Tertiary and
Quaternary structure, Protein folding and function, Nucleic acid-Proteininteraction.
Untt III:
Perl: Perl Basics, Perl applications for bioinformatics- Bioperl, Linux Operating System, Understanding and
UsingBiological Databases, Javaclients, CORBA, Introduction tobiostatics.
Untt IV:
Nucleuttde sequence data: Genome, Genomic sequencing, expressed sequence tags, gene expression,
transcription factor binding sites and single nucleotide polymorphism. Computational representations of
molecular biological data storage techniques: databases (flat, relational and object oriented), and
controlled vocabularies, general data retrieval techniques: indices, Boolean search, fuzzy search and
neighboring, application to biological datawarehouses.
Untt V:
Btulugtcal data types and thetr spectal requtrements: sequences, macromolecular structures, chemical
compounds, generic variability and its connection to clinical data. Representation of patterns and
relationships: alignments, regular expressions, hierarchies and graphical models.
Text Buuk:
1. OReilly, Developing Bio informatics computer skills, Indian Editions publication.
2. Stephen Misner &Stephen Krawetz, Bioinformatics- Methods &Protocols, Addison Wesley
53
UNIT-I
MCA 755 CLIENT SERVER CUMPUTINC
L T P
3 1 0
CltentJServer Cumputtng: DBMS concept and architecture, Single system image, Client Server architecture,
mainframe-centric client server computing, downsizing and client server computing, preserving mainframe
applications investment through porting, client server development tools, advantages of client server
computing.
UNIT -II
Cumpunents uf CltentJServer appltcattun: The client: services, request for services, RPC, windows
services, fax, print services, remoteboot services, other remoteservices, Utility Services &Other Services, Dynamic
Data Exchange (DDE), Object Linking and Embedding (OLE), Common Object Request
BrokerArchitecture (CORBA).,The server: Detailed server functionality, the network operating system,
available platforms, the network operatingsystem, availableplatform, theserver operatingsystem.
UNIT -III
CltentJServer Netwurk: connectivity, communication interface technology, Interposes communication,
wide area network technologies, network topologies (Token Ring, Ethernet, FDDI, CDDI)
network,management, Client-server system development: Software, ClientServer System Hardware:
Network,Acquisition, PC-level processing unit, Macintosh, notebooks, pen, UNIX workstation, x-terminals,
server hardware.
UNIT IV
Data Sturage: magnetic disk, magnetic tape, CD-ROM, WORM, Optical disk, mirrored disk, fault
tolerance, RAID, RAID-Disk network interface cards.Network protection devices, Power Protection Devices, UPS,
Surgeprotectors.
Cltent Server Systems Develupment: Services and Support, system administration, Availability, Reliability,
Serviceability, Software Distribution, Performance, Network management, Help Disk, Remote Systems
Management Security, LANandNetwork Management issues.
UNIT -V
CltentJServer System Develupment: Training, Training advantages of GUI Application,
SystemAdministrator training, DatabaseAdministrator training, End-user training.
Thefuture of client server ComputingEnablingTechnologies, Thetransformational system.
Reference Buuk:
1. Patrick Smith &SteaveGuengerich, Client / Server Computing, PHI
54
MCA-511 ADVANCED SUFTWARE ENCINEERINC J UML LAB
L T P
0 0 2
Students arerequiredto preparevarious UML diagrams for any casestudylikeMicrowaveOvenoperation.
Followingdiagramsshouldbeprepared:
1. Usecasestaticstructurediagram
2. Object andClass diagram
3. SequenceDiagram
4. Collaboration Diagram
5. StateChart Diagram
6. ActivityDiagram
7. Component Diagram
8. Deployment Diagram
MCA-512 WEB TECHNULUCIES LAB
MCA- 512
L T P
0 0 2
1. DesignaHTML pagetodisplay your CV
2. DesignaHTML formto reservearailwayticket.
3. WriteaJavaScript programthat findsthegreatest commondivisor of twonumbers.
4. Intheformmentionedin problem2toreservearailwayticket addthefollowing
validationsusingjavaScript.
Fromcityandtocityaretwodifferent cities.
Ageof passengers shouldnot begreater than150.
Nameof thepassenger shouldbeastringof amaximumlength20.
5. Writeaprogramfor illustratingclient/ server sidescriptingwithhelpof JSP.
6. Writeapieceof codein XML for creatingDTD, whichspecifies set of rules.
7. Createstylesheet in CSS/ XSL anddisplay thedocument inInternet Explorer.
8. Mini Project: Developawebportal for your college.
55
Cummuntcattun Practtce
MCA-513 BUSINESS CUMMUNICATIUN LAB
L T P
0 0 2
1. Speaking: oral communication in social and10hours
Work-related situations, e.g.: Greeting an acquaintance/ friend, introducing oneself, introducing a
friend to another friend, breaking off a conversation politely, leave-taking; making and responding to
inquiries; expressing an opinion; expressing agreement/ disagreement, contradicting/ refuting an
argument; expressing pleasure, sorrow, regret, anger, surprise, wonder, admiration, disappointment
etc. Narrating or reporting an event; Describing people, objects, places, processes etc. Ordering /
directing someone to do something; Making requests; accepting / refusing a request; Expressing
gratitude; respondingto expressions of gratitude; Askingfor or offering help; respondingto a request for
help; Asking for directions (e.g. how to reach a place, how to operate a device etc.) and giving
directions; asking for and granting/ refusing permission; prohibiting someone from doing something;
suggesting, advising, persuading, dissuading, making a proposal; praising, complimenting, felicitating;
expressingsympathy(e.g. condolenceetc.); Complaining, criticizing, reprimanding
2. Readtng
Students will begivenpracticein readingandcomprehending6-8simplepassages of 100-300 words each,
on topics of general as well as professional interest. The texts will be supported by suitable
exercises designed to foster comprehension skills and vocabulary enrichment, together with study
skills (note making) and reference skills (using a dictionary). Practice will be provided in the important
sub-skillsof readingwhichareintroducedin Module2of thetheory component.
3. Wrtttng
Writing short paragraphs on given topics or topics of ones choice; social and business letters; reports;
applications ; resumes ; summaries; The principles of Process Writing should be used to teach writing
skills.
a. pre-writing: generatingideas, brain-storming, ideamapping, outliningb.
writing: generatingafirst draft ; reviewing, redrafting, editing
c. post-writing: makingapresentation; discussion andfeedback, preparingthefinal draft.
4. Suft sktlls practtce
Activities designedto highlight leadershipandteam skills; Groupdiscussion

MCA II III Year 9 9 2011

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

MCA II III Year 9 9 2011

Încărcat de

Drepturi de autor:

Formate disponibile

Uttarakhand 1echnical University

COURSES OF S1UDY, SCHEME OF EXAMINA1ION &SYLLABUS FOR M.C.A.

S-ar putea să vă placă și