COURSES OF STUDIES

For

MCA

1st Semester Exam- 2014 onwards

2st Semester Exam- 2015 onwards

3rd Semester Exam- 2015 onwards

4th Semester Exam- 2016 onwards

5th Semester Exam- 2016 onwards

6th Semester Exam- 2017 onwards

CONTENTS

COURSE STRUCTURE

FIRST SEMESTER

1. IT 11 : C programming and Data Structure through C2. IT 12 : Computer Organization & Architecture3. IT 13 : Operating system4. IT 14 : Accounting & Management Control5. IT I5 : Mathematical Foundation6. IT 16L : Information Technology Lab. & Linux O.S7. IT 17L : Programming in C & Data Structure Lab.

SECOND SEMESTER

1. IT 21 : Database Management System2. IT 22 : Object Oriented System3. IT 23 : Software Engineering4. IT 24 : Written & Oral Technical Communication5. IT 25 : Operations Research6. IT 21L : C++ Lab. 7. IT 22L : DBMS Lab (Oracle)

THIRD SEMESTER

1. IT 31 : Theory of Computation2. IT 32 : Interactive Computer Graphics3. IT 33 : Data Communication & Networks4. IT 34 : Design and Analysis of Algorithms5. IT 35: Core JAVA6. IT 31L : Core Java Lab7. IT 32L : Networking Programming Lab.

FOURTH SEMESTER

1. IT 41: Java Programming (Advance)2. IT 42 : Artificial Intelligence Application3. IT 43 : Advanced Database Systems4. IT 44 : Elective-I:

Compiler Design

Soft Computing

5. IT 45 : Elective-II :Management Information Systems

Human Resource Management

6. IT 41L : Java Lab (Advance Java)7. IT 42L : Visual Programming Lab

FIFTH SEMESTER

1. IT 51: Data Mining & Data Ware Housing2. IT 52: Parallel Processing3. IT 53 : Open Source Programming4. IT 54: Elective-Ill

Digital Image Processing,System Modeling & Simulation

5. IT 55 : Elective-IV :Web Designing & Multimedia

Cryptography & Network Security

6. IT 51L: Open Source Programming Lab.7. IT 52L: Web Designing Lab.

SIXTH SEMESTER

Major Project (Industrial Project)

MCA

1st Semester Exam- 2014 onwards

2st Semester Exam- 2015 onwards

3rd Semester Exam- 2015 onwards

4th Semester Exam- 2016 onwards

5th Semester Exam- 2016 onwards

6th Semester Exam- 2017 onwards

The MCA course shall comprise of six Semesters. Each Semester except 4 th and 6th

consist of 5 theory papers carry 100 marks each and two practical papers carrying 75 marks

each. The 4th Semester carries 5 theory papers each 100 marks, two practical papers each 75

marks and one minor project carrying 100 marks. The 6 th Semester carries 250 marks for the

major project.

The distribution of marks amongst six semesters is as follows:

Semester Theory Practical Project Total

1 5*100=500 2*75=150 --------650

2 5*100=500 2*75=150 ---------650

3 5*100=500 2*75=150 ---------650

4 5*100=500 2*75=150 100(Minor) 750

5 5*100=500 2*75=150 ---------650

6 ------- 250(Major) 250

Grand Total 3600

MANNER OF CONDUCT OF EXAMINATION

1. Theory: 100 marksDuration: 3 hoursExamination Marks

a) Semester end exam. 75

b) Attendance 05

c) Class test 20

Total 100

2. Practical: 75 marks

a) Lab. record - 15b) Practical experiment 40c) Viva voce 20

Total 75

Regarding the minor project paper of 100 marks in the 4th semester, the following mark distribution is adapted.

Project thesis 75 marks

Viva-voce 25 marks

Regarding project paper of 250 marks in the 6th semester, the mark distribution is as follows :

Project thesis (External Examiner) 150 marksViva-voce (Internal) 50 marks

Viva-voce (External) 50 marks

MARKS DISTRIBUTION IN THEORY PAPERS

Procedure of setting questions in every theory paper carrying 75 marks.

There will be 5 units in each paper carrying 15 marks each. Each unit will have one short type question carrying 5 marks and one-long type question carrying 10 marks with an alternative choice for each.

No. of Marks per Total questions question marks

Short type 5 5 25 Long type . 5 10 50 Total 75

Semester -I

IT-11- C PROGRAMMING AND DATA STRUCTURE

UNIT-I

Introductory Concepts :Overview of programming and programming languages, Types of programming Languages., Introduction to C, Features of C, Structure of C program, C Fundamentals Character Set, Identifiers and Keywords ,Variables and constants , Data types, Type casting.

UNIT-II

Operators and Expressions, Precedence and Associativity , Library Functions, Data Input output statement, Format specifiers, Control Statements, Arrays, String Array, Functions ,Storage classes.

UNIT-III

Pointers, Dynamic memory allocation, Structures and unions, User defined data types (typedef), command line arguments, Files ,File handling, Binary Files, Random Access Files.

UNIT IV

Introduction, to data structures. Abstract data type, Stacks and Queues: circular Queue, Priority Queue,Deque, representation and Applications. Linked Lists: Singly linked lists, Linked stacks and queues, Operation on polynomial, Doubly linked list, Circular linked list, Doubly circular linked lists, Dynamic storage Management, Garbage collection and compaction.

UNIT-V

Graphs: Terminologies and representation, Path matrix, graph traversal,- DFS and BFS, shortest path problems, Bi-connected graphs.

Trees: Terminologies and memory representation, Binary trees, Binary search trees, Tree traversing, Operations on binary trees, - Expression manipulations,

Threaded binary trees, Height balancing trees, heaps.Sorting techniques: Bubble sort, selection sort, Insertion sort, Merge sort, Quick sort, Heap sort, searching technique: Linear search and binary search.

Text books: 1.An introduction to data structures with Applications.J. P. Tremblay P.G.Sorenson (Me Graw Hill)

Data Structures using C & C+ + Langsman, Augensteing & Tanenbaum (PHI)

2.Let us C by Y. B. Kanitkar3.Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, “Fundamentals of Data Structures in C”, Second Edition, 2008, Universities Press Pvt. Ltd.

IT-12: COMPUTER ORGANIZATION AND ARCHITECTURE

UNIT I:

Introduction: Basic architecture of computer, Functional units, Von Neumann Concept.

Principles of Logic Circuits I: Logic Gates, Logic Circuits , Combinational Circuits :Canonical and Standard Forms, Minimization of Gates(Algebraic Expression, K Map)Design of Combinational Circuits, Examples of Logic Combinational Circuits : Adders, Decoders, Multiplexer, Encoder, Programmable Logic Array, Read Only Memory ROM.UNIT II:

Sequential Circuits: The Definition , Flip Flops, Basic Flip-Flops, Excitation Tables, Master Slave Flip Flops, Edge Triggered Flip-flops, Examples of Sequential Circuits, Registers ,Counters, Asynchronous Counters , Synchronous Counters .

UNIT-III:The Memory System:The Memory Hierarchy,                                                                         RAM, ROM, RAID and its Levels ,The Concepts of High Speed Memories, Cache memory, Cache Organization  , Memory Interleaving, Associative Memory, Virtual Memory  Instruction Set Architecture :   Instruction Set Characteristics, Instruction Set Design Considerations  , Operand Data Types, Types of Instructions, Number of Addresses in an Instruction, Addressing Scheme:Immediate Addressing,Direct Addressing,Indirect Addressing,Register Addressing,Register Indirect Addressing,Indexed Addressing Scheme,Base Register Addressing,Relative Addressing Scheme,Stack Addressing

UNIT-IV

Registers, Micro-Operations and Instruction Execution:Basic CPU Structure,  Register Organization,Programmer Visible Registers,Status and Control Registers,General Registers in a Processor                                                   Micro-operation Concepts : Register Transfer Micro-operations,Arithmetic Micro-operations

Logic Micro-operations,Shift Micro-operations

               Instruction Execution and Micro-operations                                            

               Instruction Pipelining            

ALU Organisation

             ALU Organisation :   A Simple ALU Organization, A Sample ALU Design, Arithmetic Processors                                                 

UNIT-V:

The Control Unit

                The Control Unit                        

                The Hardwired Control                          

      The Micro-Programmed Control 

                The Micro-Instructions               

o                Types of Micro-Instructions

o                Control Memory Organisation

o                Micro-Instruction Formats

                The Execution of Micro-Program            

  Reduced Instruction Set Computer Architecture

               Introduction to RISC                              o              Importance of RISC Processorso              Reasons for Increased Complexityo              High Level Language Program Characteristics

               RISC Architecture                                                  The Use of Large Register File                              Comments on RISC                                               RISC Pipelining   

Text Books:1. “Computer System and Architecture” (3rd edition), Mano M., Prentice Hall of India.2. “Computer Organization and Architecture” (2nd edition), Stalling W., Prentice Hall of India.3. “Computer Organization and Design”, Pal Chauduri. P (1994), Prentice Hall of India, New

Delhi.4. “Introduction to Digital Computer Design”(4th edition), New Delhi.

Reference Books:

1. J. P. Hayes “Computer Architecture and Organization" McGraw Hill Education India.

2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, “ComputerOrganization”, 5th

Edition, Mc Graw-Hill Education India

3. A.S. Tananbaum “Structured Computer Organization” Pearson Education.

IT-13: OPERATING SYSTEM

UNIT-I

Operating system concepts, evolution of operating systems, multi-programming, multiprocessing, time sharing, real-time & multi-tasking, operating system services, file system management: directory structures, file allocation and access methods, file protection.

UNIT-II

Process management: CPU scheduling & schedulers, CPU scheduling techniques: Pre-emptive and non-preemptive scheduling, FIFO, SJF, Round Robin, Priority Scheduling, Multi-level queues, performance evaluation of scheduling algorithms.

UNIT-III

Memory management: Contiguous and non-contiguous allocation schemes MFT, MVT, swapping, memory fragmentation, Dynamic memory allocation, paging, virtual memory, page replacement algorithms: FIFO, LRU, OPTIMAL, Frame allocation schemes, Segmentation.

UNIT-IV

Disk scheduling: FCFS, SSTF, Scan, C-Scan Look, C-Look sector Queuing. Inter-process Communication, Process synchronization, Mutual exclusion, Semaphore and its implementation monitor.

UNIT-V

Concept of Deadlock, necessary conditions for deadlock, Resource allocation graph, deadlock prevention, deadlock avoidance and recovery techniques.

BOOKS:

1. Operating System Concept- Galvino & Silverschatz (Addison Wesley)2. Operating System Concepts-J.L. Peterson & A. Silverschatz (Add. Wesley)3. Modern Operating System – A. S. Tanenbaum (PHI, 1995)4. Operating Systems – Concept & Design (Milan Milenkovic) (MGH, 1992)5. An Introduction to Operating Systems- H. M. Deitel (Addison Wesley, 1984)

IT-14: ACCOUNTING AND MANAGEMENT CONTROL

UNIT-I

Basic Accounting Concepts- Book-keeping, Accounting, Accounting conventions, Trial Balances, Trading, profit & Loss A/c and Balance Sheet, Simple Problem with adjustments.

UNIT-II

Depreciation: Meaning, Features, Factors, methods (Simple Problems), Cost Classification, Types of Costs, methods, systems and techniques of cost accountings, Break even analysis- basic concepts, make or buy decisions.

UNIT-III

Variance analysis – Meaning, need of standard costing variance analysis, types of variance problems on material variance only.

UNIT-IV

Management Control Systems : Concepts of management and administrations, functions, Responsibility Centers Management art, Science and profession.

UNIT-V

Management by Objectives: Meaning, Objections, advantages & limitations and types of budget preparation of cash and flexible budgets.

BOOKS :

1. Cost Accounting, Jain and Narang, kalyani Publishers.2. Financial Accounting, Jain and Narang, kalyani Publishers.3. Accounting for Management, Bhattacharya S. K. Dearden, John, Prentice Hall of India, New Delhi.4. The Essential of Financial Accounting, Chadwick, Prentice Hall of India Pvt. Ltd., New Delhi.

IT-15: MATHEMATICAL FOUNDATIONS

UNIT-I: Chapter-1(Page 2-80)

1.1 Notation

1.2 Connectives1.3 Normal Forms1.4 Theory of Inference for statement calculus1.5 The predicate calculus

UNIT-II:Chapter-2(Page 140-210 & 232-243)

2.1 Relation and Ordering

2.2 Functions

2.3 Recursion

UNIT-III: Chapter-3 Algebraic Structures (Page 319-359)

GroupsApplication of residue arithmetic computers

UNIT-IV: Chapter-4 Lattices & Boolean Algebras (Page 378-391 & 397-405)

4.1 Lattices as partially ordered sets lattices as algebraic system some properties of lattices4.2 Boolean Algebra sub algebra, Direct project, homomorphism.

UNIT-V: Chapter-5 Graph Theory (Page 468-501)

5.1 Definition paths, reach ability, connectedness Matrix, representation of graphs, trees.

BOOKS:

1. “Discrete Mathematical Structures with Applications to Computer Science”, Tremblay J. P., McGraw Hill.

2. “Discrete Mathematical Structures for Computer Science”, Kilman B. PHI.,3. “Concepts in Discrete Mathematics”, Sahani S. Camelar Publisher, USA.

IT 11L: INFORMATION TECHNOLOGY LAB

Learning to use MS-OFFICE: MS-WORD, Use of data base and spread sheet, slide creation with PowerPoint.

LINUX & SHELL PROGRAMMING:

INTRODUCTION :

What is operating system, functions of O.S., types of O.S, Basic concepts of multi user system,

Introduction to Linux, characteristics of Linux, component of linux, SHELL, types of SHELL, File naming,

file system, types of users in linux, difference between DOS file system, linux file system.

Simple Directory Commands! pwd, mkdir, cd, rmdir,ls command, various options of ls.

Simple File Commands : cat, cp, rm, mv and other commands, wild card characters,

file access permission, chmod command,cmp,comm.,diff,wc,vi editor, types of editor, various

commands of vi editor,Pipes and filters : Standard files, redirection, filters (grep, wc, cut,

head,sort,unique,,tr,tail commands) environment variables,ps command,kill,running jobs

background, communication commands,su command,set command, .profile command.

INTRODUCTION TO SHELL PROGRAMMING :

Creation of shell program, executing the shell script, echo command, creating variables referencing

variables, expr command, various control statements in linux, break and continue commands, array

handling in linux, floating point operations, programs on shell script.

Text Books:

1. UNIX- Concepts and applications,

By: Sumitabha Das TMH publication

Reference Books:

2. Using UNIX – Special Edition ,

PHI publication

3. The UNIX programming Environment,

By: Kernighan and Pike, PHI publication

IT 12L: PROGRAMMING & DATA STRUCTURE LAB.

(C Language)

Objective : This is the first programming language subject student will learn. This subject will teach them programming logic, use of programming instructions, syntax and program structure. This subject will also create foundation for student to learn other complex programming languages like C++, Java etc.

IT12 - C Programming

1 An Overview of C1.1 A Brief History of C1.2 C is middle-level Language1.3 C is a Structured Language1.5 The Form of a C Program.1.7 Compilation & Execution of C. Program on Dos & Unix

2 Variables, Data Types, Operator & Expression2.1 Character Set2.2 C Token2.3 Identifier & Keyword2.4 Constant2.5 Data Types in C2.7 Operator & Expression2.8 Precedence & Associability of Operators.3 Console I/O3.2 Character input & Output3.3 String Input & Output.3.4 Formatted Input/Output (scanf/printf)4 Control Statement4.2. Selection StatementsIf, Nested if, if-else-if, The Conditional Expression, switch4.3. Iteration Statementsfor loop, while loop, do-while loop4.4 Jump Statements:Goto & label, break & continue, exit() function5 Pointers5.2. Memory Organization5.3. The basics of Pointer5.4. The Pointer operator5.5. Application of Pointer5.6. Pointer ExpressionDeclaration of Pointer, Initializing Pointer5.8. Pointer Arithmetic5.9. Precedence of &, * operators5.10. Pointer to Pointer

6 Array & String6.1 . Single Dimension ArraysAccessing array elements, Initializing an array6.2 Multidimensional Arrays

Initializing the arrays, Memory RepresentationAccessing array elements6.3 . Passing Single Dimension array to Function6.4 . Array & Pointer6.5 . Array of Pointer6.6 String Manipulation Functions7 Function7.1. Introduction7.2. Arguments & local variables7.3. Returning Function Results by reference &Call by value7.4. Recursion8 Storage Class & Scope8.1. Meaning of Terms8.2. Scope - Block scope & file scope8.3. Storage ClassesAutomatic Storage, Extern Storage, StaticStorage, Register Storage9 Structure, Union, Enumeration & typedef9.1. StructuresDeclaration and Initializing Structure,Accessing Structure members, StructureAssignments, Arrays of Structure, PassingStructure to function, Structure Pointer9.2. Unions10 C Preprocessor10.1. Introduction10.2. Preprocessor Directive11 File handling11.1. Introduction11.2. Defining & Opening a File11.3. Closing a File11.4. Input/Output Operations on Files11.5. Error Handling During I/O Operation11.6. Random Access Files11.7. Command Line Arguments.Text Books and References:1. C: The Complete Reference: Herbert Schildt2. Let us C Solutions: Y.P. Kanetkar3. Spirit Of “C”: Moolish Kooper.4. Programming in C : S. Kochan.5. C Programming Language: Kernighan & Ritchie.6. Programming in C: R. Hutchison.7. Graphics Under C: Y. Kanetkar

Semester - IIIT-21: DATA BASE MANAGEMENT SYSTEMS

UNIT-I

Review of file systems, characteristics of database approach, DB system concepts and architecture, data models, schema & subschema, 3-tier architecture, Physical and logical data independence, data base languages: DDL & DML. Data modeling using E-R approach, Reduction of E-R diagrams to tables.

UNIT-II

Hierarchical data model: Basic concepts, tree-structure diagrams, physical and logical database record concepts, data manipulation, and overview of IMS Access & Storage structures.

Network data model : DBTG data structure diagrams concept of set, owner and member records, set membership, Insertion and retention options, data manipulation overview of DBTG DB system.

UNIT-III

Relational model : Structures of relational database, Relational algebra, Key Concepts, Integrity Constraints, Concept Of normalization, types of data dependencies, INF, 2NF, 3NF, BCNF, 4NF and 5NF.

UNIT-IV

Query processing: basic structure of query, translation of queries Into relational algebra, basic algorithms for executing query operations, use of SQL as a query processing language, simple and nested queries, concept of views, Join relations.

File organization in DBMS: Introduction,File Organization,Sequential File Organization,Indexed Sequential File Organization,Direct File Organization.

UNIT-V

Concept of data base transaction, transaction states, ACID properties, serializability. Concurrency control in DB Systems: lock based and time-stamp baaed techniques, Failure and recovery in DB systems, log-based recovery, shadow-paging.

BOOKS;

1. Fundamentals of Database Systems - Elmsary and Navathe, Addison Wesley. 2. Principles of Database Systems - .Ullmari J. D., Galgotia Publications.3. Introduction to Database Systems - Bipin C Desai Narosa Publishing House.4. An Introduction to Database systems-Date C. J. Addison Wisly.

IT22-OBJECT ORIENTED DESIGN AND MODELING

Unit 1: Introduction to Object Oriented Modelling: Object Oriented Modeling, Characteristics Object Oriented Modeling: Class and Objects, Links and Association, Generalization and Inheritance. An Object Model, Benefits of OO Modeling, Introduction to OOAD tools

Unit 2: Object Oriented Analysis: Object Oriented Analysis, Differences between Structured Analysis and Object Oriented Analysis, Analysis Techniques:- Object Modeling, Dynamic Modeling, Functional Modeling

Unit 3: Using UML:Introduction,Object Model Notations,Basic Concepts, Structural Diagrams:-Class,Object, use case diagram, Component, Deployment,state transition diagram.

Behavioral Diagrams:Use Case,Sequence,Interaction Overview,Activity,State. Modeling with Objects UNIT 4: Object Oriented Design:System Design- An Object Oriented Approach, Breaking into Subsystems, Concurrency Identification,Management of data store, Controlling events between Objects, Handling Boundary Conditions

Object Design -

Object Design for Processing, Object Design Steps, Designing a Solution,Choosing Algorithms, Choosing Data Structures, Defining Classes and delegation of Responsibilities to Methods

UNIT 5 : Modeling:-

Object Modeling- Advance Modeling Concepts- Aggregation, Abstract Class. Multiple Inheritance, Generalization as an Extension,Generalization as a Restriction, Metadata,Constraints,An Object Model

Dynamic Modeling- Events, State and State Diagram,Elements of State Diagrams,Examples of State Diagrams, Advance Concepts in Dynamic Modeling,Concurrency, A Dynamic modelFunctional Modeling- Functional Models, Data Flow Diagrams, Features of a DFD, Design flaws in DFD, A Functional model, Relationship between Object, Dynamic, and Functional Models

TEXT BOOK

1. Grady Booch, "Object Oriented Analysis and Design with Applications", Addison Wesley, 1994.

REFERENCE BOOK :

1. Schach,* Stephen R., "An Introduction to Object Oriented Systems Analysis and Design with HJML and the Unified Process" Tata McGraw Hill, 2003.

2. Object-Oriented Analysis and Design with Applications (3rd Edition)-Grady Booch, Robert A. Maksimchuk, Michael W. Engel, and Bobbi J. Young

IT-23 : SOFTWARE ENGINEERING

UNIT-I

S/W Engineering as layered technology, process, methods & tools. S/W process models, prototyping model, RAD model, process technology, project management concepts, S/W development life cycle.

UNIT-II

S/W process & Project matrices: S/W measurement, matrices for S/W quality, S/W project planning, S/W project estimation, Decomposition techniques, cocomo model, project scheduling & monitoring. Defining a task network, scheduling.

UNIT - III

Risk analysis & management, S/W quality assurance, quality control, S/W preview, formal approaches to SQA, ISO 9000 quality standards. S/W configuration management, SCM process.

UNIT-IV

System Engineering, Business- Process Engineering, Requirements Engineering, System Modeling Analysis concepts & Principles, S/W prototyping, Specifications, Analysis Modeling, data & Functional Modeling.

UNIT - V

S/W design concepts, Design process, Modular design, Architectural design, component-level design, S/ W testing : white-box & black-box testing, matrices for S/W

BOOKS

1. S/W Engineering - R. S. Pressman, (5th-ed), (Me GrawHill).2. Fundamentals of S/W Engineering - Rajib Mall (PHI).

3. A Software Engineering - Pankaj Jolata, Naresa Publications.

IT- 24 : WRITTEN AND ORAL TECHNICAL COMMUNICATION

UNIT - I :

Introduction to Communication

Meaning and objective of communication, people and communication, management arid communication, communication techniques, barriers and principles of commun ica t ion .

UNIT -II : Study Skills

How to improve your reading note-tasking from lecturers and reference materials.

Oral Communication :

Importance of preparation, delivery, subject matter, objects, public speaking, telephone techniques.

UNIT - III :

Written communication

Purpose, content, structure, drafting a letter, reports, forms and their functions, word processing, drafting of representations, minutes writing, precise writing of commercial matter, official correspondence, drafting of representation.

UNIT - IV :

Applying for a Job

Letter of application, application forms, curriculum vitae, which one gets the jobs.

Interviewing being interviewed:

The interview, the appointment board, the employers view;

UNIT - V :

Effective Meetings

Preparation, conduct and strategies, follow-up minutes, effective and ineffective groups, types and size of meeting, requisite skills.

BOOKS PRESCRIBED:.

1. "Human Communication", S. Harries, Publications.

2, "Business Communication", Pradhan, Bhenda, Himalayas Publishing House.

BPB

IT-25: OPERATION RESEARCH

UNIT - I

Linear programming: Graphical method for two dimensional problems - central problem of linear programming, various definitions - statements' of basic theorems and properties.

UNIT - II

Phase I and Phase II of the simplex method-revised simplex method-primal and dual-dual simplex method-sensitive analysis- transportation problem and its solution-assignment problem and its solution by Hungarian method.

UNIT - III

Integer programming: Gomory cutting plane methods - Branch and Bound method. Queuing Theory: Replacement of terms that deteriorate - .Replacement of items that fall - Group replacement and individual replacement.

UNIT - IV

Games and Strategies : Introduction two person zero sum games, Some basic .terms, The, max min-minimax principle Games Without saddle Points-Mixed Strategies Graphic Solution of 2 x n and m x 2 games, Dominance property, Arithmetic method for n x n games, General solution of m x n rectangular games.

UNIT - V

Non linear Programming : Introduction, formulating a nonlinear programming problem (NLPP), General non linear programming problem, Constrained optimization with equality constraints, Constrained Optimization With inequality constraints, Saddle point problems. Saddle point and NLPP.

Non linear programming methods. Graphical solution, Kuhn-Tucker conditions with non negative constraints, Quadratic Programming Wolfed modified Simplex method.

REFERENCES:

1. "Operations Research", Kanti Swarup, Gupta. P. K. and Manmohan, Sultan Chand and Sons.2. "Operations Research, An introduction", Hamdy A. Tarra, McMillan Publishing Co., '3. "Introduction to Operation Research", Hi Her. F. Lieberman, G. J. Hojden Day.4. "The Critical Path Method", Shaffer. L R., Fitter. J. B. and Meyer. W. L., McGraw Hill.5. "Mathematical Programming Techniques", Kambo. N.S., Mc-Graw Hill.6. "Fundamentals of Queuing Theory*. Gross O. and Harris. C.M., John Wiliey and Sons.7. "Optimization Methods in Operations Research and System Analysis", Mital K.V., New Age

International (P) Ltd.8. "Introduction to operations research: A Computer Oriented Algorithmic Approach", Tata Mc-

Graw Hill.

IT21L-OOPS LAB(C++)

Procedural vs object oriented language, features of object oriented programming system (oops). Introduction to C++, C vs C++, data types, operators writing a C++ program, input and output statements.

Control statements: Expression statement, conditional statements, looping statements, breaking control statement, array, processing an array, Array and function, function, types of function, declaration and defined a function, recursive function.

Structure: Declaration of structure deference between structure and array, pointer and structure.

Class and Objects: How to declare class, Defining member functions, making an outside function inline, how to access the data member of a class, array of objects,constructor- definition, features of constructor^ types of constructor, destructor, inline member function, this pointer.

Inheritance: Definition, characteristics, access specifier, types of inheritance, friend function, friend class, constructor under inheritancePolymorphism: Definition, types of polymorphism, functions over loading and operator overloading, virtual function, virtual base class, pure virtual function, abstract class.

Template; Definition, types of template, function template and class template exception handling.

Data file Operations: Stream member function, sequential file, binary file operations, class and file operations, random access files.

IT-22L: DBMS LAB. (ORACLE)

INTRODUCTION TO MANAGING DATA:

Database concept, DBMS, characteristics of DBMS, RDBMS, characteristics of RDBMS, E. FT Codd's Rule.

INTRODUCTION TO ORACLE.

Characteristics Of Oracle :Various tools of oracle, Data types, creating a table, create a table from another table, copy the structure, inserting data into tables, updating the contents of a table, delete operators, many facts of the select command.modifying the structure of the table, dropping the table and truncate the table:

Data Constraints : Column level, table level constraint, null value concept, primary key constraint, unique key constraint, check constraint, foreign key constraint.

Arithmetic operators used in oracle, logical operators, relational operator,, pattern matching,

oracle functions, grouping data from tables,, joining the table, types of joining, sub queries, types of sub query, correlated queries, sub queries, set operations: union, Intersect, minus clause.

View, creating a view, advantage, limitation, dropping a view, sequence, alter sequence, drop sequence.

Data control language : Grant revoke.

Transaction control language : Commit, save point and rollback.

INTRODUCTION TO PL/SOL :

Introduction, advantages of PL/SQL,Architecture, PL/SQL syntax, understanding the PL/SQL block structure, PL/SQL data types, Attributes:%type, %rowtype, control statements.

Cursors : Definition, types of cursor, explicit cursor, explicit cursor management-, explicit cursor, cursor mgt, cursor for loop, cursor for update.

Exception handing, stored procedure, declare of a procedure, types of parameter, dropping a procedure.

Function : Definition, declaration, how to execute a oracle function. . ' ^

Database Triggers : Introduction, Definition, difference between trigger and-procedure, types of triggers, syntax for creating triggers, dropping a trigger.

Recommended Books:

1. Understanding ORACLE Perry J & Later J

2. SQL & PL/SQL programming Scott Urman

3. SQL & PL/SQL programming Language Ivan Byrass

Semester – 3IT-31 THEORY OF COMPUTATION

UNIT-I

Finite Automata & Regular Expressions: finite state systems. Non-Deterministic Finite Automata. Finite Automata with E-Moves, Regular Expressions, Two-way finite automata, Finite Automata with output.

UNIT-II :

Properties of Regular Sets : The Pumping Lemma for Regular Sets, Closure Properties of Regular sets, Decision Algorithms for Regular Sets, The MYHILL-NERODE Theorem and minimization of Finite Automata.

UNIT-III :

Context Free Grammars : Context Free Grammars, Derivation Trees : Simplification of context free grammars. Chomsky Normal Form : Greibach Normal Form.

UNIT-IV :

Pushdown Automata, Properties of Context Free Languages : The Pumping Lemma for CFL's. Closure Properties of CFL's, Decision Algorithms for CFL's.

UNIT-V :

Turing Machines : The Turing Machine Model, Computable -Languages and functions. Techniques of Turing Machine Construction, Undecidability : Properties of Recursive and Recursively Enumerable Languages :

Universal Turing Machines (without any reference to undecidable problems), The Chomsky Hierarchy :.Regular grammars, Unrestricted grammars, Context sensitive languages.

TEXT BOOK :

Introduction to Automata Theory & Languages and Computation, John E. Hpperoft & Jeffery D Ullman, Narosa Publishing House.

REFERENCE BOOKS :

1. Computer Theory, Cohen.

2. Theory of Computation, KLP Mishra & N. Chandrasekharan, PHI.

3. Automata Thoery P.K Srimani

IT-32 : INTERACTIVE COMPUTER GRAPHICS

UNIT-I

Computer graphics applications, graphics systems : video display devices, faster scan systems, graphics Monitors and workstations, input devices, hard copy devices, graphical user interface and interactive input methods : user dialogue, input of graphical data, interactive picture-construction techniques.

UNIT-II

Output primitives : Points and lines, line drawing, algorithms, frame, buffer, circle generation and ellipse generation algorithms, pixel addressing and object geometry, filled area primitives, character generation, initialising.

UNIT-III

Two dimensional geometric transformations:

basic transformations (translation, rotation, scalling), matrix representations and homogenous coordinates, composite transformations (translation, rotation, scalling, reflection, shear) transformation between coordinates 3.2 systems.

Two dimensional viewing : viewing pipeline, viewing coordinates reference frame, window to view port coordinate transformation, point 2.3, clipping 2.5, line dipping polygon clipping.

UNIT-IV

Three dimensional geometric: and modelling transformation : Translation, rotation, scalling,

reflection, shear. Three dimensional viewing : viewing coordinates, projection, projection transformation, clipping.

UNIT-V

Visible-surface detection methods-: back face detection, depth buffer, a-buffer, scan LINE, depth-sorting, BSP-tree, area subdivision method.

Illumination models and surface rendering method : light sources, illumination models, displaying light intensities, halftone patterns and dithering techniques, polygon rendering methods.

BOOKS. :

1. Hearn, D. & Baker, M.P., Computer Graphics, 2/ed. (PHI)

REFERENCE BOOKS :

1. Foley, J.D, Van Dam, A.V. Feinor, S.K. Hughes, 3.F. Computer Graphics : Principles & Practice, 2/ ed, (Addfson-Wesley).

2. Rogers, D.F., Mathematical Elements of Computer Graphics (Me Graw-Hill)

3 . Newman, W. & Sprent, R.F., Principles of Interactive Computer Graphics.

IT-33 ; DATA COMMUNICATION AND NETWORKS

UNIT-I :

Introduction to computer Networks:

What is computer network, Tools and motivation.

Application of networks.

point-to-point or switched networks.

Circuit switched networks \ packet switched networks.Broad Cast Networks, Packet radio networks, Satellite Networks, LAN.

Network protocols, OSI model. Examples of some networks, concept of delays, how to reduce delays.

Data Transmission:

Transmission Terminology Analog & Digital data Transmission Transmission impairments. Transmission media and its characteristics.

UNIT-II

Data encoding and communication technique PCM, AM, FM and PM.

Asynchronous Transmission, synchronous Transmission, Error detection technique, Parity, CRC & FEC.

Interfacing RS. 232 and X.21 Multiplexing and communication Hardware.

FDM, TDM, STDM, Modems, Multiplexer, Demultiplexer, concentrators, Front end processors.

UNIT-III

MAC and Data Link Layer :

• DLL fundamentals.• Retransmission strategies.• Contention based MAC protocols• Polling based MAC Protocols

• MAC protocols f6r'High speed networks.

UNIT-IV

Network Layer :

• Introduction to layer.functionality

• Routing

• Congestics Control Algorithms

• IP

• Internetworking.

UNIT-V

Transport Layer and application layer services:

• Transport services and mechanism

• Transport control mechanism

• TCP/UDP

• RPC : (Remote Procedure Call)

• Applications: FTP, Telnet, E-mail, WWW, DNS.

BOOKS:

1.Computer Network A system approach, 4th ed.: Larry L. Peterson and Bruce S. Davie, Morgan Kaufmann Publishers.

2. . Data Communications and networks:Forouzan, TMH.

Reference Books: 1. Computer Networks:Andrew Tanenbaum, PHI Publication, 2. Data & Computer Communication: William Stallings, PHI Publication,

IT-34 : DESIGN & ANALYSIS OF ALGORITHM

UNIT I:

Algorithm Analysis – Time Space Tradeoff, Analysis Of Algorithm Efficiency, Asymptotic Notations – Conditional asymptotic notation , Removing condition from the conditional asymptotic notation , Recurrence equations – Solving recurrence equations

UNIT II:

Divide and Conquer Approach: Merge Sort, Quick sort , Strassen’s algorithm for Matrix Multiplications. Graph Algorithms: Representation of Graphs, Breadth First Search, Depth First Search, Topological Sort, Algorithm for Kruskal’s and Prim’s for finding Minimum cost Spanning Trees, Dijkstra’s and Bellman Fort Algorithm for finding Single source shortest paths. All pair shortest paths and matrix multiplication, Floyd – Warshall algorithm for all pair shortest paths.

UNIT III: Dynamic Programming: Dynamic Programming,Elements of Dynamic Programming, Matrix Chain Multiplication, Longest common subsequence and optimal binary search trees problems. Greedy Algorithms: Elements of Greedy strategy, An activity selection problem, Huffman Codes, A task scheduling problem,knapsack problem,traveling salesman problem.

UNIT IV Backtracking: General Method , 8 Queens problem ,sum of subsets , graph coloring ,Hamiltonian problem ,Branch and Bound: introduction, knapsack problem, Assignment problem , traveling salesman problem.UNIT V

String matching: The naïve String Matching algorithm, The Rabin-Karp Algorithm, The Knuth-Morris Pratt algorithm. NP-Complete Problem: Polynomial-time verification, NP-Completeness- class P ,class NP and NP completeness problem, NP Hard completeness problem.TEXT BOOK :

Introduction to the Resign and Analysis of Algorithms, Anany Levitin : Pearson Education, 2003.

REFERENCE BOOKS :

1. T. H. Cormen, C. E. Leiserson, R.L.Rivest, and C. Stein, "Introduction to Algorithms",Second Edition, Prentice Hall of India Pvt. Ltd, 2003.2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "The Design and Analysis of Computer Algorithms", Pearson Education, 1999.3. Fundamentals of Computer Algorithms, Horowitz and Sahni, Galgotia Publications.

4. Introduction to. Algorithms, Gormen, Leiserson and Rivest : Prentice Hal of India.

IT-35: CORE JAVA

UNIT-I: Paradigm of programming languages, comparison of procedure oriented approaches and object oriented concepts, basic concept of OOPS, introduction to Java, basic features of Java, JVM concepts data types, variables, Java operators, expressions, various types of control statements, Arrays.

Class & Objects : Class fundamentals, creating object's, introducing methods, static methods, constructors, types of constructors, method overloading, this keyword, garbage collection,

finalize method,

UNIT-II

Inheritance and polymorphism : inheritance basics, access control, multilevel inheritance, -abstract class, polymorphism, final keyword.Packages and interfaces : Definition of package, seeing the CLASS PATH, package naming, interface.

UNIT-III

Multithreading, I/O and string handling, introduction to multithreading, main thread, lava thread model, thread class & runnable interface, thread properties,synchronization in java, interthread communication, I/O basics, FILE stream classes, byte stream classes and character stream classes, Input and output stream hierarchy reading and writing data from and to file, transient and volatile modifiers, stream tokenizer, serialization, print stream, random access files, some useful packages like Java, lang, string, java, lang. Math.Java. util.*.

UNIT-IV

Applet programming, graphics & user interfaces and exception handling, applet class, applet architecture, handling events, HTML applet tag, passing parameter to applet, exceptions, types of exception, handling of exceptions using try, catch, catching multiple exceptions using finally clause, throwing exception.

Awt: Awt class, Awt controls, layouts and layout manager, event handling by awt components, menu bars and menus.

UNIT-V

Swings, networking & RMI : Fundamentals, difference between awt and swing based GUI, fundamentals on networking, socket overview, reserve ports, creating client side and server side programming using stream socket and datagram sockets, URI, networking using java.net package, overview of RMI applications, RMI architecture, RMI object hierarchy, creating stubs and skeleton.

RECOMMENDED AND REFERENCE BOOKS :

1. Programming with Java, E. Balaguruswamy.2. Java Complete Reference, Herbert Schildt.

3. Web Enabled Commercial Application Development using Java 2.0, Ivan Bayross.

REFERENCE BOOKS :

1. Core Java Vol-I Fundamentals, Core Java Vol-II Fundamentals, Gay Cornell.

2. Java ln a Nutshell, David Flanagan (O'reilly Publication)

IT-31L- JAVA PROGRAMMING

Session 1:Data types, variables and operators

Exercise 1: Write a program in Java to implement the formula (Area = Height x idth) to fmd the area of a rectangle. Where Height and Width are the rectangle's

.Exercise 2: Write a program in Java to find the result of following expression (Assume a = 10, b = 5)

i) (a « 2) + (b » 2)

ii) (a)| |0»0)

iii)(a + b*10G}/10

iv)a & b

Exercise : Write a program in Java to find the average of marks you obtained in your 10+2 class.

Exercise: Write a program in Java that calculate sum,average and mean deviation of n number

Exercise: Write a program in Java that will print square and cubes of odd numbers from 0 to 50. the o/p should be

Original number square cube

Session 2: Statements and array

Exercise 1: Write a program in Java to find A*B where A is a matrix of 3x3 andB is *^a matrix of 3x4, Take the values in matrixes A andB from the user.

Exercise 2: Write a program in Java to compute the sum of the digits of a given X integer, Remember, your integer should not be less than the five digits, (e.g., if input is 23451 then sum of the digits of 23451will be 15)

Session 3: Class and Objects

Exercise 1: Write a program in Java with class Rectangle with the data fields width, length,' area and colour. The length, width and area are of double type and colour is of stang type .The methods are sel_ lenglh (} , sel_width (}, set_ colourQ, and find_ area Mj. Create two object of Rectangle and compare their area and colour. If area and color both are the same for the objects then display "Matching Rectangles", otherwise display "Non matching Rectangle".

Exercise 2: Create a class Account with two overloaded constructors. The first constructor is used for initializing, the name of account holder, the account number •/and ihe initial amount in the account. The second constructor is used for initializing the name of the account holder, the account number, the addresses, the type of account and the current balance. The Account class is having methods Deposit Q, Withdraw (), and Get_Balance(), Make the necessary assumption for data members and return types of the methods. Create objects of Account class and use them.

Exercise 3: Write a program in Java to create a stack class of variable size with and pop () methods. Create two objects of stack with 10 data items in both. Compare the lop elements of both stack and print the comparison result.

Session 4:

Inheritance and polymorphism

Exercise 1: Write a Java program to show that private member of a super elass cannot be accessed from derived classes.

Exercise 2: Write a program in Java to create a Player class. Inherit the classes Cricket _Player, Football _Player.and Hockey_ Player from Player class.

Exercise 3: Write a class Worker and derive classes DailyWorker and SaiariedWorker from it. Every worker has a name and a salary rate. Write method comPay(hit hours) to compute the week pay of every worker. A Daily Worker is paid on the basis of the number of days s/he works. The Salaried Worker gets paid the wage for 40 hours a week no matter what the actual hours are. Test this program to calculate the pay of workers. You are expected to use the concept of polymorphism to write this program.

Exercise 4: Write a Java program based on method overloading and method overriding.

Session 5: Package and Interface

Exercise 1: Write a program to make a package Balance in which has Account class with Display_Balancc method in it. Import Balance package in another program to access Di splay __Balance method of Account class.

Exercise 2: Write a program in Java to show the usefulness of Interfaces as a place to keep a constant value of the program.

Exercise 3: Create an Interface having two methods division and modules. Create a class, which overrides these methods.

Exercise 4: Write a program in Java which implements interface Student which has two methods Display_Grade and Atrendance for PG_Students and UG_Students (PG_Students and UG_Students arc two different classes for Post Graduate and Under Graduate students respectively).

Session 6: Exception Handling

Exercise I: Write a program in Java to display tnc names and roll numbers of students. Initialize respective array variables for 10 students. Handle ArraylndcxOutOfBoundsExeption, so that any such problem doesn't cause illegal termination of program.

Exercise 2: Write a Java program to enable the user to handle any chance of divide by zero exception.

Exercise 3: Create an exception class, which throws an exception if operand is non-numeric in calculating modules. (Use command line arguments)

Session 7: Multithreading

Exercise 1: Write a Java program to create five threads with different priorities. Send "''two threads of the highest priority to sleep state. Check the aliveness of the threads and mark which thread is long lasting,

Exereise 2: Write a program to launch 3 threads. each thread increments a counter 'variable. Run the program with synchronization,

Exm:ise 3: Write a program for generating 2 threads, one for printing even numbers and the other for printing odd numbers.

Session 8: Reading, Writing and String handling in Java

Exercise 1: Writ a program in Java to create a String object. Initialize this object with your name. Find the length of your name using the appropriate String method. Find the character 'a' is in your name or not; if yes find the number of times 'a' appears in your name. Print locations of occurrences of 'a' .Try the same for different String objects.

Exerthe 2: Write a program in Java for String handling which performs the following:

i) Checks the capacity of StringBuffer objects.

ii) Reverses the contents of a string given on console and converts the resultant

string in upper case,

iii) Reads a string from console and appends it to the resultant string of ii.

Exercise 3: Write a program in Java to read a statement from console, convert it into "-"upper case and again print on console,

Exercise 4: Write a program in Java, which takes the name of a file from user, read contents of the file and display it on the console.

Exercise 5: Write a Java program to copy a file into another file.

Session 9; Applets and it’s applications

Exercise 1: Write a Java Applet program which reads your name and address in different text fields and when a button named find is pressed the sum of the length of characters in name and address is displayed in another text field. Use appropriate colors, layout to make your applet look good.

Exercise 2: Create an applet which displays a rectangle/string with specified colour & coordinate passed as parameter from the HTML file.

Exercise 3: Write a program to store student's detail using Card Layout.

Exercise 5: Write a Java Applet program, which provides a text area with horizontal scrollbars. Type some lines of text in the text area and use scrollbars for J. movements in the text area. Read a word in a text field and find whether the word is in the content of the text area, or not.

Session 10: Networking ,AWT, swing programs

IT-32L ; NETWORK PROGRAMMING LAB.

1. IDENTIFYING WELL KNOWN PORTS ON A REMOTE SYSTEM (OUR SYSTEM): Listening to the various known ports by opening client connections. If-the exception does not occur then the remote port is active else the remote port is inactive,

2. WRITING CHAT APPLICATION: One-One; By opening socket connection and displaying what is written by one party to other.

3. CHAT APPLICATION : One to many (multi cast) : Each client opens a socket connection to the server and writes to the socket. All other parties can see whatever one party writes,.

4. DATA MANIPULATION ON A REMOTE DATABASE : At the remote database a server listens for client connections. This server accepts SQL queries from the client, executes it on the database and. Sends the response to the client. (add, delete, modify SQL commands).

5. MAIL CLIENT: SMTP client: Gives the server name, send e-mail to the recipient using, SMTP commands.

6. SIMPLE FILE TRANSFER BETWEEN TWO SYSTEMS : By opening socket connection to our server on one system and sending a file from one system to another.

7. HHTP-SERVER: Develop a HTTP server to implement the following commands. GET, DELETE. The server must handle multiple clients. 8. DOWNLOADING ANY FILE FROM HTTP SERVER: Using Java URL- connection

class.

Semester-4

IT-41: JAVA PROGRAMMING ( ADVANCE)

UNIT-I

Database connection, JDBC drivers, statements & types, record sets & various operators, electronic data transaction by XML-introduction, DTD, comparison between HTML & XML, difference between S^ML & XML, CSS, XSL, DSO, DOM & XML schema.

UNIT-II

Servlet and JSP programming :

Server side component using servlet-introduction, life cycle of servlet, architecture, simple programming in servlet using Javax.servlet package and javax.servJet.http package, communication between HTML & serviet, database and serviet linking, serviet chaining, cookies and session tracking.

Server side scripting of JSP-introduction, life cycle of JSP, architecture, simple programming in JSP, JSP elements (expression, declaration, directive, servlet), standard action tags, communication between JSP & HTML, database connectivity with JSP.

Developing the custom tag in JSP.

UNIT-III

XML and JSP data exchange using DOM and parser package, introduction to bean, creating bean, types of beans, deploying beans.

UNIT-IV

JSP struts implementation - introduction, life cycle, MVC architecture, advantages and disadvantages, configuration of struts application in web server, implementation action class, action form class, using of struts-config. XML file, exception handling.

UNIT-V

Enterprise java bean (EJB) – Introduction, architecture, life cycle & different types of bean (session bean, entity bean, message driven bean), deployment procedure using application.

Web security concepts – HTTP authentication, retrieving authentication information.

RECOMMENDED BOOKS :

1. Java servlet programming (O’ Reilly)2. Java JSP Programming (O’ Reilly)3. Sams Teach Yourself XML in 21 days.

IT-42: A.I. APPLICATIONS

UNIT-I : Introduction to A.I. concepts :

AI problem solving, defining an AI problem as a state space search, production systems, search space control/ Depth first, breadth first search, Heuristic search : Hill climbing, best first, minimax search Alpha-beta cut offs.

UNIT-II : Knowledge representation :

Predicate logic, rule-based systems, forward and backward reasoning, conflict resolution, semantic nets, frames, scripts conceptual dependency.

(Elementary concepts of the following)

UNIT-III : Scope of A.I. :

Natural language processing : syntactic processing and semantic analysis.

UNIT-IV : Expert systems :

Architecture, the knowledge base, inference mechanism, expert system development process.

UNIT-V : Pattern recognition :

Artificial neural nets, distributed AI, Multi-agent systems.

REFERENCES :

1. Introduction to AI and Export Systems, Patterson, D. W., Prentice Hall of India 1992.

2. Artificial Intelligence, Rich E. and Knight K.,Tata McGraw Hill (2nd edition). 3. Artificial Intelligence An Engineering Approach, Schalkoff R. J., McGraw Hill International

edition. 4. Principles of AI, Nilsson N.J., Narosa Publishing House.5. Rule Based Expert Systems, Sasikumar M., Ramani S . , Narosa Publishing House.

IT-43: ADVANCED DATABASE SYSTEMS

UNIT-I:

Overview of Query processing, Query – optimizer, estimating cost of executing a query plan: selection andjoin size estimation, Transformation of query expressions, equivalence rules, Cost-based optimization, .Heuristic optimization.

UNIT-II:

Concept of distributed database, comparative view of distributed database and centralized .database, data fragmentation, architecture of distributed DBMS; levels of distributed transparency, distributed DATABASE design, top-down and bottom-up approach.

UNIT-III:

Distributed transaction management, two-phase commit protocol, handling of failures, concurrency control, deadlock handling, distributed query processing query transformation, simple join and semi join strategies.

UNIT-IV

Data warehousing, multidimensional data model, star and snow flak schemes. OLAP operations, data warehouse architecture.

Data Mining : Classification, association rules, clustering and application of data mining.

Web Databases• Mobile databases• multimedia databases• spatial databases. Implementing security in databases, Access Control, Grant & Revoke on Views andIntegrity Constraints, Discretionary Access Control, Role of DBA Security inDatabases, Assertions and Triggers.. Integrity security and repositories

UNIT-V

Object-oriented databases : Object-oriented data models, object structure, inheritance, object identity and object .containment,

Parallel databases : I/O parallelism, inter query and intra query parallelism, intra operation and inter operation parallelism.

BOOKS :

1. Database System Concepts (4th edition), Silberschatz, Korth and Sudarshan (McGraw Hill).

2. Principles of Distributed Database Systems (2nd edition) OZSU and Valduriez (Pearson).3. Date Mining Concepts and Techniques, Han and Kamber (Morgan kaufmfnn).

IT-44 : COMPILER DESIGN (ELECTIVE-I)

UNIT-I : Introduction to compilers :

Compilers and translators, structure of a, compiler, compiler writing tools, programming Languages, High level programming languages, definitions of programming languages, Lexical and syntactic structure of a language, finite automata and Lexical analysis, Role of lexical analyzer, regular expressions, finite automata, minimizing the number of syntactic specification of programming languages.

UNIT-II

Context free grammars, derivations and parse trees, capabilities of context free grammars - Basic parsing techniques : Shift reduce parsing - Operator precedence parsing - Top Down parsing - Predictive parsers-Automatic construction of efficient parsers.

UNIT-III

LR Parsers - constructing SLR - canonical LR and LALR parsing tables - using ambiguous grammars -automatic parser generator - implementation of LR parsing tables. Syntax Directed Translation : Schemes -implementation - intermediate code - postfix notation -parse tree and syntax trees - three address code -quadruples and triples - translation of assignment statements - boolean expression - postfix translations -translation with a top down parser.

UNIT-IV

Symbol tables, contents data structures, representing scope information, run-time storage administration, implementation and storage allocation of simple stack allocation schemes and block structured languages, error detection and recovery, lexical phase errors, syntactic phase errors, semantic errors.

UNIT-V

Introduction to code optimization, principle sources of optimization, loop optimization, DAG representation of basic blocks, global data flow analysis, code generation, problems in code generation, register allocation and assignment, code generation from DAG's, Peephole optimization.

TEXT BOOK :

1. Principles of Compiler Design, Narosa 25th reprint, Alfred Aho, Jeffrey D. Ullman.

REFERENCE :

1. Ravi Sethi "Compiler Design-Principles Techniques and Tools", 16th reprint, Pearson Education.

IT-44 Soft Computing (Elective I)

UNIT-I Neural Networks-1(Introduction & Architecture) Neuron, Nerve structure and synapse, Artificial Neuron and its model, activation functions, Neural network architecture: single layer and multilayer feed forward networks, recurrent networks.Various learning techniques; perception and convergence rule, Auto-associative and hetro-associative memory.

UNIT-II Neural Networks-II (Back propogation networks) Architecture: perceptron model, solution, single layer artificial neural network, multilayer perception model; back propogation learning methods, effect of learning rule co-efficient ;back propagation algorithm, factors affecting backpropagation training, applications. UNIT-IIIFuzzy Logic-I (Introduction) Basic concepts of fuzzy logic, Fuzzy sets and Crisp sets, Fuzzy set theory and operations, Properties of fuzzy sets, Fuzzy and Crisp relations, Fuzzy to Crisp conversion

UNIT-IV

Fuzzy Logic –II (Fuzzy Membership, Rules) Membership functions, interference in fuzzy logic, fuzzy if-then rules, Fuzzy implications and Fuzzy algorithms, Fuzzyfications & Defuzzificataions, Fuzzy Controller, Industrial applications.

UNIT-V Genetic Algorithm(GA) Basic concepts, working principle, procedures of GA, flow chart of GA, Genetic representations, (encoding) Initialization and selection, Genetic operators, Mutation, Generational Cycle, applications

TEXT BOOKS:

1. S. Rajsekaran & G.A. Vijayalakshmi Pai, “Neural Networks,Fuzzy Logic and Genetic Algorithm:Synthesis and Applications” Prentice Hall of India. 2Siman Haykin,”Neural Netowrks”Prentice Hall of India 4. Timothy J. Ross, “Fuzzy Logic with Engineering Applications” Wiley India. 5. Kumar Satish, “Neural Networks” Tata Mc Graw Hill

IT-45: MANAGEMENT INFORMATION SYSTEM (Elective II)

UNIT-I : Fundamentals of information systems concepts :

Why information, systems are important - what managerial and users need to know, system concepts-business as a system - information processing concepts - information systems concept recognizing information systems.

Information systems for operations management and strategic advantage :

An overview of information systems - information systems for business operations - information systems for management decision-making, competitive strategy concepts - strategic roles for information systems -strategic information systems and the managerial end-user.

UNIT-II : The systems development, analysis, design and implementation:

The scientific method - the systems approach -understanding a problem and opportunity - developing a solution - implementing a solutign - systems development process prototyping - end user development - managing end-usjar development - managing end-user computing -principles for managing PCs-off-self software - outsourcing - comparison of different methodologies - challenges in developing information systems - IS development in a global environment.

UNIT-III : Transaction processing information reporting and executive information system :

Introduction - the data entry process - batch processing - real-time processing - file and database processing - document and report generation. Attributes of information quality - information presentation alteration information reporting systems - executive information systems.

Management decision making and decision support system:

information and decision making - information and management: Information reporting vs decision support system - decision support system - models for decision support - software for decision support - using decision support system r developing decision support systems.

UNIT-IV : Artificial intelligence & expert systems:

An overview of artificial intelligence - human Information processing - Information theory and information system - knowledge based information system £ components of an expert system --

examples of expert system - developing expert system - benefits and limitations of expert-system rule based, frame-based, object-based knowledge information engine.

UNIT-V : End-user and office information system :

End-user computing - its growth - components of an end-user computing system resources for end-user computing - end-user computing applications - the information center - management implications of end-user computing - office automation - word processing -desktop publishing - image processing - electronic communications system - electronic meeting systems -office support systems - management implications of office automation.

Business function information systems :

Introduction, marketing information system -manufacturing information system - human resource information system - accounting information system -financial information system.

BOOKS :

1. Management Information System, James A '0' Brien, Galgotia Publications.2. Management Information System, Uma G. Gupta, Galgotia Publications.

REFERENCES :

1. Management Information Systems, Charles Parker and Thomas Case, McGraw Hill International.

2. Management Information Systems, W.S. Jawadekar, Tata McGraw Hill.3. Management Information Systems, V.K. Banerjee and R.K. Sachedeva, Vikas Publishing

House.4. Computers Today, S.K. Basandhra, Galgotia Publications.

5. Managing with Information System, J.K. Enter.5. Management Information Systems, G.R. Davis and M.H. Olson, McGraw Hill International.6. Information Systems for Modern Management", Mud rick, Ross and Clagett, PHI.

IT-45 : HUMAN RESOURCE MANAGEMENT (ELECTIVE-II)

MODULE-I : Introduction to Human Resource Management:

Concept, objective, nature and scope of HRM, its growth and development in India, role and function of HR manager.

MODULE-II : Human Resource Base :

Human resource planning, concept, objective, job analysis, recruitment, selection procedures, tests and interview, components of wages, criteria of wage fixation, wage differentials.

MODULE-III : Training and Development:

Training in organization : its objectives, process, types of training programmes, induction on the job and off the job training, identification of training programmes, evaluation of training programmes.

MODULE-IV : Performance Appraisal :

Performance appraisal and potential appraisal, traditional and modern techniques of PA, Incentives and employee benefits.

MODULE-V : Industrial Relation :

Concept, values, scope, industrial disputes, concepts, forms, and types causes, procedure for settlement of dispute in india. Workers participation in management.

REFERENCE BOOKS :

1. Aswathappa., JMH.2. V.S.P. Rao, Excel Books.

IT-41L: ADVANCED JAVA LAB.

Session 1: Database Connectivity and XML

Exercise 1: write java program to insert data into student table.Exercise 2: Design a student registration form using swing, receive input data from all fields and insert them into student table.Exercise 3: Design a XML file and present all records data of XML using XSL.Exercise 4: Using DSO display the name of author of a book whose book title entered by user.

Session 2: Servlet and JSP programming

Exercise 1: write servlet program to print LCF and GCD of 2 input numbers.Exercise 2: Design a Login page using html, check whether ID/password is valid as per login table or not using servlet .Exercise 3: Using JSP display html table row background with alternate color.Exercise 4: write JSP to extract all records of book table and display them in HTML table.Exercise 5: Write a servlet/jsp program to add different items in shopping cart from different item stores.Exercise 6: Servlet and JSP with database connectivity

Session 3: JavaBean, Xml DOM

Exercise 1: write jsp to append new record in student xml file using DOM parser.Exercise 2: Design a student-delete-form in html, using jsp and DOM, delete a record from xml file matched on student rollno.Exercise 3: Write jsp with javabean to update student data.Exercise 4: Create a button component of your own and interact with Jelly Bean in BDK.Exercise 5: Write a program in jsp to print all records of XML database using DOM.

Session 4: JSP Struts

Exercise 1: Deploy successfully your struts based web-application.Exercise 2: Write a FormBean class to validate user input.Exercise 3: Write Action class to validate ID and password of user with Login Table.Exercise 4: Session Management in struts based application.

Session 5: JSF

Exercise 1: Print message “Hello World” in JSF based web-application.Exercise 2: Write to validate user input.Exercise 3: Write managed-bean class to accept the inputs from user and display them in result.jsp page.Exercise 4: Create a property file and use this to display error message.

IT-42L: C#.NET Programming LAB.

1) Introduction:-Language features of c#.Net, .Net architecture and .Net Framework CLR, MSIL, JITers, FCL, CLS, CTS, The .Net Framework, C# compared to C++, Visual Studio IDE.

2) Programming Constructs in C#.Net:-Basic data types, variables, constants and or symbols, Naming convention for variables, operators, flow control and conditions, loops, array,

3) OOP in C#:-Concept of class and object, Constructor, Method, Instantiating class, Access Modifier, Encapsulation, Programs basing on oops concept in C#.

4) Inheritance and Polymorphism:-Inheritance in c#, implementing inheritance in c#, constructors call in inheritance, protected access modifier, sealed keyword, polymorphism, using reference of base type for referencing the object of the child type, is and as keyword, boxing and un-boxing, abstract class and interface.

5) Structures and Enumeration and Garbage Collection:Structure and defining struct, instantiating struct, enumeration and use of enum.

6) Exception Handling:Basic of exception and need for it, handling exception using try…catch..finally block, exception class message and stack trace properties, catching multiple exception and custom exception.

7) Window Application:Window Form basic, building “Hello WinForm”, understanding use of different component using IDE, adding event handling.

8) Data Access Using ADO.Net:-Introduction to ADO,Net and different components of ADO.Net, review of basic SQL queries, defining connection string, commands.

9) Multithreading:-Multithreading in C#, thread functionality, thread demonstration example, using to Join() to wait for running threads, thread synchronization, c# locking mechanism.

10) File System & Stream:-

Working with file system, environment information, obtaining path of windows standard folder, manipulating file using System.

Semester-5

IT-511 DATA MINING AND WARE HOUSING

UNIT - I

What is Data Mining ? Data Mining - On what kind of Data ? Data Mining Functionalities. Major issues of Data Mining.

What is a Data Warehouse ? A Multidimensional Data Model. Data -Warehouse Architecture. Data Warehouse implementation. Data cube technology. Data warehousing to Data mining.

UNIT - II : Data Processing :

Data Cleaning Data integration and transformation, Data reduction, Discretization and concept Hierarchy generation.

Data Mining primitives, languages, and System architectures.

Data Mining Primitives, A Data Mining Query Language, Designing GUI based on a Data Mining Query Language, Architecture of Data Mining Systems.

UNIT - III : Characterization and Comparison :

What is Concept Description ? Data generalization and summarization- Based Characterization/Analytical Characterization, Mining class comparisons, Mining Descriptive Statistical Measure in Large Databases.

Mining Association Rules in Large Databases:

Association Rule Mining, Mining Single Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel Association Rules from transaction databases, Mining Multidimensional association rules from

Relational Databases and Data warehouses from association mining to correlation analysis, constraint based association mining.

UNIT - IV : Classification and Predictions :

Concept of classification and prediction, classification by delicious tree induction, Bayesian classification, classification by back propagation, classification based on analyst from association rule mining/other classification methods (K-Nearest Neighbour classifiers, case based reasoning, Genetic algorithm, Rough set approach, Fuzzy set approaches), Prediction, classifier accuracy.

Cluster Analysis

What is cluster analysis ? Types of data in cluster analysis, categorization of major clustering methods, Hierarchical methods, Density based methods, Grid based methods, Mddel%based methods, Outer analysis.

UNIT - V : Mining Complex Types of Data :

Multidimensional analysis and descriptive mining of complex, data objects, Mining spatial Databases, Mining Multimedia databases, Mining Time-Series and sequence data, Mining text Databases, Mining the WWW.

Application and Trends in Data Mining:

Data Mining Applications, Data Mining System products and Researuls prototypes, Social impacts of Data Mining, Trends in Data Mining.

BOOKS:

1. Data Mining : Concepts and Techniques, J. Han and M. Kamber, Morgon Kaufmann Publishers, Elrevis India (2001).

2. Principles of Data Mining : D. Hand, H. Mannia &P. Symth, MIT Press, 2001,3. Recent Literatures from ACM SIGMOD, VLDB, IEEE Trans, Knowledge and Data Engg,

Knowledge Discovering, ACM SIGKOD, IEE ICDM, SIAM, Data Mining, ICML

IT-52 : PARALLEL PROCESSING

UNIT - I : Introduction & Parallel Computer Architecture

What is parallel computing ? The scope of parallel computing, issues in parallel computing.

A taxonomy of parallel architectures, controJ mechanism, Address-space organization, Interconnection Networks, processors Granularity. SIMD Architecture : Overview of SIMD Architecture, Design and Performance Issues.

MIMD Architecture : Scared memory architecture, Uniform and Non-uniform memory access multi processors,-parallel vector processors (PVP), Symmetric multiple processors (SMP), CC-NUMA, NUMA and ,CpMA architectures.

Distributed Memory Architecture :

Cluster Architecture-Design and other issues, MPP Architecture.

UNIT - II : Interconnection Networks :

Basics of Interconnection Network : Interconnection Environments, Networks components,, Network characteristics, Network performance metrics.

Network Topologies and properties : Topologies and functional properties, Routing schemes and functions, Networking topologies.

Buses, Crossbar and Multistage Swjtches : Multiprocessor Buses, Crossbar 'switches, multistage interconnection networks, and composition of switched networks.

Gigabit Network Technologies : Fiber channel and FDDI Rings, fast Ethernet and Gigabit Ethernet and Gigabit Ethernet, Myrinetfor SAN/LAN construction.

UNIT - III : Parallel programming :

Paradigms and Programmability : Algorithmic paradigms,, programmability issues, and parallel programming examples,

Parallel Programming Models : Implicit parallelism, Explicit parallel models, other parallel programming models.

Shared Memory Programming: The POSIX Threads (P Threads) Model, the open MP standard.

Message Passing Programming : The Message passing paradigm, Message passing interface (MPI), Parallel virtual machine (PVM).

Data Parallel Programming: The data parallel model, the FORTRAN 90 approach, other data parallel approach.

UNIT - IV : Performance Metrics and Benchmarks :

Performance Metrics and for Parallel Systems : Runtime, Speedup, Efficiency cost.

Scalability and Speedup Analysis : Amdahl's Law : Fixed problem size, Gustafron's Law : fixed time, sum and Ni's Law : Memory branding, Isoperformance models.

Sources of Parallel Overheads : Interprocessor communication (IPC), Load imbalance extra computation.

System and Application Benchmarks : Micro Benchmarks, Parallel computing benchmarks, Business and TPC Benchmarks, SPEC Benchmarks family.

UNIT- V : Parallel Algorithms and Applications :

Sorting Algorithms, Searching Algorithms, Dynamic Programming, Matrix multiplication, dense matrix computations, sparse matrix computations.

BOOKS :

1. Scalable Parallel Computing, Kai Hawang and Zhiwei Xu (Me Graw Hill).

2. Computer Architecture and Parallel Processing, Kai Hwang and Faye A. Briggs (Me Graw Hill).

3. Parallel Programming, Barry Wilkinson and Michel Allen (Pearson Education).

4. Introduction to Parallel Computing, Design and Analysis of Algorithms, Vipin Kumar, Ananth Grama,Anshul Gupta, George Karyp's (Redwood City, CA, Benmann/Cummings).

SUPPLEMENTARY BOOKS :

1. PVM : Parallel Virtual Machine - A user's guide and tutorial for Networked parallel Computihg, Al Geist,Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Mancheck and Vaidy Sunderam (MIT Press).

2. Designing Efficient Algorithm for Parallel Computers, M. J. Quinm (Mc Graw Hill).3. Parallel Programming in Open MP, Rohit Chandra, Ramesh Menon, Leo Dagum, David

Khhz, Dror Maydon, and Jeff Mc Donald (Morgan Kaufmann).

IT-53: OPEN SOURCE PROGRAMMING

UNIT-I:

Introduction to Open Source Programming and PHP

Introduction to Apache, MySql, PHP and open source – how AMP works – Installing Apache, MySql and PHP on Windows – Using HTML in PHP – variables, operations, constants, control structure, arrays, functions, classes, handling files, form handling, form validation, linking forms together.

UNIT-II:

Database Programming

Overview of MySql – using PHP with MySql – MySql database programming – connecting – table creation – record insertion – updation – multiple database handling – Querying the database – using tables to display data, PHP – manipulation and creating images with PHP.

UNIT-III:

Mails, Session & Cookies

E-mailing with PHP – sending an e-mail – multipart message – sorting images – getting confirmation – user logins, profiles and personalization.

Session tracking using PHP – graphics input validators, Cookies.

UNIT-IV:

PERL

Introduction to Perl – scalars and scalars and scalar variables – numbers and strings – operators – control statements – lists and arrays – working with hashes – using Perl with CGI scripting – managing files and directories.

UNIT-V:

PYTHON

Introduction to python – data types, numbers, variables and simple input output – control statements – string & tuples – lists & directories – functions – files & exceptions – classes.

T€XT BOOKS :

PHP Professional Projects, Ashish Wilfred Metta Gupta and Karticj Bhatnagar-Prentice Hall and India Pvt. Ltd., New Delhi, 2002.

REFERENCE BOOKS :

1. Beginning PHP, Apache, Mysql Web Development Micheal K. Class, Rommnel Sc^urarnec, WileyDream Tech Publishing Incf, New Delhi 2004.

2. Core PHP Programming, Leon Alkinson and Zeev Suraski, Pearson Education, Delhi, 3rd Ed., 2004.

3. Teach Yourself Perl, Clinton Pierce, Techmedia, New Delhi, 2004.

4. Tom Christiansen and Nathan Torkington, Perl Cookbook, Shroff Pub., 1009.5. Python Programming for the Absolute Beginner by Michael Dawson Premier Press ©2003

IT-54 : DIGITAL IMAGE PROCESSING(ELECTIVE III)

UNIT - 1 : Introduction to Digital Image Processing, Image Sensing and Representation.

• What is Digital Image Processing? Fundamental steps in Digital Image Processing. Components of an Image Processing System.

• Elements of Visual Perception, Image Sensing and Acquisition:

o Fundamentals of CCD camera.o Fundamentals of Scanner.

• Image Sampling and Quantisation :

o Basic Concepts of Sampling and Qunatisation,

Representing Digital Images, Spatial ami Gray-level

Aliasing and Moire Patterns, Zooming and Shrinking Digital Images.

• Some basic relationships between pixels:

o Neighborhood, Adjacency, Connectivity, Boundaries, Distance Measures, Image operations on pixel basis,

UNIT-II:

Image Enhancement:

A. In the Spatial Domain :

• Basic Gray Level Transformations :

i) Image negatives, Log Transformations, Power-low Transformation, Piecewise Linear Transformation functions.

• Histogram Processing :

i) Histogram "Equalization, histogram matching, use of Histogram statistics for Image enhancement.

• Spatial Filtering :

i) Smoothing Linear filters, order-statistics filters.

• Sharpening spatial filters :

i) The Gradient, The Laplacian

B. In the Frequency Domain

• Introduction to the Fourier Transform and thefrequency domain :

i) The one-dimensional Fourier transform and its inverse, the two-dimensional OFT and its inverse, filtering in the frequency domain, correspondence between filtering in the spatial and frequency domain.

• Smoothing frequency-domain filters :

i) Ideal Lowpass filters, Butterworth lowpass filters, Gaussian lowpass filters.

• Sharpening frequency domain filters :

i) Ideal hiphpass filters, Butterworth highpass filters, Gaussian Highpass filters.

• Homomorphicfiltering.

UNIT - II : Image Restoration :

• A model of the Image Degradation/restoration process

• Noise models :

o Spatial and frequency properties of Noise, Noise probability functions, periodic noise, estimation of Noise parameters.

• Restoration in the Presence of Noise only – special filtering

o Mean filters, order-statics filters and adoptive filters.

• Periodic Noise reduction by frequency domain filtering

o Bandreject filters, Bandpass filters, notch filters.

• Minimum Mean-square error restoration (Wiener filtering, Constrained least square filtering, Geometric transformations)

• Binary Image analysis :

o Thresholding,, Morphological processing.o Dilation, erosion, opening and closing, hit-or-miss transformation,

Skeletonisation.

UNIT-IV : Color image processing :

• Color models :

o The RGB color model, the CM4 and CM4K color models, the HSI color model.

• Color transformations :

o Formulation, color complements, color slicing, tone and color corrections, Histogram processing.

• Smoothing and sharpening :

• Color segmentation :o Segmentation in HSI color space, segmentation in RGB vector space, color

edge detection.

• Wavelets and multi resolution processing :

o Multi resolution expansions, wavelet transforms in one dimension, the fast wavelet transform.

o Wavelet transforms in two dimensions, wavelet packets.

UNIT-V : Image compression :

• Fundamentals :

o Coding redundancy, interpixel redundancy, psycho-visual redundancy, fidelity criteria.

• Image compression models :

o Source encoder the decoder a Channel encoder and decoder

• Elements of information theory :

o Measuring information,. the information cftannfel, fundamental coding theorems, using info theory.

• Error-free compression :

o Variable - length coding, LZW coding, Bit-plane coding, lossless predictive coding.

• Lossy compression :

o Lossy predictive coding, transform coding, wavelet coding.• Video compression standards :

o JPEG; MPEG, etc.

• Digital images being used irt common computer- based applications like medical image processing,remote sensing, document image processing, etc.

BOOKS:

1. Digital Image Processing (2/e), R.C. Gonzalez and R.E. Woods (Pearson Edu [lpe]/PHI)2. Digital Image Processing and Analysis, B. Chanda and D. Dutta Majumdar (PHI),

REFERENCES :

1. Fundamentals of Digital Image Processing, Anil K. Jain (PHI).

IT-54 : SYSTEM MODELLING & SIMULATION (ELECTIVE-III)

UNIT - I : Physical Modeling :

Concept of system and environment, continuous and discrete system, linear and non-linear system, stochastic activities, static and dynamic models, principles used in modeling, Basic simulation modeling, Role of simulation in model evaluation and studies, Advantages and Disadvantages of simulation, Modeling of systems, Iconic, Analog and Mathematical Modeling.

UNIT-II : Computer Based System Simulation :

Technique of simulation, Monte Carlo method, experimental nature of simulation, numerical computation techniques, calumnious system models, analog and hybrid simulation, feedback systems, Buildings simulation models of waiting line system, Job shop material handling and flexible manufacturing system.

UNIT-III : Probability Concepts in Simulation :

Stochastic variables, discrete and continuous probability functions, random numbers, generation of random numbers, variance reduction techniques, Determination of the length of simulation runs, Output analysis.

UNIT-IV : System Dynamics Modeling :

Identification of problem situation, preparation of causal loop diagrams and flow diagrams, equation writing, level and rate relationship, Simulation of system dynamics model.

UNIT-V : Verification and Validation :

Design of simulation experiments, validation of experimental models, testing and analysis, Simulation languages comparison and selection, study of SIMULA, DYNAMO, STELLA, POWERISM, simulation software.

Suggested Reading :

• System Simulation, Gorden G., Prentice Hall.

• Introduction to System Simulation, Payer T, McGraw Hill.

• Computer Aided Modeling and Simulation, Spuet, W.I.A.

• System Dynamics, Sushil, Wiley Eastern Ltd.

• System Simulation, Shannon R.E., Prentice Hall.

• Simulation and Modeling, Allan Carrie, McGraw Hill.

IT-55 : WEB DESIGNING & MULTIMEDIA (ELECTIVE-IV)

UNIT-I: Introduction :

Definition : CD-ROM and multimedia.

Multimedia Applications : Business - schooiS- Homes-public places and virtual reality. Introduction to makingof multimedia : hardware - software - creativity – and organization.

UNIT-II : Multimedia Tools :

Macintosh and windows production platforms - 3-d modeling and animation - image-editing tools -sound editing tools - animation - video - and digital movie tools -linking multimedia objects - office suites - word processors -spread sheets - databases - presentation tools. Authoring tools - Card and Page-based authoring-tools -Icon Based authoring tools - time based authoring tools

- object oriented authoring tools - cross platform - authoring tools.

UNIT-III : Multimedia Building Blocks :

Text : About fonts and faces - text in mufti media -computers and text Font editing and design tools -Hypermedia and Hypertext.

Sound : Multimedia system sounds - MIDI versus digital audio - digital audio - making MIDI audio - audio file format - working with sounds in windows - working with sounds on the Macintosh - NIFF - Adding sounds to multimedia - Towards professional sounds - production

Images : Making still images - Colors - Image file format, Animation : Principals of animation - Making animation that works, Video : How video works Broadcast video standards - Integrating computers and

television - Shooting and Editing - Video tips - Recording formats - Digital video.

UNIT-IV : Multimedia and the Internet:

Internet fundamentals : Internetworking -Connections - Internet services - The World Wide Web -Tools for the World Wide Web : Web serves - Web browsers - Web page markers and Site builders - Plug-ins and Delivery vehicles - Beyond HTML.

UNIT-V : Designing for the World Wide Web :

Working on web - Text for web - Images for web -Sound for web - Animation for web.

TEXT BOOKS :

Mutimedia : Making it Work, Tay Vaughan.

REFERENCE BOOKS :

1. Multimedia System Design, K. Andieigh and K. Thakkrar.2. Multimedia : Computing, Communication & Application, Ralf Stein Metz

IT-55 : CRYPTOGRAPHY & NETWORK SECURITY ( ELECTIVE-IV)

UNIT- I : Introduction :

OSI Security Architecture - Classical Encryption techniques - Cipher Principles - Data Encryption Standard

- Block Cipher Design Principles and Modes of Operation- Evaluation criteria for AES - AES Cipher - Triple DES - Placement of Encryption Function – Traffic Confidentiality.

UNIT-II :Public key Cryptography:

Key Management – Diffie – Hellman key Exchange- Elliptic Curve Architecture and Cryptography- Introduction to Number Theory- Confidentiality using Symmetric Encryption – Public Key Cryptography and RSA.

UNIT-III: Authentication and Hash Function:

Authentication requirements – Authentication functions – message Authentication Codes – Hash Functions- Security of Hash Functions and MACs- MDS message Digest algorithm- secure Hash Algorithm- RIPEMD- HMAC Digital Signatures- Authentication Protocols- Digital Signature Standard.

UNIT-IV: Network Security:

Authentication Applications: Kerberos- X.509. Authentication Service- Electronic Mail Security – POP- S/MIME- IP Security- Web Security.

UNIT-V : System Level Security:

Intrusion Detection- password management. Viruses and related threats- virus counter measures- Firewall Design Principles- Trusted Systems.

TEXT BOOK:

1. Cryptography and Network Security- Principles and Practices, William Stallings, Prentice Hall of India Third Edition, 2003.

REFERENCES:

1. Cryptography and Network Security, Atul Kahale, Tata McGraw-Hill, 2003.2. Applied Cryptography, Bruce Schneier, John Wiley & Sons Inc., 2001.3. Security in Computing, Charles B. Pfleeger, Shari Lawrence Pfleeger, Third Edition

Pearson Edition, 2003.

IT-51L: OPEN SOURCE LAB.

SERVER PROGRAMMING:

Introduction to APACHE SERVER.

Overview of PHP, Programming Structure, Data Types, Operators, Statements, Array & Functions, using Files, Sessions, Cookies.

Introduction to PERL, Common Gateway interface concept, PERL Basics, Basic Arithmetic operations, PERL functions, Array, File handling, Database Connectivity.

Introduction to Python, Modules and Libraries, Classes and Objects. Testing, Debugging, and Software Development Practic, Iterators and Generators, Working with Text, Binary Data Handling, Working with Processes

DATABASE PROGRAMMING :

Introduction to RDBMS, Introduction to MySQL, Database Creation, Database manipufation, Record Manipulation, PHP with MySQL.

IT-52L: WEB DESIGNING LAB.

Introduction to HTML, Basic tags arid Attributes, Lists, Graphics, Tables, links, Frames, Form. DHTML.

Java Script: Introduction to Java Scripts, Objects in Java Script, Dynamic HTML with Java Script

Graphic Tools: Image Editing Software (Photoshop )

Basic Concepts: An Introduction, creating, Opening and saving files, Menus, Toolbox, Color

control icons, Mode control icons, Window controls icons; creating new images, Image

capture (TWAIN) from scanner other files;

Image Handling: Cropping an image, adjusting image size, and increasing the size of the work

canvas, saving an image;

Layers: Adding layers, dragging and pasting selections on to layers, dragging layers between

files, viewing and hiding layers, Editing layers, rotating selections, scaling an object, preserving

layers transparency, moving and copying layers, duplicating layers, deleting layers, merging

layers, using adjustment layers.

Macro Media Flash: An Introduction, creating, Opening and saving files, Menus, Toolbox,

Color control icons, Flash Buttons, Advanced Buttons,Flash tweening.Designing Flash movies.