Curriculum for Master of Computer Applicationssyllabus.docx
《Curriculum for Master of Computer Applicationssyllabus.docx》由会员分享，可在线阅读，更多相关《Curriculum for Master of Computer Applicationssyllabus.docx（65页珍藏版）》请在冰豆网上搜索。
CurriculumforMasterofComputerApplicationssyllabus
NationalInstituteofTechnologyCalicut
DepartmentofComputerEngineering
CurriculumforMasterofComputerApplications（MCA）
（From2006Admissions）
Semester1
Code
Title
L
T
P
C
1
MAG501
DiscreteMathematics
3
1
0
3
2
MAG502
ProbabilityandStatistics
3
1
0
3
3
CSU101
ComputerProgramming
3
0
0
3
4
CSU202
LogicDesign
3
0
2
4
5
SHU111
ProfessionalCommunication
3
0
0
3
6
CSM591
ProgrammingLab
0
0
5
3
TotalCredits
19
Semester2
Code
Title
L
T
P
C
1
MAG503
GraphTheoryandCombinatorics
3
1
0
3
2
CSU215
ComputerOrganisation
3
0
2
4
3
CSU213
DatabaseManagementSystems
3
0
0
3
4
CSU211
FormalLanguagesandAutomata
3
0
0
3
5
CSU230
ProgramDesign
3
0
2
4
6
CSU296
DBMSLab
0
0
3
2
Totalcredits
19
Semester3
Code
Title
L
T
P
C
1
MAG505
NumberTheory&Applications
3
1
0
3
2
MEG501
PrinciplesofIndustrialManagement
3
0
0
3
3
CSU203
DataStructuresandAlgorithms
3
0
0
3
4
CSU304
ComputerNetworks
3
0
0
3
5
Elective
3
0
0
3
6
CSU291
DataStructuresLab
0
0
5
3
Totalcredits
18
Semester4
Code
Title
L
T
P
C
1
CSU313
OperatingSystems
3
0
0
3
2
CSU303
CompilerConstruction
3
0
0
3
3
CSU321
SoftwareEngineering
3
0
0
3
4
MEG502
PrinciplesofFinancialManagement
3
0
0
3
5
Elective
3
0
0
3
6
CSU392
CompilerLab
0
0
5
3
Totalcredits
18
Semester5
Code
Title
L
T
P
C
1
MAG504
NumericalAnalysis&OptimizationTechniques
3
1
0
3
2
Elective
3
0
0
3
3
Elective
3
0
0
3
4
Elective
3
0
0
3
5
Elective
3
0
0
3
6
CSM581
Seminar
0
0
3
1
Totalcredits
16
Semester6
Code
Title
L
T
P
C
1
CSM599
Project
-
-
-
15
Totalcredits
15
MinimumRequirement
Astudentshouldhaveearnedatotalofatleast105credits.
Notes:
∙TheelectivescanbechosenfromthelistofelectivecoursesofferedbythedepartmentfortheB.Tech/MCAProgrammes.
∙FinalyearstudentssatisfyingthestandardrequirementscancreditelectivecoursesoftheM.Techprogram,withconsentofthedepartment.
∙Studentscanalsocreditglobalelectives,withpermissionfromthedepartment.
ListofElectiveCourses
Sl.No
Code
Title
L
T
P
C
1
CSU339
AdvancedDataStructures
3
0
0
3
2
CSU358
CommunicationandInformationTheory
3
0
0
3
3
CSU301
DesignandAnalysisofAlgorithms
3
0
0
3
4
CSU363
ComputationalIntelligence
3
0
0
3
5
CSU371
LogicforComputerScience
3
0
0
3
6
CSU334
WebProgramming
3
0
0
3
7
CSU331
ComputerGraphicsandMultimedia
3
0
0
3
8
CSU341
DistributedComputing
3
0
0
3
9
CSU343
EmbeddedSystemDesign
3
0
0
3
10
CSU411
ComputerSecurity
3
0
0
3
11
CSU353
MobileCommunicationSystems
3
0
0
3
12
CSU354
ElectronicCommerce
3
0
0
3
13
CSU333
ObjectOriented-Analysis&Design
3
0
0
3
14
CSU431
AdvancedDatabaseManagementSystems
3
0
0
3
15
CSU441
AdvancedComputerArchitecture
3
0
0
3
16
CSU352
CodingTheory
3
0
0
3
17
CSU356
MobileComputing
3
0
0
3
18
CSU361
ImageProcessing
3
0
0
3
19
CSU362
PatternRecognition
3
0
0
3
20
CSU364
NaturalLanguageProcessing
3
0
0
3
21
CSU373
ComputationalComplexity
3
0
0
3
22
CSU471
AdvancedTopicsinAlgorithms
3
0
0
3
23
CSU472
QuantumComputation
3
0
0
3
24
CSU305
TheoryofComputation
3
0
0
3
25
CSU315
ComputerHardware
3
0
0
3
26
MAU333
StochasticProcessesforEngineers
3
1
0
3
27
MAG521
SimulationandModelling
3
1
0
3
28
MAU329
FuzzinessandSoftComputing
3
1
0
3
29
MAU325
DecisionModellingTechnique
3
1
0
3
30
MAU342
TopicsinAlgebra
3
1
0
3
31
MAU326
IntegerOptimizationandNetworkModels
3
1
0
3
32
MAU336
DesignandAnalysisofExperiments
3
1
0
3
33
MAU335
ForecastingTechniques
3
1
0
3
34
MAU324
FuzzyOptimization
3
1
0
3
NATIONALINSTITUTEOFTECHNOLOGYCALICUT
DEPARTMENTOFCOMPUTERENGINEERING
MasterofComputerApplications（MCA）
（From2006Admissions）
Syllabiofthe
CoursesOfferedbytheDepartmentofComputerEngineering
PARTI:
CORECOURSES
CSU101COMPUTERPROGRAMMING
Pre-requisite:
NIL
L
T
P
C
3
0
0
3
ModuleI
Introductiontocomputersandsoftware（3Hours）
Problemsolving,algorithmdesign,andalgorithmanalysis（mentiononly）（3Hours）
Designmethodologies:
（6Hours）
Stepwiserefinement:
ModulesandInterfaces.
Objectorientedmethodology:
Encapsulation,Inheritance,Polymorphism
ModuleII
Programminglanguageconceptsandconstructs:
Expressions,Statements,selection,repetition.
（11Hours）
ModuleIII
Functions,recursion,I/Omechanisms（Exceptionsoptional）（10Hours）
ModuleIV
Datatypes:
Primitivetypesandstructuredtypes（4Hours）
Codingpractices:
（3Hours）
Indentationguidelines,namingconventions,documentingcode,debugging
Testing:
Verificationmethods,testdataselection.（2Hours）
Note:
ProgramminglanguageC++/Javamaybeusedasavehicletoachievethegoal.
TextBooks:
1.BruceEckel,ThinkinginJava,3/ed,Availableonlineat
2.BruceEckel,ThinkinginC++,2/ed.VolIandII,Availableonlineat
References:
1.RobertLafore,ObjectOrientedProgramminginTurboC++,TheWaiteGroup’s,GalgotiaPublicationsPvt.Ltd.2000.
2.RebeccaThomas,LawrenceRRogers,JeanLYates,AdvancedProgrammer’sGuidetoUNIXSystemV,McGrawHillInternationalEdition,ComputerScienceSeries.
3.PatrickNaughton,HerbertSchildt,JavaTM2:
TheCompleteReference,TataMcGraw-HillPublishingCompanyLtd.3/ed
4.DannyKalev,TheANSI/ISOC++ProfessionalProgrammer’sHandbook,PHI2000.
CSU202LOGICDESIGN
Pre-requisite:
CSU101ComputerProgramming
L
T
P
C
3
0
2
4
ModuleI（10+5Hours）
NumberSystemsandcodes,Booleanalgebra:
postulatesandtheorems,constants,variablesandfunctions,switchingalgebra,Booleanfunctionsandlogicaloperations,Karnaughmap:
primecubes,minimumsumofproductsandproductofsums,Quine-McCluskyalgorithm,CombinationalLogic:
analysisanddesignofcombinationallogiccircuits,paralleladdersandlook-aheadadders,comparators,decodersandencoders,codeconversion,multiplexersanddemultiplexers,paritygeneratorsandcheckers,ROMs,
ModuleII（10+5Hours）
PLAs,.PLAminimization,PLAfolding,designfortestability,Countersandshiftregisters:
excitationtables,ripplecounters,synchronouscounters,up-downcounters,designofsequentialcircuits,shiftregistersandtheirapplications.Clockmodesequentialmachines.
ModuleIII（11+10Hours）
Microprocessorarchitecture:
realmodeandprotectedmodememoryaddressing,memorypaging.Addressingmodes:
dataaddressing,programmemoryaddressing,stackmemoryaddressing.Datamovementinstructions,Arithmeticandlogicinstructions,Programcontrolinstructions,Programmingthemicroprocessor:
modularprogramming,usingkeyboardanddisplay,dataconversions,diskfiles,interrupthooks,usingassemblylanguagewithC/C++.
ModuleIV（11+8Hours）
Memoryinterface:
memorydevices,addressdecoding,16bit（8086）,32bit（80486）and64bit（Pentium）,Hardwarearchitectureforembeddedsystems-processor-memory-latchesandbuffers-displayunit-16and32bitprocessors.Memoryinterfaces,dynamicRAM.I/Ointerface:
portaddressdecoding,PPI,8279interface,8254timerinterface,16550UARTinterface,ADC/DACinterfaces,Interrupts-Interruptcontroller,DMAController.
References:
1.N.N.Biswas,LogicDesignTheory,PrenticeHallofIndia,NewDelhi,1993.
2.T.L.Floyd,DigitalFundamentals,3/e,UniversalBookStall,NewDelhi,1986.
3. B.B.Brey,TheIntelMicroprocessors8086toPentium:
Architecture,ProgrammingandInterface,6/e,
PrenticeHallofIndia,NewDelhi,2003.
4.ProgrammingforembeddedsystemsDreamSoftwareteam,Willey2002
5.H.P.Messmer,TheIndispensablePCHardwareBook,3/e,AddisonWesley,1997.
6.A.K.Ray,andK.M.Bhurchandi,AdvancedMicroprocessorsandPeripherals,TataMcGrawHill,2000.
7.D.V.Hall,MicroprocessorsandInterfacing:
ProgrammingandHardware,2/e,TataMcGrawHill,NewDelhi,1992.
CSM591PROGRAMMINGLAB
Pre-requisite:
CSU101ComputerProgramming
L
T
P
C
0
0
5
3
ModuleI（5LabSessions）
HCF（Euclid’salgorithm）andLCMofgivennumbers-findmean,medianandmodeofagivensetofnumbers–Conversionofnumbersfrombinarytodecimal,hexadecimal,octalandback–evaluationoffunctionslikeex,sinx,cosxetc.foragivennumericalprecisionusingTaylor’sseries–testingwhetheragivennumberisprime.
ModuleII（3LabSessions）
Stringmanipulationprograms:
sub-stringsearch,deletion–lexicographicsortingofagivensetofstrings–generationofallpermutationsofthelettersofagivenstringusingrecursion..
ModuleIII（3LabSessions）
Matrixoperations:
Programstofindtheproductoftwomatrices–inverseanddeterminant（usingrecursion）ofagivenmatrix–solutiontosimultaneouslinearequationsusingJordanelimination.
ModuleIV（3LabSessions）
Files:
Useoffilesforstoringrecordswithprovisionforinsertion,deletion,search,sortandupdateofarecord.
References
1.H.Schildt,C:
TheCompleteReference,4/e,TataMcGrawHill,2000.
2.H.H.TanandT.B.D'Orazio,CProgrammingforEngineering&Compute
升级会员 