Mca Semester System Form & Courses First Semester of Mca

MCA SEMESTER SYSTEM FORM & COURSES
FIRST SEMESTER OF MCA

Code No. Subject Periods per Maximum Marks Total
week Marks
D/P Sessional University
MCA 101 IT Fundamentals 4 - 20 80 100
MCA 102 Programming in C & Numerical 4 - 20 80 100

Methods
MCA 103 Computer Organisaion 4 - 20 80 100
MCA 104 Discrete Mathematical Structures 4 - 20 80 100
MCA 105 Accountancy & Financial 4 - 20 80 100

Management
MCA 106 PC Software Lab - 6 20 80 100
MCA 107 'C' Lab - 6 20 80 100
MCA 108 SEMINAR 3 50 ~ 50
Total Marks 20 15 190 560 750
Department of Computer Science

Donbosco PG College, Guntur.
SECOND SEMESTER OF MCA

Code No. Subject Periods per week Maximum Marks Total
Marks
L/T D/P Sessional University
MCA 201 Language Processors 4 - 20 80 100
MCA 202 Data Base Management Systes 4 - 20 80 100
MCA 203 Data Structures 4 - 20 80 100
MCA 204 Operating Systems 4 - 20 80 100
MCA 205 Probability & Statistics 4 - 20 80 100
MCA 206 Data Structures Lab - 6 20 80 100
MCA 207 DBMS Lab - 6 20 80 100
MCA 208 SEMINAR 3 50 ~ 50
Total Marks 20 15 190 560 750

Donbosco PG College, Guntur
THIRD SEMESTER OF MCA

Marks
MCA 301 OOPS WITH C++ 4 - 20 80 100
MCA 302 Computer Networks 4 - 20 80 100
MCA 303 Computer Based Optimisation 4 - 20 80 100

Techniques
MCA 304 Computer Graphics 4 - 20 80 100
MCA 305 Artificial Intelligence 4 - 20 80 100
MCA 306 OOPS Lab - 6 20 80 100
MCA 307 UNIX & SHELL Lab - 6 20 80 100
MCA 308 SEMINAR 3 50 — 50
Total Marks 20 15 190 560 750

FOURTH SEMESTER OF MCA

Marks
MCA 401 Principles of Programming 4 - 20 80 100
Language
MCA 402 Cryptography And Networks 4 - 20 80 100

Security
MCA 403 Principles of Management and 4 - 20 80 100

Enterprises resource Plairming
MCA 404 Software Engineering 4 - 20 80 100
MCA405
1: E-Commerce
2: Object Oriented Databases 4 - 20 80 100
3: Simulation Modelling
MCA 406 Web Designing Lab - 6 20 80 100
MCA 407 Networks & Security Lab - 6 20 80 100
MCA 408 SEMINAR 3 50 — 50
Total Marks 20 15 190 560 750

FIFTH SEMESTER OF MCA

Marks
MCA 501 Data Mining Techniques 4 - 20 80 100
MCA 502 Systems Auditing 4 - 20 80 100
MCA 503 Design & Analysis of 4 - 20 80 100

Algorithms
MCA 504
1: Image Processing
2: Microprocessor & Interfacing
3: Advanced Computer 4 20 80 100
Architecture
MCA 505
1: Image Processing
2: Microprocessor & Interfacing
3: Advanced Computer 4 20 80 100
Architecture
MCA 506 Visual Programming Lab - 6 20 80 100
MCA 507 System Auditing Lab with - 6 20 80 100

Auditing Packages
MCA 508 SEMINAR 3 50 -- 50
Total Marks 20 15 190 560 750

MCA 101 ; IT FUNDAMENTALS
UNIT-I
1. Introduction: Business and Information Technology

2. Organisation and Information Technology Support
UNIT - n
3. Computer Hardware
4. Computer Software
5. Managing Organisational Data and Information
UNIT-III
6. Telecommunications and Networks

7. The Internet and Intrancts
UNIT - IV
8. Interorganisational and Global Information Systems

9. Functional and Enterprise Systems
10. Data, Knowledge and Decision Support
Prescribed Book:
Turban, Ramer & Potter; Introduction to Information Technology, John Wiley(2000)

Chapters one Through Ten only
Reference Books:
1. Cygamski D & ORR J.A; IT inside & Outside, Pearson Education (2002)
2. Hutchinson S.E. & Sawyer S.C; Computers Communication Information,
McGraw Hill (2000)

MCA/DCA 102: PROGRAMMING IN C & NUMERICAL METHODS
UNIT-I
A tutorial Introduction : Getting Started - Variables and Arithmetic Expressions - The for
statements-symbolic Constants character Input and Output - Arrays - Functions - Arguments
call by value-character Arrays - External Variables and Scope. Types, Operators, and
Expression: Variable Names-Data types and sizes, Constants - Declarations - Arithmetic
Operators - Relational and Logical Operators - Type Conversions - Increment and Decrement
Operators - Bitwise operators - Assignment Operators and Expression -conditional expression
- Precedence and order of evaluation. Control Flow Statements and Blocks - If else - else if-
switch-Loops while and for-Loops do-while-Break and continue-goto and labels. Functions and
Program Structure; Basics of functions- functions returning non-integers-extemal variables-
scope rules-header files-static variables-register variables-block structure-initialisation -
recursion - the C preprocessor.
UNIT-n
Pointers and Arrays Pointer and addresses-pointers and function arguments-pointers and arrays-
address arithmetic character pointers and functions-pointer arrays: pointers to pointer-multi
dimensional arrays- initialization of pointer arrays pointers Vs. Multidimensional arrays-
command-line arguments pointers to functions-complicated declarations. Structures Basics of
structures-structures and functions-arrays of structures-pointers to structures - Self-referential
structure - table lookup - typedef-unions - bit fields. Input and output: standard Input and
output-formatted output Printf-variable length argument lists-formatted input-scanf-file access -
error handling stderr and exit line input and output-Miscellaneous function.
UNIT-III
Introduction to Numerical computing, computer codes, and Arithmetic, Approximation and

Errors in Computing, Roots of Nonlinear equations, Direct Solutions of linear Equations,
Iterative solution of linear equations.
UNIT-IV
Interpolation, Numerical Integration, Numerical solutions of ordinary differential equations.

Text Books:
1. Brain W.Kernighan, Dennis M.Ritchie - The C Programming Language,

Prentice-Hall of India Private Limited 2nd edition.
2. E.Balaguruswamy - Numerical Methods
Tata Me Graw - Hill Publishing Company Ltd

UNIT III: Chapters 1,34,6,7,8 UNIT IV : Chapters
9,12,13
Reference Books:
1. J.A.Jones & K.Harrow; C Programming with problem solving, Dreamtech Press

2. Gerald & Wheatley; Applied Numerical Analysis (sixth edition) Pearson Education

MCA 103; COMPUTER ORGANISATION
UNIT -1
Digital Logic Circuits: Digital Compute Logic Gate, Boolean Algebra, Maps Simplification,
Combinational Circuits, Flip Flops, sequential circuits Digital Components. Integrated Circuits,
Decoders, Multiplexers, Registers Shift Registers, Binary Counter, Memory Unit.
Data Representation. Divide Layer, Compliment, Fixed Point Representaion, Floating Point
Representation, Binary codes, error Codes.
UNIT-II
Register Transfers and Micro Operations. Register Transfer Language, Register Transfer, Bus
and Memory Transfer, Arithmetic Microprocessors, Logic Microprocessors, Shift
Microprocessors, Arithmetic Logic Shift-Unit, s
Basic Computer Organization and Design. Internal Codes, Computer Register, Computer
Instructions, Tunning and Control, Instruction Cycle, memory Reference Instructions, Input-
Output and Interrupt.
UNIT-HI
Micro Programmed Control. Control Memory, Address Sequencing, Micro programme

Example, Design of Control Unit.
Central Processing Unit, General Register Organization, stack Organization, Instruction
Formats, Addressing Modes, Data Transfer and Manipulation, Program Control, RISC.
UNIT-W
Computer Arithmetic. Addition and subtractions, Multiplication Algorithms, Division

Algorithms, Floating Point Arithmetic Operations, Decimal Arithmetic Unit, Decimal
Arithmetic Operations.
Input-Output Organization. Peripheral Devices, Input Output Interface, asynchronous Data
Transfer, Modes of Transfers, Priority Interrupt, Discrete Memory Access, Input Output
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary memory, Associate
memory, cache Memory, virtual Memory, Memory Management Hardware.
TEXT BOOK:
1. M.Morris Mano; Computer System Architecture, third edition PHI
chapters 12,3,4,5,7,8,9,10,11,12)
Reference Book
John P.Hyes, Computer Architecture and Organization 3rd edition.

Donbosco PG College, Guntur. 10
MCA 104 DISCRETE MATHEMATICAL STRUCTURES
Unit-I
The Foundations: Logic Sets and Functions,

The Fundamentals : Algorithms,The integers and matrices. Mathematical Reasoning.
Unit-n
Counting
Advanced Counting Techniques
Unit-m
Relations
Graphs
Unit-IV
Trees
Boolean Algebra
Text Book:
Kenneth H Rosen,Discreate Mathematics and its Applications,Fourth

Edition TMH(Chapter 1 through 9)
Reference Book:
Kolmen,Busloy & Rose,Discreate Mathematical Structures, Fourth Edition,Pearson

Education.

MCA105 Accounting and Financial Management
Unit-I
. Cost Accounting
1.1 Accounting Concepts

1.2 Double Entry System
1.3 Journal - Ledger - Trail Balance - Preparation of Final Accounts (Problems)
1.4 Nature of Financial Statement - Preparation of Trading - Profit and Loss Accounts
-Balance Sheet of Joint Stock Companies
Unit-II
. Cost Accounting
2.1 Cost Sheet

2.2 Marginal Costing (Problems)
2.3 Budget & Budgetary Control
2.4 Standard Costing (Problems)
Unit-III
. Financial Management
3.1 Nature and scope of Finance Function - Goals of Financial Management - Modem
Concept of Finance Function
3.2 Nature of Financial Decisions: Concept - Major Financial Decision Areas - Investment
Decision - Financing Decision and Dividend Decision
3.3 Financial Analysis:
Concept of Financial Analysis - Types of Analysis - Tables of Analysis - Ratio Analysis -
Tables of Analysis - Funds Flow and Cash flow Analysis (problems)
Unit-IV
Working Capital Management
4.1 Concepts of Working Capital - Importance of Working Capital - Components of Working

Capital - Determination of Working Capital - Source of Working Capital.
4.2 Inventory Management - Accounts of Receivable Management - Cash Management.
4.3 Forecasting of Working Capital Management.
Text Book:
1. K.Rajeswara Rao and G.Prasad, Accounting and Finance, Jaibharat Publishers, 2002
(Chapters 1 to 19)
12
Reference Book:
1. Vanherene & James C, John M.Wachowiez JR, Fundamentals of Financial

Management PHI, 2002.
2. Herngren, Sundem Elliott, Introduction to Financial Accouting, Pearson Education -
2002.

MCA 201; LANGUAGE PROCESSSORS
Unit-I
1. Language Processor
2. Data Structures for Language Processing
Unit-n
3. Scanning and Parsing
4. Assemblers
Unit-m
5. Macros and Macro Processors
6. Compilers and interpreters
Unit-IV
7. Linkers
8. Software tools
Prescribed Book:
Dhamdhere D.M. : Systems Programming and Operating Systems second revised edition,
TMH (2000)
Chapters one through eight
Reference Book:
Beck LL : System Software An introduction to Programming

Third edition, Pearson Education, Addision Wesley (2000)
John J Donovan : Systems Programming, TMH

MCA 202; DATABASE MANAGEMENT SYSTEMS
Unit-I
1. Databases and Database Users.

2. Database System Concepts and Architecture
3. Data Modeling Using the Entity - Relationship Model.
4. Enhanced Entity-Relationship and Object Modelling.
5. Record Storage and primary File Organizations.
6. Index Structures for Files
Unit-II
7. The Relational Data Model, Relational Constraints and the relational Algebra Unit-
III
8. SQL-The Relational Database Standard.

9. ER- and EER - to - Relational Mapping and other Relational Languages.
10. Examples of Relational Database Management Systems: Oracle and Microsoft
Access.
11. Concepts for Object-oriented databases.
12. Object Database Standards, Languages and Design
13. Object relational and extended relational database systems

14. Functional dependencies and Normalization for relational databases.
15. Relational database design algorithms and further dependencies.
Unit-IV
16. Database System Architecture and the system catlog

17. Transaction Processing Concepts.
18. Concurrency Control Technqiues
Prescribed Book:
Elmasri. RandNavathe. S: Fundamentals of Database Systems. Addison-Wesley, 3rd

edition.
(Chapters one through fifteen and seventeen, Nineteen & Twenty)
Reference Books
1. Korth, Silberschatz & Sudarshan, Database system Concepts, McGraw Hill

2. C.J.Date, An Introduction to Database Systems, Seventh Edition, Pearson Education

MCA 203 : DATA STRUCTURES
1. Introduction and Overview

2. Preliminaries
3. String Processing
4. Arrays, Records and Pointers
5. Linked Lists
6. Stacks, Queues, Recursions
7. Trees
8. Sorting and Searching
TEXT BOOK
Lipschutz S; Theory & Problems of Data Structures, Schaums Outline Series, McGrawHill,
Chapters one Through Seven and Nine (Chapter Eight not included)
Reference Books:
1. Aho, Hopcroft & Ullman; Data Structures & Algorithms

2. WeissM.A; Data Structures & Algorithms Analysis in C Addison Wisley(2001)
16
MCA 204 : OPERATING SYSTEMS
1. Introduction
2. Computer-System Structures
3. Operating-Systems Structures
Unit-II
4. Process Management & Processes

5. CPU scheduling
6. Process Synchronization
7. Deadlocks
Unit-III
8. Storage Management
9. Memory Management
10. Virtual Memory
Unit- I V
11. File-System Interface

12. File-System Implementation
13. I/O Systems, Secondary Storage Structure
Prescribed Book:
Silberschatz & Galvin - Operating Systems Concepts (5th edition) - Addision Wesley - 1999
(Chapters 1 through 12)
Reference Books:
1. Andrew S.Tanenbaum - Modern Operating Systems
2. Crawley - Operating System & Design Oriented Approach
3. Dhamdhare - Systems Programming & Operating Systems, Second revised editon
TMH(2000)

MCA 205; PROBABILITY & STATISTICS
Unit-I
Introduction
Discreate Random Variable
Unit-II
Continuous Random Variables

Expectation
Conditional Distribution and Conditional Expectation.
Unit-III
Stochastic process
Networks of Queues
Unit- I V
Statistical Inference
Regression, Correlation and Analysis of Variance
Prescribed Book:
Kishore. S. Trivedi; Probability & Statistics with reliability queueing and Computer Science
Applications (PHI) Chapters 1 through 6 & 9,10 & 11
Reference Book:
1. RE. Walpole, R.H.Myers & S.L.Myers; Proabability & Statistics for Engineers &
Scientists, sixth edition Printice Hall.
18
MCA 301 ; OOPS WITH C++
Unit-I
1. Introduction to Computers and C++ Programming

2. Control Structures
3. Functions
4. Arrays
Unit-n
5. Pointers and Strings

6. Classes and Data Abstraction
7. Classes Part II
Unit-III
8. Operator overloading
9. Inheritence
10. Virtual Functions and Polymorphism
Unit-IV
11. C++ Stream input/output

12. Templetes
13. Exception Handling
14. File Processing
Prescribed Text Book:
Deitel & Deitel, C++ How to program, third edition (Pearson) Chapters 1 through 14)
Reference Book:
1. Tony gaddis, Starting out with C++, third edition (Dreamtech Press)
2. E.Balaguruswamy, Object Oriented Programming with C++ Second Edition, TMH

MCA 301 ; OOPS WITH C++
Unit-I
1. Introduction to Computers and C++ Programming

2. Control Structures
3. Functions
4. Arrays
Unit-II
5. Pointers and Strings

6. Classes and Data Abstraction
7. Classes Part II
Unit-Hi
8. Operator overloading
9. Inheritence
10. Virtual Functions and Polymorphism
Unit-IV
11. C++ Stream input/output

12. Templetes
13. Exception Handling
14. File Processing
Deitel & Deitel, C++ How to program, third edition (Pearson) Chapters 1 through 14)
Reference Book:
1. Tony gaddis, Starting out with C++, third edition (Dreamtech Press)
2. E.Balaguruswamy, Object Oriented Programming with C++ Second Edition, TMH
19
MCA 302 ; COMPUTER NETWORKS
Introductory Fundamentals:
Uses of Computer Networks: Network Hardware; Network Software; Reference Models;

Example Networks, Example of Data Communications Services. The Physical Layer & Data
Link Layer Preliminaries:
a) The Maximum Data rate of a Channel; Switching; Virtual Circuits Versus
Circuit Switching. :Packet Switching; Message Switching: Circuit Switching;
Virtual Circuits Versus Circuit Switching.
b) The Data Link Layer Design Issues
c) Sliding window protocols
Unit-II
Medium Access Sublayer:
a) IEEE STANDARD 802 for LANs and MNAs

b) Bridges
c) Highspeed LANs
Unit-III
The Network Layer & The Transport Layer
a) Network Layer Design Issues
b) Routing Algorithms
c) Internet Working
d) Network Layer in the Internet: The IP. Protocol; I.P. Addresses; Subnets; Internet
Control Protocols
e) The Transport Service
f) The Internet Transport Protocol (TCP & UDP)
Unit- I V
The Application Layer
a) DNS - Domain Name System

b) SNMP - Simple Network Management Protocol
c) Electronic Mail
d) World Wide Web
e) Multimedia: Audio; Video
20
r
Prescribed Book:
Tanenbaum A.S; Computer Networks (3rd editon EEE, PHI, 1998)
Chapters: 1.1 to 1.6 ; Chapter2 : 2.1.3, 2.4.5, 2.6.1: chapter3: 3.1, 3.4; chapter 4:4.3,4.4, 4.5;
Chapter5: 5.1, 5.2, 5.4, 5.5.1. 5.52, 5.5.3, 5.5.4 chapter 6: 6.1, 6.4; chapter 7: 7.2, 7.3, 7.4,
7.6,7.7.1,7.72.
Reference Book:
Eehrouz A.Forouzan: Data Communications and Networking TMH 2000.

21
MCA 303; COMPUTER BASED OPTIMIZATION TECHNIQUES
Unit-I
Introduction to Linear Programming: The linear Programming Model, Assumptions of linear

Programming, Additional Examples.
Solving LPPs: The simplex Method, The Essents of the simplex Method, Setting up the simplex
Method, The Algebra of the Simplex Method, The simplex Method in Tabular Form, The
Braking in the simplex method, Adopting to other Model forms, The interior-point approach to
solving LPPs.
Other Algorithms for Linear programming: The Dual simplex method, parametric Linear
programming, The upper Bound Technique, An interior-point algorithm, The transportation and
assignment problems: The Transportation problem, A streamlined simplex method for the
Transportation problem, The assignment problem.
Unit-II
Network Optimization Models: The shortest path problem, The minimum spanning Tree
problem, The Maximum flow problem, The minimum cost flow problem.
Project Management with PERT/CPM: Scheduling a project with PERT/CPM: Dealing with
uncertain activity durations, Considering Time Cost Trade-Offs.
Dynamic Programming: Characteristics of Dynamic Programming Problems, Determinstic
Dynamic Programming, Probolistic Dynamic programming.
Unit-III
Game Thoery: The formulation of two-person, zero-sum games, solving simple games, games
with mixed strattegies, graphical solution procedure, solving by I.P. Queueing Theory: Basic
structure of queueing models, the role of the exponential distribution, the birth and death process,
queueing models based on the birth-and-death process.
Unit- I V
Inventry Theory, components of Inventry Models, Deterministic continous - Review Models, A

deterministic periodic -Review Model, A stochastic continuous review model.
Forecasting: Time series, Forecasting Methods for a Constant Level Model.
Simulation: Generation of Random numbers, generation of Random observation from a

probability distribution, variance reducing techniques.
22
Text Book:
Hillier and Lieberman, Introduction to Operations Research (7th edition), Tata McGraw-Hill
Publishing Company Ltd. (Chapter 3:3.2, 3.3, 3.4, Ch 4:4.1 to 4.6 & 4.9, Ch 7:7.1 to 7.4 Ch
8: 8.1 to 8.3.
Chapter 9: 9.3 to 9.6, ch 10: 10.3 to 10.5, Ch 11: 11.2 to 11.4
Chapter 14: 14.1 to 14.5,Ch 17: 17.2, 17.4 to 17.6
Chapater 19: 19.2 to 19.5
Chapter 20: 20: 20.3, 20.4, Ch 22: 22.3, 22.4, 22.7
Reference Book:
1) Ravindran, Philips and Solberg, Operation Research Principles and Practice (2nd
edition) John Wiley & Sons.
2) Panneerselvam, Operations Research, PHI
23
MCA 304 ; COMPUTER GRAPHICS
Unit-I
Introduction, video display devices, raster scan system, random-scan system, graphics
monitors & work stations, input devices, hardcopy devices, three dimensional viewing
devices; graphical user interfaces and interactive input methods.
Unit-II
Line-drawing algorithms - DDA, Bresenham's line, circle and ellipse generating algorithms.
Character generation; Two - dimensional geometric transformations; computer animation.
Unit-III
Attributes of output primitives - line, curve, area - fill, character and bundled attributes,
Antialiasing; Two-dimensional viewing.
Unit-IV
Three-dimensional concepts; three-dimensional object representations - polygon surfaces, curved

lines and surfaces, quadric surfaces; Three-dimensional geometric and modeling transformations,
Three-dimensional viewing - viewing coordinates, projections, transformations, clipping.
Prescribed Book:
Computer Graphics - "Donald Hearn and M.Paulin Baker", PHI - Second Edition , 1998.
Reference Book:
Computer graphics Principles & Practices - "Foley, VanDam, Feiner, Hughes", Addision
Wesley.
24
MCA 305 ; ARTIFICIAL INTELLIGENCE
Unit-I
What is Artificial Intelligence

Problems, Problem spaces & Search
Heuristic Search Techniques
Unit-II
• Knowledge Representation
• Using Predicate logic
• Representing Knowledge using rules
Unit-ni
• Symbolic Reasoning
• Weak slot - and - filler structures
• Planning
Unit-IV
• Natural Language Processing

• Common Sense
• Expert Systems
Prescribed Book:
Rich E & knight k; Artificial Intelligence. TMH(1991)

Chapters: One through Seven, Nine, Thirteen, Fifteen, Nineteen and Twenty
Reference Books:
Winston P.H; Artificial Intelligence, Addision Wesley 91993)

25
MCA 401 ; PRINCIPLES OF PROGRAMMING LANGUAGES
Unit-I
Language Design Issues

Elementary Data Types
Unit-II
Encapsulation
Inheritence
Unit-III
Sequence Control
Subprogram control
Unit- I V
Storage Management
Distributed Processing
Prescribed Book:
Terrence W.Pratt & Mervin V.Zolkowitz, Programming Languages Design and

Implementation, PHI publication (3rd editon). Chapters 1 Through )
Reference Book:
Doris Appleby & Julius J.Vandetopple. Programming Languages Prodigm and Practice
Russell & Norvig: Artificial Intelligence - A Modem Approach, Pearson Education (2001)
26
MCA 402 ; CRYPTOGRAPHY AND NETWORK SECURITY
Unit-I
Introduction; Conventional encryption - Classical technologies, modern techniques;

confidentiality using conventional encryption.
Unit-II
Public - key cryptography; introduction to number theory; Message authentication and hash
functions; Digital signatures and authentication protocols.
Unit-III
Authentication applications, electronic mail security, IP security, web security
Unit-IV
Intruders, viruses and worms, fire walls.
Text Book:
Stallings W - Cryptography & network security principles and practice (second ed) PHI

MCA 403 PRINCIPLES OF MANAGEMENT AND ENTERPRISES RESOURCE
PLANNING (ERP)
Unit-I
Introduction
1.1 Nature and Significance of Management
1.2 Principles of Management and Evolution Management
1.3 Functions of Management and Coordination
Unit-II
Human Resources Management
2.1 Nature and Functions of HRM The changing
2.2 environment of HRM in Global Scinario Recruitment,
2.3 Placement, Training and Development Appreasing
2.4 Performance
Unit-III
Marketing Management
3.1 Nature and Functions of Marketing
Marketing Management - Product Planning & development - Pricing - Branding
3.2 - and Packging - Salesmanship - sales Forecasting - sales Promotion.
Advertising - consumer Behaviour - Marketing Research & Information
3.3 Channels of Distribution, Physical Distribution.
Marketing Control
3.4
Unit-IV Resource Planning

Enterprise
4.1 Introduction to ERP & Benefits of ERP
4.2 ERP and Related Technolgies
4.3 ERP - A Manufacturing perspective
4.4 ERP Modules and Market
4.5 ERP Implementation Lifecycle
4.6 Vendors, Consultants and Users
4.7 ERP case studies
Text Book: Chandra Bose D.: Principles of Management and Administration, PHI.
2002(Chapters 1 to 22 and 27 to 35, 38, 39, 40, 41, 42 & 45)
Alexis Leon; (Chapters 1 to 9 & 11)
Reference Book:
Gary Dessler: Human Resource Management, 8th edition. Pearson Education, 2002
Philip Kotler; Principles of Marketing, PHI 2001
28
MCA 404 ; SOFTWARE ENGINEERING
Unit-1
The Product
The process
Unit-II
Project Management Concepts Software

Process and Project Metrices Software
Project planning Software Quality
Assurance
Unit-III
Design Concepts and Principles Software

Testing Techniques Object Oriented
Concepts & Principles Object Oriented
Analysis
Unit-IV
Technical Metrices for Object - Oriented Systems

Formal Methods
Cleanroom Software Engineering
Web Engineering
Text Book:
Pressman R.S; Software Engineering, 5th edition (2001)

Chapters 1,2,3,4,5,8, 13,17, 20,21,24,25,26 & 29)
Reference Books:
1. Soomerville; Software Engineering, 6th edition, Pearson Education

2. Peters J.F & Pedryez W; Software Engineering, Wiley (2000)
29
MCA 405.1 ; E - COMMERCE
Unit-1
1. E-Commerce Environment and Opportunity

2. Modes of Electronic Commerce
3. Approaches to safe Electronic Commerce
4. Electronic Cash and Electronic Payment Schemes
Unit-II
5. E- Commerce Changes
5.1 Go online or Go out of Business

5.2 E-Commerce in Action : Reality and Myth
5.3 The E-Commerce in Obstacle Course
5.4 Measuring Success
Unit-Ill
6. E-Commerce Business solutions
6.1 E-Commerce Building Blocks

6.2 E-Commerce Site Essentials
6.3 E- Commerec Best practices
6.4 Brand Management Strategies
Unit-IV
7. Total E-Commerce solutions
7.1 MS E-Commerce Strategies

7.2 MS E-Commerce Platform
7.3 Web Portals
7.4 Partnering
Prescribed Book:
1. Minoli D & Minoli E; Web Commerce Technology Hand Book, TMH(2001)

(Chapters One through Four are Prescribed in Unit-I)
2. Trepper C ; E-Commerce Strategies,Phi(2001) (All Chapters are Prescribed in Unit II,

Unit-III,unit-IV.
Reference Book: Matthew Reynolds; E-Commerce,SFD, Mumbai(2000).

MCA 405.2; OBJECT- ORIENTED DATABASES (OODB)
Unit-I
Object-Orienetd Paradigm Object-

Oriented Methodologies Relational
Databases and OODBMS The Goals of
OODBMS
Unit-II
The OODB Features

Persistance Object
Identity
Unit-m
OODB Architectures
Object -Store
Objectivity/DB
Versant
Unit-IV
Evaluatin of OODBMSs
Evaluation of OODBMSs: The Important Criteria
Prescribed Book:
Bindu R. Rao,Object-Oriented Databases,Technology,Applications

And Products. , McGraw-Hill International Editions.
Chapters (1 to 13)
Reference Books:
1. Setrag khosnafiam- Object oriented Data Bases John Wiley & sons inc.
2. KIM - Object Oriented Databases MIT Press.

MCA 405.3 ; SIMULATION AND MODELLING
Unit-I Introduction to Simulation.
Simulation Software:
Simulation in C++,
Simulation in GPSS,
Simulation in CSIM
Random Numbers
Unit-II
Random Variate Generation

Input Modelling
Unit-III
Verification and Validation of Simulation Models

Output Analysis for a Single Model
Unit-IV
Comparison and evaluation of Alternative System Designs

Simulation of Computer Systems
TEXT BOOK:
Jerry Banks, John S.Carson and Barry L.Nelson & David . M Nicol;
DISCRETE EVENT SYSTEM SIMULATION, Third Edition Pearson Educations

(Chapters 1, 4: 4.4, 4.6, 7 through 12 and chapter 14)
REFERENCE BOOK:
Law : Simulation Modelling & Analysis,Third Edition,TMH.

MCA 501 ; DATA MINING TECHNIQUES
Unit-I
Introduction Data
Warehousing Data
Mining
Unit-II
Association Rules
Clustering Techniques
Unit-Hi
Decision Trees
Other Techniques
Unit-IV
Web Mining
Temporal and Spatial Data Mining
Text Book:
A.K.Pujari, Data Mining Techiques, University Press
Refence Book: Ralph Kimball, Laura Reeves, Margy Ross & Warren Thornthwaite; Data
Warehouse Life Cycle Toolkit, Wiley Computer Publications.
33
MCA 502; SYSTEMS AUDITING
Unit-I
INTRODUCTION:
1. Overview of Information Systems Auditing
2. Conducting an Information Systems Audit
THE MANAGEMENT CONTROL FRAMEWORK

3. Top Management Controls
4. Systems Development Management controls
5. Programming Management Controls
6. Data Resources Management Controls
7. Security Management Controls
8. Operations Management Controls
9. Quality Assurance Management Control
Unit-II
THE APPLICATION CONTROL FREAMEWORK

10. Boundary Controls
11. Input Controls
12. Cooperation controls
13. Processing Controls
14. Database Controls
15. Output Controls
Unit-III
EVIDENCE COLLECTION
16. Audit Software
17. Code Review, Test Data and Code Comparison
18. Concurrent Auditing Techniques
19. Interview, questioners and Control Flowcharts
20. Performance Measuring Tools
Unit- IV
EVIDENCE EVALUTION
21. Evaluating Asset Safe guarding and Data Integrity
22. Evaluating Systems Effectiveness
23. Evaluating Systems Efficiency
Text Book:
Weber R; Information Systems Control and Audit Person Education

(Chapters ONE through TWENTY THREE)
34
MCA 503; DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS
Unit-I
1. Models of computation
2. Design of Efficient Algorithms
Unit-n
3. Sorting and Order statistics

4. Data Structures for Set Multiplication Problems
Unit-HI
5. Algorithms on Graphs
6. Matrix Multiplications and related Operations
Unit-IV
7. The fast Fourier Transform and its Applications

8. Integer and Polynomial Arithmetic
Aho, Hopcraft, Ullman. The Design and Analysis of Computer Algorithms (Pearson)
(Chapters 1 through )
Reference Book:
Michael T. Goodrich, Roberta Tamassia, Algorithm Design , (wiley)

35
MCA 504.1 : EMBEDED SYSTEMS
Unit-I
Introduction
Custor Single-Purpose Processors: Hardwsare
Unit-II
General - Purpose Processor Software Standard
Single Purpose Processors: Peripherals
Unit-III
Memor
Interfacing
Unit-IV
Digital Camar Example

State Machine and Control Process Models
Prescribed Book:
Vahid & Givargis T; Embeded System Design, John Wiley (2002)

36
MCA 504.2 ; TCP/IP
Unit-I
Introduction to TCP/IP
The OSI Model and the TCP/IP protocol suite
Underlying technologies
IP Addressing
Subnetting and Supernetting
Delivery and Routing of IP packets
Internet Protocol (IP)
Unit-II
ARP and RARP

Internet control Message Protocol (ICMP) Internet
Group Management Protocol (IGMP) User
Datagram Protocol (UDP) Transmission Control
Protocol (TCP)
Unit-III
Routing Protocols (RIP, OSPF and BOP)

Application Layer and client-server Model
BOOTP and DHCP Domain Name System
(DNS) Telenet and Rlogin
Unit-IV
File Transfer Protocol (FTP) Trivial File Transfer

Protocol (TFTP) Simple Mail Transfer Protocol
(SMTP) Simple Network Management Protocol
(SNMP) Hyper Text Transfer Protocol(HTTP)
Prescribed Book:
Forouzan B.A., TCP/IP Protocol Suite; TMH (2000) Chapters 1 to 22
Reference Books:
1. Comer D.E., Internetworking with TCP/IP Principles, Protocols and Architectures: Vol -
I 4th ed. Pearson Education Asia (2001)
2. Crowcraft J; TCP/IP and Linux Protocol Implementation Wiley (2001)
37
MCA 505.1; IMAGE PROCESSING
Unit-I
Introducting Image shape, Human vision system, image acquisition - intensity images, real-time
capture, colour images, video camera, capture, analogue-to digital conversion scanners,
character recognition devices, satellite imagery, Ranging devices, Calibration : Image
Presentation - raster screen, printers ( matrix laser, ink-jet, wax thermal), patterns, dithering,
three-dimensional imaging.
Unit-II
Statistical Operations - Introduction, grey/level transformations, histogram equalization, multi-

image operations; spatial operations and transformations - Introduction, spatial dependent
transformations, templates and nnvolution, edge detection, other window operations. Two-
dimensional geometric transformations; segmentations and edge detection -introduction, region
operations, basic edge detection, second-order edge detection, pyramid edge detection, crack
edge relaxation.
Unit-III
Morphological and other area operations - introduction, basic morphological operations,

opening and closing operations; finding basic shapes - combining edges, Hough transforms,
Bresenhams algorithms; labeling lines and regions - flat-surface and straight line labeling, dealing
with curves, labeling regions.
Unit- I V
Frequency domain - introduction. Hartley transform, Fourier transform, optical transformations,

power and autocorrelation functions; image compression - introduction, types and requirements,
statistical compression, spatial compression, contour coding, quantizing compression, fractal
compression, real-time image transmission, quadtrees; Texture-introduction, identifying textures,
texture gradient, texture segmentation.
Text Book
Introductory Computer Vision and Image Processing - "Adrian Low", McGraw-Hill
International editions.
Reference Book:
Digital image processing - Gojelez - Addison Wesley.

MCA 505.2 MICROPROCESSOR AND INTERFACING
Unit-I
History & characteristics of microprocessors, Architecture of 8085, organization of 8086,

segmented memory organization, Pin configuration of 8086 and 8088. Operation of 8086 in
minimum and maximum mode.
Unit-II
Addressing modes, types of instructions, programming, assembler directives, parameter

passing, recursive procedures, read and write cycles of instructions.
Unit-Hi
Programmed I/O, interrupted I/O, DMA, parallel I/O (8255), serial 1/0(8251/8250), RS232
standards, 8259, 8237, 8254, USART pin configurations and organization.
Unit-IV
IBM-PC architecture, BIOs calls, H/W debugging, FDD controller, HDD controller, graphics
adapter.
Prescribed Book:
1. 8085 microprocessor - Goankar, Third editons, Penarm International

(chapter 1, 3, 4, 5 through 10, 14,1 5, 16)
2. 8086 Microprocessor - Gibbson
Reference Book:
1. Interfacing microprocessor - Barry B.Brey, PHI

MCA 505.3; ADVANCED COMPUTER ARCHITECTURE
Unit-1
Introduction to parallel processing - Multiprogramming time sharing, multiprocessing multi computers,

classification of computers, performance measures, parallelism uniprocessing systems.
Unit-II
Pipeline concept, linear pipeline, space time diagram, classification of pipeline processors, construction
pipeline processors, construction pipeline, arithmetic pipeline. Instruction prefetch, branch handling, data
buffering internal forwarding and register tagging, hazard detection and resolution, collision prevention,
characteristic of vector processing, pipelined vector processing.
Unit-III
Array processors - SIMD processors, parallel algorithms for array processing, and masking and routing
mechanisms, SIMD inter connection networks - omega, butterfly mesh and illiae.
Unit-IV
Multiprocesor architecture - loosely coupled and tightly coupled multiprocessor systems. Inter connection
networks - cross bar switch, banyan and delta networks, parallel memory organization, multiprocessor
scheduling strategies, and parallel algorithms.
Prescribed book:
Advanced Computer Architecture - Kai Hwang, McGraw-Hill INC

(Chpaterl.3,6,7,8)
Reference Books:
1. Advanced Computer Architecture - Kai Hwang & Faye A.Briggs,
McGraw Hill rnc 2. Computer Organization - Keys,
McGraw Hill Inc

NAGARJUNA UNIVERSITY
RULES AND REGULATIONS OF SEMESTER SYSTEM IN POST-GRADUATE

DEGREE/ DIPLOMA COURSES EFFECTIVE FROM THE ACADEMIC YEAR 2002-03
ONWARDS
1 ADMISSION
Candidates shall be admitted into P.G. Degree/Diploma Courses strictly in accordance with
the
rank secured at the entrance test, if any, or rank determined on the basis of the Marks
secured at the qualifying examination or on the basis of any other criteria determined by the
University from time to time, following the rules of reservation of seats for various categories
of students.
2 DURATION AND COURSE OF STUDY
The duration of the P.G. Degree/Diploma course is of one/two/three academic years.

Each academic year is divided into two semesters. The two semesters in the first academic
year are referred to as Semester I and Semester II and the two semesters in the second
academic year are referred to as Semester III and Semester IV. For three year courses, the
third academic year will have Semester V and VI. Each semester shall comprise of 16 weeks
of instruction.
3 TIME FOR THE COMPLETION OF THE COURSE :
The candidates have to complete two years of P.G. Course within 5 years and 3 years of
P.G. Course within 6 years and one year P.G. Diplomas within 3 years from the year of
joining the course.
4 AWARD OF DEGREE
The Post Graduate Degree/Diploma in the concerned Faculty will be conferred on a

candidate who has pursued a Regular Course of Study for one/two/three academic years as
prescribed in the scheme of instruction and has passed all the examinations as prescribed in
the scheme of examinations.
I 5 ATTENDANCE :
5.1. Candidates shall put in attendance of not less than 75% in aggregate in the
prescribed subjects in each semester including field work, practicals, project work,
seminars, extension work etc. Condonation of shortage of attendance
extension work etc. Condonation of Shortage of Attendance may be granted by the
Principal of the concerned college to the candidates who have put in 60% and
above (but less than 75%) attendance on Medical Grounds on production of Medical
Certificate from a Registered Medical Practitioner and also on payment of prescribed
condonation fees.
5.2. Participation in N.C.C./N.S.S. Special/N.I. Campus or Inter- Collegiate or Inter-University or

Inter-State or National or International Matches or Debates, Youth Festivals or Educational
tours, if they from part of the curriculum, or such other Inter-University, Inter-College
activities, as approved by the University will not be counted as absence. However, the total
period of such absence shall not exceed four weeks in a semester.
5.3. Candidates who have put in less than 60% of attendance are not eligible for grant of
condonation on shortage of attendance and also they are not eligible to appear in the University
Examination of that semester. Such candidates shall have to repeat the regular course of study of
the corresponding semester in subsequent academic year, in order to become eligible to
appear for the examination. The seats of candidates admitted for repetition of the semester be
treated as extra seats over and above the sanctioned strength.
5.4. Attendance shall be reckoned from the date of commencement of instruction as per the
academic calendar. However, in the case of candidates admitted later(but within the stipulated
time) the attendance will be reckoned from the date of admission.
5.5. To enable students to know their attendance at the end of each month, the concerned heads of
departments shall display cumulative attendance for information.
6 SCHEME OF INSTRUCTION AND EXAMINATION:
6.1. Instruction in various subjects shall be provided by the College as per the Scheme of
Instruction and syllabi prescribed.
6.2. At the end of each semester, University Examinations shall be held as prescribed in the
Scheme of Examination.
6.3. Each theory paper carries 100 marks of which 80 marks are earmarked for Semester-end
Examination and 20 marks are earmarked for internal assessment to be awarded by the teacher
concerned on the basis of two internal tests for 10 marks, five marks for participation in
seminars and group discussion and five marks for attendance. Two internal tests are conducted
and the performance of the best of two will be taken. However, if a student fails to take the
tests/seminar/group discussion, no supplementary internal tests/seminar/group discussion will be
conducted. No minimum qualifying marks is prescribed in case of internal assessment.
6.4. If any student fails to get marks in internal assessment or abstains for the internal assessment
tests, he/she has to get required marks in the semester - end examination for a pass.
6.5. There will be double valuation of theory papers of semester - end examination. In case of
difference of above 20% of marks between the two valuations, it will be sent for a third
valuation. In such cases the nearest two beneficial to the student will be taken for the purpose of
declaring the results. There is no provision for revaluation/personal verification of answer scripts.
6.6. Candidates who have put in the necessary attendance in a semester shall be permitted to
continue the subsequent semester, irrespective of whether they have appeared or not at the
semester, irrespective of whether they have appeared or not at the semester-end examination,
provided they have registered in all papers for the semester-end examinations. Registration
means obtaining a Hall Ticket for the said examination.
6.7. Practical examinations in the even numbered semesters (II, IV) and VI) of Post-Graduate
courses may be conducted by external examiner appointed by the University from the panel of
experts. The practical examinations in the remaining semesters (I,IH and V) may be conducted by
the internal examiners drawn from the same Department/College.
6.8. Under Semester System there will be no supplementary examinations. 7
PASSING STANDARDS:
7.1. SCIENCE FACULTIES:

A candidate should secure a minimum of 50% of marks in each semester-end theory paper of
University Examination/practicals (i.e. 40 marks out of 80 marks) and an aggregate of 50% of
marks of all the papers of the semester for a pass. Further, a candidate should secure a
minimum of 50% marks in seminar/project work/field work/dissertation/any such other
assignment for a pass. If a candidate fails to secure an aggregate of 50% of marks for a pass in a
paper of a semester he/she has to secure 50% marks in such individual paper/papers
(Semester-end examination + internal marks put together) in the subsequent examination.
7.2. M.C.A. COURSE :

A candidate should secure a minimum of 50% of marks in each semester-end theory paper of
University examination/ practicals (i.e. 40 marks out of 80 marks) and a minimum of 50% of
total marks of each theory paper/practicals (i.e. 50 marks out of 100 marks) and an aggregate
of 50% marks of all the papers of the semester for a pass. Further a candidate should secure
a minimum of 50% marks in seminar/project work for a pass. If a candidate fails to secure an
aggregate of 50% of marks for a pass in a paper of a semester he/she has to secure 50%
marks in such individual paper/papers (Semester-end examination + Internal marks put
together) in the subsequent examination.
8 AWARD OF DIVISION :
Candidates who have passed all the examinations of the P.G Degree/Diploma Courses shall be
awarded Classes/Divisions in accordance with the total aggregate marks secured by them in all
semester Examination taken together.
1. First Class with Distinction - 70% and above.
2. First Class - 60% and above but less than 70%
3. Second Class - 50% and above but less than 50%
4. Third Class - 40% and above but less than 50%
First Class/Second Class is awarded to a candidate as per the above classification, provided
he/she completes the course within three years from the year of joining the two year P.G.
course and four years from the date of joining the Three year P.G. course. There is no third
class in courses of Master of Laws, Master of Education, Science faculties and M.C.A.
However, candidates who have passed the examinations in the first attempt along with the
batch in which they are admitted will be eligible for the award of first class with distinction.
8.1. In case of one year P.G. Diploma courses First Class/Second class is awarded to a candidate
who completes the course within two years from the year of joining the P.G. Diploma Course.
9 AWARD OF RANKS :
Only those candidates who appear and pass the examination in all the papers of each semester at
first appearance are eligible for the award of Ranks provided they have secured a minimum of
second class.
10 AWARD OF GOLD MEDALS/PRIZES

Only those candidates who appear and pass the examination in all the papers of each semester at
first appearance are eligible for the award of Gold Medals and Prizes. The award of Gold
Medals/Prizes is also subject to the other conditions prescribed for the respective Gold
Medals/Prizes.
11. BETTERMENT EXAMINATION:
The candidates are eligible to improve their aggregate % of marks in each semesters put
together, provided they have passed the whole examination but secured less than 60% on the
aggregate. Candidates who seek improvement in the aggregate % of marks (in a semester or in all
the semesters put together) to 60% and above are eligible to betterment examinations even in
individual papers in which they have already secured 60% or above. But, no candidate who has
already secured 60% or more marks in the aggregate either in the normal course or through
betterment examination shall be eligible to appear for betterment examinations. Regular study
candidates can appear for betterment examination for each semester along with subsequent
semester examinations only after passing in all papers of preceding semester end examination.
They can also appear betterment examinations of any semester after passing the course, subject to
other conditions prescribed. However, there is no provision for betterment of the marks secured
at internal tests.
Three chances are given for betterment examinations. For purpose of classification, only such
examination, betterment or otherwise, which is completed within the period of three years
from the date of joining Two Year P.G. Course and Four Years from the date of joining Three
Year P.G. Course shall be taken into account. After the above prescribed period, marks
secured at the betterment examination shall not be taken into account for awarding a class.
However, these marks will be added for improvement of the percentage of marks of the
candidate.
The candidates have to pay prescribed betterment fees for every appearance. In case of P.G.
Diploma Courses there is no provision for the betterment of class/marks.
REGISTRAR
NAGARJUNA UNIVERSITY
NAGARJUNANAGAR,
DATED: 12-08-2002.

Mca Semester System Form & Courses First Semester of Mca

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Mca Semester System Form & Courses First Semester of Mca

Загружено:

Авторское право:

Доступные форматы

MCA SEMESTER SYSTEM FORM & COURSES

FIRST SEMESTER OF MCA

D/P Sessional University

MCA 101 IT Fundamentals 4 - 20 80 100

MCA 102 Programming in C & Numerical 4 - 20 80 100

MCA 103 Computer Organisaion 4 - 20 80 100

MCA 104 Discrete Mathematical Structures 4 - 20 80 100

MCA 105 Accountancy & Financial 4 - 20 80 100

MCA 106 PC Software Lab - 6 20 80 100

MCA 107 'C' Lab - 6 20 80 100

MCA 108 SEMINAR 3 50 ~ 50

Total Marks 20 15 190 560 750

Department of Computer Science

SECOND SEMESTER OF MCA

MCA 202 Data Base Management Systes 4 - 20 80 100

MCA 203 Data Structures 4 - 20 80 100

MCA 204 Operating Systems 4 - 20 80 100

MCA 205 Probability & Statistics 4 - 20 80 100

MCA 206 Data Structures Lab - 6 20 80 100

MCA 207 DBMS Lab - 6 20 80 100

MCA 208 SEMINAR 3 50 ~ 50

Total Marks 20 15 190 560 750

Department of Computer Science

THIRD SEMESTER OF MCA

MCA 302 Computer Networks 4 - 20 80 100

MCA 303 Computer Based Optimisation 4 - 20 80 100

MCA 304 Computer Graphics 4 - 20 80 100

MCA 305 Artificial Intelligence 4 - 20 80 100

MCA 306 OOPS Lab - 6 20 80 100

MCA 307 UNIX & SHELL Lab - 6 20 80 100

MCA 308 SEMINAR 3 50 — 50

Total Marks 20 15 190 560 750

Department of Computer Science

FOURTH SEMESTER OF MCA

MCA 402 Cryptography And Networks 4 - 20 80 100

MCA 403 Principles of Management and 4 - 20 80 100

MCA 404 Software Engineering 4 - 20 80 100

MCA 407 Networks & Security Lab - 6 20 80 100

MCA 408 SEMINAR 3 50 — 50

Total Marks 20 15 190 560 750

Department of Computer Science

FIFTH SEMESTER OF MCA

MCA 502 Systems Auditing 4 - 20 80 100

MCA 503 Design & Analysis of 4 - 20 80 100

MCA 506 Visual Programming Lab - 6 20 80 100

MCA 507 System Auditing Lab with - 6 20 80 100

MCA 508 SEMINAR 3 50 -- 50

Total Marks 20 15 190 560 750

Department of Computer Science

1. Introduction: Business and Information Technology

6. Telecommunications and Networks

8. Interorganisational and Global Information Systems

Turban, Ramer & Potter; Introduction to Information Technology, John Wiley(2000)

Department of Computer Science

Introduction to Numerical computing, computer codes, and Arithmetic, Approximation and

Interpolation, Numerical Integration, Numerical solutions of ordinary differential equations.

Department of Computer Science

1. Brain W.Kernighan, Dennis M.Ritchie - The C Programming Language,

Tata Me Graw - Hill Publishing Company Ltd

1. J.A.Jones & K.Harrow; C Programming with problem solving, Dreamtech Press

Department of Computer Science

Micro Programmed Control. Control Memory, Address Sequencing, Micro programme

Computer Arithmetic. Addition and subtractions, Multiplication Algorithms, Division