1. name of the institutionkucse.in/aictemand2019.pdf6. programmes name of programmes approved by...

1. NameoftheInstitution:NAME UNIVERSITYOFKALYANI,DEPARTMENTOFCOMPUTER

SCIENCEANDENGINEERINGAddress UNIVERSITYOFKALYANI

EPARTMENT OF COMPUTER SCIENCE ANDENGINEERING,KALYANI,DIST.-NADIA,WESTBENGAL,PIN-741235

Telephone Mobile Email

2. NameandAddressoftheTrust/Society/CompanyandtheTrustees:NA3. NameandAdressofthePrincipal:Dr.DebansuRoy,Telephone:033258287504. NameoftheaffiliatingUniversity:NA5. Governance:

a. MembersoftheBoardandtheirbriefbackground:b. MembersofAcademicAdvisoryBody:c. FrequentlyoftheBoardMeetingandAcademicAdvisoryBody:d. Organizationalchartandprocesses:e. NatureandExtentofinvolvementofFacultyandstudentsinacademicaffairs/improvementsf. Mechanism/NormsandProcedurefordemocratic/goodGovernanceg. StudentFeedbackonInstitutionalGovernance/Facultyperformanceh. GrievanceRedressalmechanismforFaculty,staffandstudentsi. EstablishmentofAntiRaggingCommitteej. EstablishmentofOnlineGrievanceRedressalMechanismk. EstablishmentofGrievanceRedressalCommitteeintheInstitutionandAppointmentof

OMBUDSMANbytheUniversity

CommitteeType

AppointmentorderReferencenumber

DateofAppointment

Name Profession

Address

Associatedwith

email

OMBUDSMAN

R/Estab/Extn./18/DP-415

25/5/2018

SushilKumarSaha

Advocate

UniversityofKlayani

UniversityofKlayani

[email protected]

GrievanceRedressal

RPS/N/48/1590/2016/S-890

30/11/2016

DebansuRoy

Principal

UniversityofKalyani

UniversityofKalyani

[email protected]

l. EstablishmentofInternalComplaintCommittee(ICC)m. EstablishmentofCommitteeforSC/STn. InternalQualityAssuranceCell:

6.Programmes

NameofProgrammesapprovedbyAICTE MCA,MTECH(CSE)NameofProgrammesAccreditedbyAICTE MCA,MTECH(CSE)

Name Numberofseats

Duration Cutoffmarks/rankofadmissionduringthelastthreeyears

Fee PlacementFacilities

Campusplacementinlastthreeyearswithminimumsalary,maximumsalaryandaveragesalary

MTECH 10 2yr 24000(GATE)perannum40000(non_Gate)perannum

Placed-10.MinSalary-2lakh(perannum)MaxSalary-4Lakh(perannum)Averagesalary-2.5Lakh(perannum)

MCA 15 3yr 21710perannum

Placed-35.MinSalary-1.5lakh(perannum)MaxSalary-4Lakh(perannum)Averagesalary-2.5Lakh(per

annum)

7.Faculty:

Faculty Permanet AdjunctJyotsnaKumarMandal Yes UtpalBiswas Yes PriyaRanjanSinhaMahapatra Yes AnirbanMukherjee Yes KalyaniMali Yes DebabrataSardar Yes SukantaMajumdar Yes

• PermanentFaculty:StudentRatio:• NumberofFacultyemployedandleftduringthelastthreeyears:employed:1

8.ProfileofPrincipal:

i.Name–Dr.DebansuRoy

ii.DateofBirth-23/12/1966

iii.Uniqueid-AFXPR8250D(PANID)

iv.EducationQualifications–Ph.DinEconomics,M.A.inEconomics.

v.WorkExperience

•Teaching–16years

•Research–16years

•Industry-

•Others-

vi.AreaofSpecialization-Economics

vii.CoursestaughtatDiploma/PostDiploma/UnderGraduate/PostGraduate/PostGraduateDiplomaLevel-

viii.Researchguidance

•No.ofpaperspublishedinNational/InternationalJournals/Conferences-

•Master-

•Ph.D.-

ix.Projectscarriedout-

x.Patents-NA

xi.TechnologyTransfer-NA

xii.ResearchPublications–

9.Fee

Sl. Particulars MCA M.Tech

No. CSE

1 AdmissionFee(onetime)* 500.00 500.00

2 Tuition/CourseFee(yearly) 20000.00 #24000.00

3 LibraryFee (onetime)nonrefundable 80.00 80.00

4 SportsFee (onetime) 50.00 50.00

5 LaboratoryFee(p.a.) 200.00 200.00

5a ComputerFee+InternetFacility(annual) 100.00 100.00

6 SessionFee(p.a.) 100.00 100.00

7 RegistrationFee(onetime),ifapplicable** 100.00 100.00

8 StudentHealthHome (p.a.) 10.00 10.00

9 FeeforIdentityCard (onetime) 30.00 30.00

10 ImmigrationFee** (onetime),ifapplicable 30.00 30.00

11 DevelopmentFee (p.a.) 100.00 100.00

12 Students’ AidFund (onetime) 50.00 50.00

13 Prospectus&UniversityInformation 200.00 200.00

14 ExaminationFee(p.a.)(fortwosemesters) 1200.00 1200.00

TOTAL(including sl.no.7&10) 22750.00 26750.00

# For NET and GATE qualified students - Rs. 24,000.00 and for Non NET/ GATE students - Rs. 40,000.00 and for

SponsoredstudentsRs.50,000.00

** RegistrationFeeandImmigrationFeeareapplicableincaseofstudentswhohavedonegraduationfromany

UniversityotherthenUniversityofKalyani.

• Timescheduleforpaymentoffeefortheentireprogramme:• No.ofFeewaiversgrantedwithamountandnameofstudents:NA• NumberofscholarshipofferedbytheInstitution,durationandamount:0• Criteriaforfeewaivers/scholarship:NA• EstimatedcostofBoardingandLodginginHostels:Boarding1200/year

10.Admission:

Numberofseatssanctionedwiththeyearofapproval

MCA-15,Mtech-10

NumberofStudentsadmittedundervariouscategorieseachyearinthelastthreeyears

MCA-MTECH-

NumberofapplicationsreceivedduringlasttwoyearsforadmissionunderManagementQuotaandnumberadmitted

NA

11.AdmissionProcedure:

CourseName AdmissionProcedure

Address TestAgency URL

MCA JECA KOLKATA WBJEE MTECH University

EntranceExamKalyaniUniversity KalyaniUniversity

• NumberofseatsallottedtodifferentTestQualifiedcandidateseparately(AIEEE/CET(Stateconductedtest/Universitytests/CMAT/GPAT)/Associationconductedtest)

Program TestType SeatAllotedMCA JECA 15MTECH UniversityTest 10

12.CriteriaandWeightagesforAdmission:

ForMtech:

1stclassB.Tech./B.E.inComputerScience&Engineering/ComputerScience&Technology/InformationTechnology.

Or

1stclassMCA[PrecededbyB.Sc.withHonours(45%marks)inPhysics/Mathematics/Statistics/ComputerScience/ElectronicScienceor1stclassBCA(Marks45%forSC/STand54%forOBC)oranyB.E./B.Tech.]

Or

1stclassM.Sc.inComputerScienceorequivalentdegrees

ForMCA:

Graduateorequivalentdegreeunder(10+2+3)patterninanydisciplineofaUGCrecognizedUniversity/InstituteorAICTErecognizedBE/B.Tech/BCAofaUniversity/Institute.

CandidatemusthaveMathematicsasoneofthesubjectateachlevelofeducation.

Candidateshavetosecure60%marks(45%markforSC/ST/OBC-A/OBC-Bcandidates)ateachlevelofeducation.

13.ListofApplicants

14.ResultsofAdmissionundermanagementseats:NA

15.Information of Infrastructure and Other Resources Available

• ClassandTutorialRoom,Laboratory,DrawingHallInformation

• FireSafetyCertificate:Inprocess• LibraryInformation

NoofBooks NoofTitles NoofVolumes NoofNationalJournalSubscriptions

NoofInternationalJournalSubscription

150000 3292 70370 0 10

• Laboratory and Workshopo List of Major Equipment/Facilities in each Laboratory/ Workshop

1. Two HP Work station2. Digital Electronics Trainer Kits3. AdvancePCforSoftwareDevelopment4. VLSIDesignSimulator:Cogenda

RoomNo RoomType(Mensionclassroom/lab/toilet,etc

Carpetarea(insqm)

CS-101 Classroom 38.43CS-102 Classroom 38.43CS-202 Classroom 41.71CS-303 Classroom 41.71CS-207 Classroom 62.625LB-201 ComputerLab 59.17LB-301 ComputerLab 60.41TR-203 Tutorialroom 7.5SH-101 SeminarHall 140LB-205 CommunicationLab 26.075LB-206 SensorNetworkLab 26.82LAB209 Laboratory 32.85LB-201 Laboratory 59.17LB-301 Laboratory 60.101A101 ClassRoom 91.5A102 Laboratory 23.1A103 Workshop 200A203 Laboratory 31.17A204 Laboratory 38B101 DrawingHall 92.5B102 ClassRoom 34.5B103 ClassRoom 46B104 Laboratory 50B105 ClassRoom 50B106 ClassRoom 37.4B201 Laboratory 119C101 TutorialRoom 28CR201 TutoralRoom 60.48C102 TutorialRoom 43.6

5. WirelessSensorNetworkEquipment6. ArduinoKit

o List of Experimental Setup in each Laboratory/ Workshop1. 2.

• Computing Facilities

InternetBandwidth

NumberofSystems

Configurations NumberofsystemsconnectedbyLAN

NumberofSystemsconnectedbyWAN

MajorSoftwarePackages

SpecialFacilities

1Gbps 100 I5,i3core,4GBRAM,500GBHDD

100 VLSISimulatorCogenda,Office,MicrosoftProfessional

WifiThroughoutCampus

• InnovationCell:NA• SocialMediaCell:NA• Compliance of the National Academic Depository (NAD), applicable to PGCM/ PGDM Institutions and

University Departments: NA• List of Facilities Available:

o Games and Sports Facilities: Recreation Hall, Basket Ball court , Cricket Ground, Football ground, Badminton court

o Extracurricular Activities: Academic Festival, Social, Cultural Activities, NCCo Soft Skill Development Facilities: NA

• Teaching Learning Process:o Curricula and syllabus for each of the programs as approved by the University:

MCASyllebus:

PartI,IstSemester

Paper Code

Paper Name Weekly Contact Period (WCP)

Credit

Marks

Lecture T P Total S Exam. Total

Theoretical MCA 101

Mathematical Foundation - 1 3 1 - 4 4 30 70 100

MCA 102

Introduction to Computing & C 3 1 - 4 4 30 70 100

MCA 103

Basic Electronics & Digital Logic

3 1 - 4 4 30 70 100

MCA104

Introduction to Management Functions

3 1 - 4 4 30 70 100

MCA 105

Communicative English & Business Presentation

2 2 - 4 4 10 40 (Gr. A) 100 (A+ B)

10 40 (Gr. B)

Practical MCA 101L

C Programming Lab. 0 1 3 4 3 20 P-60,V-20 100

MCA 102L

Digital Logic Lab. 0 1 3 4 3 20 P-60,V-20 100

MCA 103L

Unix & Shell Programming Lab. 0 1 3 4 3 20 P-60,V-20 100

Total Credit: 29 Total Marks: 800

Part I, 2 nd Semester Paper Code


Credit

Marks

Lecture T P Total S Exam. Total

Theoretical MCA 201

Data Structures 3 1 - 4 4 30 70 100

MCA 202

Numerical & Statistical Computing

3 1 - 4 4 30 70 100

MCA 203

Computer Organization & Architecture

3 1 - 4 4 30 70 100

MCA 204

Microprocessor 3 1 - 4 4 30 70 100

MC

Mathematical Foundation II 3 1 - 4 4 30 70 10

A 205

0

MCA 206

CBCS Course* 3 1 - 4 4 30 70 100

Practical MCA 201L

Data Structures Lab. 0 1 3 4 3 20 P-60,V-20 100

MCA 202L

Numerical Lab. 0 1 3 4 3 20 P-60,V-20 100

MCA 203L

Microprocessor Lab. 0 1 3 4 3 20 P-60,V-20 100


*CBCScoursecreditsaretobeearnedfromacourseofanotherdepartmentofuniversity

Part II, Ist Semester Paper Code


Cred it

Marks

Lecture T P Total S Exam Total

Theoretical MCA 301

Database Management Systems 3 1 - 4 4 30 70 100

MCA 302

Operating Systems 3 1 - 4 4 30 70 100

MCA 303

Theory of Computing 3 1 - 4 4 30 70 100

MCA 304

Object Oriented Programming 3 1 - 4 4 30 70 100

MCA 305

Analysis & Design of Algorithm 3 1 - 4 4 30 70 100

Practical MCA 301L

DBMS Lab. 0 1 3 4 3 20 P-60,V-20

100

MCA 302L

OOPs Lab. 0 1 3 4 3 20 P-60,V-20

100

MCA 303L

System Software Lab. 0 1 3 4 3 20 P-60,V-20

100

Total Credit:29 Total Marks: 800

PartII,2ndSemester

Paper Code


Credit

Marks


Theoretical MCA 401

Computer Graphics 3 1 - 4 4 30

70 100

MCA 402

Java & Web Technology 3 1 - 4 4 30

70 100

MCA 403

Computer Networks 3 1 - 4 4 30

70 100

MCA 404

Software Engineering 3 1 - 4 4 30

70 100

MCA 405

Artificial Intelligence 3 1 - 4 4 30

70 100

Practical MCA 401L

Graphics Lab. 0 1 3 4 3 20

P-60,V-20 100

MCA 402L

Java & Web Technology Lab. 0 1 3 4 3 20

P-60,V-20 100

MCA 403L

AI Lab. 0 1 3 4 3 20

P-60,V-20 100


PartIII,1st SemesterPaper Code


Credit

Marks


Theoretical MCA 501

Digital Image Processing 3 1 - 4 4 30 70 100

MCA 502

Elective I 3 1 - 4 4 30 70 100

MCA 503

Elective II 3 1 - 4 4 30 70 100

MCA 504

Elective III 3 1 - 4 4 30 70 100

MCA 505

Elective IV 3 1 - 4 4 30 70 100

Practical * R-Report, P- Presentation, V - Viva MCA 501L

Image Processing lab. 0 1 3 4 3 20 P-60,V-20 100

MCA 502L

Web based DBMS Lab. 0 1 3 4 3 20 P-60,V-20 100

MCA 503P

Project I(Minor) 0 0 4 4 3 P-60,V-20 100


PartIII,2ndSemesterPaper Code


Credit

Marks

Lecture T P Total

Report

Presentation

Viva

Total

Dissertation MCA-CS-

601 Project II (Project Work &

Presentation + Viva ) - - 24 24 16 200 100 1

00

400

MCA-IT-601

Grand Viva - - - - 8 - - 200

200


Total Marks for Three Year M.C.A. (6-Semesters) Course is 4700, Total Credit is 173. For sessional at least two intermediate examinations are to be taken, average mark will be the sessional marks for each subject. Corrected paper of these intermediate exams are to be returned to the respective students.

# T – Tutorial, P – Practical, S – Sessional, Th – Theory, A – Asignment, R-Report, P- Presentation, V –Viva

Elective-I 1. MCA-E/01 Soft Computing

2. MCA-E/02 Pattern Recognitions 3. MCA-E/03 Advanced DBMS

4. MCA-E/04 Parallel Processing 5. MCA-E/05 Embedded System Design

6. MCA-E/06 Simulation & Modeling 7. MCA-E/07 Mobile Computing

Elective-II 1. MCA-E/08 VLSI Design

2. MCA-E/09 Managerial Economics 3. MCA-E/10 Computational Geometry

4. MCA-E/11 Data Mining 5. MCA-E/12 Distributed Computing

6. MCA-E/13 Compiler Design 7. MCA-E/14 Graph Algorithm

Elective-III 1. MCA-E/15 Advance Data Structure 2. MCA-E/16 Network Programming

3. MCA-E/17 Remote Sensing & GIS Applications 4. MCA-E/18 Network Security

5. MCA-E/19 Real Time Operating Systems 6. MCA-E/20 Multi Object Optimization Technique

7. MCA-E/21 Computer Communication Principles

8. MCA-E/22 Managerial Economics 9. MCA-E/23 Managerial Accounting

Elective-IV 1. MCA-E/24 E-Commerce

2. MCA-E/25 Values & Professional Ethics 3. MCA-E/26 Cloud Computing

4. MCA-E/27 Bioinformatics

1stSemester

MCA-101.MATHEMATICALFOUNDATION–I

FULLMARKS:100,ContactHours:3+1+0AllottedHrs:40L

Sets, operation on sets, Cartesian products, relations equivalence relation and classes ,partition function, natural numbers, induction and inductive definition and proofs, cardinality of set-finite, infinite, countable and uncountable , diagonalisation argument.

Binary operation- Groupoid , semigroup and monoid , subgroup, coset, Lagrange‘s theorem, cyclic group, order of a group , generators, normal subgroup, quotient group, homomorphism, isomorphism ,permutation group, direct product. Rings,subrings, ideals and quotient rings, integral domains and field, fields of fraction, Euclidian domain, and unique factorization domain. Posets, Lattices and Boolean algebra

Vectors space, linear transformation, Matrices and Determination, characteristics polynomials, Eigen values. Propositional Calculus- propositions and connectives, syntax, semantics- truth assignments and truth tables, validity and satisfiability, tautology, adequate set of connectives. Introduction to Predicate calculus, Concept of quantifiers.

Text Books: 1. D.F.StanatandD.E.McAllister:DiscreteMathematicsinComputerScience.2. Fraleigh:AfirstcourseinAlgebra.

Reference Books: 1. S.D.ConteandC.DeBoor:ElementaryNumericalanalysis:AnAlgorithmicApproach.2. F.Mendelson:IntroductiontoMathematicalLogic.

MCA- 102. INTRODUCTION TO COMPUTING AND C FullMarks:100,ContactHours:3+1+0AllottedHrs:40L

*Introduction to computers and operating environment * Programdevelopmentcycle* Algorithm–RepresentationsofAlgorithm

-Pseudocode -Flowchart

*Programming Languages * IntroductiontoC* Datarepresentationanddatatypes* ControlStructures

-Conditional execution and transfers -repetitions

* Subprograms-Functions -procedures -parameter passing

* stringprocessing* Structuresandenumerateddatatypes.

-Arrays, lists, stacks. * Recordsandset*Files *Pointers *Recursion * StructuredProgramming

Text Books: 1. TennenceW.Pratt,―Programminglanguagesdesignandimplementation‖,PrenticeHallofIndia.2. AllenB.Tucker,―ProgrammingLanguages‖,TataMcGrawHill.3. GottfriedBS–ProgrammingwithC,TMHpub.4. Balagurusamy:ANSICTMH5. Kanetkar,Yashvant–UnderstandingPointersinC-2ndEdn.BPB5. Kanetkar, Yashvant - Let us C. - 3rd revised Edn. BPB

Reference Books: 1. Roosta-FoundationofProgrammingLanguages,Vikas2. Jeyapoovan-AFirstCourseinProgwithC,Vikas3. ProgrammingInC++,Y.I.ShahandM.H.Thaker,ISTE/EXCELBOOKS4. FundamentalsofProgrammingLanguages,R.Bangia,CyberTech

MCA-103. BASIC ELECTRONICS & DIGITAL LOGIC FullMarks:100,ContactHours:3+1+0AllottedHrs:40L

Introduction to electronics and electronic systems, Semiconductor and devices like diodes, BJT, FET, MOSFET, Rectifier and Filters, Transistor biasing. Small signal transistor amplifiers, Operational amplifiers, Feedback and Oscillators. Number System and Codes- Algorithms for Conversation Between Different Number System and Between Different Codes; Representation of Real Number as Fixed Point and Floating Point Signed Binary Numbers, IEEE Standards of Representation. Error Correction and Error Detection Codes. Boolean Algebra- Postulates, Fundamental Theorems and Fundamental Operations, Boolean Function and their Representation using Venn Diagrams, Truths Table and Karnaugh Maps, Duality and Complementation, Canonical SP and PS Forms. Minimization of Boolean Function through Fundamentals Theorems, Karnaugh Maps and Quine McCluskey‘s Tabular Methods. Common Combination Circuits Like Encoder / Decoder, Code Converter, Comparator, Multiplexer/Demultiplexer, Parity Generator/Check, Adder/ Subtractor Etc. Design of Combinational Circuits Using Universal Gates, Multiplexer, ROM and PLA. Introduction to Sequential Circuits, Different Types of Flip Flops and Their Characteristics and Excitation Tables , Simple Sequential Circuits Like Storage Registers Shifts Registers, Counters, Etc. Design of Binary, Decade and Modulo-N Counters. Counters using Shift Register with Feedback, Design of Finite State M/C‘s.

Text Books: 1. Givone:digitalPrinciples&design,TMH2. DigitalElectronics–Dr.SarojRangnekar,ISTE/EXCELBOOKS3. Malvino:DigitalPrinciples&applicationTMH4. Jain:ModernDigitalElectronics2/eTMH

Refrence Books: 1. Marcovitz:IntrotologicDesignTataMcgraw-hill2. DigitalIntegratedElectronics-H.Taub&D.Shilling,McGrawHill3. DigitalTechnology-VirendraKumar,NewAge4. DigitalLogicDesign-MorriesMano,PHI5. Yarbrough-DigitalLogic,Vikas6. Salivahan-DigitalCircuitsandDesign,Vikas

MCA-104 INTRODUCTION TO MANAGEMENT FUNCTIONS FullMarks:100,contacthours:3+1+0AllottedHrs:40L

Accountancy- Its origin and scope, fundamental principal of double entry system single entry system, books of original entry and prime entry, cash book and its different uses, Trial Balance, Preparation of final account and Balance sheet , Accounting for noon-trading concerns. Financial Management: Discipline and scope of Finance as distinct from accountancy, analysis of the Profit and Loss A/C and Balance Sheet, including Ratio Analysis and their implication. Fund Flow Statement. Business Budget & its control. Concept of cost and method costing their application, (IT Act)

Text Books: 1. FinancialManagementandAccounting-P.K.Jain,S.Chand&Co.2. Management&Accounting:PrinciplesandPractice-R.K.Sharma&ShashiKumarGupta,KalyaniPublishers.3. AdvancedManagementAccounting-Kaplan&Atkinson,PHI.4. FundamentalsofFinancialManagement-VanHome,PE.

Reference Books:

1. FinancialMgmtAccounting,Gupta,Pearson2. FinancialMgmt,I.M.Pandey,Vikas3. FinancialMgmt.,Khan&Jain,TMH4. FinancialMgmt,Mcmenamin,OUP5. FinancialMgmt&Policy,VanHorne,PHI6. FinancialMgmt,Kulkarni&Satyaprasad,Himalaya

MCA-105 COMMUNICATIVE ENGLISH & BUSINESS PRESENTATION FullMarks:100,ContactHours:3+0+1AllottedHrs:40L

This should cover general and technical writing, oral communication and listening skills: letter writing, technical report writing, and business communication. Expression: Practical communication skill development, business presentation with multimedia, speaking skill, prepared speech, extempore speech. Reading skill: comprehension test. Writing: Precise, technical/business letter, organization of writing material, poster presentation writing technical document, preparing software user manual, preparing project documentation.

Text Books: 1. BusinessCorrespondence&Reportwriting,Sharma,THM2. BusinessCommunicationstrategiesmonipally,THM3. EnglishforTechnicalCommunication,Laxminarayana,Scitech

Reference Books: 1. Businesscommunication,Kaul,PHI2. CommunicationSkillforEffectiveMgmt.Ghanekar,EPH

MCA-101 L. C programming Lab FullMarks:100,ContactHour:0+0+3=3

AllottedHrs:40P LabpertainingtoMCA-102

MCA-102L.DigitalLogicLab

FullMarks:100,ContactHour:0+0+3

AllottedHrs:40P LabPertainingtoMCA-103

MCA-103 UNIXLabandShellProgrammingFullMarks:100,ContactHour:0+0+3

AllottedHrs:40P

Windows basics, UNIX, Shell programming MS-DOS, MS-word, Windows/NT, MS-Excel, Power Point.

2nd Semester

MCA–201.DATASTRUCTURES

FullMarks:100,ContactHours:3L+1TAllottedHrs:40L

Data Types and Algorithms: Time and Space Analysis Of Algorithms-Order Natations: Linear Data Structures: Sequential Storage Representation-Arrays, Strings, Stacks, Queues, Dequeues and other their Applications: Linear Data Structures: Linked Storage Lists, Circularly Linked Lists, Doubly Linked Lists, Applications: Recursion-Design of Recursive Algorithms, Tail Recursion, When Not to use Recursion, Removal of Recursion; Non-Linear Data Structures: Trees, Binary Trees, Binary Search Tree, Traversals and Threads, Insertion and Deletion Algorithms, Height-Balanced and Weight-Balanced Trees, B-Trees, B+

Trees, Applications of Trees: Graphs-Representation, Sorting and Searching-Review of Various Algorithms, Hashing.

Text Books: 1. DataStructuresandAlgorithms–O.G.Kakde&U.A.Deshpandey,ISTE/EXCELBOOKS2. AhoAlfredV.,HopperoftJohnE.,UIlmanJeffreyD.,―DataStructuresandAlgorithms‖,AddisonWesley3. Drozdek-DataStructuresandAlgorithms,Vikas

Reference Books: 1. Heileman:datastructurealgorithims&OopTataMcGrawHill2. DataStructuresUsingC–M.RadhakrishnanandV.Srinivasan,ISTE/EXCELBOOKS3. WeissMarkAllen,―Algorithms,DataStructures,andProblemSolvingwithC++‖,AddisonWesley.4. HorowitzEllis&SartajSahni,―FundamentalsofDataStructures‖,GalgotriaPub.5TanenbaumA.S.,―DataStructuresusing‗C‘‖6 Ajay Agarwal: Data structure Through C.Cybertech

MCA – 202. NUMERICAL & STATISTICAL COMPUTING FullMarks:100,ContactHours:3L+1TAllottedHrs:40L

Prerequisite: A Good Knowledge of Linear Algebra and Calculus. Floating – Point Representation of Number with Finite Precision and Its Consequences. Concepts of Truncation and Round-Off Errors. Roots of Equation: Iterative Methods, Bisection Methods, False Position Method, Newton-Raphson Method, Solution of Polynomial Equation, Solution of Simultaneous Linear Equation. Gaussian Elimination, Pivoting, Ill Conditioning, Gauss-Siedel Iterative Methods, Comparison of Direct and Iterative Methods. Interpolation: Finite Differences, Polynomial Interpolation, Spline Interpolation. Differentiation & Integration: Differentiation by Polynomial Fit, Trapezoidal and Simpson Rules, Gaussian Quadrature. Numerical Solution Of Ordinary Differential Equations: Solution by Taylor Series, Euler‘s Method, Predictor Corrector Method, Rungi-Kutta Method. Statistical Methods: Sampling, Frequency Distribution. Measures of Central Tendency and Dispersion, Moments, Discrete. Distribution Binomial and Poisson Distribution, Regression Analysis/Curve Fitting, Correlation Co-Efficient, Multiple, Partial and Rank Correlations, Tests of Significance- X Test, T-Test and F-Test.

Text Books: 1. R. L. Burden and J. D. Faires: Numerical Analysis, Cengage Learning India; 09 edition 2012

Reference Books: 1. DavidKincaid&WardCheney:NumericalAnalysis,AmericanMathematicalSociety;Thirdedition(2010)2. J.StoerandR.Bulirsch:IntroductionToNumericalAnalysis,Springer(sie)(2009)

MCA – 203. COMPUTER ORGANIZATION AND ARCHITECTURE FullMarks:100,ContactHours:3L+1TAllottedHrs:40L

Introduction to basic structures and operational concepts. Instruction formats, instruction execution process and addressing modes. Stacks and subroutines. Control unit – hardwired and micro programmed control, concept of horizontal and vertical microprogramming, Nano programming. Bit-slice processors emulation. Main memory organization and memory interleaving. Memory hierarchy – virtual memory; cache memory and secondary memories. Input/output organization-memory mapped, standard (isolated) and linear selection techniques of I/O processors. Data transfer over synchronous and asynchronous buses; discussions on some standard interface buses.

A brief introduction to RISC processors and parallel processing techniques.

Text Books: 1 Hayes J. P., ―Computer Architecture & Organisationǁ, McGraw Hill, 2 Hamacher, ―Computer Organisationǁ, 3 Computer Organization and System Software, EXCEL BOOKS 4. ChaudhuriP.Pal,―ComputerOrganisation&Design‖,PHI,5. Mano,M.M.,―ComputerSystemArchitecture‖,PHI.

Reference Books: 1. Burd-SystemArchitecture,Vikas2. ComputerOrganization&Architecture(TMHWBUTSeries),Ghosh&Pal,TMH

MCA – 204. MICOPROCESSOR FullMarks:100,ContactHours:3+1+0AllottedHrs:40L

Introduction to microprocessors. Microprocessor architecture organization and programming of microprocessor inter-8085. Data transfer techniques and their implementation: programmed data transfer, DMA transfer, interrupt driven data transfer, serial and parallel communication. Some common peripherals & their interfacing: key board & display, programmable parallel interface, programmable timer, ADC & DAC etc. development aids and troubleshooting techniques: self-test concepts, memory testing techniques, single stepping technique etc. basic features of some advanced microprocessors: single chip microcomputer, 16-bit & 32-bit microprocessors, RISC & CISC concepts, idea of transputer.

Text Books: 1. KrishnaKant,―MICROPROCESSORSANDMICROCONTROLLERSArchitecture,programmingandsystemdesignusing8085,8086,8051and8096‖.PHI2007.2. DouglasVHall,―MICROPROCESSORSANDINTERFACING,PROGRAMMINGANDHARDWARE‖TMH,2006.

Reference Books: 1. MuhammadAliMazidi,JaniceGillispieMazidi,RolinD.MCKinlayThe8051MicrocontrollerandEmbeddedSystems,SecondEdition,PearsonEducation2008.2. KennethJ.Ayala,―The8086Microprocessor:Programming& InterfacingThePC‖,DelmarPublishers,2007.3. AKRay,KMBhurchandi,AdvancedMicroprocessorsandPeripherals,TMH,2007.

MCA – 205. MATHEMATICAL FOUNDATION-II FullMarks:100,ContactHours:3L+1TAllottedHrs:40L

Combinatorics- Quick review of permutations and combinations binomial thermo, multinomial theorem, principle of inclusion and exclusion. Recurrence relations (applications to recursive algorithms), linear homogeneous relations-characteristic root method (distinct and repeated roots). Generating functions ordinary and exponential. Introduction to Polya‘s theory of counting equivalence classes, burnside‘s lema. Graph theory-graphs and digraphs, subgraphs, complement, isomorphism, walks, paths, circuits, distance, connectedness and reachability, cut-sets, adjacency matrix and lists, Euler cycle trails and Hamiltonian cycle, spanning trees, Planar graphs, Kuratowski‘s Theorem, dual, independence number, clique number, chromatic number and 4-color theorem, matching. Probability and Statistics – Total and conditional probability, Distributions: Binomial, Poisson, Normal, Tabulation, Frequency Distribution, Measures of Central Tendency, Dispersion, Moments curve fitting, correlation and regression.

Text Books: 1. C.L.Liu:ElementsofDiscreteMathematics2. R.A.Brualdi:IntroductiontoCombinatorics3. J.L.Moot,A.KandelandT.P.Baker:DiscreteMathematicsforComputerScienctists.

References: 1. N.Deo:GraphTheorywithapplicationstoComputerScience2. W.Feller:IntroductiontoProbability

MCA – 201 L Data Structure Lab FullMarks:100,ContactHours:0+0+3AllottedHrs:40P LabpertainingMCA–201

MCA – 202L Numerical Lab FullMarks:100,ContactHours:0+0+3AllottedHrs:40P LabpertainingMCA–202

MCA – 203L Microprocessor Lab FullMarks:100,ContactHours:0+0+3AllottedHrs:40P LabpertainingMCA–204

3rd Semester

MCA301. DATABASEMANAGEMENTSYSTEMS


Introduction: Concept & Overview of DBMS, Data Models, Database Languages, Database Administrator, Database Users, Three Schema architecture of DBMS. Entity-Relationship Model: Basic concepts, Design Issues, Mapping Constraints, Keys, Entity-Relationship Diagram, Weak Entity Sets, Extended E-R features. Relational Model: Structure of relational Databases, Relational Algebra, Relational Calculus, Extended Relational Algebra Operations, Views, Modifications Of the Database. SQL and Integrity Constraints: Concept of DDL, DML, DCL. Basic Structure, Set operations, Aggregate Functions, Null Values, Domain Constraints, Referential Integrity Constraints, assertions, views, Nested Subqueries, Database security application development using SQL, Stored procedures and triggers. Relational Database Design: Functional Dependency, Different anamolies in designing a Database., Normalization using funtional dependencies, Decomposition, Boyce-Codd Normal Form, 3NF, Nomalization using multi-valued depedencies, 4NF, 5NF. Internals of RDBMS: Physical data structures, Query optimization : join algorithm, statistics and cost bas optimization. Transaction processing, Concurrency control and Recovery Management : transaction model properties, state serializability, lock base protocols, two phase locking. File Organization & Index Structures: File & Record Concept, Placing file records on Disk, Fixed and Variable sized Records, Types of Single-Level Index (primary, secondary, clustering), Multilevel Indexes, Dynamic Multilevel Indexes using B tree and B+ tree.

Text Books: 1. HenryF.KorthandSilberschatzAbraham,―DatabaseSystemConcepts‖,Mc.GrawHill.2. ElmasriRamezandNovatheShamkant,―FundamentalsofDatabaseSystems‖,BenjaminCummingsPublishing.Company.3. Ramakrishnan:DatabaseManagementSystem,McGraw-Hill4. GrayJimandReuterAddress,―TransactionProcessing:ConceptsandTechniques‖,MoraganKauffman

Publishers.

5. Jain:AdvancedDatabaseManagementSystemCyberTech6. DateC.J.,―IntroductiontoDatabaseManagement‖,Vol.I,II,III,AddisonWesley.7. UllmanJD.,―PrinciplesofDatabaseSystems‖,GalgottiaPublication.

Reference Books: 1. JamesMartin,―PrinciplesofDatabaseManagementSystems‖,1985,PrenticeHallofIndia,NewDelhi2. ―FundamentalsofDatabaseSystems‖,RamezElmasri,ShamkantB.Navathe,AddisonWesleyPublishingEdition3. ―DatabaseManagementSystems‖,ArunK.Majumdar,PritimayBhattacharya,TataMcGrawHill

MCA 302. OPERATING SYSTEMS FullMarks:100,ContactHours:3L+1TAllottedHrs:40L

Introduction: Introduction to OS. Operating system functions, evaluation of O.S., Different types of O.S.: batch, multi- programmed, time-sharing, real-time, distributed, parallel. System Structure: Computer system operation, I/O structure, storage structure, storage hierarchy, different types of protections, operating system structure (simple, layered, virtual machine), O/S services, system calls. Process Management: Processes: Concept of processes, process scheduling, operations on processes, co-operating processes, interprocess communication. Threads: overview, benefits of threads, user and kernel threads. CPU scheduling : scheduling criteria, preemptive & non-preemptive scheduling, scheduling algorithms (FCFS, SJF, RR, priority), algorithm evaluation, multi-processor scheduling. Process Synchronization: background, critical section problem, critical region, synchronization hardware, classical problems of synchronization, semaphores. Deadlocks: system model, deadlock characterization, methods for handling deadlocks, deadlock prevention, deadlock avoidance, deadlock detection, recovery from deadlock. Storage Management: Memory Management: background, logical vs. physical address space, swapping, contiguous memory allocation, paging, segmentation, segmentation with paging. Virtual Memory : background, demand paging, performance, page replacement, page replacement algorithms (FCFS, LRU), allocation of frames, thrashing. File Systems: file concept, access methods, directory structure, file system structure, allocation methods (contiguous, linked, indexed), free-space management (bit vector, linked list, grouping), directory implementation (linear list, hash table), efficiency & performance. I/O Management: I/O hardware, polling, interrupts, DMA, application I/O interface (block and character devices, network devices, clocks and timers, blocking and nonblocking I/O), kernel I/O subsystem (scheduling, buffering, caching, spooling and device reservation, error handling), performance. Disk Management : Disk structure, disk scheduling (FCFS, SSTF, SCAN,C-SCAN) , disk reliability, disk formatting, boot block, bad blocks. Protection & Security:Goals of protection, domain of protection, security problem, authentication, one time password, program threats, system threats, threat monitoring, encryption.

Text Books: 1. MilenkovieM.,―OperatingSystem:Concept&Design‖,McGrawHill.2. TanenbaumA.S.,―OperatingSystemDesign&Implementation‖,PracticeHallNJ.3. SilbersehatzA.andPetersonJ.L.,―OperatingSystemConcepts‖,Wiley.4. Dhamdhere:OperatingSystemTMH

Reference Books: 1. Stalling,William,―OperatingSystems‖,MaxwellMcMillanInternationalEditions,1992.2. DietelH.N.,―AnIntroductiontoOperatingSystems‖,AddisonWesley.

MCA 303. Theory of Computing Full Marks: 100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Finite automata, regular expressions, push-down automata, context free grammars, pumping lemmas.

Turing machines, Church-Turing thesis, decidability, halting problem, reducibility, recursion theorem.

Introduction to Language Processors: Interpreters, Compilers, Assemblers; overview of a compiler, Elements of Formal Language Theory, Regular Grammars and Regular Expressions, Lexical Analyzer, Context free grammar and parsing techniques, Shift reduce parsing operator, Precedence parsing, Top-down parsing, predictive parsers, LR parsers; Intermediate code generation, symbol tables, code optimization, code generation, error detection and recovery.

Text Books: 1. Principlesofcompilerconstruction–Aho,Ullman2. Compilers–Aho,Sethi,andUllman3. SystemSoftware–AnIntroductiontoSystemProgramming–L.L.Beck2e,AddisonWesley4. Systemprogramming&OS–D.M.Dhamdere–T.M.H.

Reference Books: 1. SystemsProgramming–J.J.Donovan,McGrawHill2. StructuredSystemProgramming–Welsh&Mckeag,EEE,andPHI.3. UNIX&BorlandCManuals.

MCA 304. OBJECT ORIENTED PROGRAMMING FullMarks:100,ContactHours:3L+1TAllottedHrs:40L

History of the development of object-oriented programming languages, object-attributes and methods, message passing, Classes: Notion of abstraction, encapsulation/information hiding and modularity, Instantiation and initialization of objects: Constructors and destructor, Class hierarchy: single, multilevel, multiple and repeated inheritance, polymorphism, Object hierarchy – Aggregation; Advantages and disadvantages of object-oriented programming language, Features of C++.

Text Books: 1. Jana,C++&ObjectOrientedProgramming,PHI2. FolkM.J.,ZoellickB.,RiccardG.:FileStructures:AnObject-OrientedApproachwithC++

Reference Books: 1. HerbertSchild:TheCompleteReferencetoC++,OsborneMcGrawHill.McGrawHillEducation(India)PrivateLimited;4edition2. BjarneStroustrup:Programming:PrinciplesandPracticeUsingC++,AddisonWesley;2edition3. JamesRRumbaugh,MichaelR.Blaha,WilliamLorensen,FrederickEddy,WilliamPremerlani.:ObjectOrientedModelingandDesign,PrenticeHall;1edition

MCA305. ANALYSIS AND DESIGN OF ALGORITHMS FullMarks:100,ContactHours:3L+1TAllocationHrs:40L

Basic concepts – complexity measures, worst and average case, upper and lower bounds. Algorithm design principles – divide and conquer, recursion, greedy method, dynamic programming. Bounds for selecting and sorting – finding maximum, finding minimum and quick sort, radix sort. Union – Find algorithms

Graph algorithms – Breadth first search, depth first search, topological sort, connected and biconnected components, Minimum spanning trees – Kruskal‘s and Prim‘s, shortest paths – Dijkstra‘s, Bellman-Ford‘s and Floyd-Warshall‘s. Algebraic algorithms – evaluation of polynomials, Strassen‘s matrix multiplication. Pattern matching algorithms.

Text Books: 1. U.Manber:IntroductiontoAlgorithms2. T.Cormen,C.LeisersonandR.Rivest:IntroductiontoAlgorithms3. RandomisedalgorithmsbyR.Motwani&P.Raghavan,CambridgeUniversityPress,1995,ISBN0-521-47465-5.

Reference Books: 1. TextalgorithmsbyM.Gochemore&W.Rytter,OxfordUniversityPress,1994.2. AnalysisofalgorithmsbyM.Hofri,OxfordUniversityPress,1995.

MCA 301 L. DBMS LAB (Web Based) FullMarks:100,ContactHours:0+0+3AllottedHrs:40P LabpertainingMCA-301

MCA 302 L. OOPS Lab FullMarks:100,ContactHours:0+0+3AllottedHrs:40P LabpertainingMCA-304

MCA 303 L. System Software Lab FullMarks:100,ContactHours:0+0+3AllottedHrs:40PLabpertainingMCA-303

4th Semester:

MCA-401.COMPUTERGRAPHICS


Display Devices : Line and point plotting systems; raster, vector, pixel and plotters, Continual refresh and storage displays, Digital frame buffer, Plasma panel displays, Very high resolution devices, High-speed drawing, Display processors, Character generators, Colour-display techniques (Shadow-mask and penetration CRT, colour look-up tables. analog false colours, hard-copy colour printers.) Display Description : Screen co-ordinates, user co-ordinates; Graphical data structures (compressed incremental list, vector list, use of homogeneous co-ordinates); Display code generation; Graphical functions; The view algorithms, two-dimensional transformation. Interactive Graphics : Pointing and positioning devices (cursor, light pen, digitizing tablet, the mouse, track balls). Interactive graphical techniques; Positioning, Elastic Lines, Inking, Zooming, Panning, Clipping, Windowing, Scissoring. Graphic Languages : Primitives (constants, actions, operators, variables), plotting and geometric transformations, display subroutines. 3-D Graphics: Wire-frame perspective display, Perspective depth, Projective transformations, Hidden line and surface elimination, Transparent solids, Shading. GKS is to be used as the standard teaching tool.

Text Book: 1. HearnD.,BakerP.M.:ComputerGraphics,Prentice-Hall,1986.2. JamesD.Foley,AndriesvanDam,StevenK.FeinerandJohnHughesComputerGraphics:PrinciplesandPractice,Addison-WesleyProfessional;3rdedition.

Reference Books: 1. Akenine-Moller, Tomas, Eric Haines and Naty Hoffman. Real-Time Rendering. 3rd ed. A K Peters/CRC

Press, 2008 3. Peter Shirley, Michael Ashikhmin, Steve Marschner : Fundamentals of Computer Graphics, A K Peters/CRC Press; 3 edition (21 July 2009)

MCA 402 Java and Web Technology Full Marks:100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Java Programming: Fundamentals of Object-Oriented Programming, Java Evolution, Overview of Java Language, Constants, Variables, and Data Types, perators and Expressions, Decision making and Branching, Decision making and Looping, Classes, Objects and Methods, Arrays, Strings and vectors, Interfaces, Multiple Inheritances, Packages: Putting Classes Together, Multithreaded Programming, Managing Errors and Exceptions, Applet Programming, Graphics Programming, Managing Input/output Files in Java. Internet-working concept and architectural Model: Introduction, application level Interconnection, network level interconnection, properties of the Internet, Internet architecture, Interconnection through IP gateways or routers. Internet and intra-net. Internet address: Introduction, Universal identifiers, three primary classes of IP addresses, Classless IP address, network and broadcast address, mapping internet addresses to physical addresses (ARP): ARP protocol format transport gateways and sub net addressing, multi-cast addressing. Internet Protocol: Internet architecture and philosophy, the concept of unreliable delivery, connectionless delivery system, the Internet datagram, routing direct and indirect delivery. Table driven IP routing. Protocol layering, reliable stream transport(TCP), TCP performance. Bootstrap protocol (BOOTP). Routing: The origin of gateway routing tables, original Internet architecture and cores, core gateways, automatic route propagation, vector distance(Bellman-Ford) routing gateway-t gateway protocol (GGP), autonomous system concept, exterior gateway protocol (EGP), interior gateway protocol (RIP, OSPF, HKELO ): routing information protocol (RIP), the hello protocol, combining RIP, Hello and EGP, routing with partial information. Application: Remote Login (TELNET, Rlogin): Side, Forcing the server to read a control function, TELNET options, TELNET option navigation, Electronic mail (822, SMTP and POP): Electronic mail, Mailbox names and aliases, the relationship of inter-networking and mail. Interment Management (SNMP, COMP) protocols, Electronic Data Interchange. WWW. CGI, PERL ASP, Core Java, XML, E- commerce.

Text Books: 1. ShellyPowersetal.,DynamicWebPublishing,Techmedia,1998.2. JamieJaworski,Java1.2Unleashed,Techmedia,1998.3. RobertNileset.al.,CGIbyExamples,Que,1996.

Reference Books: 1. ScotJohnsonet.al.,UsingActiveServerPages,Que,,InformationTechnology.2. WebTechnologiesbyAchyutSGodboleandAtulKahat

MCA 403. Computer Networks F.M.100,ContactHours:3L+1TAllottedHrs:40L

Communications: Concepts of data transmission, signal encoding, modulation methods, synchronization, multiplexing and concentration, coding method, cryptography. Networks: Communication system architecture OSI reference model, topology types, selections, design, local area networks(LAN), CSMA/CD, token bus token ring techniques, link level control(LLC) protocols, HDLC, analysis of protocols and performance, concepts in network layer, switching techniques, routing methods. TCP/IP, Session, Presentation and Application Layers function. Data communication fundamentals-signals and communication channels. Baseband communication, modulation and MODEMS. Channel sharing techniques -FDM, TDM, polling and concentration. Error Detection -CRC codes, Framing techniques. Stop- and-wait (PAR) protocol with efficiency analysis.

Network structure and architecture-communication subnet and local access. Circuit, message and packet switching. Elementary queuing theory (results only) with network applications. OSI reference model. Local area networks-Ethernet and token ring LANS. Network layer services and functions. Routing techniques. Network access protocols-X.25 and IP. Important functions of transport, session and presentation layers-TCP and ISO protocols. Network application-file transfer and file servers, electron mail, virtual terminals, and distributed systems.

Text Book: 1. BehrouzAForouzan,DeAnzaCollegeFirouzMosharraf:ComputerNetworks:ATop-DownApproach,McGrawHillEducation(India)PrivateLimited(11November2011)2. ComerDE.,InternetworkingWithTCP/IPPrinciples,Protocols,AndArchitecture,PHI(2013)

References Books: 1. TanenbaumA.S.,DavidJ.Wetherall:ComputerNetwork,Pearson;Pearson;5edition2. StallingW.:DataandComputerCommunication,Pearson;Ninethedition(2013)3. PetersonLL,DavieBS,ComputerNetworks:ASystemsApproach,MorganKaufmannPublishersIn;5thRevisededitionedition4. Stevens,UNIXNetworkProgramming,PearsonEducation;1STedition(2003)

MCA- 404 SOFTWARE ENGINEERING FullMarks:100,ContactHours:3L+1TAllottedHrs:40L

Introduction to software engineering, concept of a software project, size factor, quality and productivity factor, different phase of a software development life cycle, managerial issues. Software project planning: Problem definition, development of a solution strategy, development process planning, software development models and their comparative study; Organizational structure planning, project formats and team structures; Planning for quality assurance and configuration management; Planning for verification and validation. Software economics: Cost estimation and evaluation techniques, cost estimation based on COCOMO model and Raleigh model. Software requirements analysis and specifications techniques- their notations & languages. Software design: Concept of fundamental design; Design approaches- top-down & bottom-up, structured, object-based & object oriented design; Design specification and notations. Software implementation: Structured coding techniques, coding styles, and standards; Guidelines for coding and documentation. Software verification and validation: Theoretical foundation, black box and white box approaches; Integration and system testing. Software reliability: Definition and concept of reliability, software faults, errors, repair and availability, reliability and availability models.

Text Books: 1. Pressman,R.S.,SoftwareEngineering:APractitioner‘sApproach,McGrawHill.2. RajibMall:FundamentalsofSoftwareEngineering,PrenticeHallIndiaLearningPrivateLimited;Fourthedition(2April2014)

Reference Books: 1. IanSommerville:SoftwareEngineering,PearsonEducation;Ninethedition(2013)2. Fairley,R.E.,SoftwareEngineeringConcepts,McGrawHillEducation(India)PrivateLimited(23April2001)

MCA- 405 ARTIFICIAL INTELLIGENCE FullMarks:100,ContactHours:3L+1TAllottedHrs:40L

Introduction – What is AI – Importance of AI – objectives. Introduction to LISP and PROLOG. Knowledge – Its representation, Organization – Manipulation and Acquisition.

Predicate calculus in AI – First order predicate logic & its use in knowledge representation-Resolution principle. Use of resolution in reasoning and question answering. Production systems and search strategies production system and its variants-Heuristic search methods, AND/OR Graphs and AO Algorithm. Searching Game Tree. Uncertainly Management-Fuzzy logic, Bayesian inferencing, dempster-shafer theory of beliefs, structured representation of knowledge- - Semantic networks, frames, conceptual dependency & scripts. Expert systems-rule based system architecture non-production system architecture-knowledge acquisition methods- Explanation methods-Expert system shells, Application of AI in natural language processing, speech understanding. Computer Vision, planning, etc.

Text Books: 1. ArtificialIntelligence,Ritch&Knight,TMH2. ArtificialIntelligenceAModernApproach,StuartRusselPeterNorvigPearson3. IntroductiontoArtificialIntelligence&ExpertSystems,Patterson,PHI4. Poole,ComputationalIntelligence,OUP5. Logic&PrologProgramming,SarojKaushik,NewAgeInternational

Reference Books: 1. ExpertSystems,Giarranto,VIKAS2. ArtificialIntelligence,Russel,Pearson

MCA 401 L. Graphics Lab. FullMarks:100,ContactHours:0+0+3AllottedHrs:40pLabpertainingMCA-401

MCA 402 L. Java & Web Technology Lab Full Marks: 100, Contact Hours: 0 + 0 + 3 Allotted Hrs: 40 P Lab pertaining MCA-402

MCA403L.AlLab.

FullMarks:100,ContactHours:0+0+3AllottedHrs:40PLabpertainingMCA-403

5th Semester

MCA501.DIGITALIMAGEPROCESSING

F.M.100,ContactHours:3L+1TAllottedHrs:40L

Introduction : Digital Image representation; Fundamental steps in Image processing, Elements of digital Image processing systems. Digital Image Fundamentals: Sampling and quantization, Imaging geometry. Image Transforms: Fourier, Walsh, Hademord, discrete cosine and Hotelling transforms and their properties. Image Enhancement: Enhancement by point processing, spatial filtering, Frequency domain enhancement, Color image processing. Image Restoration: Unconstrained and constraint restoring, inverse filtering, Wiener Filter, Geometric transforms. Image Compression: Image Compression models, Error-free compression, Lossy compression, Image compression standards. Image Segmentation: Detection of discontinuities, edge linking, Thresholding. Representations and Descriptions: Chain codes, shape numbers, moments and Fourier and other descriptors. Recognition & Interpretations.

Text Book: 1. DigitalImageProcessing,Gonzalves,Pearson2. DigitalImageProcessing,Jahne,SpringerIndia3. DigitalImageProcessing&Analysis,Chanda&Majumder,PHI4.FundamentalsofDigitalImageProcessing,Jain,PHI

References Books: 1. ImageProcessing,Analysis&MachineVision,Sonka,VIKAS2. GettingStartedwithGIS-ClarkeKeith.C;PE.3. Concepts&TechniquesofGIS-LoC.P,Albert,YeungK.W-PHI.

MCA 502. Elective I F.M.100,ContactHours:3L+1TAllottedHrs:40L

MCA503 ElectiveII


MCA504 ElectiveIII


MCA505 ElectiveIV


MCA501L. ImageProcessingLabFullMarks:100,ContactHours:0+0+3

AllottedHrs:40P LabpertainingtoMCA-501

MCA 502 L. Web based DBMS Lab. Full Marks: 100, Contact Hours: 0+0+3 AllottedHrs:40P LabpertainingtoMCA-502

MCA 503 P. Project 1(Minor) FullMarks:100,ContactHours:0+0+3AllottedHrs:40P

MCA-E/01SoftComputingF.M.100,ContactHours:3L+1TAllottedHrs:40L

Introduction: Introduction to soft computing; introduction to biological and artificial neural network; introduction to fuzzy sets and fuzzy logic systems. Introduction to Genetic Algorithm, Genetic Operators and Parameters, Genetic Algorithms in Problem

Solving, Theoretical Foundations of Genetic Algorithms, Implementation Issues. Artificial neural networks and applications: Different artificial neural network models; learning in artificial neural networks; neural network applications in control systems. Neural Nets and applications of Neural Network. Fuzzy systems and applications: fuzzy sets; fuzzy reasoning; fuzzy inference systems; fuzzy control; fuzzy clustering; applications of fuzzy systems. Neuro-fuzzy systems: neuro-fuzzy modeling; neuro-fuzzy control. Applications: Pattern Recognitions, Image Processing, Biological Sequence Alignment and Drug Design, Robotics and Sensors, Information Retrieval Systems, Share Market Analysis, Natural Language Processing.

Text Books: 1. M.Mitchell:AnIntroductiontoGeneticAlgorithms,Prentice-Hall.2. J.S.R.Jang,C.T.SunandE.Mizutani:Neuro-FuzzyandSoftComputing,PHI, PearsonEducation.3. TimothyJ.Ross:FuzzyLogicwithEngineeringApplications,McGraw-Hill.4. DavisE.Goldberg:GeneticAlgorithms:Search,OptimizationandMachineLearning,AddisonWesley.

Reference Books: 1. S.RajasekaranandG.A.V.Pai:NeuralNetworks,FuzzyLogicandGenetic Algorithms,PHI.2. D.E.Goldberg:GeneticAlgorithmsinSearch,Optimization,andMachineLearning,Addison-Wesley.

MCA-E/02 Pattern Recognitions F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Introduction - Definitions, data sets for Pattern Recognition Different Paradigms of Pattern Recognition Representations of Patterns and Classes Metric and non-metric proximity measures Feature extraction, Different approaches to Feature Selection Nearest Neighbor Classifier and variants Efficient algorithms for nearest neighbour classification Different Approaches to Prototype Selection Bayes Classifier, Decision Trees, Linear Discriminant Function Different Approaches to Prototype Selection, Bayes Classifier Decision Trees, Linear Discriminant Function Support Vector Machines, Clustering, Clustering Large datasets, Combination of Classifiers, Applications - Document Recognition.

Text Books: 1. DeviV.S.;Murty,M.N.(2011)PatternRecognition:AnIntroduction,UniversitiesPress, Hyderabad.2. R.O.Duda,P.E.HartandD.G.Stork,PatternClassification,Wiley,2000.

Reference Books: 1. PatternRecognitionPaperbackbyNarasimhaMurthyandSusheelaDevi2. PatternRecognitionandMachineLearning(InformationScienceandStatistics)byChristopherBishop

MCA-E/03 Advanced DBMS F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Distributed DBMS features and needs. Reference architecture. Levels of distribution transparency, replication. Distributed database design –fragmentation, allocation criteria. Storage mechanisms. Translation of global queries. / Global query optimization. Query execution and access plan. Concurrency control – 2 phases locks. Distributed deadlocks. Time based and quorum based protocols. Comparison. Reliability- nonblocking commitment protocols. Partitioned networks. Checkpoints and cold starts. Management of distributed transactions- 2 phase unit protocols. Architectural aspects. Node and link failure recoveries. Distributed data dictionary management. Distributed database administration. Heterogeneous databases-federated database, reference architecture, loosely and tightly coupled. Alternative architecture. Development tasks, Operation- global task management. Client server databases -SQL server, open database connectivity. Constructing an application.

Text Books: 1. DatabaseSystemConcepts,SilberschatzKorth,Sudarshan,MH2. DatabaseManagementSystems,Ramakrishnan,MH3. BeginningSQLServer2000programming,Dewson,SPD/WROX

Reference Books: 1. DatabaseManagementSystems,Leon,VIKAS2. MySQL:EnterpriseSolutions,AlexenderPachev,WileyDreamtech

MCA-E/04 Parallel Processing F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Introduction to Parallel Processing, Parallelism in sequential Mechanics, Abstract model, Multiprocessor architecture, Architecture classifications and Techniques. Pipelining, Arithmetic and Instruction Pipelines, Pipelining Hazard. Interconnection Networks, Hyper cubes, Shuffle Exchanges, Trees, Meshes and Butterfly networks, parallel Algorithm for, linear Algebra, Matrix Multiplication, solving linear systems, probabilistic algorithm, possibility of super linear speedup, Sorting, Vector and Array Processors. Shared Memory Programming, general model of shared Memory Programming, Thread management, attributed, Thread implementation Java Threads. Parallel Processing – Operating Systems for parallel Processors, types, tools and languages Parallel Programming Languages – FORTRAN 90 (Introduction) Characterization of Distributed Systems – Introduction, Examples of Distributed Systems, Resource sharing and the Web, Challenges. Message passing Model, programming model, PVM, Remote procedure Call – parameter passing, Java Remote Method Invocation Other parallelism paradigms – Data Flow Computing, Systolic Architecture.

Text Books: 1. ScientificComputing,Anintroductionwithparallelcomputing:GeneGolub/JamesM.Ortega2. Introductiontoparallelprocessing:MSasikumar,DineshS.,P.RaviPrakesh:PHI,2002.

Reference Books: 1. ParallelComputing,Quinn,TMH2. IntroductiontoParallelProcessing,SashiKumar,PHI3.ParallelProgramming,Wilkinson,Pearson4.ElementsofParallelComputing,Rajaraman,PHI5.FundamentalsofParallelProcessing,Jordan,PHI6. Advanced Computer Architecture, Hwang, TMH

MCA-E/05 Embeded System Design F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Introduction: Characteristics of embedded systems; Applications; Concept of real time systems; Challenges in embedded system design. Embedded Processors: Review of structure of a basic computer system: CPU, memory, I/O devices on a bus; Memory System Mechanisms – Caches, Memory Management Units and Address Translation; I/O subsystem – input and output devices, busy-wait I/O, interrupt driven I/O; Interrupts – Basics, interrupt latency; Co-processors; Processor Performance Enhancement-Pipelining, Superscalar execution, caching. The Embedded Computing Platform: Board Buses – Bus Arbitration and Timing; The CPU Bus; Memory Devices and their Characteristics – Random-Access memories, Read-Only memories; I/O devices – Timers and Counters, Watchdog timers, GPIO, A/D, D/A, Displays, Keyboards; Component Interfacing – Memory interfacing, device interfacing, interfacing protocols; Designing with processors – System architecture, Hardware design; Target Devices-FPGA, CPLD. Embedded Software Architectures: Round-Robin; Round-Robin with Interrupts; FunctionQueue-Scheduling Architectures; Real-Time Operating System Architecture; Selecting an Architecture. Real-time operating systems: Tasks and Task States; Tasks and Data; Context Switching-Cooperative multitasking, Preemptive multitasking; Scheduling Policies-Rate-Monotonic scheduling, Earliest-Deadline- First scheduling, RMS versus EDF; Semaphores and Shared Data; Message Queues; Timer Functions; Events; Memory Management; Priority Inversion; Interrupt Routines in an RTOS Environment. Low-power computing: Sources of energy consumption: toggling, leakage – Instruction-level nstrategies for power-management: functional unit management - Memory system power consumption: caches, off-chip memory - Power consumption with multiple processes – Systemlevel power management: deterministic, probabilistic methods. Hardware Accelerators: CPUs and Accelerators – Why Accelerators, Accelerator Design; Accelerated System Design – Performance Analysis, System Architecture Framework, Partitioning, Scheduling and Allocation, System Integration and Debugging. Networked embedded systems: Why networked embedded systems - Example networked embedded systems: automobiles, factory automation systems - Types of network fabrics - Network performance analysis - Internet-enabled embedded systems. Design and Development of Embedded Systems: Creating an Embedded System Architecture; Implementing the Design - Embedded Software Development Tools, Host and Target Machines, Linker/Loader for Embedded Software, Getting Embedded Software into Target System, Debugging Techniques and Tools, Testing on the host machine, instruction set simulators, oscilloscopes, logic analyzers, in-circuit emulators, monitors, System Boot-Up; Quality Assurance and Testing of the Design.

Text Books: 1. FrankVahid,TonyGivargis:EmbeddedSystemDesign:AUnifiedHardware/SoftwareIntroduction,Wiley;Studentedition(21July2006)2. MazidiM.Ali,MazidiJ.G.,andRolinMcKinlay,The8051MicrocontrollerandEmbeddedSystems;Pearson;Secondedition(2008)

Reference Books : 1. WayneWolf,ComputersasComponents:PrinciplesofEmbeddedComputingSystemDesign,MorganKaufmann;2edition(June16,2008)2. DavidE.Simon,EmbeddedSoftwarePrimer,,Addison-WesleyProfessional;1edition(August15,1999)3. RajKamal:EmbeddedSystems;McGraw-HillEducation(India);2ndEdition(March9,2009)

MCA-E/06 Simulation and Modeling F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

System and system environment, components of system, discrete and continuous System, static and dynamic systems, model of a system, steps required in deriving a model of a system. Verification and validation of simulation model, stochastic nature of the output data. Introduction to the simulation, why and when simulation is an appropriate tool, advantages and disadvantages of Simulation, Areas of application, general steps followed in simulation experiment. Simulation of continuous system, description of continuous model using differential equations, chemical reactor system, integration vs. simulation, selection of integration formula, other examples of continuous system simulation, water reservoir system. Discrete system simulation, fixed time step vs. next event models, use of random numbers. test of randomness, generation of non uniform random numbers, Monte-Carlo vs. stochastic simulation. Simulation of queuing system, elements of queuing theory, Poisson arrival pattern, negative exponential service time, simulation of single server queue, two severs queue and more general queues. Simulation of PERT, network model of project, critical path computation, uncertainties in the activity durations, normal PERT calculations, simulation of activity network, comparison of normal PERT calculation and calculation through simulations. Simulation of inventory system, elements of inventory theory, more complex inventory models, examples of simulation of inventory system : with respect to service level considerations and minimum cost considerations, generation of Erlang distributed variates. simulation languages, continuous and discrete simulation languages, features of some popular simulation languages : SIMSCRIPT, GPSS, SIMULA etc. Factors in selection of simulation language.

Text Books: 1. Gorden,G.:SystemSimulation,ParenticeHall,1978

2. PayerT.A.:IntroductiontoSimulation,McGraw-Hill,19823. Reitman,J.:ComputerSimulationApplication,Wiley,19714. Spriet,W.A.:Computer-aidedModelingandSimulation,AcademicPress,1982

Reference Books: 1. Barnes,B.:ModellingandPerformancemeasure,mentofComputerSystems,1982

2. Deo,N.:SystemsSimulationwithDigitalComputer,PrenticeHall,NewDelhi,19793. BanksJ.,CarsonIIJ.S.,NelsonB.L.:Discrete-EventsystemSimulation,PrenticeHall,NewDelhi,1996

MCA-E/07 Mobile Computing F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Introduction, enabling concepts for mobile and personal communications. Terminal mobility, personal mobility and service mobility. The Intelligent Networks (IN) concept: Mobile and personal communication: Past, Present & Future some related network aspects. Mobile computing Architecture: History of computers, History of internet, Internet – The ubiquitous Network Architecture for mobile computing, Three tier Architecture, Design considerations for mobile computing, Mobile computing through Internet, Making existing applications mobile enabled. The cellular concept and its initial implementations: The cellular concept, Multiple access technologies for cellular systems, Cellular system operation and planning (General principles, System Architecture, Location updating and call setup), Handoff and power control. Initial implementations of the cellular concept: The AMPS system, TACS system, NMT system, NTT system, concluding remarks. Digital cellular mobile systems: Introduction, GSM : The European TDMA digital cellular standard, GSM standardization and service aspects GSM reference architecture and function partitioning, GSM radio aspects, Security aspects, GSM protocol model, Typical call flow sequences in GSM, Evolutionary directions for GSM IS-136 : The North American TDMA digital cellular standard(D-AMPS), Background on North American digital cellular, Service aspects of D-AMPS(IS- 136), Network reference, Radio aspects, Security aspects, Protocol model and typical flow sequences, Evolutionary directions

Text Book: 1. MobileCommunicationsbyJochenSchiller,2ndEdition,PearsonEducationLimited2. MobileandPersonalCommunicationsystemsandservices,RajPandya,PrenticeHallofIndia,2001.

Reference Books: 1 1. T.S.Rappaport:WirelessCommunications:PrinciplesandPractice,2ndEdition,PHI2. StefanoBasagni,MarcoConti,SilviaGiordano,IvanStojmenovic:MobileAdHocNetworking:TheCuttingEdgeDirections,Wiley-IEEEPress;2edition(March4,2013)

MCA-E/08 VLSI Design F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Review of Microelectronics and Introduction to MOS Technologies: MOS, CMOS, BiCMOS Technology. Basic Electrical Properties of MOS, CMOS & BiCMOS Circuits: Ids – Vds relationships, Threshold Voltage VT, Gm, Gds and ωo, Pass Transistor, MOS, CMOS & Bi CMOS Inverters, Zpu/Zpd, MOS Transistor circuit model, Latch-up in CMOS circuits. Layout Design and Tools: Transistor structures, Wires and Vias, Scalable Design rules, Layout Design tools. Logic Gates & Layouts: Static Complementary Gates, Switch Logic, Alternative Gate circuits, Low power gates, Resistive and Inductive interconnect delays. Combinational Logic Networks: Layouts, Simulation, Network delay, Interconnect design, Power optimization, Switch logic networks, Gate and Network testing. Sequential Systems: Memory cells and Arrays, Clocking disciplines, Design, Power optimization, Design validation and testing. Floor Planning: Floor planning methods, Global Interconnect, Floor Plan Design, Off-chip connections.

Text Book: 1. EssentialsofVLSICircuitsandSystems,K.EshraghianEshraghian.D,A.Pucknell,2005,PHI.2. ModernVLSIDesign–WayneWolf,3rdEd.,1997,PearsonEducation.

Reference Books: 1. IntroductiontoVLSISystems:ALogic,CircuitandSystemPerspective–Ming-BOLin,CRCPress,2011.2. PrincipalsofCMOSVLSIDesign–N.H.EWeste,K.Eshraghian,2ndEd.,AddisonWesley.

MCA-E/09 Managerial Economics F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

The Fundamentals of Managerial Economics: Goals and Constraints The Nature and Importance of Profits Understanding Incentives Economic rationality,Scarcity and opportunity cost Marginal and IncrementalAnalysis Basic Calculus: The Calculus of Optimization. Theory of Demand: Demand and Supply Market Equilibrium Price Ceilings and Price Floors Comparative Statics: Changes in Demand and Supply. Price Elasticity of Demand Price Elasticity, Total Revenue, and Marginal Revenue Factors Affecting Price Elasticity Cross Price Elasticity. Income Elasticity of Demand Other Elasticities ,Elasticities for Nonlinear Demand Functions. Elasticity of Supply Demand Forecasting Choice and Utility Theory Law of Diminishing marginal utility Consumer Equilibrium Indifference curve Analysis Consumer Surplus Price effect,Substitution Effect and Income Effect. Theory of Production and Cost:

The Production Function Profit-Maximizing Input Usage. Isoquants and Isocosts Cost Minimization and Optimal Input Substitution. The Cost Function Breakeven analysis, Contribution analysis Long-run Costs and Economies of Scale Multiple Cost Functions and Economies of Scope. Learning curve. Theory of Market and pricing: The Nature of Industry Perfect Competition Monopoly Monopolistic Competition Oligopoly Game theory Product pricing.

Text Books: 1. YogeshMaheswari,ManagerialEconomics,PhiLearning,Newdelhi,2005GuptaG.S.2. ManagerialEconomics,TataMcgraw-Hill,NewDelhiMoyer&Harris.

Reference Books: 1. AnagerialEconomics,CengageLearning,Newdelhi,2005Geetika,Ghosh&Choudhury,,2. ManagerialEconomics,TataMcgrawhill,Newdelhi,2011

MCA-E/10 Computational Geometry F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

The following list of topics is very tentative. Depending on time, some topics may be added or dropped, and the order of topics may change.

Preliminaries: Basic Euclidean geometry Grids and Hulls: Fixed-radius near neighbors, convex hull algorithms, dominance and applications. Linear Programming: Half-plane intersection and randomized LP, backwards analysis, applications of low-dimensional LP. Intersections and Triangulation: Plane-sweep line segment intersection, triangulation of monotone subdivisions, plane-sweep triangulation of simple polygons. Point Location: Kirkpatrick's method, trapezoidal decompositions and analysis, history DAGs. Voronoi Diagrams: Basic definitions and properties, Fortune's algorithm. Geometric Data Structures: kd-trees, range trees and range searching, segment trees. Delaunay Triangulations: Point set triangulations, basic definition and properties, randomize incremental algorithm and analysis. Arrangements and Duality: Point/line duality, incremental construction of arrangements and the zone-theorem, applications. Geometric Approximation: Dudley's theorem and applications, well-separated pair decompositions and geometric spanners, VC dimension, epsilon-nets and epsilon-approximations, Geometric Retrieval: kd-trees, range trees, hereditary segment trees, nearest neighbor searching.

Text Books: 1. M.deBerg,M.VanKreveld,M.Overmars,andO.Schwarzkopf,ComputationalGeometry:AlgorithmsandApplications(3rdEdition),Springer,2008.2. F.PreparataandM.Shamos,ComputationalGeometry,Springer-Verlag,1985.3. K.Mulmuley,ComputationalGeometry:AnIntroductionTroughRandomizedAlgorithms,Prentice-Hall,1994.4. J.O‘Rourke,ComputationalGeometryinC,2nded.,CambridgeUniv.Press,1998.

Reference Books: 1. K.Mulmuley,ComputationalGeometry:AnIntroductionThroughRandomizedAlgorithms,PrenticeHall,1994.2. T.Cormen,et.al.,IntroductiontoAlgorithms,2nded.,MITPress,2001.3. J.O‘Rourke,ArtGalleryTheoremsandAlgorithms,OxfordUniv.Press,1987.4. R.MotwaniandP.Raghavan,RandomizedAlgorithms,CambridgeUniv.Press,1995.

MCA-E/11 Data Mining F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Data Warehousing Concept of Data Warehouse, Differences between Operational Databases and Date Warehouse, Multi-dimensional Data Model, Schemas for Multi-dimensional Databases, Data Cube Representations, Data Warehouse Architecture, OLTP vs OLAP, Efficient Query Processing in data Warehouses, Indexing of OLAP data, Meterialization concept; Data Mining Data Clustering: Partitioning, Hierarchical, Density-based, Grod Based and Model Based Methods; Classification & Prediction: Decision Tree Techniques, Back-Propagation Method, Bayesian Method Association Rule Mining Techniques: Frequent Itemset Generation, Apriori, Horizontal Method, Sampling Approach, Hashing Approach; Dynamic Association Rule Mining; Mining of Complex Types of Data: Mining of Spatial Databases, Multimedia Databases, Timeseries and sequence Data, Text Databases, WWW Data;

Text Book: 1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining, Pearson; 1 edition (May 12, 2005)

Books/References: 1. Jiawei Han and Micheline Kamber: Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers In; 3rd Revised edition edition (25 July 2011)

MCA-E/12 Distributed Computing F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Fundamentals: Evolution of Distributed Computing Systems, System models, issues in design of Distributed Systems, Distributedcomputing environment, web based distributed model, computer networks related to distributed systems and web based protocols. Message Passing: Inter process Communication, Desirable Features of Good Message-Passing Systems, Issues in IPC by Message, Synchronization, Buffering, Multidatagram Messages, Encoding and Decoding of Message Data, Process Addressing, Failure Handling, Group Communication. Remote Procedure Calls: The RPC Model, Transparency of RPC, Implementing RPC Mechanism, Stub Generation, RPC Messages, Marshaling Arguments and Results, Server Management, Communication Protocols for RPCs, Complicated RPCs, Client-Server Binding, Exception Handling, Security, Some Special Types of RPCs, Lightweight RPC, Optimization for Better Performance. Distributed Shared Memory:

Design and Implementation issues of DSM, Granularity, Structure of Shared memory Space, Consistency Models, replacement Strategy, Thrashing, Other Approaches to DSM, Advantages of DSM. Synchronization: Clock Synchronization, Event Ordering, Mutual Exclusion, Election Algorithms. Resource and Process Management: Desirable Features of a good global scheduling algorithm, Task assignment approach, Load Balancing approach, Load Sharing Approach, Process Migration, Threads, Processor allocation, Real time distributed Systems. Distributed File Systems: Desirable Features of a good Distributed File Systems, File Models, File Accessing Models, File-shearing Semantics, Filecaching Schemes, File Replication, Fault Tolerance, Design Principles, Sun‘s network file system, Andrews file system, comparison of NFS and AFS. Naming: Desirable Features of a Good Naming System, Fundamental Terminologies and Concepts, Systems-Oriented Names, Name caches, Naming & security, DCE directory services. Case Studies Mach & Chorus (Keep case studies as tutorial)

Books: 1. DistributedOSbyPradeepK.Sinha(PHI)2. GeorgeCoulouris,JeanDollimore,TimKindberg,GordonBlair:DistributedSystemsConceptsandDesign,AddisonWesley;5edition

Reference Books: 1. TanenbaumS.:DistributedOperatingSystems,PearsonEducation2. TanenbaumS.MaartenV.S.:DistributedSystemsPrinciplesandParadigms,(PearsonEducation)

MCA-E/13 Compiler Design F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Compiler Structure & Lexical Analysis Compiler Structure: Compilers and Translators, Analysis- Synthesis Model of Compilation, Various Phases of Compiler, Pass Structure, Bootstrapping & Compiler Construction Tools. Lexical Analysis: Interface with input, parser and symbol table, token, lexeme and patterns, difficulties in lexical analysis, Error Reporting, Regular definition, Transition diagrams, LEX. Capabilities of Lexical Analyzer Finite Automata: Nondeterministic Finite Automata, Deterministic Finite Automata, Subset Construction, Thompson‘s construction, DFA State Minimization. The Syntactic Specification of Programming Languages: CFG, Derivation and Parse tree, Ambiguity, Capabilities of CFG. Basic Parsing Techniques: Top-Down parsers with backtracking, Recursive Descent Parsers, Predictive Parsers, No recursive Predictive Parsers, Bottom–up Parsers, Shift-Reduce Parsing, Operator Precedence Parsers, LR parsers. YACC, Syntax Directed Definitions, Type checking.

Text Books: 1. AlfredVAho,JeffreyD.Ullman:―PrinciplesofCompilerDesign‖,NarosaPubl.House.2. A.V.Aho,R.SethiandJ.DUllman:―Compiler:principle,TechniquesandTools‖,AddisonWesley.

Reference Books: 1. CompilerConstruction:PrinciplesandPractice,KennethC.Louden,PWSPublishing,1997,ISBN0-534-93972-4.2. TremblayandSorenson:"ThetheoryandPracticeofCompilerWriting"–McGrawHill.

MCA-E/14 Graph Algorithm F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

PageRank algorithm. DFS, BFS, Tarjan's algorithm for strongly connected components. Representation of graphs.

Maze and river network simulation via invasion percolation case study. Minimum spanning trees, Prim- Dijkstra-Jarnik algorithm, Boruvka's algorithm, Kruskal's algorithm.

DAGs and topological ordering.

Road map path planning case study. Shortest paths, relaxation algorithms, Dijkstra's algorithm, Bellman- Ford algorithm, Johnson's algorithm.

A* algorithm, Euclidean distance based distance estimation, landmark-based distance estimation.

Transportation scheduling case study. Euler tours. Travelling salesman problem. Exponential-time dynamic programming for the TSP, approximation algorithms and the approximation ratio, MST-doubling heuristic, Christofides' heuristic.

Baseball elimination case study. Maximum flow problem, minimum cut problem, max-flow min-cut theorem, augmenting path (Ford-Fulkerson) algorithm.

Medical school residency assignment case study. Matchings, stable marriage, Gale-Shapley algorithm for stable marriage.

Bipartite graphs, formulating bipartite maximum matching as a flow problem, Hopcroft–Karp algorithm.

Using matchings to find vertex covers and independent sets, partition into a minimum number of rectangles.

Graph coloring, greedy coloring, interval graphs, and perfect graphs. Chordal graphs and using Lexicographic breadth-first search to find an elimination ordering.

Cliques, Moon-Moser bound on maximal cliques, Bron-Kerbosch algorithm.

Planar graphs; review of planarity-related topics from earlier weeks (graph drawing, road maps, invasion percolation via minimum spanning trees of grid graphs, graph coloring and the four-color theorem).

Duality, duality of Euler tours and bipartiteness, Euler's formula, greedy 6-coloring, Boruvka in linear time. Planarity testing, and Fáry's theorem.

Text Books: 1. IntroductiontoGraphTheory(DoverBooksonMathematics)2ndEditionbyRichardJ.Trudeau.2. Graphs,Algorithms,andOptimization(DiscreteMathematicsandItsApplications)byWilliamKocayandDonaldL.Kreher.

Reference Books: 1. AlgorithmDesign1stEdition,byJonKleinbergandÉvaTardos2. ThetextbookAlgorithms,4thEditionbyRobertSedgewickandKevinWayne

MCA-E/15 Advanced Data Structure F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Complexity of algorithms: worst case, average case, and amortized complexity. Algorithm analysistechniques,AmortizedAnalysis,Garbagecollection,AnalysisofQuicksort,FibonacciHeaps,vanEmdeBoasTrees,Multithreaded Algorithms, Number Theoretic Algorithms, Strings and StringMatching Algorithms,ComputationalGeometry,LowerBoundTheory–NPCompleteness,ApproximationAlgorithms.Non-linearData Structure: Trees - Binary Trees, Traversals and Threads, Binary Search Trees, Insertion andDeletionalgorithms,Height-balancedandweight-balancedtrees,B-trees,B+-trees,Applicationoftrees;Graphs-Representations,Breadth-firstandDepth-firstSearch.

Text Books: 1. A.V.Aho,J.E.Hopcroft,andJ.D.Ullman,DataStructuresandAlgorithms,AddisonWesley,ReadingMassachusetts,USA,1983.2. DonaldKnuth.TheArtofComputerProgramming:FundamentalAlgorithms,ThirdEdition.Addison-Wesley,1997.ISBN0-201-89683-43. DonaldKnuth.TheArtofComputerProgrammingVolume3:SortingandSearching,ThirdEdition.Addison-Wesley,1997.ISBN0-201-89685-0.

Reference Books: 1. ThomasH.Cormen,CharlesE.Leiserson,RonaldL.Rivest,andCliffordStein.IntroductiontoAlgorithms,ThirdEdition.MITPressandPHI,2010.2. Samet,Hanan,Foundationsofmultidimensionalandmetricdatastructures.MorganKaufmann,2006,ISBN978-0-12-369446-1.3. DineshMehtaandSartajSahniHandbookofDataStructuresandApplications,ChapmanandHall/CRCPress,2007.4. M.A.Weiss,DataStructuresandAlgorithmsAnalysisinC++,Benjamin/Cummins,RedwoodCity,California,USA,1994

MCA-E/16 Network Programming F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Introduction to networking and Internet protocols via programming and hands-on labs. TCP/IP protocol architecture; user datagram protocol (UDP); multicasting; transmission control protocol (TCP); standard Internet services, and protocol usage by common Internet applications. Sockets programming; client/server; peer-to-peer; Internet addressing; TCP sockets; UDP sockets; raw sockets. Multithreading and exception handling. Finger, DNS, HTTP, and ping clients and servers. Routers and architectures, routing protocols.

Router and switch configurations, Internet operating systems. Internetwork setup, network topology, wireless internetworking.

Network protocol analyzers; traffic generation.

Text Books:

1. Stevens,UNIXNetworkProgramming,PearsonEducation;1STedition(2003)2. BehrouzAForouzan,DeAnzaCollegeFirouzMosharraf:ComputerNetworks:ATop-DownApproach,McGrawHillEducation(India)PrivateLimited(11November2011)

Reference Books: 1. ComerDE.,InternetworkingWithTCP/IPPrinciples,Protocols,AndArchitecture,PHI(2013)2. StallingW.:DataandComputerCommunication,Pearson;Ninethedition(2013)

MCA-E/17 Remote Sensing and GIS Apllications F.M.100, Contact Hours: 3L + 1T AllottedHrs:40L

Introduction: Sun and atmosphere, Remote Sensing a historical perspective. Electromagnetic Radiations: EM radiators, polarization, attenuation. Thermal radiations, EM for remote sensing. Fundamental of Radiometry. Physical Basics of Signatures: Signature OIR, TIR & Microware Region Remote Sensor: Classifications of Sensors, Sensor parameters. Resolution- Spatial & Spectral Optical, Microwave Sensors Platform: Principle of Sattelite Motion, Types of orbit, Orbit perturbations. GPS – Data Products: Dataformats, data product generation output media Date analysis: Visual analysis, Digital Classifications Application of Remote Sensing: Agriculture, Forestry, Land Cover Studies Water Resource, Earth System Science Geographical Interaction System Application.

Text Books: 1. PeterBurrough,RachaelA.McDonnell,PrinciplesofGeographicalInformationSystems,OUPOxford;3rdedition(2015)2. MarbleDFandCalcins,H.W.,BasicReadingsinGeographicInformationSystem.SpadSystemsLtd.Refrence Books: 1. Burrough,P.A.,PrinciplesofGISforlandResourceAssesment,Oxfordpublications2. JefferyStarandJohnEstates,GeographicInformationSystems,AnIntroductory,PrenticeHallInc.

MCA-E/18 Network Security F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services (Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability) and Mechanisms, A model for Internetwork security, Internet Standards and RFCs, Buffer overflow & format string vulnerabilities, TCP session hijacking, ARP attacks, route table modification, UDP hijacking, and man- in-the-middle attacks.

Conventional Encryption Principles, Conventional encryption algorithms, cipher block modes of operation, location of encryption devices, key distribution Approaches of Message Authentication, Secure Hash Functions and HMAC.

Public key cryptography principles, public key cryptography algorithms, digital signatures, digital Certificates, Certificate Authority and key management Kerberos, X.509 Directory Authentication Service.

Email privacy: Pretty Good Privacy (PGP) and S/MIME.

IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security Payload, Combining Security Associations and Key Management.

Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS), Secure Electronic Transaction (SET).

Basic concepts of SNMP, SNMPv1 Community facility and SNMPv3. Intruders, Viruses and related threats.

Firewall Design principles, Trusted Systems. Intrusion Detection Systems.

Text Books: 1. NetworkSecurityEssentials(ApplicationsandStandards)byWilliamStallingsPearsonEducation.2. HackProofingyournetworkbyRyanRussell,DanKaminsky,RainForestPuppy,JoeGrand,DavidAhmad,HalFlynnIdoDubrawsky,SteveW.ManzuikandRyanPermeh,WileyDreamtech

Reference Books: 1. NetworkSecurityandCryptography:BernardMenezes,CENGAGELearning.2. NetworkSecurity-PrivateCommunicationinaPublicWorldbyCharlieKaufman,RadiaPerlmanandMikeSpeciner,Pearson/PHI.3. CryptographyandnetworkSecurity,Thirdedition,Stallings,PHI/Pearson4. PrinciplesofInformationSecurity,Whitman,CengageLearning.

MCA-E/19 Real Time Operating Systems F.M.100,ContactHours:3L+1TAllottedHrs:40L

REVIEW OF OPERATING SYSTEMS Basic Principles – System Calls – Files – Processes – Design and Implementation of processes – Communication between processes – Operating System structures. DISTRIBUTED OPERATING SYSTEMS Topology – Network types – Communication – RPC – Client server model – Distributed file system – Design strategies. REAL TIME MODELS AND LANGUAGES Event Based – Process Based and Graph based Models – Petrinet Models – Real Time Languages – RTOS Tasks –RT scheduling - Interrupt processing – Synchronization – Control Blocks – Memory Requirements. REAL TIME KERNEL Principles – Design issues – Polled Loop Systems – RTOS Porting to a Target – Comparison and study of RTOS VX works and COS – Case studies. RTOS APPLICATION DOMAINS RTOS for Image Processing – Embedded RTOS for voice over IP – RTOS for fault Tolerant Applications – RTOS for Control Systems.

TEXT BOOKS: 1. Tanenbaum,―DistributedOperatingSystems‖,PearsonEducation.2. RaymondJ.A.Bhur,DonaldL.Bailey,―AnIntroductiontoRealTimeSystems‖,PHI1999.

REFERENCE BOOKS 1. CharlesCrowley,―OperatingSystems-ADesignOrientedapproach‖,McGrawHill1997.2. C.M.Krishna,Kang,G.Shin,―RealTimeSystems‖,McGrawHill,1997.

MCA-E/20 Multi Object Optimization Technique F.M.100, Contact Hours: 3L + 1T AllottedHrs:40L

Linear Programming: Mathematical model, assumptions of linear programming, graphical solution, simplex method, Dual simplex method, Applications, Sensitivity analysis. Introduction to integer programming, Branch and Bound techniques. Special types of linear programming problems - transpolation and assignment models. Traveling saleman problem, Applications. Introduction to Dynamic programming: Deterministic and probabilistic Dynamic programming. Network Analysis, Shortest Route problem, Applications. Project Scheduling in PERT-CPM. Diagram representation, critical path calculation, time chart, resource leveling, cost consideration in project scheduling, project control, Applications.

Sequencing models and its applications. Replacement models and its applications.

Text Books: 1. TAHA,H.A.:OperationsResearchMacmillan,NewYork(1987).2. Gillet,B.E.:IntroductiontoOperationsResearch-aComputerOrientedAlgorithmic-Approach.McGraw-Hill(1976).

Reference Books: 1. Churchman,C.W.andArnchoffE.L.:IntroductiontoOperationsResearchJohnWileyandsons.2. Srinath,L.S.:LinearProgramming,East-West,NewDelhi.

MCA-E/21 Computer Communication Principles F.M.100, Contact Hours: 3L + 1T AllottedHrs:40L

Amplitude and Frequency Modulation – their generation and detection Bandwidth requirements Low Power and High Modulators and Modulated amplifiers. Superheterodyne detection. Signal to Noise ratio of A.M. and P.M. transmission. A/D, D/A Converters. Shannon‘s sampling Theorem. PAM, PWM, PPM and PCM. Their generation and detection. Digital Modulation : ASK, FSK, PSK performance evaluation. Time Division Multiplexing and Demultiplexing. Modems, Error control and coding, Channel capacity. Data Transmission Synchronization, Data protection, error detection and correlation. Elements of Satellite Communication tracking and control.

Text Books: 1. TaubH.andShillingD.L.,―PrinciplesofCommunicationSystems‖,2/e,TMH2. CarlsonR.B.,―CommunicationSystems,4/e,Mc.GrawHill3. LathiB.P.,―CommunicationSystems‖,JohnWiley.

Reference Books: 1. Kennedy—ElectronicCommunicationSystems,4/e,TMH2. HaykinS.S.,―AnIntroductiontoAnalogandDigitalCommunicationSystems‖,WileyEastern.

MCA-E/22 Managarial Accounting F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Financial Accounting – An Introduction: Introduction , Meaning of Accountancy, book-keeping and Accounting , Accounting Process, Objectives for accounting , Differences between book-keeping and accounting Users of accounting information , Limitations of Accounting , Basic terminologies

Accounting Concepts, Principles, Bases and Policies: Introduction , Accounting Concepts, Principles, Policies and Standards, Types of accounting concepts - Business Separate entity concept - Going concern concept - Money measurement concept - Periodicity concept - Accrual concept, Accounting Principles - Principle of Income recognition - Principle of expense - Principle of matching cost and revenue - Principle of Historical costs - Principle of full disclosure - Double aspect principle - Modifying Principle - Principle of materiality - Principle of consistency - Principle of conservatism or prudence, Accounting Policies - Changes in Accounting Policies - Disclosure in case of changes in Accounting Policies, Accounting Standards - Scope and functions of Accounting Standards Board - International Financial Reporting System

Double Entry Accounting: Introduction , Meaning of double entry accounting, Classification of accounts under Traditional approach, Classification of accounts under Accounting Equation approach, Comparison of traditional approach with Modern approach equal approach, Accounting Trail , Transactions and events , Meaning and roles of debit and credit , Accounting equation

Secondary Books: Introduction , Secondary books , Purchases Book/Purchases Day book - Cash discount, Trade discount - Difference between cash discount and trade discount, Sales Book or Sales Day book - Purchase Returns Book - Sales Returns Book, Bills receivable book - Bills payable book - Cash book , Posting to Ledger accounts Posting to Ledger

Trial Balance: Introduction , Meaning , Objectives of preparing a trial balance , Methods of preparing a trial balance, Preparation of Trial balance, Adjusting Entries , Errors and their rectification, Errors disclosed by Trial Balance , Errors not disclosed by Trial Balance , Steps to locate the errors

Final Accounts: Introduction , Adjustments before preparing final accounts , Depreciation , Bad Debts and accounting treatment of bad debts , Provision for doubtful debts , Reserves for Discount on Debtors , Reserve for Discount on Creditors , Closing Stock, Trading Account , Profit and Loss Account, Balance Sheet

Introduction to Management Accounting: Introduction, Meaning of Management accounting ,The Role of Management Accounting , Management Accounting Framework , Functions of Management Accounting ,Tools of Management Accounting ,The Balanced Scorecard , Cost Management System , Value Added Concept , Merits of Management Accounting , Demerits of Management Accounting , Distinction between Management Accounting and Financial Accounting

Financial Statement Analysis: Introduction , Meaning of Ratio , Steps in Ratio Analysis, Classification of Ratios , Du Pont Chart , Solved Problems , Advantages of Ratio Analysis, Limitation of Ratio analysis

Funds Flow Analysis: Introduction, Meaning of Funds Flow Statement, Ascertainment of flow of funds, Technique of preparing funds flow statement, Schedule of Changes in Working Capital, Adjusted Profit and Loss account, Funds Flow Statement Cash Flow Analysis: Introduction, Meaning of Cash Flow Statement, Purpose of Cash Flow Statement , Preparation of Cash Flow Statement, Format of Cash Flow Statement (AS3: Revised Method) , Cash Flow from Operating Activities , Cash Flow Statement under Direct Method , Different between Cash Flow Analysis and Fund Flow Analysis, Uses of Cash Flow Statement

Understanding Cost: Introduction, Meaning of Cost, Objective of Costing, Methods of Costing, Technique of Costing, Classification of Cost, Elements of Cost, Statement of Cost Sheet, Solved Problems

Marginal Costing and Break Even Analysis: Introduction , Concept of Marginal Costing , Characteristics of Marginal Costing , Difference between Absorption Costing and Marginal Costing , Marginal Cost, Contribution , Cost Volume Profit (CVP) Analysis , Break Even Chart , Break Even Point, Profit Volume ratio or MCSR , Target profit , Margin of Safety , Application of Marginal cost , Limitations of Marginal cost, Solved Problems

Decisions Involving Alternative Choices: Introduction, Decision Making, Types of Costs, Types of Choices Decisions, Make or Buy Decisions, Addition / Discontinuance of a Product line, Sell or Process Further, Operate or Shut down, Exploring New Markets, Maintaining a desired level of profit

Budgetary Control: Introduction , Meaning of a Budget , Budgetary control , Objectives of budgetary control, Merits of budgetary control, Essential features of Budgetary Control , Steps in budgetary Control , Types of Budgets , Cast Budget , Flexible Budget , Limitation of Budget Control

Standard Costing: Introduction , Definition of Standard Costing, Meaning, Difference between Standard cost and Budgetary Control, Establishment of standards, Variance analysis, Material cost variance, Material price variance, Material usage variance , Material Mix variance, Material Yield variance, Direct labor variance, Labor Efficiency Variance, Labor Rate variance, Labor mix variance, Labor Yield Variance

Text Books: 1. ManagerialAccounting,ISV(WSE)Paperback–2012byJamesJiambalvo2. ManagerialAccounting5thEditionbyJohnWildandKenShaw

Reference Books: 1. ManagerialAccounting,14thEdition14thEditionbyRayGarrison(Author),EricNoreen(Author),PeterBrewer2. ManagerialAccounting,2ndEdition,RamjiBalakrishnan

MCA-E/24 E-Cmmerce F.M.100,ContactHours:3L+1TAllottedHrs:40L

Computer Systems in Electronic Business Business Process Re-Engineering Electronic commerce Policy and Theory Supply Chain Management Customer Relationship Management International trading network & communication protocols Electronic payment standards E-Commerce strategy, Marketing and Business Processes.

Text Books: 1. E-Commerce&managerialPerspective,Joseph,PHI2. ECommerce,Rayport,TMH

Reference Books: 1. ECommerce,Diwan&Sharma,EXCEL2. Creating&winningE-Business,Napier,VIKAS

MCA-E/25 Values & Professional Ethics F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Science, Technology and Engineering as Knowledge and as Social and Professional Activities. Effects of Technological Growth: Rapid Technological growth and depletion of resources. Reports of the Club of Rome. Limits to growth; sustainable development. Energy Crisis; Renewable Energy Resources. Environmental degradation and pollution. Eco-friendly Technologies. Environmental Regulations. Environmental Ethics. Appropriate Technology Movement of Schumacher: later developments. Technology and developing nations. Problems of Technology transfer. Technology assessment/ impact analysis; Industrial hazards and safety, safety regulations safety engineering. Politics and technology, authorization versus democratic control of technology; Human Operator in Engineering projects and industries. Problems of man machine interaction. Impact of assembly line and automation. Human centred Technology. Ethics of Profession:Engineering profession: Ethical issues in engineering practice. Conflicts between business demands and professional ideals. Social and ethical Responsibilities of Technologists. Codes of professional ethics. Whistle blowing and beyond. Case studies: Profession and Human Values, Value Crisis in contemporary society. Nature of values: Value Spectrum of a ‗good‘ life Psychological values: Integrated personality; mental health. Societal values: The

modern search for a ‗good‘ society, justice, democracy, secularism, rule of law; values in Indian Constitution. Aesthetic values: Perception and enjoyment of beauty, simplicity, clarity Moral and ethical values: Nature of moral judgments; canons of ethics; Ethics of virtue; ethics of duty; ethics of responsibility. Work ethics, professional ethics.

Text Books: 1.Blending the best of the East & West, Dr. Subir Chowdhury, EXCEL 2.Ethics & Mgmt. & Indian Ethos, Ghosh, VIKAS 3.Business Ethics,Pherwani,EPH

Reference Books: 1. Ethics,IndianEthos&Mgmt.,Balachandran,Raja,Nair,ShroffPublishers2. BusinessEthics:conceptandcases,Velasquez,Pearson

MCA-E/26 Cloud Computing F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Defining a Cloud, Cloud Types - NIST model, Cloud Cube model, Deployment models (Public , Private, Hybrid and Community Clouds), Service models - Infrastructure as a Service, Platform as a Service, Software as a Service with examples of services/ service providers, Cloud Reference model Characteristics of Cloud Computing - a shift in paradigm Benefits and advantages of Cloud Computing A brief introduction on Composability, Infrastructure, Platforms, Virtual Appliances, Communication Protocols, Applications, Connecting to the Cloud by Clients IaaS - Basic concept, Workload, partitioning of virtual private server instances, Pods, aggregations, silos PaaS - Basic concept, tools and development environment with examples SaaS - Basic concept and characteristics, Open SaaS and SOA, examples of SaaS platform, Identity as a Service (IDaaS), Compliance as a Service (CaaS)

Text Books: 1. CloudComputingBiblebyBarrieSosinsky,WileyIndiaPvt.Ltd,20132. MasteringCloudComputingbyRajkumarBuyya,ChristianVecchiola,S.ThamaraiSelvi,McGrawHill3. Education(India)PrivateLimited,2013

Reference Books: 1. Cloudcomputing:Apracticalapproach,AnthonyT.Velte,TataMcgraw-Hill2. CloudComputing,Miller,Pearson3. Buildingapplicationsincloud:Concept,PatternsandProjects,Moyer,Pearson

MCA-E/27 Bioinformatics F.M.100, Contact Hours: 3L + 1T Allotted Hrs: 40 L

Introduction: Definitions, Sequencing, Biological sequence/structure, Genome Projects, Pattern recognition an prediction, Folding problem, Sequence Analysis, Homology and Analogy. Protein Information Resources, Biological databases, Primary sequence databases, Protein Sequence databases, Secondary databases, Protein pattern databases, and Structure classification databases. Genome Information Resources DNA sequence databases, specialized genomic resources DNA Sequence analysis Importance of DNA analysis, Gene structure and DNA sequences, Features of DNA sequence a nalysis, EST (Expressed Sequence Tag) searches, Gene hunting, Profile of a cell, EST analysis, Effects of EST data on DNA databases

Pair wise alignment techniques Database searching, Alphabets and complexity, Algorithm and programs, Comparing two sequences, subsequences, Identity and similarity, The Dotplot, Local and global similarity, different alignment techniques, Dynamic Programming, Pair wise database searching. Multiple sequence alignment Definition and Goal, The consensus, computational complexity, Manual methods, Simultaneous methods, Progressive methods, Databases of Multiple alignments and searching Secondary database searching Importance and need of secondary database searches, secondary database structure and building a sequence search protocol Analysis packages Analysis package structure, commercial databases, commercial software, comprehensive packages, packages specializing in DNA analysis, Intranet Packages, Internet Packages

Text Books: 1. Bioinformatics-ABeginner‘sGuide,Jean-MichelClaveriw,CerdricNotredame,WILEYDreamTechIndiaPvt.Ltd2. SequenceAnalysisinANutshell,ScottMarkel&DarrylLeon,O‘REILLY

Reference Books: 1. MolecularCellBiologybyDaidBaltimar2. AurtherM.Lesk,IntroductiontoBioinformatics,OxfordUniversityPress,4thedition(2014)3. DanE.KraneandMichaelL.Raymer,FundamentalConceptsofBioinformaticsKraneandRaymer,DORLINGKINDERSLEY(RS);Firstedition(2003)4. DavidMount:Bioinformatics:SequenceandGenomeAnalysis,CBS;2edition(2005)

6th Semester

MCA-CS601Project(Projectwork+Presentation) FullMarks:400(300+100)MCA-IT601 GrandViva FullMarks:200

MTEchSyllebus:

SemesterI

Paper Code


Cre -dit

Marks

Lecture T# P# Total S# Exam. Total

Theoretical CSE 101

Advanced Operating Systems 3 1 0 4 4 20 80 100

CSE 102

Soft Computing & Digital Image Processing

3 0 1 4 4 20 80 100

CSE 1

Advanced Mathematics 3 1 0 4 4 20 80 100

03 CSE 104

Advanced Computer Architecture

3 1 0 4 4 20 80 100

CSE 105

Advanced Design and Analysis of Algorithm

3 1 0 4 4 20 80 100

Practical # T – Tutorial, P – Practical, S – Sessional, ^Th – Theory, A - Assignment CSE 101

L Soft Computing & Image

Processing Lab. - - 6 6 4 20 A-

20,P- 50,V-30

100


SemesterII

Paper Code


Cre -dit

Marks

Lecture T P Total S Exam.

Total

Theoretical CSE 201 Advanced Network Security &

TCP/IP Programming 3 0 1 4 4 20 P-20 T

h- 60

100

CSE 202 Mobile & Wireless Computing 3 1 0 4 4 20 80 100

CSE 203 Advanced Database Systems 3 0 1 4 4 20 P-20 Th- 60

100

CSE 204 E Elective I(CS) 3 1 0 4 4 20 80 100

CSE 205 E Elective II (IT) 3 1 0 4 4 20 80 100

CSE 206 CBCS Course* 3 1 0 4 4 20 80 100

Practical CSE 201 L Advanced Communication

Lab. 0 0 6 6 4 20 A-20,P-

50,V-30 100


*CBCScoursecreditsaretobeearnedfromacourseofanotherdepartmentofuniversity

Semester III Paper Code


Cre -dit

Marks

Lecture T P Total S Exam

Total

Theoretical CSE 301

Remote Sensing GIS, GPS 4 0 0 4 4 20 80 100

CSE 302 E

Elective III (CA) 3 0 1 4 4 20 P-20

Th- 60

100

CSE 303 D

Thesis I - - 18 18 12 R-100, P-100, V- 100*

300

Practical * R-Report, P- Presentation, V - Viva CSE 301

L Satellite Image Processing &

GIS Lab - - 6 6 4 20 A-

20,P- 50,V-30

100


SemesterIV

Paper Code


Credit

Marks

Lecture T P Total

Report

Presentation V

iva Total

Dissertation CSE 401D Thesis II - - 24 24 16 200 100 100 400 CSE 402S Seminar - - - - 6 30 30 40 100

CSE 403GV

Grand Viva - - - - 6 - - 100 100


TotalMarksforTwoYear(4-Semesters)M.Tech.(CSE)Courseis2500,TotalCreditis104.

Forsessionalatleasttwointermediateexamsaretobetaken,averagemarkwillbethesessionalmarksfor each subject. Corrected paper of these intermediate exams is to be returned to the respectivestudents.TopicmustbedifferentforeachstudentsinSeminar.

Elective I(Computer Science (CS)) 1. Parallel Architecture/Processing and Grid

Computing 2. Theory of Programming Languages/Computing

3. Real Time Systems 4. Pattern Recognition

Elective II(Information Technology (IT)) 1. Web Mining and Internet Technology 2. Data Warehousing and Data Mining 3. Management Information Systems 4. Advanced Software Engineering

5. Data Compression & Error Correction 6. Optical Networks

7. Embedded Systems

Elective III(Computer Application (CA)) 1. Bioinformatics

2. Artificial Intelligence and Expert Systems 3. VLSI Technology

4. Speech & Natural Language Processing 5. Network Administration

6. Cloud Computing 7. Authentication & Steganography

SubjectCode:CSE101AdvanceOperatingSystems

Distributed Systems – Hardware and Software concepts – Design issues; Communication in Distributed systems : Layered protocols - ATM networks - Client Server model – Remote Procedure Calls.

Synchronization : Clock synchronization – Mutual exclusion – Election algorithms, - Atomic transactions – Deadlocks; Processes : Threads – System models – processor allocation – Scheduling – Fault tolerance – Real time distributed systems.

Shared memory : Consistency models – Page based distributed shared memory – Shared variables – Object based distributed shared memory; Distributed File Systems : Design and Implementation.

Case Study: Introduction to Amoeba – Object and Capabilities – memory management – Communication – Amoeba Servers.

Text Books: 1. MukeshSinghal,NiranjanGShivratri,“AdvancedConceptsinOperatingSystems”,McGrawHillInternational,1994.2. SilbersehatzA.andPetersonJ.L.,“OperatingSystemConcepts”,Wiley.

Reference Books: 1. AndrewSTanenbaum,“DistributedOperatingSystems“,PearsonEducationIndia,2001.2. PradeepKSinha,“DistributedOperatingSystemsConceptsandDesign“,PHI,2002.

Subject Code: CSE 102 SoftComputing&DigitalImageProcessing

SoftComputing

Fuzzy Logic and Approximate Reasoning: Conventional and fuzzy sets: Basic concepts of fuzzy logic Fuzzy expressions: Basic principles of fuzzy logic and fuzzy inference rules, fuzzy relations, fuzzy operators, realization of fuzzy systems using fuzzy relations Application of fuzzy logic in vision, pattern recognition, robotics and linguistics. Approximate reasoning in Experts Systems, Fuzzy sets in approximate reasoning, Fuzzy propositions in approximate reasoning. Transition Modifier rules, Basic principles of approximate reasoning and rules of inference. Genetic Algorithms (GAs): Introduction to GAs, Binary encodings of candidate solutions, Schema Theorem and Building Block Hypothesis, Genetic operators – crossover and mutation, parameters for GAs, Reproduction mechanism for producing Offspring, Darwinian Principle in evaluating objective function. Convergence Analysis: Simple GA schemes, Stochastic models: GA approaches to optimization problems.

Basic Concepts and Principles of Neural Networks ( NNs ) and Learning Systems. Learning with GAs and Artificial NNs ( ANNs ); Composite use of Fuzzy Logic, ANNs and GAs. Neurocomputing: Models of Neurocomputing: (a) Perceptron Training, (b) Back propagation learning, (c) Hopfield nets, (d) Adaptive resonance theory I & II, (e) Self-organizing feature map, (f) ADALINE. Applications in pattern classification and image understanding. Chaos Theory, Fusion of Neuro, Fuzzy, GA & Chaos theory & Applications to simple problems.

Text Books: 1. DavidE.Goldberg:GeneticAlgorithmsinSearch,OptimizationandMachineLearning,AddisionWesley,MA,1989.2. S.Haykin:NeuralNetworks-AComprehensiveFoundation,MacmillanCollegePublishingCompany,NewYork,1994.3.H. J. Zimmermann: Fuzzy set theory and its application, 2nd revised edition, Allied Publishers Ltd. 4. G. J. Klir, B. Yuan: Fuzzy sets and Fuzzy logic: Theory and Applications, PHI, 1995. 5.R. L. Devaney: An Introduction to Chaotic Dynamical Systems, 2nd Ed. Addision Wesley, 1989. 6. AnIntroductiontoGeneticAlgorithms–M.Mitchell.7. GeneticAlgorithms–K.F.Man,K.S.TangandS.Kwong.8. GeneticAlgorithms+DataStructures=EvolutionPrograms–Z.Michalewicz.9. AdaptationinNaturalandArtificialSystems-J.H.Holland.10. GeneticAlgorithms:forVLSIDesign,Layout&TestAutomation–P.MazumderandE.MRudnick.

Reference Books: 1. Neuro-FuzzyandSoftComputing:AComputationalApproachtoLearningandMachineIntelligence-J.S. R. Jang C. T. Sun and E. Mizutani. 2. TheoryandPracticeofUncertainProgramming–B.Liu.3. FuzzyLogicfortheApplicationstoComplexSystems–W.ChiangandJ.Lee.4. FuzzyLogicwithEngineeringApplications–T.J.Ross.5. NeuralNetworkandFuzzySystems:ADynamicalSystemsApproachtoMachineIntelligence–B.Kosko.

Digital Image Processing

Light,Luminance, Brightness and Contrast, Eye, Monochrome vision model, Image processing problems and applications, Vision , camera, Digital processing system, 2-D sampling theory, Aliasing , Image quantization, Lloyd Max Quantizer, Dither, Color images, Linear systems and shift invariance, Fourier Transform, Z- Transform, Matriz theory results, Block matrices and Kronecker products.

2-D orthogonal and Unitary transforms , 1-D and 2-D DFT , Cosine , Sine , Walsh Hadamard , Haar , Slant , Karhunen-loeve , Singular value decomposition transforms.

Point operations – contrast stretching , clipping and thresholding, density slicing, Histogram equalization , modification and specification , spatial operations – spatial averaging , low pass , high pass , band pass filtering, direction smoothing , medium filtering , generalized ceptrum and homomorphic filtering , edge enhancement using 2-D IIR and FIR filters , color enhancement.

Image observation models, sources of degradation, inverse and Wiener filtering , geometric mean filter , non linear filters , smoothing splines and interpolation , constrained least square restoration.

Image data rates , pixel coding , predictive techniques , transform coding and vector DPCM. Block truncation coding , Wavelet transform coding of images, color image coding, Random transform , back projection operator , inverse random transform , back projection algorithm , fan beam and algebraic restoration techniques.

Text Books: 1. AnilJainK.“FundamentalsofDigitalImageProcessing”,PHI,1999.2. WilliamPratt,“DigitalImageProcessing”,WileyInterscience,2ndedition1991

Reference books: 1. Gonzales,RafaelandWindz,“DigitalImageProcessing”,2ndedition,Addison-Wesley.,19982. ManerSid-AhmedA.,“ImageProcessing”,McGrawHillInternationalEdition,1995.3. AndrionLow-“IntroductorycomputerVisionandImageProcessing”,MCGrawHillInternationalEdition.

Subject Code: CSE 103 Advanced Mathematics

Combinatorics: Multinominal theorem, principle of inclusion; Recurrence relations – classification, summation method, extension to asymptotic solutions for subsequences; Linear homogeneous relations, characteristic root method, general solution for distinct and repeated roots, non-homogeneous relations and examples, generating functions and their application to linear homogeneous recurrence relations, non-linear recurrence relations, exponential generating functions, brief introduction to Polya theory of counting.

Graph Theory: Graphs and digraphs, complement, isomorphism, connectedness and reachability, adjacency matrix, Eulerian paths and circuits in graphs and digraphs, Hamiltonian paths and circuits in graphs and tournaments, trees; Minimum spanning tree, rooted trees and binary trees, planar graphs, Euler‟s formula, statement of Kuratowskey‟s theorem, dual of planer graph, independence number and clique number, chromatic number, statement of Four-color theorem, dominating sets and covering sets.

Logic: Propositional Calculus- propositions and consecutives, syntax; Semantics- truth assignments and truth tables, validity and satisfiability, tautology; Adequate set of consecutives; Equivalence and normal forms; Compactness and resolution; Formal reducibility – natural deducation system and axiom system; Soundness and completeness.

Introduction to Predicate Calculus: Syntax of first order language; Semantics- structures and interpretation; Formal deductibility, First Order theory, models of a first order theory (definition only), validity, soundness, completeness, compactness (statement only), outline of resolution principle.

Text Books:

1. J.L.Mott,A.KandelandT.P.Baker:DiscreteMathematicsforComputerScientists,Reston,Virginia,1983.2. D.F.StanatandD.E.McAllister:DiscreteMathematicsinComputerScience,PrenticeHall,EnglewoodCliffs,1977.3. R.A.Brualdi:IntroductoryCombinatorics,North-Holland,NewYork,1977.4. Reingoldetal.:Combinatorialalgorithms:theoryandPractice,PrenticeHall,EnglewoodCliffs,1977.5. J.A.BondyandU.S.R.Murthy:GraphTheorywithApplications,MacmillanPress,London,1976.6. N.Deo:GraphTheorywithApplicationstoEngineeringandComputerScience,PrenticeHall,EnglewoodCliffs,1974.7. E.Mendelsohn:IntroductiontoMathematicalLogic,2ndEd.Van-Nostrand,London,1979.8. L.Zhongwan:mathematicalLogicforComputerScience,WorldScientific,Singapore,1989.9. F.S.Roberts:AppliedCombinatorics,PrenticeHall,EnglewoodCliffs,1984.

Reference Books: 1. J.PTremblayandR.Manohar:DiscreteMathematicalStructureswithApplicationstoComputers.2. J.L.Gersting:MathematicalStrcuturesforComputerSciences.3. S.Lipschutz:FiniteMathematics.4. S.Wiitala:DiscreteMathematics–AUnifiedApproach.5. C.L.Liu:ElementsofDiscreteMathematics.6. K.D.Joshi:FoundationofDiscreteMathematics.7. S.Sahani:ConceptofDiscreteMathematics.8. L.S.Levy:DiscreteStructureincomputerScience.9. J.H.VarlistandR.M.Wilson:AcourseinCombinatorics.

Subject Code:- CSE 104 Advanced Computer Architecture

Fundamentals of Computer design- Technology trends- cost- measuring and reporting performance quantitative principles of computer design. Memory hierarchy design- cache performance- reducing cache misses penalty and miss rate – virtual memory- protection and examples of VM. Instruction set principles and examples- classifying instruction set- memory addressing- type and size of operands- addressing modes for signal processing-operations in the instruction set- instructions for control flow- encoding an instruction set.-the role of compiler. Instruction level parallelism (ILP)- over coming data hazards- reducing branch costs –high performance instruction delivery- hardware based speculation- limitation of ILP ILP software approach- compiler techniques- static branch protection – VLIW approach – H.W support for more ILP at compile time- H.W versus S.W Solutions Multiprocessors and thread level parallelism- symmetric shared memory architectures- distributed shared memory- Synchronization- multi threading.

Text Book: 1. Computer Architecture A quantitative approach 3rd edition John L. Hennessy & David A. Patterson Morgan Kufmann (An Imprint of Elsevier)

Reference Books: 1. AdvancedComputerArchitectures,DezsoSima,TerenceFountain,PeterKacsuk,Pearson.

2. “ComputerArchitectureandparallelProcessing”KaiHwangandA.BriggsInternationalEditionMcGraw-Hill.

Subject Code: CSE 105 DesignandAnalysisofAlgorithms

Quick Review of basic concepts - complexity measures, worst-case, average case and amortized complexity functions, model of computation.

Algorithm Design Paradigm - Divide and Conquer, Recursion, Greedy method, Dynamic programming. Role of Data Structures.

Sorting and Selection Problems: Order Statistics, sorting methods, lower bounds.

Searching and Selection Problems: Order Statistics, sorting methods, lower bounds.

Searching and Set manipulation: Searching in Static table - path lengths in Binary trees and applications, optimality of Binary search in worst case and average case, construction of weighted Binary Search tree. Searching in dynamic table - randomly grown binary search trees, AVL trees, (a, b) trees; Union-find problem -tree representation of set, weighted union and path compression, analysis and application. Hashing: chaining, open addressing, universal hashing function.

Graph algorithms: Review of topological sort, connected and biconnected components, shortest paths, minimum spanning trees. Maximum matching, maximum-flow (Ford-Fulkerson).

Arithmetic and Algebraic problems: Integer multiplication, GCD, Polynomial evaluation, Matrix Multiplication, Lower Bounds. Introductory Stringology. Some geometric algorithms.

NP-completeness: Determinism and non-determinism, P, NP, NP-complete, Cook's theorem, Some NP complete problems, Approximation algorithms. Notion of Randomization and Parallelism in algorithms.

Text Books: 1. T.H.Cormen,C.E.LeisersonandR.L.Rivest:IntroductiontoAlgorithms,MITPress,1990.2. U.Manber:IntroductiontoAlgorithms,Addison-Wesley,1989.

Reference Books: 1. G.BrassardandP.Bartley:Algorithmics:TheoryandPractice,PrenticeHallInternational1996.2. A.V.Aho,J.E.HopcroftandJ.D.Ullman:DesignandAnalysisofAlgorithms,Addison-Wesley,1974.

Subject Code: CSE 201 AdvancedNetworkSecurity&TCP/IPProgramming

Uniqueness – Number Theory concepts – Primality – Modular Arithmetic – Fermet & Euler Theorem – Euclid Algorithm – RSA – Elliptic Curve Cryptography – Diffie Hellman Key Exchange Digests – Requirements – MAC – Hash function – Security of Hash and MAC – Birthday Attack – MD5 – SHA – RIPEMD – Digital Signature Standard – Proof of DSSAuthentication applications – Kerberos – Kerberos Encryption Techniques – PGP – Radix64 – IP Security Architecture – Payload – Key management – Web security requirements – SSL – TLS – SET Resources – Intruders and Intrusion – Viruses and Worms – OS Security – Firewalls – Design Principles – Packet Filtering – Application gateways – Trusted systems – Counter Measures Protocols and standards – OSI model – TCP / IP protocol suite – addressing – versions – underlying technologies. Classful addressing – other issues – subnetting – supernetting – classless addressing – routing methods – delivery – table and modules – CIDR – ARP package – RARP. Datagram – fragmentation – options – checksum – IP package – ICMP – messages, formats – error reporting – query–checksum–ICMPpackage–IGMP–messages,operation–encapsulation–IGMPpackage–UDP–datagram–checksum–operation–uses–UDPpackage.Services – flow, congestion and error control – TCP package and operation – state transition diagram – unicast routing protocols – RIP – OSPF – BGP – multicast routing – trees – protocols – MOSPF – CBT – PIM

Client server model – concurrency – processes – sockets – byte ordering – socket system calls – TCP and UDP client-server programs – BOOTP -DHCP – DNS – name space, resolution – types of records – concept – modeofoperation–Rlogin.

Text Books: 1. “NetworkSecurityEssentials:ApplicationsandStandards”byWilliamStallings,Pearson2. “NetworkSecurityprivatecommunicationinapublicworld”,C.Kaufman,R.PerlmanandM.Speciner,Pearson

Reference Books: 1. “CryptographyandNetworkSecurity”,WilliamStallings,2ndEdition,PearsonEducationAsia2. “DesigningNetworkSecurity”,MerikeKaeo,2ndEdition,PearsonBooks3. “BuildingInternetFirewalls”,ElizabethD.Zwicky,SimonCooper,D.BrentChapman,2ndEdition,Oreilly4. “PracticalUnix&InternetSecurity”,SimsonGarfinkel,GeneSpafford,AlanSchwartz,3rdEdition,Oreilly

Subject Code: CSE 202 Mobile & Wireless Computing

Wireless Transmission-Wired and wireless, Mobility of users and equipments, Electromagnetic Spectrum, Radio and Microwave communication, Infrared and Millimeter waves, Legthwave Transmission. Satellite Network Architecture-Satellite Orbits-GEO LEO, MEO. Inmarsat, Iridium, Odyssey, Global Star, Archimedes and other Satellite Networks. Spread Spectrum and CDMA-Direct (pseudo-noise) and Frequency hopped Spread Spectrum. CDMA System. Wireless LANs -MACA and MACAW protocols. Infrared LAN. Cellular Radio Systems-Paging, Cordless telephones, Analog Cellular telephones AMPS. Digital Cellular Telephone-GSM. Personal Communication service (PCS). CDPD system. Mobile Data Networks and their applications. Wireless and Mobile access to the Internet.

Text Books: 1. V.K.Garg&J.E.Wilks:WirelessandPersonalCommunicationSystems:FundamentalsandApplicationsIEEEPressandPrenticeHall,1996.2. T.S.Rappaport,B.D.WernerandJ.H.Reed:WirelessPersonalCommunications:TheEvolutionofPCS,DkyenerAcademic,1996.

Reference Books: 1. G.I.Stuber:PrinciplesofMobileCommunication,KluenerAcademic,1996.2. U.Black:MobileandWirelessNetworks,PrenticeHallPTR,1996.

Subject Code: CSE 203 Advanced Database Systems

Relational Database Management Issues - Transaction Processing, Concurrency, Recovery, Security and Integrity. Distributed Databases - Storage structures for distributed data, data fragmentation, Transparency of distributed architecture, Distributed query processing, Transaction management in distributed environment, Recovery and Concurrency control, Locking protocols, Deadlock handling, Dynamic modeling of distributed databases, Client - Server Databases. Performance Tuning, Advanced Transaction Processing. Object-oriented Databases - Objects and Types, Specifying the behavior of objects, Implementing Relationships, Inheritance.

Sample Systems. New Database Applications. Multimedia Database - Multimedia and Object Oriented Databases, Basic features of Multimedia data management, Data Compression Techniques, Integrating conventional DBMSs with IR and Hierarchical Storage Systems, Graph Oriented Data Model, Management of Hypertext Data, Client Server Architectures for Multimedia Databases

Text Books: 1.H. F. Korth & A. Silverschatz: Database Systems Concepts, McGraw Hill. 2.Bindu R. Rao: Object Oriented Databases, McGraw Hill, 1994. 3. Gray,Kulkarni,andPaton:ObjectOrientedDatabases,PrenticeHallInternational,1992.4.Khoshafian:ObjectOrientedDatabases,JohnWiley&Sons,1993.

Reference Books: 1. S.Khoshafian&A.B.Baker,MultimediaandImagingDatabases,MorganKaufmannPublishers,1996.2. Kemper&Moerkoette:Object-OrientedDatabaseManagement,PH,1994.3. AlexBerson:Client/ServerArchitecture,McGrawHill.

Subject Code: CSE 301 Remote Sensing GIS, GPS

Introduction: Sun and atmosphere, Remote Sensing a historical perspective. Electromagnetic Radiations: EM radiators, polarization, attenuation. Thermal radiations, EM for remote sensing. Fundamental of Radiometry. Physical Basics of Signatures: Signature OIR, TIR & Microware Region Remote Sensor: Classifications of Sensors, Sensor parameters. Resolution- Spatial & Spectral Optical, Microwave Sensors Platform: Principle of Sattelite Motion, Types of orbit, Orbit perturbations. GPS – Data Products: Dataformats, data product generation output media Date analysis: Visual analysis, Digital Classifications Application of Remote Sensing: Agriculture, Forestry, Land Cover Studies Water Resource, Earth System Science Geographical Interaction System Application.

Text Books: 1. “Principlesofgeographicalinformationsystems”,P.A.BurroughandR.A.Mcdonnel,Oxford.2. “Remotesensingoftheenvironment”,J.R.Jensen,Pearson

References Books: 1. “ExploringGeographicInformationSystems”,NicholasChrismas,JohnWiley&Sons.2. “GettingStartedwithGeographicInformationSystems”,KeithClarke,PHI.3. “AnIntroductiontoGeographicalInformationSystems”,IanHeywood,SarahCornelius,andSteveCarver.Addison-WesleyLongman.

Subject Code: Elective I (CS - I) ParallelArchitecture/ProcessingandGridComputing

Parallel computer models: Multiprocessors and Multicomputer – Multifactor and SIMD computer PRAM & VLSI models, conditions of parallelism. System interconnect architectures performance. Metrics and Measures. Advanced processor technology – Super scalar and vector processors – Memory hierarchy technology, virtual memory technology – cache memory organization – shared – memory organization. Linear pipeline processors – Nonlinear pipeline processors – Instruction pipeline design, Arithmetic pipeline design – Superscalar pipeline design.

Multiprocessor system interconnects – Cache coherence, Vector processing principle Compound Vector processing, SIMD computer organization, multiprocessor operating system, multiprocessor examples Grid Computing values and risks – History of Grid computing – Grid computing model and protocols – overview of types of Grids Desktop Grids : Background – Definition – Challenges – Technology – Suitability – Grid server and practical uses; Clusters and Cluster Grids; HPC Grids; Scientific in sight – application and Architecture – HPC application development environment and HPC Grids; Data Grids; Alternatives to Data Grid – Data Grid architecture. The open Grid services Architecture – Analogy – Evolution – Overview – Building on the OGSA platform – implementing OGSA based Grids – Creating and Managing services – Services and the Grid – Service Discovery – Tools and Toolkits – Universal Description Discovery and Integration (UDDI) Desktop supercomputing – parallel computing – parallel programming paradigms – problems of current parallel programming paradigms – Desktop supercomputing programming paradigms – parallelizing existing applications – Grid enabling software applications – Needs of the Grid users – methods of Grid deployment – RequirementsforGridenablingsoftware–Gridenablingsoftwareapplications.

Text Books: 1. KaiHwang,“AdvancedComputerArchitecture”,Parallelism,Scalability,Programmability,McGrawHill,1993.2. AhmarAbbas,“GridComputing,APracticalGuidetoTechnologyandApplications”,Firewallmedia,2004.

Reference Books: 1. HwangBriggs,“ComputerArchitectureandparallelprocessing”,McGrawhill.2. WilliamStallings,“ComputerOrganizationandArchitecture-DesigningforPerformance”,PHI,2000.3. JoshyJoseph,CraigFellenstein,“GridComputing”,PearsonEducation,2004.4. Foster,“GridBlueprintfoenewcomputing”.

Subject Code: Elective I (CS - II) TheoryofProgrammingLanguages/Computing

Concepts of structural program development; concept of data types; precedence and associatively of operators; conditional transfer; deterministic and in-deterministic loops; recursions; functions and procedures - call by value, call by reference and their differences; programming for numerical methods; records. Data-type handling and various constructs (conditional, loop, functions etc); pointers: concept of pointers and passing parameters using pointers, non-numeric processing, concept of arrays of pointers and pointers to pointers; Structures and unions – advantage of using structures, concept of information hiding, pointers to structures; Files - basic concept of various types of file access methods: sequential, indexed sequential, random, various statements for file handling Advanced Programming Languages like C++, ADA, LISP, PROLOG, and PASCAL. Comparison of various languages

Text Books: 1. TennenceW.Pratt,“Programminglanguagesdesignandimplementation”,PrenticeHallofIndia.2. AllenB.Tucker,“ProgrammingLanguages”,TataMcGrawHill.

Reference Books: 1. GottfriedBS–ProgrammingwithC,TMHpub.2. Balagurusamy:ANSICTMH

Subject Code: - Elective I (CS - III) Real Time Systems

Real Time Systems, Specification, Analysis, Design. Definition, Types and Evolution; State Diagram, Finite Automata, Timed Petri Net, Formal Methods for Analysis & Design. Algorithm Development, Implementation of Real Time Algorithms Debugging and Verification Real Time Distributed Computing Clock Synchronization, Real Time constraint satisfaction Reliability & Safety. Case Studies Computer Control Systems Real Time Simulation Systems Mission Control Systems Safety Critical Systems.

Text Books: 1. Real-timeSystems,JaneW.S.Liu2. Real-TimeSystemsDesignandAnalysis,PhilipA.Laplante3. Real-timeSystems,HermannKopetz

Reference Books: 1. Real-timeSystems:Theoryandpractice,RajibMall2. Real-TimeConceptsforEmbeddedSystems,CarolineYao,LiZhang

Subject Code: Elective I (CS - IV) Pattern Recognition

Bayes‟ Decision Theory, Discriminant functions and decision procedures, Relaxation procedures, Non- separable behavior. Parameter estimation and supervised learning, Maximum likelihood estimation, Sufficient statistics, Problems of dimensionality, Nom [Ara, etroc techniques, density estimates, Parzen Windows, k-nearest neighbour estimation, Fisher's linear discriminate. Clustering and unsupervised learning, Cluster validity, hierarchical and graph theoretic methods, Sealing. Feature Selection-Karhunen Loeve, Stochastic approximation, kernel approximation, divergence measures. Syntactic Pattern Recognition, Inductive Learning, Grammatical Inference, Error correcting Parsing, Vapnik - Chorvononkis result.

Text Books: 1. Tou&Gonzalez:PrinciplesofPatternRecognition,AddisonWesley.2. B.D.Ripley:PatternRecognition&NeuralNetworks,CambridgeUniversityPress.

Reference Books: 1. Tou&Gonzalez:SyntacticPatternRecognition,AddisonWesley.2. Bishop,C.M.NeuralNetworksforPatternRecognition.OxfordUniversityPress.1995.

Subject Code: Elective II (IT - I) Web Mining and Internet Technology

Data integration for e-commerce, Web personalization and recommender systems, Web content and structure mining, Web data warehousing, Review of tools, applications, and systems, Data collection and sources of

data, Data preparation for usage mining, Mining navigational patterns, Integrating e-commerce data, Leveraging site content and structure, User tracking and profiling, E-Metrics: measuring success in e- commerce, Privacy issues, Evolution of the Internet, Growth of the World Wide Web and Big Data, Client- server model, Architecture of the Intranet/Internet/Extranet, Access method: dialup, ISDN, ADSL/2+, cable, LAN, WiFi, Mobile and Satellite, Proxy Servers, Application areas: E-commerce, Education, Entertainment such as Games and Gambling Internet of Things (IoT) Search Engines, Webbots, integrity of information, database online.

Text Books: 1. PrestenGrallaandMichaelTroller.,HowtheInternetWorks,Que,(8thEdition),20062. PerryJ.etal,TheInternet–IllustratedIntroductory,CourseTechnology(3rdEd)3. Bates,C.,WebProgramming:BuildingInternetApplications,JohnWileyandSons(3rdEd),2006.4. Berners-Lee,T.etal,WeavingtheWeb,HarperBusiness,2000

Reference Books: 1. Hofstetter,F.T.,InternetLiteracy,McGrawHill(4thEd),20052. McGloughlin,S.,Multimedia:ConceptsandPractice,PrenticeHall,2001.3. Anderson,P.,Web2.0andBeyond:PrinciplesandTechnologies,Chapman&Hall/CRCTextbooksinComputing,20124. Bahga,AandMadisetti,V.,InternetofThings:AHands-OnApproach,VPT,2014

Subject Code: Elective II (IT - II) Data Warehousing and Data Mining

Introduction: Fundamentals of data mining, Data Mining Functionalities, Classification of Data Mining systems, Major issues in Data Mining, Data Warehouse and OLAP Technology for Data Mining Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse Implementation, Further Development of Data Cube Technology, From Data Warehousing to Data Mining, Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and Concept Hierarchy Generation, Online Data Storage. Data Mining Primitives, Languages, and System Architectures: Data Mining Primitives, Data Mining Query Languages, Designing Graphical User Interfaces Based on a Data Mining Query Language Architectures of Data Mining Systems, Concepts Description: Characterization and Comparison: Data Generalization and Summarization- Based Characterization, Analytical Characterization: Analysis of Attribute Relevance, Mining Class Comparisons: Discriminating between Different Classes, Mining Descriptive Statistical Measures in Large Databases. Mining Association Rules in Large Databases: Association Rule Mining, Mining Single-Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel Association Rules from Transaction Databases, Mining Multidimensional Association Rules from Relational Databases and Data Warehouses, From Association Mining to Correlation Analysis, Constraint-Based Association Mining. Classification and Prediction: Issues Regarding Classification and Prediction, Classification by Decision Tree Induction, Bayesian Classification, Classification by Back propagation, Classification Based on Concepts from Association Rule Mining, Other Classification Methods, Prediction, Classifier Accuracy. Cluster Analysis Introduction :Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods, Partitioning Methods, Density-Based Methods, Grid-Based Methods, Model-Based Clustering Methods, Outlier Analysis. Mining Complex Types of Data: Multidimensional Analysis and Descriptive Mining of Complex, Data Objects, Mining Spatial Databases, Mining Multimedia Databases, Mining Time-Series and Sequence Data, Mining Text Databases, Mining the World Wide Web.

Text Books: 1. DataMining–ConceptsandTechniques-JIAWEIHAN&MICHELINEKAMBERHarcourtIndia.2. DataMiningTechniques–ARUNKPUJARI,UniversityPress3. BuildingtheDataWarehouse-W.H.Inmon,WileyDreamtechIndiaPvt.Ltd.

Reference Books:

1. DataWarehousingintheRealWorld–SAMANAHORY&DENNISMURRAY.PearsonEdnAsia.2. DataWarehousingFundamentals–PAULRAJPONNAIAHWILEYSTUDENTEDITION3. TheDataWarehouseLifecycleToolkit–RALPHKIMBALLWILEYSTUDENTEDITION4. DataMiningIntroductoryandadvancedtopics–MARGARETHDUNHAM,PEARSONEDUCATION

Subject Code: - Elective II (IT – III) Management Information Systems

Management activities, roles and levels Management Planning and Control: how planning and control systems interrelate Strategic Planning within an organization: activities, techniques and results The nature of decision-making: decision-making models and classification of decision-making situations Management as the direct user of an MIS vs Intermediary usage Measurement of MIS performance and capabilities Reporting Systems (MRS) Decision Support Systems (DSS) Office Information Systems (OIS) – including video conferencing and email Knowledge based systems that support management such as Expert Systems (ES) and Neural Network (NN) Systems The application of Online-Analytical Processing (OLAP)/Data Mining/Business Intelligence (BI) tools in supporting management decision making The relationships of MIS to other enterprise applications, such as Transaction Processing Systems (TPS) and Enterprise Resource Planning (ERP) systems IS within functional areas such as Human Resources, Marketing and Sales, Production, Accounting and Finance, Customer Relationship Management (CRM), Product Supply Chain Management Systems The Internet and MIS provisions: Internet and the linkages to legacy MIS, Internet customer interfaces, security issues. MIS and mobile computing MIS and social media

Text Books: 1. KennethC.Laudon&JaneP.Laudon,EssentialsofManagementInformationSystems,TenthEdition,PearsonPrentice-Hall,20122. TerryLucy,ManagementInformationSystems,NinthEdition,2005,Thompson

Reference Books: 1. McNurlin, Sprague & Bui, Information Systems Management in Practice, Prentice-Hall (8th Ed), 2013 2.Efraim Turban, Jay Aronson & Tin-Peng Liang, Decision Support Systems and Intelligent Systems, Ninth Internal Edition, Pearson Prentice Hall, 2010.

Subject Code: Elective II (IT - IV) Advanced Software Engineering

System Engineering - Analysis & Design Software Architectures & Design. Software Metrics. Software Testing Strategies: Analytical models (e.g. Markov Chain Model, Probabilistic Models) Software Reliability: Analytical Models Formal Methods in Software Engineering (e.g. Formal Specification Language) Software Re-use Re-engineering - reverse engineering. Real-time Software Engineering. Client/Server Software Engineering. CASE tool design & implementation. Verification & Validation.

Object-oriented Software Engineering: OO-Analysis, OO-Design, OO-Testing, metrics for OO systems. System Modeling and Simulation. Software Engineering Economics.

Text Books: 1. Pressman:SoftwareEngineering,McGrawHill.2. Shoeman:SoftwareEngineering,McGrawHill.3. Ghezzi,SoftwareEngineering,PHI

Reference Books: 1. FundamentalsofSoftwareEngineeringbyRajibMall,PHI.2. Sommerville,Ian–SoftwareEngineering,PearsonEducation

Subject Code: - Elective II (IT -V) Data Compression & Error Correction

Data Compressions Introduction, Brief history, minimum redundancy codes, Shanon – Fanno code, Huffman code, Adaptive Huffman code, Arithmetic coding, Statistical Modelling, Dictionary based compression, Sliding window compression, Lz78 Compression, Speech compression, Lossy Graphics compression. Error Corrections Mathematical background, Linear codes, codes for high-speed memories, - bit error correcting, byte error correcting. Codes for mass memories. Asymmetric and unidirectional error codes, codes for logic design. Recent development of error correcting codes.

Text Books: 1. ErrorcontrolcodingforComputersystembyT.R.NRao&E.Fujiwara,PHIInc.2. B.Forouzan,“CryptographyandNetworkSecurity”,TataMcGraw-Hill.

Reference Books: 1. Nelson,“TheDataCompressionBook”,BPB.2. AtulKahate,“Cryptography&NetworkSecurity”,TMH.

Subject Code: Elective II (IT- VI) Optical Networks

Introduction to Optical Networks Components Transmitters Transmission System Engineering First Generation Networks Wavelength Routing Networks Virtual Topology Design Access Networks

Text Books: 1. Opticalnetworks:Apracticalperspective,KumarSivarajanandRajivRamaswamy:MorganKauffman1998.2. Gigabit-capablePassiveOpticalNetworks-D.Hood,Wiley

Reference Books: 1. OpticalCommunicationNetworks:BiswajitMukherjee:TMG,1998.2. OpticalNetworks,UlyseesBlack:Pearsoneducation2007.

Subject Code: Elective II (IT- VII) Embedded Systems

Software Technology: - Software Architectures, Software development Tools, Software Development Process Life Cycle and its Model, Software Analysis, Design and Maintenance Introduction To Data Representation:- Data representation ,Two‟s complement, Fixed point and Floating Point Number Formats ,Manipulating Bits in -Memory, I/O Ports, Low level programming in C ,Primitive data types , Arrays, Functions ,Recursive Functions, Pointers, Structures & Unions ,Dynamic Memory Allocation ,File handling ,Linked lists, Queues, Stacks Mixing C and Assembly:- C and assembly, Programming in assembly ,Register Usage Conventions ,Typical use of Addressing Options, Instruction Sequencing , Procedure Call and Return , Parameter passing ,Retrieving Parameters , Everything in pass by value ,Temporary variables. Input/Output Programming:- I/O Instructions, Synchronization, Transfer Rate & Latency, Polled Waiting Loops, Interrupt – Driven I/O, Writing ISR in Assembly and C, Non Maskable and Software Interrupts Memory Management: - Direct Memory Access, Local and Global Scope, Automatic and Static Allocation, Distinguishing Static from Automatic Object Creation, Initialization and Destruction, Dynamic Allocation Unified Modeling Language:- UML basics, Object state behavior - UML state charts - Role of scenarios in the definition of behavior - Timing diagrams - Sequence diagrams - Event hierarchies - types and strategies of operations - Architectural design in UML concurrency design - threads in UML Software Tools: - DJGPP C/C++ compiler, linker, loader and utilities, The ASM assembler, µCOS-II Preemptive Kernel, Multi C Non- Preemptive Kernel

Text Books: 1. DanielW.Lewis,“FundamentalsofembeddedsoftwarewhereCandAssemblymeet”,PearsonEducation2. BrucePowelDouglas,“RealtimeUML,secondedition(TheAddisonWesleyObjecttechnologyseries)”,2ndedition1999,AddisonWesley

Reference Books: 1. HassanGomma,“Designingconcurrent,distributed,andrealtimeapplicationwithUML”,PearsonEducation,20002. AlbertM.K.Cheng,“Real-timesystems:scheduling,analysisandverification”,Wiley

Subject Code: Elective III (CA -I) Bioinformatics

Machine learning foundations – probabilistic framework, algorithms Neural Networks and applications Hidden Markov Models – theory & Applications Probabilistic Graphical Models & Applications Phylogenetic trees Stotastic grammars & linguistics Microarrays & Gene Expressions Internet resources & pubic databases Information theory & statistics in bioinformatics HMM Techniques Gaussian Process, Kernel Methods and support.

Text Book: 1. PhillipCompeau,PavelPevzner,BioinformaticsAlgorithms:anActiveLearningApproach2. NeilC.Jones,PavelPevzner,IntroductiontoBioinformaticsAlgorithms,ANEBooks,1stEditionedition

Books/References: 1. MolecularCellBiologybyDaidBaltimar2. AurtherM.Lesk,IntroductiontoBioinformatics,OxfordUniversityPress,4thedition3. DanE.KraneandMichaelL.Raymer,FundamentalConceptsofBioinformaticsKraneandRaymer,DORLINGKINDERSLEY(RS);Firstedition4. DavidMount:Bioinformatics:SequenceandGenomeAnalysis,CBS;2edition

Subject Code: Elective III (CA -II) Artificial Intelligence and Expert Systems

Introduction: AI problem; AI techniques, problem as a state space search, Production Systems, Issues in design of search programs. Heuristic Search Techniques : Generate and test, Hill Climbing, Best-First Search, Problem reduction, Means- Ends analysis. Knowledge representation & Reasoning: Knowledge representation issues, Ontological commitments. Predicate logic, knowledge representation using rules, weak slot-and-Filler structure. Natural Language Processing : Syntactic processing, semantic analysis, Discourse and pragmatic processing. Expert Systems : Representation using domain knowledge, Expert System shell, knowledge acquisition.

Text Books: 1. GeorgeF.Luger,„ArtificialIntelligence–StructuresandStrategiesforComplexProblemSolving‟,FourthEdition,PearsonEducation,2002.2. KevinKnight,ElaineRich,B.Nair,ArtificialIntelligence,McGrawHillEducation(India)PrivateLimited;3edition

Reference Books: 1. NilsJ.Nilsson,PrinciplesofArtificialIntelligence(SymbolicComputation/ArtificialIntelligence),Springer;Softcoverreprintoftheoriginal1sted.1982edition2. GeorgeF.Luger,ArtificialIntelligence,PearsonEducation;Fifthedition3. StuartRussellandPeterNorvig:ArtificalIntelligence:AModernApproach,Pearson;Thirdedition

Subject Code: Elective III (CA -III) VLSI Technology

Introduction on VLSI Design Bipolar Junction Transistor Fabrication MOSFET Fabrication for IC Crystal Structure of Si Crystal Structure contd Defects in Crystal + Crystal growth Crystal growth Contd + Epitaxy I Epitaxy II - Vapour phase Epitaxy Epitaxy III - Doping during Epitaxy Molecular beam Epitaxy Oxidation I - Kinetics of Oxidation Oxidation II Oxidation rate constants Oxidation III - Dopant Redistribution Oxidation IV - Oxide Charges Diffusion I - Theory of Diffusion Diffusion II - Infinite Source Diffusion III - Actual Doping Profiles Diffusion IV Diffusion Systems

Ion - Implantation Process Ion - Implantation Process Annealing of Damages Masking during Implantation Lithography - I Lithography - II Wet Chemical Etching Dry Etching Plasma Etching Systems Etching of Si, Sio2, Sin and other materials Plasma Deposition Process Metallization - I Problems in Aluminum Metal contacts IC BJT - From junction isolation to LOCOS Problems in LOCOS + Trench isolation More about BJT Fabrication and Realization Circuits + Transistors in ECL Circuits MOSFET I - Metal gate vs. Self-aligned Poly-gate MOSFET II Tailoring of Device Parameters CMOS Technology Latch - up in CMOS BICMOS Technology

Text Books: 1. “SiliconVLSITechnology:Fundamentals,PracticeandModeling”byJamesD.Plummer,MichaelD.Deal,PeterB.Griffin2. “TheScienceandEngineeringofMicroelectronicFabrication”byStephenA.Campbell3. “VLSITechnology”byC.Y.ChangandS.M.Sze

Reference Books: 1. “DigitalIntegratedCircuits”Demassa&Ciccone,WilleyPub.2. “ModernVLSIDesign:systemonsilicon”WayneWolf;AddisonWesleyLongmanPublisher3. “BasicVLSIDesign”DouglasA.Pucknell&KamranEshranghian;PHI4. “CMOSCircuitDesign,Layout&Simulation”,R.J.Baker,H.W.Lee,D.E.Boyee,PHI

Subject Code: Elective III (CA -IV) Speech & Natural Language Processing

Introduction: NLP tasks in syntax, semantics, and pragmatics. Applications such as information extraction, question answering, and machine translation. The problem of ambiguity. The role of machine learning. Brief history of the field. N-gram Language Models: the role of language models. Simple N-gram models. Estimating parameters and smoothing. Evaluating language models. Part of Speech Tagging and Sequence Labeling: Lexical syntax. Hidden Markov Models. Maximum Entropy Models. Conditional Random Syntactic parsing: Grammar formalisms and treebanks. Efficient parsing for context-free grammars (CFGs). Statistical parsing and probabilistic CFGs (PCFGs). Lexicalized PCFGs. Semantic Analysis: Lexical semantics and word-sense disambiguation. Compositional semantics. Semantic Role Labeling and Semantic Parsing. Information Extraction (IE): Named entity recognition and relation extraction. IE using sequence labeling.

Machine Translation (MT): Basic issues in MT. Statistical translation, word alignment, phrase-based translation, and synchronous grammars.

Text Books: 1. D.Jurafsky&J.H.Martin–“SpeechandLanguageProcessing–AnintroductiontoLanguageprocessing,ComputationalLinguistics,andSpeechRecognition”,PearsonEducation2. Manning,ChristopherandHeinrichSchütze.1999.“FoundationsofStatisticalNaturalLanguageProcessing”.MITPress.

Reference Books: 1. Allen,James.1995.–“NaturalLanguageUnderstanding”.Benjamin/Cummings,2ed.2. Bharathi,A.,VineetChaitanyaandRajeevSangal.1995.NaturalLanguageProcessing-“APananianPerspective”.PrenticeHllIndia,EasternEconomyEdition.3. EugeneCherniak:“StatisticalLanguageLearning”,MITPress,1993.

Subject Code: Elective III (CA -V) Network Administration

History – TCP/IP, UUCP network, Network through Linux & Maintenance TCP/IP Networking: interfaces, IP Address, Address resolutions of tcp/ip. Configuring Serial devices Configuring Network Hardware Names services, P-P Protocols, Firewall, IP Accounting, Network Information Systems IP Masquerade, IPX and NCP file systems, managing UUCP, E-Mail, Senfd Mail, Networks and configurations, E-news

Text Book: 1. LinuxNetworkAdministratorsguidebyOlafKierch&TerryDawsonshroff.2. Limoncelli–“ThePracticeofSystem&NetworkAdministration”-Pearson.

Reference Books: 1. Kirch–“LinuxnetworkAdministrator‟sguide(2ndEd.)”–O‟Rielly2. Maxwell–“Unixsystemadministration”-TMH

Subject Code: Elective III (CA -VI) Cloud Computing

Enabling Technologies and System Models for Cloud Computing Introduction to Cloud Computing including benefits, challenges, and risks Cloud Computing Models including Infrastructure/Platform/Software – as a service Public cloud, private cloud and hybrid clouds Cloud OS Cloud Architectures including Federated Clouds Scalability, Performance, QoS Data centers for Cloud Computing Principles of Virtualization platforms Security and Privacy issues in the Cloud VMWare ESX Memory Management Capacity Planning and Disaster Recovery in Cloud Computing

Text Books: 1. CloudComputing:FromBeginningtoEnd,RayJ.Rafaels2. CloudComputing:Ahands-onApproach,ArshdeepBhagaandVijayMadisetti3. CloudComputing:Concepts,Technology&ArchitectureandCloudComputingDesignPatterns,ThomasErlandothers

Reference Books:

1. Cloudnomics:TheBusinessValueofCloudComputing2. AmazonwebServicesforDummies,BernardGolden

Subject Code: Elective III (CA -VII) Authentication and Steganography

Introduction to Biometrics: Introduction, Physiological or Behavioral, Verification vs. Identification, Applications, Biometrics Technologies, Working of Biometrics, Benefits, Application Design.

Fingerprint Recognition: What Is Fingerprint Scanning? Practical Applications for Fingerprint Scanning, Accuracy and Integrity, Fingerprint Matching, Fingerprint Classification, Fingerprint Image Enhancement, Fingerprint Feature Extraction, Fingerprint Form Factors, Types of Scanners: Optical - Silicon – Ultrasound, Fingerprint Matching.

Speaker Recognition: Algorithms for training, recognition and adaptation to speaker and transmission channel, mainly based on Hidden Markov Models (HMM), methods for reducing the sensitivity to external noise and distortion, acoustic modeling of static and time-varying spectral properties of speech, statistic modeling of language in spontaneous speech and written text, specific analysis and decision techniques for speaker recognition.

Face Recognition: Introduction to Face Recognition, How is Face Recognition Technology Currently Being Used? How Well Does Face Recognition Work, Why Face Recognition, Face Recognition: How it Works, Image Quality, Facial Scan Process Flow, Verification vs. Identification, Primary Facial Recognition Technologies, Facial Recognition Applications. Multi-Modal Biometrics: Introduction to Multi-Modal Biometric Systems, Fusion Methodology, Levels of Fusion, Feature-Extraction Level Fusion, Data-Matching Level Fusion, Probabilistic-Decision level Fusion, Fusion Procedure, Modes of Operation, Integration Strategies, Issues, Soft Biometrics, A Biometric Vision.

Text Books: 1. GuidetoBiometrics(SpringerProfessionalComputing)byR.Bolle,J.Connell,S.Pankanti,N.Ratha,SpringerPress,2003,ISBN03874008932. BiometricsPersonalIdentificationinNetworkedSociety,Jain,Bolle,Pankanti19993. HandbookofFingerprintRecognition,Maltoni,Maio,Jain,Prabhakar,20054. BiometricSystems,Wayman,Jain,MaltoniandMaio2004

Reference Books: 1. FundamentalsofSpeechRecognition,L.RabinerandB.Juang,,PearsonEducation.2. SpeechandAudioSignalProcessing,B.GoldandN.Morgan,JohnWiley.3. SpokenLanguageProcessing,Huang,Acero&Hon,PrenticeHall,2001.4. SpeechandLanguageProcessing:AnIntrotoNLP,CL,andSpeechRecognition(2ndEdition)Jurafsky&Martin,PrenticeHall,2000.5. StatisticalMethodsforSpeechRecognition.Jelinek.MITPress,6. FundamentalsofSpeechRecognition,Rabiner&Juang,Prentice-Hall,

o Academic Calendar of the University

1St Semester Academic Session 2018-2020 Commencement of classes 25th July, 2018

1st Assessment Commences from 9th October, 2018 2nd Internal Assessment Commences from 4th December,2018 Dissolution of Classes 24th December, 2018

End term Examination to be completed by 18th January, 2019 Publication of Results 31st January, 2019

2nd Semester Academic Session 2018-2020 Commencement of classes 24th January, 2019

1st Internal Assessment Commences from 26th March, 2019 2nd Internal Assessment Commences from 30th April, 2019 Dissolution of Classes 17th may, 2019

End term Examination to be completed by 17th June, 2019 Publication of Results 15th July, 2019

3rd Semester Academic Session 2017-2019 Commencement of classes 25th July, 2018

1st Internal Assessment Commences from 3rd Oct., 2018 2nd Internal Assessment Commences from 26th Nov., 2018 Dissolution of Classes 3rd January, 2019

End term Examination to be completed by 25th Jan., 2019 Publication of Results 5th February, 2019

4th Semester Academic Session 2017-2019 Commencement of classes 24th January, 2019

1st Internal Assessment Commences from 28th March., 2019 2nd Internal Assessment Commences from 2nd May, 2019 Dissolution of Classes 22nd May, 2019

End term Examination to be completed by 17th June, 2019 Publication of Result 5th July, 2019

o Academic Time Table with the name of the Faculty members handling the Course

o Teaching Load of each Faculty

FacultyName NumberofClassesperWeekJyotsnaKumarMandal 14UtpalBiswas 10PriyaRanjanSinhaMahapatra 10AnirbanMukherjee 11KalyaniMali 9DebabrataSardar 14SukantaMajumdar 11

o Internal Continuous Evaluation System and place: o Student’s assessment of Faculty, System in place: NA

16.EnrollmentofStudentsinlast3years:

Course Session EnrolledStudentsMCA 2018-2019 23

2017-2018 24

2016-2017 27MTech(CSE) 2018-2019 16

2017-2018 112016-2017 17

17.List of Research Projects/ Consultancy Works:

• Number of Projects carried out, funding agency, Grant received: • Publications (if any) out of research in last three years out of masters projects:

1. 2. 3.

• Industry Linkage: NONE• MoUs with Industries: NONE

18.EOAReportsTilldate:

19.Accountauditedstatement:

1. name of the institutionkucse.in/aictemand2019.pdf6. programmes name of programmes approved by...

Documents