DEPARTMENT OF COMPUTER SCIENCE AND APPLICATIONS DR. H. S. GOUR (CENTRAL) UNIVERSITY, SAGAR (M.P.

Revised Structure & Syllabus of MCA (w.e.f. from Session - 2010-2011)

MCA
Master of Computer Applications
II -Year (Semester III to IV)

2010-2011
DR. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.)

Revised Structure of MCA Syllabus (w.e.f. from 2009-2010)

First Year (Semester I)
Code Title L T P Credit Sessional Semester Total

CSA-C-121 CSA-C-122 CSA-C-123 CSA-C-124 CSA-C-125 CSA-C-126 CSA-C-127

Digital Electronics & Microprocessor Discrete Mathematics Computer Organization Introduction to Programming Using C++ Behavioral & Organization Science Lab-1I (C++ Programming) Minor Project Lab-1II(Assembly Language & Open Office / MS Office)

3 3 3 3 3 -

3 -

3 3

03 03 03 03 03 02 01

40 40 40 40 40 40 40 280 -

60 60 60 60 60 60 60 420 -

100 100 100 100 100 100 100 700

15 3 06 18 Total Load : 24 -

First Year (Semester II)

Code Title L T P Credit Sessional Semester Total

CSA-C-221 CSA-C-222 CSA-C-223 CSA-C-224 CSA-C-225 CSA-C-226 CSA-C-227

Data Structure Theory of Computation Business Communication Skills Data Base Management Operating System Lab-2I ( Data Structure Using C++) Lab-2II (DBMS-Using Oracle)

3 3 3 3 3 - 3 3 - 3 15 3 06 Total Load : 24

03 03 03 03 03 02 01 18 -

40 40 40 40 40 40 40 280 -

60 60 60 60 60 60 60 420 -

100 100 100 100 100 100 100 700 -

Second Year (Semester III)

Code CSA-C-321 CSA-C-322 CSA-C-323 CSA-C-324 CSA-C-325 CSA-C-326 CSA-C-327 Title Management Information System Computer Networking and Internet Computer Graphics And Animation OOPs using Core JAVA (A) Probability , Combinatory and Statistics (B) Maths Lab- 3I Core Java Programming Lab 3II Networking Wireless and Cabled
L T P Credit Sessiona l Semest er Total

3 3 3 3 3

3 3

03 03 03 03 03 02 01 18 -

40 40 40 40 40 40 40 280 -

60 60 60 60 60 60 60 420 -

100 100 100 100 100 100 100 700

- 3 - -

15 3 06 Total load 24 -

Second Year (Semester IV)

Code CSA-C-421 CSA-C-422 CSA-C-423 CSA-E424 CSA-E425 CSA-E-426 CSA-E-427 CSA-E-428 CSA-C-429 CSA-C-430 Title Operation Research-Quantitative Techniques Software Engineering Decision Support System Elective -3-I a. Parallel Computing b. Compiler Design Elective 3-II a. Image processing b. Data Ware House c. Simulation and Modeling Lab -4I Based on Elective I Lab -4II Based on Elective II
L T P Credit Sessio nal Semes ter Total

3 3 3 3 3

03 0 03 03 03 03 40 40 40 40

60 60 60 60 60

100 100 100 100 100

3 3 3 15 3 06 Total load 24

02 01 18 -

40 40 280 -

60 60 420 -

100 100 700 -

Third Year (Semester V)

Code CSA-C-521 CSA-C-522 CSA-C-523 CSA-E-524 CSA-E-525 CSA-E-526 CSA-E-527 CSA-E-528 CSA-E-529 CSA-C-530 CSA-C-531 Title Systems Programming Object Oriented Programming And Design with UML UNIX and Shell Programming Elective -3-I a. Distributed Systems b. AI and Expert System c. Multimedia and web Technology Elective 3-II a. Bio-Informatics b. Data Mining c. Mobile Computing Lab -5I Based on Elective I Minor Project Lab -5II Based on Elective II Minor Project
L T P Credit Sessio nal Semes ter Total

3 3 3 3

03 03 03 03

40 40 40 40

60 60 60 60

100 100 100 100

03

40

60

100

3 -

3 3

02 01 18 -

40 40 280 -

60 60 420 -

100 100 700 -

15 3 06 Total load 24

Third Year (Semester VI) Major Project based on curriculum at Industry

Code CSA-C-621 Title
L T P Credit Sessio nal Semes ter Total

Major Project (External) Project / Dissertation 300 CSA-C-622 Comprehensive Viva based on project / dissertation 200 CSA-C-623 Seminar and Group Discussion (External) TOTAL GRAND TOTAL CSA-C SLN Example for course CSACSLN CSA Computer Science and Applications C - Core Course E - Elective S - Semester L - Label (0 Diploma, 1 UG, 2 PG, 3-M. Phil, 4- Ph. D.) N - Paper Number

06 15 06

300 200 200

27 700 147 - 4200 for elective course -CSAESLN

(Prof. R. S. Kasana)
Head

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA I SEMESTER) DIGITAL ELECTRONICS & MICROPROCESSOR CSA-C-121 UNIT I : Max Marks : 60 Fundamental Concepts : Introduction, Digital signal, Analog signal, Basic digital Circuits, AND, OR, NOT, NAND, NOR, Exclusive OR, Exclusive NOR Operation, Boolean algebra, De-Morgans and Duality theorems, Timing diagram. Number System and Codes Introduction number system, Binary number system, Signed binary numbers, binary arithmetics, 1s Compliment, 2s Compliment. UNIT II : Combinational Ligic Design : Introduction, standard representation for logic functions, K-map representation, Simplification of logical function using K-map, minimization of logical function Dont care condition, half adder, full adder, half subtractor, full subtractor. Multiplexure and their use in combinational logic design, Demultiplexure and their use in combinational logic design, Digital comparators. UNIT III : Flip- Flops : Introduction, Clocked R-S Flip Flop, JK Flip Flop, D-Type Flip Flop, TType Flip Flop, Master Slave Flip Flop, Edge triggered Flip Flop, Applications of Flip Flops. Shift Registers and Counters, Ripple Counters, Synchronous Counters, Decoder and Encoder. UNIT IV : Introduction to Microprocessor : Components of Microprocessor, Intel 8085, ALU, Timing and Control Unit, Registers, Data and Address bus, Pin Configuration, FSW and Flags : States flag-carry, zero sign, parity , auxilary carry, Symbols and Abbreviations.

REFERENCE BOOKS : 1. Digital Computer Electronics, Malvino, THM New Delhi 2. Modern Digital Electronics, R. P. Jain. 3. Microprocessor Systems, B. Ram. 4. Digital Electronics Technology, D. C. Green, Wheeler and Company. 5. Digital Electronics Circuits and Systems, V. K. Puri, TMH, New Delhi 6. Digital Computer Fundamental, P. C. Barlee, International students Edition. 7. Digital Systems and Microprocessor, Douglas Hall, TMH. 8. Microprocessor Architecture, Programming and Applications, By Gaonkar, Wiley Eastern Publications. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA I SEMESTER) DISCRETE MATHEMATICS CSA-C-122 UNIT : I Max Marks : 60 Matrix Algebra : Definition and types of matrices, Matrices associated with given matrices viz transpose, conjugate, symmetric and skew symmetric, hermitian and skew hermitian matrices. Properties of matrix addition and matrix multiplication, matrix polynomials and matrix polynominal equations, principle of mathematical induction, miscellaneous problems and applications of matrices. UNIT : II Determinants : Definition, determinants of a square matrix of order one, two and three, Sarrus diagram, singular matrix, minors and cofactors, properties of determinants, evaluation of determinants by using their properties, applications, of determinants to coordinate geometry, area of a triangle, solution of linear equations in two and three variables (by Cramers rule) Adjoint and inverse of a matrix: Adjoint of a square matrix, inverse of a matrix, algorithm for finding the inverse of a square matrix, solving matrix equations elementary transformations or operations of a matrix. systems of simultaneous linear equations: Introduction, solution of a non-homogenous systems of linear equations, solutions when coefficient is (a) non-singular (b) singular, solution of a homogenous system of linear equations. UNIT : IV Special functions: Bessel function and its generating function, relation between J n(x) and J-n(x), Bessel functions of the orders zero, half and one, recurrence relations. Legendres polynomial and generating function, Roldrigues formula for Legendres polynomial, recurrence relations. Hermits polynomial and its generating function, recurrence relations. REFERENCE BOOKS : 1. Mathematical Methods, A. K. Mukhopadhyay, Wheeler Pub. Co. Ltd., New Delhi. 2. Mathematics, R. D. Sharma, Dhanpatl Rai Pub. (P) Ltd., New Delhi. 3. Discrete Mathematices N Ch S N Iyengar at.al., Vikas Publishing House Pvt. Ltd. 4. Introd. Methods of Numerical Analysis, S. S. Sastry, PHI., New Delhi. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

UNIT : III

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA I SEMESTER) COMPUTER ORGANIZATION CSA-C-123 UNIT I : Max Marks : 60 Basic structure of Computers: Types of Computer, functional units, Basic functional concepts, Bus structures, machine instruction and programs, numbers, arithmetic operations and characters, memory locations and addresses, memory operations, addressing modes subroutine. Processing Unit: Register and addresses, program flow control, I/O operations, subroutines, Input-Output Oroganization: Accessing I/O Devices, interrupts, directo memory access, busses, interface circuit, standard I/O interfaces. Memory systems: computer memory system and their characteristics, Semiconductor RAM/ROM memories, cache memories, Cache memory Principles Vitural memory, memory management requirement, error correction. Secondary Memory: Basic Concepts in memory tierarchy, Medias HDD, FDD, CD & DVD, pen drive and other Peripherials: Scanners, Sound Cards and Microphone Interface, Speaker Interfaces, Modems, Their characteristics and working.

UNIT: II

UNIT : III

UNIT: IV

REFERENCE BOOKS: 1. Computer Organization, Carl Hamacher, 5/e Mc-Graw Hill, 2. Structured Computer Organization, A. S. Tenenbaum, PHI. 3. Computer Organization, W. Stallings, PHI. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

CSA-C-124 UNIT : I

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA I SEMESTER) OBJECT ORIENTED PROGRAMMING USING C++ Max Marks : 60

Introduction to C++ : C++ as multi-paradigm language, features supported by C++, Syntax, data-type, const and bool qualifiers, variables, strings, operators. Control Structures, Decision and Loop control statements. Modular program design using functions, Top down program design with examples, parameter passing mechanishms, inline functions, recursion, Arrays and pointers, dynamic arrays, structures and unions in C++, Coding style in C++.

UNIT : II

Object Oriented Programming C++: Abstraction, OOP concepts, Classes and objects, object creation, access specific-private, public and protected, constructors, default constructors, copy constructors, destructors, member functions, static members, references, Message communication using objects. Inheritance : Is-a Vs. Has-a relationships, simple inheritance- Class hierarchy, derived classes, Multiple inheritance, multileveled and hybrid inheritance, Abstract base classes, Composition and aggregation with example, polymorphism Compile time & run time polymorphisms, base class initialization, virtual functions and Dynamic Binding. Overloading: Function overloading and Operator overloading, Overloading Restriction, friends function, member operators, Operator function, Automatic conversions and Type Casts for classes.

UNIT : III

UNIT : IV

Memory Management in C++: new, delete, this pointer, Files in C++: Buffers, and the iostream File, redirection, streams and I/O streams classes, File Input and Output, Stream Checking and is_open(), Opening Multiple Files, Command-Line Processing, File Modes.

REFERENCE BOOKS : 1. Mastering C++, K. R. Venugopal, Rajkumar, & T. Ravi Shankar, TMH, New Delhi. 2. Object Oriented Programming with C++, David Parsons, Pearson Ducation. 3. A Complete reference to C++, H. schild, TMH. 4. Absolute C++, Walter Savitch, 2nd Edi. 2007, Pearson Education Inc., New Delhi. 5. Data Structure Using C & C++ by Yedidyah Langsam & M. J. Augenstein, 6. Int. to Programming Design and Data Structure by Thomas L Naps. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA I SEMESTER) BEHAVIORAL & ORGANIZATIONAL SCIENCE CSA-C-125 UNIT: I Max. Marks 60 Introduction to organizational behavior : The challenges facing management approach to organizational behavior. Theoretical framework of OB cognitive, behaviorist, social learning and organizational behavior frame work The early practice of management, organizational specialist, human relations movements, approaches to management, functions of a management. UNIT: II Organization: Organization structure, Common organizational design, New design options, authority and responsibility, centralization and decentralization, work design and technology requisite task attribute theory, Job characteristic model, social information process model. Conflict source and types of conflicts in organization, conflict management. Negotiation Bargaining policies, Negotiation process. UNIT: III Motivation : primary and secondary motives, Maslows theory of motivation, Hertzbergs two factor theory, Adams equality theory, McGregors theory X and theory Y. McClellands theory, leadership its theories and skills, Contemporary issues in leadership, trust and leaders. Job satisfaction: Measuring job satisfaction, outcome of job satisfaction, with respect to productivity, ternover, absenteeism, etc. UNIT: IV Job Enrichment : Job rotation, MBO techniques, Human resource policies and practices Training and development programme, Types of training &Training methods. Introduction of Communication Process and its benefits. Its significance in an organization.

REFERENCE: BOOKS: 1. Organizational Behavior, Fred Luthans, 2. Organizational Behavior Stephen P. Robbins, 10th Edition, Mc Graw Hill. 3. Principal of Management Koont Weihrich, Mc Graw Hill. 4. Principal of Management, Terry Franklin, AITBS, New Delhi. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA II SEMESTER) DATA STRUCTURE USING C++ CSA-C-221 UNIT I: Max. Marks 60 Arrays, Pointers & Functions : What is Array, Declaration of Array, Processing with Array, Initialization of Array, Use of Array in Function, Multidimensional Array. Pointer: Declaration of pointer, Pointers and functions (call by value, call by reference) Array of Pointers, Dynamic memory allocation, User Defined Function, Recursion. Stacks and Queues : Introduction to Stacks, Array implementation of Stack (Push & Pop operation on Stack), Linked Implementation (Push & Pop operations on Stack), Applications of Stack-Reversal of String. Queues Array implementation of Queue (Add, Delete operation in Queue) Linked List Implementation (Add, delete operation in queue), Circular Queue (Add operation in circular queue, Delete operation in Queue) Linked List & Trees : Introduction, Traversing a linked list, Searching a linked list, Insertion, Deletion operation in a linked list, Reverse linked list, Circular linked listcreation of circular linked list, traversing circular linked list, insertion in circular linked list, deletion in circular linked list. Double linked list Various operation in doubly linked list. Trees Introduction, Binary tree, Representation of Binary tree- Linked representation, Traversing in Binary tree, Binary Search Tree (Search And Insertion Operations, Deletion Operations), Traversing in Binary Search trees, Recursive Functions for finding a node in Binary search tree. UNIT IV: Sorting & Searching : Sorting - Efficiency parameters, efficiency of sorting, Bubble Sort, Selection sort, Insertion sort, Quick Sort, Heap Sort. Searching: What is searching, Linear search, Binary search, Comparison of Linear and Binary search.

UNIT II:

UNIT III:

REFERENCE: BOOKS: 1. Revi Chandran, Programming with c++, Tata Mc Hills 2. Jesse Liberty & Jim Keogh, C++: An Introduction to Programming, PHI. 3. Yadidyah Langsam, Moshe J Augenstein & Aaron M. Tenenbaum Data Structures using C and C++, PHI, Second Edi. 4. Budd T. A. , Classic Data Structures in C++, Addision Wesley, Reading Mass, 1999 5. Robert Sedgewick, Algorithms inC++ Addision Wesley, Pearson Education. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

CSA-C-222 UNIT: I

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA II SEMESTER) THEORY OF COMPUTATION Max. Marks 60 Sets, Relations and Functions, Graph and Trees, Strings and their properties, principle of induction. Definition of an automation, Description of a finite Automation, Transition systems, properties of Transition Functions, Acceptability of a string by a Finite Automation, Non deterministic Finite state machines, The equivalence of DFA and NDFA, Mealy and More models, Minimization of Finite Automata. Chomsky classification of Languages, Languages and their relation, Recursive and Recursively Enumerable sets, operation on Languages, Languages and Automata, Regular Expressions, Finite Automata and Regular Expressions, pumping Lemma for Regular sets, Applications of pumping Lemma, closure properties of Regular sets, Regular sets and Regular Grammars. Context-free languages and Derivation Trees, Ambiguity in context-free Grammars, simplification of context-free Grammars, Normal forms for context-free Grammars, pumping Lemma for context-free Languages, Decision Algorithms for context-free languages. Propositions, Normal forms of well-formed Formulas, Rule of Inference for propositional calculus, predicate Calculus, Rule of Inference for predicate Calculus. Turing machine model, Representation of Turing machines, Language Acceptability by Turing Machies. Universal Turing machine and other modifications.

UNIT: II

UNIT: III

UNIT: IV

REFERENCE: BOOKS: 1. Mishra K.L.P. and Sekaran N. Chandra, Theory of Computer Science PHI. 2. Hopcroff J. E. and Ul lman J. D., Introduction to Automata Theory, Languages and Computation, Narosa. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009.

Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA II SEMESTER) BUSINESS COMMUNICATION SKILLS CSA-C-223 UNIT: I Max. Marks 60 Meaning and process of communication, Importance of effective communication, situation, Communication skills, Barriers to communication, Objectives of communication, Types, Directions and Principles of communications, Essentials of effective communications. Oral communication skills, verbal and non verbal communication speaking, listening and notes taking skills, Presentation skills, body language, Voice-modulation, Written communication skills, letter writing, office correspondence. Business correspondence, presentation, presentation techniques, Objectives and Audience, Inclusion of diagrams, charts, graphs, figures etc. Preparing Bio-data, Types of Bio-Data, Reports, Abstract, Paper, Paper publication and reading, Surveys and Questionnaire for generating report. Interviewing: Types and principles of interviewing, Setting objectives for interview, Planning and preparation. Face-to-face skills. Common Abbreviations and Numerals of report writing and proof reading, Introduction of stress management and Brain storming, Team Skills: Group Discussion and its objectives. Web Communication techniques: e-mail and SMS etc

UNIT: II

UNIT: III

UNIT: IV

REFERENCE BOOKS: 1. Rodriques M.V., Effective Business Communication Concept Pub., New Delhi 2. Ludlow & Panton The Essence of Effective Communication PHI 3. Shrama & Mohan Business correspondence and Report writing Tata McGraw Hill. 4. Lesikar & Pettit, Business Communication,AITBS, New Delhi 5. Rai & Rai Business Communication Himalaya Pub. House. 6. Menzal and Jones,Writing a Technical Paper, McGraw Hill. 7. Turbin, KL.A Manual for Writers of Term Papers, Thesis & Dissertation, Univ. of Chicago Press. 1973. 8. Riordan & Pauley, Technical Report Writing Today, Biztantra, New Delhi This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

CSA-C-224 UNIT: I

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA II SEMESTER) DATA BASE MANAGEMENT Max. Marks 60 Introduction: Data & Information, Evolution of Database Systems, Overview of DBMS, Database System concepts & Architecutre- Data models, schemes and instances, Data Abstraction, Data Independence, Database languages and interfaces. Database Characteristics: Data modeling using Entity Relationship (ER) model : Entity sets, attributes and keys, Relationship types, sets, Database types : Relational, Hierarchical Network and Object Oriented. The Relational model: Relational data model concepts, Codds 12 rules. Relational model constraints and schemas, Relational Algebra and Relational calculus, Constraints on Relations, Relational database design by ER & EER to Relational Mapping, Database Languages SQL : SQL Programming Techniques:, Constraints and Triggers, Views and Indexes, Queries, (with Introduction to RDBMS : ORACLE / INGRES). Database Design: Data dependency, Functional dependencies and Normalization of Relational Databases, First, Second and Third Normal forms, Boyce-Codd Normal form (BCNF), Relational Database design Algorithms and further dependencies. Storage Strategies and file organizations: Disc storage, Basic File Structures and Hashing, Indexing structures for files, Multi-level indexing using B-trees and B+-Trees. Query Processing and Optimization: Evaluation of Relational Algebra Expressions, Query Equivalence, Join Strategies, Query Execution, Query Compiler. .

UNIT: II

UNIT: III

UNIT: IV

Transaction processing Concepts: Introduction to Transaction Processing concepts and Theory, ACID Properties, Concurrency Control, Serializability and Recoverability, Database Recovery Techniques- Shadow paging, ARIES recovery algorithm. Database Security, Deadlock: Detection, Avoidance and Recovery. Outline of : Information Integration, Data Mining, Data Warehousing and OLAP, Database Systems and the Internet, Searching Engines, Web Database, Distributed Databases, Mobile Databases, Multimedia Databases, GIS.

REFERENCE: BOOKS:
1. 2. 3. Ramez Elmasri and Shamkant B. Navathe, Fundamentals of Database Systems Fifth Edition (2007), Pearson Education Inc., New Delhi. Abraham Silberschatz, Henr F. Korth and S. Sudarshan, Database Systesm Concepts, 5 th Edi. (2006), McGraw Hill Education, New Delhi. Gary W.Hansen and James V. Hansen, Database Management and Design 2nd Edi. (2005), PHI, New Delhi.

This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA II SEMESTER) OPERATING SYSTEM CSA-C-225 UNIT-I: Max. Marks 60 Introduction to Operating System: Operating System: Introduction, Objectives and functions. Evolution of Operating System Process: Process Description and control, process definition, process states, two state & five state process model, process creation & termination. Scheduling and Memory Management: Scheduling: Types of scheduling, scheduling and performance criteria, scheduling algorithm, Memory Management: Memory partitioning, paging, segmentation, virtual memory. Concurrency and Synchronization: Interprocess communication and synchronization. Principles of concurrency, Mutual exclusion: Software approaches, hardware support, semaphores. Deadlock & starvation: Principles of deadlock, deadlock prevention, deadlock avoidance, deadlock detection and recovery, starvation. Input/Output and File Management: I/O Management: Principles of I/O hardware: I/O devices, I/O modules, I/O communication Techniques. Principles of I/O software: Goals, Interrupt handlers, device drivers. File Management: File system, file organization, file directories, file sharing, Record blocking, Error handling.

UNIT-II:

UNIT-III:

UNIT-IV:

REFERENCE: BOOKS: 1. William Stallings: Operating System, PHI 2. Silberschatz and Galvin: Operating System Concept, Addison Wesley 3. Tanenbaum, A.S., Modern Operating Systems, Prentice Hall of India Pvt. Ltd. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA II SEMESTER) Data Structure using C++ (Practical Question) CSA-C-226 Max. Marks 100 Array & pointer & function 1. Write a program to initialize two dimensional arrays and enter element in array. 2. write a program to addition of two matrix a element in array 3. Write a program to multiplication of two matrixes. 4. Write a program to fine largest and smallest element in array. 5. Write a program to initialize array using pointer. 6. Write a program to generate the Fibonacci Series with calling a function. 7. Write a program to swap values with calling function with passing argument by address (Reference). 8. Write a program to find factorial of given number using call function recursively. Stack & Queue 1. Write a program to implement stack and perform following operations I. Initialize stack II. Push Element III. Pop element IV. Check Empty V. Check Full. 2. Write a program to implement queue. Link list 1. Write a program to implement link list and perform its operation. 2. What are the steps to inserting a new item at the head of a linked list? 3. Perform operation in link list. a. Checking if the list is empty. b. Finding the length of the list. c. Retrieving an element from one end or a specified position in the list. d. Retrieving elements of the list from one end to the other (iteration). e. Removing an element at one end or a specified position in the list. f. Comparing elements. Tree 1. Draw a full binary tree with at least 6 nodes. 2. Here is a small binary tree:
14 / \ 2 11 /\ /\ 1 3 10 30 / / 7 40

Write the order of the nodes visited in: A. An in-order traversal B. A pre-order traversal C. A post-order traversal 3. Draw a new heap that is created by removing one item from the following heap:
910 / \

77 66 / \ / \ 68 1 3 11

Searching 1. Write a program to search element in list using sequential sorting method and print its position. 2. Write a program to search element in list using Binary searching method. 3. Write a program to search given elements of list and print its position. Sorting 1. Write a program to sort an array using quick sort, bubble, selection, insertion method. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009. Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - I YEAR (MCA II SEMESTER) DBMS (using Oracle) Practical Question CSA-C-227 Max. Marks 100 Q. 1 Concepts of Relational database. Q. 2 Relation types attributes and cardinality. Q. 3 Differences between SQL and PL/SQL. Q. 4 Concept of normalization for table creation. Q. 5 Solve the following query: Crate table for the data using SQL command. A> CUSTOMER CUST ID CUST NAME ADDRESS COUNTRY BEGINNING CURRENT BALANCE BALANCE 100 Watable Bros Box 241 Tokyo Japan 45,551 52,113 101 Maltzl Salzburg Austria 75,314 77,200 105 Jefferson B918 Chicago USA 49,333 57,811 110 Gomez Santiago Chile 27,400 35,414 B> SALESPERSON SALPERS ID SALPERS NAME MANAGER ID OFFICE COMM % 10 Rodney Jones 27 Chicago 10 14 Masaji Matsu 44 Tokyo 11 23 Francois Moire 35 Brussels 9 39 Goro Azuma 44 Tokyo 10 27 Terry Cardon Chicago 15 44 Albert Ige 27 Tokyo 12 35 Brigit Bovary 27 Brussels 11 12 Buster Sanchez 27 B. A. 10 C> PRODUCT PFOD ID PROD DESC MANUFACTR ID COST PRICE 1035 Sweater 210 1.25 2.00 2241 Table Lamp 317 2.25 3.25 2249 Table Lamp 317 3.55 4.80 2518 Brass Sculpture 253 .60 1.20 D> SALES DATE CUST ID SALPERS ID PROD ID QTY 02/28 100 10 2241 200 02/12 101 23 2518 300 02/15 101 23 1034 150 02/19 100 39 2518 200 02/02 101 23 1035 200 02/05 105 10 2241 100 02/22 110 37 2518 150 02/14 105 10 2249 50 02/01 101 23 2248 75 02/04 101 23 2241 250 E> MANUFACTURER MANUFACTR ID MANUFACTR NAME ADDRESS COUNTRY 210 Kiwi Clothes Auckland New Zealand

253 317

Brass Works Llama Llamas

Lagos Lima

Nigeria Peru

Q. 6 Solve the following query on the above created table. (i) Which salesperson has id 23? (ii) Give all information about the sales person Brigal Bovary? (iii) Who are the salesperson working for managers having an ID greater then or equal to 20? (iv) Give information as all salesperson except those in the Buenos Laires Office. (v) Which salesperson are getting less then 11% commission. (vi) Who are the salesperson in Tokyo getting more than 10% commission. (vii) Who is reporting to manages 27 a getting over 10% commission. (viii) Attach sales information to the information about sales people. (ix) What is the name of the customer involved in each sale. (x) Give the name of customer who have purchased product 2518. (xi) Who has brought table lamp. (xii) Which sales person have sold product manufactured in pune? (xiii) Identify sales person whose manger gets a commission sale exceeding 11%. (xiv) Lost salespeople who have sold every product. (xv) What us the maximum commission rate. (xvi) Who are the sales people in Tokyo office. (xvii) Give all attribute of salesperson in the Tokyo office. Q. 7 Customer (cust_id, Cust_name, Annuyal _Fevenue) SHIPMENT (Shipment_#, Cust_ID, Wehiht, Truch_#, Destination) A. Which customers have annual revenue exceeding $5 million? B. What is the name of customer 433? C. What is the destination city of shipment #3244? D. Which trucks have carried packages weighing over 100 pounds? E. What are the names of customers who have sent packages to Sioux City, Lowa? F. To what destinations have companies with revenue less than $1 million sent packages? Use this relational schema for the following set of quarries: CUSTOMER (CUST_ID, CUST_NAME, ANNUAL_REVENUE) SHIPMENT (SHIPMENT_#, CUST_ID, WEIGHT_ TRUCK_#, DESTINATION) Foreign Key : DESTINATION REFERENCES CITY_NAME IN CITY TRUCK (TRUCH_#, DIRIVER_NAME) CITY (CITY_NAME, POPULATION) Give relational algebra solutions to the following queries: A. A list of shipment numbers for shipments weighing over 20 pounds. B. Names of customers with more than $10 million in annual revenue. C. The driver of truck #45. D. The name of cities which have received shipments weighing over 100 pounds. E. The name and annual revenue of customers who have sent shipments weighting over 100 pounds. F. The truck numbers of trucks which have carried shipments weighing over 100 pounds. G. The names of drivers who have delivered shipments weighing over 100 pounds. H. Cities which have received shipments from customers having over $15 million in annual revenue.

Q. 8

Customers having over $5 million in annual revenue who have sent shipments weighing less than 1 pound. J. Customers having over $5 million in annual revenue who have sent shipments weighting less than 1 pound or have sent a shipment to San Francisco . K. Customers whose shipments have been delivered b truck driver Jensen. L. Drivers who have delivered shipments for customers with annual revenue over $20 million to cities with population over 1 million. M. Customers who have had shipments delivered by every driver. N. Cities which have received shipments from every customer. O. Drivers who have delivered shipments to every city. P. Customers who have sent shipments to every city with population over 500,000. (Hint: First create the set of cities with population over 500,000) Q. Give a list of customers and annual revenue for those customers whose annual revenue is the maximum for the customers in the database. R. Give a list of customers, all of whose shipments weight over 25 pounds. (Hint: First find customers who have at least one shipment less than 20 pounds). S. Give a list of customers that send all their shipments to a single city. (Note: The city may or may not be the same for each of these customers.) (Hint: first find customers that send shipments to more than one city) Q. 9 Create a mini project on mark sheet management system. Q. 10 Make a list of Data Control Statements of SQL with their applications. This course has been approved by the departmental council of Computer Science and Applications and its meeting held on 22/09/2009 with effect July 2009.

I.

Prof. R. S. Kasana
Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Smt. Shweta Ojha

Mr. Arvind Deshmukh Mr. Virendra Tiwari

Dr. Sanjay Thakur Dr. Saurabh Jain

Revised Structure of MCA Syllabus (w.e.f. from 2009-2010)

Second Year (Semester III)
Code CSA-C-321 CSA-C-322 CSA-C-323 CSA-C-324 CSA-C-325 CSA-C-326 CSA-C-327 Title Management Information System Computer Networking and Internet Computer Graphics And Animation OOPs using Core JAVA (A) Probability , Combinatory and Statistics (B) Maths Lab- 3I Core Java Programming Lab 3II Networking Wireless and Cabled L 3 3 3 3 3 T 3 P 3 3 Credit Sessi onal 03 40 03 40 03 40 03 40 03 40 02 01 18 40 40 280 Sem ester 60 60 60 60 60 60 60 420 Total 100 100 100 100 100 100 100 700

15 3 06 Total load 24 -

CSA-C-321 UNIT I :

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA III SEMESTER) MANAGEMENT INFORMATION SYSTEM Max Marks: 60 Management Information System : The General Management System, Control systems, MIS Planning, MIS Design and Development, Components of MIS, Open Systems v/s Closed Systems, Open Loop Control System v/s Closed Loop Control System, Information and Decision, MIS v/s EDP Systems, Role and Importance of MIS, MIS Organization, Stages of Growth of MIS, Management Control Systems. Definition of Office Automation, Need for Office Automation, Office Functions Needed to be Automated Office Automation Systems, Document Management Systems, Communication Systems, Teleconferencing Systems, Office Support Systems, Advantage of Office Automation, Disadvantages of Office Automation. Data and Information, Definition of Database Objectives of Database. Database Management System, Levels of Database. The Hierarchical, Network & Relational Structure. Object-Oriented Databases, Distributed Databases.

UNIT II :

UNIT III : Information Resource Management, Business Processes v/s Information Systems, Information Systems for Management, Transaction Processing System, Management Report System, Office Information System, Operational Control and Research Systems, Decision Support Systems, Knowledge Based Systems, Data Warehousing, OLAP (Online Analytical Processing), data Mining, Management Levels v/s information systems, Enterprise Wide information systems, Latest Trends in information systems. UNIT IV : Information System as a System, software Development Life Cycle (SDLC) Systems Analyst, Case Scenario, Feasibility Study, Systems Analysis (Requirement Analysis), Data Flow Diagram, Data Dictionary, Process Description, Software Requirement Specifications (SRS), Systems Design, Structure Charts, Input and Output Design, Development, Testing, Implementation and Maintenance, IS security, Information System vulnerability and computer Crime. REFERENCE BOOKS : 1. Ashok Arora, Akshaya Bhatia, Information Systems for Managers, Ist Edi. Excel Books. 2. Kenneth C. Handan, Java P Landan, Management Information System, 8 Edi. Prentice Hall. 3. Murdick R. G., Ross J. E. & Claggiest J. R., Information System for Modern Management PHI, 1997. 4. James A. O. Brien, Management Information System Golgotha, Publication, 1999. 5. Locus, Analysis, Design and Implementation of information System, 3rd Edi. McGraw Hill. 6. Anderson Lavid, Management Information System, Tata McGraw Hill, 1999. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Mr. Prashant Tiwari Ms. Neetu Chourasia Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar Ms. Poorwa Jain Mr Ravi Shankar Singh Mr. Vijay Yadav Ms. Rolee Pandey Ms. Vijya Jagati Ms. Priyanka Mukhraiya

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA III SEMESTER) COMPUTER NETWORKING AND INTERNET CSA-C-322 UNIT I : Max Marks : 60 Network Fundamentals : Introduction and Applications of Computer Network, Structure of the communication network, Network topologies, Transmission media, LAN, WAN, MAN, IEEE LAN Standards, Digital and Analog transmission, Switching techniques.. Communication among the computers; Traffic Control and Accountability, ConnectionOriented and connection less Networks, Classification of Communication protocols. Pooling / Selection system, Selective and group Polling, Stop and Wait Polling/ Selection, Continuous ARQ (Sliding Windows). Introduction to standards Organization and the Open System Interconnection model (OSI), Transmission Control Protocol/ Internet Protocol (TCP/IP), TCP/IP Internetworking, TCP/IP Operations, Introduction of user data gram protocol (UDP) . Digital Networks Introduction and Advantage of Digital System, Signal Conversion, digital carrier systems, Analog to Digital Techniques, Digital Switching, Integrated Service, Digital network (ISDN). Network Security Cryptography, Electronic mail and World Wide Web (WWW) Introduction to mobile computing and Ad-hoc Networks. REFERENCE BOOKS : 1. U. Black, Computer Networks Protocols, Standards and Interfaces IInd Edition PHI. 2. A. S. Tanenbaum: Computer Networks- Protocol, Standards & Interfaces PHI. 3. W. Stallings: Data and Computer Communications (4thed) PHI. 4. Douglas E. Comer Computer Networks & Internets Low Price Edition, Pearson Edu. Asia P. Ltd. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

UNIT II :

UNIT III :

UNIT IV :

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

CSA-C-323 UNIT I :

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA III SEMESTER) COMPUTER GRAPHICS AND ANIMATION Max Marks : 60 Introduction to Computer Graphics, Types of refresh graphics displays, Interactive devices, CRT. Raster scan graphics : Video basics, Scan conversion. Line drawing algorithms: Digital Differential Analyzer, Bresenhams algorithm. Polygon filling, edge fill algorithm, seed fill algorithm. Introduction to clipping: 2D clipping : line clipping algorithms Cohen-Sutherland, Line sub-division algorithm, Mid point sub-division, CyrusBeck algorithm. 2D-Parameteric clipping. Introduction to 3D Clipping. Hidden line & Hidden surfaces: Floating Horizon algorithms: Upper Horizon and Lower Horizon, Roberts algorithm, Warnock algorithm, Weiler- Atherton algorithm, Z-buffer algorithm. Rendering Illumination model: Surface normal, Reflection vector, Effect of Ambient Object, Specular Reflection, Halfway vector. Shading, Ray tracing, color.

UNIT II :

UNIT III :

UNIT IV :

REFERENCE BOOKS : 1. Rogers, D. F. Procedural Elements for computer graphics . McGraw Hill, 2008 2. Hearon, D. and Baker,M. Computer Graphics PHI, 2008. 3. Asthana, R. G. S. and Sinha, N. K. Computer Graphics, New Age international , 2005. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari Ms. Neetu Chourasia

Ms. Poorwa Jain Mr Ravi Shankar Singh

Mr. Vijay Yadav Ms. Rolee Pandey

Ms. Vijya Jagati Ms. Priyanka Mukhraiya

CSA-C-324 UNIT: I

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA III SEMESTER) OOPS USING CORE JAVA Max Marks: 60

Introduction: History of JAVA, Java as an OOPS Language: Java Buzzword, Java Virtual Machine; An overview of Java, Basis of Typical Java Environment, Keyword, Data-Types, Variables, Operators, Control Structures.

UNIT: II Introducing Classes: Classes, Declaring Objects, Access Specifies, Constructors, Inheritances, Using Super, Dynamic Methods, Strings and Characters Class. Interfaces: Defining an Interface, Implementing & Applying Interfaces, Variables in Interfaces, Extending Interfaces. UNIT: III Multithreading and Exception Handling: Basic Idea of Multithreaded Programming, The Lifecycle of a Thread, Creation Thread with the Thread Class and Runnable Interface; Thread Synchronization; Thread Scheduling, Basic Idea of Exception Handling, The Try, Catch and Thread Throws Constructor and Finalize in Exception Handling. UNIT: IV Applets: Applet Basis, Applets Class, Architecture, Initialization and Termination, Overriding update, Display Methods, Banner Applet, Status Window, HTML Applet Tag, Input/ Output, JDBC.
REFERENCE BOOK:

1. Herbert Schildt,The Complete Reference JavaTM 2, Tata McGrow-Hill 2. Deital Java How to Program, Pearson Education. 3. Steve Holzner, Java 2 Black Book, Paraglyph Press This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA III SEMESTER) PROBABILITY COMBINATIORICS & STATISTICS CSA-C-325 Max Marks: 60 UNIT I : Sample Space, Events, probability axioms, Law of addition of Probability, Law of Multiplication of Probability. Joint probability, conditional probability bayes rule. Random Variables: Discrete and Continuous, Probability Mass function, Probability Density Functions, Expectation. UNIT II : Basic Statistics : Measure of central tendencies, measures of dispersion . Theory of least square and Line fitting, correlation Coefficient, Rank Correlation and its coefficient, Regression Coefficient of determination, Sampling: Theory of sampling, population and sample survey methods. Permutation and Combination: Distinct & non-distinct object, Generating functions for combinations. Enumerators for permutations, Distribution of distinct objects.

UNIT III : UNIT IV :

Recurrence Relations : Linear & with two indices. Principles of inclusion & exclusion. Formula derangement, Restrictions on relative position. REFERENCE BOOKS : 1. Ross, S., A first course in probability, Collier Macmillan, New Your, 1976. 2. Lilu, C. L., Introduction to combinatorial Mathematics, McGraw Hill, 1996. 3. Hogg, R. V. Et., Al., Introduction to Mathematical statistics, American Pub., N York. . This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA III SEMESTER) LAB- 3I : CORE JAVA PROGRAMMING CSA-C-326 Max Marks: 100 1. Java programs using classes & objects and various control constructs such as loops etc, and data structures such as arrays, structures and functions (Any Five). 2. Develop a simple OPAC system for library using even-driven and concurrent programming paradigms of Java. Use JDBC to connect to a back-end database. 3. Develop multi-threaded echo server and a corresponding GUI client in Java. 4. Java programs for creating Applets for display of Images ,Texts and Animation 5. Development of Web site for the college or newspaper agency. 6. Develop Rational number class in Java. Use Java Doc comments for documentation. Your implementation should use efficient representation for a rational number, i.e. (500 / 1000) should be represented as (). 7. Develop Date class in Java similar to the one available in java. util package. Use Java Doc comments. 8. Implement Lisp-like list in Java. Write basic operations such as 'car', 'cdr', and 'cons'. If L is a list [3, 0, 2, 5], L.car() returns 3, while L.cdr() returns [0,2,5]. 9. Design a Java interface for ADT Stack. Develop two different classes that implement this interface, one using array and the other using linked-list. Provide necessary exception handling in both the implementations. 10. Design a Vehicle class hierarchy in Java. Write a test program to demonstrate polymorphism. 11. Design classes for Currency, Rupee, and Dollar. Write a program that randomly generates Rupee and Dollar objects and write them into a file using object serialization. Write another program to read that file, convert to Rupee if it reads a Dollar, while leave the value as it is if it reads a Rupee. 12. Design a scientific calculator Java. 13. Write a multi-threaded Java program to print all numbers below 100,000 that are both prime and fibonacci number (some examples are 2, 3, 5, 13, etc.). Design a thread that generates prime numbers below 100,000 and writes them into a pipe. Design another thread that generates fibonacci numbers and writes them to another pipe. The main thread should read both the pipes to identify numbers common to both. [Mini-Project] Develop a programmer's editor in Java that supports syntax-highlighting, compilation support, debugging support, This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

CSA-C-327 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA III SEMESTER) LAB 3II NETWORKING WIRELESS AND CABLED Max Marks: 100

Study the physical media of connectivity. Study the pin-structure of cross-over cable. Study the different LAN Technologies. Study the functioning of a Switch. Study the Functioning of a Router. Establishing LAN (Star topology) for your LAB using Hubs Study and install the media converting using optical fiber. Install and configure the LAN card. Install and configure window NT (2000 & 2003) Server. Study and implement the virtual network.

This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

Second Year (Semester IV)

Code CSA-C-421 CSA-C-422 CSA-C-423 CSA-E424 CSA-E425 CSA-E-426 CSA-E-427 CSA-E-428 CSA-C-429 CSA-C-430 Title Operation Research-Quantitative Techniques Software Engineering Decision Support System Elective -3-I d. Parallel Computing e. Compiler Design Elective 3-II d. Image processing e. Data Ware House f. Simulation and Modeling Lab -4I Based on Elective I Lab -4II Based on Elective II L 3 3 3 3 3 T P Credit Sessi Sem Total onal ester 03 40 60 100 03 03 03 03 40 40 40 40 60 60 60 60 100 100 100 100

3 3 3 15 3 06 Total load 24

02 01 18 -

40 40 280 -

60 60 420 -

100 100 700 -

CSA-C-421 UNIT I :

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA IV SEMESTER) OPERATION RESEARCH-QUANTITATIVE TECHNIQUES Max Marks: 60 Introduction : characteristics of O. R., Main Phases of O. R., Scope of O. R., Formulation of LPP, Graphical solution of two variable LP problems, Simplex method, Phase I and Phase II of the simplex method. Duality in LP: Formulation of dual problems, Dual simplex method, Transportation Problem and its solution, Assignment problem and its solution by Hungarian method integer programming: Branch and Bound method. Game theory: Solution of Two person-Zero-sum games, Solution of mixed strategy games, Inventory theory: Types of inventory, Inventory costs, single item deterministic models Economic lot size models without shortages and shortages having production rate infinite and finite. Queuing theory: Characteristics of queuing system, Steady state M/ M/ 1 and M/ M/ C queuing models. Replacement theory: Replacement of items that deteriorate of items that fail group replacement and individual replacement

UNIT II:

UNIT III:

UNIT IV:

REFERENCE BOOKS: 1. Kalavati S., Operation Research Vikas publishing house Pvt. Ltd. 2. Taha H. A. Operation Research An Introduction McMillan Publishing Co., New York. 3. H. S. Kasana and K. D. Kumar, Introductory Operation Research Springer International edition, Berlin (Germany) Ist Edi. 2004. 4. K. Swarup, P.K. Gupta & M. Mohan, Operations Research, S. Chand & Sons, 2003. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010.

Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

CSA-C-422 UNIT I :

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA IV SEMESTER) SOFTWARE ENGINEERING Max Marks: 60 Introduction to software engineering- Characteristics, Applications, crisis, problem and causes, software engineering paradigms, definitions, classic life cycles, models: prototyping, spiral, Linear sequential, RAD models, fourth generation techniques. Analysis concepts and principles: Communication techniques, analysis principals, software prototyping specifications, specification review. Analysis modeling: The elements of analysis model, data modeling, functional modeling and information flow. Behavioral modeling, mechanics of structured analysis, data dictionary. Design concepts and Principles: Software design and engineering, design process, design principles, design concepts, effective modular design, design heuristics, design model. Design methods: data design, architectural design, architectural design process, transform mapping, transaction mapping, design post processing, architectural design optimization, interface design, procedure design. Software testing: testing fundamentals, test case design, white box testing, basis path testing, control structure testing, black box testing. Strategic Approach to Testing: Unit Testing, Integration Testing, Validation Testing, System Testing, Debugging. Software Maintenance- Definition, Maintenance Characteristic, Maintainability, Maintenance Task, Maintenance side effects, Reverse Engineering and Re-Engineering.

UNIT II :

UNIT III :

UNIT IV :

REFERENCE BOOKS : 1. Roger S. Pressman, Software engineering a practitioners approach, MGH 2. Shoomar, Software Engineering, PHI 3. Award, System analysis and design, TMH 4. Beizerr, B. Software Testing Techniques, Van Nostrill and Reinhold. 5. Pressman, R. S., Software Engineering A practitioners Approach McGraw Hill. 6. Jalote, P., An Integrated Approach / to Soft. Engineering Narosa 1991. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

CSA-C-423 UNIT I :

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA IV SEMESTER) DECISION SUPPORT SYSTEM Max Marks : 60

Introduction to the concept of Decision Support System: Definition Need for Computerized DSS and support technology characteristics and capabilities of DSS. Components of DSS: Data management subsystem, Model Management Sub system knowledge management subsystem, User interface subsystem classification of DSS. DSS development Strategies: Development process, DSS technology levels & tools Algerias. & Hemistich: Tube search, genetic Algerias simulation. Introduction to artificial normal network, (NLP) Natural Language Processing and its applications. Introduction to data warehousing & Data mining: Data visualization & multi dimensionality. An overview of GDSS (Group Decision Support System) and Decision Conferencing. Introduction to Expert System and its Applications in Management. Introduction to GIS & Concept of virtual reality. Executive Information System (EIS), Expert System: Basic Concept structure and working..

UNIT II :

UNIT III :

UNIT IV :

REFERENCE BOOKS: 1. Bennry, J.L.: Building Decision Support System Addison Wesley Pub., Comp, 1983. 2. Sprague, R.H, & Watson, HJ (Edu.): Decision Support System, Putting Theory and Practices Prentice Hall, New Jersey, 1986. 3. Keen, P.G.W. & Morton, M, S, S,: Decision Support System: An organizational Perspective|, Addison Wesley Pub. 4. David: Applied Decision Support System, PHI., 1989. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA IV SEMESTER) PARALLEL COMPUTING (Elective 3-I-a) CSA-E-424 UNIT I : Max Marks: 60 Parallel Computer: Concept, need and requirement, various concepts in pipelining, issues involved in complex pipelining, configuring a parallel computer, Parallel Architecture: Vector processor, message passing and shared memory multiprocessors. Parallel Programming: Using sequential computing elements, data flow approach. Elementary Algorithms: Matrix manipulation, Graph connectivity and traversal, Tree traversal, Sorting and searching on PRAM. Complexity of Parallel algorithms: Various processor interconnection schemes : mesh, hypercube, perfect shuffle etc., High Performance Computing approach for complex problems: problems in Computational Geometry, Permutations and Combinations, Fourier transforms, traversing combinational spaces, Decision and Optimization. Software issues in Parallel computing: Parallelism in Prolog, Parallel programming environment, Case studies: Multidimensional Multilink System, Thread Simulation System

UNIT II :

UNIT III :

UNIT IV :

REFERENCE BOOKS : 1. Ratan Ghosh, Rajat Moona, Phalguni Gupta, Foundation of Parallel Processing NAROSA. 2. V. Rajaraman Elements of Parallel Computing PHI. 3. Selim Akl, The Design and Analysis of Parallel Algorithms, PHI. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

CSA-E425 UNIT I :

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA IV SEMESTER) COMPILER DESIGN (Elective 3-I-b) Max Marks: 60 Compiler Designing Phases: Analysis of a source program, Lexical Analysis, Syntax Analysis, Semantic analysis, Context free grammars ,software tools : LEX,YACC (Yet another compiler), parse tree, code generation and code optimization. Assembly language fundamentals(8085 based assembly language programming). Assembler -2 pass and single pass. Loading, linking, relocation, program delectability. Linkage editing. Text editor ,programming environment, debugger and program generators. Cross compiler, bootstrap compilers, top down and bottom up parses. Parallel virtual machine and message passing interface (MPI). Linker and Loader , Editor, Macros and Microprocessors, Intermediate code generation intermediate languages - declarations - assignment statements - Boolean expressions procedure calls .

UNIT II :

UNIT III :

UNIT IV :

REFERENCE BOOKS : 1. A..V. Aho, R. Sethi and J. D. Ullman, Compilers: Principles, Techniques, and Tools (US edition), Addison Wesley, 1986. 2. A. Holub, Compiler Design in C, Prentice-Hall of India, 2006. 3. R. Mak, Writing Compilers and Interpreters (2nd ed.), John Wiley & Sons, 1996. 4. D. Galles, Modern Compiler Design, Pearson Education, 2007. 5. S. Chattopadhyay, Compiler Design, Prentice-Hall of India, 2005. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA IV SEMESTER) IMAGE PROCESSING (Elective 3-II-a) CSA-E-426 Max Marks: 60 UNIT I : Fundamental Steps in Image Processing: Element of visual perception, a simple image model, sampling and quantization, some basic relationships between pixel, image geometry in 2D, image enhancement in the spatial domain. UNIT II :

Introduction to spatial and frequency methods : Basic gray level

transformations, histogram equalization, local enhancement, image subtraction, image averaging, basic spatial, filtering, smoothing spatial filters, sharpening spatial filters.

UNIT III :

Introduction to the fourier transformation: Discrete fourier transformation, fast

fourier transformation, filtering in the frequency domain, correspondence between filtering in the spatial and frequency domain smoothing frequency-domain filters, sharpening frequency-domain filters, homomorphic filtering, dilation and erosion, opening and closing, hit-or-miss transformation.

UNIT IV :

Some basic morphological algorithms: Line detection, edge detection, gradient

operator, edge linking and boundary detection, thresholding, region-oriented segmentation, representation schemes like chain codes, polygonal approximations, boundary segments, skeleton of a region, recognition and interpretation patterns and pattern classes, decisiontheoretic methods, introduction to neural network.

REFERENCES BOOKS: 1. Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing, PHI, 2002 2. William K. Pratt, Digital Image Processing: PIKS Inside (3rd ed.), John Wiley & Sons, Inc., 2001 3. Bernd Jahne Digital Image Processing, (5th revised and extended edition), Springer, 2002 4. S. Annadurai and R. Shanmugalakshmi, Fundamentals of Digital Image Processing, PHI, 2007 5. M.A. Joshi, Digital Image Processing: An Algorithmic Approach, PHI, 2006 6. B. Chanda and D.D. Majumder, Digital Image Processing and Analysis, PHI., 2007 This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

CSA-E-427 UNIT I :

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA IV SEMESTER) DATA WARE HOUSE (ELECTIVE 3 II-b) Max Marks: 60 Introduction And Data Warehousing : Introduction, Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Implementation, Further Development, Data Warehousing to Data Mining. Data Preprocessing, Language, Architectures, Concept Description: Why Preprocessing, Cleaning, Integration, Transformation, Reduction, Discretization, Concept Hierarchy Generation, Data Mining Primitives, Query Language, Graphical User Interfaces, Architectures, Concept Description, Data Generalization, Characterizations, Class Comparisons, Descriptive Statistical Measures. Association Rules: Association Rule Mining, Single-Dimensional Boolean Association Rules from Transactional Databases, Multi-Level Association Rules from Transaction Databases. Classification And Clustering : Classification and Prediction, Issues, Decision Tree Induction, Bayesian Classification, Association Rule Based, Other Classification Methods, Prediction, Classifier Accuracy, Cluster Analysis, Types of data, Categorisation of methods, Partitioning methods, Outlier Analysis.

UNIT II :

UNIT III :

UNIT IV :

REFERENCE BOOKS: 1. J. Han, M. Kamber, Data Mining: Concepts and Techniques, Harcourt India / Morgan Kauffman, 2001. 2. Margaret H.Dunham, Data Mining: Introductory and Advanced Topics, PHI.2004. 3. Sam Anahory, Dennis Murry, Data Warehousing in the real world, PHI, 2003. 4. David Hand, Heikki Manila, Padhraic Symth, Principles of Data Mining, PHI 2004. 5. W.H.Inmon, Building the Data Warehouse, 3rd Edition, Wiley, 2003. 6. Alex Bezon, Stephen J.Smith, Data Warehousing, Data Mining, MeGraw-Hill, 2001. 7. Paulraj Ponniah, Data Warehousing Fundamentals, Wiley-Interscience Publication, 2003. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.) MCA - II YEAR (MCA IV SEMESTER) SIMULAITON AND MODELLING (ELECTIVE 3 II-c) CSA-E-428 Max Marks: 60 UNIT I : System Models - Continuous and discrete models - Static and Dynamic Models Principles used in modeling - system studies - system analysis - design and postulation. System simulation : Techniques of simulation - Monte Carlo Method - Comparison of analysis and simulation - Types of system - Simulation Numerical UNIT II : Computation for simulation - Applications of digital analog and hybrid computers in continuous system simulation - Real time simulation. Exponential growth models, exponential decay models - Logistic curves -Generation of growth models - system models- system dynamic diagrams Multi segment models Representation of time - delay - Review of probability concepts Ar rival pattern and service times - poisson arrival patterns - Exponentiations, Erlang and Hyper Exponential Distribution - Mathematical studies of Queuing problems. Discrete system Simulation : Discrete events - Generation of arrival patterns - Simulation of telephone systems - Simulation languages - GPSS programming General description simscript programs, simscript system concept.

UNIT III :

UNIT IV :

REFERENCE BOOKS : 1. Banks, J, Carson S and Nilson B L, Discrete Event System Simulation PHI 2. Deo N System simulation with digital computers" PHI 3 Law A M and Kelton W D Simulation Modeling and analysis" Mc Graw Hill 4. Geoffrey Gordon., System simulation , Prentice Hall of India Pvt. Ltd.1999. 5 Maryanski F., Digital Computer Simulation , CBS Distributors. This course has been approved by the departmental council of Computer Science and Applications and is effective from July 2010. Prof. R. S. Kasana
Dr. R. K. Pathak Prof. & Head, Chairman Departmental Council Computer Science and Applications Dr. H. S. Gour Central University, Sagar

Mr. Prashant Tiwari

Ms. Poorwa Jain

Mr. Vijay Yadav

Ms. Vijya Jagati

Ms. Neetu Chourasia

Mr Ravi Shankar Singh

Ms. Rolee Pandey

Ms. Priyanka Mukhraiya