Master Of Computer Applications

M.C.A. at V.T. U. is a six semester master level programme, which basically deals with the application part of computing.
The course gives an opportunity to the students of related technical fields to switch over to the vast field of Computer Science.
An integrated multi-disciplinary programme with innovative teaching methods to enhance analytical and problem solving skills.
Personality development module to tap full potential of the students by improving time and self-management, communication skills, team spirit, confidence even and career building attitude.
Selection of young and dynamic graduate students with good analytical skill is done.

SELECTION PROCEDURE

Master of Computer Application is the most sought after course for the present generation of students. Thus the students of M.C.A., I.P.G.S.R. go through a rigorous admission procedure. Basic criteria of selection are the Common Entrance Test for M.C.A. (CET Karnataka).

RELEVANCE SKILLS DEVELOPED

Knowledge and skills are two inseparable factors, which are well interwoven in the course curriculum. M.C.A. in I.P.G.S.R. stresses on three important skills - Organization Skills, Software Development and Software Designing. These are basic skills on which M.C.A. programme is built. The academic programmed not only stresses on the Academic curriculum but also on organizational skills, which are very important for a Software Engineer working in an organization.

M.C.A Course Structure

SCHEME FOR MCA Internal exams: marks: 50 passing marks: 25

External exams: marks: 100 passing marks: 40

SEMESTER - I
MCA-101	Accounting & Financial Management
MCA-102	Probability, Statistics& Queuing
MCA-103	Digital Electronics
MCA-104	Programming Concepts & C language
MCA-105	Data &File Structures
MCA-106	C-Programming IT lab.
SEMESTER - II
MCA-201	Discrete Mathematics
MCA-202	Computational Techniques
MCA-203	Information System Concepts
MCA-204	COBOL Programming & Applications
MCA-205	Computer Organization & Architecture
MCA-206	Data Structures & COBOL Application Lab.
SEMESTER - III
MCA-301	Computer Graphics
MCA-302	System Programming
MCA-303	Operating System
MCA-304	Optimization Techniques
MCA-305	Object Oriented Analysis and Design
MCA-306	Computational Techniques &Object Oriented Prog. Lab
SEMESTER - IV
MCA-401	Database Concepts and Applications,
MCA-402	Computer Networks
MCA-403	Software Engineering
MCA-404	Analysis and Design Of Algorithms

MCA 4051(Elective)	Artificial Intelligence
MCA-406	Networks Lab & Mini Project
SEMESTER - V
MCA-501	Multimedia Communication
MCA-502	System Simulation & Modeling
MCA 503	Communication & Management
MCA5042 (Elective)	Distributed Database & Computing
MCA5052 (Elective)	Advance Client Server Computing
MCA506	Database Application Lab & Seminar

SEMESTER-VI
	Dissertation Work(In Software Company)

SEMESTER SYLLABUS
MCA 101 Accounting & Financial Management

Instruction: 3 Periods Lectures /Week

Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Unit - I

Principles of Accounting: Nature and Scope of Accounting, Double Entry system of Accounting, Introduction to Basic Books of Accounts of Sole Proprietary Concern, Closing of Books of Accounts And Preparation of Trial Balance.

Final Accounts : Trading Profit and Loss Accounts and Balance Sheet of Sole Proprietary concern with Normal Closing Entries.

Unit - II

Ratio Analysis : Meaning Advantages, Limitations, Types of Ratio and Their Usefulness. (Theory only)

Fund Flow Statement : Meaning of the term Fund, Flow of Fund, Working Capital Cycle, Preparation and Inter preparation of Statement.

Costing : Nature, Importance and Basic Principles. Budget and Budgetary Control: Nature and Scope, Importance Method of Finalization and Master Budget, Functional Budgets.

Unit - III

Marginal Costing : Nature, Scope, Importance, Construction of Break Even Chart, Limitations and Uses of Break Even Chart, Practical Applications of Marginal Costing. (Problems)

Unit - IV

Introduction to Computerized Accounting System: Coding Logic and codes Required, Master Files, Transaction Files, Introduction to Documents Used For Data Collection, Processing of Different Files and Outputs Obtained.

REFERENCE

1.Introduction to Accountancy T.S.Grewal;

2. Management Accountancy - S.P.Jain

MCA 102

Probability, Statistics& Queuing

Instruction: 3 Periods Lectures /Week

Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Unit - 1

Introduction: Probability models, sample space events, algebra of events, graphical methods of representing events, probability axioms, combinational problems, conditional probability, independence of events, baye's rule, Bernoulli trials. Discrete random variables: introduction, random variables and their spaces, the probability mass function, distribution functions, special discrete distributions, analysis of program max, the probability generating function, Discrete Random Vectors, independent random variables continuous random variables: introductions, the exponential distribution, the reliability, failure density and hazard function, some important distribution, functions of a random variable, jointly distributed, random variables, order statistics, distribution of sums, functions of normal random variables.

Unit - II

Expectation: introduction, moments, expectation of functions of more than one random variable, transform methods, moments and transforms of some important distributions, computations of mean time to failure, inequalities and limits theorems.

Unit - III

Conditional Distribution and Conditional Expectation: Introduction, Mix- true distributions, conditional Expectation, Imperfect fault coverage and reliability, random sums

Unit - IV

Statistical Inference: Introduction, Parameter Estimation, Hypothesis testing; Regression, correlation and 'analysis of variance: Introduction, least squares curve fitting, the coefficient of Determination, confidence Intervals in linear Regression, correlation analysis, simple nonlinear regression, Higher dimensional least-squares fit, Analysis of variance;

REFERENCE

Introduction to Probability and statistics, Gupta s.c. And Kapoor v.k
Text books:-Probability and statistics,2/e,spiegel,TMM

Probability & statistics with reliability, Queuing and computer applications, Kishor s.Trivadi,Prentice Hall of India.1999

SEMESTER SYLLABUS
MCA 103
Digital Electronics

Instruction: 3 Periods Lectures/Week

Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

1. Digital Logic circuits (Review)
1.1 Digital Computers;
1.2 Logic Gates;
1.3 Boolean algebra;
1.4 Map Simplification;
1.5 Combinational Circuits;
1.6 Flip flops;
1.7 Sequential circuits

Unit - I

2. Digital Components
2.1 Integrated Circuit
2.2; Decoders;
2.3 Multiplexes;
2.4 Registers;
2.5 Shift Registers;
2.6 Binary Counters;
2.7 Memory Unit

3. Data Representation
3.1 Data types;
3.2 Complements;
3.3 Fixed-point representation;
3.4 Floating point representation;
3.5 Other Binary codes;
3.6 Error Detection codes

Unit - II

4. Basic Computer Organization and Design
4.1 Instruction Codes;
4.2 Computer Registers;
4.3 Computer Instructions;
4.4 Timing and Control;
4.5 Instruction Cycle;
4.6 Memory Reference Instructions;
4.7 Input output and Interrupt;
4.8 Complete Computer Description;
4.9 Design of Basic computer;
4.10 Design of Accumulator Logic

5. Micro programmed Control
5.1 Control memory;
5.2 Address Sequencing;
5.3 Micro program Example

Unit - III

6. Central Processing Unit
6.1 Introduction;
6.2 General Register Organization;
6.3 Stack organization;
6.4 Instruction Formats;
6.5 Addressing Modes;
6.6 Data Transfer & Manipulations;
6.7 Program Control; 6.8 Reduced Instruction set computer (RISC)

Unit - IV

7. Input -Output Organization
7.1 Peripheral Devices; 7.2 Input-Output interface; 7.3 Asynchronous Data transfer; 7.4 Mode of Transfer; 7.5 Priority of Interrupts; 7.6 Direct Memory Access (DMA) 8. Memory Organization
8.1 Memory Hierarchy;
8.2 Main Memory;
8.3 Auxiliary Memory;
8.4 Associate Memory;
8.5 Cache Memory

REFERENCE

1. Computer architecture and Organization (third edition) John P.Hayes – TMH

2. Digital Electronics - An Introduction to theory & practice W.H.Gothmann

3 . Computer System Architecture (Third Edition) Morris Mano - Prentice Hall
4. Digital Logic and Computer Design , Morris Mano

MCA 104

Programming Concepts & C language

Instruction: 3 Periods Lectures/Week

Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Unit - I
Introduction: The Problem Solving aspect top-down-step wise refinement - implementation of algorithms - program verification - efficiency of algorithms analysis of algorithms.

Basic algorithms: Exchange of value of two variables-Summation of set numbers-Factorial Computation-Sine function computation - Generation of Fibbonacci Sequence - Reversing of Digits of an integer - base conversion character to number conversion - Finding Square root - Factoring - GCD - Generating Prime numbers - Finding with number in the fibbonacci series.

Unit - II

C Programming Basics : Variables-Constants-Expressions-Operators and their precedence and associatively. Basic Input-Output Statements. Control Structures Simple programs in C using all the operators and Control structures.

Functions: Concept of function-parameters and how they are passed - automatic variables, Recursion, Scope and Extent of Variables, Writing Programs using recursive and non-Recursive functions.

Arrays and Strings : Single and Multi dimensional arrays - Character Array as strings - Functions of Strings, Writing C programs using arrays for strings manipulation

Unit - III

Pointers : Definition and use of pointers-address operator-pointer variable- pointer arithmetic-arrays of pointers-passing arrays to functions-pointers and functions-pointer constants-string library functions- pointers to functions

Structures and Unions : Declaring and using Structures-operations on Structures-arrays of structures - user defined data type-pointer to structure

Unions : Difference between Unions and structures-operations on a union - scope of a union-Bit fields in structures programming example with structure & unions

Unit - IV

Dynamic Memory Allocation : Library functions for Dynamic Memory allocation-dynamic multidimensional arrays Self Referencing Structures - Writing C program using Library calls for Dynamic Memory Allocations.

Files : Introduction-File Structure-File handling functions-File types – Un buffered and Buffered files-files Error Handling-Low level file I/O Redirection and Piping-DICS function I/O - Programming example for using files with high level and low level I/o And Example programs using BIOS system calls.

REFERENCE

1. C - The complete Reference Herbert Schildt TMH
2. The C Programming Language Kerningham and Ritchie

3. Understanding Pointers in C - Y.Kanetkar

MCA 105

Data &File Structures

Instruction: 3 Periods Lectures/Week

Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

1. Introduction: Definition of an algorithm - Problems to Programs Abstract Data Type - Data Structures - Run time of a program and its calculation - Basic Data Types - Lists and their Implementation - Singly linked lists - Doubly linked lists - Circularly linked lists - Stacks - Queues – D queues and Circular Queues - Mappings - Stacks and Recursive Procedures

2. Trees: Basic Terminology - The ADT Tree - Various Types of Implementation of Trees - Binary Trees - Their Properties - Representations - Implementation - Binary Tree Traversals - Threaded Binary Trees - Expressions Trees - Conversion from n-aryl tree to a Binary Tree

3. Sets: Introduction - ADT based on Sets - Union, Intersection and Difference - Implementation of Sets - The Dictionary - Implementation of Priority Queues and their Implementation - Binary Search Trees - Tries - 2-3 Trees - their implementation - Insertion and Deletion

4. Graphs : Basic Definitions of Directed and Undirected Graphs - Their representations and Implementations - Graph Traversals - Storing Components - Their Implementations - Insertion and Deletion

5. Sorting : The Internal Sorting Model - Bubble Sort - Quick Sort - Heap Sort - Bin Sorting - Merging Sort - Insertion Sort - Radix Sort - Selection sort

Reference :A V Aho, JE Hopcroft, JD Ullman, "Data Structures and Algorithms", Addition Wesley Publishing Company.

MCA 106

C-Programming IT lab

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

1. Programming using all the operator (including bites operators)
2. Program for searching a number in an array, linear and binary search should be done and performance measured and tested against theory;
3. Program for summing the elements of an array.
4. Program for determining Fibbonacci series and also for finding the nth elements of Fibbonacci series.
5. Write a program for finding the maximum and minimum of a given array
6. Program for determining GCD of two integers using recursive and non recursive functions.
7. Program for determining Lcm of two integer. Using recursive and non recursive function. 8. Program for determining the factorial of a integer. Also determine the maximum number for which factorial can be determined for into and long variables.
9. Functions for matrix addition, transpose and multiplication and testing them. 10.Writing C functions for string manipulation (like reversing determining if the given string is a palindrome, string copying string length etc;) 11.Rewrite functions for exercise 6 above using pointers. 12.Rewrite functions for exercise 7 above using pointers. 13.Printing the bit pattern of floating point number using an union. 14.Defining a structure like an employee record and then reading and processing the salaries of a set of employees. 15.Write a program for towered of Hanoi problem. 16.Exercise in using of dynamic memory allocation; 17.writing a program which initiates DDS copy routine. The program must be capable of copying text and binary files. 18.Writing a program which copies a text file to another file but in the reverse order. Please the file size could be extremely large and hence cannot be read entirely; 19.writing programs (using BICS calls) to read directories. That is to imitate BOD dir command; 20.writing a program (using BICS calls) to read mouse status. Parameters

References: Let us C, Exploring C – yes want kanetkar

MCA 201

Discrete Mathematics

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Unit - I

Fundamentals: Sets, Subsets, Operations on sets, semi groups, finite and infinite sets, Relations and properties of relations, Equivalence relation, Boolean algebra, po-sets, Lattices: partial ordered relation ,poset ,lub, glb, maximal & minimal elements of a poset Definition and examples of Boolean algebra. Lattices, Distributive laws on Lattices, Complemented Lattices Prepositional Calculus.

Boolean Functions: Min & Max terms, Simplification of Boolean function with Karnaugh map and Quine Mcclusky method.

Unit - II

Introduction to Combinatory : Basic theorem on permutations and combinations, pigeon hole principle, principle of inclusion and exclusion Ordinary & Exponential generating functions, Recurrence relations

Unit - III

Graphs & Algorithms : Basic Definitions of graphs Connectivity of a Graph, cut points, cycles, Hamilton Graphs trees, different characterization of trees, I-partite graphs, Algorithms on Graphs : Breadth-first Search, Depth-first search, dijkstra algorithm for shortest. path Floyd's algorithm for all pairs of shortest paths, kruskal's and prim's algorithms for minimum spanning tree.

Unit - IV

Finite state machines & Languages : Finite state machines, semi groups, machine languages and regular languages, Simplification of machines.

REFERENCE

1. Elements of Discrete Structures : CL Liu - TMH
2. Discrete Computational Structures : Korfhage RR - Academic Press
3. Discrete Mathematics : KA Ross & CRB Wright - PHI 1985
4. Applied Discrete Structures for Computer Science : Alan Doer & Kenth Levasseur
5. Discrete Mathematical Structures for Computer Science : Bernard Kolman & R.C. Busby - PHI 1988

MCA 202

Computational Techniques

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Introduction: Errors in numerical computation, Mathematical preliminaries, Errors and their analysis, Machine Computations, Computer Software.

Algebraic and Transcendental Equations: Bisection method, Iteration method, Method of False Position, rate of convergence, Method for complex root, Muller’s Method, Quotient Difference method, Newton-Rap son Method.

Interpolation: Introduction, Errors in Polynomial interpolation, Finite differences, Decision of errors, Newton’s formula for interpolation, Gauss, Sterling, Bessel’s, Everett’s Formula, Interpolation by unevenly spaced points, Lagrange interpolation formula, Divided Difference, Newton’s General interpolation Formula.

Curve Fitting, Cubic Spine & Approximation: Introduction, Method of Least Square curve fitting procedures, Fitting a straight line, Curve fitting by sum of exponential, Data fitting with cubic spines, Approximation of functions.

Numerical Integration and Differentiation: Introduction, Numerical differentiation, Numerical integration, Trapezoidal rule, Simpson 1/3 rule, Simpson 3/8 rule, Booles & Weddles rule, Euler-Maclariaun formula, Gaussian Formula, Numerical evaluation of singular integrals.

Statistical Computations: Frequency Chart, Regression Analysis, Least Square fit, Polynomial fit, Linear and Nonlinear Regression, Multiple Regression, Statistical Quality Control Methods.

References:

Balaguruswamy, “Numerical methods”, TMH
Shastri, “ Introductory methods of numerical analysis”, PHI
V. Rajaraman, “Introduction to Numerical Methods”, TMH

MCA 203

Information System Concepts

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

The meaning and role of MIS: What is MIS?. Decision support systems, systems approach, the systems view of business, MIS Organization within the company.

2. Management Organizational theories and the systems approach:

Development of organization theory, management and organizational behavior,

Management, information, and the systems approach.

Information Systems for decision making: Evolution of an information system, Basic Information Systems, decision making and MIS, MIS as a technique for making programmed decisions, decision assisting information systems.

Strategic and project planning for MIS: General business planning, appropriate MIS response, MIS planning – general, MIS planning – details.

Conceptual system design: Define the problems, set system objectives, establish system constraints, determine information needs, determine information sources, develop alternative conceptual designs and select one, document the system concept, prepare the conceptual design report.

Detail System design: Inform and involve the organization, aim of detailed design, project management of MIS detailed design, identify dominant and trade off criteria, define the subsystems, sketch the detailed operating sub systems and information flows, determine the degree of automation of each operation inform and involve the organization again, inputs, outputs and processing early system testing, software, hardware and tools propose an organization to operate the system, document the detailed design, revisit the manager – user.

Implementation, evaluation and maintenance of the MIS: Plan the implementation, acquire floor space and plan space layouts, organize for implementation, develop procedures for implementation, train the operating personnel, computer related acquisitions, develop forms for data collection and information, dissemination, develop the files, test the system, cut over, document the system, evaluate the MIS, control and maintain the system.

Pitfalls in MIS development: Fundamental weaknesses, soft spots in planning, design problems, implementation: The TAR PIT.

Reference:

Information Systems for Modern Management, third edition by R. G. Murdick, J. E. Ross and J. R. Clagget, PHI – 1994.

MCA 204

COBOL Programming & Applications

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

1. Introduction to data processing, data collection, preparation, editing and checking.

Overview of COBOL
Identification Division

Format and functions of the different paragraphs.

Program-ID, author, installation, Data-written, Data-compiled, security.

File Handling

Basic file concepts, Organization/access, Sequential indexed and relevant file handling in COBOL.

Environment Division:

Configuration section, Input-Output section.

Data Division:

Level structure (including special level Nos. 66, 77 and 88, picture clause, concept of qualification of names, file section, file entry, record structure, working storage section: VALUE clause, REDEFINES clause, RENAMES clause, USAGE clause, SIGN clause.

Procedure division:

Organization of a COBOL program: Section, paragraph, sentence, statement, syntax and function of the different COBOL verbs.

(a) Elementary verbs: add, subtract, multiply, divide, compute.

(b) Input-Output verbs: Accept, display, open, close, read, write, rewrite, delete, start.

(d) Conditional expressions: types of conditions – condition name, condition, relation condition, class condition, sign condition, Relational operators, Logical operators, if and nested if statements, complex conditions, evaluation roles, abbreviated, compound conditions, EVALUATE statements.

(e) Miscellaneous verbs: GOTO, STOP, RUN, EXIT, CONTINUE

(f) Perform verb: In-line and Out-Line PERFORM, Types of Out-line, PERFORM: PERFORM, PERFORM-UNTIL, PERFORM-VARYING, PERFORM-THRU, PERFORM-TIMES, Usage of TEST BEFORE and TEST AFTER clauses.

(g) Table handling: basic concepts, OCCURS, clause, single, multiple dimensional table, INDEX/SUBSCRIPT, SET verb: indexed by clause, usage in index clause, SEARCH concepts, SEARCH verb, serial/binary searching in COBOL, Handling sorted/unsorted tables.

(h) String handling in COBOL: STRING statement, EXAMINE statement, INSPECT statement, UNSTRING statement.

(i) Compiler directing verb: Copy.

(j) Sorting and Merging: Basic concepts, SORT verb, MERGE verb.

(k) Inter-program communication: Basic concepts, Linkage section, call verb, call be address and call by content, procedure division using.

Reference:

1. Phillipakis & Kazmier – “Structured COBOL”, MGH.

2. D. Ghosh Dasthidar & M. K. Roy – “COBOL Programming”, TMGH.

MCA 205

Computer Organization & Architecture

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Representation of information: Number system, Integer and floating-point representation, character codes (ASCII, EEBCDIC), and Error detection and correction codes.

Central Processing Unit: ALU, Arithmetic and logic operations, faster algorithm and their implementation

Control Units: Hardwired and Micro Programmed design concept, Microprogramming

Memory: Memory types and organization, address decoding and selecting

Peripheral Devices: I/O devices (disk and tapes), Programmed interrupt control mechanism, I/O Controllers, DMA

Bus architectures: Uni-bus and multi-bus architectures.

References:

Hamacher, “ Computer Organization,” McGraw hill.
Tennenbaum,” Structured Computer Organization,” PHI
B. Ram, “Computer Fundamentals architecture and organization,” New age international
Gear C. w., “Computer Organization and Programming, McGraw hill
Mano Moris, “ Computer system Architecture,” PHI

MCA206

Data Structure & COBOL Application Lab

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Operations on Sparse matrices.

Implementing stacks, queues and circular queues and applications like infix, postfix, conversion post fix expression evaluation, reverse string finding prime factors of a given number.

Implementing multiple stacks and queues (using arrays and pointers).

Applications of linked lists i.e. polynomial arithmetic.

Binary tree creation, deletion of a node, traversal.

Graph representation and traversal using BFS & DFS.

Sorting methods: selection sort, bubble sort, heap sort, merge sort, quick sort, Radix sort.

Searching Methods – Linear search, Binary search, Hashing.

COBOL

Using Display and Accept Verbs.

Input/Output through files.

Using GOTO… DEPENDING ON verb.

Using condition names clause.

Using sort & merge verbs.

Table-Handling.

Using Screen-section.

Transaction Processing.

References: D. Ghosh Dasthidar & M. K. Roy – “COBOL Programming”, TMGH.

MCA301

Computer Graphics

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Introduction: Vector and Raster graphics Fundamentals - Applications of graphics packages in various fields.

Line drawing Algorithms: Simple DDA, Symmetric DDA and Bresenham's line drawing algorithm (all quadrants), Bresenham's Circle generate algorithm for all quadrants.

Graphics devices: Different types of graphical I/O devices and their classification.

Two-dimensional transformations: 2D Co-Ordinate Systems - Homogeneous Co-Ordinates - Matrix Representation-Combined matrix traansformations.

Clipping and windowing: Windows - view port - Windowing transformation-Line Clipping algorithms - Polygons-inside test - Polygon Clip- ping Algorithm - Scan Conversion Algorithms.

Display Files: Display files segmentation - display file compilation - Data Structures Used For Implementing display Files Three Dimensional Transformations: 3D Transformations of translation, scaling and rotation - Combined transformations.

Projections: Perspective Projections - Parallel projections - Their classification and Matrix representations transformation Curves and Surfaces: Bezier curves and surfaces - B-Spine curves and surfaces

Design of Graphics package: Basic principles of design of a graphics package-Characteristics of good graphics package.

Reference:
1. Donald Hearn and M.Pauline Backer, "Computer Graphics", Prentice Hall of India, New Delhi, 2nd Edition.
2. Rogers, "Procedural Elements of Computer Graphics", McGraw Hill
3. Rogers, "Mathematical Elements of Computer Graphics", McGraw Hill

MCA302

System programming

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Introduction to grammars, languages, finite state machines. Introduction to system Programming, Introduction to Assembly Language Programming, Introduction to Instruction formats, data formats - Role of Base Register, Index Register.

Introduction to Assembler, databases used in assembler design, Design of Assembler - Single Pass & Double Pass.

Introduction to Macros, various types of Macros, Design of Macros Processor - Single Pass & Double Pass.

Introduction to Loaders, functions of a loader, types of Loaders, databases used in Loaders, Design of Loaders - Absolute & DLL.

Introduction to compilers: a brief discussion on various phases of compilers. Applications of FSM and grammars in compiler design. Introduction to Software Tools, Text editors, Interpreters, Program Generators, Debug Monitors.

References : Systems Programming
Author : Donovan
Publisher : Tata McGraw Hill
Reference : Systems Programming
Author : Dhamdhere (2nd Revised Edition)
Publisher : Tata McGraw Hill

MCA303

Operating system

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

OVERVIEW: Introduction, Computer system Structures, Operating systems Structures.

PROCESS MANAGEMENT: Processes, Threads, CPU scheduling, Process synchronization, Deadlocks

STORAGE MANAGEMENT: Memory management, Virtual memory, file system, file system, I/O systems, Mass-storage structure.

PROTECTION AND SECURITY: Protection and Security

Reference :
Applied Operating System Concepts: Avi Silberschatz, peter Galvin, Grey Gagne

MCA304

Optimization Techniques

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Introduction to Linear Programming - Construction of the LP Model - Graphical LP Solution - Computer Solution LP Models

The Simplex Method: Standard LP Form and its basic solutions - the Simplex Algorithm, Artificial Staring Solution, Special Cases in simplex method application.

Duality and Sensitivity Analysis : Definition of the Dual Problem - Relationship between the Optimal, Primal and Dual Solutions, Dual Simplex Method - Primal - Dual Computations - Post optimal of Sensitivity Analysis

Transpiration Model and its variants : Definition of the Transportation Model - Nontraditional Transportation Models - the Transportation Algorithm - the Assignment Model - the Transshipment Model

Network Models : Scope of Network Applications - Network Definitions, Minimal Spanning Tree Algorithm, Shortest Route Problem, Maximal flow model, Minimum cost capacitated flow problem - CPM and PERT

Goal Programming : Goal Programming Algorithms

Integer Linear Programming : Integer-Programming Solution Algorithms

Forecasting Models : Moving Average technique, Exponential smoothing, regression

Decision Analysis : Decision - Making under certainty - Decision - Making under Risk, Decision under uncertainty

Simulation Modeling : Monte Carlo Simulation, Generation of Random Numbers, Method for Gathering Statistical observations

Reference :
Operations Research - An Introduction by Hamdy A Taha, Prentice Hall India

MCA305

Object Oriented Programming and Design

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Section – A

Abstract Data Types: Model of Real World, Autonomy, Generation of correct Applications, Reusability Classes, Instance Values, Methods and Messages, Creating and destroying Objects, Constraints on object and Instance Variables, Pre and Post conditions of Methods.

Inheritance: Subsets as Subtypes, Sub typing of Structured Types Contrasting in inheritance with subtyping, Implicit Subtyping verses Explicit inheritance, Subtyping and dynamic binding class inheritance. Redefining Instance variables, Hiding Instance Variables inheriting methods, Method Overriding, Invoking Superclass method, Constrained Overriding, Inheriting the Interface, Excluding Super class Methods metaclasses, Explicit Support, Implicit of hidden Metaclasses, Object Oriented Languages without Metaclasses, Prototype Systems and Delegation, Multiple inheritance.

Section – B

Polymorphism, Object Identity, Object Modeling concepts, Object Oriented Design, Object Oriented Programming Languages, Object Oriented Database, Object Oriented User Interface.

Overview C + +: Linkages, How to make a Library, Functions, Macros.

Class & Objects: Data Members, Member Functions, Private and Public Members, Default Labels, Data hiding and Encapsulation, Arrays within a class, Class Function Definition and pass values.

Operator Overloading: Operator Function, User Defined Type Conversion Literal, Large Objects, Assignments and Intialization, Subcripting, Function Call, Deferencing, Increment and Decrement A string Class, Friends and Members.

Section – C

Inheritance through Extending C: Concept of Inheritance, Visibility Modes, Private, Public, Protected, Single Inheritance: Privately derived, Publicly derived.

Streams, Templates and Design of Libraries: Output, Input, Formatting, Files and Streams, Design of libraries.

Object Oriented Analysis & Design: Object Oriented Development, System Design, Object Design, Entity Relationship Model, Overview of Existing methodologies.

Section – D

Semantic and Entity Relationship Modeling: Contrasting Design for Databases and OOA/OOD.

Overview of Existing Methodologies: Object Oriented Analysis, Object Oriented Design, Object Diagram, Dynamic Model, Functional Model.

References:

1. . Object-Oriented Modeling and Design by Rambaugh & Others (Prentice Hall)

2. Object-Oriented Programming: Fundamental and Applications by Sengupta & Chaudhuri (P.H.I.)

3. Object Oriented Programming using C ++ by E.Balagursamy (Tata Mc-Graw Hill)

4. Mastering C ++ by Robert Lafore.

MCA306

Computational Techniques& Object oriented Programming lab

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Inheritance And File Operation.
2. Formulate A Case Study of A Simple Employee Pay Operation - Using Multiple And File Operations.
3. Matrix Operations - Using Template Functions
4. Demonstration of Virtual Functions And Late Binding
5. Demonstration of Friend Functions In Matrix Operations
6. Demonstration of Nested Classes
7. Implementation of All Operations on A Linked List
8. Implement Linked Stack
9. Implement Linked Queue
10. Binary Tree Operations
11. Graph Traversals
12. Internal Sorting Techniques
13. External - Disk Sorting
14. Hashing And Collision Resolution
15. Demo of STL Library

16 Implementation of MCA 202 in C++

Reference: Mastering C ++ by Robert Lafore

MCA401

Database Concepts & Applications

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

1) INTRODUCTION : Data base systems – data models – instances and schemes – Database Models – Relation ,Hierarchical and Network – Data independence – DDL and DML – Data base manager – database administrator – data base users – overall system Architecture.

2) ENTITY RELATIONSHIP MODEL : Entity and entity sets – relationships and relationship sets – entity – relation ship diagram – generalization - aggregation.

3) Relational model : structure of relation database – the relation algebra – the tuple relation calculus and the domain relational calculus – Relation commercial languages – SQL,QBE.

4) Integrity constraints : Domain constraints – referential integrity – functional dependencies – assertions and triggers

5) Relation database design :Normalization using functional dependencies , multi valued dependencies and join dependencies – domain key normal form

6) File and system architecture : File organization – sequential files – mapping relation data to files – data directory storage – buffer management – indexing – B+ B trees ,index files – static and dynamic ,hash functions – index definitions in SQL server.

7) Crash recovery :Failure classification – log based recovery – shadow paging

8) Concurrency control : Schedules – testing for serillizabllity – lock _ based protocols – time stamp based protocols – validation techniques – multiple granularity – multi version schemes.

9) Security and integrity : security and integrity violations – security specifications in SQL – statistical data bases.

Reference:

Henry F korth and Abraham siber schatz – data base system concepts “ MGH

MCA402

Computer Networks

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Introduction to Computer Networks, Protocol hierarchies, Design issues for the layers, Interfaces and Services, the TCP/IP reference model, the comparison of the OSI and TCP reference models.

Transmission media, Wireless transmission, the telephone system, Narrowband ISDN, Broadband ISDN and ATM.

Data Link layer Design Issues, Error Detection and Correction, Elementary Data Link Protocols, Sliding Window Protocols, Example Data Link Protocols.

ALOHA, Carrier Sense Multiple Access Protocols, Collision free protocols.

IEEE Standard 802.3 and Ethernet, IEEE standard 802.4: Token Bus, IEEE 802.5: Token Ring.

Transparent Bridges, Source Routing Bridges.

Comparison of Virtual Circuit and Data gram Subnets, Optimality Principle, Routing Algorithms, General Principles of Congestion control, Congestion prevention policies, Inter networking.

The Transport Service, Elements of transport protocols.

Network Security, DNS, SNMP, Electronic Mail, The world wide web Multimedia.

Reference :
Computer Networks Third Edition
By Andrew S. Tanenbaum.

MCA403

Software Engineering

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

SECTION-A

Software: Characteristics, Components, Applications, Software Process Models : Waterfall, Spiral, Prototyping, Fourth Generation Techniques, Concepts of Project Management , Role of Metrics & Measurements .

SECTION-B

S/W Project Planning : Objectives, Decomposition techniques : S/W Sizing, Problem-based estimation, Process based estimation, Cost Estimation Models : COCOMO Model, The S/W Equation, System Analysis : Principles of Structured Analysis, Requirement analysis , DFD, Entity Relationship diagram, Data dictionary.

SECTION-C

S/W Design: Objectives, Principles, Concepts, Design methodologies: Data design, Architectural design, procedural design, Object -oriented concepts

SECTION-D

Testing fundamentals: Objectives, principles, testability, Test cases: White box & Black box testing, Testing strategies: verification & validation, unit test, integration testing, validation testing, system testing

References:1. Roger. S. Pressman, "Software Engineering - A Practitioner's Approach", McGraw Hill

2. R.E. Fairley, "Software Engineering Concepts", McGraw-Hill.

3. Jalota, "An Integrated Approach to Software Engineering", (Narosa Publishing House).

MCA404

Analysis & Design of Algorithms

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Elementary Algorithmic: Introduction - Problems and Instances - The Efficiency of algorithms - Average and worst case Analyses - some examples.

2. Asymptotic Notation: A notation for "the order of" - Other asymptotic notation - Conditional asymptotic notation - Asymptotic notation with several parameters - Operations on asymptotic notation.

3. Analysis of Algorithms: Introduction - Analyzing control structures - Average case analysis - Amortized Analysis - Solving recurrences.

4. Greedy Algorithms: Making change - General Characteristics of greedy algorithms - Minimum spanning trees and shortest paths - Knapsack Problem - scheduling.

5. Divide-and Conquer: Introduction-Multiplying large numbers - The general template - Binary search - sorting - Finding the median - matrix multiplication - Introduction to cryptography.

6. Dynamic Programming: The Principle of optimality - making change the knapsack problem - shortest paths - Chained matrix multiplication-approaches using recursion - Memory functions.

7. Back Tracking & Branch Bound: Traversing trees - Depth first search of directed and undirected graphs - Breadth first search - Back tracking - Branch and bound - the minimax principle.

8. Introduction to NP - Completeness: Classes P and NP - Polynomial reductions - NP - Complete Problems NP-Hard Problems - Non-deter- ministic algorithms (Chapters 2,3,4,6,7,8,9 and 12.5).

Reference:
Fundamentals of Algorithmics.
Gilles Brassard & Paul Brately.
Prentice-Hall (India) Ltd.

: Fundamentals of Computer Algorithms.
Ellis Horowitz & Sartaj Sahani.
Galgotia Publications.
Computer Algorithms: Introduction to Design & Analysis.
Sara Baase & Alien Van Gelder.
Addison - Wesley Publishing Company.

MCA406

Network lab & Mini project

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Introduction to the various known ports by opening client connections. If the exception does not occur then the remote port is active else the remote port is inactive.

2. WRITING CHAT APPLICATION : One-One: By opening socket connection and displaying what is written by one party to the other.

3. CHAT APPLICATION : One to Many (multi cast): Each client opens a socket connection to the server and writes to the socket. All other parties can see whatever one party writes

4. DATA MANIPULATION ON A REMOTE DATABASE : At the remote database a server listens for client connections. This server accepts SQL queries form the client, executes it on the database and sends the response to the client. (add, delete, modify SQL commands)

5. MAIL CLIENT : SMTP client: Gives the server name, send e-mail to the recipient using SMTP commands (Core Java 2 pg: 163)

6. SIMPLE FILE TRANSFER BETWEEN TWO SYSTEMS: By opening socket connection to our server on one system and sending a file from one system to another.

7. HTTP-SERVER: Develop a HTTP server to implement the following com- mands. GET, DELETE. The server must handle multiple clients.

8. DOWNLOADING ANY FILE FROM HTTP SERVER: Using Java URL-connection class

Reference : Java Network Programming-Orielly)

MCA501

Multimedia Communication

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Multimedia communications – an overview;

Multimedia information representation – text, images, audio, video;

Introduction to Information Theory – information of a source, average information of a discrete memory less source, source coding for memory less sources;

Multimedia compression – text, image, audio, video (Standards: JPEG/JPEG-2000, G.723, MPEG-4/H.264L);

Standards for multimedia communications;

Issues in Multimedia Transmissions and protocols; Packet video in the Network environment; Transport protocols – TCP/IP; UDP/IP; RTP and RTCP, RTSP;

Reference:

Multimedia applications, standard , protocols

Fred Halsall, Addison Wesley, 2001, ISBN: 0-201-39818-4

MCA502

System Simulation & Modeling

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

SECTION - A

System Models : Concept, Environment, Continuos and discrete systems, Types of models; Subsystems, System Analysis, System design; System simulation: Technique, method types.

SECTION - B

Probability concepts in simulation : Stochastic variables and probability functions; Discrete system simulation: Fixed time step v/s event to event model, Generation of random numbers, Monte Carlo Computation V/S Stochastic simulation.

SECTION - C

Simulation of Queuing system, Simulation of single and two server queue, Network model of a project.

SECTION - D

Case study : Simulation of an auto pilot, Telephone system & Inventory system. Introduction to GPSS.

References:

1. Narsingh Deo "System Simulation with Digital Computer" PHI

2.G. Gordon "System Simulation" PHI

MCA5042

Distributed Database & Computing

Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

. INTRODUCTION

Distributed data processing; Distributed database systems (DDBS); Problems of DDBSs; Completing factors and problem areas

2. DISTRIBUTED DBMS ARCHITECTURE

DBMS standardization; Architectural models for DDBMSs; DDBMS architecture and Global directory issues.

3. DISTRIBUTED DATABASE DESIGN

Alternative design strategies; Distributed design issues; Fragmentation and allocation.

4. OVERVIEW OF QUERY PROCESSING

Query processing problems; Objectives of query processing; Complexity of relational algebra operators; Characterization of query processors; Layers of query processing

5. TRANSACTION MANAGEMENT

Destination of a transaction; Problems of transactions; type of transac- tions; and Architecture revisited

6. DISTRIBUTED CONCURRENCY CONTROL

Sterilizability theory; Taxonomy of concurrency control mechanisms; Lock- ing-based concurrency; Control algorithms; Timestamp-based concurrency control; Optimistic concurrency control; deadlock management; and Relaxed concurrency

References
Principles of Distributed Database Systems; 2nd Edition
Authors: M. Tamer Ozsu and Patrick Valduriez
Publishers: Person Education Asia
ISBN: 81-7808-375-2

Distributed Database; Principles & Systems
Authors: Stefano Ceri and Giuseppo Pelagatti
Publications: McGrew-Hill International Editions
ISBN: 0-07-010829-3

MCA5046

Advance Client Server Computing

Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

Client/Server Computing: Evolution of Client / Server concept, Definition, History, Need and motivation for Client/Server approach, Client/ Server environments, characterization of Client / Server computing, CIS Types and Examples, Functions of clients and functions of servers.
Architecture: Components of client-server architecture, application partitioning, the two-layer and three-Layer architectures, communication between clients and servers, use of a APIS in client/server computing, middleware technology in client/ server computing.
Transaction Processing (TP) Monitors, Groupware for collaborative human activities (components, work flows, Scheduling) , object brokers (components)- Web servers-Components, URL,HTML, HTTP,HTML Web-based Forms, tables, CGI-Sever side of the web, web security and S-HTTP, Firewalls, web client and JAVA,VB clients.
Client-Server Applications Development: Client application development environments, Development tools, Developing Applications on RDBMS, GUI design concepts, evaluation of database servers. .
Developing client applications of real-life on RDBMS like, Images, Oracle or Sybase Using the client application developer tools like Power builder, Delhi or Developer 2000.
Emerging Computing Trends: Client-server databases. Distributed objects, GUI based client applications, Managing client-server applications, active databases, Multi-media databases, Deductive databases concepts of next generation databases and Data warehouses.

Reference:
1. Robert Orfa, dan Harkey and 1. Edwards: The Essential Client/Server Survival Guide; 2nd Edn, John Wiley & Sons, 1996.
2. Beth Gold bernstien and David Marca: Designing Enterprise Client/Server Systems, PHI, 1998. .
3. Berson: Client Server Architecture: 2nd Edn, Mac Graw Hill.

MCA506

Database Application Lab & Seminar

Instruction: 3 Periods Lectures/Week
Sessional Marks: 50
Univ-Exam: 3 Hours
Univ-Exam-Marks: 100

SECTION -A

Degree of Data Abstraction, The Database life Cycle (DBLC): Initial study of the database, Database Design, Implementation and loading, Testing and Evaluation, Operation, Maintenance and evolution

SECTION - B

Centralized verses Decentralized Design, what is a Transaction?, Concurrency Control (Locking Methods, Time stamping Method, Optimistic Method)DDBMS (Distributed Database Management Systems) advantages and disadvantages. Homogeneous and Heterogeneous DBMS, Distributed Databases Transparency features. Levels of Data and Process Distribution: SPSD (Single-site processing, Single-Site Data), MPSD (Multiple-Site Processing, Single-Site Data), MPMD (Multiple-Site processing, Multiple-Site Data)

REFERENCES:

1. An Introduction to Database Systems (sixth Edition) By C. J. Date

2. Oracle db /sql

MCA601

Dissertation work

Sessional Marks: 50
Univ-Exam-Marks: 350

Format of report guidelines:

Title cover

· Certificate from organization about your stay (project duration) at that place and about submission of work done under external guide at the place of training.

· Certificate from your guide about the submission of work done under his/her guidance, Internal Supervisor and Counter Singed by training In charge Dept. of Computer Science and Engg.,.

· Table of contents abstract of the project (abstract of actual work done) · A brief overview of the organization (regarding function area, location, turnover, division in which you are working)

· Profile of problems assigned

· Study of existing system, if any

· System Requirements

· Product Definition

· Problem statement

· Functions to be provided

· Processing environment: H/W, S/W

· Solution strategy

· Acceptance criteria

· Feasibility analysis

· Project Plant

· Team Structure

· Development Schedule

· Programming languages and development tools

· System Requirements Specification

· Developing/operating/maintenance environments

· External interface and data flows

· User display and report format, user command summary

· High level DFD and data dictionary · Functional and performance specifications

· Design

· Detailed DFDs and structure diagrams

· Data structures, database and file specifications

· Pseudocode

· Test plan

· Functional, performance, stress tests etc.

· Implementation/Conversion plan

· Project Legacy

· Current status of project

· Remaining areas of concern

· Technical and managerial lessons learnt

· Future recommendations

· Bibliography

· Source code (if available)

Note:- The above is meant to serve as a guideline for preparation of your project report. You may add to, modify or omit some of the above mentioned points depending upon their relevance to your project. You may also consult your internal supervisor for the same.

SEMESTER-VI

Probability, Statistics& Queuing

MCA 104

Data &File Structures

C-Programming IT lab

MCA 201

MCA 202

MCA 204

MCA206

COBOL

MCA301

MCA302

MCA303

MCA304

MCA305

Section – B

Section – C

Section – D

MCA306

MCA401

1) INTRODUCTION : Data base systems – data models – instances and schemes – Database Models – Relation ,Hierarchical and Network – Data independence – DDL and DML – Data base manager – database administrator – data base users – overall system Architecture.

MCA402

MCA403

MCA404

MCA406

MCA501

MCA502

MCA5042

MCA5046

MCA506

MCA601