|
MCA COURSE
FIRST YEAR
SEMESTER - I
CP - 1101 - DISCRETE MATHEMATICAL STRUCTURES
CP - 1102 - COMPUTER ORGANIZATION
CP - 1103 - PROBLEM SOLVING, PROGRAMMING USING 'C'
CP - 1104 - PROBABILITY AND STATISTICS
CP - 1105 - MANAGEMENT ACCOUNTANCY
CP - 1106 - COMPUTER ORGANIZATION LAB
CP - 1107 - PROGRAMMING LAB
SEMESTER -II
MCA 1.2.1 - SYSTEMS PROGRAMING
MCA 1.2.2 - DATA STRUCTURES
MCA 1.2.3 - Principles of Programming Languages
MCA 1.2.4 - OBJECT ORIENTED PROGRAMMING
MCA 1.2.5 - INFORMATION SYSTEMS & ORGANISATIONAL BEHAVIOUR
MCA 1.2.6 - OBJECT ORIENTED PROGRAMMING LAB
MCA 1.2.7 - DATA STRUCTURES LAB
SECOND YEAR
SEMESTER - I
MCA 2.1.1 - THEORY OF COMPUTATION
MCA 2.1.2 - COMPUTER GRAPHICS
MCA 2.1.3 - FILE STRUCTURES
MCA 2.1.4 - DESIGN AND ANALYSIS OF ALGORITHMS
MCA 2.1.5 - OPERATING SYSTEMS
MCA 2.1.6 - OPERATING SYSTEMS LAB
SEMESTER - II
MCA 2.2.1 - DATACOMMUNICATIONS AND NETWORKS
MCA 2.2.2 - DATABASE MANAGEMENT SYSTEMS
MCA 2.2.3 - OPERATIONS RESEARCH
MCA2.2.4 - Artificial Intelligence
MCA 2.2.5 - DISTRIBUTED SYSTEMS
MCA 2.2.6 - IMAGE PROCESSING
MCA 2.2.7 - VISUAL PROGRAMMING LAB
MCA 2.2.7 - DBMS LAB
THIRD YEAR
SEMESTER - I
MCA 3.1.1. -INFORMATION SYSTEMS CONTROL AND AUDIT
MCA 3.1.2 NETWORK SECURITY
MCA 3.1.3 OBJECT ORIENTED SOFTWARE ENGINEERING
MCA 3.1.4 EMBEDDED SYSTEMS
MCA 3.1.4 NEURAL NETWORKS & FUZZY SYSTEMS
MCA 3.1.4 BIOINFORMATICS
MCA 3.1.5 DATA WARE HOUSING AND DATA MINING (Elective-III)
MCA3.1.5 COMPUTER VISION AND PATTERN ANALYSIS
MCA 3.1.5 Knowledge Management Elective-III
SEMESTER - II
CP - 3201 - PROJECT
CP- 3202 - SEMINAR
MCA 1st YEAR SYLLABUS
FIRST YEAR
SEMESTER -I
MCA 1101. DISCRETE MATHEMATICAL STRUCTURES
Instruction: 3 hoursr / week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks: 100
Introduction :Logic -propostional equivalence -Truth tables -tautalogy-predicates and quantifiers- sets -operators on sets-sequences and summations-growth functions -realtions and their properties-n-ary relations and their applications -representation of relations -closures of relations-equivalence relations-partial orderings.
Counting techniques: Basics of counting -pigeon hole principle -combinations and permutations -generalized permutation and combinations -recurrence relations-solving recurrence relations -divide and conquer relations-generating functions-inclusion and exclusion -application of inclusion and exclusion
Graph theory: Introduction to graph-terminology -relations and directed graphs- representaion of graphs -Isomorphisim-connectivity -euler and Hamiltonian paths-shortest path problems-tarversion trees and trees-spanning trees -minimum spanning trees .
Boolean algebra and models of computations :Boolean functions -Representing Boolean functions-logic gates -minimization of circuits-languages and grammars-finite state machines with and without no output-language recognition-turing machines.
Text books:
1) Discrete mathematics and its applications ,Keneth H rosen ,tata mac grawl hill publishing company ,New Delhi.(Chapters :1,4.1,4.2,4.3,4.6,4.7,5,6,7,8,9,10)
Reference books:
1) 1) Discrete mathematics for computer scientists and mathematicians,Joe .L.Mott A Abraham Kandal and T.P.Baker ,Prentice Hall of India ltd,New Delhi.
2) 1) Discrete mathematics ,Richard Johnsunberg,Pearson Education ,New delhi.
TOP
MCA 1102 Computer Organization
Instruction: 3 hours/week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks: 100
a. Digial Logic Fundamentals
b. Instruction Set Architectures
c. Introduction to Computer Organization
d. Register Transfer Languages
e. CPU design
f. Micro-sequence Control Unit Design
g. Computer Arithmetic
h. Memory organization
i. Input/output Organization
Text Book:
Computer Systems Organization & Architecture, John D.Carpineli, Addison Wesley Longman, Inc,/Pearson Education, 1993
Reference Book:
Computer System Architecture, M.Morris Mano, Third Edition,Pearson Education 1993,PHI-2002
Computer Architecture and organization; Design Principes and Applications, B.Govindarajalu, TMH publishing Company Ltd., 2004
Fundamentale of Computer organization and Design sivaram P.Dandamudi Springer International Edition, 2003
TOP
MCA 1103 Problem Solving, Programming using 'C'
Instruction: 3 Periods Lec/week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks: 100
OBJECTIVE: The objective of this subject is to discuss the basic techniques and algorithms for attacking and solving various types of problems. The language used for writing programs is C. The emphasis should be on writing algorithms and programs in C (not merely teaching C language)
INTRODUCTION: Definition of Algorithms Writing algorithms top down design Program verification - The efficiency of algorithms Concept of Recursion - some simple example to illustrate these concepts like finding the GCD of two numbers - Swapping two variables - Summation of given numbers-generation of Fibonocci sequence-Reserving a given number - Base conversion.
INTRODUCTION TO C: C character set-Delimiters- The C Keywords-Identifiers-Constants-Variables-Rules for Defining variables-data Types-declaring variables-initializing variables- Type of conversion-priority of Operators and their Clubbing-Comma and Conditional Operator-Arithmetic Operators-Relational Operators-Logical Operators-Bitwise Operators- Input and Output in C-Formatted and Unformatted functions - Library functions.
MORE ABOUT C: if statement-if … else statement -various forms of if-nested if-break statement-continue statement - go to statement - switch statement - nested switch statement - for statement - while statement do while statement - arrays - working with string and standard functions.
ADVANCED CONCEPTS OF C: Introduction to pointers - pointer declaration - Arithmetic Operations with pointers - pointers and arrays - pointers and two-dimensional arrays - array of pointers- pointers to pointers - pointers and strings - void pointers function definition and declaration - prototypes - types of functions - call by values and reference functions returning more values - functions as an arguments - function with operators function and decision statements - function and loop statements - function with array and pointers - recursion - pointer to function - storage classes.
ADDITIONALS IN C: preprocessor directives - structures and unions - bit wise operators files - command line arguments - dynamic memory allegation - graphics in C.
PROBLEM SOLVING: Reversal of an Array - Removal of duplicates in an ordered array- Partitioning of an array - Finding the kth smallest of an element of an array - Finding the longest monotone subsequence of an array - Linear search - Binary search - Hash searching - Bubble sort - merge sort - Quick sort - Insertion sort - selection sort - Text processing - Towers of Hanoi problem using recursion.
Text Books:
1) Ashok N.kmmthance, Programming with ANSI and Turbo C, Pearson Education. New Delhi.
2) R.G.Dromey, How to Solve it by Computer, Prentice Hall of India Ltd., New Delhi.
Reference Books:
1) N.G.Venkateshmurthy, Programming techniques through C, Pearson Education. New Delhi
2) Bryons Gottfried, Programming with C, Schaum's Outline series, TataMcGraw Hill pub. Company, New Delhi.
3) Jacqueline A. Jones & Keith Harrow, C programming with problem solving.
Dreamtech Publications, New Delhi.
TOP
MCA-1104 MCA 1.1.4 PROBABILITY, STATISTICS & QUEUING THEORY
Instruction: 3 Periods Lec/week Sessional Marks : 50
Univ.-Exam : 3 Hours Univ-Exam-Marks : 100
Probability: Definitions of probability, Addition theorem, Conditional probability Multiplication theorem, Bayes theorem of probability and Geometric probability.
RANDAOM VARIABLES AND THEIR PROPERTIES: Descrete Ramndom variable, continuous Random variable, probability Distrubution joint probability distributions their properties, Transformation variables, Mathematical expectations, probability generation functions.
PROBABILITY DISTRIBUTIONS/DISCRETE DISTRIBUTIONS: Binomial, possion Negative binominal distributions and their properties, (Definition, mean, variance, moment generating function., Additive properties, fitting of the distribution.)
CONTINUOUS DISTRIBUTIONS: Uniform, Normal,exponential distributions and their properties.
MULTIVARIATE ANALYSIS: Correlation, correlation coefficient, Rank correlation , Regression Analysis, Multiple Regression, Attributes, coefficient of Association, x^2 - test for goodness of fit, test for independence.
ESTIMATION: Sample, populations, statistic, parameter, sampling distribution, standard error, unbiasedness, efficiency, Maximum likelihood estimator notion & interval estimation.
TESTING OF HYPOTHESIS: Formulation of Null hypothesis, critical region, level of significance, power of the test.
SMALL SAMPLE TESTS: Testing equality of means testing equality of variances, test of correlation coefficient, test for Regression Coefficient.
LARGE SAMPLE TESTS: Tests based on normal distribution
QUEUING THEORY: Queue description, characteristics of queuing model, study stae solutions of M/M/1: alfa Model, M/M/1;N Model, M/M/C:Model, M/M/C:N Model case studies
TEXT BOOKS: Probability & Statistics for Engineers and Scientists, Walpole, Myers, Myers, Myers, Ye, Pearson Eduation.
Probability, Statistics and Random processes T.Veerarajan Tata McGraw-Hill
Reference Book: Probability & Statistics with Reliability, Queuing and computer Applications, Kishor S.Trivedi, Prentice Hall of India.1999.
TOP
MCA 1105. MCA 1.1.5 Management Accountancy
Instruction: 3 Periods Lec/week Sessional Marks : 50
Univ.-Exam : 3 Hours Univ-Exam-Marks : 100
Principles Of Accounting: Nature And Scope Of Accounting, Doubts 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. (with numerical problems)
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 Budget
Marginal Costing: Nature, Scope, Importance. Construction Of Break Even Chart, Limitations And Uses Of Break Even Chart, Practical Applications Of Marginal Costing. (with numerical problems).
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.
Text Books :Introduction to Accountancy. T.S.Grewal Management Accounting, G.Agarwal.
Reference Book: Introduction To Accounting, G.Agarwal.
TOP
MCA 1106. Computer Organisation Lab
Instruction: 3 Periods Lab Sess. Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks: 100
1- CYCLE : Digital Logic Design Experiments:
1. TTL Characteristics and TTL IC Gates.
2. Multiplexers & Decoders.
3. Flip-Flops
4. Counters.
5. Shift Registers
6. Binary Adders & Subtractors
7. A L U
II - CYCLE: 8085 Assembly Language Programming:
1. 8085 Assembly Language Programming according to theory course micro- processors-I using the following trainers:
Keyboard Monitor of 8085mP Trainer.
Serial Monitor of 8085mP trainer with Terminal.
8085 Line Assembler of 8085mP Trainer with PC a Terminal
8085 Cross Assembler using In-Circuit Emulator(ICE) with 8085mP Trainer and PC as Terminal
Graded Problems are to be used according to the syllabus of COMPUTER ORGANIZATION.
2. PENTIUM CLASS PC ARCHITECTURE FAMILIARIZATION HARDWARE &
SOFTWARE PARTS DEMONSTRATION.
TOP
MCA 1107. ' C ' PROGRAMMING LAB
Instruction: 3 Periods Lab Sess. Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks: 50
OBJECTIVE: The objective of this lab is to make student learn technique for attacking
and writing C program for various types of problems. The emphasis should be on writing
correct and efficient programs on C. The program should include all the ones suggested below but should not be limited to them only. The examiner need not stick to these programs only in the examination.
BASIC TECHNIQUES: Swapping of the contents of two variables -Finding the sum of digits of a given number -Reversing a given number.
DECISION MAKING : Finding the largest and the smallest of a given array-Solving a quadratic equation -Selecting an operation based on a menu.
LOOPING TECHNIQUES & ARRAYS: Finding the sum of n terms in a sine a series-Matrix-multiplication -Transpose -Polynomial addition -Polynomial multiplication-Sorting algorithms -Searching algorithm.
CHARACTER AND STRING HANDLING: Finding the length of string -Reversal of string -Concatenation of two strings-Checking whether it is a palindrome or not -converting upper case alphabets to lower case and vice-versa in string.
POINTERS STRUCTERS AND UNIONS: Find the sum of all elements of an array using pointers-Swapping the contents of two variables using pointers -Find the first and second rank holders and printing their names and roll numbers in a class of sixty students using structures-Defining a complex number as structure and write a program to illustrate
The operations of complex numbers-some examples of unions.
FILES & OTHER TOPICS: Copying and concatenation of files - Bit wise operations -Command lie parameters-C preprocessor directives -Macros.
Refrence books:
1)M.G. Venkatesh Murthy,Programming techniques through C,Pearson Education
New Delhi
2)Ashok .N. Kamthane ,Programming with ANSI and TURBO C,Pearson Education
New Delhi.
3)Byron .S. Gottfried ,programming with C,Schaums out line series ,Tata Mac Grawl Hill
Publishing company ,New Delhi.
TOP
FIRST YEAR
SEMESTER -II
MCA 1.2.1 SYSTEMS PROGRAMING
Instruction: 3 Periods Lec/week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks: 100
Introduction to grammars, languages, finite state machines.
Introduction to Systems Programming, Introduction to Assembly Languages Programming - Introduction to Instruction Formats - Role of Base Register, Index
Introduction to Assembler, databases used in assembler design, Design of assembler - Single pass & Double pass.
Introduction to Macros, Design of Macro 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.
Text Book:
System Programming, Donovan, Tata Mc Graw Hill
Reference:
1. System programming, Dhamdhere(II nd Revised Edition),Tata
Mc Graw Hill
2. System Software, Leland. L.Beck, Pearson Education.
TOP
MCA 1.2.2 Data Structures
Instruction: 3 Periods Lec/week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:100
1. Introduction to Data Structures: Abstract DataTypes, Review of Strings, Multi-dimensional arrays, structures & pointers concepts in C.
The Stack: Specification of ADT and primitive operators, Representing
Stack in C , Applications of Stack: Infixs, Postfixs and Prefix expression
Handling
2. Recursion: Recursion Definition and Processes, Recursion in C, Writing
Recursive Programs,Simulating Recursion, Efficiency of Recursion,
3. Queues and Lists: The Queues and its Sequential Representation, Linked
Lists, Lists in C, Circular Linked Lists, Doubly linked Lists.
4. Trees: Binary Trees, Binary Tree Representation, Trees and Their
Applications, Searches: Basic Seaech Technologies, Tree Searching.
5. Graphs and their Applications: Graphs, Graph Traversal and Spanning
Forests, Prim's Algorithm
6. Sorting:General Background, Exchange Sorts, Selection and Tree Sorting,
Insertion Sorts, Merge and Radix Sorts.
Text Book:
Data Structures using 'C' by Tenenbaum, Langsam , Augenatein .
Pearson Education.
Reference Books:
1. Data Structures using 'C' by Bala Guruswamy, TMH
2. Data Structures using 'C' by Weiss, Pearson Education
TOP
MCA 1.2.3 Principles of Programming Languages
Instruction: 3 Periods Lec/week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks: 100
1. The Role of Programming Language:- Towards Higher-level Language, Problems of Scale, Programming Paradigms, Language Implementation Bridging the Gap.
2. Language Description:- Syntactic Structure: Expression Notations, Abstract Syntax Trees, Lexical Syntax, Context-free Grammars, Grammars for Expressions, Variants of Grammar.
I IMPERATVE PROGRAMMING:
3. Statements: Structure Programming:- The Need for Structured Programming, Syntax Directed Control Flow, Design Considerations: Syntax, Handling Special Cases in Loops, Programming with invariants, Proof Rules for Partial Correctness, Control Flow in C.
4. Types: Data Representation:- The Role of types, Basic Types, Array Sequence of Elements, Records: Named Field, Unions and Variant Records, Sets, Pointers: Efficiency and Dynamic Allocation, Two String Tables, Types and Error Checking.
5. Procedure Activations:- Introduction to Procedures, Parameter-Passing Methods, Scope Rules For Names, Nested Scopes in the Scope Text,, Activation Records, Lexical Scope: Nested Procedures and Pascal.
II OBJECT ORIENTED PROGRAMMING:
6. Grouping of Data and Operations:-Constructs for Programming Structuring, Information Hiding, Program Design with Modules and Defined Types, Class Descriptions in C++, Dynamic Allocation in C++, Templates: Parameterized Types, Implementation of Objects in C++.
7. Object-Oriented Programming:- What is an Object?, Object-Oriented Thinking, Inheritance, Object-Oriented Programming in C++, An extended c++ examples, Derived Classes and Information Hiding, Objects in Smalltalk Objects have Self.
III FUNCTIONAL PROGRAMMING:
8. Elements of Function Programming:- A little Language of Expressions, Types: Values and Operations, Functional Declarations, Approaches to Expression Evaluation, Lexical Scope, Type Checking.
9. Functional Programming in a Typed Languages:- Exploring a List, Functional Declaration for by Cases, Functions as Fist-Class Values, ML: Implicit Types, Data types, Exception Handling in M, Little Quit in Standard ML.
10. Functional Programming with Lists:- Scheme , A Dialect of Lisp, The Structure of Lists, List manipulation, A Motivation Example: Differentiation, Simplification of Expressions, Storage Allocation for Lists.
IV OTHER PARADIGMS:
11. Logic Programming: - Computing with Relations, Introduction to Prolog , Data Structures in Prolog, Programming Techniques, Control in Prolog, Cuts.
12. An Introduction to Concurrent Programming: - Parallelism in Hardware, Streams: Implicit Synchronization, Concurrency as interleaving, Live ness Properties, Safe Access to Shared Data. Concurrency in Ada, Synchronized to Shared Variables.
Text Book:
Programming Languages- Concepts & Constructs, Ravi Sethi, Pearson Education.
References:
1. Programming Languages- Designs & Implementation, Terrance W. Pratt, Marvin V. Zelkowitz, Person Education.
2. Concepts of programming languages- Robert L.Sebesta, Person Education.
TOP
MCA 1.2.4 OBJECT ORIENTED PROGRAMMING
Instruction: 3 Periods Lec/week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:100
Fundamentals of object oriented programming: Introduction to Object Oriented Paradigm, procedural Paradigm, An overview of classes, objects and methods, inheritance and polymorphism.
Basic of C++: Structure of C++ program, data types and declaration, Expressions and operator precedence, Program flow control, functions, scope of variables, Inline functions and default arguments, dynamic allocation new and delete operators.
Inheritance: Derived classes, syntax of derived classes, Types of Inheritance, Virtual Functions and Virtual Base Classes.
Adhoc Polymorphism : Overloading and Function selection, Friend Functions, overloading operators such as assignment subscripting, I/O, pointer to class member, new and delete.
Templates: Generic Classes, Class Templates, Function Templates Parameterizing Vectors, STL, Containers, Iterators, Function Adapters, String Library.
Exceptions: Using assert.h, signal.h, throwing exceptions, Try Blocks, handlers, Exception specification, standard exceptions and uses.
I/O Streams: Output and Input class streams, Ostream, Istream, File handling, using strings as streams.
UML: Basics, Use case, Class, Object, Sequence, Activity, State Chart, Collaboration, Component and Deployment diagrams in Object Oriented Project design.
TEXT BOOKS:
1.Object Oriented Programming using C++, Ira Pohl, PEARSON EDUCATION
2. Object Oriented Programming in C++, Robert Lafore
3.UML in 21 Days, Tech Media
TOP
MCA1205 INFORMATION SYSTEMS & ORGANIZATIONAL BEHAVIOR
Instruction: 3 Periods Lec/week Sessional Marks: 25
Univ.-Exam : 3 Hours Univ-Exam-Marks:75
Organizational Structure and Design - Management Communication and barriers - controlling - delegation of Authority and Inter Department Co-ordination.
Organizational climate and culture - Management of Organizational Conflicts - Theories of Motivation.
Group Dynamics - Characteristics of a Leader - leadership Styles - Analysis of Interpersonal Relations.
MIS Perspective - Information needs and its objectives - Management Information and Control Systems.
Information for Decision Making - Conceptual Foundations of Information Systems - Information Resource Management.
Suggested books for Reading:
1. Elements of organizational behavior. Robbins. 7th edition. Pearson Education.
2. Information Systems, Alter, Pearson Education
3. Organization and Management - R.D. Agarwal
4. Organization theory and Behaviour - L.M.Prasad
5. Practice and Management - Peter F.Drucker
6. Management Information Systems - Kanter Jerma
7. Computer and Information Management - S.C.Bhatnagar and K.V.Rama Devi
TOP
MCA 1.2.6 OBJECT ORIENTED PROGRAMMING LAB
Instruction: 3 Periods Lab Sess. Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks: 100
LIST OF EXPERIMENTS:
1. Illustrate passing by Reference. (Programme 4.6)
2. Illustrate use of static inside a class. (Programme 4.7)
3. Demonstrate- usage of Friend Function (Programme 4.9)
4. Demonstrate Friend Class (Programme 4.10)
5. Complex Nos. adding and multiplying (Programme 4.13)
6. Copy constructor demo (Programme 5.8)
7. User defined copy constructor demo (Programme 5.9)
8. Operator +, * overloading (Programme 6.11,6.12)
9. Adding Rational Numbers (Programme 6.13)
10. Overloading Auto increment operator. (Programme 6.14)
11. Interactive Constructor (Programme 7.4)
12. Real Time Digital Clock (Programme 8.9,9.1)
13. Virtual base class Demo (Programme 9.2)
14. 'Is - a', 'has - a' relationships (Programme 9.4,9.5)
15. Polymorphism using Pointer to Object (Programme 12.2)
16. Virtual base class Demo (Programme 12.9)
17. Binary File Demo (Programme 13.7)
18. Creating large file (Programme 13.12)
19. File split, File join (Programme 13.13,13.14)
20. Template sorting (Programme 14.4)
21. Demo of Class Template (Programme14.5)
22. Matrix Multiplication (Programme 15.3)
23. Linked List implementation (Programme 15.6,15.17,15.18)
24. Stack simulation (Programme 15.19)
25. Demo of using Keyword CONST (Programme 16.8,16.10)
26. Drawing Lines (Programme 17.4)
27. Storing image on Disk (Programme 17.9)
28. Animation (Programme 17.10)
29. Using Mouse (Programme 17.11)
30. Visual Basic form creation (Programme 17.12)
Reference:
Object Oriented Programming with C++, M.P.Bhave and S.A.Patekar, Pearson Education.
TOP
MCA 1207 DATA STRUCTURES LAB
Instruction: 3 Periods Lab Sess. Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks: 100
LIST OF EXPERIMENTS:
1. ADT Stack Implementation and use it for evaluation of post-fix Expression.
2. Conversion of prefix expression into post-fix form using recursion
3. Implementation of circular queue(using array) with menu options like Insert, delete, display and exit.
4. Implementation of a priority queue(using pointers) and use it to organize Student records prioritized by marks.
5. Implementation of ADT doubly linked circular list to hold strings and use It for organizing a sequence of cities constructing a rout program.
6. Implementation of a binary search tree with menu options: Construct a Tree, insert a node , delete a node, traverse and display preorder, inorder And post order sequence of its nodes.
7. Implementation of di-graphs using adjacency matrix and find the Transitive closure using Warshall's algorithm
8. Implementation of weighted graph and find minimal cost spanning Tree using PRIM's algorithm.
9. Generate 100 random integers in a given range and sort them using quick Sort. Apply both binary search and Interpolation search to locate a given integer and compare the search algorithms based on the number of
Comparisons/probs required for a successful as well as unsuccessful
Search.
10. Heap Sort
11. Merge Sort
12. Implementation of small Real World Application illustrating DS usage.
TOP
MCA 2nd YEAR SYLLABUS
MCA2.1.1 THEORY OF COMPUTATION
Instruction: 3 Periods/week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:100
1. Introduction To Finite Automata: Alphabets and languages-Finite Representation of Languages. Deterministic Finite Automata-Non-deterministic finite Automata-Equivalence of deterministic and non finite Automata-properties of the Languages accepted by Finite Automata-Finite Automata and Regular Expressions-Proofs those Languages are and are Not regular.
2. Context free languages: context-free grammar-regular Languages and context free grammar-pushdown automata-push down automata and context free grammar-properties of context free languages-closure properties-Periodicity Properties-Determinism and Parsing-Deterministic pushdown Automata and context free languages-Top-down Parsing-bottom-up parsing.
3. Turing machines: The definition of Turing Machine-Computing with Turing Machines -Combining Turing Machines-some examples of More Powerful Turing Machines.
4. Chuch's Thesis: Church's Thesis-The Primitive Recursive functions- Godelization-The m Recursive functions -Turing -Computability of the m-Recursive functions-Universal Turing Machines
5. Uncomputability: The Halting problem-Turing- Enumerability, Turing-acceptability and Turing-Decidability-Unsolved problems about Turing machines and m-Recursive functions-Post's correspondence problem.
6. Computational complexity: Time-bounded Turing Machines-Rate of growth of functions-Time-bounded simulations-The classes P and NP-NP Completeness-some NP-complete problems-integer programming-the Travelling salesman problem.
7. The Prepositional calculus: Introduction Syntax of the Prepositional calculus-Truth assignments-Validity and Satisfiability-Equivalence and Normal forms-resolution in Prepositional calculus.
8. The Predicate calculus: Syntax of the Predicate calculate calculus-Structures and satisfiability-Equivalence - Unsolvability and NP-completeness-Resolution in the Predicate calculus.
Text books:
Elements Of The Theory Of Computation, Harry R Lewis, Cristos h Papadimitrion, Pearson Education.Prentice-Hall of India Pravite Limited.
Reference:
Introduction to Automata Theory, Languages and Computation, Hopcroft, J.E and J.D Ullman Addison-Wesley,Reading Mass.1979
TOP
MCA 2.1.2 COMPUTER GRAPHICS
Instruction: 3 Periods /week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:100
Introduction: Usage of Graphics and their applications ,Presentation Graphics-Computer aided Design-computer Art entertainment-Education and Training-Visualisation-Image Processing-Graphical user interfaces.
Overview of Graphics systems: Video Display Devices-Raster scan Systems-random scan systems-graphics monitors and workstations-input devices-hard copy devices- graphics software.
Output Primitives: points and lines-line drawing Algorithms-loading the frame buffer-Line function-circle generating algorithms-Ellipse generating Algorithms-other curves-parallel curve algorithms- corve functions-cell array -character generation
Attributes of Output Primitives: line and corve attributes-color and gray scale levels-Area fill attributes-character attributes-bundled attributes -inquiry functions- annaliasing
Two Dimensional Geometric Transformations: Basic Transformations-Matrix Representations-Homogeneous Coordinates-composite Transformations -other transformations transformations between coordinate systems- Affine transformations-Transformation functions-Raster methods for Transformations
Two Dimensional Viewing: The viewing pipeline-viewing Coordinate reference Frame Window-to-viewport Coordinate transformation-Two dimensional viewing functions-Clipping operations-point clipping-line clipping-polygon clipping-curve clipping-Text and exterior clipping
Structure And Hierarchical Modelling: concepts of structures and basic models -editing-hierarchical madelling with structures-GUI and interactive input methods-Windows and icons-virtual reality environments
Three Dimensional Concepts and Object representations:3D display methods-3D graphics-polygon surfaces-curved lines and surfaces-quadratic surfaces-super quadrics-blobby objects-Spline representations-cubic Spline methods-Bezier curves and surfaces -B Spline Curves and Surfaces
Three Dimensional Geometric and Modeling Transformations: translation -rotation-scaling-other transformations-composite transformations-3D transformation functions-modeling and coordinate transformations
Three Dimensional Viewing: Viewing pipeline-viewing coordinates-projections-view volumes-general projection transformations-clipping -hardware implementations-Three Dimensioanl viewing
Text Book:
1)computer graphics C version,Donald Heam & M.Pauline Baker,Pearson Education,New Delhi,2004(chapters 1 to 12 except 10-9 to 10-22)
Reference Books:
1) Procedural elements for computer graphics,David F Rogers, Tata Mcgraw Hill book company, New Delhi,2003
2 ) computer graphics principles & practice in c ,J.D.Foley,S.K.Feiner,A Van Dam F.H.John Pearson education,2004
3) computer graphics using open GL,Franscis S Hill jr,Pearson Education ,2004
TOP
Instruction: 3 Periods /week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:100
File Processing operations: physical and logical files, opening, reading &writing and closing files in c, seeking and special characters in files, physical devices and logical files, file related header files in C
Secondary Storage: Disks - organisation, tracks, sectors, blocks, capacity, non data overhead, cost of a disk access, magnetic tape-types, performance, organization estimation of tape, length and data transformation times, disk vs tape, CD-ROM-CD-ROM as a file structure ,physical organization ,strengths and weakness of CD-ROMs, storage hierarchy.
Byte Journey and Buffer Management: File Manager, I/O buffer, I/O processing buffer strategies and bottlenecks
File Structure Concepts : A Stream file, field structures ,reading a stream of fields,record structures and that uses a length indicator ,Mixing numbers and characters -use of a hex dump ,reading the variable length records from the files.
Managing Records in C files: Retrieving records by keys, sequential search, direct access, choosing a record structure and record length, header records, file access and file organization
Organizing Files for performance: Data compression, reclaiming space-record deletion and storage compaction, deleting fixed length records for reclaiming space dynamically, deleting variable length records, space fragmentation, replacement strategies.
Indexing: Index, a sample index with an entry sequenced file, basic operations on an indexed, entry sequenced file indexes that are too large to hold in memory, indexing to provide access by multiple keys, retrieval using combination of secondary keys, improving the secondary index structure-inverted lists.
Indexed Sequential file access and prefix B+ Trees :Indexed sequential access, maintaining a sequence set, adding a simple index to the sequence set ,the content of the index; separators instead of keys, the simple prefix B+ tree, simple prefix B+ tree maintenance, index set block size, internal set block size, internal structure of index set blocks: a variable order B-tree. loading a simple prefix B+ tree.
Hashing: Collisions in hashing, a simple hashing algorithms, hashing functions and record distributions, memory requirements ,collision resolution by progressive overflow, buckets, deletions
Extendable hashing: working of extendable hashing, implementation, deletion, extendable hashing performance
Designing file structure for CD-ROM:
Tree structure on CD-ROM, hashing files on CD-ROM,CD-ROM file structure
Implementation in c++
Text book: File structures-An object Oriented approach with c++, Michael J.Folk,Bill Zoellick and Oreg Riccardi, Pearson Education.
TOP
Instruction: 3 Periods /week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:100
1. Introduction-notion of algorithm-algorithmic Problem solving (1.1,1.2)
2. Analysis of algorithm efficiency-analysis framework-asymptotic notations-analysis of non recursive and recursive algorithms(2.1,2.4)
3. Divide and conquer-Merge sort-Quick sort-binary search-large integer multiplication and Strassens matrix multiplication-closest pair and convex Hull problems (4.1 to 4.3,4.5 to 4.6)
4. Decrease and conquer: -DFS and BFS, Topological sorting, Decrease -by-a-constant-factor algorithms, variable size-decrease algorithms (5.2,5.3,5,5,5.6)
5. Transform and coquer: Horner's rule and binary exponentiation-problem reduction (6.5,6.6)
6. Space and Time tradeoffs: -input enhancement in string matching (7.2)
7. Dynamic programming: -warshall's and Floyd's algorithm -optional binary search tree-knapsack problem (8.2-8.4)
8. Greedy technique-prims and kruskal's algorithms, Dijkstra's algorithm, Huffman Trees (9.1-9.4)
9. Limitations of algorithm power: lower bound arguments -decision trees-P, NP and NP complete problems (10.1-10.3)
10. Coping with limitations of algorithmic power-back tracking, branch and bound, appraoximation algorithm for NP hard problems (11.1-11.3)
Textbook:
Introduction to the design and analysis of algorithms, Anany Levitin: Pearson education, 2003
Reference books:
1) Fundamentals of computer algorithms, Horowitz and Sahni, Galgothia publications
2) introduction to algorithms ,Cormen, Leiserson and Rivest: Prentice Hall of India
TOP
MCA 2.1.5 OPERATING SYSTEMS
Instruction: 3 Periods /week Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:100
Overview:
Introduction, computer system structures, operating system structure
Process management:
Processes , threads, cpu scheduling ,process synchronization, dead locks
Storage management:
Memory management, virtual memory, file system, I/O systems, mass-storage structure
Protection and security
Protection and security
Textbook:
Applied operating system concepts, Avisilberschatz, Peter Galvin, Grey Gagne
TOP
MCA 2.1.6 OPERATING SYSTEMS LAB
Instruction: 3 Periods Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:100
1. Study of laboratory environment: hardware specifications, software specifications
2. Simple unix-c programs: programs using system calls, library function calls to display and write strings on standard output device and files.
3. Programs using fork system calls
4. Programs for erroe reporting using errno, perror () function.
5. Programs using pipes
6. Shell programming.
7. Programs to simulate process scheduling like FCFS. Shortest Job First and Round Robin
8. Programs to simulate page replacement algorithms like FIFO, optional and LRU.
9. Programs to simulate free space management
10. Programs to simulate virtual memory
11. Programs to simulate deadlock detection
-
References:
1. Unix systems programming: communication, concurrency and threads, Kayrobins,2nd edition ,pearson education.
2. Unix concepts and applications, Sumitabha Das, TMH-publications.
3. Unix programming, Stevens, Pearson education.
4. Shell programming, Yeshwant kanethkar.
5. Operating System concepts:snberschatz and Peter Galvin.
Reference
Database Management Systems – Design and building business Applications
By Gerald V Post 1999
Tata-McGraw Hill
ISBN:0-07-043472-7
TOP
MCA 2107 OBJECT ORIENTED PROGRAMMING LAB
Instruction: 3 Periods Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:50
- Formulate A Case Study Of A Simple Employee Pay Operation – Using Single Inheritance And File Operation.
- Formulate A Case Study Of A Simple Employee Pay Operation – Using Multiple Inheritance And File Operations.
- Matrix Operations – Using Template Functions
- Demonstration Of Virtual Functions And Late Binding
- Demonstration Of Friend Functions In Matrix Operations
- Demonstration Of Nested Classes
- Implementation Of All Operations On A Linked List
- Implement Linked Stack
- Implement Linked Queue
- Binary Tree Operations
- Graph Traversals
- Internal Sorting Techniques
- External – Disk Sorting
- Hashing And Collision Resolution
- Demo Of STL Library.
TOP
SEMESTER -II
MCA 2.2.1 DATACOMMUNICATIONS AND NETWORKS
Instruction: 3 periods/Weeks Sessional Marks: 50
Uniy.Exam: 3 Hours Uniy.Exam Marks: 100
1. Introduction. DataCommunications,Networks,The Internet,Protocol & Standards.
2. Network Models; Layered tasks,I nternet model, OSI model
3. Phyical Layer:
3.1 Signals: Analog and digital signals, data rate limits, transmission inpairment, Signal measurements like throughput, propagation speed and time, wave length.
3.2 Digital Transmission: Line coding, black coding, sampling, transmission maode.
3.3 Analog Transmission: Modulation digital data,telephone modem,Modulation analog signals.
3.4 Multiplexing: FDM, WDM, TDM.
3.5 Transmission media: Guided media, unguided media.
3.6 Circuit Switching & Telephone Network: Circuit Switching, telephone network.
4. Data Link Layer:
4.1 Error detection and Correcion: Types of errors,detection and correction of errors
4.2 Data Link Control & Protocol, Flow & error control,Stop-And-Wait ARQ, Go-Back-
N ARQ, Select Repeat ARQ, HDLC.
4.3 Point-To-Point Access: Point-To-Point protocal,PPP stack.
4.4 Local Area Network: Traditional Ethernet, fast and gigabit Ethernets.
4.5 Connecting LANs, Backbone Networks and Virtual LANs: Connecting devices,Baskbone networks,Virtual LANs.
5 Network Layer:
5.1 Internet Works, Addressing, Routing
5.2 Network Layer protocols:ARP, IP, ICMP, IPV6
5.3 Unicast routing, Unicast routing protocols,Multi routing protocols
6 Transport Layer:
6.1 Process-To-Process delivery, user data gram,Transmisison control protocol
7 Application Layer:
7.1 Client- Server Model: Client-Server model,Socket interface.
7.2 A brief intoduction to DNS, SMTP, FTP.
Text Books:
Data communications and Networking,Behrouz A.Forouzan, 3rd Edition, Tata McGraw-Hill publishing & co.
Reference Books:
Understanding Data Communications and Networks,William A Shay, 2nd Edition, Vikas publishing house.
TOP
MCA 2.2.2 DATABASE MANAGEMENT SYSTEMS
Instruction: 3 periods/weeks Sessional Marks: 50
Uniy.Exam: 3 Hours Uniy.Exam-Marks: 100
1. Database Systems concepts and architecture
Introduction, data models, schemas and instance; three schema archiecture And data independence,database language and interface,the database system Environment, centralized and client/server architecture of DBMSs; classification of DBMSs.
2. Datamodelling using the ER-model:
High-level conceptual data modelsfor database design, Entity types, Entity sets, Attributes and keys;relationship types,relationship sets, roles and structural Constraints, weak entity types,ER- diagrams,naming conventions and design Issues, Notation for UML class diagrams.
3. Enhanced ER And UML Modeling:
Subclasses, super classes and inheritance; specialization and generalization; constraints and characteristics of specialization and generalization, modeling of union types using categories; representing specializaton/generalization and inheritance in UML class diagrams, relationship types of degree higher than two; data abstraction, knowledge representation and ontology concepts.
4. The relational Data Model And Relational Database Constraints:
Relational model concepts, relational model constraints and relational database schemas; updating operations and dealing with constraints violations
5. The Relational Algebra And Relational Calculus:
Unary relational operations: SELECT and PROJECT; relational algebra operations from set theory; binary relational operations: JOIN and DIVISION; additional relational operations; the tuple relational calculus; the domain relational calculus.
6. Relational Database Design by ER And EER-To-Relational mapping:
Relational database design using ER-to-Relational mapping; mapping EER model constructs to relations
7. Functional Dependencies And Normalization For Relational Databases:
Informal design guidelines for relational schemas; functional dependencies; normal forms based on primary leys; general definitions of 2nd and 3rd normal forms; Boyce-Codd normal forms
8. Transaction Processing Concepts:
Introduction to transaction processing, transaction and system concepts; desirable properties of transaction; characteristics schedule based on recoverability; characteristics schedule based on serializability.
9. Concurrency Control Techniques:
Two phase locking techniques for concurrency control; concurrency control based on timestamp ordering; multi-version concurrency control techniques; validation(optimistic) concurrency control techniques; granularity of data items and multi granularity locking.
10. Database Recovery Techniques:
Recovery concepts; recovery techniques based on deferred updates; recovery techniques based on immediate update; shadow paging; the ARIES recovery algorithm.
Text Books:
Fundamentals of Database Systems Ramez Elmasri and Shamkant B. Navathe, 4th edition, Pearson education.
Reference:
Database Concepts, Abraham Silberschatz, Henry F Korth, S. Sudarshan, McGraw-Hill.
TOP
MCA 2.2.3 OPERATIONS RESEARCH
Overview of Operations Research: OR models-Or Techniques
Linear Programming: Introduction - Graphical Solution: Graphical sensitivity analysis - The standard form of linear programming problems - Basic feasible solutions - unrestricted Variables - simplex algorithm - artificial variables -Big M and two phase method \Degeneracy - alternative optima -unbounded solutions- infeasible solutions.
Dual problems: Relation between primal and dual problems - Dual simplex method.
Transportation model: stating solutions, North West corner Rule - lowest cost method - Vogel's approximation methods - Transportation algorithms - Assignment problem- Hungarian Method.
Network Models: Definitions - CPM and PERT - Their Algorithms
Inter Programming: Branch and Bund Algorithms cutting plan algorithm.
Dynamic Programming: Recursive nature of dynamic programming- Forward and Backward Recursion
Deterministic Inventory Models: Static EOQ Models- Dynamic EOQ models.
Game theory: Two person Zero sum Games - Mixed strategy games and their Algorithms.
Text Books:
1.Operations Research - An Introduction, Handy A Taha - Pearson Education.
2. Operations Research Panneer Selvan Prentice Hall of India.
TOP
MCA2.2.4 Artificial Intelligence
1. Problems and Search: What is Artificial Intelligence? , The AI Problems, The Underlying Assumption, What is an AI Technique, The Level of he Model, Criteria for Success, Some General References, One Final Word.
2. Problems, Problem Spaces, and Search: Defining the Problem as a State Space Search, Production systems, Problem Characteristics, Production System Characteristics, Issues in the Design of Search Programs, Additional Problems.
3. Heuristic Search Techniques: Generate - and - Test, Hill Climbing, Best First Search, Problem Reduction, Constraint satisfaction, Means-Ends Analysis.
4. Knowledge Representation: Knowledge Representation Issues, Representations and Mappings, Approaches to knowledge Representation, The Frame Problem.
5. Using Predicate Logic: Representing Instance and Lsa Relationships Computable Functions and Predicates, Resolution, Natural Deduction.
6. Representing Knowledge Using Rules: Procedural Versus Declarative knowledge, Logic Programming, Forward versus Backward Reasoning, Matching, Control Knowledge.
7. Symbolic Reasoning under Uncertainty: Introduction to Non monotonic Reasoning, Logics for Non monotonic Reasoning, Implementation Issues, Augmenting a problem solver, Implementation: Depth-First Search, Implementation: Breadth_ First_ search.
8. Statistical Reasoning: Probability and Bave's Theorem, Certainty Factors and Rule-Based Systems, Bayesian Networks, Dumpster-Shafer Theory, Fuzzy Logic.
9. Weak slot - and - Filler Structures: Semantic Nets, Frames.
10. Strong Slot - and - Filler Structures: Conceptual Dependency, Scripts, CYC.
11. Knowledge Representation summary: Syntactic-Semantic Spectrum of Representation, Logic and Slot -and - Filler Structures, Other Representational Techniques, Summary of the Role of Knowledge.
Text Book:
Artificial Intelligence, Elaine Rich, Kevin Knight, Tate McGrawHill
Reference:
Artificial Intelligence - A modern approach, Stuart Russel, Peter Norwig, Pearson Education.
TOP
MCA 2.2.5 DISTRIBUTED SYSTEMS
1.Characterization of Distributed Systems: Introduction Examples of distributed systems , Resource sharing & web challenges.
2.System Models: Introduction ,Architectural models , Fundamental models.
3.Networking and inter networking: Introduction, Types of network, Network Principles ,Internet protocols, Network case studies: Ethernet, wireless LAN &ATM.
4. Inter process communication: Introduction, The API for the internet
protocols, external data representation and marshilling, Client-server communication,
Group communication, case study: interprocess communication in UNIX.
5. Distributed objects and remote invocation:- Introduction, communication between distributed objects,Remote procedure call, Events and notifications, java RmI case study.
6. Distributed file systems:- Introduction, file service architecture, sun network file system,The Andrew file system, Recent advances.
7. Name services:- Introduction, name services and the domain name system, Directory and discovery services, Cvase study of the globle name service. Case study of the X500 directory service.
8. Time and global states:- Introduction, clocks, events and process states, synchronizing physical clocks, Logical time and logical clocks,global states ,Distributed debugging.
9. Coordination and agreement:- Distributed mutual exclusion ,Elections, multicast communication ,consenses and related problems.
10. Transactions and concurrency control:- Transactions, nested transactions, locks, optimistic concurrency control, Timestamp ordering, comparison of methods for concurrency control.
11. Distributed transactions:-Flat and nested distributed transactions Atomic commit protocols, Concurrency control in distributed transactions, Distributed dead locks, Transaction recovery.
12. Replication:-System modal and group communication ,fault-tolerant services, Highly available services ,Transactions with replicated data.
Text books:
Distributed systems- Concepts and design ,George coulouris, John Dollimore, Tim Kindburg, Pearson education.
Reference books:
Distributed systems- Principles and paradigms, Andrew S.Tenenbaun, Marten Van Steen, Pearson education.
TOP
MCA 2.2.6 IMAGE PROCESSING
1.FUNDAMENTALS OF IMAGE PROCESSING: Image acquisition ,Image model,Sampling, Quantisation, Relationship between pixels, Distance measure,Connectivity,Image geometry,Photographic flims .Histogram: definition, decision of contrast basing on histogram, Operations basing on histogram like image stretching, Image sliding, Image classification. Definition and algorithm of histogram equalization.
2.IMAGE TRANSFORMS: A detail discussion on Fourier transform. DFT,FFT ,Properties-A brief discussion on WALSH transform, WFT,HADAMARD transform, DCT.
3.IMAGE ENHANCEMENT: (by SPATIAL domain method)
a. Arithmetic and logical operations, Pixel or point operations, Size operations.
b. Smoothing filters_ mean, median, mode filters-comparative study
c. Edge enhancement filters_ directorial filters Sobel, Laplacian, Robert, KIRSCH Homogeneity and DIFF filters, prewitt filter ,Contrast based edge enhancement technics - comparative study.
d. Low pass filters, High pass filters, sharpening filters_comparative study.
e. Comparative study of all filters.
f. Color image processing .
4.IMAGE ENHANCEMENT: (By FREQUENCY Domain methods) Design of low pass, High pass, EDGE Enhancement, smoothing
filters in frequency domain. Butter Worth Filter, Homomorphic filters in frequency domain, Advantages of filter in frequency domain,
Comparative study of filters in frequency domain and spatial domain .
5.IMAGE COMPRESSION: Definition: A brief discussion on - run length encoding, contour coding ,Huffman code. Compression
due to change in domain, Compression due to unitization ,Compression at the time of image transmission. Brief discussion on image
compression standards.
6.IMAGE SEGMENTATION: Definition, Characteristics of segmentation .
Detection of discontinuities , There holding Pixel based segmentation methods. Region based segmentations methods-segmentation by pixel aggregation, segmentation by subregion aggregation histogram based segmentation, split and merge technique. Use of motion in segmentation (Spatial domain technique only).
7.MORPHOLOGY: Dilation, Erosion, Opening closing, Hit-and-miss transform, boundary extraction ,Region filling connected components, Thinning, Thickening ,Skeletons, Pruning Extensions to gray-scale images ,Applications of Morphology in LP.
TEXT BOOK:
Digital image processing Rafael C.Gonzalez and Richard E Woods Addision Wesley.
REFERENCE BOOKS:
1. Fundamentals of Electronic Image Processing By
Arthyr_R_Weeks,Jr.(PHI)
2. Image Processing ,Analysis, and Machine vision by Milan Sonka Vaclan Halavac Roger Boyle,Vikas Publishing House.
TOP
MCA 2.2.7 VISUAL PROGRAMMING LAB
Experiments using java AWT/swing (JFC)
Reading Data From Key Board
Handling Button, Labels, Text Fields, Text Areas, Scroll Bar
Handling Check Boxes, Radio, List Box, Sliders
Handling Menu
Handling Swing Components Like Progress Bars
Handling Databases Using JDBC Native Driver
Experiments using VC++
Reading Data From Key Board
Handling Buttons, Labels, Text Fields
Handling Check Boxes , Radio, List Box, Sliders.
Handling Menu, Tool Bars
File Handling
Internet Programming
Creative Active X Controls
Books:
VC++, Steven Holzner, BPB publisher
TOP
MCA 2.2.7 DBMS LAB
Instruction: 3 Periods Sessional Marks: 50
Univ.-Exam : 3 Hours Univ-Exam-Marks:100
Course Description: This course explores database programming using both native and embedded ANSI-standard Structured Query Language(SQL).Topics include enterprise database management systems , database middleware ,data definition language ,data manipulation language ,data control language , database queries reporting ,query optimization, and database views .Students assignment include database creation, query design and programming ,and database manipulation via embedded SQL calls from a programming language.
Course Goal: Successful graduates of this course should be able to :
· Understand the fundamentals of a relational database.
· Understand the fundamentals of client-server & multi-tiered applications;
· Understand the use of Structured Query Language (SQL)as a data definition language ,data manipulation language & data control language .
· Understand & write SQL/PL_SQL , queries to create ,report,& up date data in a relational database.
· Understand the purpose of and be able to create views, scripts, triggers , and transactions.
· Design entity relationship models for a business problem and develop a normalized database structured.
Using oracle under Windows platform and MYSQL under Linux/Unix platform
Reference Books:
1.Introdution to Relational Databases and SQL programming , Christopher Allen, Simon Chatwin, Catherine A,Vreary Tata McGraw -Hill
2 Oracle SQL and PL/SQl Hand book , John Adolph Palinski , Pearson Education
3 Oracle 9i PL/SQL programming, Scott Urman, Tata McGraw-Hill
4.MySQL: The Complete Reference , Vikram Vaswani,Tata McGraw-Hill
5.MySQL Bible ,Steve Suehring ,Wiley
TOP
MCA 3rd YEAR SYLLABUS
MCA 3.1.1. INFORMATION SYSTEMS CONTROL AND AUDIT
Introduction:
Overview of Information Systems auditing, Conducting an information systems Audit
(Chapters 1 and 2 of Ron Weber)
Management Control Framework:
Top Management Controls (Chapter 3 of Ron Weber)
Systems Development Management Controls (Chapter 4 of Ron Weber)
Application Control Framework:
Boundary Controls, Input Controls, Communication Controls, Processing Controls,
Database Controls, Output Controls (Chapter 10 to 15 of Ron Weber)
Generalized Audit Software, Utility Software, Expert Systems, Measures of Asset
Safeguarding and Data Integrity, Overview of the Effectiveness of System Evaluation
Process, Evaluation Process of System Efficiency. (Chapter 16,21,22 and 23 beginning
Topics of Ron Weber)
Text Book:
Information Systems Control and Audit by Ron Weber, Pearson Education
Chapters 1,2,3,4,10 to 15 all pages, Chapter 16, pp 661-678, 682-690
Chapter 21, pp 851-855, Chapter 22, pp 888-892, Chapter 23, pp 926-931
Additional Reading: CISSP Prep Guide, Wiley-dreamtech
TOP
MCA 3102 NETWORK SECURITY
INTRODUCTION: Terminology--notation-primer on networking-types of attacks-Layer
and cryptography-Authorization-Key Escrow-Viruses, worms and Trojan Horses-Multi
Level mode of security-legal issues.
CRYPTOGRAPHY: Introduction-Secret Key cryptography-Public Key Cryptography Hash
Algorithm-DES-IDEA-AES-Modes of Operations-Hashes and Message Digests-MD2-
MD4-MDS and SHA-1-RSA-Diffie-Hellamn-Digital Signature Standard(DSS)-Elliptic
Curve Cryptography.
AUTHENTICATION: Password based authentication-address based authentication-
Cryptographic authentication Protocols-Passwords as cryptographic keys-trusted
Intermediaries-certificate revocation-Multiple trusted Intermediaries-Session Key
Establishment-Delegation.
STANDARDS: Kerberos V4-Kerberos V5-Public Key Infrastructure-Real Time
Communication Security-IPsec: AH and ESP - IPsec: IKE - SSL/TLS
ELECTRONIC MAIL: E-Mail Security-PHM & S/MIME and PGP
TEXT BOOK:
1) Network Security Private Communication in a public world, Charlie Kaufman, Radia
Perlman & Mike Speciner, Pearson Education / Prentice Hall of India Private Ltd.
New Delhi. (Chapters: 1 to 6, 6, 13 to 22)
REFERENCE BOOKS:
2) Network Security Essentials Applications and Standards, William Stallings, Pearson
Education, New Delhi.
3) Cryptography and Network Security, Aml Kahate, Tata McGraw-Hill Pub company
Ltd., New Delhi
TOP
MCA 3.1.2 OBJECT ORIENTED SOFTWARE ENGINEERING
1. Software Engineering:
Software related problems, software engineering, concepts, development activities
2. Modeling:
Concepts, Modeling with UML.
3. Project Organization & Communication:
Project Organization & communication concepts and their activites
4. Requirements:
Requirements elicitation & its activities and managing requirements elicitation
5. Analysis:
Analysis overview, concepts, activities and managing analysis
6. System Design:
Design overview, concepts, and activities, addressing design goals and managing system design
7. Object Design:
Object reuse, its activities & managing reuse. Interface specification concepts & its activities and Managing object design
8. Testing:
Testing concepts, activities and managing testing
9. Software Configuration Management:
Configuration Management overview, concepts, activities and managing configuration management
Text Book:
Object-Oriented Software Engineering: Using UML, Patterns and Java, Bernd Bruegge and Allen H. Dutoit, 2nd Edition, Pearson Education Asia
Reference Book:
1. Object-Oriented Software Engineering: Practical software development using UML and Java Timothy C. Lethbridge and Robert Laganiere, McGraw-Hill Higher education
2. An Introduction to Object Oriented Systems Analysis and Design with UML and the Unified Process, Stephen R. Schach, Tata McGraw-Hill
TOP
MCA 3.1.4 EMBEDDED SYSTEMS ( Elective - II )
Examples of Embedded systems and Typical hardware
Hardware Fundamentals for Software Engineer and Advanced Hardware Fundamentals
Interrupts and Survey of software architectures.
Introduction to RTOS and More Operating System Services
Basic Design using RTOS
Embedded Software development tools and Debugging Techniques
TEXT BOOKS:
1. An Embedded Software Primer, David A. Simon, Pearson Education, Inc., 1999
2. Embedded Real Time Systems programming, Sriram V lyer and Pankaj Gupta, TMH, 2004
Reference Books:
1. Embedded Systems Design - A Unified Hardware/Software Introduction, Frank Vahid/Tony Givargis, John Wiley & Sons, Inc., 2002
2. Embedded Systems, Architecture, Programming and Design, Raj Hamal, TMH, 2003
TOP
MCA 3.1.4 EMBEDDED SYSTEMS ( Elective - II )
Examples of Embedded systems and Typical hardware
Hardware Fundamentals for Software Engineer and Advanced Hardware Fundamentals
Interrupts and Survey of software architectures.
Introduction to RTOS and More Operating System Services
Basic Design using RTOS
Embedded Software development tools and Debugging Techniques
TEXT BOOKS:
1. An Embedded Software Primer, David A. Simon, Pearson Education, Inc., 1999
2. Embedded Real Time Systems programming, Sriram V lyer and Pankaj Gupta, TMH, 2004
Reference Books:
1. Embedded Systems Design - A Unified Hardware/Software Introduction, Frank Vahid/Tony Givargis, John Wiley & Sons, Inc., 2002
2. Embedded Systems, Architecture, Programming and Design, Raj Hamal, TMH, 2003
TOP
MCA 3.1.4 NEURAL NETWORKS & FUZZY SYSTEMS
1. Neural Networks and Fuzzy Systems
Neural and Fuzzy Machine Intelligence, Fuzziness as Multivalence. The Dynamical - Systems Approach to Machine Intelligence, Intelligent Behavior as Adaptive Model- Free Estimation.
2. Neural Dynamics I: Activations and Signals
Neurons as Functions, Signal Monotonicity, Biological Activations and Signals, Neuron Fields, Neuronal Dynamical Systems, Common Signal Functions, Pulse - Coded Signal Functions.
3. Neuronal Dynamic II: Activation Models
Neuronal Dynamical Systems, Additive Neuronal Dynamics, Additive Neuronal Feedback - Additive Bivalent Models, BAM Connection Matrices, Additive Dynamic and Noise Saturation Dilemma, General Neuronal Activations: Cohen - Grossberg and Multiplicative Models.
4. Synaptic Dynamics I: Unsupervised Learning
Learning Encoding, Change, and Quantization, FourUnsupervlised Learning Laws, Probability spaces and random processes, Stochastic unsupervised learning and Stochastic Equilibrium, Signal Hebbian Learning, Competitive Learning, Differential Hebbian Learning, Differential Competitive Learning.
5. Synaptic Dynamics II: Supervised Learning
Supervised Functions Estimation, Supervised Learning as Operant Conditioning, Supervised Learning as Stochastic Pattern Learning with known class members, Supervised learning as stochastic Approximation, the Back propagation Algorithm.
6. Fuzziness Versus probability
Fuzzy Sets and Systems, Fuzziness in a Probabilistic world. Randomness vs. Ambiguity: Whether vs. How much, The Universe as a Fuzzy set, The Geometry of Fuzzy Set, The Geometry of fuzzy Sets: Sets as Points. The Fuzzy Entropy Theorem, the Subset hood theorem. The Entropy - Subset hood Theorem.
7. Fuzzy Associative Memories
Fuzzy Systems as between cube mappings, Fuzzy and neural Function Estimators, Fuzzy Hebb FAMs. Adaptive FAMs: Product - space Clustering in FAM Cells.
Text Book:
Neural Networks & Fuzzy Systems, Bark Kosko, PHI
Reference Books:
1. Neural network design, Hagan, Demuth and beale, Vikas
Publishing House
2. Fundamentals of Artificial Neural Networks, Mohamad
Hassoum. PHI
3. Fuzzy set theory & its application, H.J.Zimmerman Allied
Published Ltd.
TOP
MCA 3.1.4 BIOINFORMATICS ( ElectivII )
Motivation and Expectation:
Students are expected to know the fundamentals of Engineering in Medicine and biology, which is emerging as an interesting field. Students are expected to use The Internet extensively to understand the subject.
1. Introduction:
Definition, Sequencing, Biological sequence/structure, Genome Projects, Pattern Recognition and prediction, Folding problem, Sequence Analysis, Homology and Analogy.
2. Problem Information Resources Biological databases, Primary sequence databases, Protein Sequence databases, Secondary databases, Protein pattern databases, and Structure classification databases.
3. Genome Information Resources DNA sequence databases, specialized genomic resources
4. DNA Sequence analysis Importance of DNA analysis, Gene structure and DNA sequences. Features of DNA sequence analysis, EST (Expressed Sequence Tag) searches, Gene hunting, Profile of a cell, EST analysis, Effects of EST data on DNA databases
5. Pair wise alignment technique Database searching, Alphabets and complexity, Algorithms, Comparing two sequences, sub-sequences, Identity and similarity, The Dotplot, Local and global similarity, different alignment techniques, Dynamic Programming, Pair wise database searching.
6. Multiple sequences alignment Definition and Goal, The consensus, computational complexity, Manual methods, Simultaneous methods, Progressive methods, Databases of Multiple alignments and searching
7. Secondary database searching Importance and need of secondary database searches, secondary database structure and building a sequence search protocol
8. Analysis packages Analysis package structure, commercial databases, commercial software, comprehensive packages, packages specializing in DNA analysis, Intranet Packages, Internet Packages.
Text Books:
1. Introduction to Bioinformatics, T K Attwood & D J Parry-Smith, Addison Wesley Longman
Reference Books:
1. Bioinformatics- A Beginner's Guide, Jean-Michel Claveriw. Cerdric Notredame. WILEY Dream Tech India Pvt Ltd.
2. Sequence Analysis in A Nutshell, Scott Markel & Darryl Leon, O'REILLY
TOP
MCA 3.1.5 DATA WARE HOUSING AND DATA MINING ( Elective-III )
1. Introduction to Data Mining:
Motivation and importance, What is data Mining, Relational Databases, Data Warehouses, Transactional Databases, Advanced Database Systems and Advanced Data base Applications, Data Mining Functionalities, Interestingness of a pattern Classification of Data Mining Systems, Major Issues in Data Mining
2. Data Warehouse and OLAP Technology for Data Mining:
What is Data Warehouse? Multi-Dimensional Data Model, Data Warehouse Architecture, Data Warehouse Implementation, Development of Data Cube Technology, Data Warehousing to Data Mining
3. Data Preprocessing:
Why Pre-process the Data? Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and Concept Hierarchy Generation.
4. Data Mining Primitives, Languages and system Architectures:
Data Mining Primitives: What defines a Data Mining Task? A Data Mining query language, Designing Graphical User Interfaces Based on a Data Mining Query Language Architectures of Data Mining Systems.
5. Concept Description: Characterization and Comparison:
What is Concept Description? Data Generalization and summarization- based Characterization, Analytical Characterization: Analysis of Attribute Relevance, Mining Class Comparisons: Discriminating between different Classes, Mining Descriptive Statistical Measures in large Databases
6. Mining Association rule in large Databases:
Association Rule Mining, Mining Single-Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel Association rules from Transactional databases, Mining Multidimensional Association Rules from Relational Databases and Data Warehouses, From Association Mining to Correlation Analysis, Constraint-Based Association Mining.
7. Classification and Prediction:
Concepts and Issues regarding Classification and Prediction, Classification by Decision Tree Induction, Bayesian Classification , Classification by Back propagation, Classification Based on Concepts from Association Rule Mining, Other Classification Methods like k-Nearest Neighbor Classifiers, Case-Based Reasoning, Generic Algorithms, Rough Set Approach, Fuzzy Set Approaches, Prediction, Classifier Accuracy
8. Cluster Analysis:
What is Cluster Analysis? Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods
TEXT BOOK:
Data Mining Concepts and Techniques, Jiawei Han and Micheline Kamber, Morgan Kaufman Publications
Reference Books:
1. Introduction to Data Mining, Adriaan, Addison Wesley Publication
2. Data Mining Techniques, A.K.Pujari, University Press
TOP
MCA3.1.5 COMPUTER VISION AND PATTERN ANALYSIS
FUNDAMENTALS OF IMAGE PROCESSING
Image Acquisition, Definitions of Pixel, Gray Value, Sampling, Quantization, Histogram, Image Stretching, Distance and Connectivity, Image Smoothing Operation- Mean, Median, Mode Filters Edge Enhancement Filter- Directional Filter, Sobel, Robert. Definition of Image compression- Run Length Encoding method, Contour Encoding Method. Definition of Image Compression- Pixel based method of Segmentation.
MORPHOLOGICAL OPERATIONS
Definition of Thresholding, A few techniques of Thresholding, Importance of Binary Images, Erosion, Dilation, Opening, Closing, HIT-or-MISS Transformation, Thinning, Thickening, Skeletons, Pruning, Convex hull, Extensions to Gray-Sale Images, Applications of Gray-scale Morphology, Applications of Morphological Operations in Pattern Analysis.
SHAPE REPRESENTATION AND DESCRIPTIONS (Part-1)
Region Identification, Algorithm for Region Identification, Shape Representation and Description Chain Codes, Geometric Border Representation- Boundary Length , Curvature, bending Energy,
Signature, Chord Distribution, Fourier Transforms of Boundaries, Boundary Description using Segment Sequences, B-Spline Representation, Shape invariants.
SHAPE REPRESENTATION AND DESCRIPTIONS (Part-2)
Region Based Methods-Area-Algorithm for Calculation of Area, Euler's Number, Projection, Eccentricity, Elongatedness, Rectangularity, Direction Compactness, Detailed Discussion on Moments. Convex hull. Algorithms related to Convex Hull. Graph Representation- Algorithm for Skeleton, Algorithm for Graph Construction, Definition of Region Decomposition, Region Neighborhood Graphs, Shapes classes.
OBJECT RECOGNITION
Knowledge Representation, Statistical Pattern Recognition- Classification Principles, Classifier Setting, Classifier Learning, Syntactic Pattern Recognition- Grammars, and Languages, Syntactic Analysis, Syntactic Classifier, Recognition as Graph Matching- Isomorphism, Related Algorithms, Similarity of Graphs.
CLUSTER ANALYSIS
Definition, Hierarchal Clustering- Agglomerative Clustering Algorithms, Single- Linkage Algorithm, Complete Linkage Algorithm, Average- Linkage Algorithm, Ward's Method. Partitional Clustering- Definition , Forgy's Algorithm, K-Means Algorithm, Isodata Algorithm Applications in Pattern Analysis.
ARTIFICIAL NEURAL NETWORKS AND FUZZY LOGIC IN PATTERN ANALYSIS
Introduction to ANN, Architecture of ANN, Activation Functions, Training of ANN- Supervised, Unsupervised, Reinforced, Mc Culloch - Pitts Model, HEBBNET, ADELINE, Application of ANN in Pattern Analysis.
Definition and Brief Discussion about Fuzzy Logic, Fuzzy Sets, Application in Pattern Analysis.
Text Books:
1. Pattern Recognition and Image Analysis, Earl Gose, Richard Johnsonbaugh, Steve Jost,PHI.
2. Image Processing , Analysis and Machine Vision, Millan Sonka, Vaclav Hlavac VIKAS
Reference Books:
Introduction to Antification Neural Networks, S.N.Sivanandam,M.Paul Raj, VIKAS
TOP
MCA 3.1.5 Knowledge Management Elective-III
1. Introduction
Introduction to Knowledge Management, The Knowledge Edge , The Origin of Knowledge.
2. Implementing Knowledge Management
The 10-Step Knowledge Management Road Map.
3. The First Phase: Infrastructure Evaluation And Leverage
The Leveraged Infrastructure, Aligning Management and Business Strategy.
4. The Second Phase: KM System Analysis, Design and Development
The Knowledge Management Platform, Knowledge Audit and Analysis,
Designing the KM Team, Creating the KM System Blueprint, Developing the KM System.
5. The Third Phase: KMS Development
Prototyping and Development, Leadership and Reward Structures.
6. The Final Phase and Beyond: Measuring Real-Option Analysis for Performance
Real-Option Analysis for Knowledge Valuation
Text Books:
1. The Knowledge Management Toolkit, Amrit Tiwana, Person Education, Second Edition
2. Knowledge Management, Elias M.Awad, Hassan M. Ghaziri, Person Education
TOP
|
