Syllabus of Master of Computer Application (MCA)education.sgrru.ac.in/Uploads/syllabus/MCA.pdf ·...

Patel Nagar, Dehradun, Uttarakhand

SHRI GURU RAM RAI UNIVERSITY

(Estd. by Govt. of Uttarakhand, vide Shri Guru Ram Rai University Act no. 03 of 2017)

Syllabus of

Master of Computer Application (MCA)

Effective from Academic Session

2017-2018

Shri Guru Ram Rai University MCA Syllabus

2

Program Structure

Master of Computer Application (MCA)

First Year

FIRST SEMESTER

S.N

o

Course

No.

Subject Evaluation – Scheme Cr

edi

t

Period Sessional Examination

L T P TA CT INT ESE Sub.

Total

Theory

1. MCA-101 Computer System Architecture 4 1 0 10 30 40 60 100 5

2. MCA-102 Mathematical Foundation of

computer Sciences 3 1 0 10 30 40 60 100 4

3. MCA-103 Programming in ‘C’ Language 4 - 0 10 30 40 60 100 4

4. MCA-104 Web Programming-I 4 - 0 10 30 40 60 100 4

5. MCA-105 Accounting for Management 3 1 0 10 30 40 60 100 4

Practical

1. MCA-P11 Digital Lab - - 2 - - 40 60 100 1

2. MCA-P13 C Programming -Lab - - 2 - - 40 60 100 1

3. MCA-P14 Web Programming-I Lab - - 2 - - 40 60 100 1

Total 18 3 6 50 150 320 480 800 24

L : Lecture T : Tutorial

P : Practical

TA : Teacher Assessment CT : Class Test

INT : Internal Assessment ESE : End Semester Examination

SUB TOT. : Subject Total


3

SECOND SEMESTER:

S.N

o

Course

No.

Subject Evaluation – Scheme Cre

dit Period Sessional Examination


Total

Theory

1. MCA-201 Object oriented programming using C++

4 - 0 10 30 40 60 100 4

2. MCA-202 Data Structure 4 - 0 10 30 40 60 100 4

3. MCA-203 CBNST[Computer Based Numerical & Statistical

Techniques]

3 1 0 10 30 40 60 100 4

4. MCA-204 Operating system 3 1 0 10 30 40 60 100 4

5. MCA-205 SAD[System Analysis Design] 3 1 0 10 30 40 60 100 4

Practical

6. MCA-P21 C++ Programming Lab - - 2 - - 40 60 100 1

7. MCA-P22 Data Structure Lab - - 2 - - 40 60 100 1

8. MCA-P27 Minor Project on Web Programming -I - - 4 - - 40 60 100 2

Total 17 3 8 50 150 320 480 800 24

.

L : Lecture

T : Tutorial

P : Practical TA : Teacher Assessment

CT : Class Test INT : Internal Assessment

ESE : End Semester Examination SUB TOT. : Subject Total


4

THIRD SEMESTER:

S.No Course

No.

Subject Evaluation – Scheme Credit



Total

Theory

1. MCA-301 Database Management System

4 - 0 10 30 40 60 100 4

2. MCA-302 Object oriented programming using

JAVA

4 - 0 10 30 40 60 100 4

3. MCA-303 Computer Network 3 1 0 10 30 40 60 100 4

4. MCA-304 Analysis and Design of Algorithm 3 1 0 10 30 40 60 100 4

5. MCA-305 Software Engineering 3 1 0 10 30 40 60 100 4

Practical

6. MCA-P31 DBMS Lab - - 2 - - 40 60 100 1

7. MCA-P32 Core JAVA Lab - - 2 - - 40 60 100 1

8. MCA-SM Seminar - - 4 100 - 100 2

9. MCA-SS Self-Study course - Joomla - - - - - Grade -

Total 17 3 8 50 150 380 420 800 24


P : Practical TA : Teacher Assessment

CT : Class Test




5

FOURTH SEMESTER:

S.

No

Course

No.

Subject Evaluation – Scheme Credit



Total

Theory

1. MCA-401 Computer Graphics

3 1 0 10 30 40 60 100 4

2. MCA-402 Advance Programming in JAVA 4 - 0 10 30 40 60 100 4

3. MCA-403 Elective 1(Any One)

403.1 Mobile computing

403.2 Compiler Designing

403.3 Artificial Intelligence

403.4 Graph Theory

4 1 0 10 30 40 60 100 5

4. MCA-404 Elective 2 (Any One)

404.1 PHP & MySQL

404.2 Android Programming

404.3 PL/ SQL Programming

4 - 0 10 30 40 60 100 4

5. MCA-405 Microprocessor systems 4 - 0 10 30 40 60 100 4

Practical

6. MCA-P41 Graphics Lab - - 2 - - 40 60 100 1

7. MCAP-42 Advance JAVA Lab - - 2 - - 40 60 100 1

8 MCAP-44 Elective -2 Lab - - 2 - - 40 60 100 1

Total 19 2 6 50 150 320 480 800 24

L : Lecture

T : Tutorial P : Practical

TA : Teacher Assessment

CT : Class Test INT : Internal Assessment

ESE : End Semester Examination SUB TOT. : Subject Total


6

FIFTH SEMESTER:

S.

No

Course No. Subject Evaluation – Scheme Cre

dit Period Sessional Examination


Total

Theory

1. MCA-501 Network Security And

Cryptography

3 1 0 10 30 40 60 100 4

2. MCA-502 C# Programming And Dot

NET Framework

4 - 0 10 30 40 60 100 4

3. MCA-503 Unix And Shell Programming 4 - 0 10 30 40 60 100 4

4. MCA-504 Elective 1(Any one) MCA 504.1 Multimedia And

Animation

MCA504.2 Probability And

Statistics

MCA504 .3 Management

Information System

MCA504.4 Enterprise Resource

Planning

3 1 0 10 30 40 60 100 4

5. MCA-505 Elective 2(Any one) MCA 505.1Operations Research

MCA 505.2 Data Warehousing

And Data Mining

MCA 505.3 Emerging Trends In

Information Technology

MCA 505.4 Advance Software

Engineering

3 1 0 10 30 40 60 100 4

Practical

6. MCA-P52 C# And .NET Lab - - 2 - - 40 60 100 1

7. MCA-P53 Unix Programming Lab - - 2 - - 40 60 100 1

8 MCA-MP Minor Project II - - 4 - - 40 60 100 2

9. MCA-IE Industrial Exposure - - - - - - - Grade -

Total 17 3 8 50 150 320 480 800 24


P : Practical





7

SIXTH SEMESTER:

S.

No

Course No. Subject Evaluation – Scheme Credit



Total

Theory

1. MCA-P61 Synopsis - - - - - 100 - 100 4

2. MCA-P62 Project Report & Viva voce -- - - - - 300 300 600 15

3 MCA-P63 Project Presentation - - - - - 100 - 100 5

Total 500 300 800 24


P : Practical





8

Elective Papers

MCA Fourth Semester MCA 404 Elective 1(Any One) 403.1 Mobile computing 403.2 Compiler Designing 403.3 Artificial Intelligence 403.4 Graph Theory

MCA405

Elective 2 (Any One) 404.1 PHP & MySQL 404.2 Android Programming 404.3 PL/ SQL Programming

MCA Fifth Semester MCA 505

Elective 1 (Any one) MCA 504.1 Multimedia And Animation MCA504.2 Probability And Statistics MCA 504.3 Management Information System MCA504.4 Enterprise Recourse Planning

MCA 506 Elective 2(Any one) MCA 505.1Operations Research MCA 505.2 Data Warehousing And Data Mining MCA 505.3 Emerging Trends In Information Technology MCA 505.4 Advance Software Engineering


9

FIRST SEMESTER

S.

No




Total

Theory

1. MCA 101 Computer System

Architecture

4 - 0 10 30 40 60 100 4

MCA 101 COMPUTER SYSTEM ARCHITECTURE UNIT I – Introduction to Computer Concepts of Data and Information, History of computers, organization of computers, input and output devices, storage devices, System software, application software, utility packages, compilers, interpreters, Operating System, Booting ,Elementary commands of DOS Number Systems: Binary, Decimal, Octal, Hexadecimal, Conversion from One Number System to another, Character Codes (BCD), Excess-3, Gray Code, ASCII, 1’s Complement Representation, 2’s Complement Representation

UNIT II – Logic Gates and Boolean Algebra Logic Gates: AND, OR, NOT, XOR, XNOR, NAND and NOR as Universal Gates Boolean Algebra: Boolean postulates and laws , De Morgan’s Theorem, Principle of Duality, Boolean expression, Boolean function, Minimization of Boolean expressions, Sum of Products (SOP), Product of Sums (POS), Minterm-Maxterm, Canonical forms , Karnaugh Map Simplification-Don’t care conditions.

UNIT III- Logic Circuits Combinational Circuits: Half Adder, Full Adder, Half Subtractor, Full Subtractor, Serial Adder/Subtractor, Parallel Adder/ Subtractor, Decoder, Encoders, Multiplexers, Demultiplexers. Sequential Circuits: Latch, Flip Flops- SR, JK, Data, Toggle

UNIT IV – Computer Organization Basic Organization- Hardwired & Micro programmed Control Unit, Bus Architecture, Programming Registers,CPU organization, Addressing modes. Memory Organization- Memory Hierarchy, Main Memory, Auxiliary Memory, Cache Memory, Virtual Memory. Input-Output Organization- Modes Of Transfer, Priority Interrupt, DMA, Input-Output Processor (IOP), CPU-IOP Communication.

ReferenceBooks: 1.Computer System Architecture, Morris Mano, PHI 2.Computer Organization, Hamacher, MGH 3.Computer Architecture, Carter, Schaum Outline Series, TMH 4.The Fundamentals of Computer Organization, Raja Rao, Scitech 5.Computer Organization & Design, Pal Chowdhury, PHI 6.Digital Principles &Applications,MalvinoLeach.,TMH. 7. P. K. Sinha ."Introduction to Computers " 8. V. Rajaraman "Fundamental of computer " PH


10

S.

No




Total

Theory

2. MCA 102 Mathematical Foundation of

Computer Sciences

3 1 - 10 30 40 60 100 4

MCA 102 MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE

UNIT -I:Proposition Logic Proposition, logical connectives, truth tables, tautologies, contradiction, normal forms(conjunctive and disjunctive), validity of an argument, converse, inverse, contrapossitive, Universal and existential quantifiers.

UNIT- II: Matrix definition & types of matrix ,Matrix addition and multiplication ,Transpose and inverse of matrix, Rank of matrix, Consistency of System of Linear Equations and its Solution, Eigen values

UNIT-III: Relations and functions Cartesian product of sets, relation, types of relation, equivalence relation, equivalence classes, matrix and graph representation of a relation, closure of a relation, partial order relation, Hasse diagram.

UNIT-IV: Lattices & Posets Posets, Well ordered set, maximal and minimal element, greatest and least element, least upper bound, greatest lower bound, Lattices, properties of Lattices, Isomorphism, Some special lattices: Bounded lattice and complemented lattices, distributive lattice Modular lattice, Complete lattice.

UNIT-V: Recurrence relation Discrete numeric function, basis operations, convolution, recurrence relation, solution by iteration method, undetermined coefficient method, generating function method.

Reference Books:

1. Liptschutz, Seymour, "Discrete Mathematics", TMH. 2. Trembley, J.P. & R. Manohar,"Discrete mathematical Structure with Application to Computer

Science", TMH. 3. Kenneth H. Rosen, "Discrete Mathematics and its applications', TMH. 4. Doerr Alan and Levasseur Kenneth, "Applied Discrete Structure for Computer Science, Galgotia

Pub. 5. Gersting "Mathematical Structure for Computer Science", WH freeman and Macmillan 6. Hopcroft J.E. Uliman J.D., "Introduction to Automata Theory, Language and Computation"

Narosa Pub. House, 7. Peter Grossman, "Discrete Mathematics for Computer", Palgrave Macmillian.


11

S.

No

Course No. Subject Evaluation – Scheme Theor

y/Prac

tical

Credit



Total

Theory

3. MCA 103 Programming in C Language 4 - 2 10 30 40 60 100 4/1

MCA 103 PROGRAMMING IN C LANGUAGE UNIT I - Introduction To 'C' Language Top down design, Bottom up design, Structure of a C program, Constant and variable, Identifiers and keywords. Data types.Operators and Expressions, comma operator.Ternary operator, Priority and associativity of operators.Type conversion and type casting.Symbolic constants. Input-Output functions - getchar, putchar,scanf, printf, gets, puts. Control Statements: while, do-while, for statements, nested loops. If else, switch, break, continue and goto statements.

UNIT II - Arrays and Functions Arrays: Defining an array, Passing array to a function, 2D Array, Matrix Addition and Multiplication ,Multi-dimensional arrays. Strings in C,Operations and Functions of Strings, Storage classes. Arguments; Return value; Parameter passing - Call by value, Call by reference; return statement, calling a function, Recursion basics,Library functions.

UNIT III - Pointers and preprocessor directives Pointers declarations.Passing pointer to a function.Operationson pointers. Pointers and arrays, Array of pointers. C-preprocessor-basics, #include, #define, #undef, conditional compilation directive like #if, #else, #elif, #ifdef and #ifndef, #error, Command line arguments.

UNIT IV – Structures & Union Defining a structure, Pointer to structures. Structure within structure. Array of structures.Structure variable and structure Pointer, Unions, enumeration , Dynamic memory management functions like malloc() , calloc(), free(), realloc().

UNIT V - File handling and related functions Open, close, create,appending content in a binary and text file ,unformatted data files ,different modes of accessing a file :fopen ,read ,write, fprintf and fscanf ,fseek, ftelletc

Reference Books: 1. Gottfried (schaum series), Programming and problem solving in 'C',TMH. 2. Kanetkar Y.P., Let us C, BPB Publications 1. The C programming language, Kernighan and Ritchie, PHI 2. The Spirit of C, Cooper Mullish, Jaico Publishing House, Delhi 3. Pointers in C, Kanetkar Y.P. , BPB Publications 4. programming in C ,Jeeyapoovan,Pearson Education


12

MCA 104 WEB PROGRAMMING I Unit-I: Introduction Introduction to the Internet, Introduction to HTML Terminology, Designing a Webpage: Design Considerations and Planning, Basic Tags and Document Structure, HTML Tags, Head Tags, Title Tags, Body Tags, Metadata, Saving an HTML Page

Unit II:Page Formatting Adding a New Paragraph, Adding a Line Break, Inserting Blank Space, Preformatted Text, Changing a Page’s Background Color, Div Element. Text Items and Objects: Headings, Comments, Block Quotes, Horizontal Lines. Special Characters.Creating Lists: Numbered (Ordered) Lists, Bulleted (Unordered) Lists,Nested Lists, Definition Lists.

Unit III: Links What are Links?, Text Links, Image Links, Opening a Page in a New Window or Tab, Setting all Links on a Page to Open in a New Window or Tab, Linking to an Area on the Same Page (Bookmarks), Linking to an E-mail Address, Linking to Other Types of Files. Images: Introduction to Images for Webpages, Adding Images to Webpages, Resizing an Image, Alternative (ALT) Text, Image Labels.

UNIT IV: Tables& Forms Inserting a Table, Table Borders, Table Headers,Col and row span, IFrames: What is an Iframe?, Inserting Iframes, Setting Height and Width, Using an Iframe for a link target. Forms: About Forms, Text Boxes, Text Areas, Check Boxes, Menu Lists, Radio Buttons, The Submit Button, The Reset Button, Changing the Tab Order, Sending to E-mail, event handling

UNIT V:Video and Audio About Video and Audio Files, Linking to Video and Audio Files, Adding Video, Adding Audio, Using YouTube to Display Video.

UNIT VI:Cascading Style Sheets CSS Introduction , CSS Syntax, Creating an External CSS, Linking to a CSS, Adding Comments and Notes to a CSS, Creating an Internal Style Sheet, ID and Class, Inline Styling. Working With Text in CSS: Emphasizing Text (Bold and Italic), Decoration, Indentation, Transformation, Text Alignment, Fonts, Font Sizes, Letter Spacing, Text Color, Margins, Padding, Borders, Styling Links, Number and Bullet Styles, Sizing Elements, Text Wrapping, Shadowing.

UNIT VII:Creating Backgrounds in CSS: Colors, Images, Fixed Images. Images in CSS: Opacity, Floating Images, Image Galleries, Image Sprites. Box Model in CSS: What is a box model?, Margin, Padding, Border, Outline. Adding a Navigation Bar in CSS: Vertical Navigation Bar, Horizontal Navigation Bar – Inline, Horizontal Navigation Bar – Floating. CSS Tables: Borders, Collapsed Borders, Table Width and Cell Height, Table Color, Table Text Element, Table Padding.

Book References: 1. HTML & CSS: The Complete Reference, Fifth Edition, Thomas A. Powell. 2. Burdman, "Collaborative Web Development", Addison Wesley 3. Sharma & Sharma, "Developing E-Commerce Sites" Addison Wesley 4. IvanBayross, "Web Technologies Part-I" BPB Publications

S.

No


y/Prac

tical

Credit



Total

Theory

4. MCA 104 Web Programming I 4 - 2 10 30 40 60 100 4/1

https://www.teachucomp.com/samples/html/5/12.3/


13

MCA 105 ACCOUNTING FOR MANAGEMENT

UNIT-I

Introduction to Accounting: Meaning, Nature, Objective, Scope, Users, importance, and limitations

of Accounting, GAAP, Accounting Principles, Double Entry System, Journals, Ledger, Purchase Book,

Sales Book, Cash Book, Three column Cash Book, Trial Balance, Posting of Entries in Accounts Books.

Post adjusted Trial Balance.

UNIT-II

Preparation of Financial Statements: Preparing Manufacturing Account, Trading Account, Profit and

Loss Account and Balance Sheet for a sole proprietor. Final account with adjustment.

UNIT-III

Accounting Information System and Application of Computers in Accounting: Meaning,

designing, advantages, features, and applications of computers in Accounting.

UNIT-IV

Analyzing Financial Statements: Objectives of financial statement analysis, Sources of information,

Standards of comparison, Techniques of financial statement analysis- Horizontal, Vertical, and Ratio

analysis.Meaning, usefulness, limitations and classification of financial ratios.

UNIT-V

Management Accounting: Meaning, functions, scope, role, limitations, and distinctions between

Management accounting and Financial Accounting.

Suggested Readings

1. R S Singal and NeerajGoyal - Business Accounting 2. R. L. Gupta and V. K. Gupta - Financial Accounting 3. Dr. N.P. Srinivasan and Dr. M. SakthivelMurugan - Accounting for Management 4. Dr. S.M.Shukla and Dr.S.P.Gupta - Financial Accounting 5. R. S. Singal - Financial Accounting

S.

No




Total

Theory

5. MCA 105 Accounting For Management 3 1 - 10 30 40 60 100 4


14

SECOND SEMESTER

MCA 201 OBJECT ORIENTED PROGRAMMING USING C++

UNIT- I

Object Model, OOD and OOA, abstraction, encapsulation, modularity, hierarchy, state,behavior and

relationship among objects. Objects oriented design, identifying classesandobject, object diagrams

UNIT –II

Encapsulation, Data Abstraction, structures and functions,object and classes, access specifiers , Scope of

class and its member, Nested Class, object arrays, Pointers, Constructor: parameterized constructor,

multiple constructor, default constructor, copyconstructor, implicit constructor, destructor , dynamic

allocation operators : new(),delete().

UNIT -III

Inheritance: Single inheritance, multilevel inheritance, multiple inheritances,Hierarchicalinheritance,

Hybrid Inheritance, Polymorphism(operator and function overloading), function overriding

UNIT –IV

Virtual base classes, friend function, pointers to base and derived classes, virtual functions, early and

late binding, templates, exception handling.

UNIT-V

C++ I/O System, formatted I/O, file I/O basis, working with file : files & streams, opening &

closing a file, read() & write() functions,Detecting end-of-file. File manipulation using seekg(), tellg()

functions.

Reference Books:

1. K. R. Venugopal, Raj Kumar & T. Ravi Shankar : Mastering C++, TMH Pub.

2. H. Schildt : C++ complete reference, TMH Pub.

3. Balaguruswami : Object Oriented Programming with C++

4. Robert Lafore : Object Oriented Programming in Turbo C++, Galgotia Pub.

5. Grady Booch : Object Oriented Analysis & Design, Pearson.

6. Stephen Prata: C++ Primer Plus, Galgotia Pub.

7. BjarneStroustrup : The C++ Programming Language, Pearson

S.

No


y/Prac

tical

Credit



Total

Theory

1. MCA 201 Object Oriented Programming

using C++

4 - 2 10 30 40 60 100 4/1


15

MCA 202 DATA STRUCTURE

UNIT I – Stack & Queue Introduction of stack, implementation of stack; various operation on stack; various Polish Notations: -prefix,postfix, infix, Conversion from one notation to another - using stack; Evaluation of post &prefixexpression. Implementation of Queue, Linear queue, its drawback, Circular queue, Priority Queue, Dqueue, Various operations on queue.

UNIT II – Linked List List and its contiguous implementation, its drawback; Singly linked list-operations on it,doublylinked list- operations on it; Circular linked lists, Linked list using arrays,polynomial Arithmetic: addition, Subtraction and Evaluation, Linked Stack and Queues.

UNIT III – Trees and Its Representation Definitions- Height, depth, order, degree, parent & children relationship etc, Binary Tree-Various theorems, complete binary tree, almost complete binary tree; Tree Traversals-preorder,in order & post order traversals, their recursive and non-recursive implementations;Expression tree-evaluation; Linked representations of binary tree operations. Threaded binaryTrees,BST.

UNIT IV – Searching, Hashing & Sorting sequential search, binary search, indexed sequential search,Interpolation search, Hashing- Basics, methods, collision, resolution of collision, chaining. Internal Sorting-bubble sort, selection sort, insertion sort, quick sort, merge sort, heap sort.

UNITV – Graph Related definitions; Graph representations- adjacency matrix,Traversal schemes - depth first search, breadth first search; Minimum spanning tree; Shortest path, algorithm; Kruskal&Dijkstra algorithms. Miscellaneous features: Basic idea of AVL Tree- Definition,insertion& deletion operation; Basic idea of B-tree definition, order, degree, insertion &deletionoperations; B+-tree-definition, comparison with B-tree.

Reference Books 1. Kruse R.L.: Data Structures and Program Design in C; PHI 2. Tennenbaum A.M. Data Structures using C & C++; PHI 3. Horowitz &Sawhaney: Fundamentals of Data Structures, Galgotia Publishers. 4. SchaumSeries,Data Structure

S.

No


y/Prac

tical

Credit



Total

Theory

2. MCA 202 Data Structure 4 - 2 10 30 40 60 100 4/1


16

MCA 203 COMPUTR BASED NUMERICAL AND STATISTICAL TECHNIQUES UNIT- I Fixed&Floating point Arithmetic Representation of floating point numbers, Representation of Integers, Operations, Normalization, Errors in numerical computation.

UNIT II:Interpolation and approximation Finite Differences, Difference tables,Polynomial Interpolation: Newton’s forward and backward formula Central Difference Formulae: Sterling’s, Bessel’s, Everett’s formula ,Gauss forward and backward formula. Interpolation with unequal intervals: Lagrange’s Interpolation, Newton Divided difference formula.

UNIT III:Numerical Differentiation and Integration and Differential equation Introduction, Numerical Differentiation, Numerical Integration, Trapezoidal rule, Simpson’s rules, Boole’s Rule, Weddle’s Rule. Solution of differential equations: Picard’s Method, Euler’s Method, Taylor’s Method, RungeKutta methods,

UNIT IV:Solution of Linear and Nonlinear equations Gauss Elimination , Gauss Jordan method , Gauss Seidal iterative method ,Solution of Nonlinear equationusing Bisection Method, Iteration Method, Regula-Falsi method, Newton Raphson method, Secant method, Rate of convergence of iterative methods.

UNIT V:Basic Statistics Measure of central tendency :Mean,Medain,Mode ,measure of dispersion: Range,Quartile Deviation, Mean deviation, Standard deviation, Curve Fitting , Method of least squares, fitting of straight lines, polynomials, exponential curves, power curves, Correlation and Regression analysis: Introduction, Scatter Diagram, Types of Correlation, Karl Pearson’s Method, Rank Correlation, Linear regression.

Reference Books: 1. Rajaraman V., “Computer Oriented Numerical Methods”, PHI-2004 2. Gerald & Wheatley, “Applied Numerical Analyses”, AW-2003 3. Gerald & Wheatley, “Applied Numerical Analyses”, AW, 2003 4. Jain, Iyengar and Jain, “Numerical Methods for Scientific and Engineering Computations”, New Age 5. SPGupta ,Statistical Methods, Sultan &Chand sons

S.

No




Total

Theory

3. MCA 203 Computer Based Numerical

Techniques

4 - - 10 30 40 60 100 4


17

MCA 204 OPERATING SYSTEM

UNIT I Introduction to operating system

Defination of operating system, Functions performed by operating system, Evolution of operating system

( Serial ,Batch, Multiprogramming Operating systems) ,layered Architecture of OS, Introduction to multi

programming, Time sharing and real time systems.

UNIT II Process& Scheduling Algorithms

Proess,Processstates, Process transition diagram, PCB,Threads,CPUScheduling:Introduction to CPU

scheduling, Types of schedulers, Context switching, CPU scheduling criteria, Various types of CPU

scheduling algorithms (FCFS,SJF,RR,Priority),Multi-level Queue Scheduling & Multi level Feedback Queue

Scheduling

Disk Scheduling:Meaning of disk scheduling, Disk Performance parameters, Various types of

diskscheduling algorithms like FCFS, SCAN ,CSCAN ,LOOK,CLOOK.

UNIT III Memory management

Various types of memory management schemes (continuous and non-continuous), fragmentation,

paging, Segmentation etc. Concept of virtual memory, Meaning of demand paging, Various

pagereplacement algorithms, Meaning of thrashing, methods to overcome thrashing, Memory protection,

cache memory, Hit and Miss ratio, Associative memory.

UNIT IV Process Communication &Synchronization

Introduction to concurrentprocessing, Inter process communication (signal, pipe, DDE, OLE) ,Process

synchronization , Critical section problem, solution of critical section problem (Peterson Algorithm

,Semaphore, Monitors, TS and swap instruction) ,classical problems of process synchronization. Meaning

of deadlocks, dealing with deadlocks , deadlock avoidance, Deadlockprevention etc., Banker's algorithm,

RA graph.

UNIT V File &Disk Organization

Introduction to file systems, Access andallocation methods of file systems, Directory structure of a file

system, Fileprotection, Introduction to distributed systems .Disk Structure, Disk allocation methods,

Free Space Management,RAID disk

Reference Books:

1. Operating System Concepts by James L. Peterson, Abraham Silberschatz (Addison-Wesley)

2. Operating System Concepts &. Design by Milan Milenkovic (MGH).

3. Modern Operating System by Andrew .S. Tanenbaum (PHI)

4. An Introduction to Operating Systems by Haevey M Dietel(Addison Wesley)

S.

No




Total

Theory

4. MCA 204 Operating System 3 1 - 10 30 40 60 100 4


18

MCA 205 SYSTEM ANALYSES AND DESIGN

UNIT I System and Its Components what is system?, Elements of a system, Type of system, Computer based Information System, System Analysis and Design;SYSTEM ANALYST: Roles of system Analyst, Duties of a System Analysts, Qualities of System Analysts , Skills of System Analyst

UNIT II System Development Life Cycle Need of software life cycle model, Waterfall Model, Feasibility Study, Cost and Benefits; FACT - FINDING TECHNIQUES: Record Inspection, On-site observation, Questionnaires, Interviews.

UNIT III Planning Software Project Planning Phase-Dependent Tools and Techniques: GANNT Chart, PERT Chart. Software Cost Estimation Techniques.

UNIT IV Structured Analysis

Data Flow Diagram, Data Dictionary.Process Specification Tools: Structured English, Decision Tables, Decision Trees.

UNIT V Input-Output Design Output Design: Types of output, Principles of Output Design, Output Design Process; Report Design: Type of reports, Importance of Reports, Criteria for Report Design; Input Design: Principles of Input Design, Input Design Process, GUI Controls for Inputs, Importance of Form, Criteria for Form Design.

UNIT VI Testing & Implementation Objectives of Testing, Test Information Flow, Test Case Design, Types of Test Data, Levels of Testing, Quality Assurance, Quality Software Specifications.Types of implementation, Activities in Implementation, Conversion: Parallel Conversion, Direct Cutover, Location Conversion, Phase – In – Method; Training

Reference Books: 1. V.Rajaraman, “Analysis and Design of Information Systems”, 2nd Edition, Prentice Hall of India 2. K.E. Kendall and J.E.Kendall, “Systems Analysis and Design”, 5th Edition, Pearson Education Asia. 3. J.A.Hoffer, J.F.George, J.S.Velacich, “Modern Systems Analysis and Design”, Third Edition, Pearson Education Asia

S.

No




Total

Theory

5. MCA 205 System Analysis & Design 3 1 - 10 30 40 60 100 4


19

Second Year

THIRD SEMESTER S.

No

Course No. Subject Evaluation – Scheme Theory

/Practic

al

Credit



Total

Theory

1. MCA 301 Data Base Management System 4 - 2 10 30 40 60 100 4/1

MCA 301 DATA BASE MANAGEMENT SYSTEM UNIT I – Basic concepts Database , Characteristics of the Database, Approach & advantages of using DBMS. Data Models, Schemas& Instances. Database abstraction & Data Independence. Overall structure of Database ,Data Dictionary, Database Users ,Role of DBA.Data Modeling using the Entity-Relationship Model -Entity types, Entity Sets, Attributes andKeys, Relationship & its Types, Enhanced ER Model- Specialization , Generalization, Aggregation.

UNIT II –Relational Model, Languages & Systems Relational Data Model Concepts and Constraints. Relational Algebra, select, project & join operations. Overview of keys (primary, composite, foreign, alternate, candidate), relational Calculus. SQL - DDL statements, DML statements ,Views, sequence,synonyms,sub queries, joins, transaction commands, specifying constraints, Indexes in SQL.

UNIT III – Relational Data Base Design Function Dependencies & Normalization, Normal forms (INF, 2NF, 3NF & BCNF). Lossless join & Dependency preserving, decomposition, multivalued dependencies, join dependencies (4NF & 5NF).

UNIT IV – Transactions, Concurrency Control, Recovery Techniques Basic concept, ACID properties, transaction state, concurrent executions, concurrency control, basic idea of serializability, view and conflict serializabllity, Recovery techniques, failure classification , log based recovery, locking protocols, shadow paging , checkpoints.

UNIT V – Emerging fields in DBMS Basic ideas of Distributed databases, data replication, data fragmentation horizontal, vertical and mixed fragmentation, Object oriented data base management systems, RAID, concepts of Data Warehousing & mining ,introductory of Bigdata and Hadoop .

Reference Books 1. Elmsari and Navathe, "Fundamental of Database System", Addison Wesley. New York. 2. H.Korth& A. Silberschatz, “DATABASE SYSTEM CONCEPTS”, TMH. 3. Date. CJ, "An Introduction to Database System", NarosaPublishingHouse. New Delhi. 4. Desai, B, "An Introduction to Database Concepts", GalgotiaPublications. New Delhi. 5. Ullman. J.D, "Principles of Database Systems", Galgotia Publications, New Delhi.


20

MCA 302 OBJECT ORIENTED PROGRAMMING USING JAVA

UNIT-I Introduction to Object orientation, Modeling as a Design Technique Modeling Concepts ,abstraction, The three models, Class Model, State model and Interaction model. Class Modeling-Object and class concepts, link and association, Aggregation, Generalization and Inheritance , State modeling-Events, states, Transition and conditions, state diagram, state diagram behavior Interaction Modeling-Use case Models, sequence models, activity models .

Unit-II Features of Java, Byte Code and Java Virtual Machine, JDK, Data types, Operator, Control Statements – If , else, nested if, if-else ladders, Switch, while, do-while, for, for-each, break, continue. Single and Multidimensional Array, String class, StringBuffer class, Operations on string, Command line argument, Use of Wrapper Class.

Unit-III Class, Object, Object reference, Constructor, Constructor Overloading, Method Overloading, Passing and Returning object form Method, new operator, this and static keyword, finalize() method, Access control, modifiers, Nested class, Inner class, Anonymous inner class, Abstract class. Use of Inheritance, Inheriting Data members and Methods, constructor in inheritance, Multilevel Inheritance – method overriding Handle multilevel constructors – super keyword ,Stop Inheritance - Final keywords, Creation and Implementation of an interface, Interface reference, instanceof operator, Interface inheritance, Dynamic method dispatch ,Understanding of Java Object Class.

UNIT-IV Package, Import statement, Exception Handling, Exception and Error, Use of try, catch, throw, throws and finally, Built in Exception, Custom exception, Throwable Class. Multithreaded Programming,Use of Multithread programming, Thread class and Runnable interface , Thread priority, Thread synchronization.

UNIT-V Introduction to Stream, Byte Stream, Character stream, Readers and Writers, File Class, File InputStream, File Output Stream, InputStreamReader, OutputStreamWriter, FileReader, FileWriter, Buffered Reader, Collection Classes List, ArrayList, Enumeration, Vector, Properties, Introuduction to Java.util package.

Reference Books: 1. Introduction to Java Programming (Comprehensive Version), Daniel Liang, Seventh Edition, Pearson. 2. Programming in Java, SachinMalhotra&SaurabhChaudhary, Oxford University Press. 3. Murach’s Beginning Java 2, Doug Lowe, Joel Murach and Andrea Steelman, SPD 4. Core Java Volume-I Fundamentals, Eight Edition, Horstmann& Cornell, Pearson Education. 5. The Complete Reference, Java 2 ( Fourth Edition ), Herbert Schild, TMH. 6. Java Programming, D. S. Malik, Cengage Learning. 7. Big Java, 3rd Ed., Horstmann, Wiley-India.

S.

No

Course No. Subject Evaluation – Scheme Theory/

Practica

l

Credit



Total

Theory

2. MCA 302 Object Oriented Programming

Using Java

4 - 2 10 30 40 60 100 4/1


21

MCA 303 - COMPUTER NETWORKS

UNIT –I Introductory Concepts Goals and Applications of Networks, Need of Network, Elements of Network, Network structure and architecture, OSI &TCP/IP reference model, Transmission modes, networks topology, Guided and un Guided Media , High Speed networks: FDDI ,FDDI,switching methods, Integrated services digital networks.

Unit-II Data Link Layer Framing, error control (Single parity bit checking ,2D parity bit checking, checksum, CRC, Hamming Error Correction code ),Elementary data link protocols:- sliding windows protocols(Stop & Wait ARQ ,GO Back to N & Select repeat ARQ) , High Level Data Link Control Medium access sub layer:- Channel allocations (static and dynamic channel allocation) , ALOHA Protocols- Pure ALOHA, slotted ALOHA, Carrier Sense Multiple Access Protocols, CSMA/CD,CSMA/CA.

Unit-III Network Layer Point-to Point networks, routing algorithms ,Adaptive and Non adaptive Routing algorithm, (Distance vector and Link state routing algorithm) , congestion control strategies & algorithms(Token bucket and leaky bucket algorithm), internetworking, IPV4 &IP Datagram, IP addresses, Class of IP,Subnetting,masking,IPv6.

Unit-IV Transport Layer Design issues, connection management, Three way handshaking, TCP window Management, User Datagram Protocol, Transmission Control Protocol, Port number and socket address.

Unit-V Application Layer: Network Security, symmetric and Asymmetric encryption algorithm ,DES, RSA algorithms, Domain Name System, Simple Network Management Protocol, Electronic mail, SMTP, POP, File Transfer Protocol, Hyper Text Transfer Protocol.

Reference Books 1. W. Stallings, “Data and Computer Communication”, Macmillan Press 2. Forouzan, “Data Communication and Networking”, TMH 3.Data Communication & Computer Network ,Tanenbaum

S.

No




Total

Theory

3. MCA 303 Computer Networks 3 1 - 10 30 40 60 100 4


22

S.

No



L T P TA CT TOT ESE Sub.

Total

Theory

4. MCA 304 Analysis and Design Of

Algorithms

4 1 - 10 30 40 60 100 5

MCA 304 Analysis And Design of Algorithms

UNIT-I Algorithms, Analysis of Algorithms, Design of Algorithms, and Complexity of Algorithms Growth of Functions: Asymptotic notations, Mathematical Analysis of Non-Recursive and Recursive Algorithms.Recurrences and Solution of Recurrence Equations- The Substitution method, TheRecurrence–Tree Method, The Master Method.

UNIT-II Sorting in polynomial Time: Insertion sort, Merge sort, Heap sort, and Quick sort, Sorting in Linear Time: Counting sort, Radix Sort, Bucket Sort . Red-Black Trees, Augmenting Data Structure.

UNIT-III Greedy Technique: Fractional Knapsack Problem,Activity Selection Problem. Dynamic Programming: 0/1 Knapsack Problem, Matrix-Chain Multiplication. Backtracking: Hamiltonian Circuit Problem; Branch-and-Bound: Assignment Problem, Traveling Salesperson Problem;

UNIT-IV Graph: Introduction, Representation of Graph, BFS, DFS, Minimum Spanning Tree:Prims Algorithm, Kruskal Algorithm, Single Source. Shortest Paths: Bellman-FordAlgorithm, Dijkstra Algorithm, All Pair Shortest Paths: Floyd-Warshall Algorithm, FlowNetwork:Maximum flow -min cut theorem.

UNIT-V NP-Completeness: P, NP, NP-Hard & NP-Complete Class, Reducibility & NP-CompleteProblems. Approximation Algorithms: The Vertex Cover Problem, The Set CoveringProblem

Reference Books:

1. T. H Cormen, C E Leiserson, R L Rivest and C Stein: Introduction to Algorithms, 3rdEdition, Prentice-Hall of India,

2. Ellis Horowitz, SartajSahni, S.Rajasekharan: Fundamentals of ComputerAlgorithms, 2nd Edition, Universities press,

3. AnanyLevitin: Introduction to The Design & Analysis of Algorithms, 2nd Edition,Pearson Education.

4. Kenneth A. Berman, Jerome L. Paul: Algorithms, Cengage Learning. 1. S. Baase: Computer Algorithms: Introduction to Design and Analysis, 2nd ed.,Addis


23

MCA 305 SOFTWARE ENGINEERING

UNIT I Introduction to Software Engineering Definition, software engineering problem, approach and goals of software engineering. Software Processes, component of software processes, characteristics of a software process, software development process, SDLC, Process Models: Waterfall Model, prototyping, RAD, incremental, spiral, WINWIN spiral, Software quality: SEI CMM and ISO-9001.

UNIT II SRS, Software Modeling & Design Software requirement, need for SRS, characteristics and component of SRS, specification language, Requirement analysis, formal & informal approach, structured analysis, object oriented modeling, Structure of a requirement document, validation of SRS, requirement reviews, quality metrics,Data Modeling and designing, Function Modeling & Designing, Behavior Modeling and Design, Object oriented design, Functional Independence, coupling & Its Type, cohesion & its Type.

UNIT III Software project Management Project Metrics: Size oriented Metrics: LOC, KLOC, Function point, extended function point metrics, S/W Cost estimation: uncertainties in cost estimation, COCOMO model. Project scheduling and tracking , GANNT and PERT chart, risk management, software project planning, monitoring, and controlling , software configuration management process(SCM), Software reliability and fault-tolerance, reliability metrics

UNIT IV Software Testing Techniques and Strategies Software testing objectives & principles, test case design, white box testing, black box testing: A Boundary Value Analysis ,Equivalence class partitioning, Approach to software testing, unit and integration testing ,System Testing, validation testing , Alpha & Beta Testing ,debugging, debugging techniques

UNIT VSoftware Maintenance, implementation & Software Re-engineering Software maintenance:Adaptive ,corrective and perfective maintenance, Software implementations: parallel approach, Direct cut over, Pilot approach ,Software reengineering, Reverse engineering, Computer Aided Software Engineering: Building blocks for CASE, CASE tools, integrated CASE environment, CASE repository. Component Based Software Engineering: CBSE process, Component based development, Clean Room Engineering.

Reference Books: 1. Pressman Roger, Software Engineering: A Practitioner’s Approach TMH, Delhi. 2. JalotePankaj: An Integrated Approach to software Engineering, Narosa, Delhi. 3. R.E.Fairly, Software Engineering Concepts, McGraw Hill, Inc 1985. 4. Poyce, Software Project Management, Addison Wesley.

S.

No




Total

Theory

5. MCA 305 Software Engineering 4 0 - 10 30 40 60 100 4


24

MCA-SS Joomla

Overview of Joomla, Installing Joomla on localhost, Common mistakes and uninstalling Joomla, Creating Articles in Joomla, Article Options in Joomla, Formatting Article in Joomla, Categories in Joomla, Menus in Joomla.

Reference: Spoken Tutorial (http://spoken-tutorial.org)

S.

No




Total

Self-Study

8. MCA-SS Self-Study course - Joomla Grade -


25

FOURTH SEMESTER

S.

No




Total

Theory

1 MCA 401 Computer Graphics 3 1 0 10 30 40 60 100 4

MCA 401 Computer Graphics Unit I – Computer Graphics and output primitives Concepts and applications, Random and Raster scan devices, CRT, LCD ,TFT , plasma panels ,DLP , Printers, Keyboards, Mouse, Scanners, Graphics Software, output primitives, Pixel ,frame buffer, function for segment, segmenting display file ,posting and un-posting & appending segment, Free storage allocation ,display file structure. Unit II Line and circle drawing algorithm DDA,Bresenham’s. Line and Circle generating algorithm, Midpoint circle drawing algorithms: Attributes of output primitive, Antialising, Area filling: Filled area primitive: Scan-line Polygon fill Algorithm, boundary fill algorithm, flood fill algorithm. Unit III – 2-D-Transformation, Viewing, Clipping Two-dimensional Transformations: Translation, scaling, rotation, reflection, shear, matrix representation of all homogeneous coordinates composite transformation. 2D-projections– parallel and perspective projection, 2D dimensional viewing, Viewing pipeline, Window-to-view port transformation.Clipping operations, Line Clipping: Cohen Sutherland, Liang-barsky, , concave & convex polygon ,Polygon Clipping, Sutherland Hodgeman polygon. Unit IV – 3-D Transformation and Visible surface detection 3D object representations: Polygon Surface, Tables, Plane Equation. Curved lines and Surfaces: Spline representation, Interpolating and approximation curves, continuity conditions Cubic Splines, Bezier curves, B-Spline curves: characteristics and generation, Visible Surface detection Algorithm: Object based and image based methods, depth comparison, A-Buffer, Back face removal, Scan-line method, Depth Sorting Method Area subdivision method. Unit V – Overview of multimedia Overview of multimedia, Classification, basic concept of sound/audio MIDI: devices, messages, software. Speech, Video and Animation: Basic concept, computer-based animation, methods of controlling animation, display of animation, and transmission of animation. Lossless compression, Lossless compression, Image compression & LZW compression References Books: 1. Computer Graphics by Donand Hearn & M. Pauline Baker PHI. 2. Multimedia Computing Communication & Applications “ By Ralf Steimnety&KerlaNeshtudt.” Prince Hall. 3. Principles of Interactive Compo Graphics; W.M.Newman& Robert F Sproull. 4. Computer Graphics by Rogers TMH. 5. Introduction to Computer Graphics AnirbanMukhopadhyay& Arup Chattopadhyay. 6.Schaum’s outlines – Computer Graphics McGraw Hill International Edition.5 7. Principles of Multimedia by Ranjan Parekh TMH. 8. “Multimedia Systems Design”, P.K.Andleigh& K. Thakrar, Prentice Hall Pvt. Ltd.


26

S.

No


Practica

l

Credit



Total

Theory

2. MCA 402 Advance Programming In Java 4 - 2 10 30 40 60 100 4/1

MCA 402 ADVANCE PROGRAMMING IN JAVA

UNIT I Applets Browser &Types, Introduction to basic tags of HTML, Applet, applet life cycle, applet class, applet context class, passing parameters to applet , use of java .AWT graphics class and its various methods in an applet

UNIT II Graphical user interface Layout managers: (flowlayout, borderlayout, card layout grid bag layout, grid layout), AWT controls (labels, buttons, canvases, checkboxes, checkbox group, choices, textfields, textareas, lists, scrollbars, panels,splitpanes,Progress bar , windows, frames, menus, menubars). Java Swing:Working with JFrame, JApplet, Jpanel, JTextfield, JPassword Field, Jbutton, Jcheckbox, Jradiobutton, Jlist, Jscrollpane, Jcombobox, Jmenu, Jmenubar, JMenultem, Jpopup Menu, JTree, JTable. Event Handling: Event delegation model or event class hierarchy, all classes and interfaces of event delegation model, programs related to event.

UNIT III Enterprise Java Bean & JDBC Connectivity Java Beans, Preparing a Class to be a Java Bean, Creating a JavaBean, JavaBean Properties, Types of beans, Stateful Session bean, Stateless Session bean, Entity bean.Java Database Connectivity (JDBC): JDBC Classes and its important methods , Merging Data from Multiple Tables: Joining, ManipulatingDatabases with JDBC, Prepared Statements, Transaction Processing, Stored Procedures C.

UNIT IV Servlets Servlet Overview and Architecture, Interface Servlet and the Servlet Life Cycle, The Javax.servlet Package, Accessing a Servlet using an HTML page, Handling HTTP get Requests , Handling HTTP post Requests, Redirecting Requests to Other Resources, Session Tracking, Cookies, Session Tracking with HttpSession.

UNIT V Java Server Pages (JSP) Introduction to JSP and webserver ,Tomcat Apache,XAMP, WAMP, JavaServer Pages Overview, A First JavaServer Page Example, Implicit Objects, Scripting, Standard Actions, Directives, Custom Tag Libraries

Reference Books: 1. Herbert Schildt (2006), “The Complete Reference Java 2 (Updated to Cover J2SE 1.4)”, Ed. 05, Tata McGraw-Hill . 2. Cay S. Horstmann Gary Cornell, “ Core Java 2 Volume-I Fundamentals”, Ed-07, PEARSONEducation. 3. Michael Morgan, “Java 2 for Professionals Developers”, Ed. 01, SAMS, Techmedia. 4. Bruce Echel, “ Thinking in Java, The Definitive Introduction to Object-Oriented Programming in the Language of World-Wide-Web”, Ed-03, PEARSON Education. 5. Philip Heller and Simon Roberts, “Java 2 Developer’s Hand Book”, BPB Publication.


27

MCA 403 Elective-I

MCA403.1 MOBILE COMPUTING MCA 403.2 COMPILER DESIGN MCA 403.3 ARTIFICIAL INTELLIGENCE MCA 403.4 GRAPH THEORY

MCA 403.1 MOBILE COMPUTING UNIT I Introduction to Mobile Computing, Issues in Mobile Computing, Wireless Telephony, Digital Cellular Standards, cellular system architecture, Multiple Access Protocols : TDMA, FDMA and CDMA, GSM, GPRS, handoffs, Near-far problem, channel allocation in cellular systems.

UNIT II Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth, TCP over wireless- Indirect TCP, Snoop Protocol, Fast retransmit and Mobile TCP, Mobile IP, WAP: Architecture, applications.

UNIT III Data management issues, data replication for mobile computers, adaptive clustering for mobile wireless networks, File system (CODA), Disconnected operations.

UNIT IV Mobile Agents computing, transaction processing in mobile computing environment, location management- static and dynamic, Ping pong effect, location based services.

UNIT V What is Ad-hoc Network? , Problems with Message Routing in Wireless Ad-hoc Mobile Networks, Dynamic State Routing (DSR), Route Maintenance and Routing error, Fisheye Routing (FSR), Ad-hoc on Demand Distance Vector (AODV)

Reference Books:

1. ShambhuUpadhyaya, AbhijeetChaudhary, Kevin Kwiat, Mark Weises, “MobileComputing”, Kluwer Academic Publishers

2. UWE Hansmann, LotharMerk, Martin-S-Nickious, Thomas Stohe, “Principles of MobileComputing”, Springer International Edition

S.No Course No. Subject Evaluation – Scheme Credit



Total

Theory

3 MCA 403.1 Mobile Computing

(Elective 1)

4 1 - 10 30 40 60 100 5


28

S.

No




Total

Theory

3 MCA 403.2 COMPILER DESIGN

(Elective 1)

4 1 - 10 30 40 60 100 5

MCA 403.2 COMPILER DESIGN UNIT I Introduction to Compiler Single and Multi Pass Compilers, Translators, Phases of Compilers, Compiler writing tools, Bootstrapping, Back patching.Finite Automata and Lexical Analysis: Role of Lexical Analyzer, Specification of tokens, Recognition of tokens, Regular expression, Finite automata from regular expression to finite automata, transition diagrams, Implementation of lexical analyzer, Tool for lexical analyzer – LEX, Error reporting.

UNIT II Syntax Analysis and Parsing Techniques Context free grammars, Bottom-up-parsing and top down parsing, Top down parsing: elimination of leftrecursion, recursive descent parsing, Predictive parsing; Bottom Up Parsing: Operator precedence parsing, LR parsers, Construction of SLR, canonical LR and LALR parsing tables, Construction of SLR parse tables for ambiguous grammar, the parser generator – YACC, error recovery in top down and bottom up parsing.

UNIT III Syntax Directed Translation & Intermediate codegeneration Synthesized and inherited attributes, dependency graph, Construction of syntax trees, bottom up and topdown evaluation of attributes, S-attributed and L-attributed definitions.Postfix notation; Three address code, quadruples, triples and indirect triples, Translation of assignment statements, control flow, Boolean expressions and Procedure Calls.

UNIT IV Runtime Environment Storage organization, activation tree, activation record, allocation strategies, Parameter passing, symbol table, dynamic storage allocation.

UNIT V Code Optimization & Code Generation Basic blocks and flow graphs, Optimization of basic blocks, Loop optimization, Global data flow analysis, Loop invariant computations.Issues in the design of Code generator, register allocation, the target machine and a simple code generator.

Reference Books: 1. Compiler-Principles, Techniques and Tools by Alfred V.Aho, Ravi Sethi and J. D.Ullman, Addison Wesley. 2. Principles of Compiler Design, Alfred V.Aho and J.D.Ullman, Narosa Publication. 3. Compiler Design in C by A.C. Holub, Prentice Hall of India. 4. Compiler Construction (Theory and Practice) by A.Barret William and R.M.Bates (Galgotia Publication) 5. Compiler Design, Kakde, Compiler Design, Galgotia Publication.


29

S.No Course No. Subject Evaluation – Scheme Credit



Total

Theory

3 MCA 403.3 ARTIFICIAL INTELLIGENCE

(Elective 1)

4 1 - 10 30 40 60 100 5

MCA 403.3 ARTIFICIAL INTELLIGENCE UNIT I General Issues and overview of AI The AI problems: what is an AI technique; Characteristics of AI applications Problem Solving, Search and Control Strategies General Problem solving; Production systems; Control strategies; forward and backward chaining Exhaustive searches: Depth first Breadth first search.

UNIT II Heuristic Search Techniques Hill climbing; Branch and Bound technique; Best first search and A* algorithm; AND/OR Graphs; Problem reduction and AO* algorithm; Constraint Satisfaction problems Game Playing Min Max Search procedure; Alpha-Beta cutoff; Additional Refinements.

UNIT III Knowledge Representation First Order Predicate Calculus; Skolemization ; Resolution Principle and Unification; InferenceMechanisms Horn’s Clauses; Semantic Networks; Frame Systems and Value Inheritance; Scripts; Conceptual Dependency AI Programming Languages Introduction to LISP, Syntax and Numeric Function; List manipulation functions; Iteration and Recursion; Property list and Arrays.

UNIT IV Natural Language Processing and Parsing Techniques Context – Free Grammar; Recursive Transition Nets (RTN); Augmented Transition Nets (ATN); Semantic Analysis, Case and Logic Grammars; Planning Overview – An Example Domain: The Blocks Word; Component of Planning Systems; Goal Stack Planning (linear planning); Probability theory; Bayes Theorem and Bayesian networks; Certainty Factor.

UNIT V Expert Systems Introduction to Expert Systems, Architecture of Expert Systems; Expert System Shells; Knowledge Acquisition; Case Studies; MYCIN, Learning, Rote Learning; Learning by Induction; explanation based learning.

Reference Books: 1. Elaine Rich and Kevin Knight: Artificial Intelligence – Tata McGraw Hill. 2. Dan W.Patterson, Introduction to Artificial Intelligence and Expert Systems – PrenticeHall of India.

3. Nils J. Nilsson: Principles of Artificial Intelligence – Narosa Publication house.

4. Artificial Intelligence : A Modern Approach, Stuart Rusell, Peter Norving, Pearson Education 2nd Edition. 5. Artificial Intelligence, Winston, Patrick, Henry, Pearson Education.

6. Artificial Intelligence by Gopal Krishna, Janakiraman.on-Wesley, California, 2002


30

S.

No




Total

Theory

3 MCA 403.4 GRAPH THEORY

(Elective 1)

4 1 - 10 30 40 60 100 5

MCA-403.4 GRAPH THEORY UNIT I Introduction to Graphs Definition of a graph, applications of graph, finite and infinite graphs, degree of a vertex, types of graphs, isomorphism, sub-graphs, walk, path, circuit, connectedness, operations on graphs, Euler graph, Hamiltonian graph, circuits and cut-sets. Planar graph, Euler’s polyhedron formula, Kuratowski’s graphs, detection of planarity, geometric dual, combinatorial dual, thickness and crossings.

UNIT II Trees and shortest path algorithms Tree Basics & Properties, pendent vertices, distance, center , diameters, radius, eccentricity, rooted and binary trees, On counting tress, Depth of Tree, spanning tree, Minimum Spanning Tree , fundamental circuits and cut-sets, finding all spanning trees of a graph. Shortest distance Algorithms: Algorithms of Prims &Kruskal ,Dijkstra’s Algorithm.

UNIT III Matrix representation of directed & undirected graphs Incidence matrix of graph, sub matrices of A(G), circuit matrix, fundamental circuit matrix and rank of B, cut set matrix, relationships among 𝐴𝑓 , 𝐵𝑓 and 𝐶𝑓, adjacency matrices, path matrix, rank- nullity

theorem. Directed graph , Types of directed graphs, Directed paths and connectedness, Euler digraph, Trees with directed edges, Fundamental circuit in digraph, Matrices A, B, C of digraph, adjacency matrix of digraph.

UNIT IV Graph Coloring Partitioning of graph, Chromatic number, Wetch-Powell Algorithm, Chromatic partitioning, Chromatic polynomials, Decomposition theorem, Five Color theorem , Edge coloring, Chromatic Index, Region coloring, matching & covering, Four color problem.

UNIT V Network Flow & Enumeration of graph Network flows, max flow mincut algorithm, Enumeration and its types, Counting of labeled and unlabeled trees, Polya’scounting theorem, Cayley’s Theorem.

Reference Books:

1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”, Prentice Hall of India.

2. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, Addison Wesley.

3. Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers. 4. Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer Scientists

and Mathematicians” , Prentice Hall of India.


31

MCA 404 ELECTIVE –II

MCA 404.1 PHP and MY SQL MCA 404.2 ANDRIOD DEVELOPMENT MCA 404.3 SQL/PL-SQL PROGRAMMING

S.

No


Practica

l

Credit



Total

Theory

1 MCA 404.1 PHP and MY SQL

(Elective –II)

4 - 2 10 30 40 60 100 4/1

MCA 404.1 PHP and MY SQL UNIT I Introduction to PHP Evaluation of PHP, Basic Syntax, Defining variable and constant, Php Data type, Operator and Expression. Decisions and loop Making Decisions, Doing Repetitive task with looping, Mixing Decisions and looping with Html.

UNIT II Function What is a function, Define a function, Call by value and Call by reference, Recursive function, String Creating and accessing, String Searching & Replacing String, Formatting String, String Related Library function.Array Anatomy of an Array, Creating index based and Associative array Accessing array, Element Looping with Index based array, Looping with associative array using each () and foreach(), Some useful Library function.

UNIT III HTML Forms and Files Handling Html Form with Php: Capturing Form, Data Dealing with Multi-value filed, and Generating File uploaded form, redirecting a form after submission.Working with file and Directories Understanding file& directory, Opening and closing, a file, Coping, renaming and deleting a file, working with directories, Creating and deleting folder, File Uploading & Downloading.

UNIT IV Session and Cookies Introduction to Session Control, Session Functionality What is a Cookie, Setting Cookies with PHP. Using Cookies with Sessions, Deleting Cookies, Registering Session variables, Destroying the variables and Session.

UNIT V Database Connectivity Introduction to RDBMS, Connection with MySql Database, Performing basic database operation(DML) (Insert, Delete, Update, Select), Setting query parameter, Executing queryJoin (Cross joins, Inner joins, Outer Joins, Self joins) , Exception Handling Understanding Exception and error, Try, catch, throw, Error tracking and debugging.

Reference Books:

1. Learning PHP, MySQL, books by ‘ O’ riley Press


32

S.

No


Practica

l

Credit



Total

Theory

4 MCA 404.2 Android Development

(Elective II )

4 - 2 10 30 40 60 100 4/1

MCA 404.2 ANDRIOD DEVELOPMENT

UNIT I Introduction to Android

History of Mobile Software Development, The Open Handset Alliance, The Android Platform, Android SDK, Creation of New AVD, Creating run configuration, Building a sample Android application

UNIT II Android Application Design Essentials Anatomy of Android applications ,Android terminologies , Aplication Context, Activities, Services, Intents ,Receiving and Broadcasting Intents , A ndroid Manifest File and its common settings,Using Intent Filter, Permissions, Managing Application resources in a hierarchy, Working with different types of resources

UNIT III Android User Interface Design Essentials User Interface Screen elements, Designing User Interfaces with Layouts, Drawing and Working with Animation Drawing and Working with Animation

UNIT IV Using Common Android APIs Using Android Data and Storage APIs ,Managing data using SQLite, Sharing Data between Applications with Content Providers,Using Android Networking APIs , sing Android Web APIs, Using Android Telephony APIs Text

Reference Books: 1. Lauren Darcey and Shane Conder, “Android Wireless Application Development”, Pearson Education2nd edition. 2. Reto Meier, “Professional Android 2 Application Development”, Wiley India Pvt Ltd. 3. Mark L Murphy, “Beginning Android”, Wiley India Pvt. Ltd. 4. Sayed Y Hashimi and Satya Komatineni, “Pro Android”, Wiley India Pvt. Ltd.


33

MCA 404.3 SQL/PL-SQL Programming

UNIT I SQL and Advance SQL SQL Commands and Data types, Operators and Expressions, Introduction to SQL * Plus,Managing Tables and Data,Creating and Altering Tables (Including constraints) , Data Manipulation Command like Insert, update, delete , SELECT statement with WHERE, GROUP BY and HAVING clause, ORDER BY, DISTINCT, Special operator like IN, ANY, ALL BETWEEN, EXISTS, LIKE, Join and its types (Non EuqiJoin,EquiJoin,Outer Join, Natural Join, Self Join ), subqueries , Built in functions. Advance SQL: View , Synonyms, Index ,Sequence.

UNIT II Introduction to PL/SQL & Cursors SQL v/s PL/SQL , PL/SQL Block Structure , Language construct of PL/SQL (Variables, Basic and Composite Data type, Conditions looping etc.) , % TYPE and % ROWTYPE , Implicit Cursor, Cursor Attributes, Writing Explicit Cursors (Cursor function, declaring, opening, fetching data from cursor), Cursor FOR loop. Advanced Explicit Cursors ( Cursor with Parameter ) .

UNIT III Error handling ,Transaction control & Security in PL/SQL Exception Types, Predefined Exception, User Defined Exception, Raise ApplicationError., Locks, Types of locks, Application of Locks, Transaction Control Statements , Commit, Rollback, Savepoint, Application of Save Point,

UNIT IV PL/SQL Database Objects Anonymous PL/SQL and named Block, Developing stored Procedures, formal and actual parameters, IN, OUT and INOUT parameters, Creating Functions, Stored Functions, User Defined Functions. Creating Packages, Component of Package, Developing Package, Overloading procedures and Functions

UNIT V Triggers and Collection Triggers Types of triggers, Create DML Triggers (Row trigger, Statement triggers, Before and after triggers, using OLD and NEW qualifier) , Firing (Timing), Statement Level Triggers and Row Level Triggers, Create Instead of and Disabled Triggers, Manage, Test and Remove Triggers. Collection in PL/SQL Object Types, Nested Tables, Variable Arrays, Associative Arrays/ Index by table Array.

Reference Books: 1. Baron Schwartz , High Performance MySQL, O’Reilly. 2. VikramVaswani , The Complete Reference MySQL , McGraw Hill Educations. 3 Ivan Bayross ,PL/SQL Programming ,TMH. 4 Oracle Complete Reference, Oracle Press.

S.

No


Practica

l

Credit



Total

Theory

4. MCA 404.3 SQL/PL-SQL Programming

(Elective –II)

4 - 2 10 30 40 60 100 4/1


34

S.

No




Total

Theory

5 MCA 405 Microprocessor Systems 4 - - 10 30 40 60 100 4

MCA405 MICROPROCESSOR SYSTEMS UNIT I Introduction to Microprocessor, History of Microprocessors, Micro-Computers and Micro-Controllers, Microprocessor architecture and its operations, Memory, Input & output devices, Logic devices for interfacing, The 8085 MPU, Example of an 8085 based computer, Memory interfacing & Address Decoding.

UNIT II Basic interfacing concepts, Interfacing output displays, Interfacing input devices, Memory mapped I/O, Peripheral Mapped I/O, Flow chart symbols, Data Transfer operations, Arithmetic operations, Logic Operations, Branch operation, Writing assembly language programs, Programming techniques: looping, counting.

UNIT III Additional data transfer and 16 bit arithmetic instruction, Arithmetic operations related to memory, Logic operation: rotate, compare, counter and time delays, Illustrative program: Hexadecimal counter, zero-to-nine (modulo ten) counter, Stack, Subroutine, Restart, Conditional call and return instructions, , The 8085 Interrupts, 8085 vector interrupts, RIM & SIM Instruction.

UNIT IV Program: Addition, subtraction, multiplication & division of 8-bit numbers, finding largest & smallest numbers in an array, sorting of array, Block transfer of data bytes, Swapping of memory locations, BCD-to-Binary conversion, Binary-to-BCD conversion.

UNIT V 8255 Programmable peripheral interface, interfacing keyboard and seven segment display, 8254 (8253) programmable interval timer, 8259A programmable interrupt controller, Direct Memory Access and 8237 DMA controller. Introduction to 8086 microprocessor: Architecture of 8086 (Pin diagram, Functional block diagram, Register organization).

Reference Books: 1. Ramesh Gaonkar, “Microprocessor Architecture, Programming, and Applications with the 8085”, 5th Edition,

Penram International Publication (India) Pvt. Ltd. 2. Douglas V. Hall, “Microprocessors and Interfacing”, Tata McGraw Hill.

3. Yu-cheng Liu, Glenn A.Gibson, “Microcomputer Systems: The 8086 / 8088 Family - Architecture, Programming and Design”, Second Edition, Prentice Hall of India.

4. Peter Abel, “IBM PC Assembly language and programming”, Fifh Edition, Prentice Hall

of India Pvt. Ltd. 5. Mohamed Ali Mazidi, Janice GillispieMazidi, RolinMcKinlay, “The 8051 Microcontroller and Embedded Systems:

Using Assembly and C”, Pearson education.


35

Third Year

FIFTH SEMESTER S.

N

o




Total

Theory

1 MCA501 Network Security & Cryptography 3 1 - 10 30 40 60 100 4

MCA 501 NETWORK SECURITY AND CRYPTOGRAPHY UNIT I Introduction To security Basic aspects of Network security, Services & Mechanisms, Attacks, Security Services, Conventional Encryption, Conventional Encryption Model, and steganography, Differential & Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher Modes of Operations.

UNIT II Conventional Encryption Algorithms

DES,DES Algorithm, DES standard,DES strength ,2DES, 3 DES, Blowfish, International Data Encryption Algorithm, RC5, CAST-128, CR2 Placement & Encryption Function, RSA, Key Distribution, DeffieHellmen Key Exchange Algorithm, Random Number Generation.

UNIT III Hash Functions Message Authentication & Hash Functions: Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Function Birthday Attacks, Security of Hash Function & MAC, MD5 Message Digest Algorithm, Secure Hash Algorithm (SHA), Digital Signature, Authentication Protocol, Digital Signature Standard (DDS), Proof of Digital Signature Algorithm, Digital certificate. X.25, Secure Electronic Transaction.

UNIT IV Network & System Security Secure Socket Layer ,Authentication Applications: Kerberos X-509, Directory Authentication Service, Electronic Mail Security,PEM, Pretty Good Privacy (PGP),S/MIME Security: Architecture, Authentication Header, Encapsulating Security Payloads, Combining Security Associations,cyberlaws

Reference Books : 1. William Stallings, "Cryptography and Network Security: Principles and Practice",Prentice hall, New Jersey 2. Johannes A. Buchmann, "Introduction to Cryptography" Springer-Verlag 3. AtulKahate, "Cryptography and Network Security" TMH


36

S.

No


Practic

al

Credit



Total

Theory

2 MCA 502 C# &Programming & Dot NET

framework

4 - 2 10 30 40 60 100 4/1

MCA 502 C# PROGRAMMING AND DOT NET FRAMEWORK

UNIT I Introduction to .NET Framework And C# .NET framework, MSIL, CLR and its components, CLS, CTS, Just in time (JIT) Compiler,Base class library, Framework Class Libraries (FSL), Namespaces, Assemblies, DLL -Hell Problem,GAC,Garbage Collection. Introduction to C#, Visual studio console app, Boxing and Unboxing, loops, Array, Enumerations, structures.

UNIT II C# Object oriented programming OOPs, Classes and objects, ,Encapsulation, Inheritance, Polymorphism, Abstract class, Sealed class, Interface ,Constructor and Destructors, Method Overloading ,Method overriding, Operator Overloading, Modifiers, Property and Indexers , Collections Namespaces, Delegates, Event handling , Exception Handling.

UNIT III IO and Threads Multithreading, Thread pooling ,Appdomains, Concurrency and synchronization- Locks, Monitors, Mutexes, System.IO, Streams, TextWriter, TextReader, BinaryWirter, BinaryReader

UNIT IV ADO.Net, C# windows forms for data control Grid, Datasource and databinding controls, Connected and disconnected scenarios, Dataset, connections, Adapters, commands, datareaders. Windows Forms and Controls in details:Windows form , Windows Forms Properties and Events, Windows Form Controls etc.

UNIT V ASP.NET ASP.net: Introduction to ASP.NET, Architecture ,Working with Web and HTML Controls, Server Controls , Overview of ASP.NET Validation Controls, Data base connectivity using ASP.net. Introduction of XML, Using XML with ASP.net Master Pages, Displaying Data with the Grid View Control ,State management.

Reference Books:

1. Addison Wesley –C# Developers Guide to ASP.Net 2. Wiley,” Beginning Visual C# 2008”,Wrox 3. Claudia M. Baca, Patti, PMP: Project Management Professional Workbook, Sybex, Workbook 4. C#.Net Developers Guide- Greg Hack, Jason Werry, SaurabhNandu. (SyngRess) 5. Wrox Press Professional C# 3rd Edition – Simon Robinson, Jay Glynn


37

No Course No. Subject Evaluation – Scheme Theory/

Practica

l

Credit



Total

Theory

3 MCA 503 UNIX & Shell Programming 4 - 2 10 30 40 60 100 4/1

MCA 503 UNIX AND SHELL PROGRAMMING

UNIT I Basic Unix Commands:The Unix editors and vi; Redirection, Piping, Tees and filters; The Unix Utilities grep, sed, etc. Overview of Unix Architecture: The kernel and the Shell; Processes and Time Sharing files and Directories; Peripheral Device as files.

UNIT II Introduction the Shell Scripts: The Bourne and C-shells; Shell variables, scripts meta-characters and environment; the if and case statements; for, while and until loops. System calls and the ‘C’ library:Discussion of the Unix system calls and ‘C’ library functions, the standard I/O Package; file handling; math library; command line parameters etc. The Unix ‘C’ interface; ‘C’ files and Graphics. Introduction of systems Administration under Unix: The system Manger OLE and functions.

Unit III Different Tools: Debugging language development, System development different print formatting UNIX Tools. Bourne Shell: Shell meta characteristics, shell variable, scripts, facilities, commands and environments, shell archive, idea about restricted shell, ROLC program. KornShell:Shell variables and scripts, built in EDITOR, built in integer arithmetic, string manipulation capabilities, Command Aliasing, Array Job control. C-Shell:Shell variables and scripts, shell facilities, history Integer Arithmetic Decision making and job control.

Reference Books: 1. Stephan Prata:Advanced Unix – A Programmers Guide – BPB PUB. 2. Kernighlan&Pike : The Unix Programming Environment – PHI. 3.Unix Shell Programming Sumitabha Dass 4.Unix Shell Programming,Yashwant Kanitkar


38

MCA 504 [Elective -1] Choose any one

MCA 504.1 MULTIMEIDA AND ANIMATION MCA 504.2 PROBABILITY AND STATISITICS MCA 504 .3 MANAGEMENT INFORMATION SYSTEM

S.

No




Total

Theory

4 MCA504.1 Multimedia & Animation 3 1 - 10 30 40 60 100 4

MCA 504.1 MULTIMEIDA AND ANIMATION UNIT-I Introduction to Multimedia, Applications of Multimedia, Multimedia hardware, Memory & storage devices, Communication devices, Multimedia software, image capturing, Authoring Tools, MIDI

UNIT -II Multimedia Building Blocks- Text, Image, Sound, Video, Animation

UNIT III Sound, Analog and Digital Audio, Sampling, Audio File Formats, Conversion from Analog to Digital Audio,

UNIT IV Bitmap and Vector Images Image standards and classifications, Image File Formats , Image Compression for JPEG, GIF, and PNG, Lossy ad Lossless Compression for Images and Audio, Animation Concepts and Techniques, Computer Animation, Video capture and representation, and Database. Content based retrieval for text and images, Video Video representation, Colors, Video Compression, MPEG standards, MHEG Standard, Video File Formats

UNIT V Recent developments in Multimedia, Video Streaming on net, Video Conferencing, Multimedia Broadcast Services, Content Based Retrieval

ReferenceBooks: 1. Buford “Multimedia Systems” ,Addison Wesley. 2. Agrawal&Tiwari “Multimedia Systems”, Excel. 3. Mark Nelson “Data Compression Book”, BPB. 4. Sleinreitz “Multimedia System” 5 A. K. Sriavstava“ Multimedia Systems”


39

504.2 PROBABILITY AND STATISITICS [Elective -1] UNIT I – BASIC STATISTICS Statistical Methods, Advantages and limitations of statistical methods, Frequency Distribution, Measures of central tendency, Measures of Dispersion, Covariance, Variance , Curve fitting – Method of least square , Karl Pearson’s coefficient of Correlation, Rank correlation, line of regression ,regression coefficients, properties of regression coefficients and angle between two regression lines.

UNIT II – THEORY OF PROBABILITY Definition of probability , random experiment, sample space ,Law of addition, Law of multiplication ,dependent and independent events ,mutually & mutually exhaustive events, equally likely events .conditional probability ,Baye’s theorem and its applications, Probability function and Distribution of a discrete random variable, Mathematical expectation, Probability function and distribution of a continuous random variable.

UNIT III – PROBABILITY DISTRIBUTION Binomial distribution, Poisson distribution, hyper geometric distribution, Normal distribution, Fitting of Binomial distribution, Poisson & Normal distribution..

UNIT IV – SAMPLING & STATISTICAL TESTS Definition ,Types of sampling, random sampling and Non Random sampling Test of significance for large samples, Comparison of two large samples,Sampling of variables, Sampling distribution, Test of significance based on chi square test , t-test, F-test and Z-test. ANOVA (Analysis of variance), Analysis of variance for one –way classification and two way classification ; Limitation of Method of ANOVA .

Reference Books: 1. Mathematical Statistics- Ray, Sharma, Chaudhary, Ram Prasad and Sons. 2. Statistical Analysis: A Computer Oriented Approach- Affi, A.A., Academic Press 3. Introduction to Mathematical Statistics- Hogg, R.V. et al, American Publishing 4.,StatisticalMethods,SPGupta,Sultan Chand & Son

S.

No




Total

Theory

4 MCA504.2 Probability & Statistics 3 1 - 10 30 40 60 100 4


40

504 .3 MANAGEMENT INFORMATION SYSTEM [Elective -1]

UNIT I Organisation& Types, Decision Making, Data & information, Characteristics & Classification of information, Cost & value of information, various channels of information,Transaction Process system

UNIT II Introduction to Information System in Business ,Fundamentals of Information System, Solving Business Problems with Information System, Concept of Balanced MIS, Development of MIS, Levels of MIS, Effectiveness & Efficiency Criteria. Tool and Techniques of MIS- dataflow diagram, flow chart etc. Reports: Various types of MIS reports, GUI & Other Presentation tools.

UNIT III:

Business application of information technology: electronic commerce, Internet, Intranet, Extranet & Enterprise Solutions, Information System for Business Operations, Information system for managerial Transaction Processing Systems, Management Reporting System, Decision Support Systems, Expert Systems, Office Automation System,

UNIT IV: Enterprise Resource Planning,ERP introduction, ERP modules like Human Resources, Finance, Accounting, Production & Logistics. Supply Chain Management, CRM, Procurement etc . , Enterprise & Global Management, Security & Ethical Challenges, Planning & Implementing Change.

Reference Books: 1. Brein James O. – Management Information Systems 2. Murdick& Ross – Information Systems for Modern Management,PHI 3. Parker C.S. – Management Information Systems – Strategy and Action. 4. AktasA.Ziya – Structured Analysis and Design of Information Systems. 5. O.Brian, “Introduction to Information System”, McGraw Hill. 6. Bansal, “Information System Analysis & Design”, TMH. 7. Jawadegar, “Management Information System”, TMH. 8. Alexis Leon, “Enterprise Resource Planning”, TMH.

S.

No




Total

Theory

4 MCA504.3 Management Information System 3 1 - 10 30 40 60 100 4


41

S.

No




Total

Theory

4 MCA 504.4 Enterprise Resource Planning 3 1 - 10 30 40 60 100 4

MCA 504.4 ENTERPRISE RESOURSE PLANNING UNIT- I Introduction to ERP Enterprise Resource Planning Introduction What Is ERP? Need of ERP. Advantage of ERP Growth of ERP

UNIT-II ERP and related technologies Business Process Re-Engineering (BPR) Management Information System (MIS) Decision Support System (DSS) Executive Support System (ESS) Data Warehousing, Data Mining On-Line Analytical Processing (OLAP) Supply Chain Management Customer Relationship Management.

UNIT-III ERP Modules and Vendors Finance Production Planning, Control and Management Sales and Distribution Human Resource Management Inventory Control System Quality Management ERP market

UNIT IV ERP Implementation of Life Cycle Evaluation and selection of ERP package Project planning, Implementation, Team Training and Testing End User Training and Going Live Post Evaluation and Maintenance

UNIT V ERP Case Studies Post Implementation review of ERP packages in manufacturing, Services and Others Organizations

Reference Books: 1. Enterprise Resource Planning, Alexi

Syllabus of Master of Computer Application (MCA)education.sgrru.ac.in/Uploads/syllabus/MCA.pdf ·...

Documents

Transcript of Syllabus of Master of Computer Application (MCA)education.sgrru.ac.in/Uploads/syllabus/MCA.pdf ·...