Post Graduate : MCASUBJECTS FULL MARKS

First Semester MCA-101A Basic Electronics 50 MCA-101B Fundamentals of Communication 50 MCA-102A Data Structure I 50 MCA-102B Data Structure II 50 MCA-103A Computer Organisation and Architecture 50 MCA-103B Management Principals and Practices 50 MCA-104A Programming Methodology 50 MCA-104B Programming in C 50 Laboratory-1 MCA-105A Programming in C 50 MCA-105B Data Structure 50 Laboratory-2 MCA-106A PC Software 50 MCA-106B Digital Electronics 50

Second SemesterMCA-207A Numerical Methods 50 MCA-207B Discrete Mathematics 50 MCA-208A Computer Organization and Architecture II 50 MCA-208B Microprocessor I 50 MCA-209A Operating System I 50 MCA-209B Operating System II 50 MCA-210A Data Communication and Computer Network I 50 MCA-210B System Programming 50 Laboratory -3 MCA-211A Microprocessor I 50 MCA-211B Numerical Programme in Matlab 50 Laboratory -4 MCA-212A&B Operating System 100

Third semesterMCA-313A DBMS I 50 MCA-313B Software Engineering I 50 MCA-314A Object Oriented Programming 50 MCA-314B Formal language and Automata 50 MCA-315A Data Communication and Computer Network II 50 MCA-315B Microprocessor II 50 MCA-316A Optimization Techniques 50 MCA-316B Operations Research 50 Laboratory -5 MCA-317A DBMS I 50 MCA-317B Object Oriented Programming I 50 Laboratory -6 MCA-318A Network 50 MCA-318B Microprocessor II 50

Fourth semesterMCA-419A DBMS II 50 MCA-419B Software Engineering II 50

MCA-420A System Modeling and Simulation 50 MCA-420B Organization Behaviour 50 MCA-421A Object Oriented Analysis and Design 50 MCA-421B Distributed Computing 50 MCA-422A Design and Analysis of Algorithm 50 MCA-422B Soft Computing 50 Laboratory -7 MCA-423A DBMS II 50 MCA-423B Object Oriented Programming II 50 Laboratory -8 MCA-424 A&B Design 100

Fifth semesterMCA-525A Entrepreneurship Development 50 MCA-525B Industrial Economics 50 MCA-526A Multimedia and Web Technology 50 MCA-526B Compiler Design 50 MCA-527A Elective I 100 MCA-528B Elective II 100 Laboratory -9 MCA-529A Multimedia and Web Technology 100 MCA-530B Seminar 100

Sixth semesterMCA-631 Project and Viva Voce 600

SYZLABUS OF MCA IN DETAIL

MCA - 101A BASIC ELECTRONICS

Network Theorems: Statements of Thevemin’s-, Norton’s-, Superposition- and Maximum Power Transfer Theorems and their uses. Diode: Forward Bias and Reverse Bias: Use as Rectifier (Half Wave, Full Wave and Bridge); Load Regulation and Line regulation.Transistors: Common Base, Common Emitter and Common Collector Configurations, Transistor α and β , Their Relation. Common Emitter Amplifier.Power Supply: Circuit with 78** and 79** series, SMPS.Number System: Binary, Octal Hexadecimal and Their Inter Conversions, Binary Addition and Binary Subtraction. Fixed Point and Floating Point Representation, Floating Point Addition. Data Representation: Digital Coding, BCD Alphanumeric Codes (ASCII and EBCDIS), BITMAP Representation.Basic Logic gates, , Boolean Algebra and identities, NAND as fundamental gates, NOR as Fundamental gates, Exclusive OR Gate, Exclusive NOR Gate, Sum of Product (SOP) and Product of Sum (POS), Karnaugh Map, De Morgan’s Theorem.Combinational Circuits: Half- and Full Adder, Subtractor, Multiplexer, Decoder, Encoder, De-multiplexer.

Sequential Circuit: Flip-Flops, RS Flip-Flop, Clocked RS Flip-Flop, D-Flip-Flop, Clocked D-Flip-Flop, T- Flip-Flop, JK Flip-Flop, Master-Slave JK Flip-Flop Shift Register, Counters, A/d and D/A Converters, timer Conception.Memory Devices: Metal-Oxide-Semiconductor Field Effect Transistor (MOS), Complementary Metal-Oxide-Semiconductor Field Effect Transistor (CMOS), Charge-Coupled Device (CCD).

Book: 1) Integrated Electronics: Milman and Halkias2) Digital Principles and applications: Malvino and Leach3) Digital Principles: Schaum’s Series4) Elements of Computer Science and Programming Languages: A. K.

Mukhopadhyay and A. Das

MCA 101 B: FUNDAMENTALS OF COMMUNICATION

Telecommunication System: Basic concept of an electromagnetic Signal.

Analog and digital signals: Signal, Signal strength, decibel, data transmission, text audio, video, telecom services.

Signal: Time-domain concept: continuous and discrete, periodic and aperiodic; amplitude, frequency, phase wavelength; Frequency-domain concepts Fourier Analyses, D.C. component fundamental frequency and harmonics; spectrum and bandwidth; data rate

Transmission impairments; attenuation, delay noise; channel capacity, Shannon’s capacity (formula only)Transmission path, Media-Guided media: Twisted pair cable, wave guide, Optical Fibre, Unguided media: Principles of Ionospheric propagation, microwave and satellite link, nature of Orbit and their classification, Idea about GPS

Guided and unguided medium (concept, characteristics, advantages, limitations and uses only) Nyquist bandwidth,

Twisted cable, co- axial cable, satellite, micro wave, broadcast.

Analog to digital: PAM, PCM, PMM, PPM, SAMPLING RATE, Nyquist criteria.

Analog transmission of Digital Signal: ASK, FSK, PSK,QAM(bit/baud),TDM, FDM, Synchronous and Asynchronous transmission, Modem and its working principle

Antenna and its classification

MCA 102A DATA STRUCTURE I

Data Structure and algorithm preliminaries: Definitions; Time and Space analysis of Algorithms – big O notation; Time and space trade-off

Array: Definitions of Arrays and Lists; Stacks; Queues; Strings; Row/Column major representation of Arrays; Sparse matrix.

Stack: Push; Pop; Conversion from infix to postfix and evaluation of postfix expression; stack representation using array and linked list.

Queue: Representation using array and linked list; Insertion and deletion operations; circular queue; priority queue.

Linked List: Singly linked list; circular linked list; doubly linked list, circular & doubly linked list.

Recursion: Overview including tail recursion.

Sorting Methods I: Bubble sort; Selection sort; Insertion sort; Quick sort with complexity analysis.Searching Methods I: Linear and Binary search with complexity analysis.

Books:1. Horowitz Ellis & Sartaj Sahni, “Fundamentals of Data Structures”, Galgotia

Pub.2. Tanenbaum A.S., “Data Structures using ‘C’ ”3. Aho Alfred V., Hopperoft John E., Ullman Jeffrey D., “Data Structures and

Algorithms”, Addison Wesley

MCA 102B DATA STRUCTURE II

Tree: Definition; Generalised tree representation; Binary tree – definitions and properties; binary tree traversal algorithms (pre, post, in) with and without recursion.

Sorting Methods II: Merge sort; Radix sort; Heap sort with complexity analysis.

Searching Methods II: Hashing – hash functions, collision resolution techniques; BST (Binary Search Tree) – creation, insertion and deletion operations.

Advanced Tree Structures: Threaded tree (One way and Two way); AVL tree balancing; B-tree; Application of trees.Graphs: Different representations; Breadth-first and Depth-first Search; Spanning Tree; Prim’s and Kruskal’s algorithms for finding Minimal Spanning Tree.

Books:1. Horowitz Ellis & Sartaj Sahni, “Fundamentals of Data Structures”, Galgotia Pub2. Tanenbaum A.S., “Data Structures using ‘C’”3. Aho Alfred V., Hopperoft John E., Ullman Jeffrey D., “Data Structures and Algorithms”, Addison Wesley

MCA 103A: COMPUTER ORGANIZATION AND ARCHITECTURE I

Concepts and terminologies: Digital Computer Components, Hardware and Software and their Dual Nature, Role of Operating System(OS), Compilers, Special Purpose and General Purpose machine, Concepts of Real Time, On-line, Multiprogramming, Time Sharing, Multiprocessing Systems, Features of PCs, Minis, Workstations, Mainframes.

The: ALU: ALU organization, Integer Representation, Serial and Parallel Adders, 1s and 2s Complement Arithmetic, Multiplication of Signed Binary Numbers, Floating Point Number Arithmetic, Overflow Detection, Status Flags.

Memory Unit: Memory Classification, Bipolar and MOS Storage Cells, Organization of RAM, Address Decoding, Registers and Stacks, ROM, PROM and EPROM Based Cell, Organization and Erasing Schemes, Magnetic Memories-recording Formats and Methods, Disc and Tape Units, Concepts of Memory Map, Timing Diagrams, T-states, Timing Diagram Controlling Arithmetic and Logic Instructions, Instruction Sequencing, with Examples, Introduction to Micro-programming Configurations.

Input-output: Alphanumeric Codes, Error Detection Codes, Video and Keyboard Units, Printers, Various Modes of Data Transfers, I/O Accessing Modes, I/O Interface.

Introduction to Basic Structure and Operational Concepts, Instruction Formats, Instruction Execution Process, Addressing Modes, Stacks and Su-routine Handling, Instruction Sets and Organizational Features of Some Representative machines.

Control Unit: Hardware Control Unit Design, Hardware Programming Language, Micro-programming and Micro-programmed Control Unit Design.

Main Memory Organization, Memory Hierarchy, Virtual Memory, Cache Memory, Interleaved Memory.

Books:1) Advanced Computer Architecture: Rafiquzzaman2) Computer Architecture & Organization: Morio Mano3) Elements of Computer Science & Programming Language: A. K.

MukhopadhyayComputer Architecture & Organization: Hayes

MCA - 103B MANAGEMENT PRINCIPLES AND PRCTICES

Leadership and Motivation: Concepts and Leadership Styles; Concept and Theories of Motivation.

Introduction: Concept, nature, process and significance of management thoughts-Taylor,,Fayol, Mayo and Fallet

Planning: Meaning, objective, importance, purpose of planning, Planning Premises, short term and long term plans, types of Plan, Objectives- nature, Concept and MBO.

Organizing: Nature and Process, Organization structure, Forms: Delegation of Authority, Span of management.

Communication and Control: Nature, Process and Types of Communication; Concept, Process, Tools and Technique of Control.

Social Responsibility of Management and Business Ethics.

Books:1) Koontz & Weilrich: Essentials of management 2) M. Banezie: Modern management3) S. Banerjee: Principles of Practice of management

MCA-104A PROGRAMMING METHODOLOGY

Problem solving concepts: problem formulation, Algorithm design – types of algorithm (incremental, divide an conquer, greedy, dynamic programming), Modular design, Top-down and Bottom-up designing; Theory of Structured Programming; Formal analysis of system – flow chart, decision table, decision tree, dataflow diagram.

General features of programming languages: Data types: Elementary data types:; Compound data types; Variable and Sub-program declaration; Choice of language, Program Modules – Function, Procedure; Call semantics; Scope of variables, Recursion;

Running a program: Space and time requirement, Exception handling, Testing and error detection, Debugging.

Basics of object oriented programming: Object and Class; Data abstraction; Abstraction of methods; Polymorphism.

MCA – 104B PROGRAMMING IN ‘C’ LANGUAGE

Introduction: Basic structure, character sets, keywords, identifiers, constants, variables, data types, program structure.

Operators: Arithmetic, relational, logical and assignment; increment, decrement and conditional, operator precedence and associations; expressions, expression evaluation and type conversion. Formatted input and output.

Statements: Assignment, initialization, conditional statements, looping, branching. Nested statements.

Functions: Argument passing-pass by value and address, return values and their types, recursion, command line argument passing.

User-defined data types: Arrays, enumerated data types, structures, self-referencing structures, array of structures, arrays within structures.

Pointers: Declaration and initialization, accessing variables through pointer arithmetic, pointers and arrays, pointer to function and structures.

Strings: String handling with arrays, string handling with pointers, string handling functions.

Linked list: Dynamic storage allocation, linked list concepts, simple implementation.

File Access: Opening, closing, reading, writing, appending, modification, deletion, different forms of I/O operations on files.

Low level programming.

Recommended Books:

1. Fundamentals of C-Programming : K. Riche2. Fundamentals of C-Programming : BalagurusSwami

Laboratory -5

MCA-105A 104BProgramming in ‘C’ language MCA-105B Data Structure

Laboratory -6

MCA-106A PC SoftwareMCA-106B Digital Electrorics

MCA 207A NUMERICAL METHODS:

Errors in Numerical Analyses, Significant Figures, Rounding of Numbers, Absolute Error, percentage

Error, Relative Error.

Operators: Forward Backward Differential Operators, Shift Operator, Central Difference Operator.

Interpolation: Newton’s Forward and Backward Interpolation formula ( for both equal and unequal intervals), Lagranges Formula.

Solutions of Algebraic and Transcendental Equation: Graphical Method and Bisection Method, Methods of false Position, Newton Rephson Method, Gauss Elimination Method, Jacobi’s Iteration Method, Gauss Method.

Numerical Differentiation Techniques.

Numerical Integration, Trapezoidal Rule, Simpson’s 1/3 and 3/8 rules, Error in Numerical Integration.

Numerical Solution of Differential Equations, Taylor’s Series Method, Picard’s Methods,

Books:

1. Numerical Methods, Probability Theory and Statistics: A. K. Mukhopadhyay2. Numerical Methods: Hilde and Brand

MCA 207 B DISCRETE MATHEMATICS :

Set Theory: Set, sub-set, Equality of sets, Union, Intersection and Complements, Symmetric Difference, Properties, De Morgan’s Law, Cartezian Product, Binary Relations, Principles of Inclusion and Exclusions, Generating Function, Recurrence relation, Venn Diagram.The Pigeonhole Principle (Definition and Problem).

Discrete Mathematics: Proposition, Truth value, Truth tables, Connectives, Negation, Conjunction, Disjunction, Implication, Combination of Connectivities, Converse, Inverse and Contrapositive of an Implication, Tautology, Logical Equivalence, Idempotent, Associative-, Commutative-, Distributive- and De Morgan’s Laws, Disjunctive and Conjunctive Normal Forms, Predicate Calculus,

Relations: Product Sets and Partition, Relations and their Properties and Representation, Equivalence of Relations, Manipulation of Relations,

Elements of Graph theory : Concepts, Sub-groups, Clic Graph, Graph representation.

References: 1) Discrete mathematics Structures – Bernard Kolman, Robert C. Busby, Sharoncutler Ross 2 ) Discrete mathematics: Olympia Nicodemi. 3) Elements of Discrete Mathematics: C. L. Liu

4) Introduction to Numerical Analysis, Probability and Statistics: A. K. Mukhopadhay

MCA 208A COMPUTER ORGANIZATION AND ARCHITECTURE II:

I/O Organization: Addressing of I/O Devices with Memory-mapped, Standard I/O and Linear addressing Techniques, Data Transfer Techniques-programmed, Interrupt, DMA, I/O Channels Programming, Data Transfer Over Asynchronous Buses, Some Standard Interface Bus like VME/IEEE 488.

Introduction to RISC, & CISC Architecture and Their Comparison.

Pipelining: Classification, Scalar and Vector Pipelining, Introduction Pipelining and Execution Pipelining, Control Strategy for pipe Scheduling and Performance Analysis.

Associative Memory and its Implementation with Examples Algorithms to Run on Associative Memory machine.

Flynn’s Classification of Microprocessor machines, SISD, SIMD, MIMD ( both loosely coupled and tightly coupled).

MCA 208B MICROPROCESSOR I:

Architecture and Organization of 8085: central Processing Unit, Accumulator, General Purpose Register, Status Register ALU, Program Counter(PC), Stack Pointer (SP), Control Unit, The Clock, Reset, Interrupt, HOLD, READ and WRITE, IOR, MR, Address Latch Enable, Timing and Control Unit, , Pin Configuration of 8085, Interface.

Semiconductor Memories, RAM, ROM, Nonvolatile RAM, EPROM, EEPROM, Dynamic RAM, Memory Map.

Assembly Language Programming: Instruction Set, Program Development, Display Technique, Sub-programs, Interfacing the Microprocessor.

Serial Interface Techniques: Serial Communication, BY 8279 KEYBOARD DISPLAY CONTROLLER, Serial Communication Standards, RS 232C.

Input-output Devices: 8255 PPI Chip, Keyboard and Display, Seven Segment Display and Keyboard Interface, ADC and DAC, Timers/Counters Interrupt, 8253 Timer Controller Chip, and DMA, Zero

Crossing detector, Peck detector, Opto-coupler.

MCA 209A : OPERATING SYSTEM – 1

Introduction to Operating System, Evolution of Operating system, Single user to multiuser and multitasking, Networked OS, Operating System structures: Monolithic, Layered, Virtual machine, OS services, System calls.

Concept of Processes: Process Control Block, Co-operative processes, Inter-process communication, threads.

Process management: Process scheduling, Preemptive and non-preemptive scheduling algorithms.

Memory management: Contiguous and non-contiguous allocation, Swapping, Overlay, Paging, Segmentation, Segmentation with paging, Page replacement techniques, Virtual memory.

Device Management: I/O devices and subsystem, Polling, Interrupts DMA : Principles and Operational details, Kernel I/O subsystem.

MCA – 209B OPERATING SYSTEM II

Process synchronization: Critical section problem, Synchronization hardware, Semaphores.

Deadlock characterization, Deadlock handling methods: Prevention, avoidance, detection and recovery.

File Systems: Files and Directories, Access methods, Allocation methods, File system calls, File locking/Unlocking, File sharing.

Case studies on different Server grade OS: UNIX and Windows.

MCA 210A DATA COMMUNICATION AND COMPUTER NETWORK:

. What is data communication?

. What is network?Type of Network, Components of Network –Hardware, Software

. Switching – circuit switching and pocket switching

. Protocols and Architecture – OSI & TCP/IP

. Internetworking --- basic introduction.

Pulse modulation: Sampling theorem, Nyquist interval, pulse amplitude modulation (PAM), pulse width modulation (PWM), pulse position modulation (PPM),

Sampling and quantization, Pulse code modulation (PCM), encoder, decoder, idea about differential pulse code modulation (DPCM).

MCA 210B SYSTEM PROGRAMMING:

Assembler : Functions: 1 – Pass and 2 – pass assemblers, Symbol table management, machine op-table, Pseudo op-table, Code generation, Expression evaluation, Object module, Load module, Self assemblers and cross assembler.

Loaders & Linkers: Functions i.e. loading, relocation, linking, storage allocation. Implementation: Absolute loader, Relocatable loader, Direct linking loaders, Binders.

Overview of a microprocessor : Macro instruction, macro definition within macros, Design of a macro-assembler.

Overview of utility softwares like Editors, debuggers etc.

System programming, John, J. Donavan, Tata MeGraw Hill publishing Company Ltd.

System programming and OS: Dhamadlune.

Laboratory – 3

MCA-211A Microprocessor I MCA-211B Numerical Programming in Matlab

.Laboratory – 3

MCA-212A&B Operating System

MCA 313A DBMS -1

• Database System ConceptsEvolution of data management, File management vs. Data management, Components of a DBMS, DBMS Architecture, Data models.

• Data modeling using Entity-Relationship data model• Relational Database design

Relatinal model. Conversion from E-R data model to relational model. Normalizatin : Different normal forms 1NF, 2NF, 3NF, BCNF,Multivalued dependency, 4NF, lessless decomposition,Dependency preservation. Integrity constraints.

• Relational Algebra, Relatinal Calculas.• SQL

MCA 313B Software Engineering

Group - IRepresentative qualities of software Product, dependable system, software development models: Waterfall model, life cycle model, spiral model, prototyping

Requirements and specification: requirements analysis, system models - DFD, semantic data models, object models, data dictionary, requirements defilnition and specification, formal specification.

Software design: architectural design - modular decomposition, procedure oriented design, object oriented design, user interface design.

Software project management: planning, cost estimation – COCOMO, scheduling, monitoring, man-power planning.

MCA-314A Object Oriented

Object Oriented fundamentals, Objects and class, Links and association, Grouping constructs, aggregation, data abstraction, encapsulation, inheritance, Polymorphism, dynamic binding, message passing, metadata, candidate key, advantages of OOP,Object oriented programming and languages, Functions in C++, Objects and class: Member function, member variable, memory allocation for objects, static data member, friendly function, pointer to member, Constructor and Destructor, multiple constructor, copy constructor, dynamic constructor, Extending classes, derived classes, multilevel inheritance, hierarchical inheritance, hybrid inheritance, virtual base class, abstract class, Operator Overloading and type conversion, overloading unary and binary operator, Virtual function, template, exception handling.Implementation using a programming language, programming style, case study.

MCA 314B Formal Language & Automata

1. Introduction to Synchronous Sequential Machine:Sequential Circuits, Finite State Model – Basic Definitions, Memory Elements, State Equivalence, Machine Minimization, Synthesis of Sequential Machines.

2. Turing Machines:Basic Model, Design of Turing Machine, Universal & other Turing Machines, Language Acceptability by Turing Machines.

3. The Theory of Automata:Definition, Description, Transition System, Mealy & Moore Machines, Acceptability of Strings by Finite Automata, DFA & NDFA and their Equivalence.

4. Formal Language: Definition, Chomsky Classificatin of Languages, Recursive & Recursively Enumerable Sets, Languages & Automata

5. Regular Sets and Regular Grammars:Regular Expressin, Finite Automata & Regular Expression, Pumping Lemma for Regular Sets, Closure Properties of Pumping Lemma, Regular Sets and Regular Grammar

6. Context Free Grammar:Context Free Grammar & Derivation, Ambiguity in CFL, Normal Forms of CFL, Pumping Lemma of CFL, Decision Algorithm for CFL.

7. Push Down Automata:Basic Definitin, Language Acceptance by PDA, PDA & CFL.

Books:1. Hopcvoft J.E., Uuman J.D., “Introduction to Automata Theory, Languages & Computatin”,

NAROSA Publicatin, 2004.Kohavi Z.V.I., “ Switching & Finite Automata”, 2nded., Tata McGRAW Hill

MCA: 315A Data Communication and Computer Network II

TCP/IP protocol suite: Overview; network layer, IP addressing, subnetting,ARP,RARP,ICMP,IGMP,transport layer UDP,TCP.

Application layer: Client-Server model, DNS,TELNET,FTP,SMTP and MIME,HTTP,WWW –Hypertext and Hypermedia; browser architecture; static and dynamic documents,HTML,CGI,IPv4,IPv6.

ISDN: Concept, B,D,H, channels;

X-25:Keyterms and concepts

Frame relay: Key term and concept.

ATM: Basic architecture, application.

Network security: Goals, encryption and decryption, password, authentication, digital signature, PGP, DES and RSA; digital watermarking; steganography

Mobile network: Basic architecture of mobile telephone system; CDMA/GSM; Bluetooth

MCA 315B MICROPROCESSOR II

INTEL 8086: Intel iAPX 86 Family, Architecture, The Execution Unit (EU), BUS interface Unit (BIU), Register Structure, Pointer and Index, Segment. Control: Memory Addressing, Physical Address

Generation, Dynamically Relocatable Code, Pin Configuration of Intel 8086, Addressing Modes. Instruction Set: Arithmetic., BIT Manipulation, Processor Control Instruction, The Assembly Language Data allocation. Single Chip Microprocessor (Microcomputer) and Embedded System.

Ad.. MicroprocessorMicroprocessor Applications.

Books: 1. Microprocessor, Microcomputer and their Applications: A. K. Mukhopadhaya2. Microprocessor and Microcomputer: Gaonkar

MCA-316A Optimization Technique

Network flow problem, Formulation, Max-flow, Min-cut theorem, ford and Fulkerson's Algorithm, exponential behavior of Ford and Fulkerson's algorithm.

Project scheduling by PERT/CPM.

Decision and game theory.

Classical optimization theory, unconstrained Extremal problem, constrained Extremal problem.

Non linear programming algorithm, Kuhn-Tucker condition, convex function and convex region, Convex programming problem, Algorithm for solving convex programming problem.Queing theory.

Ref: Taha ; Operation Research.

MCA-316B Operation Research

Defination, Scope of Operation Research, phase of OR, Models in Operation Research, Advantages of a Model.Introduction of Linear Programming, Formulation, Linear programming problem (LPP) in the standard form, LPP in canonical form, conversion of LPP in standard form to LPP in canonical form, Procedure of solving LPP by graphical method.

Introduction to Simplex method, Simplex Algorithm, Arithmetical variables Technique. The Big M-method, Dual simplex, Revised simplex, comlexity of Simplex algorithm, Ellipsoid method and

Karmakar's method of solving LPPs.

Integer programming.

Transportation problem, Assignment problem, Mathematical Formulation of the Assignment Problem, Hungarian method.

Shortest path problem, Dihjkstra's and Moore's method.

Laboratory -5

MCA-317A DBMS IMCA-317B Object Oriented Programming I

Laboratory -6

MCA-318A NetworkMCA-318B Microprocessor II

MCA 419A : DBMS I I

PHYSICAL DATABASE DESIGNBasic File structure, operation on file, hashing techniques, Indexing structures,Primary chesturing and secondary indexing, Multilevel indexing using B tree.

QUERY PROCESSING OPTIMIZATIONOptimization through algebraic manipulation. Cost based optimization. Joinalgorithm.

OBJECT ORIENTED DATABASESIntroduction to Object Oriented Data Bases. Approaches, Modeling and Design,Persistence, Iransaction, Concurrency, Recovery

TRANSACTION PROCESSINGACID properties of transaction, serializability of transaction, conflictSerializibility and and view serializibility, testing for conflict serializibility

,CONCURRENCY CONTROL AND RECOVERY TECHNIQUETwo phase locking technique, Deadlock and stagnation based protocol.Log-basedRecovery.

EMERGING SYSTEMSEnhanced Data Models, Client Server Model, Data Warehousing and DataMining , Web Databases , Mobile Databases.

DATABASE DESIGN ISSUESSecurity , Integrity , Consistency , Database tuning. Optimization and ResearchIssues.

MCA 419 B: SOFTWARE ENGINEERING II

Interface design , Interface standards, Programming languages and coding ,Language classes , Code documentation , Code efficiency , SoftwareConfiguration Management , version management , process accounting and

Software Quality Assurance , Quality metries , Software Reliability , softwaretesting , path testing , control.

Software testing: verification and validation, testing technique – white box andblack box testing, stress testing, comparison testing, performance testing.acceptance testing, security testing, testing strategy.

Software maintenance, Maintainability, types of maintenance.

Reverse Engineering and Re-engineering.

CASE tools – projects management, CASE tools classification tools – analysis and design tools- programming tools – integration and testing tool – Case studies.

Books:

1. Jolote, P., An integrates approach to software engineering. Narosa Publishing house, 1991

2. Sommerville.I., software engineering, Pearson education, asia, 20033. Pressman. R S., Software Engineering: a Practioner’s Approach,

McGRAW Hill, 1997.4. Ghezzi, C. et. Al.., fundamentals of Software Engineering, Prentice

Hall of India, 1991

MCA 420A: SYSTEM MODELING AND SIMULATION

System model, Types of model, Role of modeling in system analysis, principlesused in modeling, Types of system study.

Techniques of simulation, types of system simulation, Monte Carlo method,computational technique – continuous model, discrete model, Distributed Lagmodel, cobweb model.

Continuous system model, Analog methods, real – time simulation, Growth model.

Concept of probability in simulation, Continuous and discrete probability function.

Generation of Pseudo-Random numbers and stochastic variates.

Elements of Queuing model, measures of Queues, solution of Queuing problem,Simulation of Queuing system.

Mechanics of discrete simulation, Gathering statistical observation, measuring utilization.

Continuous system simulation language, CSMP I I I, the DYNAMO language,System dynamics Diagram,

Discrete simulation language, GPSS, SIMSCRIPT.

Books:

1. Gordon. G., “ System simulation”, Prentice hall India2. Deo. N., “System simulation with Digital computer” Prentice Hall

India.

MCA 420B: Organizational Behaviour

Introduction to Organization and Individuals, what is an organization, componentsOf organization, nature and variety of organizations.

Models of analyzing organizational phenomena, organizational and businessvariables, organizations in the Indian context, institutions and structures, basicroles in an organization etc., perception, attitudes, motives, commitment, values,creativity and other personality factors.

Profile of a manager and an entrepreneur.

Interpersonal and Group processes, Interpersonal trust, understanding the otherPerson from his/her point of view, interpersonal communication, listening,feedback, counseling, transactional analysis, self-fulfilling prophecy etc., leadership, motivating people, working as a member of a team, team functioning, team decision-making, team conflict resolution, team problem solving.

Organizational Structure and Integrating, Interpersonal and group Dynamics.

Element of Structure. Functions of structure, determinants of structure, structure-technology-environment-people relationship.

Principles underlying design of organization, organizational culture, organizational politics, issues of power and authority, organizational communications, organizational change, integrating CASES.

MCA 421A : OBJECT ORIENTED ANALYSIS AND DESIGN

Object oriented Design fundamentals. The object Model, Classes and Objects, Complexity, object types, object state, OOSD life cycle.

Overview of object oriented analysis. Object modeling, functional modeling, adding operations, Iteration, Shaler/Mellor, Coad/ Yourdon, Rumbaugh, Booch, UML., Usecase, conceptual model, behaviour, class, analysis patterns overview diagramsaggregation.

Object oriented design methods, subsystem, Concurrency, allocation to processorsand tasks. UML, diagrams, collaboration, Sequence, Class, design patterns and frameworks. Objects design optimization, implementation of control. Adjustment of inheritance. Comparison with other design methods.

Managing object oriented Development, Managing analysis and design, Evaluation testing, coding, Maintenance, Metrics.

Case studies in object oriented Development, Design of Foundation class libraries,Object Oriented Databases, Client/Server computing, Middleware.

Books:

1. Rumbaugh. J. Et. Al “Object Oriented modeling and design”,Prentice hall of india, new Delhi.

MCA 421B : DISTRIBUTED COMPUTING

Broad Band Transmission Facilities – Open interconnection Standards – LocalArea Networks – Wide Area Networks – Networks Management – Network Security – Clusters Computers.

Client – Server Architecture – Challenges – Design Methodology – Intranets and Groupware – Hardware and Software for intranet – Groupware and Features – Network as a Computer – The

Internet- IP Addressing – Internet Security- Open system- Concepts and Reality.

Distributed Operating System – Transparency – Inter – Process communication – Client – Server Model – Remote Procedure Call – Group communications – Threads – System Models – Process Synchronization – Deadlocks – Solutions – Load Balancing – Distributed File Systems – Distributed Shared Memory Systems – Micro- Kernels.

Theoretical Foundations – Logical Clocks – Vector Clocks – Global State - Termination – Correctness Election Algorithms – Termination Detection- FaultTolerance – Missing Token – Consensus Algorithms – Byzantine - Consensus-Interactive Consistency.

Distributed Databases – Distribution Transparency – Distributed Database Design – Query Translation Query Optimization – Concurrency Control – Object- Oriented Databases – Strategic Considerations – Applications ofObject- Oriented Databases.

Books:

1. Shape Mullender, Distributed systems, Addison-Wesley, 1993.2. Albert Fleishman, Distributed systems – Software Design & Implementation, Springer-

Verlag, 1994.3. Mukesh Singal and Shivaratu N.G., Advanced Concepts in Operating Systems, McGraw Hill,

New York 1994.4. George Coulouris and Jean Dollimore, Distributed Systems – Concepts and Design, Addison

– Wesley, 1988.5. Gerard Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1994.

MCA 422A : DESIGN AND ANALYSIS OF ALGORITHM

Mathematical Background – Design and Analysis of algorithms – Basic concepts.

Internal sort algorithms – Analysis – Worstcase – Average case – Sorting in Linear Time – Medians and order statistics –Augmenting Data Structures- Red Black Trees –Dynamic – Order Statistics- FFI -Algorithm- Implementation.

Design Techniques, Divide and Conquer –Dynamic Programming-Greedy method-Backtracking –Branch & Bound -Classical examples- Analysis.

Graphs-Representation-Traversals-Topological sort- Minimum spanning tree-Shortest paths-Biconnectedand strongly connected components –Parallel algorithms –Sorting –Matrix multiplication –Numerical-Graph.

NP Completeness -Approximation alogorithms-Matrices-Transitive closure-Warshall’s –kronrod’s algorithm-Computaional Geometry.

Books: 1. T.H. Cormen, C.E. Leiserson. R.L. Rivest. Introduction to Algorithms, McGraw Hill Book Company,

1994.2. sara Baase. “computer Algorithms: Introduction to Design and Analysis. Addison Wesley Publishing.

Company.1998. 3. M.J.Quinn. Designing Efficient Algorithms for Parallel Computers, McGraw Hill Book Company, 1998.

MCA 422B: Soft Computing

Artificial neural networks: Basic concepts-Single layer perception –Multilayer Perception- Supervised and Unsupervised learning . back propagation networks – Kohnen’s self organizing networks –Hopfield network.

Fuzzy sets and Fuzzy reasoning – Fuzzy matrices – Fuzzy functions – Decomposition – fuzzy automata and languages – Fuzzy control methods – Fuzzy decision making.

Neuro-Fuzzy Modeling: Adaptive networks based Fuzzy interface systems – Classification and Regression Trees – Data clustering algorithms – Rule based structure identification – Neuro-Fuzzy controls – Simulated annealing – EvolutionaryComputation.

Genetic Algorithms: Survival of the Fittest –Fitness Computations – Cross over – Mutation – Reproduction – Rank space method.

Rough sets and probabilistic reasoning. Applications of soft computing in pattern recognition,Control system and image processing.

Soft computing and conventional AI: AI search Algorithm – Predicate calculus – Rules of interference – Semantic network – Frames – Objects – Hybrid models – Applications. Knowledge discovery in databases – Data mining and web mining using soft computing techniques.

Reference:

1. jang J.S.R., Sun C.T. and Mizutani E, “Neuro-Fuzzy and Soft computing” , Prentice Hall 1998.2. Timothy J.Ross. “Fuzzy Logic with Engineering Applications”. McGraw Hill, 1997.3. Laurence Fausett, “Fundamentals of Neural Networks”, Prentice Hall, 1994.4. George J. Klir and Bo Yuan, “Fuzzy sets and Fuzzy Logic”, Prentice Hall, USA 1995.5. Nih J.Nelsson, “Artificial Intelligence – A New Synthesis”, Harcourt Asia Ltd., 1998.6. D.E. Goldberg, “Genetic Algorithms: Search, Optimization Machine Learning”, Addision Wesley.

MCA-423A DBMS II LAB

MCA-423B Object Oriented Programming II LAB

MCA-424A&B Design Lab

MCA 525A Entrepreneurship Development

UNIT I ERP Concepts Integrated Software Different models of industry Single data to various department customers satisfaction quality and delivery schedule, Data processing concepts to various industrial departments methods of data processing comparison of data processing methods data preparation data processing modes steps in computerization of data processing data collection methods data processing applications. UNIT II Financial accounting: Asset accounting Accounts payable Accounts receivable General ledger accounting Consolidation Special purpose ledger. Controlling Activity based controlling Overhead cost control sales and profitability analysis Product cost controlling. Enterprise controlling: Executive information system Management consolidation Profit center accounting. Capital investment management: Capital investment management programs Tangible fixed assets measure. Treasury: Cash management funds management treasury management. UNIT III Personnel administration: Application management benefits personnel administration incentive wages payroll time management travel expenses. Personnel development: Organizational management Personnel development Room reservation planning Seminar and Convention management Workforce planning. Logistic applications: General logistics: Engineering change management Environment, health and safety logistics information system logistics master data forecast variant configuration. Material management: Consumption based planning electronic data interchanges inventory management information system Invoice verification Purchasing Warehouse management. Plant maintenance: Equipment and technical objects Plant maintenance Maintenance projects Service management Maintenance order management. UNIT IV Logistics application (contd ): Production planning: Assembly orders basic data capacity requirement planning- information system Kanban/just-in-time master planning material requirement planning plant data collection production planning for process industries. Project System: Project budgeting basic data Project execution/integration information system operative

structures project planning- quality management quality certificates inspection processing planning tools quality control quality notifications. Sales and distribution: Basic function Billing Sales support Electronic data interchange Foreign trade Information system Master data Shipping - Sales Transportation.

Books/References:

1. Michael Hsmmer, Enterprise Resource Planning , 1998.

2. K.Nagappan, Digital Computers and Data Processing , 1996.

3. J.A.Hernandez, The SAP R/3 Handbook , 1998.

MCA 525B Industrial Economics

Nature and scope of managerial economics; Objectives of the firm; Managerial and behavioural theories of the firm.Concept of opportunity cost, incremental time perspective; Principles of discounting and equimargin; Demand analysis- purposes and concepts; Elasticity of demand; Method of demand forecasting.Product and cost analysis; short run and long run cost curves.Law of supply; Economies and diseconomies of scale; Law of variable proportions.Production function- single output isoquants.Pricing: Prescriptive approach; Price determination under perfect competition; Monopoly, oligopoly and monopolistic competition; Full cost pricing; Pricing strategies. Profits: Nature and measurement policy; Break-even analysis; Case study.

Books/References: 1. Dean J: Managerial Economics, PHI.2. Mote V.L. et al.: Managerial Economics: Concepts and cases, TMH.

MCA 526A Multimedia and Web Technology

Concept of Multimedia Data; Various File Formats; Multimedia data Model e.g. RMDMCompression & Decompression:

Binary Image compression: Various CCITT standards Color Image compression : JPEG Methodology, DCT, MPEG MethodologyStorage & Retrieval Merthods: Magnetic Media Technology, RAID Technology, Optical Media, Hierarchical Strage Management; Cache Management;Architectural Issues: Specialized processor, Memory System, LAN-WAN connectivity, Client-Server approach; Distributed Multimedia System: various components;Multimedia Authoring; Authoring Tools and their design issues, Hypermedia Application Design issues; User Interface: Hypermedia Interface Design Issues; Basics Of Internet Client/Server Computing: What is C/S Computing, Middleware, Fat client VS Fat Servers, N-tiered Software Architecture. Markup Languages And Their Grammers: SGML, DTD Resouce ; HTML, CSS; XML, XSL, Web Browser: Browser Architecture, Configuration of Netscape and IE Web Server Apache Architecture : Web Server Architecture, Server Features, Protocols: HTTP, FTP, SMTP, POP; Overview of Java, JAVA Applet, JAVA Servlet;ASP & JSP Search Engines; Web Database Connectivity;CGI interface to Datatabase, JDBC interface to Database .

Books/References: 1. Andleigh and Thakrar, Multimedia Systems Design, Prentice Hall PTR2. Shelly Powers et al., Dynamic Web Publishing , Techmedia, 1998.3. Jamie Jaworski, Java 1.2 Unleashed , Techmedia, 1998.4. Robert Niles et.al., CGI by Examples , Que, 1996.5. Scot Johnson et.al., Using Active Server Pages , Que,, Information Technology

MCA 526B Compiler Design

Overview of phases of a compiler, Languages and grammar.Lexical analysis : Finite automata, Lexical analyzer, Lexical analyzer generator.Parsing : Top-down and Bottom-up parsers, shift-reduce parser, recursive descent (operator precedence) parser, LL(1); LR(0), SLR, LALR parsers, Syntax-directed translation, Parser generator.Semantic Analysis : Declaration processing, Type checking. Symbol tables.Intermediate Code Generation : Run-time environments, translation of language constructs.Code Generation: Flow-graphs; Register allocation, Code-generation algorithms.Error handling and recovery.Code optimization: An introduction to the techniques.

Books/References:

1. Aho, A.V., Sethi, and Ullman J.D: compiler design.2. Dhandhere, System programming and operating systems, Tata McGraw Hill.

MCA 527 Cryptography and Network Security ( Elective I )

Introduction to Cryptography, Mathematical Foundation of Cryptography Secret Key Cryptosystem : Stream and Block Ciphers; Pseudo-random pattern generators, Correlation attacks and other relevant attacks for steam ciphers; DES and Its Security, other Block Ciphers; Differential Cryptanalysis, Attacks on Block Ciphers;One-Way Hash Functions and Data Integrity:, MD4, MD5, SHA; Cryptanalysis of hash functions;Public Key Cryptography: Mathematical Foundation, RSA, digital certificate, Security Analysis of RSAKey Establishment Protocols: Symmetric key based and Asymmetric Key based protocols, KERBEROS; Secret Sharing;Digital Signature Schemes: RSA and other related signature schemes, Possible Attacks, DSA and other related signature schemes.

Books/References:1. Manezes, Oorschot and Vanstone, Handbook of Applied Cryptography, CRC Press2. B Schnier, Applied Cryptography, PHI3. Cryptography and Network Security , Atul Kahate, Tata Mcgraw Hill

MCA 528 Bioinformatics ( Elective II )

Evolution and inheritance. Concept of gene, genetic material and genome. Chemistry of nucleic acids - structure and chemical composition of DNA and RNA. Concept of cell-cycle and its regulation. Replication of genome, molecular basis of genome evolution. Molecular biology of gene functions (transciption and translation. Concepts of transciptome, proteome and metabolome. Genomics (genome projects, concepts of structural and functional genomics). Databases, DNA sequence analysis, protein sequence analysis.

Books/References: 1. Genes VII by Bonjamin Lewin.

2. Proteins, Structure and Molecular Properties by Thomas E. Creighton. 3. Bio-thysical Chemistry Part I: The Conformation of Biological Moleculer by Canntor and Schimmel.

4. Principles of Bio-Chemistry by Albert L. Lehninger, David L. Nelson and Michaal M. Cok. 5. Genetics by T. A. Brown. 6. Molecular Cell Biology by Daid Baltimar. 7. Introduction to Bioinformatics Aurther M. Lesk, Oxford University Press 8. Fundamental Concepts of Bioinformatics Krane and Raymer, Pearson Education 9. Bioinformatics (Sequence and Genome Analysis) David W. Mount, Gold Spring Harbour Laboratory Press;

MCA 529 Multimedia and Web Technology

MCA 530 Seminar

MCA-631 Project and Viva-voce

Marks Distribution:

Project Work : 300Presentation : 100Project Note Book : 50Viva- Voce : 150Total Marks : 600