5. mca curriculum and syllabi

VIT VELLORE INSTITUTE OF TECHNOLOGY UNIVERSITY

VELLORE - 632 014

School of Computer Sciences Curriculum (Credit System)

Degree of Master of Computer Applications (MCA) 2009 – 2010 onwards

VIT – A place to learn; A chance to grow; Core Papers (97 Credits) Code Paper Lecture Tutorial Practical Credits Prerequisite DM Discrete

Mathematics 3 1 0 4

CO Introduction to Computer Organization

3 0 0 3

AFM Accounting and Financial Management

3 0 0 3

PC Programming in C

3 0 0 3

PPL Principles of Programming Languages

3 0 0 3

WD Web Designing

3 0 0 3

PCL C Programming Laboratory

0 0 3 2 PC

WDL Web Designing Laboratory

0 0 3 2 WD

AAD Algorithm Analysis & Design

3 1 0 4

CA Computer Architecture

3 0 0 3 CO

DS Data Structures

3 0 0 3

MP Micro Processors

3 0 0 3 CO

PCPP Programming in C++

3 0 0 3 PC

PCPPL C++ Programming Laboratory

0 0 3 2 PCPP

MPL Micro Processors Laboratory

0 0 3 2 MP

CN Computer Networks

3 0 0 3 OS

CNL Computer Networks Laboratory

0 0 3 2 CN

DBMSI Database Management System I

3 0 0 3 AAD & DS

DBMSII Database Management System II

3 0 0 3 DBMSI

PJ Programming in Java

3 0 0 3 PCPP

SWE Software Engineering

3 0 0 3 PC

SWEL Software Engineering Laboratory

0 0 3 2 SWE

TC Theory of Computation

3 1 0 4 DM

DBMSL Database Management Systems Laboratory

0 0 3 2 DBMS

PJL Programming in Java Laboratory

0 0 3 2 PJ

CC Compiler Constructions

3 0 0 3 PC

UML Unified Modeling Language

3 0 0 3 PCPP & SE

OS Operating Systems

3 0 0 3 CO & CA

PVCPP Programming in Visual C++

3 0 0 3 PCPP

MC Mobile Computing

3 0 0 3 CN

SPL Systems Programming Laboratory

0 0 3 2 CC & OS

PVCPPL Programming in Visual C++ Laboratory

0 0 3 2 VCPP

PCS Programming in C#

3 0 0 3 PCPP

PCSL C# Programming Laboratory

0 0 3 2 PCS

SOA Service 3 0 3 3 OS & CN

Oriented Architecture

Electives (9 Credits) Code Paper Lecture Tutorial Practical Credits Prerequisite CG Computer

Graphics 3 0 0 3 AAD & DS

DWDM Data Warehousing and Data Mining

3 0 0 3 DBMS

DC Distributed Computing

3 0 0 3 OS

SC Security in Computing

3 0 0 3 AAD, DS, CN, OS, & DBMS

GC Grid Computing

3 0 0 3 OS & CN

SWPM Software Project Management

3 0 0 3 SWE

ABIS Agent based Intelligent Systems

3 0 0 3 AAD & DS

DIP Digital Image Processing

3 0 0 3 AAD & DS

EC Enterprise Computing

3 0 0 3 DBMS

CV Computer Vision

3 0 0 3 AAD & DS

OSP Open Source Programming

3 0 0 3 PCPP

PC Pervasive Computing

3 0 0 3 PCPP & PJ

PECS Performance Evaluation of Computer System

3

0 0 3 CO & OS

MC Mobile Commerce

3 0 0 3 WD

BPM Business Process Management

3 0 0 3 AFM

Project Work (24 Credits) Code Paper Type Credits Prerequisite PW1 Project Work 1 In House (To be done in VIT University) 4 91 credits PW2 Project Work 2 Preferably Industrial 20 106 credits

Discrete Mathematics

L T P C3 1 0 4

Aims & Objectives To introduce students to the fundamentals of discrete mathematics.

Learning Outcome On completion of this course students will be able to take up other course such as databas .

Content

Unit I

Notion of proof: proof by counter-example, the contra-positive, proof by contradiction, inductive proofs.

Unit II

Algebra: Motivation of algebraic structures; review of basic group theory with emphasis to finite groups: subgroups and group homomorphism,

Unit III

Lagrange's theorem. Commutative rings, ideals. Finite fields and their elementary properties.

Unit IV

Combinatorics: Basic counting techniques, pigeon-hole principle, recurrence relations, generating functions, Polya's counting theorem. Basics of graph theory. Introduction to probabilistic method in combinatorics.

Unit V

Formal logic: Propositional logic: proof system, semantics, completeness, compactness. Length of proofs, polynomial size proofs, efficiency of proof systems. First order logic: models, proof system, compactness. Examples of formal proofs in, say, number theory or group theory.

Text Book Johnsongaugh – Discrete Mathematic, Addition-Wesly, Indian Edition.

Reference Books Kenneth H. Rosen – Discrete mathematics & Its Applications, Amazon Publishing Co. Sixth Edition.

Introduction to Computer Organization L T P C3 1 0 4

Aims & Objectives To introduce students to the digital components of a system. Emphasis is on data conversion, Boolean algebra, sequential and combinational circuits, ALU Design and computer design

Learning Outcome On completion of the course the student will be able to design a simple digital system. Contents Unit I

Introduction: Overview of basic digital building blocks; truth tables; basic structure of a digital computer.

Unit II

Number representation: Integer - unsigned, signed (sign magnitude, 1's complement, 2's complement, r's complement); Characters - ASCII coding, other coding schemes; Real numbers - fixed and floating point, IEEE754 representation.

Unit III

Assembly language programming for some processor. Basic building blocks for the ALU: Adder, Subtractor, Shifter, Multiplication and division circuits.

Unit III

CPU Subblock: Datapath - ALU, Registers, CPU buses; Control path - microprogramming (only the idea), hardwired logic; External interface.

Unit IV

Memory Subblock: Memory organization; Technology - ROM, RAM, EPROM, Flash, etc. Cache; Cache coherence protocol for uniprocessor (simple).

Unit V

I/O Subblock: I/O techniques - interrupts, polling, DMA; Synchronous vs. Asynchronous I/O; Controllers. Peripherals: Disk drives; Printers - impact, dot matrix, ink jet, laser; Plotters; Keyboards; Monitors. Advanced Concepts: Pipelining; Introduction to Advanced Processors.

Text Book M. Morris Mano – Digital Logic and Computer Design PHI – 5

th Edition- 2004.

Reference Books

A.P. Malvino and D.P. Leach – Digital Principles and Applications – Tata McGraw Hill 4th

Edition – 1999. Thomas Floyd – Fundamentals of Digital System – Pearson Education.-3

rd Edition – 2003.

Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Accounting and Financial Management L T P C3 1 0 4

Aims and Objectives The main objective of this subject is to provide basic working knowledge of accounting and financial management and to know how accounting and financial management helps the management to take decision. It provides analysis and interpretation of financial statements of organizations and understand the budget and budgetary control in organizations. It helps to find out marginal cost incurred and acquire knowledge in project proposal method using capital budgeting.

Learning Outcome

On completion of this subject the students will be able to predict the financial statement of public limited company and capable of preparing the various budgets and forecasting the future needs of the business.

Contents

Unit I

Principles of Accounting

Principles of Double entry – Journalizing, Ledger – Posting and preparation of Trial Balance – Preparation of Trading Account, Profit and loss Account and Balance Sheet including Adjustments (Simple problems only), Bank Reconciliation Statement – Concepts, Conventions and Basic Accounting Assumptions.

Unit II

Analysis Interpretation of Financial Statements

Ratio analysis – uses of ratios in interpreting the Final Accounts (Trading a/c–Profit and Loss A/c and Balance Sheet) – Final Accounts to as well as Ratios to Final Accounts Problems. (Simple problems only).

Unit III Break–even Analysis and Marginal Costing Meaning of variable cost and fixed cost – Cost–Volume – Profit Analysis – Calculation of Break–even point, Profit Planning, Sales planning and other decision – making Analysis involving Break–even Analysis.

Unit IV

Budget/Forecasting

Preparation of and Characteristics of functional Budgets – Production, Sales, Purchases, Cash and Flexible budgets, Zero Based Budgeting.

Unit V Project Appraisal Method of Capital investment decision making: Pay back Method, ARR Method – Discounted Cash Flow – Methods including Net Present Value and IRR Method. Text Book

R. L. Gupta and Radhaswamy. Advanced Accountancy, Volume One, Sultan Chand & Co., 2003.

Reference Books B. K. Bhar, Cost Accounting–Methods and Problems, Academic Publisher, 1995.

S. N. Maheswari, Elements of Management Accountancy, Sultan Chand & Co., Third Edition, 1996.

P.C. Tulisan. Financial Accounting. Tata McGraw Hill Publication, New Delhi. First Edition, 2002. Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Programming in C L T P C3 1 0 4

Aims & Objectives

To introduce students to the concepts of C programming. The emphasis is on the following topics functions, arrays, pointers, structures, files and solving problems using the above concepts.

Learning Outcome The students will be able to develop application programs using C language. Contents Unit I A tutorial introduction, Unit II Types, Operators and Expressions, Control flow, Unit III Function and Program structure, Unit IV Pointers and Arrays, Unit V Structures, Input and Output. Text Book The C programming Language, Brian W. Kernighan & Dennis M. Ritchie, Second edition. Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Principles of Programming Languages

L T P C

3 1 0 4

Aims & Objectives

The basic thrust of this course will be on learning the distinctive techniques in the different paradigms and what semantic and compiling issues come up in the various languages considered.

Contents

Unit I

Imperative Languages: block structure, scope rules, parameter passing, constructs like co-routines, tasks.

Unit II

Functional programming: functions, recursion, macros, user-defined control constructs, higher order constructs, types, data abstraction, polymorphism, semantics, implementation issues.

Unit III

Declarative programming: declarative programming, Horn clauses, procedural interpretation of Horn clauses.

Unit IV

SLD-resolution including unification, the logical variable, implementation issues: abstract machines and compiling to abstract machines.

Unit V

Object-oriented programming: objects and programming with objects, classes and instances, hierarchies and inheritance, encapsulation, semantics of OO languages and implementation issues.

Books and References

D. A. Watt. Programming Languages and Paradigms , Prentice-Hall, 1990. J. LLoyd. Foundations of Logic Programming , Springer Verlag, 1984. M. Hennessey. The Semantics of Programming Languages , John Wiley, 1990. Luca Cardelli and P. Wegner. On Understanding Types, Data Abstraction and Polymorphism, Computing Surveys, 17(4), pp 471, 1985. C. Reade. Elements of Functional Programming , Addison Wesley, 1989. L. C. Paulson. ML for Working Programmer , Cambridge University Press, 1991. B. Stroustrup. The C++ Programming Language , Addison Wesley.

Web Designing L T P C3 1 0 4

Aims & Objectives To make students understand intricacies of the various aspects of web portal development and to enhance the skills of writing content for web pages and to make efficient site maps to navigate web pages. It enables to understand the procedure for hosting the web pages on the internet/intranet and to exploit the client server architecture and it allows to dynamically update web pages using Active server pages and Dynamic HTML. Learning Outcome The students will be able to develop interactive websites. Contents Unit I Introduction to Web Designing and HTML Introduction to Web Designing – Web Server, Web Client – Browser & Web Server Communication – HTTP Protocol – HTML Document Basic Structure – Creating Links between Documents – Creating Tables – Creating Forms – The Input Element – Select Element – Text Area Element. Unit II VB Script and DHTML DHTML Object Model – Underlying Principles of the DHTML – Basic Components of DHTML – Introduction of Scripting – Scripts in HTML – VBScript – Variables – Functions – Intrinsic Functions – Conditional & Loops – VBScript Objects – Building a Sample Form. Unit III JavaScript JavaScript – Introduction to JavaScript – Variables – Conditional and Loops – Events – Functions – Frames – HTML document – Predefined Objects – Image Object – Layers – Drag and Drop – Building a Sample Form. Unit IV Cascading Style Sheets and Multimedia CSS – Introduction to Cascading Style Sheets – Inline Styles – Style Sheets – Grouping & Short Hand Properties – Inheritances – Classes – Link – Cascading Styles – Dynamic Style – Multimedia on the Web – Playing Multimedia – Streaming Multimedia – Animated GIFs – Creating Video Audio for the Web. Unit V Active Server Pages Web Services – ASP Fundamentals – ASP Objects – Application Object – Session Object – Request Object – Response Object – Session Object – Design a Simple Web Page Using ASP –Design a simple web page with database connectivity. Text Book Eric M. Schurman William J. Pardi.-Dynamic HTML in Action, 2

nd Edition, Web Technology-1999.

Reference Books Microsoft Visual Interdev 6.0, Microsoft Press-1998. William Martiner -VB Programmer’s Guide to Web Development,.- 1999 Ivan Bayross -Web Enabled Commercial Application Development Using HTML, DHTML, Java Script, Perl, CGI-2000. Scot Hillies and Daniel Mezick -Programming Active Server Pages, Microsoft Press.-1997 Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Algorithm Analysis and Design L T P C3 1 0 4

Aims & Objectives To introduce students, the concepts of algorithm analysis for find out the space and time complexity of different algorithms. Different design techniques such as greedy method, divide and conquer, backtracking, dynamic programming, branch and bound are to be studied for finding the solution to the different problems. It also provides an insight into the basic concepts of NP and NP-hard problems and their relevance in research. Learning Outcome On completion of this subject the student shall be able to find out the efficiency of algorithms for different problems. Contents Unit I

Order Analysis: Objectives of time analysis of algorithms; Big-oh and Theta notations.

Unit II

Dynamic Programming: methodology and examples (Fibonacci numbers, matrix sequence multiplication, longest common subsequence, convex polygon triangulation). Greedy Method: Methodology.

Unit III

Max Flows: Max Flows (Ford-Fulkerson and bipartite matching). Fast Fourier Transform. Polynomial multiplication, integer multiplication and division.

Unit IV

Number-theoretic Algorithms: GCD, Modulo arithmetic, Chinese remaindering. Geometric algorithms: convex hull, closest pair, intersection of line segments, polygon triangulation.

Unit V

Randomized Algorithms: identity testing, primality and min-cut. Approximation Algorithms: max-cut, tsp, vertex-cover, Backtracking.

Text Book E. Horowitz, S.Sahni and S. Rajasekaran – Computer Algorithms – Galgotia – 2005.

Reference Books G. Brassard and P. Bratley – Fundamentals of Algorithms – PHI – 2002

T. Cormen, C.E. Leiserson, R.L. Rivest & C. Stein – Introduction to Algorithms – PHI – 2nd

Edition, 2005.


Computer Architecture L T P C3 1 0 4

Aims & Objectives To introduce students to the architecture of a computer system. The emphasis is on the following topics: pipeline & vector processing, arithmetic operations on integer, decimal data and floating point data. Working of the functional units like CPU, memory and I/O, various interconnection structures and inter-processor arbitration.

Learning Outcome The students will be able to gain the knowledge about the internal architecture of the computer systems. Contents

Unit I

Introduction: Overview of Computer Architecture, Performance evaluation of processors, pipelining, super-pipelines, Advanced pipelines, static and dynamic scheduling, instruction-level parallelism, loop unrolling, VLIW and Super scalar processors, Vector processing and array processing.

Unit II

Memory: bandwidth issues, memory organization, cache coherence

Unit III

Symmetric multiprocessors (SMP), NUMA-MPs, Massively parallel processors, Cache coherence protocols

Unit IV

Interconnection networks, I/O processing, multiprocessing, multiplexing,

Unit V

Examples of contemporary architectures, RAS (Reliability, Availability, Scalability) features.

Text Book M. M. Mano – Computer System Architecture – 3

rd Edition – PHI – 1994.

Reference Book

J. P. Hayes – Computer Architecture and Organization – McGraw–Hill , 3rd

Ed, 1998.


Data Structures L T P C3 1 0 4

Aims & Objectives To introduce students to the different data structures and their applications. The emphasis is on the following: stacks, queues, linked lists, trees and graphs, hashing, sorting techniques and tree indexing techniques.

Learning Outcome The students will be able to appreciate the importance of various data structures.

Contents

Unit I Arrays and Abstract Data Types Abstract Data Types – Asymptotic Notations– Complexity Analysis – Arrays – Representation of Arrays – Operations on Arrays – Ordered Lists – Polynomials. Unit II Linked Lists Singly Linked Lists – Circular Linked Lists – Doubly Linked Lists – Stacks – Queues – Circular Queues – Evaluation of Expressions.

Unit III Trees and Graphs Trees – Binary Trees – Binary Tree Traversals – Binary Tree Representations – Binary Search Trees – Threaded binary Trees – Application of Trees (Sets) – Representation of Graphs – Graph Implementation – Graph Traversals– Application of Graph Traversals– Minimum Cost Spanning Trees – Shortest Path Problems. Unit IV Sorting Techniques Internal Sorting – Optimal Sorting Time – Sorting Large Objects – Sorting with Tapes – Sorting with Disks.

Unit V Hashing and Tree Indexing Hashing – Red–Black Trees – Splay Trees – B–Trees. Text Book E. Horowitz, S. Sahni and Mehta. Fundamentals of Data Structures in C++. Galgotia . 2005

Reference Book

Gregory L. Heileman – Data Structures, Algorithms and Object Oriented Programming – McGraw Hill International Editions – 2002 Mode of Evaluation

Continuous assessment examination, Assignment / Seminar and Term-end examination.

Microprocessors L T P C3 1 0 4

Aims & Objectives To introduce students to assembly language programming. Emphasis is on architecture of 8086 and its instruction set and related programs, interfacing peripheral devices with 8086, introduction to all advanced processor upto Pentium. Learning Outcome On completion of the course the student will be able to work with 8086 programming and interface.

Contents

Unit I

8086 Architecture and Instructions

Introduction to 8086 assembly language programming – Development steps – Construction – Writing Programs and Development Tools – Standard program structures – Simple Programs – Jumps – While–do – repeat–until – Delay loops.

Unit II

Strings – Procedures – Macros – Instruction Descriptions – Assembler Directives.

Unit III 8086 Minimum Mode 8086 Microcomputer – Observing Bus signals – Minimum mode System – Troubleshooting – 8086 interrupts – Interrupt Applications – Programmable timer/Counter – Interrupt Controller.

Unit IV Interfacing Parallel Ports – Handshaking – Interfacing, Digital Devices, Analog Interfacing.

Unit V Cache Memory and Other Advanced Processors DMA – DRAMS – Cache Memories – Co–Processors – EDA Tools – 80286, 80386 and 80486, Pentiums microprocessors.

Text Books Douglas V. Hall. Microprocessors and Interfacing – Programming and Hardware. TMH Second Edition,

2003. K. Udaya Kumar and B.S. Umashankar – Advanced Microprocessors and IBM–PC Assembly Language

Programming – TMH – 2002.

Reference Book

Barry B. Bray – The Intel Microprocessor 8086 Programming and Interfacing, PHI, 6th

Edition-2004. Mode of Evaluation


Programming in C++ L T P C3 1 0 4

Aims & Objectives To introduce students to the concept of object oriented programming. The emphasis is on the following features of object oriented programming: data hiding, operator overloading, inheritance, array based input / output and standard template library. Learning Outcome The students will be able to develop application programs applying object oriented programming concepts. Contents Unit I Basic Facilities Types and declarations, Pointers, Arrays and Structures, Expressions and Statements, Functions, Namespaces and Exceptions, Source files and Programs. Unit II Abstraction Mechanisms Classes, Operator Overloading, Derived classes, Templates, Exception handling, Class hierarchies.

Unit III

The Standard Library

Library organization and concepts, Standard containers, Algorithms and function objects

Unit IV

Iterators and allocators, Strings, Streams.

Unit V

Design using C++

Development and design, Design and programming, Roles of classes.

Text Book

The C++ Programming Language, Bjarne Stroustrup, Third Edition.

Computer Networks

L T P C3 1 0 4

Aims & Objectives To produce a core knowledge of networking concepts and techniques to design simple network, provide in-depth knowledge about the various communication technology and enable the student to understand how information are transmitted in networks. To introduce the students the concepts of wireless communications and various applications in computer networks. Learning Outcome The students will be able to know about error and flow control mechanisms, various routing and congestion control algorithms, various networking devices and latest networking concepts. Contents

Unit I

Introduction, history and development of computer networks, networks topologies. Physical Layer: theoretical basis, transmission media, analog transmission, digital transmission, switching.

Unit II

MAC layer: Aloha protocols, local area networks -- Ethernet, token ring, FDDI. Data link layer: sliding window protocols.

Unit III

Network layer: routing algorithms, congestion control algorithms, internetwroking -- bridges and routers.

Unit IV

Transport layer. Session, presentation, and application Layers. Use of TCP/IP protocol suite as running example.

Unit V

Introduction to X.25, ISO protocols.

Text Book A.S. Tanenbaum – Computer Networks PHI, 4

th Edition, 2003.

Reference Book James Kurose & Keith Ross – “A Top Down Approach to Computer Networking”, Pearson Education, 2003 Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Database Management System I L T P C3 1 0 4

Aims & Objectives The aim of this course is to introduce the students to basic concepts of databases and database management systems with emphasize on relational databases. The entity relationship diagram helps the students to design the database and the concept of normalization. The SQL and PL/SQL are taught so as teach how to create tables, manipulate table and how to create stored procedure. The objective of the course is make the students well versed with relational database.

Learning Outcome The students will learn the basic theory of database. They will be able to design and develop database using conceptual schema, logical schema and physical schema and are expected to learn how to write database management system software.

Content

Unit I

Database and database users, Database systems – concepts and architecture, Data modeling using entity-relationship model.

Unit II

Relational data model and relational database constraints, Relational algebra, Relational database design using ER- and EER-to-relational mapping.

Unit III

SQL and PL/SQL.

Unit IV

Relational database design – Informal guidelines for relational schemas, functional dependencies, normal forms based on primary keys, general definitions of second and third normal form, Boyce-Codd normal form.

Unit V

Algorithms for query processing and optimization, Transaction processing concepts, Database security and authorization. XML databases.

Text Book

R. Elmasri, S.V. Navathe. Fundamentals of Database Systems, Fifth Edition.

Reference Books

Henry F. Korth, Abraham Silberschatz, S. Sudarshan. Database System Concepts, McGraw Hill International Publications, 2002. Raghu Ramakrishnan. Database Management Systems, Third Edition. C. J. Date. An Introduction to Database Systems, Seventh Edition. Mode of Evaluation


Programming in Java

L T P C3 1 0 4

Aims and Objectives The aim of the course is to introduce students Core Java Concepts and to teach students the basic concepts of Java programming. This course covers preliminaries, I/O streaming and file handling and teach students how to program applets in Java, networking and allow the students to implement effectively remote method invocation (industrial java) to understand applets, which are programs that can be embedded in a Web page and accessed over the Internet with database access (may be remote database). The course also aims at teaching Server Side programming and deploying using third party server like Tomcat and make the students to understand the concepts of beans and BDK. It introduce and to explore JSP. It allows to make expertise the student in developing the Two and Three TIER applications of the in the real environment using all the concepts like Applets, RMI, Beans, Swings, Servlets, JSP and Database. . Learning Outcome At the end of the course the student will be able to write efficiently the java programs, can develop applets, able to access database with JDBC, work with networking protocols using java with attractive GUI, can implement an effective RMI application, the servlets, beans and can create JSP based applications by incorporating the servlets, beans, applets etc., All together they will be a Java developer.

Content

Unit I

Classes and Objects, Extending classes, Interfaces, Inner classes and anonymous inner classes, Packages, Exceptions, Strings and string buffers.

Unit II

Threads, Garbage collection, I/O package.

Unit III

Applets, Java Database Connectivity (JDBC), Java networking, Remote method invocation.

Unit IV

Graphics programming, Event handling, User interface components with swing.

Unit V

Overview of servlets, Java server pages, Java beans, Model-view-controller architecture.

Text Books

K Arnold, J. Gosling, D. Holmes. The Java Programming Language – Fourth Edition.

Cay S. Horstmann, Gary Cornell. Core Java Volume I – Fundamentals, Eighth Edition.

Cay S. Horstmann, Gary Cornell. Core Java Volume I – Advanced Features, Eighth Edition.

Mode of Evaluation


Software Engineering

L T P C3 1 0 4

Aims & Objectives To develop the theoretical knowledge of the development of the project after undergoing various techniques and testing and validations to be implemented. Assists the students to know what is a project and what are the process to be implemented. How to manage the project using the concepts of software process and it also helps in giving idea about the project metrics and measures. Helps the students to plan the software project. Explains what is risk management, how to schedule the project and track the schedule. Explains what is software quality assurance and steps to maintain the quality. Explains what is software configuration management how to configure the software. Explains the concept of system engineering to give an idea to the student regarding the analysis concepts and principles. Assists the student basically know what is analysis modeling. What is design concepts and what are the principles to be followed. It also explains various design methods. Gives an idea about the real time systems and it also helps to design the real time systems. What is software testing methods and what are the strategies to be followed. Explains the technical metrics for software. Learning Outcome The students will be able to develop an application taking into concepts of software engineering. Basically it develops the theoretical concept for the application development. Contents

Unit I Introduction to Project and Process Project and Process – Project Management Concepts Software Process and project metrics. Unit II Software Planning Software Project Planning – Risk Management Project Scheduling and Tracking – Software Quality Assurance. Unit III Configuration of the System Software Configuration Management – System Engineering – Analysis Concepts and Principles. Unit IV Designing and Analysis Analysis Modeling – Design Concepts and Principles – Design Methods Unit V Testing Methods Design for real–time systems – Software Testing Methods – Software Testing Strategies – Technical Metrics for Software. Text Book R.S. Pressman – Software Engineering – Fourth Edition – McGraw Hill International Edition – 1997.

Reference Book Richard Fairley – Software Engineering – (Design, Reliability and Management) – Tata McGraw Hill Edition – 2003 Mode of Evaluation


Theory of Computation

L T P C3 1 0 4

Aims

The students should understand the various models of computation, models of regular languages, recursive and recursively enumerable models of sets and the models of context-free grammar.

Learning outcomes

The students will be able to understand the behavior of a program as it runs.

Contents

Models of computation -- classification, properties and equivalences.

Regular languages models: finite state machines (deterministic and non-deterministic), regular grammars, regular expressions, equivalence of deterministic and non-deterministic machines and of the three models. Properties: closure, decidability, minimality of automata, iteration theorems.

Recursive and recursively enumerable sets models: turing machines, grammars, recursive functions, their equivalence. Church's thesis. Properties: closure, decidability, undecidablity/non-computability, notion of reductions.

Context-free languages models: grammars (including different normal forms), pushdown automata, and their equivalence. Properties: closure, iteration theorems, parsing.

Books and References:

C. Papadimitrou and C. L. Lewis. Elements of Theory of Computation , Prentice-Hall, 1981. J.E. Hopcroft and J.D. Ullman. Introduction to Antomata Theory, Languages of Computations , Addison-Wesley, 1979. (Indian edition available from Narosa.)

Compiler Construction L T P C3 1 0 4

Aims & Objectives To provide a core knowledge about different phases of compiler, syntax analysis, parameter passing, symbol tables, parser generators and code generation & optimization. Learning Outcome The students will be able to know the role of lexical analyzer, run-time environment, symbol tables and other compiler construction tools. Contents Unit I Introduction to Compiling and Lexical Analysis The phases of a compiler – cousins of the compiler – the grouping of phases – compiler – construction tools. A simple one-pass compiler – parsing, lexical analysis – the role of the lexical analyzer – input buffering – specification of tokens – recognition of tokens – compiler construction tools. Unit II Syntax Analysis The rolf of the parser, context–free grammar – top – down parsing – bottom–up parsing – operator – precedence parsing – SLR parsers – parser generators. syntax– directed translation: syntax– directed definitions. Unit III Run–time Environments Source language issues, storage organization, parameter passing – symbol tables. Unit IV Intermediate Code Generation Intermediate languages – declarations – assignment statements – Boolean expression – case statements. Unit V Code Generation

Code generation issues in the design of a code generator – basic blocks and flow graphics – peephole optimization – code optimization introduction – the principle source of optimization – optimization of basic blocks. Text Books Alfred V Aho, Ravi Seti, Jeffrey D Ullman, Compilers–Principles, Techniques and Tools – Addison–Wesley, 1986. References Books 1. Herk Ambles, Albert Nymeyer, Practice and principles of Compiler Building with C, Prentice Hall,

1986. 2. Dick Grune, Henri E. Bal Ceriel J.H. Jacobs, Koen G. Langendoen, Modern compiler Design, John

Wiely and Sons Ltd, 2nd

Ed, 2003 Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Unified Modeling Language

L T P C3 1 0 4

Aims & Objectives To make the students understand the basic notations and advanced notations used in UML. This course covers the various diagrams used in UML such as class diagram, Package diagram, activity diagram; Interaction diagrams types such as sequence, collaborative diagrams, component diagram and deployment diagram. Learning Outcome By the end of the course the student will be able to give the total concept of actors, interaction diagrams, collaboration diagrams, sequence diagrams, component diagram and deployment diagram. Design for any project which will felicitate any one to understand the concept of the system

UNIT-I (Introduction to UML): Introduction to UML, Importance of modeling, principles of modeling, object oriented modeling, conceptual model of the UML, Architecture, and Software Development Life Cycle.

UNIT-II (Structural Modeling): Basic Structural Modeling: Introduction to Structural Modeling, Classes, Relationships, common Mechanisms, and diagrams. Advanced Structural Modeling: Advanced classes, advanced relationships, Interfaces, Types and Roles, Packages.

UNIT-III (Class & Object Diagrams): Class & Object Diagrams: Terms, concepts, modeling techniques for Class & Object Diagrams.

UNIT-IV (Behavioral Modeling): Basic Behavioral Modeling: Introduction to Behavioral Modeling, Interaction diagrams, Use case Diagrams, and Activity Diagrams. Advanced Behavioral Modeling: Events and signals, state machines, processes and Threads, time and space, state chart diagrams.

UNIT-V (Architectural Modeling): Introduction to architectural modeling, Component diagrams and Deployment diagrams Case Study: The Unified Library application

TEXT BOOKS:

1. Grady Booch, James Rumbaugh, and Ivar Jacobson: The Unified Modeling Language User Guide, Pearson Education.

REFERENCE BOOKS:

1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education. 2. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hill Companies. 3. Mark Priestley: Practical Object-Oriented Design with UML, TATA McGraw Hill 4.Appling UML and Patterns: An introduction to Object – Oriented Analysis and Design and Unified Process, Craig Larman, Pearson Education.


Operating Systems L T P C3 1 0 4

Aims & Objectives To provide a core knowledge of OS concepts and techniques and to help designing a new system. The objective is to introduce the fundamental principles, concepts and techniques used. Apart from the basic concepts process, storage and file management techniques are addressed. Case study on Unix, Windows and other Operating Systems illustrate how the techniques are used or implemented in practice. Learning Outcome The students will be able to design an operating system. Contents

Unit I

Introduction. Process management: process synchronization and mutual exclusion, two process solution and Dekker's algorithm, semaphores, examples (producer-consumer, readers-writer, dining philosophers, etc.).

Unit II

CPU scheduling: multiprogramming and time sharing, scheduling approaches (SJF, FIFO, round robin, etc.). Input/Output: device controllers and device drivers, disks, other devices.

Unit III

Memory management: with and without swapping, virtual memory - paging and segmentation, page replacement algorithms, implementation.

Unit IV

File systems: FS services, disk space management, directory and data structure. Deadlocks: modeling, detection and recovery, prevention and avoidance.

Unit V Case Study UNIX, Linux and Windows XP operating systems.

Text Book

A. Silberschatz and P.B. Galvin – Operating System Concepts – Addison–Wesley Publishing Company, 6th

Ed, 2004.

Reference Books

1. Damdhere – Operating System Concepts – Tata McGraw Hill, 2003.

2. Maurice Bach – Design of the Unix Operating System, PHI , 2004.

3. Stephen Kochan – Unix Shell Programming, Hayden Publ, 1998.


Programming in Visual C++ L T P C3 1 0 4

Aims & Objectives To introduce the concept of windows programming using SDK and MFC. Emphasize is given on following topics: Window creation, menus, controls, DLL creation, networking, multithreading and database programming.

Learning Outcome The students will be able to develop database and networking applications in VC++. Contents Unit I Introduction to widows programming: Overview of windows programming – Architecture of windows program-call back function-messages –queued and non-queued messages – creation of windows-message box-basic I/O – keyboard and mouse messages –device context – WM_PAINT message. Unit II

Menus and controls: Menu basics – creating simple menu - menu and non-menu accelerator keys - Dialog box – modal and modeless dialog box – controls – static controls – common controls- status bar. Unit III DLL and Networking: Dynamic link library – crating DLL- using DLL in a program- Multithreading – creation of multithreaded application – Networking – programs using UDP and TCP. Unit IV Microsoft Foundation Classes: Overview of MFC programming – message handling – Working with menus – window controls – Dialog Boxes. Unit V Document-view architecture and Database Programming: Creation of SDI and MDI applications using wizard – Programs using document view architecture-Database connectivity – programs to connect with database using wizard – Database operations insertion, sorting, deletion, retrieval and updating of records through programs.

Text Books 1. Windows 2000 programming from the Ground up - Herbert Schildt - Tata McGraw Hill Edition 2. VisualC++ Programming - Yashavant Kanetkar - BPB publications Reference Books 1. Programming windows 5th edition - Charlez Petzold - The Definitive Guide to the WIN32 API -Microsoft Press 2. Programming Microsoft visual C++ 5th Edition -David j.Kruglinski,George Shephed and Scot Wingo - Microsoft Press Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Database Management System II L T P C3 1 0 4

Aims & Objectives This course aims at introducing the students to the advanced concepts of distributed databases, multimedia databases and object oriented databases. It also ails at teaching the concept of parallel databases and to the current issues of database namely, data warehousing and data mining, web and mobile databases, active and deductive databases, spatial databases and temporal databases. The course teaches database administration and network administration.

Learning Outcome

The students will be able to learn about the specialized databases as well as the current issues related to databases. They will also learn about database administration.

Contents

Distributed Databases

Distributed Databases: Centralized versus distributed databases, Fragmentation, Architecture, Client Server Databases, Distributed transactions, Locking and Commit protocols, Distributed concurrency control, Security and reliability

Parallel Databases Parallel Databases: Architecture, query processing, joins algorithms, performance. Object-oriented Relational Databases Object-oriented Database Management: Query languages, theoretical models, storage organization, Concurrency. Modern Databases Current Issues: Data warehousing and Data mining, Web and Mobile Databases, Active and Deductive Databases, Multimedia Databases, Spatial and Temporal Databases. Case Study Oracle 9i Database Administration- Performance Tuning, Backup and Recovery, Query Optimization, Network Administration. Text Books 1. Raghu Ramakrishnan, Johannes Gehrke, Database Management Systems, McGraw Hill, 3

rd edition,

2003. 2. Henry F. Korth and Abraham Silberschatz, Database System Concepts, McGraw Hill International

Publications, 2002. 3. Oracle 9i Documentation – Oracle Press, 2000. 4. Alex Berson – OLAP Datawarehouse and Data Mining – Tata McGraw Hill, 2001. References Books 1. Bell, David , Distributed Database Systems , Addison Wesley Pub, 2002 2. Hugh E. Williams, David Lane, Web Database Applications with PHP & MySQL, Shroff Pub 2002. Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Mobile Computing

L T P C3 1 0 4

Aims and Objectives To impart an understanding of fundamental concepts underlying current developments in mobile communication systems and wireless computer networks.

Learning Outcomes

At the end of the course, students will understand characteristics of radio propagation and interference in multipath propagation and channel model description, a range of digital transmission systems as used for applications in mobile telephony and wireless computer networks, pulse shaping and equalization techniques, the issues and techniques used in the design of Medium Access Control protocols for wireless Networks, the systems, protocols and mechanisms to support mobility for mobile internet users.

Contents

Introduction to wireless networking. Advantages and disadvantages of wireless networking

Characteristics of radio propagation. Fading, Multipath propagation

Introduction to digital transmission. Definition of bit-rate and signalling rate. Introduction to synchronous transmission. The need for pulse shaping, synchronisation and line-coding. Calculation of bit-error probabilities when the channel is affected by the addition of Gaussian noise.

Narrowband digital modulation. The need for modulation. Binary and multi-level (M-ary) amplitude-shift keying (ASK), frequency-shift keying (FSK) and phase-shift keying (PSK).

Wideband modulation techniques to cope with intersymbol interference Direct sequence spread spectrum Adaptive Equalization Orthogonal frequency division multiplex

Medium Access Control (MAC). MAC protocols for digital cellular systems such as GSM. MAC protocols for wireless LANs such as IEEE802.11 and HIPERLAN I and II. The near far effect. Hidden and exposed terminals. Collision Avoidance (RTS-CTS) protocols.

Protocols supporting mobility. Mobile network layer protocols such as mobile-IP, Dynamic Host Configuration Protocol (DHCP). Mobile transport layer protocols such as mobile-TCP, indirect-TCP. Wireless Application Protocol (WAP).

Text Book

J.Schiller, Mobile communications, ISBN: 0-321-12381-6, Addison-Wesley, 2003

References

T.S. Rappaport, Wireless communications; Principle and Practice, ISBN: 0-13-375536-3

A S. Tanenbaum, Computer Networks (Fourth Edition), Publisher: Prentice Hall PTR; ISBN: 0130661023; August, 2002.


Service Oriented Architecture

Unit I SOA Fundamentals

Defining SOA, Business Value of SOA, Evolution of SOA, SOA characteristics, concept of a service in SOA, misperceptions about SOA, Basic SOA architecture, infrastructure services, Enterprise Service Bus (ESB), SOA Enterprise Software models, IBM On Demand operating environment Unit II SOA Planning and Analysis Stages of the SOA lifecycle, SOA Delivery Strategies, service-oriented analysis, Capture and assess business and IT issues and drivers, determining non-functional requirements (e.g., technical constraints, business constraints, runtime qualities, non-runtime qualities), business centric SOA and its benefits, Service modeling, Basic modeling building blocks, service models for legacy application integration and enterprise integration, Enterprise solution assets(ESA) Unit III SOA Design and implementation Service-oriented design process, design activities, determine services and tasks based on business process model, choosing appropriate standards, articulate architecture, mapping business processes to technology, designing service integration environment (e.g., ESB, registry), Tools available for appropriate designing, implementing SOA, security implementation, implementation of integration patterns, services enablement, quality assurance Unit IV Managing SOA Environment Distributing service management and monitoring concepts, operational management challenges, Service-level agreement considerations, SOA governance (SLA, roles and responsibilities, policies, critical success factors, and metrices), QoS compliance in SOA governance, role of ESB in SOA governance, impact of changes to services in the SOA lifecycle Reference Books 1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”, Prentice Hall Publication, 2005. 2. Norbert Bieberstein, Sanjay Bose, Marc Fiammante, Keith Jones, Rawn Shah, “Service-Oriented Architecture Compass: Business Value, Planning, and Enterprise Roadmap”, IBM Press Publication, 2005. 3. Sandy Carter, “The New Language of Business: SOA & Web 2.0”, IBM Press, 2007. 4. Thomas Erl, “Service-Oriented Architecture: A Field Guide to Integrating XML and Web Services”, Prentice Hall Publication, 2004 5. Dave Chappell, “Enterprise Service Bus”,O'Reilly Publications, 2004 6. Sanjiva Weerawarana, Francisco Curbera, Frank Leymann, Tony Storey, Donald F.Ferguson, “Web Services Platform Architecture: SOAP, WSDL, WS-Policy, WS- Addressing, WS-BPEL, WS-Reliable Messaging, and More”, Prentice Hall Publication, 2005 7. Eric Newcomer, Greg Lomow, “Understanding SOA with Web Services”, Addison Wesley Publication, 2004

Computer Graphics L T P C3 1 0 4

Aims & Objectives The aim of this course is develop device independent graphics package. The package should run on all devices independent of the existence of frame buffer. The objectives of the course are to teach the students the fundamentals of computer graphics. It will help the students to learn how to design and develop optimal graphics algorithms with the optimal storage requirement. Starting with line and move primitive, the package is extended to characters and line style followed by polygon and polygon interior style. It is also upgraded to incorporate the other concepts, namely, 2D transformation, segmentation of display file, windowing and clipping, interaction with graphics system, 3D graphics, removal of hidden surfaces, surface rendering (shading) and curves and fractals.

Learning Outcome The students will be able to implement graphics package and may also write algorithms for graphics drawing. Contents Unit I Introduction, Basic raster graphics algorithms for drawing 2D primitives, Unit II Graphics hardware, Geometrical transformations, Viewing in 2D, Unit III Dialogue design, User interface software, Unit IV Representing curves and surfaces, Solid modeling, Unit V Visible surface determination, Illumination and shading Text Book J.D. Foley, A.v dam, S.K. Feiner, J.F. Huges. Computer Graphics: Principles and Practice in C. Second Edition Reference Book Donald Hearn, M. Pauline Baker. Computer Graphics. Second

Edition, 1995.


Data Warehousing and Data Mining

L T P C3 1 0 4

Aims & Objectives The subject is designed to meet the challenges of developing large data warehouses, as the industrial market is moving towards customers satisfaction and relationship intelligence will have to be embedded in business. The focus is mainly on the concepts of very large databases and their applications. The objective is to introduce the basic concepts of data warehouses, the design and tuning its performance. Concepts of knowledge discovery in databases is also given importance. The students are given exposure to Knowledge Discovery process the architectures, the mining methodologies and the potential applications of data mining. We also develop data marts and extract patterns from it.

Learning Outcome The students will be able to extract knowledge from hidden data in the database.

Contents

Unit I

Very Large Databases and Data Warehouse

Introduction: VLDB – Data warehouse – Architecture of Data warehouse – Data warehouse and Business Strategy – Managing the Data – Data warehouse Development Life Cycle – Modeling.

Unit II Metadata Repository Metadata and Metadata catalog – Performance issues and indexing – View Maintenance – Aggregates – Data warehouse on the Internet and security. Unit III Data Mining Data Mining – Knowledge discovery in databases – Confluence of multiple disciplines – Taxonomy of data mining tasks – Integration of Data Mining and Data Warehousing – Concept Description. Unit IV Data Mining Techniques Data Mining Models – Statistics – Decision Trees – Neural Networks – Nearest Neighbor and Clustering – Genetic Algorithms – Rule Induction – Data Visualization – Selecting and using the right technique.

Unit V OLTP & Case Study Online Transaction Processing, Applications of Data warehousing and Data Mining – A Case study. Text Books Jiawei Han. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers 2001. Ralph Kimball, “The Data Warehouse Life Cycle Toolkit “, John Wiley & Sons Inc., 1998. W.H. Inmon. Building the Data Warehouse. Wiley Dream tech & Sons Inc, Fourth Edition, 2005 Reference Books Usama M Fayyad, Gregory Piatetsky – Shapiro, Padhrai Smyth and Ramasamy Uthurusamy. Advances in

Knowledge Discovery and Data Mining. The M.I.T Press, 1996. Sean Kelly. Data Warehousing in Action. John Wiley & Sons Inc 1997 Berry Micheal and Gordon Linoff,. Mastering Data Mining. John Wiley & Sons Inc, 2000. Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Distributed Computing L T P C3 1 0 4

Aims and Objectives

It provides in-depth knowledge about switched multiprocessor, Communication in distributed system, implementation of client server model, time distributed system, synchronization in distributed system. To understand about distributed file system and distributed DBMS architecture.

Learning Outcome Students will have understanding of the hardware and software of distributed system. They will also learn about distributed databases. Content Unit I Introduction to Distributed Systems Hardware Concepts – Switched Multiprocessor – Bus–based multicomputers – Switched Multicomputers – Software concepts Network Operating Systems and NS – Time Distributed Systems. Design Issues: Transparency – Flexibility – Reliability – Performance and scalability. Unit II Communication in distributed systems Communication in distributed systems – The client/server model – Blocking versus unbuffered primitives – Implementation of Client/server model.

Unit III Synchronization in distributed systems Synchronization in distributed systems – Clock synchronization – Mutual exclusion – Election algorithms – Atomic transactions – Dead lock distributed system – Threads – Thread usage and implementation if thread packages – Processor allocation.

Unit IV Distributed File System Distributed File System: File Service interface – Semantics of file sharing – Distributed file system – Implementation of new trends in distributed file system. Unit V Distributed databases Distributed databases: Distributed DBMS Architecture – Sorting Data in a Distributed DBMS – Distributed Catalog Management – Distributed query processing – Updating distributed data – Distributed transaction management – Distributed Concurrency control – Recovery.

Text Book A.S. Tanenbaum – Modem Operating Systems, Prentice Hall.

Reference Book

Raghu Ramakrishnan – Database Management Systems – WCB/McGraw Hill – 1997.


Security in Computing L T P C3 1 0 4

Aims & Objectives Enable the student to understand the importance of physical security for a network center, describe the encryption technique, various security protection method, apply audit and trial to ensure transaction security, have the knowledge to design a secure computer network and establish a good security policy in a business environment. Learning Outcome

By the end of the course the student understands various security attacks, encryption and decryption techniques, Key distributions, implementation of authentication systems, e-mail security, web security and firewalls

Content Unit I Introduction - Threats, vulnerabilities, controls; risk; method, opportunity, motive; technical, administrative, physical controls; prevention, detection, deterrence, Terminology, concepts. Cryptography – Basic cryptography terms, symmetric and asymmetric ciphers, Cryptographic protocols: digital signatures, key exchange, certificates, cryptographic hash functions Unit II Security in programs–I: flaws – Malicious code: viruses, Trojan horses, worms, Program flaws: buffer overflows, time-of-check to time-of-use flaws, incomplete mediation. Security in programs–II: defenses – Software development controls, Testing techniques. Security in conventional operating systems – Memory, time, file, object protection requirements and techniques, Protection in contemporary operating systems. Unit III Identification and authentication – Identification goals, Authentication requirements; human authentication, machine authentication, authentication technologies. Trusted operating systems – Assurance; trust, Design principles, Database management systems and security. Unit IV Network security–I: Threats – Network technology (depth depends on students’ background), Network threats: eavesdropping, spoofing, modification, denial of service attacks. Network security–III: Technologies – Firewalls, Intrusion detection systems, Monitoring systems, Virtual private networking, Remote authentication systems. Unit V Management of security – Security policies, Risk analysis, Physical threats and controls Legal aspects of security, Legal protection for computer objects, Computer crime. Privacy and ethics – Privacy, Ethics Text Book Security in Computing, Charles P. Pfleeger, Shari Lawrence Pfleeger, Third Edition, Prentice Hall Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Grid Computing L T P C3 1 0 4

Unit I Introduction: The Grid – Beginning of the Grid – Evolution of the Grid – A Community Grid Model – Building Blocks of Grid – An overview of Grid Business Areas - Grid Application – Grid infrastructure.

Unit II Grid Computing Organizations and their Roles: Organizations developing Grid standards and the Global Grid Forum – Organizations developing Grid Computing Toolkits and Frameworks – Grid Computing Anatomy – Grid Computing Road Map. Unit III New Generation of Grid Computing Applications: Service Oriented Architecture – Web Service Architecture – XML, Related Technologies – XML Messages and Enveloping – Service Message Description Mechanisms – Relationship between Web Services and Grid Services. Unit IV Grid Computing Technology: Open Grid Services Architecture (OGSA) – OGSA Platform Components – Open Grid Services Infrastructure (OGSI) - OGSA Basic Services. Unit V Grid Computing Toolkits: GLOBUS GT4 Toolkit: Architecture, Programming Model, implementation, High Level Services. Text / Reference Books 1. Joshy Joseph, Craig Fellenstein, Grid Computing, Pearson Education, 2004. 2. Fran Berman, Geoferry C. Fox, Antthony J.G. Hey, Grid Computing Making the Global Infrastructure a Reality, Wiley Series in Communications Networking & Distributed Systems, 2000


Software Project Management

L T P C3 1 0 4

Aims & Objectives The goal of this subject is to enable the students to plan, allocate, configure, minimize risks and deliver the product effectively. Learning Outcome The attendees will know about the various types of projects, plan for the same accordingly. Apart from this they will also understand to manage the risks and improve the reliability of the software. Contents Unit I Software Engineering Introduction – software projects – various type of projects – problems with software projects – an overview of project planning – project evaluation – project analysis and technical planning – software estimation. Unit II Estimation Planning: Activity planning – project schedules – sequencing and scheduling projects – network planning model – shortening project duration identifying critical activities. Unit III Risk Management Risk management resource allocation – monitoring and control – managing people and organizing teams – planning for small projects. Unit IV Configuration Management

Software configuration management – basic functions – responsibilities – standards – configuration management – prototyping models of prototyping. Unit V Project Management Software maintenance characteristics – maintenance tasks – maintenance side effects – maintenance issues – source code metrics – software reliability – definition of software reliability – concept of software repair and availability – software error and faults – estimating number of bugs in computer program – reliability models – availability models. Text Book Mike Cotterell, Bob Hughes, “Software Project Management”, Inclination/Thomas Computer Press, 3

rd Ed

2005. Reference Books R.S. Pressman. Software Engineering. Fourth Edition, McGraw Hill International Edition – 1997. Ilene Burnstein. Practical Software Testing. Springer Verlag International Edition, 2003 Springer (India) Pvt Ltd - (Indian reprint 2003) ISBN - 81-8128-089-X Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Agent Based Intelligent Systems

L T P C3 1 0 4

Aims & Objectives To provide in depth knowledge about the structure of intelligent agent, enable the students to understand about various search strategies, first order logic, inference, decision network, learning agent, inductive learning, reinforcement learning and knowledge in learning Learning Outcome By the end of this course the student will be able to design an expert system using the concepts of intelligent agent with diverse concepts like fuzzy, bayes theorem etc. Contents Unit I Introduction Definitions – History – Intelligent Agents – Structure – Environment – Basic Problem Solving Agents – Formulating – Search Strategies – Intelligent Search – Game Playing as Search. Unit II Knowledge Based Agents Knowledge Based Agents: Representation – Logic – First Order Logic – Reflex Agent – Building a Knowledge Base – General Ontology – Inference – Logical Recovery. Unit III Planning Agents Situational Calculus – Representation of Planning – Partial Order Planning – Practical Planners – Conditional Planning – Replanning Agents. Unit IV

Agents and Uncertainty Acting Under Uncertainty – Probability Bayes Rule and Use – Belief Networks – Utility Theory – Decision Network – Value of Information – Decision Theoretic Agent Design. Unit V Higher Level Agents Learning Agents – General Model – Inductive Learning – Learning Decision Trees – Reinforcement Learning – Knowledge in Learning – Communicative Agents – Types of Communicating Agents – Future of AI. Text Book Stuart Russell and Peter Norvig Artificial Intelligence – A Modern Approach, Prentice Hall, 2

nd Ed, 2004.

Reference Books Patrick Henry Winston, Artificial Intelligence, 3

rd Edition, AW, 1999.

Nils. J. Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 2002. Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Digital Image Processing L T P C3 1 0 4

Aims & Objectives The objective is to introduce the principles of image processing. The theoretical basis for linear processing schemes is presented together with discussions of a range of common algorithms and their implementations and uses. The course introduces a thorough grounding of the principles of image processing, and seeks to develop students’ knowledge from basic image processing techniques to advanced image processing and analysis systems. It concentrates on the fundamental theory of image processing with emphasis on the areas of image compression, restoration, enhancement, segmentation, pattern recognition and their applications. Learning Outcome Students will be able to apply their knowledge in image processing and image compression techniques, in character recognition, automated visual inspection, stereo imaging, JPEG, MPEG. They may also find out new techniques for processing digital image. Contents Unit I Introduction to Digital Images Introduction, Digital Image Fundamentals. Unit II Enhancement Image enhancement in the spatial domain, image enhancement in the frequency domain. Unit III Restoration and Color Image Image restoration, color image processing. Unit IV Compression and Segmentation Image compression, image segmentation. Unit V Representation, Description and Recognition Image representation and description, object recognition.

Text Book R.C. Gonzalez & R.E. Woods, Digital Image Processing, Pearson Education, Second

Edition.


Enterprise Computing L T P C3 1 0 4

Aims & Objectives The goal is to couple effective knowledge transfer and efficient learning techniques with corporate strategy and business process. As it integrates business processes, content development it helps the students to compete in the industry. Learning Outcome The students will be able to deliver an optimized scalable and a lower risk product. Contents Unit I Enterprise Resource Planning Overview of ERP – benefits – ERP related technologies – business process reengineering – data warehousing – data mining – OLAP – supply chain management. Unit II ERP Lifecycle ERP implementation life cycle – implementation methodology – business modules: finance – production – human resources – materials management – plant maintenance – quality management – sales and distribution. Unit III Commercial Products ERP market place – SAP AG – people soft – baan company – JD Edwards world solutions company – Oracle corporation – future directions of ERP. Unit IV SAP Architecture SAP R/3: Basics of SAP R/3 – architecture of SAP R/3: basic architecture concepts – system central interfaces – services – work process types – presentation interface – database interface – communication protocol interface – memory management – client/server system. Unit V ERP on the Web Web related enterprise computing: Introduction to web service – business motivation – technical motivations – service oriented architecture – architecting web services. Web services building blocks: SOAP – introduction – syntax – message sending – implement – futures of SOAP. Text Books Alexis Leon "ERP Demystified" – Tata McGraw Hill. Jose Antonio Hernandez "The SAP R/3 Hand Book" – Tata McGraw Hill. SAP Documentation. Reference Book Ron Schmelizer, DIANE Kennedy "XML and Web services – Unleased" – Pearson Education 2002. Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Computer Vision L T P C3 1 0 4

Aims & Objectives The aim of this course is to introduce students to the field of Computer Vision. Computer Vision is the scientific and engineering discipline concerned with understanding how we see and how to teach a digital computer to see. The industrial applications of Computer Vision include Pattern Recognition, Visual Inspection, Virtual Reality Construction, Image Retrieval, Multimedia, Autonomous, Vehicles, Interpretation of Satellite Photographs, 3D TV, Intelligent Robots, Biomedical, Imaging, Road Traffic Monitoring, Security Systems, Fingerprint identification. Learning Outcome After completing this course, students will have basic understanding of the main approaches and theories in computer vision. The student shall also be able to independently search, evaluate and develop innovative Computer Vision algorithms for industrial applications, product invention and integration with other multimedia technologies. Contents Unit I Vision Geometry and Color Geometric camera models, Geometric camera calibration, Color. Unit II Filters and Texture Linear filters, Edge detection, Texture. Unit III Stereopsis and Structure from Motion Geometry of multiple views, Stereopsis, Affine structure from motion. Unit IV Segmentation and Tracking Segmentation by clustering, Segmentation by fitting a model, Tracking with linear dynamic models. Unit V Model Based Vision, Surfaces and Range Data Model based vision, Smooth surfaces and their outlines, Range data. Text Book David A. Forsyth and Jean Ponce, Computer Vision A Modern Approach, PHI, 2004. Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Open Source Programming

L T P C3 1 0 4

Aims & Objectives Course provides the knowledge of PHP and Perl. It helps to do web based programming. It allows the students to learn about cookies.

Learning Outcome The students shall be able to do the programming using PHP and Perl and python. Contents Unit I Introduction to Open Source Programming and PHP Introduction to Open source programming, OSD, PHP, Apache, MySQL– overview of PHP – variables, operations, constants, control structures arrays, functions, classes – handling files. Unit II Database Programming My SQL database programming – connecting – table creation – record insertion – updation – multiple database handling. Unit III Mails E-mailing with PHP – sending an email – multipart message – storing images – getting confirmation. Unit IV Cookies Session tracking using PHP – graphics input validators – cookies. Unit V Perl Introduction to Perl – numbers and strings – control statements – lists and arrays – Introduction to TCl/Tk, introduction to Python. Text Book PHP Professional Projects, Ashish Wilfred Metta Gupta and Karticj Bhatnagar – Prentice Hall and India Pvt. Ltd., New Delhi, 2002. Reference Books Beginning PHP, Apache, MYSQL Web Development Micheal K. Glass, Rommnle Scouarnec, Wiley Dream Tech publishing Inc. New Delhi 2004. Core PHP Programming, Leon Atkinson and Zeev Suraski, Pearson Education, Delhi, 3

rd Ed, 2004.

Teach Yourself Perl, Clinton pierce, Techmedia, New Delhi, 2000. Tom Christiansen and Nathan Torkington, Perl CookBook, Shroff Pub, 1999. Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Pervasive Computing

L T P C3 1 0 4

Aims & Objectives The goal is to create a system that is pervasively and unobtrusively embedded in the environment, completely connected, intuitive, effortlessly portable, and constantly available. Among the emerging technologies expected to prevail in the pervasive computing environment of the future are wearable computers, smart homes and smart buildings. Learning Outcome On learning this, the students should be able to capture the productivity of time between tasks, the creative contribution of assembled community to idea creation, and for timely access to information to satisfy the needs. Contents Unit I

Introduction Introduction to wireless enterprise applications – Wireless Devices: Hardware platforms, networking technologies, service technologies, middleware, and content delivery. Unit II Developing WML Applications Developing WML Applications: WML documents, developing a WML application, WML tags, registration WML listing and WML script. Unit III MIDP Programming MIDP Programming: J2ME MIDP user interface, MIDP application, developing a MIDP application, MIDP Classes: MIDlet class, MIDP GUI classes, MIDlet high-level events, low-level APIs and event handling. Unit IV Advanced MIDP Programming Advanced MIDP Programming: Network programming, MIDP database programming, MIDlet provisioning, bluetooth application. Unit V Developing VoiceXML Applications Developing VoiceXML Applications: VoiceXML applications, VoiceXML TAGS, ECMAScript - Java Card Application: Java card VM, APDUs, java card API, host applications.

Text Books Jochen Burkhardt, Dr. Horst Henn, Stefan Hepper – Pervasive Computing Technology and Architecture of

Mobile Internet Applications – Pearson Education, 2005. Reference Books Dan Harkey, Shan Appajodu, Mike Larkin – Wireless Java Programming for Enterprise Applications –

Wiley Publishing, Inc, 2001. Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term-end examination.

Performance Evaluation of Computer System

L T P C3 1 0 4

Unit I Overview of Performance Evaluation Introduction, Selection of Techniques and Metrics, measuring the reporting performance, Benchmark suites, Amdahl’s law, SPEC CPU benchmarks, SPEC 95, 2000, server, memory, I/P Performance Types of workloads, art of workload selection, workload characterization and techniques. Program execution monitors, Analytical modeling for performance. Probability Theory and use for evaluation Notion of probabilities and basic properties, Continuous random variables, Bayes theorem, conditional probabilities, Discrete and Continuous random variables, Probabilities Generation function & Laplace transform, Transformation generation methods. Use for performances evaluation in networking. Linear regression models. Unit II Stochastic Processes

Stochastic processes, first and second order statistics, stationery stochastic processes, spectral densities, Brownian Motion Process, Ergodicity. Queuing Theory and Models Queuing models, Little theorem application, Markov chain formulation. Discrete time and Continuous time Markov Chains (DTMC, CTMC), MMD, Queuing system M/M/1, M/M/1/K, M/M/S/, M/M/∞ queue analysis m-server case. Multidimensional Markov chain application in Circuit Switching. Unit III Queuing Theory and Application M/G/1 Queue, generalization of M/G/1 theory application to ATM. Embedding instants in the M/G/1 theory M/G/1 with geometrically distributed messages. Chain imbedded to cell transmission, message transmission completion. Queue balance equation, Finite buffer case, Mean Value Analysis. Unit IV Network Analysis Local area Network analysis, standard comment based analysis, contention based protocols, demand assignment protocols, nodes in packet switches networks, performance analysis of data link layer, Network layer. Traffic control and congestion in ATM networks, TCP/IP Traffic control. Unit V Simulation Introduction to simulation, simulation modeling and analysis in computer systems and networks, analysis of simulation results, Random Number generation, Statistical analysis of simulation. Reference Books : 1. The Art of Computer Systems Performance Analysis, by Raj Jain, Wiley, New York, NY, April 1991. 2. Queuing Theory and Telecommunication by Giovanni Grambene, Springer, 2005 3. High Speed Networks and Internets, Performance and Quality of Service,W. Stallings, 2nd Ed., Prentice Hall, 2002. 4. Performance Evaluation of Communication Networks, G.N. Higginbottom, Artech House, 1998. 5. Computer Systems Performance Modelling, C.H. Sauer and K.M. Chandy, Prentice Hall. 6. Simulation Modelling and Analysis by Law and Kelton, McGraw Hill. 7. “The Practical Performance Analyst”, Neil J. Gunther, McGraw Hill, 1998 8. “ Queueing Networks and Markov Chains”, G. Bolch, et al., Wiley 1998. 9. “ Queueing Theory Vol. I and Vol. II”, L.Klenrock. 10. “ Introduction to Computer System Performance Evaluation”, K. Kant, McGRAW Hill, 1992. 11. “ Probability, Stochastic Processes, and Queuing Theory”, Randolph Nelson, Springer Verlag, 1995.

Mobile Commerce L T P C3 1 0 4

Aims & Objectives This course introduces the concepts, technology, and applications of mobile commerce. The course begins by setting the context for m-commerce within the domain of ecommerce. It then examines m-commerce concepts from the perspective of information systems. The course discusses the technology needed for mobile commerce including mobile client hardware and software, and wireless communications technology. A mobile phone simulator is presented and the students use it to develop the user interface for a simulated mobile commerce application. The number of mobile commerce applications is examined, and mobile security and payment are discussed. Learning Outcome

After the end of this course students will acquire of concepts, technology, and applications of mobile commerce

Content Unit I E-commerce concepts, Anytime commerce, The dimensions of e-commerce, E-commerce business models, E-commerce information system functional model Unit II M-commerce concepts: An information systems perspective, Anytime, anywhere commerce, The impact of mobility on e-commerce, M-commerce business models, The m-commerce value chain, M-commerce information system functional model Unit III M-commerce technology, Mobile clients, Types: mobile phones, PDAs, laptop computers, vehicle mounted devices, hybrid devices. Device limitations: considerations for user interface and application design, Device location technology: GPS, triangulation, Mobile client software, Mobile device operating systems, Micro browsers. Unit IV Mobile device communications protocols: WAP, i-Mode, Mobile device page description languages, Mobile device application software. M-commerce applications - Mobile financial services, Mobile advertising, Mobile product location and shopping, Mobile proactive service management, Mobile business services Unit V Installing and using Openwave Phone Simulator, Server side application development. Installing and using Apache. User interface design for small devices, M-commerce trust, security, and payment, Trust in m-commerce, Authentication, confidentiality, integrity, and non-repudiation. Mobile payment Text Book Sadeh, N., M-Commerce, New York, New York: John Wiley & Sons, 2002. References Choi, S. Y., D. O., Stahl, and A. B. Whinston, The Economics of Electronic Commerce, Indianapolis, Indiana: Macmillan Technical Pub., 1997. Shelton, G. W., Wireless Application Development, Boston, Mass.: Course Technology, 2003. Turban, E., et al., Electronic Commerce 2008: A Managerial Perspective, 4th ed., Upper Saddle River, New Jersey: Prentice Hall, 2008. Mode of Evaluation


Business Process Management

L T P C3 1 0 4

Aims & Objectives

This course provides an introduction to effective business modeling independent of organizational boundaries, systems, and procedures. This course will also familiarize students with Business Process Management (BPM) and Enterprise Architecture Planning (EAP). The course also explores the social impact of information technology in different areas of human life such as business, health, education, entertainment and politics. Learning Outcome Upon successful completion of this course, the student should be able to define a stable business model independent of organizational boundaries, systems and procedures, define business data before applications, use data to determine the sequence for implementing the applications systems, successfully implement Business Process Management projects, to ensure a continuous business process improvement culture.

Unit I

How can we demystify business process management? What is business process management? Why is it important to improve businesses process before automating them? When should you do BPM – what are the main drivers and triggers? Who should be involved in BPM?

Unit II

Why are organizational strategy and process architecture important in BPM implementation? How do you sell BPM technology to the organization? What are the critical success factors in a BPM project? What are the critical implementation aspects for a BPM solution? Why do you need a structured approach to implementing BPM?

Unit III

Framework overview. Guidelines on how to use the framework Organization strategy phase, Process architecture phase, Launch pad phase,

Unit IV

Understand phase, Innovate phase, People phase, Develop phase, Implement phase, Realize value phase, Sustainable performance phase.

Unit V

Essentials introduction, Project management, People change management, Leadership, BPM maturity, Embedding BPM within an organization

Text Book Jeston, J., Nelis, J., (2008), “Business Process Management, Second Edition: Practical Guidelines to Successful Implementations”, Butterworth-Heinemann. Mode of Evaluation
