mca syllabus 20-04-10

8/8/2019 MCA Syllabus 20-04-10

1/49

Dwaraka Doss Goverdhan Doss Vaishnav college(Autonomous)

DEGREE OF MASTER OF COMPUTER APPLICATIONS (M.C.A.)Choice Based Credit System

REGULATIONS

(Effective from the academic year 2010-2011 onwards)

1. Eligibility for AdmissionCandidate who has passed the under-mentioned degree examinations of this University or an examination of other institution recognized by this University as equivalent thereto provided they have undergone the course under 10+2+3 or 11+1+3 or 11+2+2 pattern or under the Open University System, shall be eligible for admission to theM.C.A. Degree Course.

(a) B.C.A/B.E.S/B.Sc. in Computer Science/Mathematics/Physics/ Statistics / Applied

Sciences OR (b) B.Com / Bachelor of Bank Management/B.B.A/B.L.M/B.A Corporate

Secretary-ship / B.A. Economics/ any other Bachelors Degree in any discipline with Business

Mathematics and Statistics or Mathematics/Statistics in Main/Allied level OR (c) B.Sc.

Chemistry with Mathematics and Physics as allied subjects OR (d) B.E/B.Tech./M.B.A OR (e)

A Bachelors Degree in any discipline with Mathematics as one of the subjects at the Higher

Secondary level (i.e. in +2 level of the 10+2 pattern)

2. Duration of the CourseThe Course duration shall be three years consisting of six semesters. In order to be

eligible for the award of the degree the candidate shall successfully complete the course in amaximum period of five years reckoned from the date of enrolment for the first semester of thecourse.

3. Structure of the Course and Evaluation PatternThe duration of External examination for theory and practical subjects shall be 3

hours. The maximum mark for each theory is 100 with 25 for Internal Assessment (IA) and75 for External Examination (EE). The distribution of internal marks for theory papers shall be:Two tests out of three - 15 marks, Attendance 5 marks, and Assignment/Seminar - 5 marks.The maximum mark for each practical is 100 with 40 for Internal Assessment (IA) and 60 for External Examination (EE). The distribution of internal marks for practical papers shall be:Practical tests Two out of three - 30 marks, Attendance 5 marks, and Record - 5 marks. For

project work the marks assigned shall be

Internal Two out of three presentations 20 marks

1

8/8/2019 MCA Syllabus 20-04-10

2/49

Project report 60 marksViva-voce 20 marks

For the conduct of External Examinations in Practical subjects the Controller of Examination of the college will appoint one external examiner one internal examiner who shallnormally be the concerned practical in-charge. The Controller of Examination will give thequestion bank. The examiners will conduct the examinations and award the marks on the sameday and forward to the University. The College Principal/Head of the department willcoordinate and provide the laboratory and other facilities for conducting the examination.

Project work shall be carried out individually in an R&D section of any Industry or Controller of Examination or in the Institute in which the candidate is studying. The ProjectWork/Dissertation report shall be submitted through the guides/supervisors to the Head of theDepartment and then to the University not latter than 31st May/31st December. If he/she failsto submit the Project Work/Dissertation within the stipulated date for a particular semester,he/she may be permitted with the approval of the Head of the Department to submit the Project

Work/Dissertation report during the succeeding semesters, within the maximum period of FIVE years from the date of admission to the first semester. Project/Dissertation evaluationand Viva-Voce shall be conducted by one external examiner and one internal examiner whoshall normally be the project guide.

List of courses, Scheme of evaluation and their associated credits are given below:

FIRST SEMESTER S.No. Course

componentsName of Course

C r e

d i t

E x a m .

D u r a t

i o n

Max.Marks

LectureHrs/week

IA* EE*

1 Core-T1 Object oriented programming using C++

3 3 25 75 4

2 Core-T2 Computer Organization and Architecture 4 3 25 75 4

3 Core-T3 System Software 4 3 25 75 44 Core-T4 Data structures and algorithms 4 3 25 75 45 Core-P1 Practical I: Programming in C++ 2 3 40 60 46 Core-P2 Practical II: HTML LAB 2 3 40 60 47 Non-Major

Elective-1Numerical And Statistical Methods 4 3 25 75 4

8 SoftSkill-1 2 3 2Total 25 30

* IA = Internal Assessment, EE = External Examination

Note 1: In the first semester the Subject Mathematics for Computer Science is replacedwith Numerical and Statistical Methods

2

8/8/2019 MCA Syllabus 20-04-10

3/49

SECOND SEMESTER S.No. Course

componentsName of Course

C r e

d i t

E x a m .

D u r a

t i o n

Max.Marks

LectureHrs/week

IA* EE*

9 Core-T5 Microprocessors and its Applications 4 3 25 75 410 Core-T6 Operating System 4 3 25 75 411 Core-T7 Object Oriented Software Engineering 4 3 25 75 412 Core-T8 JAVA Programming 3 3 25 75 413 Core-P3 Practical I: Programming in JAVA 2 3 40 60 414 Core-P4 Practical II: Microprocessor & OS Lab

2 3 40 60 415 Non-Major

Elective-2Operations Research

4 3 25 75 416 SoftSkill-2 2 3 2

Internship 2Total 27 30* IA = Internal Assessment, EE = External ExaminationNote 2: In the Second semester the Subject Statistical Methods is replaced withOperations Research.

Note 3 : The other highlighted subjects has under gone for minor changes in thesyllabus.

THIRD SEMESTER

S.No. Coursecomponents

Name of Course

C r e

d i t s

E x a m . D

u r a

t i o n Max.

MarksLectureHrs./week

IA* EE*

1 Core - T9 Data Base ManagementSystems

4 3 25 75 4

2 Core - T10 Computer Graphics 4 3 25 75 4

3 Core T11 * Accounting and FinancialManagement

4 3 25 75 4

4 Core - T12 Enterprise Computing 4 3 25 75 45 Elective I 1. Neuro Fuzzy Systems

2. Middleware Technologies3. Artificial Intelligence

3 3 25 75 4

6 Core P5 Practical V: EnterpriseComputing

2 3 40 60 4

7 Core P6 Practical VI : RDBMS 2 3 40 60 48 Soft skill- III* 2 3 2

Total 25 30* IA = Internal Assessment, EE = External Examination

3

8/8/2019 MCA Syllabus 20-04-10

4/49

4

8/8/2019 MCA Syllabus 20-04-10

5/49

FOURTH SEMESTER


Name of Course

C r e

d i t s

E x a m . D

u r a

t i o n Max.


IA* EE*

1 Core T13 Data Warehousing and DataMining

4 3 25 75 4

2 Core - T14 Mobile Computing 4 3 25 75 43 Core T15* Organisational Behaviour 4 3 25 75 44 Core - T16 Dot Net Programming Using

Web Services4 3 25 75 4

5 Elective II 1. Natural Language Processing2. Software Project Management3. Digital Imaging

3 3 25 75 4

6 Core P7 Practical VII: Asp .Net Lab 2 3 40 60 47 Core P8 Practical VIII : Data Mining

Lab

2 3 40 60 4

8 Soft skill- IV * 2 3 2Internship 2Total 27 30

* IA = Internal Assessment, EE = External Examination

Note : * - syllabus framed and approved by commerce /EnglishDepartment

FIFTH SEMESTER


Name of Course

C r e

d i t s

E x a m . D

u r a

t i o n Max.


IA* EE*

1 Core T17 Open Source Systems 4 3 25 75 42 Core - T18 Programming In Python 4 3 25 75 4

3 Core T19 Software Testing 4 3 25 75 44 Elective - III 1. Information Security

2.Enterprise Resource Planning3.Supply Chain Management

4 3 25 75 4

5 Elective IV 1. Clowd Comuting2. Embedded System3.Grid Computing

3 3 25 75 4

6 Core P9 Practical IX: Python Lab 3 3 40 60 57 Core P10 Practical X: Mini Project Work 2 3 40 60 5

Total 24 30* IA = Internal Assessment, EE = External Examination

5

8/8/2019 MCA Syllabus 20-04-10

6/49

SIXTH SEMESTER


Name of Course C r e

d i t Max.

MarksIA* EE*

1 Project Work 12 25 75* IA = Internal Assessment, EE = External Examination

a) For all subjects the passing requirement is as follows: i) candidate secures not less than 50%of marks in External examination (E.E.) and not less than 50% in aggregate of the totalmaximum marks prescribed in each theory & practical, and in Project work minimum 50%each in dissertation and Viva-Voce examination and not less than 50% in aggregate of the totalmaximum marks prescribed, shall be declared to have passed in the respective subject.

b) A candidate who passes in all subjects and in the project work earning 140 credits(including

soft Skills and Internship) within the maximum period of five years reckoned from the date of admission to the course shall be declared to have qualified for the degree.c) The relative overall performance of the candidate shall be determined by the overall

percentage of Marks obtained in all subjects evaluated as follows:

Sum of all (marks obtained X Credit) M i *C iWAM = ---------------------------------- ---------- = ------------------

Sum of all (maximum marks X Credit) C i

where M i is the mark obtained in the i th subject with credit C i .

This score shall be entered in the transcript given to the candidate on successful completion of the course calculated to two decimal points.

5. Classification of successful candidates

(a) A Candidate who qualifies for the Degree and secures WAM of not less than 75% shall bedeclared to have passed the examination in FIRST CLASS WITH DISTINCTION providedhe/she has passed the examination in every subject he/she has registered as well as in the

project work in the first appearance.(b) A candidate who qualifies for the degree as per the regulations for passing requirementsand secures a weighted average of not less than 60% shall be declared to have passed the

examination inFIRST CLASS. (c) All other successful candidates shall be declared to have passed in SECOND CLASS .

(d) Only those candidates who have passed all the papers including practical and project work in the first appearance shall be considered for the purpose of RANKING .

6. Procedure in the event of failure(a) If a candidate fails in a particular subject (other than Project work) he/she may reappear for the External examination in the subject in subsequent semesters and obtain passing marks.

6

8/8/2019 MCA Syllabus 20-04-10

7/49

(b) In the event of failure in Project Work, the candidate shall reregister for Project Work andredo the Project Work in a subsequent semester and resubmit the dissertation afresh for evaluation. The internal assessment marks shall be freshly allotted in this case.

7. Attendance

A candidate who has attendance of less than 75% overall in a semester shall not be permittedto take the External examination. However, it shall be open to the Academic Head/Principal togrant exemption to a candidate if he/she possess 65% or more attendance but less than 75%after paying the required condonation fee to the University for valid reasons and suchexemptions should not under any circumstances be granted for attendance below 65%.Candidates who have less than 65% and those who have less than 75% but have not got theexemption as above, has to repeat the semester from the next academic year.

8. Grading system

In addition to the above marking system, grading system is also adopted as detailed below:(a) The marks (sum of IA and UE marks) in each course is assigned with a letter grade on a

five point scale using the following letter grade, grade points and ranges of marks.-------------------------------------------------------

Grade Grade Points Ranges of Marks-------------------------------------------------------O 5 75% and above

A+ 4 65% and less than 75%A 3 60% and less than 65%B+ 2 55% and less than 60%B 2 50% and less than 55%

-------------------------------------------------------

(b) The letter grades are converted into grade points. The grade points of a particular course aremultiplied by the credit points assigned to the course. The weighted grade points for all thecourses prescribed in the Regulations are added and divided by the total credit points to arriveat overall grade point average (OGPA) rounded up to two decimal points.

OGPA = c i*g i/ ci

where c i is the credit, g i is the grade obtained in that paper, the sum is to be taken over allsubjects.

9. Provision for Lateral Admission

Candidates with PGDCS of this University or any other University as equivalent thereto, provided he/she satisfies the eligibility condition as above, shall be admitted to the Second year of the M.C.A. Degree Course.

7

8/8/2019 MCA Syllabus 20-04-10

8/49

10. PATTERN OF QUESTION PAPER (THEORY)

Time 3 hours Max Marks 75

Part AFIVE Out of EIGHT questions. (5 x 5 = 25 Marks)

At least one question from each unit and not more than two questions from each unit.

Part B FIVE questions (Internal Choice) (5 x 10 = 50 Marks)

One question from each unit. (Either or type).

11. PATTERN OF QUESTION PAPER (PRACTICAL)

Time: 3 HoursMax: 60 Marks.

One compulsory problem (may contain subdivisions) to be solved within 3 hours.

8

8/8/2019 MCA Syllabus 20-04-10

9/49

MASTER OF COMPUTER APPLICATIONS

FIRST SEMESTER SYLLBUS

Core-T1: Object Oriented Programming using C++

UNIT I: Introduction to OOP Overview of C++ - Classes Structures Union FriendFunctions Friend Classes Inline functions Constructors Destructors Static Members Scope Resolution Operator Passing objects to functions Function returning objects.

UNIT II: Arrays Pointers this pointer References Dynamic memory Allocation functions Overloading Default arguments Overloading Constructors Pointers to Functions

Ambiguity in function overloading.

UNIT III: Operator Overloading Members Operator Function Friend Operator Function Overloading some special operators like [ ] , ( ) , a and comma operator Inheritance Typesof Inheritance Protected members Virtual base Class Polymorphism Virtual functions Pure virtual functions.

UNIT IV: Class templates and generic classes Function templates and generic functions Overloading function templates power of templates Exception Handling Derived classException overhandling generic functions Exception handling Functions terminate ()unexpected () Uncaught exception ()

UNIT V: Streams Formatted I/O with ios class functions and manipulators creating ownmanipulator overloading > - File I/O Name spaces conversion functions Array

based I/O Standard Template Library (STL).

TEXT BOOKS:

1. Herbert Schildt, 2003, C++ The Complete Reference, Fourth Edition, Tata McGraw-Hill, New Delhi.

2. A.N Kanthane, 2005, Object Oriented Programming with ANSI & Turbo C++,SecondEdition, Pearson Education, New Delhi.

REFERENCE BOOKS:

1. J.P. Cohoon and J.W. Davidson, 1999, C++ Program Design An Introduction toProgramming and Object-oriented Design, Second Edition, Tata McGraw-Hill, NewDelhi.

2. Johnston, 2002, C++ programming today, Prentice-Hall of India Pvt. Ltd., New Delhi.

9

8/8/2019 MCA Syllabus 20-04-10

10/49

CORE-T2: COMPUTER ORGANIZATION AND ARCHITECTURE

UNIT I: Number System Converting numbers from one base to Complements BinaryCodes Boolean algebra Properties of Boolean algebra Boolean functions. LogicalOperations Logic gates - Adder Subtractor

UNIT II: Decoders Multiplexers Flip Flops Triggering of flip-flops Analyzing asequential circuit State reduction excitation tables Design of sequential circuits Counters.

UNIT III: Micro operations: Register transfer language, Register transfer, Bus and Memorytransfer, Arithmetic, logic, and shift micro operations, Arithmetic logic shift unit - micro

programmed control - control memory - Address sequencing

UNIT IV: Central processing unit: General register and stack organizations, instructionformats - Addressing modes, Data transfer and manipulation - program control, RISC -Pipelining - Arithmetic and instruction, RISC pipeline.

UNIT V: Input-output organization - peripheral devices, I/O interface, modes of transfer-Interrupt, Direct memory access, I/O processor.

TEXT BOOKS:

1. M.M. Mano, 1993, Computer System Architecture, Third Edition,Prentice-Hall of India Pvt. Ltd., New Delhi.2. D. P. Leach and A. P. Malvino, 2002, Digital Principles andApplications, Fifth Edition, Tata McGraw-Hill, New Delhi.

REFERENCE BOOKS :

1. M. Morris Mano, 1994, Digital Logic and computer Design, SecondEdition, Prentice-Hall of India Pvt. Ltd., New Delhi.2. V. C. Hamacher, G.Vranesic, S. G.Zaky,1982, Computer Organization,Third Edition, Tata McGraw-Hill, New Delhi.3. J. P.Hayes, 1988, Computer architecture,Third Edition, Tata McGraw-Hill, New Delhi.

10

8/8/2019 MCA Syllabus 20-04-10

11/49

CORE-T3: SYSTEM SOFTWARE

UNIT I: Language processors Language processing activities and fundamentals Languagespecification Development Tools Data Structures for Language processing- Scanners andParsers.

UNIT II: Assemblers: Elements of Assembly language programming Overview of theAssembly process - Design of a Two-pass Assembler - A single pass Assembler for the IBMPC.

UNIT III: Macros and Macro processors Macro definition, call, and expansion Nestedmacro calls Advanced macro facilities - Design of a macro preprocessor - Compilers:Aspects of compilation.

UNIT IV: Compilers and Interpreters Memory allocation - Compilation of Expressions andControl structures - Code optimization Interpreters. UNIT V: Linkers: Linking and Relocation concepts Design of a linker Self relocatingPrograms A linker for MS DOS - Linking for over-lays loaders - Software tools: Softwaretools for program development - Editors Debug monitors - Programming environments User interfaces.

TEXT BOOKS:

1. D. M. Dhamdhere, 1999, Systems Programming and Operating Systems,Second Revised Edition, Tata McGraw-Hill, and New Delhi.

REFERENCE BOOKS:

1. L. L. Beck, 1996, System Software an Introduction to System Programming,Third Edition, Addison-Wesley.

2. John J.Donovan, System Programming, First Edition, Tata McGraw Hill, New Delhi.

11

8/8/2019 MCA Syllabus 20-04-10

12/49

Core-T4: DATA STRUCTURES AND ALGORITHMS

UNIT I: Abstract data types - asymptotic notations complexity analysis Arrays- representation of arrays Linked lists: Singly linked list- Circular linked lists - Doubly linked lists stacks -queues -circular queues Postfix Notation.

UNIT II: Trees Binary Trees Binary Tree Traversals Binary Tree Representations BinarySearch Trees Threaded Binary Trees-Introduction to AVL Trees, Red-Black Trees, Splay Trees, B-Trees.

UNIT III: Representation of Graphs Graph Implementation Graph Traversals- Minimum CostSpanning Trees Shortest Path Problem.

UNIT IV : Divide and conquer Quick sort, Merge sort Greedy Method: General Method knapsack problem.

UNIT V: Back Tracking: General Method 8-queens - Branch and Bound: General Method -Traveling Salesperson problem.

TEXT BOOKS:

1. E. Horowitz, S. Sahni and S. Rajasekaran, 1999, Computer Algorithms,Galgotia Book source. Pvt. Ltd, New Delhi. Unit IV & V (Chapters 3, 4, 7, 8)

2. E.Horowitz, S. Sahni and Mehta, 1999, Fundamentals of Data Structures in C++, Second Edition, Galgotia Book source. Pvt. Ltd, New Delhi- Unit I to III(Chapters 1 to 6).

REFERENCE BOOKS:

1. G. L. Heileman, 1996, Data Structures Algorithms and Object OrientedProgramming, Tata McGraw-Hill, New Delhi.

2. A.V.Aho, J.D. Ullman, J.E. Hopcraft, 1983, Data Structures and Algorithms,Addison Wesley, Boston.

3. A.V. Aho, J.E. Hopcroft, J.D. Ullmann, 1974, The design and analysis of Computer Algorithms, Addison Wesley, Boston.

12

8/8/2019 MCA Syllabus 20-04-10

13/49

Practical I: PROGRAMMING IN C++

1. Program using functions.

2. Program using recursions

3. Program using classes

4. Program using inheritance

5. Program using operator overloading

6. Program using overloading

7. Program using pointers

8. Program using structures

9. Program using files

10. Program using virtual functions

13

8/8/2019 MCA Syllabus 20-04-10

14/49

Practical II: HTML LAB

1) Program to manipulate on Arrays

2) Program to create a simple calculator

3) Program to illustrate hyperlink using mouse move event.

4) Program to create a document which opens a new window without a toolbar, address

bar or a status bar that unloads itself after one minute.

5) Use the basic HTML structure tags, title, line break, multiple headings and link to e-

mail address.

6) An Html main page with an image and some text messages along with hyperlinks

which are linked to various pages. The navigation should be such that the links take you

to the appropriate page and then back to the main page.

7) Program for HTML page to demonstrate the usage of Frames. Choose the content of the

page on your own.

8) Design an application for pay slip through HTML forms.

9) Program for HTML page to demonstrate the usage of table tags.

10) Programming a website to maintain the students details.

14

8/8/2019 MCA Syllabus 20-04-10

15/49

Non-Major Elective-1: NUMERICAL AND STATISTICAL METHODS

UNIT I: Roots of Equations: Bisection Method False-Position Method Fixed-PointIteration Newton-Raphson Method Secant Method Roots of Polynomials: ConventionalMethods Algebraic Equations: Gauss Elimination Gauss-Jordan LU Decomposition Matrix Inverse Gauss-Seidel.

UNIT II: Numerical Differentiation and Integration: Trapezoidal Rule Simpsons Rule Romberg Integration Differential equations: Taylors method Eulers method Runge-Kutta 2 nd and 4 th order methods Predictor corrector methods.

UNIT III: Sample spaces - events - Axiomatic approach to probability - conditional probability - Independent events - Baye's formula - Random Variables - Continuous andDiscrete random variables - distribution function of a random variables - Characteristic of distributions - Expectation, variance - coefficient of variation, moment generation function -Chebyshev's inequality

UNIT IV: Correlation coefficient - Rank correlation coefficient of determination - Linear Regression - Method of Least squares - Fitting of the curve of the form ax + b, ax 2 + bx + c, ab x

and ax b - multiple and partial correlation (3 - variables only).

UNIT V: Concept of sampling Methods of sampling - simple random sampling - Systematicsampling and stratified random sampling (descriptions only) - concepts of samplingdistributions and standard error - point estimation (concepts only) - Interval Estimation of mean and proportion. Tests of Hypotheses - Critical Region - two types of Errors - Level of significance - power of the test - Large sample tests for mean and proportion - Exact tests

based on Normal, t, F and Chi-square distributions.

TEXT BOOKS :

1. S.S. Sastri, 1977, Introductory Methods of Numerical Analysis, Prentice Hall India, New Delhi.(Units I & II)

2. P.R. Vital,2004, Mathematical Statistics, Marghan Publication (Unit III,IV & V)

REFERENCE BOOKS:

1. S. C. Chopra and R. P.Canale, 2002, Numerical Methods for Engineers, Fourth Edition,McGraw Hill International Edition.

2. Trivedi, K.S, 1994, Probability and Statistics with Reliability, Queuing and Computer

Science Applications. Prentice Hall India, New Delhi.3. Arnold O. Allen, 1978, Probability, Statistics and Queuing Theory with Computer Science Application.

15

8/8/2019 MCA Syllabus 20-04-10

16/49

SECOND SEMESTER SYLLBUS

Core-T5: MICROPROCESSORS AND ITS APPLICATIONS

UNIT I: Introduction to 8086 assembly language programming - Development steps Construction - Writing Programs and Development Tools Standard program structures simple Programs Jumps While-do repeat-until- Delay loops.

UNIT II: Strings Procedures Macros Instruction Descriptions Assembler Directives.

UNIT III: 8086 Microcomputer Observing Bus signals Minimum mode System Troubleshooting 8086 interrupts Interrupt Applications Programmable timer/Counter Interrupt Controller.

UNIT IV: Programmable Parallel Ports and Handshake Input/Output, Interfacing aMicroprocessor to Keyboards, Interfacing to Alphanumeric Displays - Analog Interfacing -Review of Operational-amplifier Characteristics and Circuits Sensors and Transducers D/AConverter Operation, Interfacing, and Applications A/D Converter - specifications, Types

UNIT V: Direct Memory Access (DMA) Data Transfer Interfacing and Refreshing DynamicRAMs A CoprocessorThe 8087 Math Coprocessor -Computer-based Design andDevelopment Tools EDA Tools higher end microprocessors.

TEXTBOOKS:

1. D. V. Hall , 1992, Microprocessors and Interfacing, Programming and Hardware,Second Edition, Tata McGraw Hill, New Delhi .

2. Ramesh S. Gaonkar, 2000, Microprocessor Architecture Programming andApplications with 8085, Fourth edition, Penram International Publishing (i) Pvt Ltd.

REFERENCE BOOKS:

1. K. Udaya Kumar and B.S. Uma shankar, 1998, Advanced Microprocessors and IBM,PC Assembly Language Programming, Tata McGraw-Hill, New Delhi.

2. P. Mathur, 1989, Introduction to Microprocessors, Third Edition, Tata McGraw-Hill, New Delhi.

3. Yu Cheng Liu & Glenn A Gibson,2005,Microcomputer Systems 8086/8088 Family ,Second Edition, Prentice-Hall of India Pvt. Ltd., New Delhi..

4. Ak Ray K M Bhurchani , 2006, Advanced Microprocessors and Peripherals, Sixth

Edition, Tata McGraw-Hill,New Delhi.

16

8/8/2019 MCA Syllabus 20-04-10

17/49

Core-T6: OPERATING SYSTEMS UNIT I: Introduction Multiprogramming - Time sharing - Distributed system - Real-Timesystems - I/O structure - Dual-mode operation - Hardware protection _ General systemarchitecture - Operating system services - System calls - System programs - System design andimplementation. Process Management: Process concept - Concurrent process - Schedulingconcepts - CPU scheduling - Scheduling algorithms, Multiple processor Scheduling

UNIT II: Process Management: Process Synchronization - Critical section - Synchronizationhardware - Semaphores, classical problem of synchronization, Interprocess communication.Deadlocks: Characterization, Prevention, Avoidance, and Detection.

UNIT III: Storage management - Swapping, single and multiple partition allocation - paging -segmentation - paged segmentation, virtual memory - demand paging - page replacement andalgorithms, thrashing. Secondary storage management - disk structure - free space management- allocation methods disk scheduling - performance and reliability improvements - storagehierarchy.

UNIT IV: Files and protection - file system organization - file operations - access methods -consistency semantics - directory structure organization - file protection - implementationissues - security encryption

UNIT V: History of Linux- Properties of LINUX -Basic and advanced commands- Generaloverview of the Linux file system-orientation in the file system-manipulation of files filesecurity

TEXT BOOKS:

1. Silberschatz P.B. Galvin, Gange, 2002, Operating System Concepts, SixthEdition, Addison-Wesley Publishing Co., Boston.

2. Machtelt Garrels , Introduction to Linux - A Hands on Guide-e book

REFERENCE BOOKS:

1. H.M. Deitel, 1990, An Introduction to Operating Systems, Addison WesleyPublishing Co., Boston

2. D.M. Dhamdhare , 2002, Operating System, Second Revised Edition,TataMcGraw-Hill, New Delhi.

3. A.S. Tanenbaum , 1992, Operating Systems: Design and Implementation,Second Edition, Prentice-Hall of India, New Delhi.

17

8/8/2019 MCA Syllabus 20-04-10

18/49

Core-T7: OBJECT ORIENTED SOFTWARE ENGINEERING

UNIT I: Software life cycle models: Waterfall, RAD, and Spiral model. Process metric-Product metrics-Estimation- LOC, FP, COCOMO models. Project Management-Planning,Scheduling and Tracking. Software Quality Quality Standards, Quality Metrics

UNIT II: System Concepts for Object Modeling Abstraction, Inheritance, Polymorphism,Encapsulation, Message Sending, Association, Aggregation. Requirement WorkflowFunctional, Nonfunctional- Characteristics of Requirements- Requirement ElicitationTechniques-Requirement Documentation Use case specification, Activity Diagram

UNIT III: Use-Case Modeling Actors, Use Cases, Use Case Relationships. The Process of Requirements Use-Case -Identify Business Actors, Identify Business Requirements Use Cases,Construct Use Case Model Diagram-Class Diagrams and Object Diagrams-Package Diagrams-Sequence and Collaboration diagrams, State chart diagram.

UNIT IV: Design Workflow- System Design Concept Coupling and Cohesion- ArchitecturalStyles- Identifying Subsystems and Interfaces- Design Patterns. Implementation Workflow-Mapping models to Code- Mapping Object Model to Database Schema. Testing- FormalTechnical Reviews Walkthrough and Inspection

UNIT V: Software Configuration Management- Managing and controlling Changes-Managingand controlling versions. Maintenance-Types of maintenance- Maintenance Log and defectreports-Reverse and re-engineering

TEXT BOOKS:

1. Roger Pressman, Software Engineering, sixth edition, Tata McGraw Hill( for UNIT I)2. Bahrami, 1999, Object Oriented Systems Development, Tata McGraw Hill

International Edition.(for UNIT II and III)3. Bernd Bruegge, 2004, Object oriented software engineering , Second Edition, Pearson

Education. ( For UNIT II,UNIT IV and UNIT V)

REFERENCE BOOKS:

1. Stephan R. Schach, 2002, Object oriented software engineering , Fifth Edition,Tata McGraw-Hill, New Delhi.2. Timothy C. Lethbridge, Robert Laganiere , Object-Oriented Software Engineering

A practical software development using UML and Java , Second Edition, TataMcGraw-Hill, New Delhi.

18

8/8/2019 MCA Syllabus 20-04-10

19/49

Core-T8: PROGRAMMING IN JAVA

UNIT I: Introduction to Java - Features of Java - Object Oriented Concepts - Lexical Issues -Data Types - Variables - Arrays - Operators - Control Statements. Classes - Objects -Constructors - Overloading method - Access Control - Static and fixed methods - Inner Classes- String Class - Inheritance - Overriding methods - Using super-Abstract class.

UNIT II: Packages - Access Protection - Importing Packages - Interfaces - ExceptionHandling - Throw and Throws - Thread - Synchronization - Messaging - Runnable Interface -Inter thread Communication - Deadlock - Suspending, Resuming and stopping threads -Multithreading.

UNIT III: I/O Streams - File StreamsEvents handling - String Objects - String Buffer - Char Array - Java Utilities.

UNIT IV: Applets- Working with windows using AWT Classes - AWT Controls - LayoutManagers and Menus, jdbc connectivity.

UNIT V : Networks basics - Socket Programming - Proxy Servers - TCP/IP Sockets - NetAddress - URL - Datagram Basics of Servlets

TEXT BOOKS:

1. P. Naughton and H. Schildt, 1999, Java2 (The Complete Reference), FifthEdition, Tata McGraw-Hill, New Delhi.

REFERENCE BOOKS:

1. C. S. Horstmann, Gary Cornell, 1999, Paper Java 2 Vol. I Fundamentals,Pearson Education, Delhi.

2. H.M.Deital and P.J. Deital, 2005, Java: How to program, Fifth Edition, PearsonEducation, Delhi.

19

8/8/2019 MCA Syllabus 20-04-10

20/49

Practical III: PROGRAMMING IN JAVA

APPLICATION

1. Program using Random Class.2. Programming using in Inheritance.3. Usage of Calendar Class and manipulation.4. String Manipulation using Char Array.5. Program using Exception Handling.6. Program using vectors7. Program using Files8. Implementing Thread based applications9. Application Using JDBC Connectivity

APPLETS

10. Working with Frames and various controls.11. Working with Dialogs and Menus.12. Working with Panel and Layout.13. Incorporating Graphics.

20

8/8/2019 MCA Syllabus 20-04-10

21/49

Practical IV: MICROPROCESSOR AND OPERATING SYSTEM

Microprocessor Programs- Using 8086 Microprocessor kit/ MASM Software

1. Multi byte Addition/Subtraction of signed Numbers.2. Computing LCM.3. Computing GCD of n Numbers.4. Insertion Sort.5. Linear Search.6. Computing Factorial.7. Computing nC r .8. Generating Fibonacci number.9. Checking Prime or not.10. Clearing Screen.11. Moving string of characters on the CRT.

Operating system Programs

1. Inter Process Communication (IPC) using Message Queues.2. IPC using pipes.3. Implementations of wait and signal using counting semaphores.4. Atomic Counter update problem.5. Signaling processes.6. Process Scheduling: FCFS7. Process Scheduling: Least Frequently Used.8. Process Scheduling: Round Robin.9. Producer-Consumer problem with limited buffers.

21

8/8/2019 MCA Syllabus 20-04-10

22/49

Non-Major Elective-2: Operations Research

Unit 1: Linear Programming - Formulation - Graphical solution (2 variables only) of LPP -Development of simplex method - Artificial variable Techniques - Big - M method - Two

phase method - Revised simplex method

Unit 2: Duality in Linear Programming and its formulation - Duality Theory, Dual simplexmethod - Bounded variables method - Applications of LPP - Transportation problem -Assignment Problem - Traveling Salesman Problem.

Unit 3: Integer Programming Problem (IPP) - cutting plane Algorithm - Branch and Method of solving IPP Game Theory: Minimax and Maximin rules, saddle point, Two person Zero-sumgames, Finding Optimum Strategies

Unit 4: Sequencing problem - processing n jobs through two machines and three machines - processing n jobs through m machines - processing 2 jobs through m machines - projectscheduling by PERT/CPM - Difference between PERT and CPM - Constructing the network -critical path analysis - Float of an Activity - Three time Estimated for PERT - Project cost byCPM

Unit 5: Stochastic processes - Classification of stochastic processes - Discrete parameter Markov chains - continuous parameter Markov chains - Birth and death processes - Queuingmodels and its characteristics - classification of Queuing models - (M/M/1) : (FCFS) (Birthand death model)

TEXT BOOKS:

1. Taha, H.A, 1995, Operations Research, 3rd Edition, Prentice Hall of India, NewDelhi.

2. Kantiswrap,Manmohan, P.K.Gupta, Operations Research, Sultan Chand &Sons,2008

REFERENCE BOOKS:

1. Sharma J.K, 1989, Mathematical Models in Operations Research, Tata McGrawHill, New Delhi.

2. Trivedi K.S, 1994, Probability and Statistics with Reliability, Queuing andComputer Science Applications, Prentice Hall of India, New Delhi.

22

8/8/2019 MCA Syllabus 20-04-10

23/49

THIRD SEMESTER

Core-T9 DATABASE MANAGEMENT SYSTEMS

UNIT I : INTRODUCTION

Historical perspective - Files versus database systems - Architecture - E-R model - Security

and Integrity - Data models.

UNIT II : RELATIONAL MODEL

The relation - Keys - Constraints - Relational algebra and Calculus - Queries - Programming

and triggers

UNIT III : DATA STORAGE

Disks and Files - file organizations - Indexing - Tree structured indexing - Hash Based

indexing

UNIT IV : QUERY EVALUATION AND DATABASE DESIGN

External sorting - Query evaluation - Query optimization - Schema refinement and

normalization - Physical database design and tuning - Security

UNIT V : TRANSACTION MANAGEMENT

Transaction concepts - Concurrency control - Crash recovery - Decision support - Case studies

TEXTBOOKS:

1. Raghu RamaKrishnan and Johannes Gehrke, 2000, Database Management Systems ,

McGraw Hill International Editions.

2. C. J. Date, 1997,An Introduction to Database Systems, Seventh Edition, Addison

Wesley.

REFERENCES:

1. Abraham Silberschatz, Henry. F. Korth and S. Sudharshan, , 1997, Database system

Concepts, Third Edition, Tata McGraw Hill.

2. Mata Toledo, 2007, Database Management Systems, Tata McGraw-Hill, New Delhi.

23

8/8/2019 MCA Syllabus 20-04-10

24/49

Core-T10 COMPUTER GRAPHICS

UNIT I : BASIC CONCEPTS

2D Transformations Clipping Window View Prot Mapping Graphical User Interfaces

and Interactive Input Methods Picture Construction Techniques Virtual Reality

Environment.

UNIT II: 3D GRAPHICS

3D Transformation 3D Viewing Visible Surface Detection Back Face Detection Depth

Buffer Method Scan Line Method.

UNIT III: VISUAL COMMUNICATION

Creative Process Digital Imaging Technology Still Image Digital Imaging Using

Images in Multimedia Images on Web Color Models.

UNIT IV: PRESENTATION

General Design Issues Architectural Issues Information Characteristics for Presentation

Presentation function Presentation Design Knowledge Effective Human Computer

Interaction.

UNIT V: INTERACTIVE 3D ILLUSTRATED WITH IMAGES AND TEXT

Generating Illustrated Documents Consistency of Rendered Images and their Textual Labels

Architecture Zoom Techniques for Illustration Purpose Interactive handling of Images

and Text Figure Captions for Anatomical Illustrations.

TEXTBOOKS:

1. Donald Hearn and M. Pauline Baker, Computer Graphics in C Version, Second Edition,

Pearson Education.

24

8/8/2019 MCA Syllabus 20-04-10

25/49

2. Raf Steinmetz and Klara Nahrstedt, 1995, Multimedia: Computing, Communication

and applications, Pearson Education.

REFERENCES:

1. John Villamil Casanova and Leony Fernandez-Elias, 2000, Multimedia Graphics,

Prentice Hall India.

2. Thomas Strothotte, , 1998, Computer Visualization-Graphics Abstraction and

Interactivity, Springer Verlag, Berlin Heiderberg.

3. Amarendra n sinha arun d udai, 2008, Computer Graphics, Tata MaGraw-Hill, New

Delhi.

25

8/8/2019 MCA Syllabus 20-04-10

26/49

Core-T11 ACCOUNTING AND FINANCIAL MANAGEMENT

UNIT I : FINANCIAL ACCOUNTING

Meaning and Scope of Accounting-Principles-Concepts-Conventions-Accounting Standards-

Final Accounts-Trail Balance-Trading Account-Profit and Loss Account-Balance Sheet-

Accounting Ratio Analysis-Funds Flow Analysis-Cash Flow Analysis

UNIT II: ACCOUNTING

Meaning-Objectives-Elements of Cost-Cost Sheet-Marginal Costing and Cost Volume Profit

Analysis-Break Even Analysis-Applications-Limitations-Standard Costing and Variance

Analysis-Material-Labor-Overhead-Sales-Profit Variances

UNIT III: BUDGETS AND BUDGETING CONTROL

Budgets and Budgetary Control-Meaning-Types-Sales Budget-Production Budget-Cost of

Production Budget-Flexible Budgeting-Cash Budget-Master Budget-Zero Base Budgeting-

Computerized Accounting

UNIT IV: INVESTMENT DECISION AND COST OF CAPITAL

Objectives and Functions of Financial Management-Risk-Return Relationship-Time Value of

Money Concepts-Capital Budgeting-Methods of Appraisal-Cost of Capital Factors Affecting

Cost of Capital-Computation for Each Source of Finance and Weighted Average Cost of

Capital

UNIT V: FINANCING DECISION AND WORKING CAPITAL MANAGEMENT

Capital Structure-Factors Affecting Capital Structure-Dividend Policy-Types of Dividend

Policy-Concepts of Working Capital-Working Capital Policies-Factors affecting Working

Capital-Estimation of Working Capital Requirements

TEXTBOOKS:

1. S.N.Maheswari, 2003,Financial and Management Accounting, Sultan Chand & Sons.

2. I.M.Pandey, 2002 , Financial Management, Fourth Reprint, Vikas Publications.

26

8/8/2019 MCA Syllabus 20-04-10

27/49

REFERENCES:

1. S.P.Iyengar, Cost and Management Accounting, Sultan Chand & Co.

2. I.M.Pandey, 1993, Elements of Management Accounting, Vikas Publishing House.

27

8/8/2019 MCA Syllabus 20-04-10

28/49

Core-T12 ENTERPRISE COMPUTING

UNIT I : Introducing J2EE : Application Components- Roles Working with the Model-View

Controller J2EE standard services Application Component API - Servlet Life-Cycle

Performing URL redirection- using JDBC in servlets Applet to servlet communication

UNIT II : Java Beans : The Component Model - JavaBeans Architecture writing simple

beans - EJB : EJB Component model Reviewing roles, relationships and responsibilities-

Enterprise JavaBean-Entity Beans-session beans-message driven beans- understanding EJB

container Functionality

UNIT III : RMI : Overview Developing applications with RMI:Declaring & Implementing

remote interfaces-stubs & skeletons,Registering remote objects,writing RMI clients Pushing

data from RMI Servlet RMI over Inter-ORB Protocol

UNIT IV : JSP : Introduction JSP-Examining MVC and JSP -JSP scripting elements &

directives-Working with variables scopes-Error Pages - using Java Beans in JSP

UNIT V : JavaMail : Working with Java Mail-Understanding Protocols for Javamail-

Components-Javamail API-Integrating into J2EE-Understanding Java Messaging Services

TEXT BOOKS:

1. J. McGovern, R. Adatia, Y. Fain, 2003, J2EE 1.4 Bible, Wiley-dreamtech India Pvt.

Ltd, New Delhi. (1, 2, 3 units).

REFERENCE BOOKS :

1. Herbert Schildt, 2002, Java 2 Complete Reference, Fifth Edition, Tata McGraw Hill,

NewDelhi.

2. K. Moss, 1999, Java Servlets, Second edition, Tata McGraw Hill, New Delhi.

3. Joseph ONeil, 1998, Java Beans from the Ground Up, Tata McGraw Hill.

4. TomValesky,2003, Enterprise JavaBeans, Second Edition, Addison Wesley.

28

8/8/2019 MCA Syllabus 20-04-10

29/49

5. Cay S Horstmann & Gary Cornell, Core Java Vol II Advanced Features, Addison

Wesley.

29

8/8/2019 MCA Syllabus 20-04-10

30/49

ELECTIVE I

1. NEURO FUZZY SYSTEMS

UNIT I: INTRODUCTION TO SOFT COMPUTING AND NEURAL NETWORKS

Evolution of Computing - Soft Computing Constituents From Conventional AI to

Computational Intelligence - Machine Learning Basics

UNIT II : GENETIC ALGORITHMS

Introduction to Genetic Algorithms (GA) Applications of GA in Machine Learning -

Machine Learning Approach to Knowledge Acquisition.

UNIT III: NEURAL NETWORKS

Machine Learning Using Neural Network, Adaptive Networks Feed forward Networks Supervised Learning Neural Networks Radial Basis Function Networks - Reinforcement

Learning Unsupervised Learning Neural Networks Adaptive Resonance architectures

Advances in Neural networks.

UNIT IV: FUZZY LOGIC

Fuzzy Sets Operations on Fuzzy Sets Fuzzy Relations Membership Functions- Fuzzy

Rules and Fuzzy Reasoning Fuzzy Inference Systems Fuzzy Expert Systems Fuzzy

Decision Making.

UNIT V: NEURO-FUZZY MODELING

Adaptive Neuro-Fuzzy Inference Systems Coactive Neuro-Fuzzy Modeling Classification

and Regression Trees Data Clustering Algorithms Rulebase Structure Identification

Neuro-Fuzzy Control Case studies.

TEXT BOOKS:

Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, 2003, Neuro-Fuzzy and Soft

Computing, Prentice-Hall of India.

2. George J. Klir and Bo Yuan, 1995, Fuzzy Sets and Fuzzy Logic-Theory and Applications,

Prentice Hall.

3. James A. Freeman and David M. Skapura, 2003, Neural Networks Algorithms,

30

8/8/2019 MCA Syllabus 20-04-10

31/49

Applications, and Programming Techniques, Pearson Education.

REFERENCES :

Mitchell Melanie, 1998, An Introduction to Genetic Algorithm, Prentice-Hall of India.

1. David E. Goldberg, 1997, Genetic Algorithms in Search, Optimization and Machine

Learning, Addison Wesley.

2. S. N. Sivanandam, S. Sumathi and S. N. Deepa, 2007, Introduction to Fuzzy

Logic using MAT LAB, Springer.

3. S.N.Sivanandam, S.N.Deepa, 2007, Introduction to Genetic Algorithms, Springer.

4. Jacek M. Zurada, 1992, Introduction to Artificial Neural Systems, PWS Publishers.

31

8/8/2019 MCA Syllabus 20-04-10

32/49

2. MIDDLEWARE TECHNOLOGIES

UNIT I IT ARCHITECTURE AND EMERGENCE OF MIDDLEWARE

IT Architecture Evolution And Development Middleware Remote Procedure Calls Data

Base Access Distributed Transaction Processing Message Queuing Object Middleware

Internet Applications Web Services Middleware Inter Operability.

UNIT II DISTRIBUTED APPLICATION

Support For Business Process Information Retrieval Multi Tier Functionalities

Architecture Middleware Bus Architecture Hub And Web Services Architecture

Resiliency Performance And Scalability Design Issues.

UNIT III SYSTEM MANAGEMENT & SECURITY

Functions & Users Functional Categories Interrelationships And Organization System

Management Technology Distributed System Security Web Service Security.

UNIT IV APPLICATION DESIGN AND IT ARCHITECTURE

Existing Systems Reuse Architecture & Levels Of Design Reconciling Design

Approaches Implementing Business Process Architecture Process Pattern Classification

And Analysis Error Handling Timing Migrations Flexibility Integration Design Issues.

UNIT V INFORMATION ACCESSES AND INFORMATION ACCURACY

Process Information Process Management & Improvement Requirements Of

Information Access Information Accuracy Shared Data Or Controlled Duplication

Consistency In Existing In Databases Data Migration Tuning Existing Applications To

Services Building A Middle Tier Changing Middleware Between Transaction Services

Case Study Service Orientation Architecture.

TEXT BOOKS:

1. Chris Britton, Peter Bye, 2004, IT Architecture and Middleware, A Staligies for

Building Large Integrated System, Addition Wesley.

2. T. J. Mowbray, 1997, Inside CORBA: Distributed Object Standards and Applications,

Addison Wesley.32

8/8/2019 MCA Syllabus 20-04-10

33/49

3. N.Wallace, 2000, COM/DCOM Blue Book, Dreamtech Press.

33

8/8/2019 MCA Syllabus 20-04-10

34/49

3. ARTIFICIAL INTELLIGENCE

UNIT I : INTRODUCTION

Intelligent Agents Agents and environments Good behavior The nature of environments

structure of agents Problem Solving problem solving agents example problems

searching for solutions uniformed search strategies avoiding repeated states

searching with partial information.

UNIT II: SEARCHING TECHNIQUES

Informed search strategies heuristic function local search algorithms and optimistic

problems local search in continuous spaces online search agents and unknown

environments Constraint satisfaction problems (CSP) Backtracking search and Local

search Structure of problems Adversarial Search Games Optimal decisions in games

Alpha Beta Pruning imperfect real-time decision games that include an element of

chance.

UNIT III : KNOWLEDGE REPRESENTATION

First order logic - syntax and semantics Using first order logic Knowledge engineering

Inference prepositional versus first order logic unification and lifting forward chaining

backward chaining Resolution Knowledge representation Ontological Engineering

Categories and objects Actions Simulation and events Mental events and mental objects.

UNIT IV: LEARNING Learning from observations forms of learning Inductive learning - Learning decision

trees Ensemble learning Knowledge in learning Logical formulation of learning

Explanation based learning Learning using relevant information Inductive logic

programming - Statistical learning methods Learning with complete data Learning with

hidden variable EM algorithm Instance based learning Neural networks

34

8/8/2019 MCA Syllabus 20-04-10

35/49

Reinforcement learning Passive reinforcement learning Active reinforcement learning

Generalization in reinforcement learning.

UNIT V : APPLICATIONS

Communication Communication as action Formal grammar for a fragment of English

Syntactic analysis Augmented grammars Semantic interpretation Ambiguity and

disambiguation Discourse understanding Grammar induction Probabilistic language

processing Probabilistic language models Information retrieval Information Extraction

Machine translation.

REFERENCES:

1. Stuart Russell, Peter Norvig, 2004, Artificial Intelligence A Modern Approach,

Second Edition, Pearson Education / Prentice Hall of India.

2. Nils J. Nilsson, 2000, Artificial Intelligence: A new Synthesis, Harcourt Asia Pvt. Ltd.

3. Elaine Rich and Kevin Knight, 2003, Artificial Intelligence, Second Edition, Tata

McGraw Hill.

4. George F. Luger, 2002, Artificial Intelligence-Structures and Strategies for Complex

Problem Solving, Pearson Education / Prentice-Hall of India.

35

8/8/2019 MCA Syllabus 20-04-10

36/49

CORE P5 ADVANCED JAVA LAB

1. HTML to Servlet Applications

2. Applet to Servlet Communication

3. Designing online applications with JSP

4. Creating JSP program using Java Beans

5. Working with Enterprise Java Beans

6. Performing Java Database Connectivity.

7. Creating Web services with RMI.

8. Creating and Sending Email with Java

9. Building web applications

CORE P6 RDBMS LAB

1. Library Information Processing

2. Students Mark sheet Processing3. Telephone Directory Maintenance

4. Gas Booking and Delivery System

5. Electricity Bill Processing

6. Bank Transactions (SB)

7. Pay Roll Processing

8. Inventory

9. Question Database and Conducting Quiz

10. Purchase Order Processing.

36

8/8/2019 MCA Syllabus 20-04-10

37/49

FOURTH SEMESTER

Core T13 DATA WAREHOUSING AND DATA MINING

UNIT I: Data Warehousing and Business Analysis: - Data warehousing Components

Building a Data warehouse Mapping the Data Warehouse to a Multiprocessor Architecture

DBMS Schemas for Decision Support Data Extraction, Cleanup, and Transformation Tools

Metadata reporting Query tools and Applications Online Analytical Processing (OLAP)

OLAP and Multidimensional Data Analysis.

UNIT II: Data Mining: - Data Mining Functionalities Data Preprocessing Data Cleaning Data Integration and Transformation Data Reduction Data Discretization and Concept

Hierarchy Generation. Association Rule Mining: - Efficient and Scalable Frequent Item set

Mining Methods Mining Various Kinds of Association Rules Association Mining to

Correlation Analysis Constraint-Based Association Mining.

UNIT III: Classification and Prediction: - Issues Regarding Classification and Prediction

Classification by Decision Tree Introduction Bayesian Classification Rule Based

Classification Classification by Back propagation Support Vector Machines Associative

Classification Lazy Learners Other Classification Methods Prediction Accuracy and

Error Measures Evaluating the Accuracy of a Classifier or Predictor Ensemble Methods

Model Section.

UNIT IV: Cluster Analysis: - Types of Data in Cluster Analysis A Categorization of Major

Clustering Methods Partitioning Methods Hierarchical methods Density-Based Methods

Grid-Based Methods Model-Based Clustering Methods Clustering High-Dimensional

Data Constraint-Based Cluster Analysis Outlier Analysis.

UNIT V: Mining Object, Spatial, Multimedia, Text and Web Data:

Multidimensional Analysis and Descriptive Mining of Complex Data Objects Spatial Data

Mining Multimedia Data Mining Text Mining Mining the World Wide Web.

TEXT BOOKS:

1. Alex Berson and Stephen J. Smith, 2007, Data Warehousing, Data Mining & OLAP,

37

8/8/2019 MCA Syllabus 20-04-10

38/49

Tenth Reprint, Tata McGraw Hill Edition.

REFERENCES:

1. Jiawei Han and Micheline Kamber, Data Mining Concepts and Techniques, SecondEdition.

2. K.P. Soman, Shyam Diwakar and V. Ajay , 2006,Insight into Data mining Theory and

Practice, Easter Economy Edition, Prentice Hall of India.

3. G. K. Gupta , 2006,ntroduction to Data Mining with Case Studies, Easter Economy

Edition, Prentice Hall of India.

4. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, 2007,Introduction to Data

Mining, Pearson Education.

5. Matteo Golfarelli, Stefand Rizzi, 2009, Data Warehouse Design, Tata McGraw Hill

Edition.

6. Mattias jarke Maurizio Lenzerini Yannis Vassilliou Panos Vassiliadis, 2002,

Fundamental of Data ware houses, Springer International Edition.

38

8/8/2019 MCA Syllabus 20-04-10

39/49

Core T14 MOBILE COMPUTING

UNIT I WIRELESS COMMUNICATION FUNDAMENTALS

Introduction Wireless transmission Frequencies for radio transmission Signals

Antennas Signal Propagation Multiplexing Modulations Spread spectrum MAC

SDMA FDMA TDMA CDMA Cellular Wireless Networks.

UNIT II TELECOMMUNICATION SYSTEMS

GSM System Architecture Protocols Connection Establishment Frequency Allocation

Routing Handover Security - GPRS

UNIT III WIRELESS NETWORKS

Wireless LAN IEEE 802.11 Standards Architecture services HIPERLAN AdHoc

Network Blue Tooth.

UNIT IV NETWORK LAYER

Mobile IP Dynamic Host Configuration Protocol Routing DSDV DSR AODV ZRP ODMR.

UNIT V TRANSPORT AND APPLICATION LAYERS

TCP over Wireless Networks Indirect TCP Snooping TCP Mobile TCP Fast Retransmit

/ Fast Recovery Transmission/Timeout Freezing Selective Retransmission Transaction

Oriented TCP WAP WAP Architecture WDP WTLS WTP WSP WML WML

Script WAE WTA.

TEXT BOOKS:

1. Jochen Schiller, Mobile Communications, Second Edition, Prentice Hall of India

/ Pearson Education, 2003.

39

8/8/2019 MCA Syllabus 20-04-10

40/49

2. William Stallings, Wireless Communications and Networks, Second Edition,

Prentice Hall of India / Pearson Education, 2004.

REFERENCES:

1. Kaveh Pahlavan, Prasanth Krishnamoorthy, Principles of Wireless Networks,

Pearson Education, 2003.

2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, Principles of

Mobile Computing, Springer, New York, 2003.

3. C.K.Toh, AdHoc Mobile Wireless Networks, Prentice Hall Inc., 2002.

4. George Aggelou, Mobile Ad Hoc Networks from Wireless Lans to 4G Networks Tat

McGraw-Hill Edition

40

8/8/2019 MCA Syllabus 20-04-10

41/49

CORE T16: DOT NET PROGRAMMING USING WEB SERVICES

UNIT I: Introduction to .net- Understanding CLR- Understanding .net Framework-CommonClass Library Languages in .net - Working with Visual Studio2008

UNIT II: ASP. NET Language Structure Page Structure Page event, Properties &Compiler Directives -Using import-conditional statements-looping statements-Arrays-structures- Enumerators and delegates. Procedures & Functions- Understanding Scope-Exception handling

UNIT IV: . HTML server controls Anchor, Tables, Forms, Files. Basic Web server Controls Label, Textbox, Button, Image, Links, Check & Radio button, Hyperlink. Data List WebServer Controls Check box list, Radio button list, Drop down list, List box, Data grid,Repeater.

UNIT IV: Request and Response Objects, Cookies, Working with Data OLEDB connectionclass, command class, transaction class, data adaptor class, data set class.

Unit V : Advanced Issues Email, Application Issues, Working with IIS and page Directives ,Error handling. Security Authentication , IP Address, Secure by SSL & Client Certificates.

TEXT BOOKS:

1. G.Buczek, 2002, ASP.NET Developers Guide, Tata McGraw Hill.2. Mathew MacDonald, ASP.NET : The Complete Reference, Tata McGraw Hill.

REFERENCE:

1. Richard Anderson, Professional ASP.NET, Wrox Press Ltd.

41

8/8/2019 MCA Syllabus 20-04-10

42/49

ELECTIVE II

1. NATURAL LANGUAGE PROCESSING

UNIT I INTRODUCTION

Natural Language Processing Linguistic Background- Spoken language input and output

Technologies Written language Input - Mathematical Methods - Statistical Modeling and

Classification Finite State methods Grammar for Natural Language Processing Parsing

Semantic and Logic Form Ambiguity Resolution Semantic Interpretation.

UNIT II INFORMATION RETRIEVAL

Information Retrieval architecture - Indexing- Storage Compression Techniques Retrieval

Approaches Evaluation - Search engines- commercial search engine features- comparison-

performance measures Document Processing - NLP based Information Retrieval

Information Extraction.

UNIT III TEXT MINING

Categorization Extraction based Categorization- Clustering- Hierarchical Clustering-

Document Classification and routing- finding and organizing answers from Text search use

of categories and clusters for organising retrieval results Text Categorization and efficient

Summarization using Lexical Chains Pattern Extraction.

UNIT IV GENERIC ISSUES

Multilinguality Multilingual Information Retrieval and Speech processing - Multimodality

Text and Images Modality Integration - Transmission and Storage Speech coding-

Evaluation of systems Human Factors and user Acceptability.

42

8/8/2019 MCA Syllabus 20-04-10

43/49

UNIT V APPLICATIONS

Machine Translation Transfer Metaphor - Interlingua and Statistical Approaches - DiscourseProcessing Dialog and Conversational Agents Natural Language Generation Surface

Realization and Discourse Planning.

TEXT BOOKS:

1. Daniel Jurafsky and James H. martin, Speech and Language Processing , 2000.

2. Ron Cole, J.Mariani, et.al Survey of the State of the Art in Human Language

Technology, Cambridge University Press, 1997.

3. Michael W. Berry Survey of Text Mining: Culstering, Classification and Retrieval,

Springer Verlag, 2003.

4. Christopher D.Manning and Hinrich Schutze, Foundations of Statistical Natural

Language Processing , MIT Press, 1999.

REFERENCES:

1. James Allen Natural Language Understanding , Benjamin/ Cummings Publishing

Co. 1995.

2. Gerald J. Kowalski and Mark.T. Maybury, Information Storage and Retrieval

systems, Kluwer academic Publishers, 2000.

3. Tomek Strzalkowski Natural Language Information Retrieval , Kluwer academic

Publishers, 1999.

4. Christopher D.Manning and Hinrich Schutze, Foundations of Statistical NaturalLanguage Processing , MIT Press, 1999.

43

8/8/2019 MCA Syllabus 20-04-10

44/49

2. SOFTWARE PROJECT MANAGEMENT

UNIT I INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT

Project Definition Contract Management Activities Covered By Software Project

Management Overview Of Project Planning Stepwise Project Planning .

UNIT II PROJECT EVALUATION

Strategic Assessment Technical Assessment Cost Benefit Analysis Cash Flow

Forecasting Cost Benefit Evaluation Techniques Risk Evaluation.

UNIT III ACTIVITY PLANNING

Objectives Project Schedule Sequencing And Scheduling Activities Network Planning

Models Forward Pass Backward Pass Activity Float Shortening Project Duration

Activity On Arrow Networks Risk Management Nature Of Risk Types Of Risk

Managing Risk Hazard Identification Hazard Analysis Risk Planning And Control.

UNIT IV MONITORING AND CONTROL

Creating Framework Collecting The Data Visualizing Progress Cost Monitoring Earned

Value Prioritizing Monitoring Getting Project Back To Target Change Control

Managing Contracts Introduction Types Of Contract Stages In Contract Placement

Typical Terms Of A Contract Contract Management Acceptance.

UNIT V MANAGING PEOPLE AND ORGANIZING TEAMS

Introduction Understanding Behavior Organizational Behaviour: A Background Selecting

The Right Person For The Job Instruction In The Best Methods Motivation The Oldman

Hackman Job Characteristics Model Working In Groups Becoming A Team DecisionMaking Leadership Organizational Structures Stress Health And Safety Case Studies.

TEXT BOOKS:

1. Bob Hughes and MikeCotterell, 2004, Software Project Management, Fourth Edition,

Tata McGraw Hill Edition.

44

8/8/2019 MCA Syllabus 20-04-10

45/49

REFERENCES:

2. Ramesh, Gopalaswamy, 2001, Managing Global Projects , Tata McGraw Hill.

3. Royce, 1999,Software Project Theory, Pearson Education.

4. P.Jalote , 2000, Software Project Management In Practice, Pearson Education.

45

8/8/2019 MCA Syllabus 20-04-10

46/49

3 . DIGITAL IMAGING

UNIT I FUNDAMENTALS OF IMAGE PROCESSING

Introduction Steps in Image Processing Systems Image Acquisition Sampling and

Quantization Pixel Relationships Colour Fundamentals and Models, File Formats, Image

operations Arithmetic, Geometric and Morphological.

.

UNIT II IMAGE ENHANCEMENT

Spatial Domain Gray level Transformations Histogram Processing Spatial Filtering

Smoothing and Sharpening.Frequency Domain : Filtering in Frequency Domain DFT, FFT,

DCT Smoothing and Sharpening filters Homomorphic Filtering.

.

UNIT III IMAGE SEGMENTATION AND FEATURE ANALYSIS

Detection of Discontinuities Edge Operators Edge Linking and Boundary Detection

Thresholding Region Based Segmentation Morphological WaterSheds Motion

Segmentation, Feature Analysis and Extraction .

UNIT IV MULTI RESOLUTION ANALYSIS AND COMPRESSIONS

Multi Resolution Analysis : Image Pyramids Multi resolution expansion Wavelet

Transforms.

Image Compression : Fundamentals Models Elements of Information Theory Error Free

Compression Lossy Compression Compression Standards.

UNIT V APPLICATIONS OF IMAGE PROCESSING

Image Classification Image Recognition Image Understanding Video Motion Analysis

Image Fusion Steganography Digital Compositing Mosaics Colour Image Processing..

46

8/8/2019 MCA Syllabus 20-04-10

47/49

TEXT BOOKS:

1. Rafael C.Gonzalez and Richard E.Woods, Digital Image Processing Second Edition,

Pearson Education, 2003.

2. Milan Sonka, Vaclav Hlavac and Roger Boyle, Image Processing, Analysis and

Machine Vision, Second Edition, Thomson Learning, 2001

REFERENCES:

1.Anil K.Jain, Fundamentals of Digital Image Processing, Person Educaiton, 2003.

S Jayaraman, S Esakkirajan, T Veerekumar, Digital Image Processing, Tata McGraw

Hill publication, 2009

47

8/8/2019 MCA Syllabus 20-04-10

48/49

Core P7: Asp .Net Lab

1. Create a Web form for an online library. This form must be able to accept the

Membership Id of the person borrowing a book, the name and ID of the book, and the

name of the books author. On submitting the form, the user (the person borrowing the

book) must be thanked and informed of the date when the book is to be returned. You

can enhance the look of the page by using various ASP.NET controls.

2. Use a calendar control in the page to determine the current date (when the book is

borrowed) and calculate the due date, which must be three weeks from the current date.

Display the due date to the user.

3. Create an array containing the titles of five new movies. Use this array as a data source

for a drop down list control. The page must be capable of displaying the selected movie

title to the user when the user clicks on the submit button.

4. Create a virtual directory in IIS. Create a global.asax file and include the

Session_Start and Session_End and, Application_BeginRequest and

Application_EndRequest events. Write a simple ASP.NET page and execute it in the

browser. What is the output that you get?

5. Create the Employee information and perform all the validator controls. Create anASP.NET application. The application must consist of a form that accepts the users

credentials and validate the same. The user is then allowed to purchase items from the

site by filling in a form. The user is finally informed when the purchased goods will be

delivered to him/her.

a. Create a single default error page for any errors occurring in the application.

b. Use ASP.NET debugger to debug the application during its development

c. Enable tracing for the application. Display the user entered data in the purchase

form as trace information at the bottom of the purchase page.

d. Switch off tracing for the application.

6. Create the simple web services and test the service.

7. Create a ASP.NET application.Send a simple E-Mail to your friends.

8. Create a dataBase application and perform all the operations such as addition, deletion,

insertion and updation etc.

48

8/8/2019 MCA Syllabus 20-04-10

49/49

Core P8 DATA MINING LAB

Implementing the following using database.

Clustering algorithms

Classification

Association