theory of computer science mca-101

Theory of Computer Science MCA-101 Theory Exam – 75 Prerequisite : NIL Sessionals – 25 Course Contents: Discrete Structure Ordered sets and lattices : introductions, Ordered sets, Hase Diagrams of Partially Ordered sets, consistent enumerations supremum and infimum, isomorphic ordered sets well ordered sets, lattices, bounded lattices, distributive lattices, complements, complemented lattices. Introductory Concept on Formal logic, revision of propositional and first orders predicate logic, conjunctive normal form, clausal form, Logic programming. Finite Automata (Deterministic and Nondeterministic): Equivalence of DFA’s and NDFA’s, conversion, automata with - transition, regular expressions, Moore and Mealy machines, properties of regular sets, minimization of finite automata, push down automata and context free languages, properties of context free languages. Turing Machines: Type – O grammar and their equivalence, Turing hypothesis, Turning compatibility, Turing machines as a transducer, recognizer and acceptors, Variations of tuning machines – non-deterministic, multiple tape, two-way infinite tape, multidimensional, multihead. Turning machine as inumerator sets. Universal turning machines. Non-deterministic linear space bounded TN(linear bounded automata) and context sensitive language(CSL). Production Systems: Acceptors and Generators, Grammar – Chomsky hierarchy, Context-free grammar, Normal forms – CNF & GNF. Pumping lemma for CFL and regular languages. Derivation graph, CYK algorithm. Books :

1. Liu, C.L. ------------------------------------------Intoduction to Discrete Mathematics 2. Trembly,Manohar -------------------------------Discrete Mathematical Structures 3. J.E.Hopcroft & J.D.Ullman --------------------Introduction to Automata Theory,Languages & Computations, Narosa Publishing House 1999. 4. Wood ---------------------------------------------Theory of Computations. 5. C.H.Papadimitriou -------------------------------Theory of Computations.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

http://www.novapdf.com/


Computer Programming and Problem Solving

MCA – 102 Theory : Exam . - 75

Sessionals - 25 Prerequisite: Nil

A Model of a Computer System - Block diagram , Machine Language, High level

language, Compiler, interpreter, I/O devices.

Problem Analysis, Flow charts, Decision tables, Pseudo codes and Algorithms.

Representation of integers, reals, characters, constants and variables, arithmetic

expressions and their evaluation using rules of hierarchy. Assignment statements, Logical

constants, variables and expressions. Control structures - Sequencing, Alternation,

Iteration. Arrays, Manipulating vectors and matrices Subroutines and linkage. Simple I/O

statements, Documentation, Debugging Storage and Computation time estimation.

Examples illustrating structured program development methodology and use of a

block structured algorithmic language (e g . C ) to solve specific problems .

Books :

1. Dromey, G. : How to solve it by computer, PHI ( EEE). 1985.

2. Sridhar, J.K. : Programming with C, Oxford IBH Publishing , 1985.

3. Introduction to Computer Science, Pearson Education.




Basic Electronics

Theory: Exam - 75 MCA – 103 Sessionals - 25

Course Content:

1. Representation of Information :

Number System: Binary , octal , hexadecimal . Positive and negative numbers; fixed point and floating point numbers. Arithmetic operations: Addition, subtraction, etc. Character codes: ASCII and EBCDIC. Redundant coding for error detection and correction: Concept Hamming distance, parity codes, and Hamming code, block codes, cyclic redundancy code.

2. Electronic Devices : Resister, Capacitor, Inductor, Diode, Transistor. Diode & Transistor Characteristic, Diode as a rectifier ( Full wave and Half wave) , Biasing of transistor. Transistor as a Switch. Lab : Half wave, full wave rectifier , driver circuit for diode, lamp & relay.

3. Logic Design: Boolean algebra , Boolean variables and functions - canonical and standard forms , truth table , minimisation of Boolean functions - Karnaugh map. Combinational logic circuits – Digital Ics -

Transistor as a switch – concept of saturation and cut off :74 xx series,40xy series, TTL Ics - AND, OR , NAND , NOR, NOT, gates : 3 states buffers: Fan out: High Speed,Low power Schottley TTL : Logic levels at input, at output. ECL gates – CMOS Ics – NOT, NAND and NOR gates : TTL – CMOS interfacing.

Implementation of Boolean functions using logic gates; Multiplexers, decoders, encoders, simple arithmetic and logic circuits. Sequential circuits - flip - flop, shift registers and counters - synchronous and asynchronous.

4. Memory Devices :

Semiconductor memory - RAM, ROM ; Magnetic core and surface memory - disk , drum , tape ; Access time and cost considerations : Concepts of volatility , random access , serial access , direct access , online and backup storage, PAL, FPGA .

5. Basic CPU organization : Simple functional block diagram of a CPU ; Instruction execution process.

BOOKS: 1. Digital Principles and Applications – TMH Malvino & Lead 2. Digital Logic and Computer Design – PHI (EEE) Mano,M.M.

3. An Introduction to Digital Computer Design – PHI(EEE) Rajaraman,V.Radhakrishnan 4. Computer System Architecture – PHI(EEE) Mano,M.M. 5. Computer Organization – Mc Graw Hill Hamacher,Vranesic,Zaky.

~




ACCOUNTING AND FINANCIAL MANAGEMENT MCA-104 Theory Exam.- 75 Sessionals - 25 Course content: 1. Accounting Procedures: Account. Debit and credit; Rules of debit and credit; Classification of accounts; Methods of Journalizing; Advantages of Journal. Ledger – Posting and balancing of ledger accounts. Trial balance - Objects and preparation. Final account – Preparation of Trading account, Profit and Loss account and Balance sheet.. Control Accounting and Subsidiary Ledgers. 2. Assets, Liabilities and Working Capital: Classification of Assets and liabilities, Depreciation: Methods of providing Depreciation, causes of depreciation, assets acquisition, disposal replacement. Working capital- concept of working capital, sources of working capital. Fund flow statement and cash flow statement. 3. Interpreting Accounting and Financial Statements: Meaning of ratios, Use and significance of ratio analysis, Limitations of ratio analysis, Use of ratios in interpreting trading account and financial statements. 4. Standards for Control: Cost - Fixed cost and Variable cost, Cost – Volume - Profit analysis, Break Even point, Marginal Costing and Full costing, Standard Costing, Analysis of Variance. 5. Budgeting / Forecasting: Budget – Definition, Classification, advantages, Characteristics, Preparation of Budget, Budgetary Control - Objectives, advantages. Forecasting. 6. Capital Budgeting: Meaning, Importance, Methods of Capital Budgeting, Cost of capital.

Books:

1. Book Keeping and Accountancy (Part I) – C. Mohan Juneja; R.C. Chowla; K.K.Saksena

2. Theory and practice of Book Keeping and Accountancy(Part I) – Prof. K.R.Das, K.N. Sinha, K.S.PalChoudhury,H.N.Yadav. 3. Advance Accountancy – S.P. Jain; K.L. Narang 4. Management Accountancy – R.K. Sharma, Shashi K. Gupta (Principles and Practice)




NUMERICAL COMPUTATIONS AND STATISTICAL METHODS MCA - 105

Theory Exam – 75 Sessionals - 25

Probability : Probability Theory : Sample spaces; Events and probability; Discrete probability; Union, intersection and compliment of events ; conditional probability; Bayes Theorem ,

Random Variables and Distribution: Random variables,Discrete Probability Distribution - Binomial , Poisson , Density functions and Distributions functions ; Continuous probability distribution - Normal , Student's T and X ( chi - square ) statistic, Large sample tests for mean and proportion . Mathematical Expectations : Expectations , variance and co - variance , Addition and Multiplication theorem of Expectation .

Statistics : Basic statistics : Measure of central tendencies : Mean , Median , Mode ; Measures of dispersion : Range , Variance and Standard deviation : Frequency distributions and cumulative frequency distributions ; Moments and Moment generating functions : Linear correlation coefficient : Multiple correlation ; Sampling : Introductory concept on Population and sample, sampling survey methods. Iterative Methods : Zeros of a single transcendental equations and zeros of polynomials using bisection , false position , Newton - Raphson etc . ; Convergence of solution . Simultaneous Linear Equations, Solutions of simultaneous linear equations - Gauss elimination method and pivoting ; Ill - conditioned equations and refinement of solutions ; Gauss - seidal interative method . Numerical Differentiation and Integration : Solution of Differential Equation : Range- kutta method ; Predictor - corrector method Automatic error monitoring ; Stability of solutions . Interpolation and Approximation : Polynomial interpolation - Newton LaGrange's etc . , Difference tables Approximation of functions by Taylor series and Chebyshov polynomials Statistical Computation: Frequency Charts : Different frequency charts . Regression Analysis : least square fit ; Polynomial and curve fittings ;Linear regression algorithms ; Multiple regression algorithms . Books:

1. Rajaraman,V. : Computer Oriented Numerical Methods, Prentice hall India, 1980. 2. Krishnamurthy,E.V. Sen, S.K. : Computer based Numerical Algorithms, East West Press 1984. 3. Stoer, Builrich. : Computer Oriented Numerical Methods, Springer Veriag, 1980 4. Statistical Methods by S.P.Gupta. SultanChand and Co. Publication. 5. Hogg , R.V. Craic, A. L. : Introduction to Mathematical statistics

American Publishing Cc, Pvt. Ltd. 5. Yule U.G. Kendall , M.G. : Introduction to the Theory of statistics , Chalies 6. Fundamentals of Mathematical statistics by S. C. Gupta and V.K. Kapoor Sultan Chand & co

publication .




Master of Computer Application ( M. C. A.) Course

FIRST SEMESTER

Course

No.

Subject

Theory(working hours/week)

Programming Lab (working hours /week)

Duration of

university exams

(hours)

Maximum Marks

Written Exam

Sessional

MCA- 101 THEORY OF COMPUTER SCIENCE

3 ~~ 3 75 25

MCA- 102 COMPUTER PROGRAMING & PROBLEM SOLVING

3 ~~ 3 75 25

MCA -103 BASIC ELECTRONICS

3 ~~ 3 75 25

MCA – 104 ACCOUNTING & FINANICAL MANAGEMENT

3 ~~ 3 75 25

MCA – 105 NUMERICAL COMPUTATIONS AND STATISTICAL METHODS

3 ~~ 3 75 25

MCA – 106 LABORATORY-1 (C and Ba (C and Basic

Electronics) ~~ 3 3 100 100

TOTAL Marks 700




Computer Based Optimization Techniques MCA – 201

Theory : Exam .- 75 Sessionals – 25

Prerequisite : Probability and Statistics, Mathematical Foundation of Computer Science , Computer Programming and Problem Solving . Linear Programming : Mathematical model assumptions of linear programming , principles of simplex method Revised simplex method Applications, Duality, Dual simplex method, sensitivity analysis . Special types of linear programming problems : Transportation and assignment problems. Integer programming : Introduction , Branch and bound techniques , Binary linear programming , Assignment and travelling salesman problems . Dynamic programming : Deterministic and Probabilistic dynamic programming . Queuing model : Specification and measure of queuing systems ,Structures of basic queuing system - Definition and classification of stochastic processes , discrete - time markov chains , continuous markov chains , birth - death processes . Birth - death queuing systems : The classical system , discouraged arrivals, infinite number of servers (M/M/n), m server case (M/M/m) finite storage (M/M/1/K), finite customer populations with single server (M/M/1/M ) . Finite customer population with finite number of servers ( M / M /n /M ) , finite customer population , m- server, finite storage ( M /M /m / K / M ) . Markovian queues : The equilibrium equation , the method of stages , Eriang distribution , the queue M / E / 1 , the queue E / M / 1 , bulk arrival system , bulk service system , network of markov queues . The queue M / G / I : Transition probabilities, mean queue length , distribution , of number in system , distribution waiting time, the busy period and its duration , the number served in a busy period . Books:

1. Linear Programming : Srinath L.S. East-West,NewDelhi. 2. Introduction to Operation Research - a computer oriented algorithmic approach : Gillett,B.G. MoGraw-Hill.




DATA AND FILE STRUCTURES MCA - 202 Prerequisite: Nil Theory : Exam - 75 Sessionals - 25 Fundamental Notions : Primitive and composite data types ; Time and Space Complexity of algorithms, Concept of Big-O, small-o & Big-. Data Structures : Linear List: Stacks, Queues, Arrays, Linked Lists, Circular & .Doubly Linked Lists. Trees and Graphs : Introduction to Graph & Trees. Tree: Properties of trees; Pedant vertices in a tree; center of a tree; Rooted binary trees. Concepts of trees; Extended Binary trees; Complete Binary trees; General Trees. Binary Search Trees; Weight balanced and Height balanced trees; AVL Tree; Balanced Multi-Way Trees; Threaded Binary Trees. Graph: Concept of graph, vertex set, edge set, connected graph,etc., Adjacency matrix, Path matrix, Warshall’s algorithm, Modified Warshall’s algorithm, Adjacency list, Node list, Edge list. Spanning trees – Spanning tree algorithms; Fundamental circuits spanning trees of weighted graph. File Structures : Concepts of Fields, Records and Files; Concepts of Blocks, Clusters, Sectors. Sequential File Organization, Variable length Records and Text Files; Indexing Structures like B-trees; ISAM; Hashing Techniques for Direct Files; Inverted lists; Multilists. Sorting and Searching: Selection_sort, Insertion-sort, Bubble-sort, Quick-sort, Heap-sort, Merge-sort. Searching Techniques; Binary search, Linear search, Books :

1. Abo,Hopcroft and Ullman , Data Structures and Algorithms,Addson Wesley Publishing Co.

2. Horowitz and Sahni , Fundamentals of Algorithms, Narosa Publishing House . 3. Cormen , Leiserson , Rivest, Introduction to Algorithms, Mil Press & MeGraw - Hill Books

Company. 4. Kunth.D., The Art of Computer Programming,Vol - 1 & 11 , Addison Wesely. 5. Rauthan & Patel, Expert Data Structures, Khanna Publication Co(Ltd ). 6. Weiss, Data Structures and Algorithm Analysis in C++, Pearson Education.




Combinatorics and Graph Theory MCA – 203 Theory : Exam - 75 Sessionals – 25 Combinatories : Permutations and Combinations ; Recurrence relations; Generating functions ; Decision Trees. Graph : Incidence and degree; Handshaking Lemma; Isomorphism ;Subgraphs and Union of graphs ; Connectedness ; Walks , Paths and Circuits ;Components and Connectedness algorithms; Shortest Path Algorithms , Eulerian graph Fieury's algorithms and Chinese postman problem ; Hamiltonian graph -necessary and sufficient conditions ; Travelling salesman problem ; Bipartite graph . Tree : Properties of trees ; Pedant vertices in a tree ; Center of a tree ; Rooted binary trees ; Spanning trees - Spanning tree algorithms ; Fundamental circuits Spanning trees of weighted graph ; cut - sets and cut - vertices ; Fundamental cut - sets ; Connectivity and separativity ; Network flows ; Max - flow min - cut theorem ,Connectivity , K- connectivity Planner graph : Combinatorial and geometric duals ; Kuratowski 's graph; Detection of planarity; Thickness crossings , properties of plannerity. Colourings : Chromatic number ; Chromatic polynomial ; The six and five colour theorems ; The four colour problem , vertex colouring and upper bounds and its applications , structure of k- chromatic graph , critical graphs , perfect graph Imperfect graph , perfect graph - theorem ,Matroids , properties of matroids. Directed graphs: Binary relations ; Directed graphs and connected ness ; Directed trees ; Aborecence ; Polish method ; Tournaments , matching in bipartite graph Counting of labeled trees : Cayley's theorem ; Counting methods; Polya theory Matrix representations of graph : Incidence; matrices and their properties; Directed graphs; Binary relations; Directed graphs and Application of graphs in computer science.

Books:

1. Harry, F.: Graph Theory,Addison - Wesley Publ. Comp. 1972. 2. Tremley , J.P. and Manohar, R.P. : Discrete Mathematical Structures with Applications to

computer science, McGraw-Hill, 1975.

3. Douglas B. West : Graph Theory PHI .




INFORMATION SYSTEMS

MCA-204 Theory : Exam – 75 Pre-requisite : nil Sessionals - 25

Computer-based Information System: System, System Elements, Sub-Systems & Super Systems. Model of a Computer-based Information System (CBIS), Managing the CBIS.

Information Technology for Competitive Advantage: Firm & its Environment, Competitive Advantage, Value System, Types of Information Resources, Strategic Planning and Functional Strategic Planning of Informational Resources, Information Resource Management Concept, IRM Model.

Electronic Commerce:

Concept of Electronic Commerce, Types of E-Commerce, Characteristics of E-Commerce Systems, Anticipated Benefits from E-Commerce, E-Commerce Constraints, Selection of E-Commerce Strategy, Methodology & Technology. Electronic Data Interchange (EDI) & its Benefits, Business Process Redesign (BPR), Reverse Engineering, Restructuring & Re-Engineering.

Communication Links:

LAN, WAN, Intranets, Internet, WWW, E-Mail, Facsimile Transmission.

Basic Information Systems used in Business Operations: Management Information System (MIS), Decision Support System (DSS), Accounting Information System (AIS), MIS-Model, DSS-Model, AIS-Model, Comparative Study of MIS & DSS.

Virtual Office:

Concept of Virtual Office and Office Automation, Impact of Virtual Office, Advantages & Disadvantages of Virtual Office, Methods for Minimizing the Negative Effect of Virtual Office.

Knowledge-Based Systems:

Artificial Intelligence, Expert Systems, Expert System Models, Advantages & disadvantages of Expert Systems, Difference Between DSS & Expert Systems.

Human Resource Information System (HRIS):

Evolution of HRIS, A Model of HRIS, Use of HRIS by a Manager, HRIS Database. BOOKS: 1. System Analysis and Design By Elias Awad(Published by Galgotia). 2. Management Information Systems By Suresh K. Basandra(Published by A.H. Wheeler & Co.Ltd).




Computer Organization MCA-205 Theory Exam. - 75 Sessionals – 25 Prerequisite : Basic Electronics

1. CPU Architecture ( 45 % )+ Instruction format - operand addressing formats - Zero , single , double, register etc. ; Addressing modes - direct , indirect , immediate , relative , indexed etc . ; Instruction set selection , hardware - software tradeoffs ; Instruction execution process - fetch and execution cycles ; data path organization – single and two bus; microprogramming concept; speed mismatch between CPU and memory and methods of alleviating it ; machine and assembly level programming. case study of a 16 1 32 bit processor .

2. I/O Architecture ( 45 % ): Characteristics of simple I/O devices their controllers ; I/O interface - addressing , data

transfer, synchronization - memory - mapped and isolated I/O program controlled and direct memory access data transfer ; polled and interrupt controlled synchronization ; Interrupt mechanism - device identification - polling , vectored ; priority schemes - daisy chaining , interrupt masking ; Concept of DMA - cycle stealing and burst mode , DMA interface bus arbitration mechanism ; Concept of I/O channels and peripheral processors .

3. Advanced Memory Concepts( 10 % ) : Memory hierarchies - cache memory, virtual memory.

Books: 1. Coputer Organization: V. C. Hamacher,Z.G.Vranesic,S.G.Zaky. McGraw-Hill 2. Computer system Architecture: M. M. Mano. PHI





SECOND SEMESTER

Course

No.

Subject

Theory(worki -ng hours/week)


Duration of

university exams

(hours)

Maximum Marks

Written Exam Sessional

MCA- 201

COMPUTER BASED OPTIMISATION TECHNIQUE

3 ~~ 3 75 25

MCA- 202 DATA & FILE STRUCTURES 3 ~~ 3 75 25

MCA -203

COMBINATORICS & GRAPH THEORY

3 ~~ 3 75 25

MCA – 204 INFORMATION SYSTEMS

3 ~~ 3 75 25

MCA – 205 COMPUTER ORGANIZATION

3 ~~ 3 75 25

MCA – 206

PROGRAMMING LABORATORY-II (C++ & 8085 Micro Processor prog )

~~ 5 3 75 + 25

75 + 25

TOTAL MARKS 700




Programming Laboratory – II MCA –206 Practical: Exam. - 100 Sessionals – 100 Exercises are to be carried out on problems based on the courses 1. Data and File Structures and Combinatorics and Graph Theory in C++-- 75% 2. 8085




System Software MCA – 301

Theory Exam.- 75 Sessionals – 25

Prerequisite : Computer Organization , Data and File Structures. Review of machine architecture: Instruction set and addressing modes of the choosen machine Distinction between system software and application software Layered organization of system software . Assemblers: Elements of assembly language programming , assembly process - single pass and two pass assemblers( Architectures and Design) cross assemblers, macro processors(Design and Architectures) ; linking , loading and relocation program relocatibility . Compilers: Features of high level language Structure of a compiler - lexical analysis( role , input buffering, specification and recognition of tokens, Lexical analyzer generator) , syntax analysis (role of parser, Top-down parsing, Bottom-up parsing, Operator-precedence parsing, LR, SLR and LALR parsers- tables and algorithm); Syntax Directed Translation :- Definitions, Syntax trees, S-attributed definitions, L-attributed definition, Top-down translation( Design of a predictive translator), Bottom-up evaluation of inherited attributes(Inheriting attributes, simulating the evaluation of inherited attributes, synthesized attributes), Recursive evaluators, space for attribute values at compile time, Analysis of syntax – directed definitions; Intermediate code generation. Interpreter; use of tools such as Lex , Yacc etc. Software tools: Editors, debuggers, command interpreters, interactive programming environments. Books:

Introduction to system software: Dhamdhere,MeGraw-Hill.

Compiler Design: Abo,A.V.Sethi and Uliman J.D.

System programming and operating system : Dhamdhere, MeGraw-Hill.




MCA- 302 COMPUTER GRAPHICS AND MULTIMEDIA Theory -75marks Sessional -25 marks Pre-requisite : Data and File Structures Display Devices:

Line and point plotting Systems; Raster, vector, pixel and point plotters, Continual refresh and storage displays, Digital frame buffer , Plasma panel displays, Very high resolution devices , High - speed drawing , Display processors , Character generators , Color-display techniques ( Shadow mask and penetration CRT, color look - up tables , analog false colours , hard copy color printers ) . Display Description :

Screen co - ordinates , user co - ordinates ; Graphical data structures ( compressed incremental list, vector list, use of homogeneous co-ordinates ) ; Display code generation ; Graphical functions ; The view algorithms; Two - dimensional transformation . Interactive Graphics :

Pointing and positioning devices (cursor,light pen, digitizing tablet, the mouse , track balls) , Interactive graphical techniques. Positioning , Elastic lines , Inking , zooming , panning , clipping , scissoring,windowing,censoring . Graphic Language Primitives constants , actions , operators 3 -D Graphics:

Wire - frame perspective display, Perspective depth, Projective transformations, Hidden line and surface elimination, Transparent solids Shadowing . (GKS is to be used as the standard teaching tool). Concept of Image Processing :

Techniques and applications. Multimedia :

Introduction to multimedia, Concept of hypertext and hypermedia, Multimedia applications, Basics of Animation, Music and sounds, Audio basic Concepts, Digital and Analog basic concepts. MIDI hardware, MIDI messages, MIDI files, Video: Basic Concepts, Analog and digital video. Imaging and graphics, Image formats, Graphic formats, File format, Image quality and Graphic systems, Compression, Image Compression, Sound Compression, Video Compression. Books:

1. Computer Graphics : Hearn ID.and Baker.P.M. PHI 2. Principles of Interactive computer graghics : Newman W.Sproule, R.F. Mcgraw Hill




DATABASE MANAGEMENT SYSTEM – I MCA -303 Theory - 75 Marks

Sessional - 25 Marks Introduction : What is DBMS , advantage of using DBMS ,data models (object based logical models , record based logical models ) , DBMS users , overall system structure . Entity Relationship models: ER diagrams , generalization , specialization , aggregation . Database models - Network model , Hierarchical model , and Relational model. Relational Database : Underlying concepts , structure , study of relational languages (relational algebra , tuple relational calculus , domain relational calculus , SQL , QBE ) , storage and file structure , file organization . Indexing : Primary and secondary , B+ tree indexed files , B - tree indexed files , static and dynamic hashing , multiple key access , grid files , partitioned hashing . Relational Data Base Design : Integrity constraints ( domain constraints , referential , assertions , triggers , functional dependencies ) , Normalization (using FDs , multivalued dependencies , join dependencies ) , Domain -key normal form. Transactions : Concept , state , ACID properties , serializability and recoverability , testing for serializability . Concurrency Control : Lock - based , protocols , timestamp based protocols , validation based protocols , multiversion schemes , deadlock handling . Recovery System : Log based recovery (deferred and immediate database modification ), checkpoints , shadow paging , recovery with concurrent with transactions , buffer managements in recovery , recovery from loss of non - volatile storage , logical undo logging , transaction rollback , restart recovery , fuzzy checkpointing. Books : 1.Elmarsi and Navathe, fundamentals of Database Systems , Norsa publishing Company,1989. 2.J.D . Ullman , Principles of Database Systems , Galgotia Publishing Private Limited 3. Silberschatz, Korth and Sudersan , Principles of Database Systems Mc GrawHill Publication 4. C.J .Date An Introduction to Database systems , Vol - I And Vol II Addison - Wesley Publishing Company.




MICROPROCESSORS AND EMBEDDED DESIGN MCA- 304 Theory exam : 75 Sessional : 25 Introduction(5%) : Introduction to microprocessors, its evolution, use and application. Microprocessor Architecture(25%) : 8088 MPU, Signal description, memory organization, Instruction processing in 8085/8088 MPU, 80486-SX/DX 32 bit processors architecture, addressing modes of 80386, 80486-SX/DX 32 bit processors, data types, paging and segmentation. Introduction to Pentium Processors, its difference with 80486/80386. Advanced Programming(10%) : Stack and subroutines, Data conversion, BCD arithmetic, Interrupt and Interrupt service routine, Interrupt codes of 8085/8088. Peripheral and Interfacing(20%) : Basic peripherals and their interfacing with 8085/8088, Dynamic RAM interfacing, Interfacing I/O Ports, PIUO 8255 and its operation modes, Interfacing with D/A and A/D Convertors. Embedded Design(40%) : Case study - I : Introduction to Microprocessor based concept, Design of a Aluminium Smelter shell: General process Description, Normal Control electrolysis cell,Cell abnormalities in an aluminium shelter, Brief description of the control laws, salient issues in Design, Result and discussion. Case study – II : Design of an Electronic weighing bridge : Design issues, software development, calibration. Introduction to Micro controllers : Intel family 8 bit Micro controllers, Architecture of 8051, Signal description of 8051, Register set of 8051, memory and I/O addressing, interrupts, Design of 8051 micro controller based length measurement system for continuity rolling cloth paper. Embedded Operating System Design :

1. Using C-Cross Compiler for 8051, various instruction in C language for 8051, difference between ANSI-C & C-Cross Compiler for 8051, Added Instructions In C- Cross compiler.

2. Basics of RTOS(Real-Time Operating System), Designing of a Real-time O.S., Implementation of a RTOS in a S.B.C. based on 8051.

BOOKS: 1. Gaonkar : Microprocessor Architecture, Programming and applications with the 8085/8080A :

Latest Edition, WILEY EASTERN LIMITED. 2. Todd D.Morton : Embedded Microcontrollers, PEARSON EDUCATION. 3. Mazidi Mazidi : The 8051 Microcontroller & Embedded Systems,PEARSON

EDUCATION.




Object Oriented Programming and Design MCA - 305

Theory Exam. - 75 Sessionals – 25

Object Oriented Programming: Structured Programming and object Oriented Programming paradigms Key Concepts:

Data Abstraction: Class, object, constructors destructors, memory allocations for objects, member functions, friend functions templates.

Inheritance: Single & multiple inheritances, virtual base class. Polymorphism: Compiler time polymorphism, Virtual function, pure virtual

function, abstract class, dynamic binding. Exception handling.

Implementation of above concepts in Java with its advanced features for application development Object Oriented Design: Object Oriented Design Approaches, Object Modeling Techniques (OMT) tools: Object Model, Dynamic Model, and functional Model. (Object Diagram, State Diagram, and DFD). Phases of Object Oriented Development: Object Analysis, System Design, and Object Design UML (Unified Modeling Language): UML History, Goals of UML, Concepts in UML. UML Views: Static View, Case View, Interaction View, State Machine View, Activity View, Physical View, and diagrammatic representations. Case studies in object oriented application design. Books:

1. Herbert Shield: The Complete Reference to Java 2, Osborn McGraw Hill. 2. Ram Baugh et al Object Oriented Modeling and Design, PHI (EEE). 3. Ram Baugh, Booch, Jacobson: Unified Modeling Language Reference

Manual.




Programming Laboratory- III MCA - 306

Practical: Exam.- 100 Sessionals - 100

Programming exercises are to be carried out on problems based on the courses -

1. MCA - 305 (Object Oriented Programming and Design) in Java including concept of JDBC & BDK.

(Exam-50 marks, Sessional-50 marks) 2. Embedded Design Lab.

(Exam-50 marks). 3. Seminar (On State of Art Technologies)

(Sessional- 50 marks).





THIRD SEMESTER

Course

No.

Subject



Duration of

university exams

(hours)

Maximum Marks

Written Exam

Sessional

MCA- 301

SYSTEM SOFTWARE

3 ~~ 3 75 25

MCA- 302

COMPUTER GRAPHICS & MULTIMEDIA

3 ~~ 3 75 25

MCA -303 DATABASE MANAGEMENT SYSTEM - I

3 ~~ 3 75 25

MCA – 304

MICROPROCESSOR AND EMBEDDED DESIGN

3 ~~ 3 75 25

MCA – 305

OBJECT ORIENTED PROGRAMMING AND DESIGN

3 ~~ 3 75 25

MCA – 306

PROGRAMMING LABORATORY-III (Java, Embedded design & Seminar)

~~ 5 3 100 100

TOTAL Marks 700




Operating Systems MCA - 401

Theory: Exam. - 75 Sectionals – 25

Prerequisite : Computer Organisation, System software Historical perspective: Batch processing, multiprogramming, time-sharing, distributed system, Functions, components and structure of an operating system. Process Management: Support for concurrent processes - Shared data, Critical sections, Mutual exclusion, Mutual exclusion, busy form of waiting, lock and unlock primitives, semaphore, Synchronization, block and wakeup, Inter process communication, message passing mechanism. Threads: Multithreading Models, Threading issues, Pthreads. Scheduling : Process states, interrupt mechanisms, scheduling algorithms, implementation of concurrency Primitives. System deadlock : Prevention , detection and avoidance . I/O Management I / O Software goals and structure, Device drivers , Terminal handling, Block and character devices. Memory Management: Contiguous and non - contiguous memory allocation; Swapping Virtual memory paging and Segmentation -page replacement and space allocation policies. File System: System Structure, File management strategies, tradeoffs, Directory structures, File system protection, Security, Integrity, Device independence. Concepts of Distributed Operating System. Example operating system - UNIX / LINUX Books: 1. A, Gaivin P: Operating system concepts, 4th ed. Addision - Wesley Publishing Co. 2. Milenkovic M. : Operating System - Concepts and Design, McGraw Hill. 3. Tanenbaum A.S. : Operating System - Design and Implementation , PHI (EEE) 4. Bach, M. : Design of the UNIX operating system, PHI ( EEE) .




Database Management System - II MCA - 402 Theory - 75 marks

Sessional - 25 marks Query Processing : Study of algorithms for selection operations , sorting , join operations , projection , set operations , aggregation ; measurement of cost , evaluation of expressions, transformation of relational expressions , optimization techniques. Parallel Databases : Introductory concepts ,partitioning techniques , interoperation parallelism - parallel sort (range partitioning sort, parallel external sort-merge ), parallel join ( partitioned join, fragment-and-replicate join, parallel hash join ), interoperation parallelism ( pipelined, independent ). Distributed Databases : Replication and fragmentation, network transparency, join processing, distributed transaction processing, two-phase and three-phase commit protocols, handling failure, coordinator selection, concurrency control ( locking, timestamping ), deadlock handling ( centralized, fully distributed ), multidatabase systems. Object Oriented Databases : Object classes, inheritance, DAG representation, object identity and persistence ( brief introduction to ODMG C++ ), storage structure for object oriented databases. Security and Integrity : Violations, authorization, views, privileges, granting privileges, security specification in SQL. Introductory concepts on following topics : Data mining and data warehousing, multimedia databases, distributed information systems, information retrieval systems, spatial and graphical databases, transactions processing monitors, transactional workflows, active and main memory databases. ( Example and case studies from ORACLE to be discuss in the course ) Books :

1. Elmasari and Navathe, Fundamentals Of Database System, Narosa Publishing Company, 1989. 2. J.D. Ullman, principles of Database Systems, Galgotia Publishing Private Limited. 3. Silberschats, Kroth and Sudershan, Principles of Database Systems, McGraw Hill Publication. 4. C.J. Date, An Introduction to Database Systems, Vol-I and Vol-II, Addison-Wesley Publishing

Company.




Software Engineering MCA - 403 Theory - 75 marks

Sessional - 25 marks Introduction to Software Engineering: Software development and life cycle; project size and its categories. Software Project Management: Planning of a software project; project - control and project team standards; Scheduling, Risk management, Configuration management. Software cost estimation and evaluation techniques. Software requirements analysis and specification techniques: Different methodologies and techniques. Software Design: Various design concepts and notations; Modern design techniques; high level design and detailed design; Structured design, object -oriented design. Coding: Standards and guidelines for coding, coding walkthrough, code inspection. Verification and Validation methods: Documentation and implementation procedures; Performance of software systems ; software metrics and models; Documentation of project systems , manuals and implementation . Testing: Structural Testing, Unit Testing of a test suite etc. Software Reliability: Definition and concepts of software reliability; Software errors, faults, repair and availability - re-availability and models; use of database as a case tool. Software Quality Control and Management - ISO 9000 and CMM - SEI models. Software Maintenance: Categories of maintenance; Problems during maintenance; solution to maintenance problems, Maintenance process, Maintenance models, Reverse Engineering, Software Re-Engineering, Estimation of Maintenance costs. Case Tools. Books :

1. R.E. Fairley, Software Engineering Concepts, McGraw Hill Publication. 2. Pankaj Jalote, An Integrated Approach To Software Engineering, Narosa Publishing House, 1999. 3. Roger S. Pressman, Software Engineering : A Practitioner’s Approach, McGraw Hill Publication. 4. Ian Somerville, Software Engineering, Addison Wesley. 5. C. Ghezzi M. Jazayeri and D. Mandrioli, Fundamentals of Software Engineering, Prentice Hall Of

India, 1994. 6. Rajib Mall, Fundamentals of Software Engineering, Prentice-Hall of India, 1999.




Computer Communication MCA 404

Theory: Exam.- 75 Sessionals – 25

Overview: Objectives and Applications of Computer Communication Computer Communication Network Architecture: ISO - OSI reference model, design philosophy, layer, protocol, interface and service concepts. Layer -wise functionality. Physical Layer: Concepts of data transmission, Analog and Digital Transmission, Asynchronous and synchronous transmission, Transmission media, Multiplexing, Switching techniques, modulation and multiplexing methods modem, encoding methods, communication media, standard protocols, RS - 232c, RS -- 449, X. 21 . Medium Assess Control in broadcast networks : ALOHA , CSMA , CSMA /CD , token ring token bus, Standard LAN Protocols ( IEEE 802. X), FDDI, satellite networks. Data link layer : Framing, error control techniques, data link protocols and their performance , SDLC protocols. Network Layer : Services, virtual circuits and data gram subnet, routing algorithms( shortest path, flooding, flow based, distance vector, link state, hierarchical, broadcast and multicast), congestion control, traffic shaping , flow specifications, choke packets, load shedding, jitter control, control in multicasting. Principles of Inter Networking : Concatenated virtual circuits, connectionless inter networking, tunneling, routing, fragmentation, firewall, and gateways. Transport services primitives, Berkley sockets(case study only). Books 1. Tanenbaum A.S., Computer Network, PHI (EEE). 2. Stalling , Data and Computer Communication , PHI (EEE)




Design and Analysis of Algorithms MCA-405 Theory-75 Sessional-25 Introduction to algorithms, analysis, asymptotic notation (O,,), mathematical induction. Recurrences: The substitution, recursion-tree and the master theorem.

Randomized algorithms: Indicator random variables, probabilistic analysis and uses of random variables.

Data structures: Priority queues, binary heaps, binomial and fibonacci heaps, binary search trees, Cost Amortization.

Design and Analysis Techniques: Divide and Conquer, merge sort, finding closest pair of points.

Greedy Algorithms: Coin charging, Kruskal’s, Prim and Dijkstra’s algorithm, Knapsack problem.

Dynamic Programming: Coin charging problem, matrix multiplication, longest common subsequence, Floyd and Warshall algorithm. Application of Sorting and Searching.

Graph Algorithms: Topological sort, minimum spanning trees, shortest paths, maximum-flow – Flow networks, Ford-Fulkerson method, Maximum bipartite matching.

Problem classes: P, NP, NP-Complete, Easy vs Hard, Polynomial time, non-deterministic algorithms, reducibility.

Approximation Algorithms: Traveling salesman problem, Parallel and Distributed algorithms.




Programming Laboratory – IV MCA – 406 Practical Exam: 100 Sessional: 100

Programming exercises are to be carried out on problems based on the courses - 1. MCA – 401 & MCA-404 (Operating System & Computer Communication)

- 50% (viz. Unix/Linux). 2. MCA – 303 & MCA-402 (Database Management System)

in Database packages. - 50%(viz.VB & Oracle).





FOURTH SEMESTER

Course

No.

Subject

Theory(worki

ng hours/week)


Duration of

university exams

(hours)

Maximum Marks

Written Exam

Sessional

MCA- 401

OPERATING SYSTEMS

3 ~~ 3 75 25

MCA- 402 DATABASE MANAGEMENT SYSTEM - II

3 ~~ 3 75 25

MCA -403 SOFTWARE ENGINEERING

3 ~~ 3 75 25

MCA – 404 COMPUTER COMMUNICATIONS

3 ~~ 3 75 25

MCA – 405 DESIGN AND ANALYSIS OF ALGORITHMS

3 ~~ 3 75 25

MCA – 406 PROGRAMMING LABORATORY-IV (Unix and DBMS based)

5 ~~ 3 100 100

TOTAL Marks 700




DATA WAREHOUSING & DATA MINING MCA-501 Theory –75

Sessional-25 DATA WAREHOUSING 50% Concept of data warehousing its evolution. Scope of data warehouse type of data and their use, metadata & their types Data warehouse architecture: System process, process flow within a data warehouse, extract and load process, backup and achieve process, query management process. Process architecture, load manager, warehouse manager, warehouse manager architecture, query manager architecture. Data warehouse schema. Fact data, Dimension data, Partitioning data, data marting. Design: Multidimensional Data model, Data cube, OLAP operations Database schemas – star,starflake,snowflake schemas, multidimensional schemes, partitioning strategy, Aggregation, Data marting, Metadata system and Data warehouse process managers. Hardware and operational Design: - Hardware architecture, physical layout security backup recovery, Capacity planning, Tuning & Testing data warehouse. DATA MINING : - 50% Concept of data mining- learning- data warehouse and data mining. KDD and Data Mining The knowledge Discovery process its different stages Data Mining Techniques – Verification model, Discovery model. Fundamental concept of Association rule, Classification rule, Learning, Neural networks, Genetic algorithm, Rough set techniques. Support vector mechanism, Web mining, Text mining, Sequence mining, Spatial Data mining, Issues and challenges in Data mining, Data mining application areas(example with practical case studies) Features of some DM algorithm Priori, Partition, and Border algorithm ( Association rules) Types of clustering algorithm with features of Kmedoid& K mean algorithm, CLARA, CLARANS,DBSCAN Books :

1. Data Warehousing in the Real World. - By Sam Anahory, Dennis Murray (Pearson Education Asia)

2. Data Mining - By Peter Adriaans, Dolf Zantinge (Pearson Education Asia)

3. Data Warehouse, from Architecture to Implementation. - by Barry Devlin ( Addison Wesley language )

4. Data Mining Techniques- By Arun K. Pujari(University Press)




COMPUTER NETWORKS MCA - 502

Theory: Exam.- 75 Sessionals - 25

Internet protocols: - Internet control Message protocol (ICMP) IPV6 classes and subnet address extension (CIDR) Routing Protocols: - Border Gateway Protocols (BGP), GGP, Open shortest path first protocol (OSPF), Routing Information protocols (RIP), Hello Protocol, Internet Multicasting, Mobile –IP Fundamental concepts of wireless networking and wireless application protocols. Transport Protocols: - Internet Transport protocols. TCP and UDP, TCP protocols, ports, connections and end points, TCP header connection management, acknowledgements and Retransmission, Timeout and Retransmission congestion control, TCP connection reset, TCP state machine, performance UDP format, Pseudo-header, encapsulation & protocol laying, UDP checksum computation, wireless TCP & UDP. TCP / IP configuration and Administration basics (Special topics: - Setting up sample network servers, clients) DNS, NFS (Network File System), Remote procedure call, SNMP, MIME, URL, Socket programming Interface, Creating and binding socket, services, commands sending receiving data through socket Bootstrap and Auto configuration (BootP, DHCP) ATM ATM network, B-ISDN & ATM reference model, Protocol architecture, Logical connections cell adaptation layer, ATM AAL protocols, AAL-1, AAL-2, AAL-3/4, AAL-5, B-ISDN networking concepts B-ISDN user network interface, General architecture of B-ISDN, Networking techniques Broadband network performance, Traffic Management aspects, QoS, ATM LAN, Wireless ATM and Mobile ATM. Network Security Cryptography principles, Secret-Key, Public key algorithms, Authentication protocols Public key encryption and Digital Signatures IPV and IPV6 security. Books: -

1) Computer Network (Third Edition) By- A.S. Tanenbaum 2) Internetworking with TCP/IP (Vol-I, Vol-II & Vol-III) By – Comer 3) Computer and Data Communication By- Stallings




Computer Architecture MCA - 503

Theory: Exam.- 75 Sessionals - 25

Prerequisite : Computer Organization, Operating System. Introduction to Parallel Processing : Parallel Processing mechanism Parallelism in uniprocessor systems. Parallel Computer Structures: Architecture classification scheme. Pipeline and Vector Processing Processing : Instruction and arithmetic pipelines ; Vector Processing requirements; Pipeline computers and vectorization methods; Various vector processors : STAR 1 00 , CRAY - 1 , CYBER - 205, Fujitsu 200 and their special features . SIMD Array Processors : Parallel algorithms for array processors; SIMD computers and performance enhancement . Multiprocessor Architectures and Programming : Functional Structures, Interconnection networks , parallel memory organizations ; Multiprocessor Control and Algorithms , lnterprocess Communication Mechanism . System Deadlocks and Protection ,Multiprocessor Scheduling Strategies, Parallel algorithms for multiprocessor - synchronous and asynchronous . Data Flow Computers: Data - driven computing and languages ; Advantage and potential difficulties , etc . Books: 1. Hawang , K., Briggs, F.A. : Computer Architecture and Parallel Processing, McGraw Hill , 1985 2. Evans , D.J. : Parallel Processing System, Cambridge Univ . , 1982. 3. Stone , H.S. & Others : Introduction to computer Architecture, 2nd

Edition. , Galgotia Publ. Ltd . 1987.




Artificial Intelligence

MCA-504 Theory –75 Sessional-25

Introduction to the object and goal of artificial intelligence: Aim and scope of the artificial intelligence, problem space and problem characteristics, state space representation. Problem solving techniques: Generate and test, hill climbing , search problem reduction techniques, constraint propagation, means-end-analysis, heuristics search techniques and heuristic problem solving . Game playing: And or graph search, game trees and associated techniques, minimax and alpha beta pruning. Some case studies. Knowledge representation and inferencing : Procedural and deductive approaches production system formalism, predicate logic (first order and second order), Rule based system, schematics net, conceptual dependencies, conceptual path, frames, scripts associated inferencing mechanism. Resolution in predicate logic, unification , natural deduction theorem proving, forward and backward deduction. Different techniques for reasoning under uncertainty, monotics and non monotic reasoning. Constraint satisfaction problem Rule based system and expert system: Domain exploration, meta language ,expertise, transfer self explaining system case studies(dendral, mycin) Introduction to neural network: Defination and representation of artificial neuron and its analogy with biological neuron, basic concepts of three layer neural-net and learning by back propagation. Basic syntax and semantics of lips and prolog. Programming exercise from ai in lips. Books:

1. Artficial Intelligence By Patrick,Henry,Winston , Pearson Education. 2. Introduction to Artificial Intelligence By Charniak, Mc Dermott, Pearson

Education. 3. Artificial Intelligence By Nilson 4. Artificial Intelligence By Rich and Night




Web Technology

MCA-505 Theory –75 Sessional-25

1. Internet Basics – Network Connectivity Types- dial up- PPP, SLIP; leased, VSAT, ISP, HTTP, TCP/IP, IP Address, Domain Names, DNS, Services-email, WWW, Search Engine. 2. Concept of Client –Server Computing – Paradigm, Thin Client vs. Flat Client, Middle ware, Client Pull, Server Push, Hypermedia Information, Concept of Threading/Multithreading 3. Web Client- Browser +Architecture, Basic features & Functions, Client-side Inclusive- Scripts, VB Scripts, Java Scripts, Activex, ASP, Plugins, Case Study- Netscape Communicator, IE. 4. File Server and Mail Server – FTP, Telnet, SMTP, MIME etc. 5. Web Server – Stateful vs. Stateless Servers, Web Server Architecture, Basic features & Functions, URL, Server side inclusive – CGI, API, PERL, Web database Connectivity- JDBC, ODBC, Case Study- IIS, Apache, Tomcat. 6. Web Application Development – HTML, DHTML with DTD concept <head> & <body> section, able, form, Frame, hyperlinks, Web Page Design using HTML authoring tools- FrontPage/ Dream weaver. 7. Web Security – Firewalls, Tunnels, SSI, X-HTTP, IPV & IPV6 security, Digital Signature. 8. Web Object Model – CORBA, COM, DCOM, IIOP, Coexistence with VRML & XML.

BOOKS: 1.Asp .net Using VB.net – Wrox Press Ltd - By Cornes,Goode,Sussman,Krishnamoorthy,Miller. 2. Web Technology By Deital & Deital




Elective I

Microprocessors Artificial Intelligence Distributed Systems Image processing Expert Systems Organizational Structures and personnel management Software Tools and Utilities Information Storage and Ret rival

Elective II

Multimedia Systems Web Technology Computer aided management Managerial economics Simulation and modeling Marketing Management Office automation Technologies Performance evolution of Computer Systems Materials management Programming languages and paradigms Wireless & Mobile Computing





FIFTH SEMESTER

Course

No.

Subject


Programming Lab

(working hours /week)

Duration of

university exams

(hours)

Maximum Marks

Written Exam

Sessional

MCA- 501 DATAWAREHOUSING AND DATA MINING

3 ~~ 3 75 25

MCA- 502 COMPUTER NETWORKS 3 ~~ 3 75 25

MCA –503 COMPUTER ARCHITECTURE

3 ~~ 3 75 25

MCA – 504 ELECTIVE-I

3 ~~ 3 75 25

MCA – 505 ELECTIVE - II 3 ~~ 3 75 25

MCA – 506

SYSTEM DEVELOPMENT PROJECT-I

5 ~~ 3

PROJECT SEMINAR AND VIVA

100

SESSIONAL 100

TOTAL Marks 700





SIXTH SEMESTER

Course

No.

Subject

Theory(worki

ng hours/week)

Programming Lab

Duration of

university exams

(hours)

Maximum Marks

Written Exam

Internal Assessmen

t

MCA –601 SYSTEM DEVELOPMENT PROJECT-I

TRAINING IN AN ORGANISATION

PROJECT SEMINAR AND VIVA

150

SESSIONAL 150

TOTAL Marks 300




theory of computer science mca-101

Documents