department of master of computer application · syllabus for master of computer applcation ....

Department of Master of Computer Application

Dr. Shyama Prasad Mukherjee University, Ranchi

SYLLABUS FOR MASTER OF COMPUTER APPLCATION

Semester Code Paper No.

Subject Credits UE + IA Full

Marks

FIRST

THEORY

IT-11 1 Fundamental of

Computer Science &

Application

3 75+25 100

IT-12 2 Computer Organization

and Architecture

3 75+25 100

IT-13 3 Programming Language

through C

3 75+25 100

BM-11 4 Business Communication 3 75+25 100

MT-11 5 Discrete Mathematics 3 75+25 100

PRACTICAL

IT-11L P-6 Lab based on Computer

Fundamentals

2 50+25 75

IT-12L P-7 Lab based on

Programming in C

2 50+25 75

SECOND

THEORY

IT-21 8 Data Structure 3 75+25 100

IT-22 9 Operating System 3 75+25 100

BM-21 10 Financial Accounting 3 75+25 100

MT-21 11 Numerical Analysis 3 75+25 100

PRACTICAL


Programming in Data

Structure

2 50+25 75

IT-22L P-13 Lab based on Operating

System

2 50+25 75

THIRD

THEORY

IT-31 14 Database Management

System

3 75+25 100

IT-32 15 Analysis and Design of

Computer Algorithm

3 75+25 100

IT-33 16 Object Oriented

Programming

3 75+25 100

BM-31 17 Enterprise Resource

Planning

3 75+25 100

MT-31 18 Automata Theory 3 75+25 100

PRACTICAL

IT-31L P-19 Lab based on Database

Management System

2 50+25 75


Programming in JAVA

2 50+25 75

FORTH

THEORY

IT-41 21 Computer Networks 3 75+25 100

IT-42 22 Computer Graphics 3 75+25 100

IT-43 23 Computer Design 3 75+25 100

BM-41 24 Project Management and

Software Management

3 75+25 100

MT-41 25 e-Commerce 3 75+25 100

PRACTICAL

IT-41L P-26 Lab based on Graphics 2 50+25 75

IT-42L P-27 Lab based on Case Tools 2 50+25 75

FIFTH

THEORY

IT-51 28 Artificial Intelligence and

Applications

3 75+25 100

IT-52 29 Network Security and

Cryptography

3 75+25 100

IT-53 30 Data Warehouse and

Data Mining

3 75+25 100

BM-51 31 Organizational Behavior 3 75+25 100

MT-51 32 Operation Research 3 75+25 100

PRACTICAL

IT-51L P-33 Lab based on Artificial

Intelligence

2 50+25 75

IT-52L P-34 Lab based on Web Tech 2 50+25 75

IT-511L P-35 Industrial Lectures 25 25

IT-51S P-36 Seminar 25 25

IT-51P P-37 Project 25 25

SIXTH IT-61S P-38 Seminar 25 25

IT-62P P-39 Final Project Viva-Voce 100 100

Total Marks 3350

P.G. DEPARTMENT OF MATHEMATICS & MCA, RANCHI COLEEGE, RANCHI

M.C.A. 1ST SEMESTER

Paper Code: IT-11 Paper- FUNDAMENTAL OF COMPUTER SCIENCE & APPLICATIONS

Full Marks: 75, Pass Marks: 30, Credit: 3 Duration: 3 Hrs.

Twelve (12) questions will be set and examinees will be required to answer any six (6) questions.

Basics of Computers: Introduction. Characteristics of Computers, Evolution of Computers,

Evolution of Computers. Generations Of Computers. Classification of Computers, The Computer

System. Application of Computers.

[No of question= 01 ]

Number Systems & Logic Gates: Introduction, Number Systems, Conversion Between Number

Bases, Arithmetic System, Signed And Unsigned Numbers, Concept of Overflow, Binary Coding,

Logic Gates, Boolean Algebra, Combination of Logic Gates.

[No of question=01]

Architecture of Computer: Introduction, Central Processing Unit. Memory, Communication

between Various Units of a Computer System. Processor Speed, Multiprocessor Systems.

[No of question= 01]

Memory: Introduction, Memory Hierarchy, Random Access Memory (RAM), Types Of RAM,

Read Only Memory (ROM), Types Of ROM. Classification of Secondary Storage Devices.

Magnetic Tape, Magnetic Disk, Optical Disk.


Devices: Introduction, Keyboard, Pointing Devices, Scanners, Optical Scanners. Classification of

Output, Hard Copy Output Devices, Printers, Plotters, Soft Copy Output Devices, Monitors.

Projectors, Terminals.


Computer Languages & Software: Introduction, Evolution of Programming Languages,

Classification of Programming Languages, Generations of Programming Languages, Features of

a Good Programming Language, Selection of a Programming Language. Software: Definition,

Relationship Between Software And Hardware, Software Categories, System Software,

Application Software, Software Terminology.


Operating System: Introduction, Operating System, Evolution of Operating System, types of

Operating System. Functions of an Operating System, Modern Operating systems.

[No of question=01]

Data Communication And Computer Network: Introduction, Data Communication,

Transmission Media, Multiplexing, Switching, Computer Network, Network Topologies,

Communication Protocols. Network Devices.

[No of questions =01]

Internet Basics & Multimedia: Introduction, Evolution of Internet, Basic Internet Terms, Getting

Connected To Internet, Internet Applications, Electronic Mail- An Introduction, How Email Works,

Searching the Web (Search Engines), Languages of Internet, Internet and Viruses. Multimedia:

Definition, Building Blocks of Multimedia, Multimedia System, Multimedia Applications, Virtual

Reality.


Text book: 1. Introduction to Computer Science- ITL Education Solutions Limited, Pearson Education,

2004.

Reference Book: 1. N. Nilsan & S.Schochen-The Elements of Computing Systems, PHI, New Delhi


M.C.A. 1ST SEMESTER

Paper Code: IT-12, Paper Title: COMPUTER ORGANIZATION AND ARCHITECTURE


Twelve (12) Questions will be set and examinees will be required to answer any six (6) questions.

Principles of Computer design - Software, Hardware interaction layers in computer architecture,

Central processing unit, Machine language instructions. Addressing modes, Instruction selection,

Instruction cycle and execution cycle.

[No. of questions =3]

Control unit, data path and control path design, and Micro programming Vs. hardwired control,

RISC Vs CISC, Pipelining in CPU design, Superscalar processors.


Memory system, storage technologies. Memory array organization, Memory hierarchy,

interleaving, cache and virtual memories and architectural aids to implement these Input output

devices and characteristics.


Input - Output Processing, Bus interface, data interface, data transfer techniques, I/O interrupts,

channels, performance evaluation - SPEC marks, Transaction Processing benchmarks.


Reference: "Computer System and Architecture", Morris Manyo, PHI.

"Computer Organization”. V.C. Hamchar. TMH

P.G. DEPARTMENT OF MATHEMATICS & MCA , RANCHI COLEEGE, RANCHI

M.C.A. 1ST SEMESTER

Paper Code: IT-13 Paper Title: PROGRAMMING Language through C



Introduction to C language. C character set, Identifiers and keywords, Data types, Declarations,

Expressions, Statements and symbolic constants. Input-output: get char, put char scanf, printf,

gets, puts functions Preparing and running a complete C Program.

[No. of question =2]

Operators and expressions: Arithmetic unary, logical, bit-wise, assignment and conditional

operators. Library functions. Control statements: while, do -while, for statements, nested loops. if

else, switch, break, continue and go to statements, comma operator.


Functions: Defining and accessing: passing arguments, function prototypes. Recursion. Use of

library functions. Storage classes: automatic, extern, static and register. Arrays: Defining and

processing, Passing to a function, Multi-dimensional arrays.


Strings operations on using library functions and used defined functions. [No. of question =1]

Pointers: declarations. Passing to a function. Operators on pointers. Pointers and arrays. Arrays

of pointers.


Structures: Defining and processing. Passing to a function. Unions. Difference between structure

and Union.


File Handling: [No. of questions =1]

Preprocessor command, # include. #define, ifdef. #ifndef, command line arguments. [No. of questions =1]

Reference Books:

Programming in C- E. Balagurusamy, TMH

Let us C- Yashwant Kanetkar,

Programming in C- Reema Thareja, Oxford Publications.


M.C.A. 1ST SEMESTER

Paper Code: BM-11 Paper Title: Business Communication



Basics of Communication: Definition, Objectives, Process, Elements, Flow of Communication,

Essentials of Effective Communication, Barriers to Communication

[No. of questions = 03]

Verbal & Non-Verbal Communication: Methods of Verbal & Non-Verbal Communication and

their difference


Essay writing [No. of questions =01]

Précis Writing [No. of questions =01]

Presentation Principles, Slide preparation, Report Writing


Business Correspondence [No. of questions =02]

Preparation of Curriculum Vitae. Job Application and Interview Techniques.


Reference:

1) Meenakshi Raman & Prakash Singh,'" Business Communication ". Oxford Publication.

2) R.,and Panton, F. " The Essence of Effective Communication " Prentice Hall of India Pvt.Ltd.

3) Munter, M. " Business Communication: Strategy and Skill " Prentice Hall of India Pvt. Ltd.


M.C.A. 1ST SEMESTER

Paper Code: MT-11 Paper Title: DISCRETE MATHEMATICS


Twelve (12) questions will be set and examinees will be required to answer any six (6) questions.

Fundamentals: Sets and Subsets. Operations on Sets, Properties of Integers, Mathematical

Structures.

[No. of questions - 1]

Logic: Propositions and Logical Operations, Conditional Statements, Methods of Proof,

Mathematical Induction. Theory of inference for statement calculus. Predicate calculus, inference

theory of the predicate calculus.


Counting: Permutation, Combination, Pigeonhole Principle, Elements of Probability.


Relations and Digraphs: Product Sets and Partitions, Relations and Digraphs, Path in a Digraph,

Properties of Relations, Equivalence Relations, Computer Representation of Relations and

Digraphs, Operations on Relations. Transitive Closure and Warshall’s Algorithm.


Functions: Functions, Functions for Computer Science. Growth of Functions,Permutation

Functions.


Order Relations and Structures: Partial Ordered Sets, External Elements of Partially ordered

Sets, Lattices, Finite Boolean Algebra, Circuit Design.


Trees: Trees, Labeled Trees. Tree Searching, Undirected Trees, Minimum Spanning


Semi groups and Groups: Binary Operations, Semi groups, Products and Quotients of Semi

groups. Groups, Products and Quotients of Groups. .

[No., of questions = 1]

Text Book:

1. Discrete Mathematical Structures, Kolman, Busby, Ross, 5th Edition, Pearson Education.

2."Discrete Mathematical Structures with Application to Computer Science", J.P. Trembly &

R.Manohar

Reference Books:

1. R.Johnsonbargh- Discrete Mathematics, 6th Edn, Pearson Education, New Delhi-2007.

2. K.H.Rosen- Discrete Mathematics and Its Applications, 4th Edn, TMH, Nev- Delhi-

2001

Paper IT-11L Computer Fundamentals

Familiar using with PC, MSDOS and MS WINDOW command, File creation, editing and directory

creation, Mastery of MS DOS commands, learning to use MS office, MS Word use of data base

and spread sheet, Slide creation with power point, Use of a visual programming language such

as Visual Basic.

HTML

Introduction HTML Editors, Elements and Tags, The Minimal document, Markup Tags, Dynamic

HTML.

INTERNET

Internet Account, The Internet Network, Internet Addresses, Domain names, Electronic Mail: The

Basics, The World Wide Web (WWW), Internet Search Engines, Web Browsers, Internet chart,

Internet Relay Chart (IRC), IRC Severs, File Transfer Protocol (FTP), Telnet, The Basics, The

Internet: Modern Developments.

Reference:-

• “Information Technology Fundamentals Computers & Information Technology”, A.Jaiswal,

Dream tech Publication.

Paper IT-12L Programming Lab

Programming exercises and project using C programming language, Exercises to study various

nature of the language, Stress to be laid or writing well structured modular and readable program

companies by

Good documentation, Cases studies of use of various data structures in applications such as

sorting, searching, string manipulation and list manipulation.

References:-

P.G. DEPARTMENT OF MATHEMATICS & MCA, RANCHI COLEEGE, RANCHI M.C.A. 2nd SEMESTER

Paper Code: IT 21 Paper Title : DATA STRUCTURE Full Marks: 75, Pass Marks: 30, Credit: 3 Duration:3 Hrs. Twelve (12) questions will be set and examinees will be required to answer any six (6) questions.

Introduction to Data Structures: Data Types, Abstract Data Types, Array, Arrays a abstract data type, Arrays row major and column major, sequences, Biog Oh notations, Stacks: Definitions and Example, Representing Stack using Static implementation, Application, Infix, Prefix and Postfix, Converting infix to postfix, Expression Evaluation, Matching parentheses, Recursion and Simulating Recursion and Simulating Recursion.

[No. of questions: 3] Queues and Linked Lists: Definition and examples, Representing Queues using static implementation, Circular queues, priority queues, Double-ended queues. Linked List: List Types (Singly, doubly, Singly circular, doubly circular), Operations on all types of Lists-create, insert, delete, Generalized Lists, Applications, Dynamic implementation of stack and queues, polynomial Addition, Dynamic Memory Allocation-First-fit, Best-Fit, Worst-fit.

[No. of questions: 3] Trees and Graphs: Basic concepts, Rooted Tree, Binary Tree-Linked and Static Representation, Tree Traversals (Preorder, In-order, Post-Order using recursion), Binary Search Tree (create, delete, search, insert, display), AVL Trees. Graphs: Representation using C, Adjacency matrix and adjacency lists, BFS and DFS by static and dynamic implementation.

[No. of questions: 3] Sorting and Searching: Bubble sort, Quick sort (recursive), Merge sort, Heap sort, searching: Sequential, Binary, Hashing, Hash functions, Overflow handling techniques.

[No. of questions: 3] Text Books:

• Data Structure Using C- Aaron Tenebausm • Database Management Systems-Ramkrishnan Gehrke

(McGraw Hill Third Edition) • Data Structure A Pseudo code Approach with C-Richard F.Gilberg, Behrouz A.Foroozan

Thomson

P.G. DEPARTMENT OF MATHEMATICS & MCA, RANCHI COLEEGE, RANCHI M.C.A. 2nd SEMESTER

Paper Code: IT 22 Paper Title: OPERATING SYSTEMS Full Marks: 75, Pass Marks: 30 Credit: 3 Duration: 3 Hrs. Twelve (12) questions will be set and examinees will be required to answer any six (6) questions: Introduction Evolution of operating systems, types of operating systems, different views of the operating system, operating system concepts and structure.

[No. of question: 1] Processes: The process concept, system programmer’s views of processes, the operating system services for the process management, scheduling algorithm, performance evaluation.

[No. of questions: 1] Memory Management: Memory management without swapping or paging, virtual memory, page replacement algorithms, modeling-paging algorithms, design issues for paging system, segmentation.

[No. of Questions: 2] Inter process communication and synchronization. The need for inter process synchronization, mutual exclusion, semaphores, hardware sport for fads exclusion, quivering, implementation of semaphores, classical problems in concurrent programming critical region and conditional critical region, monitors, messages, deadlocks.

[No. of Questions: 02] File Systems: File Systems, directories and file systems implementation, security protection, mechanisms. Input/ output Principles of I/O devices, device controllers, direct memory access.

[No. of Questions: 01] Principal of I/O Software’s: Goals, interrupt handlers, device drivers, device independents I/O software. User space I/O software. Disks: Disks Hardware, scheduling algorithm, error handling, trace-at-a-time catching, ram, disks.

[No. of Questions: 02] Clocks: clock hardware, memory mapped terminals. I/O software. Terminals: terminals hardwares, memory mapped terminals, I/O software. Processes and preprocessors in distributed systems: threads, systems models, processor allocation, scheduling.

[No. of Questions: 01] Distributed file systems: design, implementation, trends. Performance Measurement, monitoring and evaluation. Introduction, important trends affecting performance issues, why performance monitoring and evaluation are needed, performance measures, evaluations, techniques, bottlenecks and saturation, feedback ps. Case studies: MS-DOS, MS WINDOWS, LINUX(UNIX)operating system.

[No. of Questions: 02] References:

• Deitel, H.M.,”An introduction to operating systems”.Addision Wesley publishing Company 1984. • Milenkovic, M., “Operating Systems- Concepts and Design”. Mc Graw Hill; International edition

Computer Science 1992. • Tanenbaum A. S., “Morden Operating Systems”, Prentice Hall of India Pvt. Ltd. 1995. • “Operating System Concepts”, A. Silberschatz, P. B. Galvin and G. Gagne. Thonwiley and sons,

IOC New York, 2003.


M.C.A. 2nd SEMESTER

Paper Code: BM 21 Paper Title: FINANCIAL ACCOUNTING

Full Marks: 75 Pass Marks: 30 Credit: 3 Duration: 3 Hrs.

Twelve (12) questions will be set and examinees will be required to answer any six (6) questions:

Introduction to Accounting: Definition Objectives, Scope, Advantages, Accounting as Information System,

Users of Accounting Information, Accounting Principles, Concepts and Conventions.

[No. of Questions: 2]

Principles of Double Entry System, Journal Entries, Cash Book and Other Subsidiary Books, Ledger

Posting, Trial Balance, Final Accounts with simple Adjustments, Banks reconciliation Statement.


Depreciation: Definition, Objectives, Causes, Characteristics and Methods.


Financial Statement: Definition, Nature, Benefits and Limitations. Analysis of Financial

Statement: Ratio Analysis, Fund Flow Statement and Cash Flow Statement


Computers in Accounting: Role of Computers in A/C, its Merits and Demerits.

Database Designing for Accounting: Data Information, Data Process Cycle

Database: Essential, Components, Database Concepts, Designing Database for Accounting.


Reference :

• Ashish K. Bhattacharya, Financial Accounting for Business Managers, PHI

• J.Kellock, Elements of Accounting, Heinemann.

• R.L. Gupta & M. Radhaswamy, Advanced Accountancy, Sultan Chand.

• Dr. S. M. Shukla, Advanced Accounting, Sahitya Bhawan.

• C.Rama Gopal, Accounting for Managers, New age International Publishers.


M.C.A. 2nd SEMESTER

Paper Code: MT 21 Paper Title: NUMERICAL AND STATISTICAL METHODS



Numerical Methods: Errors in Numerical Calculations: Errors & their computation-absolute, relative & percentage. Solution of algebraic & transcendental equations: Introduction, Bisection method, Iterative method. False position method, Newton’s Raphson method, Lin Bairstows method. Error analysis & convergence study.

[No. of Questions: 2] Interpolation with equal & unequal intervals : Introduction, finite differences-forward, backward & central, difference table, difference of polynomials, Newton’s formula for interpolation, Gauss’s central difference interpolation formula, Divided difference & their properties- Newton’s divided difference formula, Lagrange’s- interpolation formula, Inverse interpolation,

[No. of Questions: 2] Numerical differential & integration: Introduction, derivatives using forward & backward difference formula, Numerical Integration-Trapezoidal rule, Simpason’s 1/3 & 3/8 rules, Weddle’s rule.

[No. of Questions: 1] Numerical solution of linear system of equations: Direct method-Gauss elimination, Gauss-JORDAN, LU decomposition methods. Iterative methods-Gauss-Jacobi & Gauss Seidel methods.

[No. of Questions: 1] Numerical Solution ordinary differential equations: Taylor Series method, Euler’s method, Modified Euler’s method, Runga-Kutta methods of 2nd & 4th order, Predictor-Corrector methods (Milne’s method and Adam’s methods).

[No. of Questions: 2] Statistical Methods: Concepts of Probability: Experiment and Sample Space, Events and Operations with Events, Probability of an Event, basic Probability Rules, Applications Of Probability Rules, Conditional Probability.

[No. of Questions: 1] Random Variables :How Random variable Arise, Probability Distribution of a Random Variable, Mean or Expected Value of a Random Variable, Probability Histogram Value of a Random variable, Variance and Slandered Deviation of a Random Variable. Binomial Experiments: Structure of a Binomial Experiment, Binomial Probability Distribution, Use of Binomial Probability Table.

[No. of Questions: 2] Normal Curve and Normal Distribution: Motivation behind a Normal Curve, Properties of a Normal Curve, Normal Probability Distribution, Areas Under a Normal Curve. Applications of the Normal Distribution: Approximating a Binomial Probability, The Normal Theorem and the Central Limit Theorem.

[No. of Questions: 2] Text Books:

• S.S.Sastry –Introductory Methods of Numerical Analysis-PHI, Private Ltd., New Delhi. • N.Pal & S. Sarkar- Statistics: Concepts and Applications, PHI, New Delhi-2005.

Reference Books: • R.V.Hogg etal-Probability and Statistical Inpane, 7th Edn, Pearson Education.

Paper IT 21L Lab Based On Data Structure

Assignments should include programming problems related to

Stack

Queue

Linked List

Tree

Graph

Paper IT 22L Lab Based On Operating Systems

Assignments should include programming problems related to:

Job Scheduling

Process

Memory Management

Disk Scheduling

Page Replacement Algorithm

Shell programming


M.C.A. 3rd SEMESTER

Paper Code: IT 31 Paper Title: DATA BASE MANAGEMENT SYSTEM



Basic Concepts : database & database users, Characteristics of the Data base, Database

System, Concepts & Architecture, Data Models, Schemas & Instances DBMS architecture & data

Independence, Data base language & interfaces data modeling using the Entity Relationship

Approach, Relational model language & systems, Relational Data Model & relational algebra,

Relational Model concept, Relational algebra.


SQL- A Relational Database language, Data Definition in SQL, View & Queries in SQL,

specifying Constraints & Indexes in SQL, A Relational Database management System.


ORACLE/INGERS

Conventional data Modal & System, Network data model & IDMS System, Membership types &

options in a set, DML for the network model, Navigation within a network database, hierarchical

Data Model & IMS system, Hierarchical Database DML for Hierarchical Model, Overview of IMS.


Relational Database Design: Function Dependencies & Normalization for relational Database.

Functional Dependencies, Normal forms based on Primary Keys (1 NF, 2NF, 3NF & BCNF),

Losses join & dependency preserving decomposition.


Concurrency Control Technique, Locking Techniques, Times stamp ordering. Granularity of

database, Recovery Techniques, Recovery concepts Data base backup and recovery for

catastrophic failures.


Concepts of Object Oriented database management system.


References:

• “An Introduction to Database Systems”, C.J. Date

• “An Introduction to Database Concepts”, B. Desai


M.C.A. 3rd SEMESTER

Paper Code: IT 32 Paper Title: ANALYSIS & DESIGN OF COMPUTER ALGORITHMS

Full Marks: 75 Pass Marks: 30 Credit: 3 Duration:3 Hrs.


Elementary Algorithmic: Introduction, Problems and instances, the efficiency of algorithms,

Average and worst-case analysis, an elementary operation, Asymptotic Notation Introduction, A

notation for “the order of”, Other asymptotic notation, Conditional asymptotic notation,

Conditional asymptotic notation, Conditional asymptotic notation, Asymptotic notation with

several parameters, Operations on asymptotic notation.

[No. of Question: 2]

Analysis of Algorithm: Introduction, Analyzing control structures, Using a barometer,

Supplementary examples, Average-case analysis, Amortized analysis, solving recurrences.


Greedy Algorithms: General characteristics of greedy algorithms

Graphs: Minimum spanning trees, shortest paths, the knapsack problem, scheduling.


Divide-and-conquer: Introduction- Multiplying large integers, the general template, Binary search,

Sorting, Finding the median, Matrix Multiplication, Exponentiation.


Dynamic Programming: Calculation the binomial coefficient, the World Series, Making change,

the principle of optimality, the knapsack problem, shortest paths, chained matrix multiplication.


Exploring Graphs: Graphs and games: An introduction, Traversing trees, Depth-first search:

Undirected graphs, Depth-first search: directed graphs, Breadth- first search, Backtracking,

Branch-and-bound, the minimax principle.


Probabilistic Algorithms: Introduction, Probabilistic does not imply uncertain, Expected versus

average time, Pseudorandom generation, Numerical probabilistic algorithms, Monte Carlo

algorithms, Las Vegas algorithms.


Text Book:

• G. Brassard & P. Bratley- Fundamentals of Algorithms PHI, New Delhi, 2005.

Reference Books:

• E. Horowitz. et.al. - Fundamentals of Computer Algorithms, Galgotia Publication Pvt. Ltd.,

New Delhi, 2004.

• J. Kleinberg & E. Tardos, Algorithm Design, Pearson Education, New Delhi, 2006.

• T.H. Cormen et.al, Introduction to Algorithms, PHI, New Delhi, 2005.

• S. Dasgupta et.al, Algorithm, TMH, New Delhi, 2007.

• S. Sahani, Data Structures, Algorithms and Applications in C++ 2nd Edition, Universities

Press (India) Pvt. Ltd., 2005.


M.C.A. 3rd SEMESTER

Paper Code: IT 33 Paper Title: OBJECT ORIENTED PROGRAMMING

Full Marks: 75 Pass Marks: 30 Credit: 3 Duration:3 Hrs.


Introduction, Basic of approach, Benefits of comparison of with Structured Procedural programming,

Applications of object oriented programming

Object modeling: Objects and classes, Links and associations, Generalization and inheritance Grouping

constructs Aggregation, Generalization as extension and restriction, Inheritance, Meta data, candidate

keys, Method Overriding and Polymorphism, Dynamic modeling: Events and status Nesting Concurrency.

Functional Modeling: Data flow diagrams specifying operations.


Introduction to Java, Basic features of Java, Java Architecture, JDK Tools, Java standard Library (JSL).

Keywords, Identifiers Data Types, Operators, Precedence Summary, Punctuation Symbols, Unicode

Character Set, Control statements and looping structure.


Declaring a Class, Creating an Object, Methods, Exploring New Operator, constructor its types, Finalizes,

this keyword, Access Specifies, Recursion, Inheritance, Polymorphism, Overriding Methods, Runtime

Polymorphism, Implementing Abstract classes.


Introduction to String: Concatenation and Changing Case, sub strings Data Conversion String Buffer,

Types of Array, Array of Objects, Wrapper Class Vector.


Introduction to Exception Handling: Syntax for Mechanism, User Defined Exceptions.

Introduction: Basics Characteristics of Thread Multi- tasking and Multi-threading.


Introduction, the file Class, Byte Stream Classes Reading from and Writing to a File, Character

Stream Classes, Random Access File, sequence Input Stream.


JDBC

Introduction, Data Base Connectivity, ODBC API, JDBC Application Architecture, Java SQL,

Obtaining a connection, step connecting Object, Working with Result, Set Meta Data Interface.


References:

• “Object Oriented Analysis and Design”, G. Booch

• “Object Oriented Modeling and Design using UML”, J. Rumbaugh.

• “Programming with Java”, E. Balagurusamy, TMH.


M.C.A. 3rd SEMESTER

Paper Code: BM 31 Paper Title: ENTERPRISE RESOURCE PLANNING



Introduction to ERP: Definition, Evolution and Need, Reasons for the growth of the ERP market, Benefits

and Limitations of ERP, Future Directions in ERP.


Enterprise- An Overview: Integrated Management information, Business Modeling, Integrated Data

Model.


ERP and Related Technologies: BRP (Business Process Re-engineering), MIS (Management Information

System), DSS (Decision Support System), EIS (Executive Information System), OLAP, Supply Chain

Management.


A Manufacturing Perspective: ERP, CAD/Cam, MRP (Material Requirement Planning), Bill Planning,

Product Data Management, Data Management.


Benefits of PDM: ERP Modules, Finance, Plant Maintenance, Quality Management, Material

Management.


ERP Market: SAP, BAAN, Oracle Corporation, People Soft.


Vendors, Consultants & User’s: In-house Implementation-Merits and Demerits, Vendors, Consultants,

End-user, ERP Case Studies.


Text Book:

• Enterprise Resource Planning by Alexis Leon TMH Fourth Reprint 2001.

• Garg & Venkitakrishnan, Enterprise Resource Planning: Concepts and Practice. PHI.


M.C.A. 3rd SEMESTER

Paper Code: MT 31 Paper Title: AUTOMATA THEORY



Basic Mathematical Object and Mathematical Induction: Sets, logic, Functions, Relations, Alphabets, Strings, Language, Principle of Mathematical induction, Recursive definition.

[No. of Questions: 1] Regular Expressions and Finite Automata: Regular languages and Regular Expressions, Memory required to recognize a language, finite Automata, capability & limitations of FSM, Deterministic Finite Automata, Non-Deterministic Finite Automata, NFA with e-moves, regular sets & regular expressions, Equivalence of DFA and NDFA, NFA from regular expressions, regular expressions from DFA, Moore versus Mealy m/c, two way finite automata equivalence with one way, Kleen’s Theorem, applications of finite automata.

[No. of Questions: 3] Regular and Non regular languages: Criterion for Regularity, Minimal Finite Automata, Pumping Lemma for Regular Languages, Decision problems, Regular Language and Computers.

[No. of Questions: 2] Context Free Grammars: Introduction, definition, Regular Grammar, Derivation trees, Ambiguity, Simplified forms and Normal Forms, Applications.

[No. of Questions: 2] Pushdown Automata: Definition, Moves, Instantaneous Descriptions, Language recognized by PDA, Deterministic PDA, Acceptanc3e by final state & empty stack, Equivalence of PDA, Pumping lemma for CFL, Interaction and Complements of CFL, Decision algorithms.

[No. of Questions: 2] Turing Machines: Definition and examples, Computing Partial Functions with Tuning Machine (TM), Combining TMs, Variations of TMs, Multi-tape TMs, Non-deterministic TM, Universal TM, Church Thesis.

[No. of Questions: 1] Recursively Enumerable Languages: Recursively Enumerable and Recursive, Enumerating Language, Context Sensitive and Chomosky Hierarchy, Non-recursive Language and unsolvable Problems, Halting Problem, Rice Theorm, Post Correspondence Problem, Computational Complexity: Discussion on P, NP, NPC and NP-Hard Problems.

[No. of Questions: 1] Text Books:

• Jhon Martin- Introduction to languages and the Theory of Computation, 3rd ed, TMH.

Reference Books:

• K.L.P. Mishra & N. Chandrasekharan- Thoery of Computer Science, PHI

• Hopcroft JE. And Ullman JD- Introduction of Automata Theory, Languages & Computations,

Narosa.

• Lewis H.R. and Papadimitrou C.H.,Elements of the theory of Computation, PHI

Paper IT 31L Lab Based On DBMS

Study features of a commercial RDBMS package such as Oracle, Foxpro, MS Access a

query language.

(SQL) use with the RDBMS, laboratory exercises should include define application, creation

of a data base, writing SQL queries to retrieve information from to Use o, host language

interface with embedded SQL. Use of forms and report writer package with the chosen

RDBMS product, Some sample application which may be program below:

Accounting for a Shop, Database manager for a magazine agency or newspaper agency,

Ticket booking for performance. Preparing greetings and birth day cards, Personal accounts-

insurance, loans, mortgage payment etc. Doctor’s diary, billing, Personal bank account.

Class marks management, Hostel management, Video tape Library, History of cricket scores,

Cables transmission program manager, Personal library.

Reference:-

• Data base Management Systems, A.Silber Schat

Paper IT 32L Lab Based On programming in JAVA

Introduction, More about main() method, Rules for main() method, Methods, Argument passing,

Call by value, Characteristics of Call by value, call by reference, Local variable, Recursion,

Polymorphism, Introduction to Inheritance, Overriding Methods, Runtime Polymorphism,

Implementing Abstract classes.

Introduction Syntax for Exception Handling Mechanism, The try Block The Catch() Block,

Exception Types, checked Exception, The Catch Block() or Multiple Catch, Throw, Throws, The

finally block User Defined Exception.

File handling

Introduction, The file Class Byte Stream Classes through Reading from and Writing to a File,

Character Stream Class4es Through, Random Access File, Sequence Input Stream, More about

streams.

P.G. DEPARTMENT OF MATHEMATICS & MCA , RANCHI COLEEGE, RANCHI

M.C.A. 4th SEMESTER

Paper Code: IT 31 Paper Title: COMPUTER NETWORKS



Advantage of network, structure of the communications network point-to-point and multidrop circuits, data flow and physical circuits, network topologies and design goals, hierarchical topology, horizontal topology (BUS), Star topology, ring topology, mesh topology, the telephone network switched and non-switched options, Fundamentals of communication theory, channel speed and bit the frequency spectrum connecting the analog and digital worlds, digital signals, the modem, asynchronous and synchronous transmission.

[No. of Questions: 3] Wide area and local area networks, connection oriented and connectionless network, classification of communication protocols, time division multiple access (TDMA), Time division multiplexing (TDM).

[No. of Questions: 1] Carrier sense (collision) system token passing, peer-to-peer priority systems, priority slot carrier sense (collision free) system, token passing (priority) system.

[No. of Questions: 1] Aired Protocols and the OSI model Goal of Layered Protocols, network design problems, communication between layers introduction to standards organization and the OSI model, standards organization, Layers of OSI SI status.

[No. of Questions: 1] Polling/Selection: Networks Way LANs, Primary attributes of the LAN, Broadband and base LANs, IEELAN tankards relationship of the 802 standards of the ISO/CCITT model, connection options with LANs LC and MAC topology and protocols, CSMA/CD and IEEE802.3 token ring (priority), token bus and IEEE802.4, metropolitan area network (MANs). ANSI fiber distributed data interface.

[No. of Questions: 1] Switching and Routing in Networks Message switching, Packet switching when and not to use packet switching, Packet routing, Packet switching support to circuit switching network.

[No. of Questions: 1] The X 25 Network and Supporting Protocols : Features of X.25, Layers of X.25 and the Physical Layer, X.25 and the data link layer, companion standards to X.25, features of X.25 channel options, flow control principles, other packet types .25 Logical channel states, packet formats, internetworking, connectionless mode networks the frame lay and X.25 stacks.

[No. of Questions: 2] TCP/IP: TCP/IP and internetworking example of TCP/IP operation, related protocols ports and sockets the IP address structure, major features of IP data gram, Major IP source routing value the transport layer, TCP, major features of TCP, passive operation, the transmission control block (TCB), rout discovery protocols, examples of the rout discovery protocols, application protocols.

[No. of Questions: 1] Personal Computer Network Personal computer communication characteristics, error handling, using the personal computer a server linking the personal computer to mainframe computers, file transfer on personal computers, personal computer and local area network, network operating system (NOSs) common IBM PC LAN Protocol stacks.

[No. of Questions: 1] References:

• “Data Communication and Networking”, B.A. Foroutam. Tata Mcgraw Hill.

• “Computer Networks- Protocols, Standards and Interfaces”, Black, U. Pretice Hall of India.

• “Computer Communication Networks”, Stallings


M.C.A. 4th SEMESTER

Paper Code: IT 42 Paper Title: COMPUTER GRAPHICS



Introduction: Image Processing as Picture Analysis, The Advantage of Interactive Graphics, Representative, User of computer Graphics, Classification of Applications, Development of Hardware and software for Computer Graphics, Conceptual Framework for Interactive Graphics.

[No. of Questions: 1] Basic Raster Graphics Algorithms for Drawing 2D Primitives: Scan Converting Lines, Circles, Ellipses, Filling Rectangles, Polygons, Ellipse Arcs, Pattern Filling, Thick Primitives, Line Style and Pen Style, Clipping in a Raster World, Clipping Lines, Circles, Ellipses, Polygons, Generating Characters, SRGP-copy Pixel, Antialising.

[No. of Questions: 1] Graphics Hardware: Hardcopy and Display Technologies, Raster-Scan Display Systems, The Video Controller, Randam-Scan Display Processor, Input Devices for Operator Interaction, Image Scanners.

[No. of Questions: 1] Geometrical Transformations: 2D Transformations, Homogeneous Coordinates AND Matrix Representation of 2D Transformations, Composition of 3D Transformations,Transformations as a Change in Coordinate System, viewing in 3D: Projections, Specifying an Arbitrary 3D view, Examples of 3D Viewing, the Mathematics of Planar geometric Projections, Implementing Planar Geometric Projections and Coordinate Systems.

[No. of Questions: 2] Input Devices, Interaction Techniques, and Interaction Tasks: Interaction Hardware, Basic Interaction Tasks, Composite Interaction Tasks.

[No. of Questions: 1] Representing Curves and Surfaces: Polygon Meshes, Parametric Cubic Curves, Parametric Bucolic Surfaces, Quadric Surfaces. Achromatic and colored Light: Achromatic Light, Chromatic Color, Color Models for Raster Graphics, reproduction Color, Using Color in Computer Graphics The need for Visual Realism: Fundamental Difficulties, Rendering Techniques for Line Drawings, Shaded Images, Improved Object Models, Dynamics, Stereosis, Improved Displays, Interacting with Our Other Senses, Aliasing and Antialising.

[No. of Questions: 2] Visible-surface Determination: Functions of Two Variables, Techniques for Efficient Visible-Surface Algorithms, Algorithms for Visible-Line Determination, the z-Buffer Algorithms, List-Priority Algorithms, Area-subdivision Algorithms, Algorithms for Octress, Algorithms for Curves Surfaces, visible-Surface Ray ,Tracing Illumination and Shading: Illumination Models, Shading Models for Polygons, Surface Detail, Shadows, Transparency, Inter object Reflections, Physically Based illumination Models, Extended Light Sources, Spectral Sampling.

[No. of Questions: 2] Advanced Raster Graphics Architecture: Simple Raster-Display System, Display-Processor Systems, Standard Graphics Pipeline, Introduction to Multiprocessing, Pipeline Front-End Architectures, Parallel Front-End Architectures, Multiprocessor Rasterization.

[No. of Questions: 1] Advanced Geometric and Raster Algorithms: Clipping, Scan-Converting Primitives, Antialiasing, The Special Problems of Text, Filling Algorithms, Making copy Pixel Fast, The Shape Data and Shape Algebra.

[No. of Questions: 1] Text Book:

• Foley, Van Dam, Feiner, Hughes-Computer Graphics Principles & Practice, 11th edn., Pearson Education, New Delhi, 2004.

• D.Hearn & M.P. Baker-Computer Graphics, PHI, New Delhi,2006


M.C.A. 4th SEMESTER

Paper Code: IT-4E Paper Title: COMPUTER DESIGN



Introduction to compiler: Compilers, Analysis of the source program, The phases of the compiler, Major

data structures in a Compiler, Issue in a Compiler Structure, Bootstrapping and Porting.


Scanning: Scanning Process, Regular Expression (R.E.), Finite Automata (F.A.), R.E. to DFA,

Implementation of Scanner, Use of Lex to generate a Scanner.


Context Free Grammar and Parsing: Parsing Process, The role of a parser, Context Free Grammar,

Parse trees and Abstract Syntax trees, Ambiguity, EBNF, Formal properties of Context Free Languages.


Top-down Parsing: Top down Parsing by Recursive Descent, LL (1), First and Follow sets, Recursive

Descent Parser for a Tiny language, Error Recovery in Top-down Parser.


Bottom-up parsing: Overview of Bottom-up Parsing, LR (0) Parsing SLR(1), General LR(1) and LALR(1)

Parsing, YACC, Error Recovery in Bottom-up Parser.


Semantic Analysis: Attributes and Attributes Grammars, Algorithms for Attribute Computation, Symbol

Table, Data types and Data type Checking, Semantic Analyzer for Tiny language.


Run-time Environments: Memory organization during program execution, Fully static run-time

environment, Stack-based run-time environments, Dynamic memory, Parameter passing mechanism,

Run-time environment for Tiny language.


Code Generation: Intermediate code and data structures for code generation, Basic code generation

techniques, code generation of Control statements and Logical expressions, Code generation of

procedure and Function cells.

Text Book:

• Kenneth C. Louden-Compiler Construction, Principle and Practice, Thomson 2007.

Reference Book:

• Aho, Sethi, Ullman- Compiler Principles, Techniques and Tools, Pearson Education, 2007.


M.C.A. 4th SEMESTER

Paper Code: BM-4 Paper Title: Project Management and Software Engineering

Full Marks: 75 Pass Marks: 30 Credit: 3 Duration: 3Hrs.


Software Project Development Life cycle Models: Waterfall, Spiral, Prototype Model, Incremental Model.

[No. of Question: 1] Requirement Analysis and Specification: Software Requirements Specification (SRS) Formal System Development Techniques Axiomatic and Algebraic Specification.

[No. of Question: 1] Software Project planning, Metrics for Project Size Estimation- Project Estimation Techniques, Empirical Estimation Techniques, Heuristic Estimation Techniques- COCOMO Model, Analytical Techniques Haslstead’s Staffing level estimation, Scheduling, Organization and Team Structures.

[No. of Question: 2] Software Design, Cohesion and Coupling, Neat Arrangements, Software Design Approaches, Object oriented vs Function Oriented designs, User Interface Design-Basic Concepts, Types of user Interfaces, Component-Based GUI Development, a user Interface Design Methodology.

[No. of Question: 2] Coding : Coding Standards and Guidelines Code Review-Code Walkthrough and Code Inspection.

[No. of Question: 1] Software Quality Assurance: Quality Plan Quality Assurance Techniques, Quality Metric, Verification and Validation (V & V).

[No. of Question: 1] Software Testing, Purpose of Testing, Test case and the expected output, Test coverage, Levels of Testing, Unit testing, Requirements based testing, Acceptance based testing, Object Orientation Testing.

[No. of Question: 2] Software Configuration Management, Base Line, SCM Process, Version Control, Change management. Software Maintenance: Reverse Engineering, Legacy systems Maintainability, Computer Aided Software Engineering (CASE).

[No. of Question: 2] Reference:

• R.S. Pressman, “Software Engineering-A Practitioner’s Approach”, 6th edition Mc Graw Hill

International Edition.

• Rajib Mall, “Software Engineering” PHI.

• Jalote, P. “An Integrated Approach to Software Engineering”, Narosa.

• Khurana, Rohit, Software Engineering, Vikas Publishing House.


M.C.A. 4th SEMESTER

Paper Code: MT-41 Paper Title: e-Commerce



Introduction to Electronic Commerce: Electronic Commerce, Scope of Electronic Commerce, Key Factors

of E-Commerce, Electronic Market, Benefits and Limitations of e-Commerce, Electronic Data Interchange,

e-Business, Difference between e-Commerce and e-Business


Business Strategy in an Electronic Age: Value Chain, Supply Chains, Porter’s Value Chain model, Inter

organizational Value chains, Competitive advantage, Competitive strategy, Porter’s Model, First Mover

advantage, Competitive advantage using e-commerce.


Applications of e-Commerce: Direct Marketing and Selling, Value Chain Integration, Supply Chain

Integration, Corporate Purchasing, Home Shopping, Recruitment, Travel, On-line Payment, Impact of e-

commerce, Security Issues in e-Commerce and Payment Settlement System.


Classification of Electronic Commerce: Framework for e-Commerce, Classification, Barriers to e-

Commerce.

Electronic Market: Markets, Electronic Markets, Usage of electronic markets, Advantages and

Disadvantage of electronic market.


Electronic Data Interchange (EDI): Definition, Benefits, EDI Technology, EDI Communications, EDI

implementations, EDI Security, EDI and Business.

Internet: Internet, TCP/IP, Internet Components.


Reference:

• David Whiteley-E-COMMERCE Strategy, Technologies and Applications, TMH,2000

• Ravi Kalakota & Andre B. Whinston- “Electronic Commerce A Manager’s Guide”, Pearson

Education Asia.

• P.T. Joseph, E-Commerce: A Managerial Perspective, PHI, 2002.

M.C.A. 4th SEMESTER

Paper IT-41L. LAB based on COMPUTER GRAPHICS

Assignment to be based on the features of Computer Graphics.

Paper IT-41L. LAB based on CASE TOOLS

Use of UML diagramming tools for designing models for different applications. Data flow diagrams and E-

R diagrams, use of tools for relational database design such as relational designer.


M.C.A. 5th SEMESTER

Paper Code: IT-51 Paper Title: Artificial Intelligence And Applications



Scope of AI, Games, theorem proving, natural language processing, vision and speech processing

robotics expert system, AI technique-search knowledge abstraction, Problem solving


State space search- Production system, Search space control, Depth first, breath first search, heuristic

search, Hill climbing best first search, branch and bound, Minimal search: Alpha Beta cut off, Knowledge

Representation.


Predicate logic: Solemnizing queries, Unification, Modus pones, Resolution dependency, Directed

backtracking.


Ruled based system: Forward reasoning: Conflict resolution; backward reasoning: Uses of no backtrack.


Structured Knowledge, Representations: Semantic Net: Slots exceptions and defaults frames, Handling

uncertainty, Probabilistic reasoning, Use of certainty factors, Fuzzy logic, learning.


Concept of learning, learning automation, genetic algorithm, learning by induction, neural nets back

propagation.


Expert System Need and justification for expert system, knowledge acquisition, Case studies MYCIN, RI.


References:

• Sasi Kumar, M.Ramani, S., “Rule Based Expert System” Narosa Publishing House.

• Retch, E. and Knight, K., “Artificial Intelligence” Tata Mcgraw Hill.

• Patterson, D. W. “Introduction to AI and Expert System”, Prentice Hall India, New Delhi.

• Schalkoff, R.J. “Artificial Intelligence- An Engineering Approach”, McGraw hill International

Edition. Singapore, 1992.


M.C.A. 5th SEMESTER

Paper Code: IT-52 Paper Title: Network Security And Cryptography



Introduction: Attacks, Services and Mechanisms, Security Attacks, Security Services, Integrity check, digital Signature, authentication, has algorithms.

[No. of Questions: 1] Secret Key Cryptography: Block Encryption, simple DES-Differential cryptoanalysis-DES-Modes of operation-Triple DES, AES, Rc4, RSA-Attacks, DES rounds, S-Boxes IDEA: Cryptography, ECB, CBC, OFB, CFB, Multiple encryptions DES.

[No. of Questions: 2] Hash Functions and Message Digests: Length of hash, uses, algorithms (MD2, MD4, MD5, SHS). MD2: Algorithm (Padding, checksum, passes) MD4 and 5: algorithm (padding, stages, digest, computation) SHS: Overview, padding, stages.

[No. of Questions: 1] Public Key Cryptography: Algorithms, examples, Modular arithmetic (addition, multiplication, inverse and exponentiation) RSA: generating keys, encryption and decryption. Other Algorithms: PKCS, Diffie-Hellman, El-Gamal signatures, DSS, Zero-knowledge signatures.

[No. of Questions: 1] Authentication: Password Based, Address Based, Cryptographic Authentication: passwords as keys, protocols, KDC’s Certification Revocation, Interdomain, groups, delegation, Authentication of People: Verification techniques, passwords, password distribution, smart cards, biometrics.

[No. of Questions: 2] Security Policies and Security Handshake Pitfalls: What is security policy, high and low level policy, user issues, protocol problems, assumptions, Shared secret protocols, public key protocols, mutual authentication, reflection attacks, use of timestamps, nonce and sequence numbers, session keys, one-and two-way public key based. Authentication Kerberos: purpose, authentication, serer and ticket granting server, keys and tickets, use of AS and TGS, replicated servers, Kerberos V4: names, inter-realm authentication, Key version numbers.

[No. of Questions: 2] Kerberos V5: names, realms, delegation, forwarding and proxies, ticket lifetimes, revoking tickets, multiple Realms.

[No. of Questions: 1] Network Security: Electronic mail security, IP security, Network management Security, Security for electronic commerce: SSL SET.

[No. of Questions: 1] System Security: Intruders and Viruses, Firewalls, Intrusion Detection.

[No. of Questions: 1] References: • Atul Kahate, Cryptography and Network Security, McGraw Hill. • Kaufman, C.Perlman, R., and Speciner, M., Network Security, Private Communication in a

public world, 2nd ed., Prentice Hall PTR., 2002. • Stallings, W. Cryptography and Network Security: Principles and Practice, 3rd ed., Prentice Hall

PTR., 2003. • Stallings, W. Network security Essentials: Applications and standards, Prentice Hall, 2000. • Cryptography and Network Security, McGraw Hill, Behrouz A Forouzan. • Introduction Security Intelligence Cryptographic Principles and App. Calabrese Thomson. • Securing A Wireless Network Chris Hurley SPD.


M.C.A. 5th SEMESTER

Paper Code: IT-52E Paper Title: Data Warehousing and Data Mining



Introduction, Data Mining as subject, what motivated Data mining, why is it important Data warehousing: Introduction, Data warehousing Architecture, Metadata, OLAP ENGINE, Data warehouse Backend Process.

[No. of Questions: 2] Data Mining: Introduction, Data Mining Definition, KDD Vs, Data Mining, DBMS Vs DM, other related area, DM Technique, Other Mining Problem, Issue and challenge is in DM, DM Application area, DM Application, Case Study.

[No. of Questions: 2] Mining Association Rule in Large Database: Introduction, what is an Association Rule, Method to discover association Rule, A Priori Algorithm, Partition Algorithm, Pinear-Search algorithm, Dynamic item set, Counting Algorithm, FP Tree Growth, Algorithm, Discussion and Different Algorithm, Generalized, Association Rule, Association Rules with Item Constraints.

[No. of Questions: 2] Clustering Techniques: Introduction, Clustering Paradigram, Partition Algorithm, K-Medoid Algorithm, CLARA, CLARANS, Heirer Chial Clustering, DBSCAN, BIRCH, CURE, Categorical Chastereing algorithms, STIRR, ROCK, CACTUS.

[No. of Questions: 2] Data Mining Primitives, Language and System Architecture: Data Mining Primitives, What defines a Data Mining task, Task relevant Data, The Kind of Knowledge to Mined, Concept Hicrechings, Interestingness Measwce, presentation and visualization of Discovered Patterns, Data Mining Query language.

[No. of Questions: 2] Decision Trees: Introductions, Tree Construction Principle, best split splitting Indices, Splitting criteria, Decision Tree Construction with Presenting, Prunesing Technique, Integration of Pruning Technique and Construction.

[No. of Questions: 1] Temporal and Spatial Data Mining: Introduction, Temporal Data Mining, Temporal Association Rules, Sequence Mining, The GSP Algorithm, SPIRIT, Spetial, Mining, Spatial Clustering, Spatial Trends.


Text Book: A.K. Pujari, A Data Mining Technique, University press (India) Limited, 2001

Reference Books:

• A Hand and M. Kamber, Data Mining Concept and Technique, Morgan Kauffmann

Publishers, Else river India, New Delhi, 2003.

• Recherd J, Roiger and Michance W. Creatz, Data Mining: A tutorial Based Primer, addition

Wesley ,2003.

• M.H. Dienham, Data Mining: Introductory and Advanced Topics, Pentice Hall 2003.


M.C.A. 5th SEMESTER

Paper Code: BM 51 Paper Title: Organizational Behaviour



Organization: Definition, Features, Organizational Structure

Organizational Theories: Classical, Neo-Classical and Modern Theories.

Organizational Behaviour: Definition, Nature, Scope, Why study OB, OB Model, Foundations of OB,

New Challenges for OB Manager, Case Studies.


Personality: Definition, Determinants and Theories of Personality, Personality and OB.

Perception: Definition, Determinants of Perception, Perceptual Process, Perception and OB.

Learning: Definition, Nature, How Learning Occurs, Principles of Learning, Learning and OB.

Attitude and Values: Definition, Nature, Formation and Functions of Attitudes, Attitudes and OB, Types of

Values, Formation of Values, Values, Values and OB.

Motivation: Definition and Importance of Motivation, Theories of Motivation, Case Studies.

Work Stress: Meaning, Causes of Stress, Burnout, Difference between Stress and Burnout, Stress Model,

Coping Strategies for Stress.


Group Dynamics: Definition and Nature of Group, Types of Groups, Group Development, Group Norms,

Group Cohesiveness, Group Decision Making and its advantages and disadvantages, Strategies for

improving Group Decisions, Usefulness of Group Behaviour, Determinants of Group Behaviour, Case

Studies.

Leadership: Definition, Leadership and Management, Leadership Styles, Leadership Theories, Case

Studies.

Communication: Definition, Principles of Effective Communication, Barriers to Communication, Methods

of Communication: Verbal and Non-Verbal, Case Studies.

Conflict: Definition, Types, Conflict Process, Levels of Conflict: Intra-individual, Inter-individual and Inter-

Group, Conflict Resolution, Case Studies.


References:

• L.M. Bhole, Organisational Behaviour

• Dwivedi, R.S. “Human Relations and Organisation Behaviour: A global Perspective”, Mac

Millan India Ltd. Delhi.

• Prasad Kesho “Organizational Devlopment for Excellence”, Mac Millan India Pvt.


M.C.A. 5th SEMESTER

Paper Code: MT 51 Paper Title: Operations Research



Operation Research- An overview, Organ and Development, Nature and Features, Modeling in OR,

General Solution methods, Scientific method in OR, Methodology of OR, Application, Opportunities and

Shortcomings of OR.


Linear Programming Problem: Introduction, Mathematical Formulation of the problem, Graphical Solution

Method, some Exceptional Cases, General LPP, Canonical and Standard forms of LPP, Simplex Method:

Introduction, Fundamental properties of solutions, the Computational Procedure, Use of Artificial

variables, Solution to simulation Linear Equations, Investing a Matrix using Simplex Method.


Duality in LPP: Introduction, General Primal-Dual Pair, Formulating a Dual Problem, Primal Dual pair in

Matrix form, Dhaliting theorems, Dual Simplex method, Post optical Analysis

Introduction: Variation in cost vector, Requirement Vector, Coefficient Matrix, Structural Variation.


Integer Programming and Advance LPP techniques: Introduction, Gomory’s Method, Courtuction of

Gomoy’s constraints, Fractional Cut method: All Integer & Mixed Integer, Revised Simplex Method,

Bounded Variable, Parametric LPP, Kamakar Algorithm.


Dynamic Programming & Introduction: Characteristic of Dynamic Programming, Dynamic Programming

Algorithm, Solution of LPP by Dynamic Programming.


NLPP: Introduction, Formulality a NLPP, General NLPP, Constrained Optimization with Equality

Constraints and Inequality constraints, Saddle Points.


NLPP Methods: Introduction, Graphical solution, Kuhn-Tucker Conditioned with Non Negative

Constraints, Quadratic Programming, Wolfe’s Modified Simplex Method, Separable Convex Programming

& Algorithm.


Text Book:

• Kanti Swarup, P.K. Gupta, Man Mohan-“Opeations Reasearch”, Sultan Chand & Sons, New

Delhi-2001

Reference Books:

• Ronald L. Rardin “Optimization in operations Research”, Pearson Education, New Delhi-2003

• S.S. Rao, “Optimization Theory & Application”, Wiley Eastern Ltd, 1979.

M.C.A. 5th SEMESTER

Paper IT-51L. LAB based on Artificial Intelligence

Paper IT-51L. LAB based on Web Tech

department of master of computer application · syllabus for master of computer applcation ....

Documents