MCA Syllabus 2009 Centre University Onward

7/28/2019 MCA Syllabus 2009 Centre University Onward

1/36

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)

MCAMaster of Computer ApplicationsII -Year (Semester III to IV)

2010-2011DR. H. S. GOUR CENTRAL UNIVERSITY,

SAGAR (M.P.)


2/36

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 Digital Electronics &Microprocessor

3 - - 03 40 60 100

CSA-C-122 Discrete Mathematics 3 - - 03 40 60 100

CSA-C-123 Computer Organization 3 - - 03 40 60 100

CSA-C-124 Introduction to Programming UsingC++

3 - - 03 40 60 100

CSA-C-125 Behavioral & Organization Science 3 - - 03 40 60 100

CSA-C-126 Lab-1I (C++ Programming) MinorProject

- 3 3 02 40 60 100

CSA-C-127 Lab-1II(Assembly Language &Open Office / MS Office)

- - 3 01 40 60 100

15 3 06 18 280 420 700

Total Load : 24 - - - -

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

CSA-C-221 Data Structure 3 - - 03 40 60 100

CSA-C-222 Theory of Computation 3 - - 03 40 60 100

CSA-C-223 Business Communication Skills 3 - - 03 40 60 100

CSA-C-224 Data Base Management 3 - - 03 40 60 100

CSA-C-225 Operating System 3 - - 03 40 60 100

CSA-C-226 Lab-2I ( Data Structure Using C++) - 3 3 02 40 60 100

CSA-C-227 Lab-2II (DBMS-Using Oracle) - - 3 01 40 60 100

15 3 06 18 280 420 700

Total Load : 24 - - - -

Second Year (Semester III)Code Title L T P Credit Sessiona

l

Semest

er

Total

CSA-C-321 Management Information System 3 - - 03 40 60 100

CSA-C-322 Computer Networking and Internet 3 - - 03 40 60 100

CSA-C-323 Computer Graphics And Animation 3 - - 03 40 60 100

CSA-C-324 OOPs using Core JAVA 3 - - 03 40 60 100

CSA-C-325 (A) Probability , Combinatory andStatistics(B) Maths

3 - - 03 40 60 100

CSA-C-326 Lab- 3I Core Java Programming - 3 3 02 40 60 100

CSA-C-327 Lab 3II Networking Wireless andCabled

- - 3 01 40 60 100

15 3 06 18 280 420 700

Total load 24 - - - -


3/36

Second Year (Semester IV)Code Title L T P Credit Sessio

nal

Semes

ter

Total

CSA-C-421 Operation Research-QuantitativeTechniques

3 - - 030

60 100

CSA-C-422 Software Engineering 3 - - 03 40 60 100

CSA-C-423 Decision Support System 3 - - 03 40 60 100

CSA-E424CSA-E425

Elective -3-Ia. Parallel Computingb. Compiler Design

3 - - 03 40 60 100

CSA-E-426CSA-E-427CSA-E-428

Elective 3-IIa. Image processingb. Data Ware Housec. Simulation and Modeling

3 - - 03 40 60 100

CSA-C-429 Lab -4I Based on Elective I - 3 3 02 40 60 100

CSA-C-430 Lab -4II Based on Elective II - - 3 01 40 60 100

15 3 06 18 280 420 700


Third Year (Semester V)Code Title L T P Credit Sessio

nal

Semes

ter

Total

CSA-C-521 Systems Programming 3 - - 03 40 60 100

CSA-C-522 Object Oriented Programming AndDesign with UML

3 - - 03 40 60 100

CSA-C-523 UNIX and Shell Programming 3 - - 03 40 60 100

CSA-E-524

CSA-E-525CSA-E-526

Elective -3-Ia. Distributed Systems

b. AI and Expert Systemc. Multimedia and web

Technology

3 - - 03 40 60 100


Elective 3-IIa. Bio-Informaticsb. Data Miningc. Mobile Computing

3 - - 03 40 60 100

CSA-C-530 Lab -5I Based on Elective I MinorProject

- 3 3 02 40 60 100

CSA-C-531 Lab -5II Based on Elective II MinorProject

- - 3 01 40 60 100

15 3 06 18 280 420 700Total load 24 - - - -


4/36

Third Year (Semester VI)

Major Project based on curriculum at IndustryCode Title L T P Credit Sessio

nal

Semes

ter

Total

CSA-C-621 Major Project (External) Project /Dissertation 300

- - - 06 - - 300

CSA-C-622 Comprehensive Viva based on

project / dissertation 200

- - - 15 - - 200

CSA-C-623 Seminar and Group Discussion(External)

- - - 06 - - 200

TOTAL - - - 27 - - 700

GRAND TOTAL - - - 147 - - 4200

CSA-C SLN Example for course CSACSLN for elective course -CSAESLNCSA Computer Science and ApplicationsC - Core CourseE - ElectiveS - Semester L - Label (0 Diploma, 1 UG, 2 PG, 3-M. Phil, 4- Ph. D.)

N - Paper Number(Prof. R. S. Kasana)

Head


5/36

Dr. H. S. GOUR CENTRAL UNIVERSITY, SAGAR (M.P.)

MCA - I YEAR (MCA I SEMESTER)

DIGITAL ELECTRONICS & MICROPROCESSOR

CSA-C-121 Max Marks : 60

UNIT I : Fundamental Concepts : Introduction, Digital signal, Analog signal, Basic digitalCircuits, 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, Signedbinary 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 oflogical function Dont care condition, half adder, full adder, half subtractor, full subtractor.

Multiplexure and their use in combinational logic design, Demultiplexure and their use incombinational logic design, Digital comparators.

UNIT III : Flip- Flops : Introduction, Clocked R-S Flip Flop, JK Flip Flop, D-Type Flip Flop, T-Type Flip Flop, Master Slave Flip Flop, Edge triggered Flip Flop, Applications of Flip

Flops.

Shift Registers and Counters, Ripple Counters, Synchronous Counters, Decoder andEncoder.

UNIT IV : Introduction to Microprocessor : Components of Microprocessor, Intel 8085, ALU,Timing and Control Unit, Registers, Data and Address bus, Pin Configuration, FSW andFlags : States flag-carry, zero sign, parity , auxilary carry, Symbols and Abbreviations.

REFERENCE BOOKS :

1. Digital Computer Electronics, Malvino, THM New Delhi2. 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 Delhi6. 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 Applicationsand its meeting held on 22/09/2009 with effect July 2009.

Prof. R. S. KasanaProf. & Head, Chairman Departmental CouncilComputer Science and Applications

Dr. H. S. Gour Central University, Sagar

Dr. R. K. Pathak Mr. Arvind Deshmukh Dr. Sanjay Thakur

Smt. Shweta Ojha Mr. Virendra Tiwari Dr. Saurabh Jain


6/36



DISCRETE MATHEMATICS


UNIT : I Matrix Algebra : Definition and types of matrices, Matrices associated with givenmatrices viz transpose, conjugate, symmetric and skew symmetric, hermitian and skew

hermitian matrices.Properties of matrix addition and matrix multiplication, matrix polynomials and matrixpolynominal equations, principle of mathematical induction, miscellaneous problems andapplications 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 tocoordinate geometry, area of a triangle, solution of linear equations in two and threevariables (by Cramers rule)

UNIT : III 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 elementarytransformations or operations of a matrix.

systems of simultaneous linear equations: Introduction, solution of a non-homogenoussystems 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 Jn(x) andJ-n(x), Bessel functions of the orders zero, half and one, recurrence relations. Legendrespolynomial 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.


Prof. R. S. Kasana

Prof. & Head, Chairman Departmental CouncilComputer Science and Applications





7/36



COMPUTER ORGANIZATION


UNIT I : Basic structure of Computers: Types of Computer, functional units, Basic functionalconcepts, Bus structures, machine instruction and programs, numbers, arithmetic

operations and characters, memory locations and addresses, memory operations,addressing modes subroutine.

UNIT: II Processing Unit: Register and addresses, program flow control, I/O operations,subroutines, Input-Output Oroganization: Accessing I/O Devices, interrupts, directomemory access, busses, interface circuit, standard I/O interfaces.

UNIT : III Memory systems: computer memory system and their characteristics, SemiconductorRAM/ROM memories, cache memories, Cache memory Principles Vitural memory,

memory management requirement, error correction.

UNIT: IV 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.

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.


Prof. R. S. KasanaProf. & Head, Chairman Departmental Council

Computer Science and ApplicationsDr. H. S. Gour Central University, Sagar




8/36



OBJECT ORIENTED PROGRAMMING USING C++


UNIT : I 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 usingfunctions, Top down program design with examples, parameter passing mechanishms,inline functions, recursion, Arrays and pointers, dynamic arrays, structures and unions inC++, 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, defaultconstructors, copy constructors, destructors, member functions, static members, references,Message communication using objects.

UNIT : III Inheritance : Is-a Vs. Has-a relationships, simple inheritance- Class hierarchy, derivedclasses, Multiple inheritance, multileveled and hybrid inheritance, Abstract base classes,

Composition and aggregation with example, polymorphism Compile time & run timepolymorphisms, 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 TypeCasts for classes.

UNIT : IV Memory Management in C++: new, delete, this pointer, Files in C++: Buffers, and theiostream File, redirection, streams and I/O streams classes, File Input and Output, StreamChecking 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.



Computer Science and Applications





9/36



BEHAVIORAL & ORGANIZATIONAL SCIENCE

CSA-C-125 Max. Marks 60

UNIT: I Introduction to organizational behavior : The challenges facing management approachto organizational behavior. Theoretical framework of OB cognitive, behaviorist, social

learning and organizational behavior frame workThe 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 designoptions, authority and responsibility, centralization and decentralization, work design andtechnology requisite task attribute theory, Job characteristic model, social informationprocess model.

Conflict source and types of conflicts in organization, conflict management. NegotiationBargaining 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 inleadership, trust and leaders.

Job satisfaction: Measuring job satisfaction, outcome of job satisfaction, with respect toproductivity, 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. Introductionof 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.







10/36


MCA - I YEAR (MCA II SEMESTER)

DATA STRUCTURE USING C++


UNIT I: Arrays, Pointers & Functions : What is Array, Declaration of Array, Processing withArray, Initialization of Array, Use of Array in Function, Multidimensional Array. Pointer:Declaration of pointer, Pointers and functions (call by value, call by reference) Array ofPointers, Dynamic memory allocation, User Defined Function, Recursion.

UNIT II: Stacks and Queues : Introduction to Stacks, Array implementation of Stack (Push & Popoperation 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)

UNIT III: Linked List & Trees : Introduction, Traversing a linked list, Searching a linked list,Insertion, Deletion operation in a linked list, Reverse linked list, Circular linked list-creation 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 linkedlist.

Trees Introduction, Binary tree, Representation of Binary tree- Linked representation,Traversing in Binary tree, Binary Search Tree (Search And Insertion Operations, DeletionOperations), Traversing in Binary Search trees, Recursive Functions for finding a node inBinary 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, Linearsearch, Binary search, Comparison of Linear and Binary search.

REFERENCE: BOOKS:1. Revi Chandran, Programming with c++, Tata Mc Hills2. 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, 19995. Robert Sedgewick, Algorithms inC++ Addision Wesley, Pearson Education.

This course has been approved by the departmental council of Computer Science and Applications and itsmeeting held on 22/09/2009 with effect July 2009.

Prof. R. S. Kasana

Prof. & Head, Chairman Departmental CouncilComputer Science and ApplicationsDr. H. S. Gour Central University, Sagar




11/36



THEORY OF COMPUTATION


UNIT: I Sets, Relations and Functions, Graph and Trees, Strings and their properties, principle ofinduction. Definition of an automation, Description of a finite Automation, Transition

systems, properties of Transition Functions, Acceptability of a string by a FiniteAutomation, Non deterministic Finite state machines, The equivalence of DFA and NDFA,Mealy and More models, Minimization of Finite Automata.

UNIT: II Chomsky classification of Languages, Languages and their relation, Recursive andRecursively Enumerable sets, operation on Languages, Languages and Automata, RegularExpressions, Finite Automata and Regular Expressions, pumping Lemma for Regular sets,Applications of pumping Lemma, closure properties of Regular sets, Regular sets andRegular Grammars.

UNIT: III 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-freelanguages.

UNIT: IV Propositions, Normal forms of well-formed Formulas, Rule of Inference for propositionalcalculus, predicate Calculus, Rule of Inference for predicate Calculus. Turing machinemodel, Representation of Turing machines, Language Acceptability by Turing Machies.Universal Turing machine and other modifications.

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.







12/36



BUSINESS COMMUNICATION SKILLS


UNIT: I 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.UNIT: II Oral communication skills, verbal and non verbal communication speaking, listening and

notes taking skills, Presentation skills, body language, Voice-modulation, Writtencommunication skills, letter writing, office correspondence. Business correspondence,presentation, presentation techniques, Objectives and Audience, Inclusion of diagrams,charts, graphs, figures etc.

UNIT: III Preparing Bio-data, Types of Bio-Data, Reports, Abstract, Paper, Paper publication andreading, Surveys and Questionnaire for generating report. Interviewing: Types andprinciples of interviewing, Setting objectives for interview, Planning and preparation.Face-to-face skills.

UNIT: IV Common Abbreviations and Numerals of report writing and proof reading, Introduction ofstress management and Brain storming, Team Skills: Group Discussion and its objectives.Web Communication techniques: e-mail and SMS etc

REFERENCE BOOKS:

1. Rodriques M.V., Effective Business Communication Concept Pub., New Delhi2. Ludlow & Panton The Essence of Effective Communication PHI3. Shrama & Mohan Business correspondence and Report writing Tata McGraw Hill.4. Lesikar & Pettit, Business Communication,AITBS, New Delhi5. 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







13/36



DATA BASE MANAGEMENT


UNIT: I 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. DatabaseCharacteristics: Data modeling using Entity Relationship (ER) model : Entity sets,attributes and keys, Relationship types, sets, Database types : Relational, HierarchicalNetwork and Object Oriented.

UNIT: II The Relational model: Relational data model concepts, Codds 12 rules. Relational modelconstraints and schemas, Relational Algebra and Relational calculus, Constraints onRelations, Relational database design by ER & EER to Relational Mapping, DatabaseLanguages SQL : SQL Programming Techniques:, Constraints and Triggers, Views andIndexes, Queries, (with Introduction to RDBMS : ORACLE / INGRES).

UNIT: III Database Design: Data dependency, Functional dependencies and Normalization ofRelational 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 andHashing, 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: IV Transaction processing Concepts: Introduction to Transaction Processing concepts andTheory, ACID Properties, Concurrency Control, Serializability and Recoverability,Database Recovery Techniques- Shadow paging, ARIES recovery algorithm. DatabaseSecurity, Deadlock: Detection, Avoidance and Recovery.

Outline of : Information Integration, Data Mining, Data Warehousing and OLAP,Database Systems and the Internet, Searching Engines, Web Database, DistributedDatabases, Mobile Databases, Multimedia Databases, GIS.

REFERENCE: BOOKS:1. Ramez Elmasri and Shamkant B. Navathe, Fundamentals of Database Systems Fifth Edition (2007), Pearson

Education Inc., New Delhi.2. Abraham Silberschatz, Henr F. Korth and S. Sudarshan, Database Systesm Concepts, 5 th Edi. (2006), McGraw Hill

Education, New Delhi.3. Gary W.Hansen and James V. Hansen, Database Management and Design 2nd Edi. (2005), PHI, New Delhi.







14/36



OPERATING SYSTEM


UNIT-I: Introduction to Operating System: Operating System: Introduction, Objectives andfunctions. Evolution of Operating System Process: Process Description and control,

process definition, process states, two state & five state process model, process creation &termination.

UNIT-II: Scheduling and Memory Management: Scheduling: Types of scheduling, schedulingand performance criteria, scheduling algorithm, Memory Management: Memorypartitioning, paging, segmentation, virtual memory.

UNIT-III: Concurrency and Synchronization: Interprocess communication and synchronization.Principles of concurrency, Mutual exclusion: Software approaches, hardware support,semaphores. Deadlock & starvation: Principles of deadlock, deadlock prevention, deadlockavoidance, deadlock detection and recovery, starvation.

UNIT-IV: 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, filedirectories, file sharing, Record blocking, Error handling.

REFERENCE: BOOKS:

1. William Stallings: Operating System, PHI2. Silberschatz and Galvin: Operating System Concept, Addison Wesley3. Tanenbaum, A.S., Modern Operating Systems, Prentice Hall of India Pvt. Ltd.







15/36



Data Structure using C++ (Practical Question)


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 operationsI. Initialize stack II. Push Element

III. Pop elementIV. Check EmptyV. 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 traversalB. A pre-order traversalC. A post-order traversal

3. Draw a new heap that is created by removing one item from the following heap:910

/ \


16/36

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.







17/36



DBMS (using Oracle) Practical Question


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 BEGINNINGBALANCE

CURRENTBALANCE

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 PRICE1035 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 20002/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


18/36

253 Brass Works Lagos Nigeria

317 Llama Llamas Lima 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?

Q. 8 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 CITYTRUCK (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.


19/36

I. Customers having over $5 million in annual revenue who have sent shipments weighingless than 1 pound.

J. Customers having over $5 million in annual revenue who have sent shipments weightingless 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.







20/36

Revised Structure of MCA Syllabus (w.e.f. from 2009-2010)Second Year (Semester III)Code Title L T P Credit Sessi

onal

Sem

ester

Total

CSA-C-321 Management Information System 3 - - 03 40 60 100

CSA-C-322 Computer Networking and Internet 3 - - 03 40 60 100

CSA-C-323 Computer Graphics And Animation 3 - - 03 40 60 100CSA-C-324 OOPs using Core JAVA 3 - - 03 40 60 100

CSA-C-325 (A) Probability , Combinatory andStatistics(B) Maths

3 - - 03 40 60 100

CSA-C-326 Lab- 3I Core Java Programming - 3 3 02 40 60 100

CSA-C-327 Lab 3II Networking Wireless andCabled

- - 3 01 40 60 100

15 3 06 18 280 420 700



21/36


MCA - II YEAR (MCA III SEMESTER)

MANAGEMENT INFORMATION SYSTEM

CSA-C-321 Max Marks: 60

UNIT I : Management Information System : The General Management System, Control systems, MISPlanning, MIS Design and Development, Components of MIS, Open Systems v/s Closed

Systems, Open Loop Control System v/s Closed Loop Control System, Information andDecision, MIS v/s EDP Systems, Role and Importance of MIS, MIS Organization, Stages ofGrowth of MIS, Management Control Systems.

UNIT II : Definition of Office Automation, Need for Office Automation, Office Functions Needed tobe Automated Office Automation Systems, Document Management Systems,Communication Systems, Teleconferencing Systems, Office Support Systems, Advantage ofOffice Automation, Disadvantages of Office Automation.

Data and Information, Definition of Database Objectives of Database. DatabaseManagement System, Levels of Database. The Hierarchical, Network & RelationalStructure. Object-Oriented Databases, Distributed Databases.

UNIT III : Information Resource Management, Business Processes v/s Information Systems,Information Systems for Management, Transaction Processing System, Management ReportSystem, Office Information System, Operational Control and Research Systems, DecisionSupport Systems, Knowledge Based Systems, Data Warehousing, OLAP (Online AnalyticalProcessing), data Mining, Management Levels v/s information systems, Enterprise Wideinformation systems, Latest Trends in information systems.

UNIT IV : Information System as a System, software Development Life Cycle (SDLC) SystemsAnalyst, Case Scenario, Feasibility Study, Systems Analysis (Requirement Analysis), DataFlow 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.


Computer Science and ApplicationsDr. R. K. Pathak 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


22/36



COMPUTER NETWORKING AND INTERNET


UNIT I : Network Fundamentals : Introduction and Applications of Computer Network, Structure ofthe communication network, Network topologies, Transmission media, LAN, WAN,

MAN, IEEE LAN Standards, Digital and Analog transmission, Switching techniques..

UNIT II : Communication among the computers; Traffic Control and Accountability, Connection-Oriented and connection less Networks, Classification of Communication protocols.Pooling / Selection system, Selective and group Polling, Stop and Wait Polling/ Selection,Continuous ARQ (Sliding Windows).

UNIT III : 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) .

UNIT IV : Digital Networks Introduction and Advantage of Digital System, Signal Conversion,digital carrier systems, Analog to Digital Techniques, Digital Switching, IntegratedService, 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 Applicationsand is effective from July 2010.






23/36



COMPUTER GRAPHICS AND ANIMATION


UNIT I : 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.

UNIT II : Introduction to clipping: 2D clipping : line clipping algorithms Cohen-Sutherland, Linesub-division algorithm, Mid point sub-division, CyrusBeck algorithm. 2D-Parametericclipping. Introduction to 3D Clipping.

UNIT III : Hidden line & Hidden surfaces: Floating Horizon algorithms: Upper Horizon and LowerHorizon, Roberts algorithm, Warnock algorithm, Weiler- Atherton algorithm, Z-bufferalgorithm.

UNIT IV : Rendering Illumination model: Surface normal, Reflection vector, Effect of Ambient

Object, Specular Reflection, Halfway vector. Shading, Ray tracing, color.

REFERENCE BOOKS :

1. Rogers, D. F. Procedural Elements for computer graphics . McGraw Hill, 20082. Hearon, D. and Baker,M. Computer Graphics PHI, 2008.3. Asthana, R. G. S. and Sinha, N. K. Computer Graphics, New Age international , 2005.







24/36



OOPS USING CORE JAVA


UNIT: I 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 inInterfaces, Extending Interfaces.

UNIT: III Multithreading and Exception Handling: Basic Idea of Multithreaded Programming, TheLifecycle of a Thread, Creation Thread with the Thread Class and Runnable Interface; ThreadSynchronization; 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, Overridingupdate, Display Methods, Banner Applet, Status Window, HTML Applet Tag, Input/ Output,JDBC.

REFERENCE BOOK:

1. Herbert Schildt,The Complete Reference JavaTM 2, Tata McGrow-Hill2. 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.






25/36



PROBABILITY COMBINATIORICS & STATISTICS


UNIT I : Sample Space, Events, probability axioms, Law of addition of Probability, Law ofMultiplication of Probability. Joint probability, conditional probability bayes rule. RandomVariables: Discrete and Continuous, Probability Mass function, Probability Density

Functions, Expectation.

UNIT II : Basic Statistics : Measure of central tendencies, measures of dispersion . Theory of leastsquare and Line fitting, correlation Coefficient, Rank Correlation and its coefficient,Regression Coefficient of determination, Sampling: Theory of sampling, population andsample survey methods.

UNIT III : Permutation and Combination: Distinct & non-distinct object, Generating functions forcombinations. Enumerators for permutations, Distribution of distinct objects.

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. .




Dr. R. K. Pathak Dr. H. S. Gour Central University, Sagar




26/36



LAB- 3I : CORE JAVA PROGRAMMING


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 Animation5. 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 JavaDoc 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 implementthis interface, one using array and the other using linked-list. Provide necessaryexception handling in both the implementations.

10. Design a Vehicle class hierarchy in Java. Write a test program to demonstratepolymorphism.

11. Design classes for Currency, Rupee, and Dollar. Write a program that randomlygenerates 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, whileleave 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 thatgenerates prime numbers below 100,000 and writes them into a pipe. Design anotherthread that generates fibonacci numbers and writes them to another pipe. The mainthread 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,


Prof. R. S. Kasana

Prof. & Head, Chairman Departmental CouncilComputer Science and Applications





27/36



LAB 3II NETWORKING WIRELESS AND CABLED


1. Study the physical media of connectivity.

2. Study the pin-structure of cross-over cable.

3. Study the different LAN Technologies.

4. Study the functioning of a Switch.

5. Study the Functioning of a Router.

6. Establishing LAN (Star topology) for your LAB using Hubs

7. Study and install the media converting using optical fiber.

8. Install and configure the LAN card.

9. Install and configure window NT (2000 & 2003) Server.

10. Study and implement the virtual network.







28/36

Second Year (Semester IV)Code Title L T P Credit Sessi

onal

Sem

ester

Total

CSA-C-421 Operation Research-QuantitativeTechniques

3 - - 03 40 60 100

CSA-C-422 Software Engineering 3 - - 03 40 60 100

CSA-C-423 Decision Support System 3 - - 03 40 60 100

CSA-E424CSA-E425

Elective -3-Id. Parallel Computinge. Compiler Design

3 - - 03 40 60 100


Elective 3-IId. Image processinge. Data Ware Housef. Simulation and Modeling

3 - - 03 40 60 100

CSA-C-429 Lab -4I Based on Elective I - 3 3 02 40 60 100

CSA-C-430 Lab -4II Based on Elective II - - 3 01 40 60 100

15 3 06 18 280 420 700



29/36


MCA - II YEAR (MCA IV SEMESTER)

OPERATION RESEARCH-QUANTITATIVE TECHNIQUES


UNIT I : Introduction : characteristics of O. R., Main Phases of O. R., Scope of O. R., Formulationof LPP, Graphical solution of two variable LP problems, Simplex method, Phase I and

Phase II of the simplex method.UNIT II: Duality in LP: Formulation of dual problems, Dual simplex method, Transportation

Problem and its solution, Assignment problem and its solution by Hungarian methodinteger programming: Branch and Bound method.

UNIT III: Game theory: Solution of Two person-Zero-sum games, Solution of mixed strategygames, Inventory theory: Types of inventory, Inventory costs, single item deterministicmodels Economic lot size models without shortages and shortages having production rateinfinite and finite.

UNIT IV: Queuing theory: Characteristics of queuing system, Steady state M/ M/ 1 and M/ M/ Cqueuing models. Replacement theory: Replacement of items that deteriorate of items that

fail group replacement and individual replacement

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.







30/36



SOFTWARE ENGINEERING


UNIT I : Introduction to software engineering- Characteristics, Applications, crisis, problem andcauses, software engineering paradigms, definitions, classic life cycles, models:

prototyping, spiral, Linear sequential, RAD models, fourth generation techniques. Analysisconcepts and principles: Communication techniques, analysis principals, softwareprototyping specifications, specification review.

UNIT II : Analysis modeling: The elements of analysis model, data modeling, functional modelingand information flow. Behavioral modeling, mechanics of structured analysis, datadictionary. Design concepts and Principles: Software design and engineering, designprocess, design principles, design concepts, effective modular design, design heuristics,design model.

UNIT III : Design methods: data design, architectural design, architectural design process, transformmapping, 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.

UNIT IV : Strategic Approach to Testing: Unit Testing, Integration Testing, Validation Testing,System Testing, Debugging. Software Maintenance- Definition, MaintenanceCharacteristic, Maintainability, Maintenance Task, Maintenance side effects, ReverseEngineering and Re-Engineering.

REFERENCE BOOKS :

1. Roger S. Pressman, Software engineering a practitioners approach, MGH2. Shoomar, Software Engineering, PHI

3. Award, System analysis and design, TMH4. 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.








31/36



DECISION SUPPORT SYSTEM


UNIT I : Introduction to the concept of Decision Support System: Definition Need forComputerized DSS and support technology characteristics and capabilities of DSS.

Components of DSS: Data management subsystem, Model Management Sub systemknowledge management subsystem, User interface subsystem classification of DSS.

UNIT II : DSS development Strategies: Development process, DSS technology levels & toolsAlgerias. & Hemistich: Tube search, genetic Algerias simulation. Introduction toartificial normal network, (NLP) Natural Language Processing and its applications.

UNIT III : Introduction to data warehousing & Data mining: Data visualization & multidimensionality. An overview of GDSS (Group Decision Support System) and DecisionConferencing.

UNIT IV : 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..

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 Theoryand Practices Prentice Hall, New Jersey, 1986.

3. Keen, P.G.W. & Morton, M, S, S,: Decision Support System: An organizationalPerspective|, Addison Wesley Pub.

4. David: Applied Decision Support System, PHI., 1989.







32/36



PARALLEL COMPUTING (Elective 3-I-a)

CSA-E-424 Max Marks: 60

UNIT I : 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.

UNIT II : Parallel Programming: Using sequential computing elements, data flow approach.Elementary Algorithms: Matrix manipulation, Graph connectivity and traversal, Treetraversal, Sorting and searching on PRAM.

UNIT III : Complexity of Parallel algorithms: Various processor interconnection schemes : mesh,hypercube, perfect shuffle etc., High Performance Computing approach for complexproblems: problems in Computational Geometry, Permutations and Combinations, Fouriertransforms, traversing combinational spaces, Decision and Optimization.

UNIT IV : Software issues in Parallel computing: Parallelism in Prolog, Parallel programmingenvironment, Case studies: Multidimensional Multilink System, Thread Simulation System

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.






33/36



COMPILER DESIGN (Elective 3-I-b)

CSA-E425 Max Marks: 60

UNIT I : Compiler Designing Phases: Analysis of a source program, Lexical Analysis, SyntaxAnalysis, Semantic analysis, Context free grammars ,software tools : LEX,YACC

(Yet another compiler), parse tree, code generation and code optimization.

UNIT II : Assembly language fundamentals(8085 based assembly language programming).Assembler -2 pass and single pass. Loading, linking, relocation, program delectability.Linkage editing.

UNIT III : Text editor ,programming environment, debugger and program generators. Cross compiler,bootstrap compilers, top down and bottom up parses. Parallel virtual machine and messagepassing interface (MPI).

UNIT IV : Linker and Loader , Editor, Macros and Microprocessors, Intermediate code generation -intermediate languages - declarations - assignment statements - Boolean expressions -procedure calls .

REFERENCE BOOKS :

1. A..V. Aho, R. Sethi and J. D. Ullman, Compilers: Principles, Techniques, and Tools (USedition), 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.







34/36



IMAGE PROCESSING (Elective 3-II-a)


UNIT I : Fundamental Steps in Image Processing: Element of visual perception, a simpleimage model, sampling and quantization, some basic relationships between pixel, imagegeometry in 2D, image enhancement in the spatial domain.

UNIT II : Introduction to spatial and frequency methods: Basic gray leveltransformations, histogram equalization, local enhancement, image subtraction, imageaveraging, basic spatial, filtering, smoothing spatial filters, sharpening spatial filters.

UNIT III : Introduction to the fourier transformation: Discrete fourier transformation, fastfourier transformation, filtering in the frequency domain, correspondence between filteringin the spatial and frequency domain smoothing frequency-domain filters, sharpeningfrequency-domain filters, homomorphic filtering, dilation and erosion, opening andclosing, hit-or-miss transformation.

UNIT IV : Some basic morphological algorithms: Line detection, edge detection, gradientoperator, 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, decision-theoretic methods, introduction to neural network.

REFERENCES BOOKS:

1. Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing, PHI, 20022. William K. Pratt, Digital Image Processing: PIKS Inside (3rd ed.), John Wiley & Sons, Inc., 20013. Bernd Jahne Digital Image Processing, (5th revised and extended edition), Springer, 2002

4. S. Annadurai and R. Shanmugalakshmi, Fundamentals of Digital Image Processing, PHI, 20075. M.A. Joshi, Digital Image Processing: An Algorithmic Approach, PHI, 20066. B. Chanda and D.D. Majumder, Digital Image Processing and Analysis, PHI., 2007







35/36



DATA WARE HOUSE (ELECTIVE 3 II-b)


UNIT I : Introduction And Data Warehousing : Introduction, Data Warehouse, MultidimensionalData Model, Data Warehouse Architecture, Implementation, Further Development, Data

Warehousing to Data Mining.

UNIT II : Data Preprocessing, Language, Architectures, Concept Description: WhyPreprocessing, Cleaning, Integration, Transformation, Reduction, Discretization, ConceptHierarchy Generation, Data Mining Primitives, Query Language, Graphical UserInterfaces, Architectures, Concept Description, Data Generalization, Characterizations,Class Comparisons, Descriptive Statistical Measures.

UNIT III : Association Rules: Association Rule Mining, Single-Dimensional Boolean AssociationRules from Transactional Databases, Multi-Level Association Rules from TransactionDatabases.

UNIT IV : Classification And Clustering : Classification and Prediction, Issues, Decision TreeInduction, Bayesian Classification, Association Rule Based, Other Classification Methods,Prediction, Classifier Accuracy, Cluster Analysis, Types of data, Categorisation ofmethods, Partitioning methods, Outlier Analysis.

REFERENCE BOOKS:

1. J. Han, M. Kamber, Data Mining: Concepts and Techniques, Harcourt India / MorganKauffman, 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.







36/36



SIMULAITON AND MODELLING (ELECTIVE 3 II-c)


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 incontinuous system simulation - Real time simulation. Exponential growth models,exponential decay models - Logistic curves -Generation of growth models - systemmodels- system dynamic diagrams

UNIT III : Multi segment models Representation of time - delay - Review of probability concepts Ar rival pattern and service times - poisson arrival patterns - Exponentiations, Erlang andHyper Exponential Distribution - Mathematical studies of Queuing problems.

UNIT IV : Discrete system Simulation : Discrete events - Generation of arrival patterns - Simulation

of telephone systems - Simulation languages - GPSS programming General description -simscript programs, simscript system concept.

REFERENCE BOOKS :

1. Banks, J, Carson S and Nilson B L, Discrete Event System Simulation PHI2. Deo N System simulation with digital computers" PHI3 Law A M and Kelton W D Simulation Modeling and analysis" Mc Graw Hill4. 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.





MCA Syllabus 2009 Centre University Onward

Documents