M.KUMARASAMY COLLEGE OF ENGINEERING, KARUR

(AUTONOMOUS)

REGULATIONS 2012

B.TECH. INFORMATION TECHNOLOGY

CURRICULUM FROM III TO VI SEMESTERS

(Applicable to the students admitted from the Academic year 2012-2013 onwards)

SEMESTER III

Maximum Marks

Code No. Course Title L T P C

CIA ESE Total

THEORY

UMA12302 Numerical Methods 3 1 0 4 50 50 100

Digital Principles and System

UEC12311 Design 3 1 0 4 50 50 100

UIT12301 Data Structures 3 1 0 4 50 50 100

UIT12302 Object Oriented Programming 3 0 0 3 50 50 100

UIT12303 Computer Architecture 3 0 0 3 50 50 100

UIT12304 Design and Analysis of

3 0 0 3 50 50 100

Algorithms

PRACTICAL

UEC12312P Digital Laboratory 0 0 3 2 50 50 100

UIT12305P Data Structures Laboratory 0 0 3 2 50 50 100

UIT12306P C ++ Programming Laboratory 0 0 3 2 50 50 100

UTP12301P Career Skill Development -I 0 0 1 1 100 0 100

TOTAL 18 3 13 28 1000

SEMESTER IV

Maximum Marks

Code No. Course Title L T P C

CIA ESE Total

THEORY

UMA12401 Probability and Queuing Theory 3 1 0 4 50 50 100

Microprocessors and

UEC12414 Microcontrollers 3 1 0 4 50 50 100

Analog and Digital

UEC12411 Communication 3 0 0 3 50 50 100

UIT12401 Software Engineering 3 0 0 3 50 50 100

UIT12402 Database Management Systems 3 0 0 3 50 50 100

UIT12403 Operating Systems 3 0 0 3 50 50 100

PRACTICAL

Microprocessors and

UEC12415P Microcontrollers Laboratory 0 0 3 2 50 50 100

Database Management Systems

UIT12404P Laboratory 0 0 3 2 50 50 100

UIT12405P Operating Systems Laboratory 0 0 3 2 50 50 100

UTP12401P Career Skill Development -II 0 0 1 1 100 0 100

TOTAL 18 2 10 27 1000

SEMESTER V

Maximum Marks

Code No. Course Title L T P C

CIA ESE Total

THEORY

UIT12501 Java Programming 3 0 0 3 50 50 100

UIT12502 Open Source Software 3 1 0 4 50 50 100

UIT12503 Computer Networks 3 0 0 3 50 50 100

UIT12504 Object Oriented Analysis and

3 0

0 3

50 50 100

Design

UIT12505 Enterprise Computing 3 1 0 4 50 50 100

UEC12511 Digital Signal Processing 3 0 0 3 50 50 100

PRACTICAL

UIT12506P Java Programming

0 0

3 2

50 50 100

Laboratory

UIT12507P CASE Tools Laboratory 0 0 3 2 50 50 100

UEC12512P Digital Signal Processing

0 0

3 2

50 50 100

Laboratory

UTP12501P Career Skill Development –III 0 0 1 1 50 50 100

UIT12508P Mini Project 0 0 3 2 50 50 100

TOTAL 18 2 13 29 1100

SEMESTER VI

Maximum Marks

Code No. Course Title L T P C

CIA ESE Total

THEORY

UMA12601 Discrete Mathematics 3 1 0 4 50 50 100

UIT12601 Web Technology 3 1 0 4 50 50 100

UIT12602 Principles of Compiler Design 3 1 0 4 50 50 100

UIT12603 Data Warehousing and Data

3 0 0 3

50 50 100

mining

UIT12604 Mobile Computing 3 0 0 3 50 50 100

E1 Elective – I 3 0 0 3 50 50 100

PRACTICAL

UIT12606P FOSS Laboratory 0 0 3 2 50 50 100

UIT12607P Web Technology Laboratory 0 0 3 2 50 50 100

UIT12608P Compiler Design Laboratory 0 0 3 2 50 50 100

UTP12601P Career Skill Development -IV 0 0 1 1 50 50 100

TOTAL 18 3 10 28 1000

LIST OF ELECTIVES FOR B.TECH INFORMATION TECHNOLOGY

SEMESTER VI

Code No. Course Title L T P C

UIT12651 Artificial Intelligence 3 0 0 3

UIT12652 C# and .Net Framework 3 0 0 3

UIT12653 Cyber Forensics 3 0 0 3

UIT12656 Pervasive Computing 3 0 0 3

UIT12657 Unix Internals 3 0 0 3

UBA12651 E-Commerce 3 0 0 3

UBA12652 Intellectual Property Rights 3 0 0 3

UBA12653 Total Quality Management 3 0 0 3

SEMESTER-III

UMA12302 NUMERICAL METHODS L T P C

(Common to CSE & IT) 3 1 0 4 AIM: To facilitate the understanding of the principles and to cultivate the art of formulating physical

problems in the language of mathematics. OBJECTIVES: At the end of the course, the students would be acquainted with the basic concepts in numerical

methods and their uses are summarized as follows: The roots of nonlinear (algebraic or transcendental) equations, solutions of large system of linear

equations and eigen value problem of a matrix can be obtained numerically where analytical

methods fail to give solution. When huge amounts of experimental data are involved, the methods discussed on interpolation will be useful in constructing approximate polynomial to represent the data and to find the

intermediate values. The numerical differentiation and integration find application when the function in the analytical

form is too complicated or the huge amounts of data are given such as series of measurements,

observations or some other empirical information. Since many physical laws are couched in terms of rate of change of one/two or more independent

variables, most of the engineering problems are characterized in the form of either nonlinear

ordinary differential equations or partial differential equations. The methods introduced in the

solution of ordinary differential equations and partial differential equations will be useful in

attempting any engineering problem.

UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9+3 Introduction – Direct method – Gauss Elimination Method - Gauss Jordan elimination method-Solution

of simultaneous equations – Method of triangular decomposition or factorization – crouts reduction

method - Iterative methods: Gauss Jacobi and Gauss- Seidel methods

UNIT II INTERPOLATION AND APPROXIMATION 9+ 3 Gregary Newton Forward interpolation - Backward interpolation – striling interpolation - Lagrangian

Interpolation – Hermites Interpolation - Interpolating with a cubic spline –

UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION 9+ 3 Derivatives based on Newton‟s forward and backward interpolation – Partial derivatives based on Finite

differences - Numerical integration by Newton Cote‟s Quadrature formulae - Romberg‟s method – Lobatto Integration method – Double integrals using trapezoidal and Simpson‟s rules.

UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS 9+ 3 Single step methods: Taylor series method – Euler and modified Euler methods – Fourth order Runge – Kutta method for solving first and second order equations – Multistep methods: Milne‟s and Adam‟s

predictor and corrector methods.

UNIT V BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL DIFFERENTIAL

EQUATIONS 9+ 3

Finite difference solution of second order ordinary differential equation – Finite difference solution of one

dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two

dimensional Laplace and Poisson equations.

TOTAL: 60 TEXT BOOKS:

1. Veerajan T., Ramachnadran T., ―Numerical Methods‖, Tata McGraw-Hill Education Pvt. Ltd., New

Delhi, 2009.

2. Steven C Chapra, Raymond P Canale, ―Numerical Methods for Engineers‖, Fifth Edition, Tata

McGraw-Hill Education Pvt. Ltd., New Delhi, 2007. 3. Sankar Rao, ―Numerical Methods for Scientists and Engineers‖, Second Edition, PHILearning,

New Delhi, 2004 REFERENCE BOOKS:

1.Kandasamy, P., Thilagavathy, K. and Gunavathy, K., ―Numerical Methods‖, S.Chand Co. Ltd.,

New Delhi, 2003. 2. Burden, R.L and Faires, T.D., ―Numerical Analysis‖, Seventh Edition, Thomson Asia Pvt. Ltd.,

Singapore, 2002.

UEC12311 DIGITAL PRINCIPLES AND SYSTEM DESIGN L T P C

(Common to CSE & IT) 3 1 0 4

AIM: To provide an understanding of the fundamentals of digital logic and digital circuit design OBJECTIVES:

To understand Boolean algebra, Boolean functions and realization of functions with basic gates.

To design combinational and sequential circuits. To design circuits with MSI devices. To learn the use of HDL for designing larger systems.

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 9 Number Systems: Binary, Octal, Decimal, Hexadecimal Number systems – complements – Binary

Arithmetic- Binary codes: Weighted – BCD - 2421 - Gray code-Excess-3 code – ASCII – EBCDIC.

Boolean algebra: Boolean postulates and laws –De-Morgan‟s Theorem- Principle of Duality-Boolean

expression – Minimization of Boolean expressions– Sum of Products (SOP), Product of Sums (POS)

and its Conversion– Minimization: Karnaugh map, Tabulation Method-Don‟t care conditions. Logic

Gates- Implementations of Logic Functions using gates, NAND –NOR implementations.

UNIT II COMBINATIONAL LOGIC 9 Design procedure of Combinational circuits: Adders - Subtractors – Parallel adder/ Subtractor- Carry

look ahead adder- BCD adder- 2- bit Magnitude Comparator- Multiplexer / Demultiplexer- Encoder /

Decoder – Parity Generator/Checker – Code converters: Binary to Gray – Gray to Binary - BCD to

Excess 3 – Excess 3 to BCD -Implementation of combinational logic using decoders and multiplexers.

UNIT III SYNCHRONOUS SEQUENTIAL LOGIC 9 Flip flops SR, JK, T, D and Master slave – Characteristic and excitation tables and equations –Level and

Edge Triggering –Realization of one flip flop using other flip flops – counters - Ring counters and

Sequence detector - Design of Synchronous counters - Registers – shift registers- Universal shift register

- Analysis and design of sequential circuits with state diagram, State table, State minimization and State

assignment.

UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC 9 Design of fundamental mode – primitive state / flow table – Minimization of primitive state table – state

assignment – Excitation table - cycles – Races –Hazards: Static, Dynamic and Essential – Hazards

elimination – Introduction to Hardware Description Language (HDL) – HDL for Flip Flops – Shift

Registers – Counters.

UNIT V MEMORY AND PROGRAMMABLE LOGIC DEVICES 9 Classification of memories – ROM Organization: PROM, EPROM, EEPROM – RAM Organization: Static

RAM, Dynamic RAM - Programmable Logic Array (PLA) - Programmable Array Logic (PAL) – Field

Programmable Gate Arrays (FPGA) - Implementation of combinational logic circuits using PROM, PLA,

PAL

TOTAL : 45 TEXT BOOKS:

1. Morris Mano, M, ―Digital Design‖, Third Edition, Prentice Hall of India, New Delhi, 2003. 2. Roth, Charles H., ―Fundamentals of Logic Design‖, Thomson Publication Company, New Delhi,

2003.

REFERENCE BOOKS:

1. Yarbrough, John M., ―Digital Logic Applications and Design‖, Thomson Publications, New

Delhi, 2007. 2. Leach, Donald P. and Malvino, Albert Paul., ―Digital Principles And Applications‖, Fifth Edition,

Tata McGraw-Hill, New Delhi, 2003.

3. Givone, Donald D., ―Digital Principles and Design‖, Tata McGraw-Hill, New Delhi, 2003.

UIT12301/UCS12301 DATA STRUCTURES L T P C

(Common to CSE & IT) 3 1 0 4

AIM: To provide an in-depth knowledge in problem solving techniques and data structures. OBJECTIVES:

To learn the systematic way of solving problems To understand the different methods of organizing large amounts of data

To learn to program in C To efficiently implement the different data structures To efficiently implement solutions for specific problems

UNIT I LINEAR DATA STRUCTURES 9 Introduction to Algorithms – ADT – Analysis of algorithm – Space and Time Complexities. List: List ADT – Arraybased implementation – Linked list implementation – Cursor- based linked lists – Doubly-linked lists – Applications of lists. Stacks: Stack ADT– Array Representation and Implementation of stack – Operations on Stacks – Array Representation of Stack – Linked Representation of Stack – Application of stack. Queues: Array and linked representation and implementation of queues – Operations on Queue –

Applications of Queue.

UNIT II TREE STRUCTURES 9

Basic Terminologies – Binary Tree – The Search Tree ADT – Binary Search Trees- AVL Tree – B-trees

– Splay Tree - Tree Traversal – Applications of Trees.

UNIT III HASHING AND PRIORITY QUEUE 9

Introduction to Hashing – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing – Introduction to Priority Queue – Implementation of Priority Queue – Binary Heap –

Applications – d-Heaps – Leftist heaps – Skew Heaps – Binomial Queues.

UNIT IV GRAPH 9

Introduction – Topological sort – Shortest path algorithms – Unweighted Shortest Paths – Dijkstra‟s Algorithm – Network flow problems – Minimum Spanning Tree (Prim‟s & Kruskal‟s Algorithm) –

Applications of Depth First search – Introduction to NP – completeness- Applications of

Graph.

UNIT V SORTING TECHNIQUES 9 Introduction – Insertion sort – Selection Sort - Shell sort – Heap sort – Merge sort – Quick sort – Bubble

Sort – Sorting Large Structures – Bucket sort – External sorting– Applications of Sorting.

TOTAL: 45

TEXT BOOKS: 1. Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C‖, Second Edition, Pearson

Education, 1997. REFERENCE BOOKS:

1. A.V.Aho, J. E. Hopcroft, and J. D. Ullman, ―Data Structures and Algorithms‖,Pearson

Education, 1983. 2. R. F. Gilberg, B. A. Forouzan, ―Data Structures‖, Second Edition, Thomson India Edition,

2005.

3. A. M. Tenenbaum, Y. Langsam, and M. J. Augenstein, ―Data Structures using C‖, Pearson

Education, 1998.

UIT12302/UCS12302 OBJECT ORIENTED PROGRAMMING L T P C

(IN C++) 3 0 0 3 (Common to CSE & IT)

AIM: To understand the concepts of object-oriented programming and master OOP using C++. OBJECTIVES:

To identify and practice the object-oriented programming concepts and techniques

To practice the use of C++ classes and class libraries, modify existing C++ classes, develop C++

classes for simple applications To practice the concepts of Object-Oriented Analysis and Design (OOA/OOD) and design patterns

and frameworks by developing a C++ based project.

UNIT I INTRODUCTION 9 Programming paradigms-Basic concepts and benefits of OOP-Structure of C++ program- Tokens-

Keywords-Identifiers-Constants-Datatypes-Functions-Statements-Dynamicinitialization - Reference

Variables-Scope Resolution Operator-Member deferencing operators-memory management operators-

An Overview of C++.

UNIT II CLASSES & OBJECTS 9

Classes & Objects – Arrays-Pointers- References-Dynamic Allocation Operators- Function

Overloading – Copy constructors – Default Arguments

UNIT III INHERITANCE & POLYMORPHISM 9

Operator Overloading – Inheritence – Virtual Functions – Polymorphism.

UNIT IV TEMPLATE & EXCEPTION HANDLING 9

Templates – Exception Handling – Run Time Type ID and the Casting Operators.

UNIT V FILE I/O 9

The C++ I/O System basics – C++ file I/O –Introducing the Standard Template Library.

TOTAL: 45

TEXT BOOKS:

1. Herbert Schildt, ―The Complete reference C++‖, TATA Mc GRAWHILL EDITION, Fourth

Edition (Reprint 2009).

REFERENCE BOOKS:

1. E.Balagurusamy, ―Object Oriented Programming with C++‖, TATA Mc GRAWHILL

EDITION, Third Edition (Reprint 2007). 2. Ira Pohl, ―Object-Oriented Programming using C++‖, 2nd ed., Pearson Education,1997. 3. Bjarne Stroustrap, ―The C++ Programming Language‖, Pearson Education, Third Edition

2007.

UIT12303/UCS12303 COMPUTER ARCHITECTURE L T P C

(Common to CSE & IT) 3 0 0 3 AIM: To understand the basics of digital design, the design of various components of the computer

system and its organization. OBJECTIVES:

To understand the fundamentals of Boolean logic and functions.

To design and realize these functions with basic gates, and other components using

combinational and sequential logic. To understand the design and organization of a von-neumann computer system.

To comprehend the importance of the hardware-software interface.

UNIT I BASIC STRUCTURE OF COMPUTERS 9 Functional Units – Basic Operational Concepts – Bus Structures – Software Performance – Memory

Locations and Addresses – Memory Operations – Instruction set architecture Instruction and Instruction

Sequencing – Addressing Modes – Assembly Language – Basic I/O Operations – Stack and Queue.

UNIT II ARITHMETIC AND BASIC PROCESSING UNIT 9 Addition and Subtraction of Signed Numbers – Multiplication of Positive numbers – Signed operand

Multiplication – Fast Multiplication –Integer Division – Floating-Point Numbers and Operations – Basic

Processing Unit – Fundamental Concepts – Execution of a Complete Instruction – Multiple Bus

Organization – Hardwired Control – Micro programmed Control – Case study (Nano Programming). UNIT III PIPELINING 9

Pipelining – Basic Concepts – Data Hazards –Instruction Hazards – Influence on Instruction Sets – Data Path and Control Consideration –Superscalar Operation – Performance Considerations – Case study Ultra SPARC-II (Pipeline Structure). UNIT IV MEMORY SYSTEM 9

Memory Concepts – Semiconductor RAMs – ROMs – Speed, Size and Cost – Cache Memories –

Performance Considerations – Virtual Memories – Memory Management Requirements – Secondary

Storage device (Optical Disk) – Case study (Blu-ray Disk).

UNIT V I/O ORGANIZATION 9 Accessing I/O Devices – Interrupts – Direct Memory Access – Buses – Interface Circuits – Standard

I/O Interfaces (PCI - SCSI - USB) – Case study (Keyboard and Mouse).

TOTAL: 45

TEXT BOOKS:

1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, ―Computer Organization‖,

Fifth Edition,McGraw-Hill, 2002. REFERENCE BOOKS:

1. William Stallings, ―Computer Organization and Architecture: Designing for Performance‖, Sixth

Edition, Pearson Education, 2003.

2. David A Patterson and John L.Hennessy, ―Computer Organization and Design The hardware

/software interface‖, Second Edition, Morgan Kaufmann, 2002.

3. John P Hayes, ―Computer Architecture and Organization‖, Third Edition, McGraw-Hill, 1998.

UIT12304/UCS12304 DESIGN AND ANALYSIS OF ALGORITHMS L T P C

(Common to CSE & IT) 3 0 0 3 AIM: The aim is to introduce the basics of algorithm design paradigms and analysis

to enable designing of efficient algorithms. OBJECTIVES:

To introduce the basic concepts of algorithm analysis

To introduce the design paradigms for algorithm

design To introduce the basic complexity theory. UNIT I BASIC CONCEPTS OF ALGORITHMS 9 Basic Concepts – Notion of Algorithm – Fundamentals of Algorithmic Solving – Important Problem types

– Fundamentals of Analysis Framework – Asymptotic Notations and Basic Efficiency Classes.

Mathematical Analysis of Non–recursive Algorithm – Mathematical Analysis of Recursive Algorithm. UNIT II ANALYSIS OF SORTING AND SEARCHING ALGORITHMS 9 Brute Force – Sequential Search and Brute – Force String Matching –Divide And Conquer – Merge Sort – Quick Sort – Binary Search – Finding Maximum and Minimum –Depth First Search and Breadth First Search.

UNIT III GREEDY ALGORITHMS 9

Greedy Algorithms: General Method – Container Loading – Knapsack Problem - Prim‟s Algorithm –

Kruskal‟s Algorithm – Dijkstra‟s Algorithm- Huffman trees

UNIT IV DYNAMIC PROGRAMMING 9 Dynamic Programming: General Method – Multistage Graphs – All-Pair shortest paths – Optimal binary

search trees – 0/1 Knapsack – Travelling salesperson problem . UNIT V BACKTRACKING 9 Backtracking: General Method – 8 Queens problem – sum of subsets – graph coloring – Hamiltonian

problem – Knapsack problem-Branch and Bound –Assignment Problem .

TOTAL: 45 TEXT BOOKS: 1.Anany Levitin, ―Introduction to the Design and Analysis of Algorithm‖, Pearson Education, 2009.(For

Units I and II) 2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++, Second

Edition, Universities Press, 2007. (For Units III to V)

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.T.H. Cormen C.E. Leiserson, R.L. Rivest and C. Stein, ―Introduction to Algorithms‖, Second Edition,

PHI, 2007.

4.Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C‖, Second Edition, Pearson

Education, 1997.

UEC12312P DIGITAL LABORATORY L T P C

(Common to CSE & IT) 0 0 3 2 AIM: The aim of this laboratory is to provide a background in digital electronics and to give an understanding

of the fundamentals of computer hardware. OBJECTIVES: To understand the main building blocks of digital circuits.

To understand the components of Microprocessor systems, in particular

microcontrollers. To understand the practical aspects of digital electronics.

1. Verification of Boolean theorems using digital logic gates. 2. Design and implementation of combinational circuits using basic gates and universal gates. 3. Design and implementation of code converters. 4. Design and implementation of 4-bit binary adder / subtractor using basic gates and MSI devices. 5. Design and implementation of parity generator / checker using basic gates and MSI devices. 6. Design and implementation of magnitude comparator. 7. Design and implementation of Multiplexers/ Demultiplexers.

8. Verification of operation of flip-flops. 9. Design and implementation of Shift registers in SISO, SIPO, PISO, PIPO modes using suitable IC‟s.

10. Design and implementation of Synchronous counters/ Asynchronous counters.

11. Simulation Of Combinational Circuits- Multiplexer and Demultiplexers using Hardware 12. Description Language (HDL) (VHDL/ Verilog HDL Software Required) 13. Simulation Of Sequential Circuits- Flip-flops using Hardware Description Language(HDL) 14. (VHDL/ Verilog HDL Software Required)

UIT12305P/ UCS12305P DATA STRUCTURES LABORATORY L T P C

(Common to CSE & IT) 0 0 3 2

AIM: To teach the principles of good programming practice and to give a practical training in

writing efficient programs in C OBJECTIVES: • To teach the students to write programs in C • To implement the various data structures as Abstract Data Types • To write programs to solve problems using the ADTs 1. Array Implementation of List ADT 2. Linked List Implementation of List ADT 3. Implementations of Stack ADT 4. Balanced Paranthesis 5. Evaluating Postfix Expressions‟ Queue ADT 6. Search Tree ADT – Binary Search Tree 7. Tree Traversal 8. Heap Sort 9. Quick Sort

UIT12306P /UCS12306P C++ PROGRAMMING LABORATORY L T P C

(Common to CSE & IT) 0 0 3 2

AIM: The aim of this course is to provide a solid introduction to programming in C++ and to provide an overview of the principles and constraints that affect the way in which C++ programming languages have been designed and is used. OBJECTIVES:

Explain the principles of the object oriented programming paradigm specifically including

abstraction, encapsulation, inheritance and polymorphism

Use an object oriented programming language, and associated class libraries, to develop

object oriented programs

Design, develop, test, and debug programs using object oriented principles in conjuncture with an integrated development environment

Describe and explain the factors that contribute to a good object oriented solution. 1. Design C++ classes with static members, methods with default arguments, friend functions. (For

example, design matrix and vector classes with static allocation, and a friend function to do matrix-

vector multiplication) 2. Implement complex number class with necessary operator overloadings and type conversions

such as integer to complex, double to complex, complex to double etc. 3. Implement Matrix class with dynamic memory allocation and necessary methods. Give proper

constructor, destructor, copy constructor, and overloading of assignment operator. 4. Overload the new and delete operators to provide custom dynamic allocation of memory.

5. Develop a template of linked-list class and its methods. 6. Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge sort,

and quick sort. 7. Design stack and queue classes with necessary exception

handling. 8. Define Point class and an Arc class. Define a Graph class which represents graph as a collection of Point objects and Arc objects. Write a method to find a minimum cost spanning tree in a graph. 9. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse,

Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic polymorphism and

RTTI.

10. Write a C++ program that randomly generates complex numbers (use previously designed

Complex class) and writes them two per line in a file along with an operator (+, -, *, or /). The

numbers are written to file in the format (a + ib). Write another program to read one line at a time

from this file, perform the corresponding operation on the two complex numbers read, and write the

result to another file (one per line).

UTP12301P CAREER SKILL DEVELOPMENT - I L T P C

(Common to all branches of BE/B.TECH Programmes) 0 0 1 1

Career Skill Development Test I Aptitude: Time & Distance, Problems on Trains

Time, Distance, Speed – Relation; Ratio between speed and time; Average Speed; Trains

moving in same direction; Trains moving in opposite direction; conversion of units Communication: JUST A MINUTE (200 mins) ( To identify the students communication level and based on their performance they will be split

into various groups) HEALTHY GROUPS (100 mins) (Based on their scores students will be accommodated in their suitable groups)

KYT (Know Your Team) Students will introduce themselves to their team members

Career Skill Development Test II Aptitude: Logic Sums, probability+ CSD test- I Syllabus

Check the feasibility of logic; Problems based on Dice, Cards, Coins, Colour Balls,

Communication: EXTEMPORE (200 mins) (On the spot topic will be given to each students in a group to stimulate their thinking power).

SKIT- IN ENGLISH (200 mins) Career Skill Development Test III Aptitude: Simplification, venn diagrams, Area

Simplification of complex equations using short-cut methods; check the logic using venn

diagrams; Calculation of Area for Rectangle, Square, Triangle,Cirle, Semi – Circle and related

problems Communication: ROLE PLAY (200 mins)

(Individual performance to each students / group by role playing on their given

situations) STORY BUILDING (200 mins) (Good moral stories will be circulated to a group of students to narrate suitable conclusion)

Career Skill Development Test IV Aptitude: Volume, Surface Area, Statement & Arguments + CSD TEST III Syllabus Calculation of Volume & Surface Area for Cuboid, Cube, Cylinder, Cone, Sphere, Hemi

Sphere; Check the Arguments with statement Communication: ESSAY WRITING & LETTER WRITING (200 mins)

Additional Activities News paper reading Lateral Thinking quiz Word games

Grammar Games

Textbook reference for Aptitude:

―Quantitative Aptitude‖ by R.S. Aggarwal ―Verbal & Non Verbal Reasoning‖ by R.S. Aggarwal

SEMESTER-IV

UMA12401 PROBABILITY AND QUEUING THEORY L T P C

(Common to CSE & IT) 3 1 0 4 AIM: The probabilistic models are employed in countless applications in all areas of science and

engineering. Queuing theory provides models for a number of situations that arise in real life. The

course aims at providing necessary mathematical support and confidence to tackle real life

problems. OBJECTIVES: At the end of the course, the students would • Have a fundamental knowledge of the basic probability concepts. • Have a well – founded knowledge of standard distributions which can describe real life

phenomena.

• Acquire skills in handling situations involving more than one random variable and functions of random variables. • Understand and characterize phenomena which evolve with respect to time in a probabilistic manner. • Be exposed to basic characteristic features of a queuing system and acquire skills in analyzing

queuing models.

UNIT I – RANDOM VARIABLES ( 9+3 ) Discrete and continuous random variables - Moments - Moment generating functions and their

properties. Binomial, Poisson ,Geometric ,Negative binomial, Uniform, Exponential, Gamma, and

Weibull distributions .

UNIT II – TWO DIMENSIONAL RANDOM VARIABLES (9 + 3) Joint distributions - Marginal and conditional distributions – Covariance – Correlation and

regression - Transformation of random variables - Central limit theorem.

UNIT V – MARKOV PROCESSES AND MARKOV CHAINS (9 +3) Classification - Stationary process - Markov process - Markov chains – Transition probabilities -

Limiting distributions-Poisson process

UNIT V – QUEUING THEORY (9 +3) Markovian models – Birth and Death Queuing models- Steady state results: Single and multiple

server queuing models- queues with finite waiting rooms- Finite source models-Little‟s Formula

UNIT V – NON-MARKOVIAN QUEUES AND QUEUE NETWORKS (9+3) M/G/1 queue- Pollaczek- Khintchine formula, series queues- open and closed networks

TOTAL : 45/60

TEXT BOOKS :

1.O.C. Ibe, ―Fundamentals of Applied Probability and Random Processes‖,Elsevier, 1st Indian

Reprint, 2007 (For units 1, 2 and 3). 2.D. Gross and C.M. Harris, ―Fundamentals of Queueing Theory‖, Wiley Student edition, 2004

(For units 4 and 5). REFERENCE BOOKS : 1.A.O. Allen, ―Probability, Statistics and Queueing Theory with Computer Applications‖, Elsevier,

2nd edition, 2005. 2. H.A. Taha, ―Operations Research‖, Pearson Education, Asia, 8th edition, 2007. 3. K.S. Trivedi, ―Probability and Statistics with Reliability, Queueing and Computer Science Applications‖, John Wiley and Sons, 2nd edition, 2002

UEC12414 MICROPROCESSORS AND MICROCONTROLLERS L T P C

(Common to CSE & IT) 3 1 0 4 AIM: To have an in depth knowledge of the architecture and programming of 8-bit and 16-bit

Microprocessors, Microcontrollers and to study how to interface various peripheral

devices with them. OBJECTIVES:

To study the basic architectures and operational features of the processors and

Controllers To learn the assembly language programming To design and understand the multiprocessor configurations

To understand the interfacing concepts of the peripheral devices with that of the

Processors

UNIT I 8085 MICROPROCESSOR 9 Introduction to 8085, Microprocessor architecture - Addressing modes - Instruction set – Interrupts

- Programming with 8085. UNIT II 8086 SOFTWARE ASPECTS 9

Intel 8086 Microprocessor - Architecture - Instruction Set - Addressing modes -

Assembler Directives – Assembly Language Programming - Procedures – Macros -

Interrupts.

UNITIII MULTIPROCESSOR CONFIGURATION 9 Interconnection Topologies - Coprocessor Configuration – Closely Coupled Configuration – Loosely Coupled Configuration – 8087 Numeric Data Processor – Architecture – Bus

Arbitration - 8089 I/O Processor – Architecture. UNIT IV I/O INTERFACING WITH 8085 9 External Memory Interfacing and I/O Interfacing – Parallel Communication Interface (8255) – Serial

Communication Interface (8251) – Timer (8254) - Keyboard/Display Controller (8279) – Interrupt

Controller (8259) – DMA Controller (8237) – Stepper Motor Interfacing.

UNIT V 8051 MICROCONTROLLER AND INTERFACING 9 Architecture of 8051 Microcontroller – Signals – Instruction Set - I/O ports – Memory – Counters

and Timers – Serial Data I/O – Interrupts - Interfacing - Keyboard, LCD,ADC & DAC.

TOTAL: 45

TEXT BOOKS:

1. Ramesh S. Gaonkar, ―Microprocessor – Architecture, Programming and

Applications with the 8085‖, Penram International Publisher, 5th Ed., 2006 2. A.K.Ray & K.M Bhurchandi, ―Advanced Microprocessor and Peripherals –

Architecture, Programming and Interfacing‖, Tata McGraw Hill, 2006. REFERENCE BOOKS:

1. Douglas V. Hall, ―Microprocessors and Interfacing: Programming and Hardware‖, second

edition, Tata McGraw Hill, 2006. 2. Kenneth J. Ayala, ―The 8051 microcontroller Architecture, Programming and

applications‖, second edition, Penram international.

3. Mohammed Ali Mazidi, Janice Gillespie Mazidi, ―The 8051 microcontroller and embedded

systems using Assembly and C‖, second edition Pearson education/Prentice hall of India, 2007.

UEC12411 ANALOG AND DIGITAL COMMUNICATION L T P C

(Common to CSE & IT) 3 0 0 3

AIM: To study about the various modulation techniques like amplitude and angle modulation, that is used

for data transmission and reception of analog signals and also to understand about the modulation

techniques used for digital transmission along with spread spectrum and multiple access

techniques. OBJECTIVES: • To study about the amplitude modulation techniques. • To study bout the angle modulation techniques. • To understand about the modulation techniques used for digital data transmission. • To have the knowledge about the digital communication. • To study about the spread spectrum and multiple access techniques

UNIT I –AMPLITUDE MODULATION - TRANSMISSION AND RECEPTION 9 Principles of amplitude modulation – AM envelope, frequency spectrum and bandwidth, modulation

index and percentage modulation, AM power distribution, AM transmitters – low level transmitters,

high level transmitters.AM reception: AM receivers- Super heterodyne receivers, Double

Conversion AM receivers. (Block Diagrams only)

UNIT II -ANGLE MODULATION- TRANSMISSION AND RECEPTION 9 Angle Modulation – FM and PM waveforms, phase deviation and modulation index, frequency

deviation, phase and frequency modulators and demodulators, Narrowband FM and Broadband

FM, Angle modulation Vs amplitude modulation.FM Receivers: Block diagrams of direct FM

demodulators, Frequency Vs Phase modulation

UNIT III-DIGITAL MODULATION AND MULTIPLE ACCESS TECHNIQUE 9

Introduction, ASK,BPSK,DPSK,QPSK, BFSK, Duo Binary Encoding-Performance Comparision Of Various Systems of Digital Modulation.Multiple access technique-FDMA, TDMA

and CDMA, Comparisions of Various Multiple access techniques.

UNIT IV – BASE BAND DATA TRANSMISSION 9 Sampling theorem, Quantization Process,Alaising,discrete,PAM signals ,ISI, Nyquist Criteria for Distortion less base and binary Transmission, eye patterns.Adaptive equalization for data

transmission, base band M-ary PAM systems.

UNIT-V – SPREAD SPECTRUM AND ERROR CONTROLLING TECHNIQUES 9 Introduction,Pseudo Noise sequence,DS Spread spectrum with coherent binary PSK,Processing

gain,FH Spread spectrum. Error controlling techniques- Linear Block Codes, Cyclic Codes,

Convolution Codes. Total Hours: 45

TEXT BOOKS:

1. Kolimbiris ―digital communication systems‖ with satellite &optical communication

Pearson education

2. Simon Hawkins ―communication systems‖ second edition REFERENCE BOOKS :

1. KolAnokh Singh, ―Principles of Communication Engineering― S.Chand & Co., 1999. 2. Proakis, ―Digital Communication‖, McGraw-Hill, 1992. 3. A.B.Carlson, ―Communication Systems‖, McGraw-Hill, 1992.

UIT12401/UCS12401 SOFTWARE ENGINEERING L T P C

(Common to CSE & IT) 3 0 0 3

AIM: The course is intended to give Software Engineering principles in classical sense. OBJECTIVES:

To be aware of a member of generic models to structure the software

development process. To understand fundamental concepts of requirements engineering and

requirements specification. To understand different notion of complexity at both the module and system level

To be aware of some widely known design methods. To understand the role and contents of testing activities in different life cycle phases

UNIT I INTRODUCTION TO SOFTWARE ENGINEERING 9 Nature of software-Software Process– Generic Process Models– Prescriptive Process Models -

Specialised Process Models – Unified Process –Personal and Team Process Models UNIT II SOFTWARE REQUIREMENTS 9 Requirements Engineering–Establishing Groundwork- Eliciting Requirements – Developing

usecase - Requirement Analysis -Scenario Based Modeling-Data Modeling Concepts-Class Based

Modeling-UML models that supplement the use case

UNIT III DESIGN CONCEPTS 9 Introduction to Analysis and Design–Design Process-Design Concepts-Design Model-Software

Architecture-Architectural Design-Component-Designing class based components-User Interface

Design steps UNIT IV TESTING THE SYSTEM 9 A Strategic Approach to Software Testing –Strategic Issues-Test Strategies for Conventional

software-Unit Testing-Integration Testing-Validation testing –SystemTesting-Black Box Testing-

White Box Testing –Basis Path Testing-Control Structure Testing - Art Of Debugging

UNIT V SOFTWARE CONFIGURATION MANAGEMENT 9 Software Configuration Management- SCM Repository-SCM Process- Identification of Objects in

the software configuration-Version control-Change Control-Configuration Audit- Status Reporting-

Risk Management

TOTAL: 45

TEXT BOOKS:

1. Roger S.Pressman, Software Engineering: A Practitioner‟s Approach, McGraw Hill

International edition, Seventh edition, 2010. 2. Ian Sommerville, Software Engineering, 8th Edition, Pearson Education, 2008 REFERENCE BOOKS:

1. Stephan Schach, Software Engineering, Tata McGraw Hill, 2007 2 .Software Engineering Theory and Practice Shari Lawrence Pfleeger,Joanne M.Atlee ,Third

Edition ,Pearson Education ,2006

UIT12402/UCS12402 DATABASE MANAGEMENT SYSTEMS L T P C

(Common to CSE & IT) 3 0 0 3

AIM: To provide a strong foundation in database technology and an introduction to

the current trends in this field. OBJECTIVES:

To learn the fundamentals of data models and to conceptualize and depict a database

system using ER diagram. To make a study of SQL and relational database design.

To understand the internal storage structures using different file and indexing techniques

which will help in physical DB design. To know the fundamental concepts of transaction processing- concurrency control

techniques and recovery procedure. To have an introductory knowledge about the Storage and Query processing techniques

UNIT I INTRODUCTION 10 Purpose of Database System – Views of data – Data Models – Database Languages – Database

System Architecture – Database users and Administrator – Entity – Relationship model (E-R model

) – E-R Diagrams - Introduction to relational databases. Entity Relationship Model: Basic Concepts

- Design issues - Mapping Constraints - Keys - E-R Diagrams- -Weak Entity Sets - Extended E-R

Features - Design of an E-R Database Schema - Reduction to tables.

UNIT II RELATIONAL MODEL 9 Relational Model: Structure of Relational Databases - Relational Algebra - Tuple Relational

Calculus - Domain Relational Calculus - Extended Relational Algebra Operations - Functional

dependences and Normalization for Relational Databases (up to BCNF).

UNIT III DATA STORAGE AND QUERY PROCESSING 9 Record storage and Primary file organization- Secondary storage Devices- Operations on Files-

Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of Indexes-

B-Tree - B+Tree – Query Processing.

UNIT IV TRANSACTION MANAGEMENT 9 Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of

Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control – Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control –

Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging.

UNIT V CURRENT TRENDS 9 Object Oriented Databases – Need for Complex Data types- OO data Model- Nested relations- Complex Types- Inheritance Reference Types - Distributed databases- Homogenous

and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. Data Mining and Data Warehousing.

TOTAL: 46 TEXT BOOKS: 1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- ―Database System Concepts‖,

Fourth Edition, McGraw-Hill, 2002. REFERENCE BOOKS:

1. Ramez Elmasri and Shamkant B. Navathe, ―Fundamental Database Systems‖, Third

Edition, Pearson Education, 2003. 2. Raghu Ramakrishnan, ―Database Management System‖, Tata McGraw-Hill Publishing

Company, 2003. 3. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- ―Database System

Implementation‖- Pearson Education- 2000. 4. Peter Rob and Corlos Coronel- ―Database System, Design, Implementation and

Management‖, Thompson Learning Course Technology- Fifth edition, 2003.

UIT12403/UCS12403 OPERATING SYSTEMS L T P C

(Common to CSE & IT) 3 0 0 3

AIM: The course introduces the students to the basic principles of operating systems. OBJECTIVES:

To be aware of the evolution of operating systems

To learn what processes are, how processes communicate, how process synchronization

is done and how to manage processes To have an understanding of the main memory and secondary memory management

techniques. To understand the I/O Subsystem To have an exposure to Linux and Windows 2000 operating systems

UNIT I OPERATING SYSTEMS OVERVIEW 9 Operating system – Types of Computer Systems – System components – System calls – System

programs – System structure – Process concept – Process scheduling – Operations on processes

– Cooperating processes – Interprocess communication – Multithreading models – Threading

issues – Pthreads.

UNIT II PROCESS SCHEDULING AND SYNCHRONIZATION 9 Scheduling criteria – Scheduling algorithms – Multiple-processor scheduling – Real time scheduling

– Algorithm Evaluation – Process Scheduling Models - The critical section problem –

Synchronization hardware – Semaphores – Classic problems of synchronization – Critical regions – Monitors Case Study : Process Management in Linux

UNIT III DEADLOCK AND STORAGE MANAGEMENT 9 Deadlock: System model – Deadlock characterization – Methods for handling deadlocks –

Recovery from deadlock. Memory Management: Swapping – Contiguous memory allocation –

Paging –Segmentation – Segmentation with paging. Virtual Memory: Background – Demand paging

– Process creation – Page replacement – Allocation of frames – Thrashing.

UNIT IV FILE SYSTEMS & I/O SYSTEMS 9 File concept – Access methods – Directory structure – File-system mounting –Protection –

Directory implementation – Allocation methods – Free-space management – Disk scheduling – Disk

management – Swap-space management.

UNIT V DISTRIBUTED SYSTEMS 9 Distributed file system – Background – Naming and Transparency – Remote file access – State

full versus Stateless service – File Replication. Distributed Co-ordination – Event ordering – Mutual Exclusion – Atomicity – Concurrency control – Deadlock Handling – Election Algorithms

TOTAL: 45

TEXT BOOKS:

1. Silberschatz, Galvin & Gagne, ―Operating System Concepts‖, Sixth Edition, JohnWiley & Sons

Inc 2003. REFERENCE BOOKS:

1. Andrew S. Tanenbaum, ―Modern Operating Systems‖, Second Edition, AddisonWesley, 2001.

2. Gary Nutt, ―Operating Systems‖, Second Edition, Addison Wesley, 2003. 3. H M Deital, P J Deital and D R Choffnes, ―Operating Systems‖, Pearson Education,2004

UEC12415P MICROPROCESSORS AND MICROCONTROLLERS LABORATORY L T P C

(Common to CSE & IT ) 0 0 3 2

AIM: To learn the assembly language programming of 8085, 8086 and 8051 and also to

give a practical training of interfacing the peripheral devices with the processor. OBJECTIVES:

To implement the assembly language programming in 8085,8086 and 8051

To study the system function calls like BIOS/DOS. To experiment the interface concepts of various peripheral device with the processor

1. Programming with 8085- 8 Bit and 16 Bit Arithmetic and Logical Operations. 2. Programming with 8085- Code Conversion and Matrix Multiplication. 3. Interfacing with 8085-Parallel Communication Interface, 8253, 8279, 8251. 4. Interfacing with 8085-Serial Communication Interface. 5. Interfacing with 8085 Keyboard and Display Controller. 6. Programming with 8086-experiments including BIOS/DOS calls: Keyboard control,

Display, File Manipulation. 7. Interfacing with 8086 - Parallel Communication Interface. 8. Interfacing with 8086 – Serial Communication Interface. 9. Interfacing with 8051 Microcontroller with Stepper Motor. 10. Interfacing with 8051 Microcontroller with Traffic Light Controller.

UIT12404P /UCS12404P DATABASE MANAGEMENT SYSTEMS LABORATORY L T P C (Common to CSE & IT) 0 0 3 2 AIM: The aim of this laboratory is to inculcate the abilities of applying the principles of database

management systems. The course aims to prepare the students for projects where a

proper implementation of databases will be required. OBJECTIVES:

The students will be able to create a database file The students will be able to query a database file

The students will be able to append and update a database file 1. Data Definition Language (DDL) commands in RDBMS. 2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in

RDBMS.

3. High-level language extension with Cursors. 4. High level language extension with Triggers 5. Procedures and Functions. 6. Embedded SQL. 7. Design and implementation of Payroll Processing System. 8. Design and implementation of Banking System. 9. Design and implementation of Library Information System. 10 Database Design using E-R model and Normalization.

UIT12405P /UCS12405P OPERATING SYSTEMS LABORATORY L T P C

(Common to CSE & IT) 0 0 3 2 AIM: To have hands-on experience in operating system concepts and programming in the

UNIX environment. OBJECTIVES:

To learn shell programming and the use of filters in the UNIX environment.

To learn to program in C using system calls. To learn to use the file system related system calls.

To have a knowledge in how processes are created and processes communicate.

To learn how process synchronization is done using semaphores. 1. Write programs using the following system calls of UNIX operating system:

fork, exec, getpid, exit, wait, close, stat, opendir, readdir

Write programs using the I/O system calls of UNIX operating system (open, read, write, etc)

2. Shell Programming

Loops Patterns Expansions Substitutions

3. Write C programs to simulate UNIX commands like ls, grep, etc. 4. Given the list of processes, their CPU burst times and arrival times,

display/print the Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the average waiting time and average turnaround time. (2 sessions) 5. Given the list of processes, their CPU burst times and arrival times,

display/print the Gantt chart for Priority and Round robin. For each of the scheduling policies, compute and print the average waiting time and average turnaround time. (2 sessions) 6. Developing Application using Inter Process Communication (using shared memory, pipes or message queues) 7. Implement the Producer – Consumer problem using semaphores (using UNIX system calls). 8. Implement some memory management schemes – I 9. Implement some memory management schemes – II 10. Implement any file allocation technique (Linked, Indexed or Contiguous)

UTP12401P CAREER SKILL DEVELOPMENT - II L T P C

(Common to all branches of BE/B.TECH Programmes) 0 0 1 1 COMMUNICATION SYLLABUS

AIM: To improve the listening capacity and to increase word power and also aimed to explore

their problem solving ability. OBJECTIVES:

To indulge students in self – disciplining themselves through this course

To focus on reading and listening skills through audio and video

sessions. To educate arithmetic, logical and reasoning ability problems. LEVEL – 1: 5 S

Seiri Seiton Seiso

Seiketsu

Shitsuke Implementing 5-S concept inside the class room and marks will be awarded based on

their regular 5-S performance. LEVEL – 2: VOCABULARY

News paper word collections

GRE words Technical

Vocabularies Jumbled word

games* Creating own „Pocket-Dictionary‟ (Hand written)*

Each student must have their own Dictionary filled with hand written vocabularies to

score credits LEVEL – 3 : COMMENT THIS PICTURE Out of the box answers are expected from students to induce the perception of a picture.

LEVEL – 4 : PERSONALITY’S – BIOGRAPHY

Life story of famous persons

Assignment* Mini biography of a personality to be shared by every students and the copy of PPT should

be mailed to sendbiography@gmail.com. LEVEL – 5 : LISTENING TO CONVERSATION

Audio visual class Audio track will be played on screen and dialogue sheet will be given to the students to

fill the gaps by listen the audio.

APTITUDE SYLLABUS

PORTION – I Clock, Calendar PORTION – II Time and work, Pipes and Cisterns PORTION – III Simple Interest, Compound Interest, Deriving Conclusion from Passage PORTION – IV Square root, Cube root, Puzzle test TEXT BOOKS: 1. Dr.R.S.Aggarwal, ―Quantitative Aptitude‖, S.Chand & Company Limited, 2011(For Aptitude). 2. Dr.R.S.Aggarwal, ―A Modern Approach to Verbal & Non - Verbal Reasoning‖, S.Chand & Company Limited, 2010(For Aptitude).

SEMESTER - V IT12501/UCS12501 JAVA PROGRAMMING L T P C

(Common to IT & CSE) 3 0 0 3 AIM: To understand the concepts of object-oriented, event driven, and concurrent programming

paradigms and to develop skills in using these paradigms in Java. OBJECTIVES:

To understand the fundamentals of object – oriented programming in Java, including

defining classes, invoking methods, using class libraries, etc., To learn the concepts of Array, String and collections

To study the basics of generics and multithreading To establish a firm foundation on core Java concepts such as Events, Exception, etc.,

To develop GUI Interfaces and to work with design frameworks UNIT I INTRODUCTION 9 Object oriented programming concepts – Objects and classes in Java – defining classes –

methods – access specifiers – static members – constructors – finalize method – abstract classes

– Inheritance – Arrays – Strings – Case Study: Summary of differences between Java versions UNIT II PACKAGES AND COLLECTIONS 9 Packages – Interfaces – Polymorphism – Collections – Lists – Stack – Queue – Sets – Maps –

Java Doc comments – I/O streams – File streams – Object class – object cloning – object

serialization

UNIT III GENERIC PROGRAMMING AND MULTITHREADING 9 Motivation for generic programming – generic classes – generic methods – generic interfaces –

generic class hierarchies – Multi-threaded programming – interrupting threads – thread states –

thread priorities – thread synchronization – inter thread communication

UNIT IV EVENT AND EXCEPTION HANDLING 9 Basics of event handling – Delegation event model – event classes – event listener interfaces –

adapter classes – inner classes – AWT event hierarchy – Exception handling – exception

hierarchy – throwing and catching exceptions – Accessing database with JDBC – JPI Overview.

UNIT V JAVAFX AND DESIGN PATTERNS 9 Introduction to JAVAFX – Controls – Menus – Introduction to Design patterns – types – MVC

design pattern – implementation – Frameworks

TOTAL: 45 TEXT BOOK: Herbert Schildt, ―Java the Complete Reference‖, Ninth edition, McGraw-Hill Osborne Media. REFERENCE BOOKS:

1. P.J.Deitel and H.M.Deitel , ― JAVATM

HOW TO PROGRAM‖, seventh edition, Pearson

International Edition, 2009.

2. K. Arnold and J. Gosling, ―The JAVA programming language‖, Third edition, Pearson

Education, 2000.

3. Timothy Budd, ―Understanding Object-oriented programming with Java‖, Updated

Edition, Pearson Education, 2000.

4. C. Thomas Wu, ―An introduction to Object-oriented programming with Java‖, Fourth

Edition, Tata McGraw-Hill Publishing company Ltd., 2006.

UIT12502/UCS12502 OPEN SOURCE SOFTWARE L T P C

(Common to IT & CSE) 3 1 0 4

AIM: To understand the basic principles of open source software and learn to process software

development such as bug reporting, patching code, developing tools. OBJECTIVE:

To provide exposure in FOSS and to develop open source software foe society

UNIT I PHILOSOPHY 9 Linux, GNU and Freedom, Brief history of GNU, Licensing free software –GPL and copy Left,

trends and potential- global and Indian, overview and usage of various Linux distributions- user

friendliness perspective –scientific perspective

UNIT II SYSTEM ADMINISTRATION 9 GNU and Linux installation –Boot process, commands Using bash features, The man pages, files

and file systems, file security, partitions, processes, Managing processes, I/O redirection,

Graphical environment, installing software, Backup techniques

UNIT III FOSS PROGRAMMING PRACTICES 9 GNU debugging tools, using source code versioning and managing tools, Review of common

programming practices and guidelines for GNU/Linux and FOSS, Documentation UNIT IV PROGRAMMING TECHNIQUES 9

Application programming –Basics of X Windows server architecture –QT programming –GTK +

programming-Python programming –open source equivalent of existing commercial software UNIT V PROJECTS AND CASE STUDIES 9

Linux for portable Devices, Creation of Bootable CD and USB from Command line, Case studies-

Samba, Libreoffice, Assistive technology

TOTAL: 45 TEXT BOOK:

1. Ellen Siever, Stephen Figgins, Robert Love, Arnold Robbins, Linux in a nutshell, Sixth edition,

OPeilly media, September 2009.

REFERENCES:

1.Philosophy of GNU URL:http://www.gnu.org/ Philosophy/ 2.Overview of Linux Distributions URL:http://distrowatch.com/dwres,php?resource=major

3.Introduction to Linux- A Hands on guide, URL:http://tldp.org/guides.html 4.Linux:Rute‘s

User tutorial and exposition, URL: http://rute.2038bug.com/index.html.gz 5.Version Control

System, URL: http://git-scm.com/

6.SVN Version control, URL :http://svnbook.red-bean.com/

7.GTK+/GNOME

Application Development Havoc Pennington URL http://developer.gnome.org./doc/GGAD Python Tutorial, Guido van Rossum, Fred L.Drake Jr., Editor .URL:

http://www. Python.org/doc/current/tut/tut.html

8.Doug Abbot ,Linux for Embedded and Real time applications, Newnes

9.Case study SAMBA URL: http://www.samba.org/

UIT12503/UCS12503 COMPUTER NETWORKS L T P C

(Common to IT & CSE) 3 0 0 3

AIM:

To introduce the concepts, terminologies and technologies used in modern days Data

Communication and Computer Networking. OBJECTIVE:

At the end of this course the student will be able to trace the flow of information from one

node to another node in the network Identify the component required to build different types of networks

Understand the division of network functionalities into layer Identify solution for each functionality at each layer Choose the required functionality at each layer for given application

UNIT I FUNDAMENTALS 9

Building a network-Network edge and core-Layering and protocols-Internet Architecture-

Networking devices: modems, Routers, Switches, Gateways- Needs/principles of Application

Layer Protocols-Web and HTTP-FTP-Electronic Mail( SMTP,POP3,IMAP,MIME) –DNS-SNMP.

UNIT II TRANPORT LAYER 9

Overview of transport layer-UDP-TCP-Reliable byte stream-connection management –flow

control-Retransmission-congestion control-congestion avoidance

UNIT III NETWORK AND ROUTING 9

Circuit switching-Packet switching-Virtual circuit switching-Routing-IP-Global Address –

Datagram Forwarding - sub netting-CIDR – ARP- DHCP- RIP- OSPF- BGP- ICMP- IPV6-

Multicasting- PIM

UNIT IV DATA LINK LAYER AND LAN 9

Link layer services- Framing- Error control - flow control-Media access control-Ethernet-

CSMA/CD-Token ring-FDDI-wireless LANs-CSMA/CA

UNIT V DATA COMMUNICATION 9

Signal characteristics- Data transmission –physical links and transmission media- Signal

encoding techniques- channel access techniques- TDM- FDM

TOTAL:45

TEXT BOOKS: 1.Larry L. Peterson, Bruce S. Davie, ‖Computer Networks :A system approach‖, Fifth Edition,

Morgan Kaufmann Publishers, 2010. 2.James F. Kurose, Keith W. Ross, ―Computer Networking- A Top –Down Approach Featuring

the Internet ―, Fifth Edition ,Pearson Education, 2009. 3.Nader. F. Mir, ―Computer and Communication Networks‖, Pearson Prentice Hall Publishers,

2010.

REFERENCE BOOK: 1.Ying-Dar Lin, Ren -Hung Hwang, Fred Baker, ―Computer Networks: An Open Source

Approach‖, McGraw Hill publisher, 2011.

UIT12504/UCS12504 OBJECT ORIENTED ANALYSIS AND DESIGN L T P C

(Common to IT & CSE) 3 0 0 3 AIM:

The course introduces the students to the basic concept of object oriented analysis and

design. OBJECTIVES:

To learn basic OO analysis and design skills through an elaborate case study.

To use the UML design diagrams To apply the appropriate design patterns

UNIT I FUNDAMENTALS 8

Introduction OOAD – Two Orthogonal Views of the Software - Why object orientation – Object

basics – Object oriented systems development life cycle.

UNIT II OBJECT ORIENTED METHODOLOGIES 12 Rumbaugh methodology − Booch methodology − Jacobson methodology − Patterns −

Frameworks − Unified approach − Unified modeling language − Use case diagram − Class

diagram − Sequence diagram − Activity diagram.

UNIT III OBJECT ORIENTED ANALYSIS 9 Identifying use cases – Identifying Tentative classes – Identifying Classes and their Behaviors

using SCM -Identifying object relationships – Attributes and methods.

UNIT IV OBJECT ORIENTED DESIGN 8 Design axioms – Designing classes – Object storage – Introduction – Object store and

persistence overview – Database Management Systems.

UNIT V SOFTWARE QUALITY AND USABILITY 8 Introduction to SQA – Quality Assurance Tests – Testing Strategies – Impact of object orientation

on Testing – Test cases-Test Plan – System usability and measuring user satisfaction.

TOTAL : 45

TEXT BOOKS:

1. Ali Bahrami, ―Object Oriented Systems Development‖, Tata McGraw - Hill, 1999. 2. Martin Fowler, ―UML Distilled‖, 2nd Edition, Prentice Hall of India / Pearson Education, 2002.

REFERENCE BOOKS: 1. Stephen R. Schach, ―Introduction to Object Oriented Analysis and Design‖, Tata McGraw -

Hill, 2003.

2. James Rumbaugh, Ivar Jacobson and Grady Booch ―The Unified Modeling Language

Reference Manual‖, Addison Wesley, 1999.

3. Hans - Erik Eriksson, Magnus Penker, Brain Lyons and David Fado, ―UML Toolkit‖, OMG

Press Wiley Publishing Inc., 2004.

4. Barclay, ―Object-Oriented Design with UML and Java‖, Elsevier, 2008.

UIT12505 ENTERPRISE COMPUTING L T P C

AIM: (Recommended by Infosys) 3 1 0 4

The course exposes the students to the essentials of building enterprise applications. OBJECTIVE:

To familiarize with concept of Enterprise Analysis and Business Modeling.

To understand requirements validation, planning and estimation. To design and document the application architecture.

To understand the importance of application framework and designing other

application components. To construct and develop different solution layers. To perform Code review, Code analysis, build process

UNIT I INTRODUCTION 9 Introduction to enterprise applications and their types, software engineering methodologies, life

cycle of raising an enterprise application, introduction to skills required to build an enterprise

application, key determinants of successful enterprise applications, and measuring the success of

enterprise applications

UNIT II MODELING 9 Inception of enterprise applications, enterprise analysis, business modeling, requirements

elicitation, use case modeling, prototyping, non functional requirements, requirements validation,

planning and estimation

UNIT III ARCHITECTURE 9 Concept of architecture, views and viewpoints, enterprise architecture, logical architecture,

technical architecture- design, different technical layers, best practices, data architecture and

design – relational, XML, and other structured data representations, Infrastructure architecture

and design elements - Networking, Internetworking, and Communication Protocols, IT Hardware

and Software, Middleware, Policies for Infrastructure Management, Deployment Strategy,

Documentation of application architecture and design

UNIT IV CONSTRUCTION 9 Construction readiness of enterprise applications - defining a construction plan, defining a

package structure, setting up a configuration management plan, setting up a development

environment, introduction to the concept of Software Construction Maps, construction of technical

solutions layers, methodologies of code review, static code analysis, build and testing, dynamic

code analysis – code profiling and code coverage .

UNIT V TESTING 9 Types and methods of testing an enterprise application, testing levels and approaches, testing

environments, integration testing, performance testing, penetration testing, usability testing,

globalization testing and interface testing, user acceptance testing, rolling out an enterprise

application.

TOTAL: 45 TEXT BOOKS: 1. Anubhav Pradhan, Satheesan B.Nanjappa, Senthil K.Nallasamy, Veerakumar Esakimuthu, "

Raising Enterprise Applications", Wiley India, First Edition, 2012.

REFERENCE BOOKS: 1. George Reese, ―Database programming, with JDBC and Java" Second Edition, O‘Reiliy

Publishers, New Delhi, 2000.

2. Dustin R. Callaway - "Inside Servlets‖ - Addison Wesley Longman Inc, New Delhi, 2001. 3. Tom Valesky - "Enterprise Java Beans" - Addison Wesley Longman Inc. New Delhi, 2000. 4. Ed Roman - "Mastering EJB" - John Wiley & Sons, New Delhi, 2001.

UEC12511 DIGITAL SIGNAL PROCESSING L T P C

3 0 0 3 AIM:

The aim of this course is to make the students understand the fundamental concepts of digital

signal processing. OBJECTIVES:

Ability to apply knowledge of analyzing the signals

Ability to determine the Fourier Transform of Discrete time signals

To Know well about sampling methods and DFT Ability to design the digital filters

UNIT I SIGNALS AND SYSTEMS 12 Representation of signals, Elementary of signals – Pulse, Step, Ramp, Impulse, Exponential.

Classification of Continuous Time(CT) and Discrete Time(DT) signals – periodic and aperiodic,

even and odd, energy and power, deterministic and random, exponential signals, Operation on

signals, CT & DT systems, properties of systems – memory systems, linearity, time invariance,

causality, stability, invertibility.

UNIT II SAMPLING THEOREM AND ANALYSIS OF DISCRETE TIME SIGNALS 12 Representation of CT signals by its sample – Sampling theorem – Reconstruction of a signal from

its samples, aliasing, Nyquist rate and interval- sampling methods- impulse, natural and flat top

sampling – Discrete Time Fourier Transform (DTFT) and analysis – properties

UNIT III FAST FOURIER TRANSFORMS 12 Introduction to DFT – Relationship between DFT & DTFT- Efficient computation of DFT -

Properties of DFT – FFT algorithms – Radix-2 algorithm – Decimation in Time – Decimation in

Frequency algorithms – overlap add & overlap save methods.

UNIT IV DIGITAL FILTER DESIGN 12 FIR Filters: Linear phase FIR filter -Windowing technique -Rectangular, Hamming, Hanning

windows , Realization- Direct, Cascade and Transposed Forms.

IIR Filters: IIR Digital Filter Design using Low pass Butterworth filter-bilinear Transformation-

Impulse Invariance Technique-Realization- Direct -I, Direct –II, Cascade and Parallel Forms.

UNIT V FINITE WORD LENGTH EFFECTS 12 Quantization noise – derivation for quantization noise power – Fixed point and binary floating point

number representation, comparison – over flow error – truncation error – rounding error – co-

efficient quantization error - limit cycle oscillation – Application of DSP – Model of Speech Wave

Form, Vocoder and Subband coding.

TOTAL : 60 TEXT BOOKS:

1. John G. Proakis and Dimtris G. Manolakis, Digital Signal Processing Principles,

Algorithms and Application, PHI/Pearson Education, 2007.

2. Alan V Oppenheim, Ronald W Schafer and John R Buck, ―Discrete Time Signal

Processing‖, PHI/Pearson Education, 2000, 2nd

Edition.

REFERENCE BOOKS:

1. Sanjit K.Mitra, ―Digital Signal Processing: A Computer – Based Approach‖, Tata McGraw-

Hill, 2001, Second Edition.

2. Johny R.Johnson, ―Introduction to Digital Signal Processing‖, Prentice Hall of

India/Pearson Education, 2002.

3. Michael J Roberts and Govind Sharma, Fundamentals of Signals and Systems, McGraw-

Hill, 2010. 4. S. Salivahanan, A. Vallavaraj, C. Gnanapriya, ‗Digital Signal Processing‘, Tata McGraw

Hill, New Delhi, 2003.

UIT12506P/UCS12507P JAVA PROGRAMMING LABORATORY L T P C

(Common to IT & CSE) 0 0 3 2 AIM:

To introduce students to programming fundamentals of Java which provides a suitable

basis for many Java – based applications. OBJECTIVES:

To understand the fundamentals and basic concepts of Java programming

To enable the students to develop Java based applications To apply the general programming constructs to Java environment

To apply the object oriented development concepts in Java

1. Develop a Java package with simple Stack and Queue classes. Use JavaDoc comments

for documentation.

2. Design a class for Complex numbers in Java. In addition to methods for basic operations

on complex numbers, provide a method to return the number of active objects created.

3. Design a Date class similar to the one provided in the java.util package.

4. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle,

Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic

polymorphism.

5. Design a Java interface for ADT Stack. Develop two different classes that implement this

interface, one using array and the other using linked-list. Provide necessary exception

handling in both the implementations.

6. Write a Java program to read a file that contains DNA sequences of arbitrary length one

per line (note that each DNA sequence is just a String). Your program should sort the

sequences in descending order with respect to the number of 'TATA' subsequences

present. Finally write the sequences in sorted order into another file.

7. Develop a simple paint-like program that can draw basic graphical primitives in different

dimensions and colors. Use appropriate menu and buttons.

8. Develop a scientific calculator using even-driven programming paradigm of Java.

9. Develop a template for linked-list class along with its methods in Java.

10. Design a thread-safe implementation of Queue class. Write a multi-threaded producer-

consumer application that uses this Queue class.

UIT12507P/UCS12508P CASE TOOLS LABORATORY L T P C

(Common to IT & CSE) 0 0 3 2 AIM:

To help the students practice the general software engineering methodologies in the

objected – oriented development of applications. OBJECTIVES:

To understand the fundamentals and basic concepts of Software Engineering

To enable the students to develop creative applications To practice the object oriented software development methodologies To be aware of the database management techniques while developing applications

1. Prepare the following documents for two or three of the experiments listed below and develop

the software engineering methodology.

2. Program Analysis and Project Planning. Thorough study of the problem – Identify project scope, Objectives, Infrastructure.

3. Software requirement Analysis Describe the individual Phases / Modules of the project, Identify deliverables.

4. Data Modeling Use work products – Data dictionary, Use diagrams and activity diagrams, Build and test class

diagrams, Sequence diagrams and add interface to class diagrams. 5. Software Development and Debugging

6. Software Testing

Prepare test plan, perform validation testing, Coverage analysis, memory leaks, develop test case

hierarchy, Site check and Site monitor.

SUGGESTED LIST OF APPLICATIONS:

1. Student Marks Analyzing System

2. Banking System

3. ATM System

4. Online Ticket Reservation System

5. Payroll Processing System

6. Course Registration System

7. Library Management System

UEC12512P DIGITAL SIGNAL PROCESSING LABORATORY L T P C

0 0 3 2 AIM:

The aim of this course is to provide practical coverage of the fundamentals of digital

signal processing.

OBJECTIVES:

To understand the algorithms involved in digital signal processing

To enable the students to apply and model the concepts in microprocessors and signal

processors To help the students in the realization of various algorithms

1. Generation of signals

2. Operation on signals

3. Frequency response of LTI System

4. Verification of sampling theorem

5. Upsampling and Downsampling

6. Calculation of DFT

7. Linear and Circular Convolution

8. Implementation of overlap save and overlap add methods

9. Design of FIR filters using windows

10. Design of IIR filters using Butterworth filter

UTP12501P CAREER SKILL DEVELOPMENT - III L T P C

(Common to all Branches) 0 0 1 1

AIM: COMMUNICATION SYLLABUS

To envisage corporate culture and improve aptitude skills.

OBJECTIVES:

To improve English fluency To educate arithmetic, logical and reasoning ability problems

LEVEL – 1 MIME

Non verbal communication assessment students will be awarded marks based on their

expressions and body language.

LEVEL – 2 ENGLISH ORATORY

Eg., Inaugural Address

Celebration Speeches

Patriotic Speech, etc.,

LEVEL – 3 GROUP DISCUSSION

Collaborative Learning Technique

Brain Storming Case Studies

LEVEL – 4 SHORT FILM

Audio Visual Class Pronunciation and Voice Modulation can be gained through this English short movie

LEVEL – 5 RESUME PREPARATION

APTITUDE SYLLABUS

PORTION 1

Boats & Streams, Statement - Assumptions

PORTION 2

Alligation or Mixture, Statement - Conclusions

PORTION 3

Logarithms, Permutation & Combination

PORTION 4

Heights and Distance, Cause and Effect Reasoning TEXT BOOKS:

1. Dr.R.S.Aggarwal, ―Quantitative Aptitude‖, S.Chand & Company Limited, 2011 (For

Aptitude)

2. Dr.R.S.Aggarwal, ―A Modern Approach to Verbal & Non – Verbal Reasoning‖ ,

S.Chand & Company Limited, 2010 (For Aptitude)

SEMESTER - VI

UMA12601 DISCRETE MATHEMATICS L T P C

AIM: (Common to IT & CSE) 3 1 0 4

To provide an insight to the area of mathematics known as discrete mathematics and apply it to

special applications such as coding and cryptography. OBJECTIVES:

To obtain general knowledge about the area of discrete mathematics To understand a variety of methods and to construct mathematical proofs

To model situations in a mathematical way and derive useful results

UNIT I PROPOSITIONAL CALCULUS 10 + 3 Propositions – Logical connectives – Compound propositions – Conditional and biconditional

propositions – Truth tables – Tautologies and contradictions – Contrapositive – Logical

equivalences and implications – DeMorgan‘s Laws - Normal forms – Principal conjunctive and

disjunctive normal forms – Rules of inference – Arguments - Validity of arguments.

UNIT II PREDICATE CALCULUS 9 + 3 Predicates – Statement function – Variables – Free and bound variables – Quantifiers – Universe

of discourse – Logical equivalences and implications for quantified statements – Theory of

inference – The rules of universal specification and generalization – Validity of arguments.

UNIT III SET THEORY 10 + 3 Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairs and

Cartesian product – Relations on sets –Types of relations and their properties – Relational matrix

and the graph of a relation – Partitions – Equivalence relations – Partial ordering – Poset – Hasse diagram – Lattices and their properties – Sublattices – Boolean algebra – Homomorphism.

UNIT IV FUNCTIONS 7 + 3 Definitions of functions – Classification of functions –Type of functions - Examples – Composition

of functions – Inverse functions – Binary and n-ary operations – Characteristic function of a set –

Hashing functions – Recursive functions – Permutation functions.

UNIT V GROUPS 9 + 3 Algebraic systems – Definitions – Examples – Properties – Semigroups – Monoids –

Homomorphism – Sub semigroups and Submonoids - Cosets and Lagrange‘s theorem – Normal

subgroups – Normal algebraic system with two binary operations - Codes and group codes –

Basic notions of error correction - Error recovery in group codes.

TOTAL: (L:45+T:15): 60

TEXT BOOKS:

1. Trembly J.P and Manohar R, ―Discrete Mathematical Structures with Applications to

Computer Science‖, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003. 2. Ralph. P. Grimaldi, ―Discrete and Combinatorial Mathematics: An Applied Introduction‖,

Fourth Edition, Pearson Education Asia, Delhi, 2002.

REFERENCE BOOKS:

1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, ―Discrete Mathematical

Structures‖, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.

2. Kenneth H.Rosen, ―Discrete Mathematics and its Applications‖, Fifth Edition, Tata

McGraw – Hill Pub. Co. Ltd., New Delhi, 2003.

UIT12601/UCS12601 WEB TECHNOLOGY L T P C

(Common to IT & CSE – Recommended by Infosys) 3 1 0 4 AIM:

To provide an introduction to Java and basic Web concepts and enable the student to create

simple Web based applications.

OBJECTIVES:

To introduce the basic Web developing concepts To understand the Java web programming concepts

To create simple Web pages and provide client side validation

To create dynamic web pages using server side scripting

UNIT I INTRODUCTION WEB SERVICES 9 Web services architecture – overview of web services – service oriented roles and architecture – architectural process – three tier web based architecture

UNIT II XML 9 Introduction to XML – XML fundamentals – well-formed XML documents – components of XML

document – XML tools – XML stylesheets – XSL – CSS - XML namespaces- WSDL - SOAP –

UDDI UNIT III CLIENT SIDE PROGRAMMING 9 Client Tier using HTML – Basic HTML tags – Look and feel using CSS – Client side scripting

using Java Script and Validations - Document Object Model (DOM) UNIT IV JAVA - SERVER SIDE PROGRAMMING 9 Presentation tier using JSP – Role of Java EE in Enterprise applications – Internationalization –

Basics of Servlets - To introduce server side programming with JSP UNIT V BUILDING WEB APPLICATIONS 9 Building Web applications - cookies – sessions – open source environment – PHP

TOTAL : 45 TEXT BOOKS:

1. Rashim Mogha, Preetham.V.V., ― Java Web Services Programming‖, Wiley Dreamtech, New

Delhi, 2002. 2. Chris Bates, ―Web Programming – Building Internet Applications, ―Wiley India, 2006.

REFERENCE BOOKS:

1. Deitel ,― XML How to Program‖, first edition, Pearson Education, USA, 2002. 2. Bhanu Pradhap, ― Understanding Active Server Pages ―, Cyber Tech Publications ,New Delhi,

2001. 3. Jeffrey C Jackson, ― Web Technology – A computer Science perspective‖, Persoson

Education, 2007.

UIT12602/UCS12602 PRINCIPLES OF COMPILER DESIGN L T P C

(Common to IT & CSE) 3 1 0 4 AIM:

To introduce students to the concepts underlying the design and implementation of various

compilers.

OBJECTIVES:

To design the front end of the compiler, scanner, parser, intermediate coed generator,

object code generator, and the parallel compilation strategies UNIT I LEXICAL ANALYSIS Introduction to compiler- compilers-Analysis of the Source Program-The phases of compiler –

compiler construction tools-Lexical analyzer-input buffering-specification of tokens-Recognition of

tokens-A language for specifying lexical analyzer UNIT II SYNTAX ANALYSIS AND RUN-TIME ENVIRONMENTS Syntax Analysis: the role of the parser –Context –free grammars- writing a grammar- Top Down

parsing –bottom up parsing-LR parsers-constructing SLR parsing table-type checking-type

systems-specification of a simple type checker-Run –time Environment-Source language issues-

storage organization-storage allocation strategies. UNIT III INTERMEDIATE CODE GENERATION Intermediate languages-Declarations-Assignment statements-Boolean expressions-flow of Control

statements-Back patching-Procedure calls UNIT IV CODE GENERATION Issues in the design of a code generator-Target machine –Run-time storage management – Basic

block and flow graphs-Next-use information –Simple code generator-Register allocation and

assignment- The DAG representation of basic blocks- Generating code from DAGs UNIT V CODE OPTIMIZATION Principle sources of optimization –peephole optimization – optimization of basic blocks –Loops in

flow graphs –Introduction to global data-flow analysis-code improving transformations.

TOTAL:45 TEXT BOOK: 1.Alfred V. Aho, Ravi Sethi Jeffrey D.Ullman, ―compilers: Principles, Techniques and Tools‖,

Pearson Education, 2011.

REFERENCE BOOKS:

1.David Galles ,‖Modern compiler design‖, Pearson Education, 2008. 2.Steven S.Muchnick, ‖Advanced compiler Design & implementation ―, Morgan Kaufmann

Publishers, 2000. 3.Charles N.Fischer, Richard. J.LeBlanc, ― Crafting a compiler with C‖, Pearson Education, 2008.

UIT12603 DATA WAREHOUSING AND DATA MINING L T P C

AIM: 3 0 0 3

The purpose of this course is to provide understanding of the need for data warehousing and to

realize the importance of good mining techniques.

OBJECTIVES:

To introduce the theoretical background of the data mining functionalities To emphasize on the practical issues in designing and implementing data warehouse

To introduce the mining in World Wide Web

UNIT I DATA WAREHOUSING 9 Data Warehousing : Data Warehousing Components-building a Data Warehouse-Mapping the

Data Warehouse to a Multiprocessor Architecture-DBMS Scheme for Decision Support-Metadata-

Online analytical processing(OLAP)-OLAP and Multidimensional Data Analysis.

UNIT II DATA MINING 9 Data Mining: -Data Mining-Functionalities-Data Preprocessing-Data Cleaning-Data Integration and Transformation-Data Reduction-Data Discretization

UNIT III CLASSIFICATION AND PREDICTION 9 Classification and Prediction:-Issues Regarding Classification and Prediction-Classification by

Decision Tree Induction-Bayesian Classification-Rule Based Classification –Classification by Back

propagation-Prediction-Accuracy and Error Measures-Evaluating the Accuracy of a Classifier or

Predictor

UNIT IV CLUSTERING AND PARTITIONING 9

Cluster Analysis:-Types of Data in Cluster Analysis-Clustering Methods: Partitioning Methods-

Hierarchical Methods, Outlier Analysis

UNIT V APPLICATIONS AND TRENDS IN DATA MINING 9

Spatial Data-Mining-Multimedia Data mining-Text Mining-Mining the World Wide Web.

TOTAL : 45 TEXT BOOK: 1.Jiawei Han and Micheline Kamber ―Data Mining Concepts and Techniques‖ Third Edition,

Elsevier Reprinted 2008.

REFERENCE BOOKS: 1.Alex Berson and Stephen J.Smith ―Data Warehousing, Data mining & OLAP‖, Tata McGraw-Hill

Edition, Tenth Reprint 2007. 2.K.P.Somen, Shyam Diwakar and V.Ajay ―Insight into Data Mining Theory and practice‖, Easter

Economy Edition, Prentice Hall of India, 2006. 3.G.K.Gupta ―Introduction to Data mining with case studies‖, Easter Economy Edition, Prentice

Hall of India, 2006. 4.Pang-Ning Tan, Michael Steinbach and Vipin Kumar ―Introduction to Data mining‖, Pearson

Education, 2007.

UIT12604/UCS12604 MOBILE COMPUTING L T P C

AIM: (Common to IT & CSE) 3 0 0 3

To give a comprehensive exposure to the developments taking place in the areas of wireless

networks and computing OBJECTIVES:

To impart the fundamental concepts of mobile communication systems.

To understand the issues relating to wireless applications. To learn the working principles of Wireless LAN standards and Wireless

Application Protocols. UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9

Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas

– Signal Propagation – Multiplexing – Modulation – Spread Spectrum –Medium Access Control

(MAC) – Space Division Multiple Access(SDMA) –Frequency Division Multiple Access (FDMA) –

Time Division Multiple Access (TMDA) – Code Division Multiple Access(CDMA) UNIT II WIRELESS TELECOMMUNICATION NETWORKS 9

Telecommunication systems – Global System for Mobile (GSM) – GPRS - Satellite systems –

Basics –Routing – Broadcast Systems – Digital Audio Broadcasting (DAB) – Digital Video Broad

casting (DVB). UNIT III WIRELESS LAN 9

Advantages and disadvantages of Wireless Local Area network (WLAN) – IEEE 802.11 –

System Architecture –Medium Access Control management (MAC) – High Performance Radio

LAN (HIPERLAN)– Bluetooth Architecture – Security. UNIT IV MOBILE NETWORK LAYER 9 Mobile IP – Internet Protocol version 6 (IPv6) – Dynamic Host Configuration Protocol – Mobile ad-

hoc networks –Routing – Destination Sequence Distance Vector – Dynamic Source Routing.

UNIT V TRANSPORT AND APPLICATION LAYERS 9 Traditional TCP – Classical TCP improvements – Wireless Application Protocol – Architecture –

Wireless Datagram Protocol (WDP) – Wireless Transport Layer Security(WTLS) –Wireless

Session Protocol (WSP) – Wireless Application Environment (WAE) – Wireless Markup Language

(WML)– Wireless Markup Language Script (WML Script) – Wireless Telephony Application (WTA)

– Push architecture – Push/pull services.

TOTAL:45

TEXT BOOK:

1. Jochen H.Schiller, Mobile Communications, Pearson Education, 2007. (Reprint 2011) REFERENCE BOOKS: 1. William Stallings, Wireless Communications and Networks, PHI/Pearson Education, 2002 2. Kaveh Pahlavan and Prasanth Krishnamoorthy, ―Principles of Wireless Networks‖,

PHI/Pearson Education, 2003

3. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, ―Principles of Mobile Computing‖, Springer, New York, 2003

4. Hazysztof Wesolowshi, ―Mobile Communication Systems‖, John Wiley and Sons Ltd, 2002

UIT12606P/UCS12606P FOSS LABORATORY L T P C

(Common to IT & CSE) 0 0 3 2

AIM: To understand the basic principles of open source software and learn to work in different open

source platforms. OBJECTIVES:

To practice the installation of various open source softwares in different modes

To learn to program simple applications in PHP To learn to successfully build Interfaces using IDEs

To establish a firm foundation in NS2 simulator 1.GNU/Linux OS installation (provide details of how to detect, configure disk partitions & file

system and successfully install a GNU/Linux distribution) 2.Basic shell commands –logging in, listing files, editing files, copying/moving files, viewing file

contents, changing file modes and permissions, process managements 3.User and group management, file ownerships and permissions, PAM authentication,

Introduction to common system configuration files & log files. 4.Configuring networking, basics of TCP/IP networking and routing , connection to the internet

(through dialup, DSL, Ethernet, leased line) 5.Performing everyday tasks using GUN/Linux-accessing the internet, playing music, editing

documents and spreadsheets, sending and receiving email, copy files from disks and over the

network, playing games, writing CDs. 6. Setting up web servers-using apache(for HTTP services), setting up proxy services, printer

services, firewall .Using the GNU compiler collection –getting acquainted with the GNU

compiler tools-the C preprocessor (cpp), the C compiler (gcc) and the c++ compiler (g++),

and the assembler(gas) 7. Python Programming

8. QT Programming

9. GTK Programming

10. PHP & MY SQL Connectivity

UIT12607P/UCS12607P WEB TECHNOLOGY LABORATORY L T P C

(Common to IT & CSE) 0 0 3 2 AIM: To enable the students to program in Java and to create simple Web based applications. OBJECTIVES:

To design a simple web page using HTML. To write simple programs using VB Script and JAVA script.

To create simple Web pages and provide client side validation.

To create dynamic web pages using server side scripting.

1. Creation of simple HTML5 pages with divisions, links, tables, canvas and other tags. 2. Client Side Programming.

a. Javascript for displaying date and comparing two dates.

b. Form validation including textfield, radio buttons, checkboxes, listbox and other controls

c. Jquery Exercises, AJAX 3. XML - DTD 4. XML - XSL 5. Webpage – CSS3, Stylesheet Inclusion Techniques 6. Active Server Pages 7. Java Server Pages – Request, Session, Implicit Objects 8. Java Servlets 9. Sample web application development in the open source environment.

UIT12608P COMPILER DESIGN LABORATORY L T P C

0 0 3 2 AIM: The aim of this laboratory is to make the students to be exposed to compiler writing tools, to

implement the different phases of compiler, to be familiar with control flow and data flow analysis

and to learn simple optimization techniques. OBJECTIVES:

Implement the different Phases of compiler using tools Analyze the control flow and data flow of a typical program

Optimize a given program Generate an assembly language program equivalent to a source language program

1. Implementation of Symbol Table

2. Develop a lexical analyzer to recognize a few patterns in C. (Ex. identifiers, constants,

comments, operators etc.)

3. Implementation of Lexical Analyzer using Lex Tool

4. Generate YACC specification for a few syntactic categories.

a) Program to recognize a valid arithmetic expression that uses operator +, - , * and /.

b) Program to recognize a valid variable which starts with a letter followed by any number

of letters or digits.

c) Implementation of Calculator using LEX and YACC

5. Convert the BNF rules into Yacc form and write code to generate Abstract Syntax Tree.

6. Implement type checking

7. Implement control flow analysis and Data flow Analysis

8. Implement any one storage allocation strategies(Heap, Stack, Static)

9. Construction of DAG

10. Implement the back end of the compiler which takes the three address code and

produces the 8086 assembly language instructions that can be assembled and run using a

8086 assembler. The target assembly instructions can be simple move, add, sub, jump.

Also simple addressing modes are used.

11. Implementation of Simple Code Optimization Techniques (Constant Folding., etc.)

UTP12601P CAREER SKILL DEVELOPMENT - IV L T P C

(Common to all branches) 0 0 1 1

COMMUNICATION SYLLABUS AIM: To meet industrial expectation & to develop problem solving skills. OBJECTIVES:

To improve the quality of student‘s communication with practical experience

To impart basic skills on arithmetic, logical and reasoning ability LEVEL – 1 QUIZ

Current Affairs

Who am I? Logo Identification

Individual cum Team based activity to brush up their general awareness LEVEL – 2 DEBATE

Socio – Economic problems

Government Policies General Issues etc.,

LEVEL – 3 VIDEOGRAPHY

Speech Recording Video recording of student‘s speech will be shown to them to rectify their own mistakes

and also to improve body language and eye contact LEVEL – 4 PROFILE PRESENTATION

Company Profile (Power Point Presentation)

Seminar Day *

* Every student must prepare PPT about famous industries to present during seminar day.

LEVEL – 5 INTERVIEW

APTITUDE SYLLABUS

Problems on Trains Time and Distance Height and Distance Time and Work Simple Interest Compound Interest Profit and Loss Partnership Percentage Problems on Ages Calendar Clock Average Area Volume and Surface Area

Permutation and Combination Numbers Problems on Numbers

Problems on H.C.F and L.C.M Decimal Fraction Simplification Square Root and Cube Root Probability Ratio and Proportion Chain Rule Pipes and Cistern Boats and Streams

Alligation or Mixture Logarithm Odd Man Out and Series Logical questions, Verbal & Non Verbal Reasoning questions, General company questions TEXT BOOKS:

3. Dr.R.S.Aggarwal, ―Quantitative Aptitude‖, S.Chand & Company Limited, 2011 (For

Aptitude)

4. Dr.R.S.Aggarwal, ―A Modern Approach to Verbal & Non – Verbal Reasoning‖ ,

S.Chand & Company Limited, 2010 (For Aptitude)

UIT12651 ARTIFICIAL INTELLIGENCE L T P C

3 0 0 3 AIM: The aim of this course is to give students a comprehensive understanding of Artificial Intelligence,

developing computer applications, which encompasses perception, reasoning, learning and to

provide an in-depth understanding of major techniques used to simulate intelligence. OBJECTIVES:

To provide a strong foundation of fundamental concepts in Artificial Intelligence

To provide a basic exposition to the goals and methods of Artificial Intelligence

To describe the logical languages and apply it for knowledge representation. To outline the importance of learning agent and the forms of learning.

To Design of communicative agent and its usage in domains.

UNIT I INTRODUCTION 8 Intelligent Agents – Agents and environments - Good behavior – The nature of environments –

structure of agents - Problem Solving - problem solving agents – example problems – searching

for solutions – uniformed search strategies - avoiding repeated states – searching with partial

information.

UNIT II SEARCHING TECHNIQUES 10 Informed search and exploration – Informed search strategies – heuristic function – local search

algorithms and optimistic problems – local search in continuous spaces – online search agents

and unknown environments - Constraint satisfaction problems (CSP) – Backtracking search and

Local search for CSP – Structure of problems - Adversarial Search – Games – Optimal decisions

in games – Alpha – Beta Pruning – imperfect real-time decision – games that include an element

of chance.

UNIT III KNOWLEDGE REPRESENTATION 10 Logical Agents – Wumpus world - Propositional logic - First order logic - syntax and semantics –

Using first order logic – Inference – forward chaining – backward chaining– Knowledge

representation – Ontological Engineering – Categories and objects – Actions – Simulation and

events – Mental events and mental objects.

UNIT IV LEARNING 9 Learning from observations – forms of learning – Inductive learning - Learning decision trees –

Ensemble learning – Knowledge in learning – Logical formulation of learning – Explanation based

learning – Learning using relevant information – Reinforcement learning – Passive reinforcement

learning – Active reinforcement learning – Generalization in reinforcement learning.

UNIT V APPLICATIONS 8 Communication –Communication as action -A formal grammar for a fragment of English –

Syntactic Analysis – Augmented Grammars – Semantic Interpretation – Ambiguity and

Disambiguation – Discourse Understanding – Grammar Induction.

TOTAL : 45 TEXT BOOK: 1. Stuart Russell, Peter Norvig, ―Artificial Intelligence – A Modern Approach‖, 2nd Edition,

Pearson Education / Prentice Hall of India, 2004.

REFERENCE BOOKS: 1. Nils J. Nilsson, ―Artificial Intelligence: A new Synthesis‖, Harcourt Asia Pvt. Ltd., 2000. 2. Elaine Rich and Kevin Knight, ―Artificial Intelligence‖, 2nd Edition, Tata McGraw-Hill, 2003. 3. George F. Luger, ―Artificial Intelligence-Structures And Strategies For Complex Problem

Solving‖, Pearson Education / PHI, 2002.

UIT12652/UCS12651 C# AND .NET FRAMEWORK L T P C

(Common to IT & CSE) 3 0 0 3 AIM: To cover the fundamental concepts of the C# language and the .Net Framework. OBJECTIVES:

Understand the concept of .NET framework, study the different techniques of security,

introduce web services with ASP.NET, and explore window based applications.

UNIT I C# LANGUAGE BASICS 8 C# and the .NET framework- C# basics-Objects and types-Inheritance-Arrays-Operators and

casts-Indexes UNIT II C# ADVANCE FEATURES 9 Delegates and Events-Strings and regular expressions-Generics- Collections-Memory

management and pointers-Errors and exceptions UNIT III BASE CLASS LIBRARIES AND DATA MANIPULATION 8 Tracing and events-Threading and synchronization-.NET security-Localization –Manipulating XML

–Managing the file System –Basic network programming UNIT IV DATA BASE WEB SERVICES 8 Window based applications-Data access with .NET-basic of ASP.NET-Introduction to web

services UNIT V .NET FRAMEWORK 12 Architecture –Assemblies-Shared assembling –CLR hosting- Appdomains-Reflection

TOTAL : 45 TEXT BOOKS: 1.Christian Nagel et.al. ―Professional C# 2005 with .NET 3.0‖, Wiley India, 2007.

REFERENCE BOOKS:

1.Ian Gariffiths Mathew Adams, Jesse Liberty, ―Programming C# 4.0‖, O‘Reilly, Fourth Edition,

2010. 2.Andrew Troelson, ―Pro C# with .NET 3.0‖, Apress, 2007. 3.Kevin Hoffman, ―Microsoft Visual C# 2005‖, Pearson Education, 2006.

4.S.Thamarai Selvi, R.Murugesan, ‖A Text Book of C#‖, Pearson Education, 2003.

UIT12653 CYBER FORENSICS L T P C

3 0 0 3 AIM: To study different types of Cyber forensic technologies an d enable the student to have a

foundation in this emerging area.

OBJECTIVES:

To study the fundamentals of computer forensics

To have an overview of techniques for Data Recovery and Evidence Collection To

study various threats associated with security and information warfare To study the tools and tactics associated with cyber forensics

UNIT I INTRODUCTION TO COMPUTER FORENSICS 9 Computer Forensics Fundamentals – Types of Computer Forensics Technology Types of Vendor

and Computer Forensics Services - Fighting against Macro Threats – Information Warfare Arsenal

– Tactics of the Military – Tactics of Terrorist and Rogues – Tactics of Private Companies

UNIT II RECOVERY AND EVIDENCES 9 Data Recovery – Evidence Collection and Data Seizure – Duplication and Preservation of Digital

Evidence – Computer Image Verification and Authentication - Discover of Electronic Evidence –

Identification of Data – Reconstructing Past Events – Networks

UNIT III ETHICAL HACKING 9 Hacking windows – Network hacking – Web hacking – Password hacking. A study on various

attacks: Input validation attacks – SQL injection attacks – Buffer overflow attacks - Privacy attacks

UNIT IV COMPUTER FRAUD 9 Fundamentals of Computer Fraud – Threat concepts – Framework for predicting inside attacks – Managing the threat – Architecture strategies for computer fraud prevention – Protection of Web sites

UNIT V INTRUSION DETECTION SYSTEM 9 Intrusion detection system – The Future – Arsenal – Surveillance Tools – Victims and Refugees

– Advanced Computer Forensics

TOTAL : 45

TEXTBOOKS:

1. John R. Vacca, ―Computer Forensics‖, Firewall Media, 2004. 2. Ankit Fadia ―Ethical Hacking‖ second edition Macmillan India Ltd, 2006.

REFERENCE BOOKS:

1. Chad Steel, ―Windows Forensics‖, W iley India, 2006. 2. Majid Yar, ―Cybercrime and Society‖, Sage Publications, 2006. 3. Robert M Slade, ―Software Forensics‖, Tata McGrawHill, 2004.

UIT12656/UCS12655 PERVASIVE COMPUTING L T P C

(Common to IT & CSE) 3 0 0 3

AIM: The course introduces the students to the basic principles of pervasive computing. OBJECTIVES:

To be aware of the concepts of pervasive computing To have an exposure of pervasive computing and web based applications

To have an understanding of the middleware, PDA and user interface in pervasive

computing

UNIT I PERVASIVE COMPUTING APPLICATION 9

Pervasive Computing devices and Interfaces – Device technology trends, pervasive computing

principles Pervasive computing infrastructure-applications- Device Technology - Hardware,

Human-machine Interfaces, Biometrics, and Operating systems– Device Connectivity – Protocols,

Security, and Device Management- Pervasive Web Application architecture

UNIT II PERVASIVE COMPUTING AND WEB BASED APPLICATIONS 9 XML and its role in Pervasive Computing - Wireless Application Protocol (WAP) Architecture

and Security – Wireless Mark-Up language (WML) –Introduction

UNIT III MIDDLEWARE COMPONENTS 9 Programming consumer devices, Smart card programming, messaging components, Database

components

UNIT IV PDA IN PERVASIVE COMPUTING 9

Introduction - PDA software Components, Standards, emerging trends – PDA Device

characteristics - PDA Based Access Architecture

UNIT V USER INTERFACE ISSUES IN PERVASIVE COMPUTING 9 Architecture - Smart Card- based Authentication Mechanisms – Wearable computing

Architecture

TOTAL : 45

TEXT BOOKS :

1. Jochen Burkhardt, Horst Henn, Stefan Hepper, Thomas Schaec, Klaus Rindtorff, "Pervasive

Computing Technology and Architecture of Mobile Internet Applications", Addison Wesley, New

Delhi, 2002

REFERENCE BOOKS:

1.Uwe Hansman, Lothat Merk, Martin S Nicklous, Thomas Stober, "Principles of Mobile

Computing", Springer- Verlag, New Delhi, 2003

UIT12657/UCS12656 UNIX INTERNALS L T P C

(Common to IT & CSE) 3 0 0 3

AIM: To understand the kernel, I/O and files, process control, scheduling and memory management

policies in Unix. OBJECTIVES:

To get through understanding of the kernel To understand the file organization and management.

To know the various system calls To have knowledge of process architecture, process control & scheduling and memory

management.

UNIT I INTRODUCTION 9

Unix Operating system – Unix Commands – Vi – Editors – Shell Programming. Introduction to the

Kernel-Architecture - System Concepts-Data Structures- System Administration.

UNIT II THE BUFFER CACHE 9

The Buffer Cache-Headers-Buffer Pool-Buffer Retrieval-Reading and Writing Disk

Blocks - Advantages and Disadvantages. Internal Representation of Files-Inodes- Structure-Directories-Path Name to Inode- Super Block-Inode Assignment-Allocation of Disk

Blocks-OtherFileTypes.

UNIT III SYSTEM CALLS FOR FILE SYSTEM 9

System Calls for the File System-Open-Read-Write-Lseek-Close-Create-Special files

Creation -Change Directory and Change Root-Change Owner and Change Mode-Stat-

Fstat-Pipes-Dup-Mount-Unmount-Link-Unlink-FileSystemAbstraction-Maintenance

UNIT IV STRUCTURE OF PROCESSES 9

The System Representation of Processes-States-Transitions-System Memory-Context

of a Process-Saving the Context-Manipulation of a Process Address Space-Sleep Process Control-signals-Process Termination-Awaiting-Invoking other Programs-The Shell-

System Boot and the INITProcess

UNIT V PROCESS SCHEDULING AND MEMORY MANAGEMENT TECHNIQUES 9

Memory Management Policies-Swapping-Demand Paging-a Hybrid System-I/O

Subsystem-Driver Interfaces-Disk Drivers-Terminal Drivers.

TOTAL:45

TEXT BOOK:

1. Maurice J. Bach, "The Design of the Unix Operating System", Pearson Education, 2002.

REFERENCE BOOKS:

1. Uresh Vahalia, "UNIX Internals: The New Frontiers", Prentice Hall, 2000. 2. John Lion, "Lion's Commentary on UNIX", 6th edition, Peer-to-Peer Communications, 2004. 3. Daniel P. Bovet & Marco Cesati, ―Understanding the Linux Kernel‖, O‘REILLY, Shroff

Publishers &Distributors Pvt. Ltd, 2000.

4. M. Beck et al, ―Linux Kernel Programming‖, Pearson Education Asia, 2002

UBA12651 E- COMMERCE L T P C

3 0 0 3 AIM: To expose the students to the different business strategies involving electronic commerce which

to be used in business in a global environment. OBJECTIVES:

To learn the advancements of electronic commerce which has become a compelling

necessity in the present day communication based commerce. To understood the key issues involved in managing electronic commerce initiatives.

UNIT I TELECOMMUNICATION NETWORKS 9 Telecommunication Networks : Introduction - LAN - WAN- Internet - Electronic Commerce - Brief

history of Electronic Commerce - Advantages and Limitations of Electronic Commerce - Types of

Electronic commerce - Integrating Electronic Commerce

UNIT II THE INTERNET AND THE WORLD WIDE WEB 9 The Internet and the World Wide Web: The Internet Today - History of the Web - Unique benefits

of the Internet - Internet Architecture - World Wide Web - Concepts and Technology - Creating an

Effective Web – Web Site Usability – Connecting With Customers- Launching a Business on the

Internet.

UNIT III ELECTRONIC PAYMENT SYSTEMS 9 Electronic Payment Systems: Overview of the Electronic payment Technology - Requirements

for Internet Based payments - Electronic payment Medias -. Electronic Cash – Electronic

Wallets – Stored-Value Cards – Internet Technologies and the Banking Industry – Planning for

E-Commerce Initiatives – Strategies for Developing E-commerce

UNIT IV E – SECURITY 9 E-security: Security in the cyberspace - Designing for security - Virus - Security Protection and

Recovery - Encryption - The Basic Algorithm System - Authentication and Trust – Key

management - Internet Security Protocols and Standards - – cryptography –authentication.

UNIT V WEB BASED BUSINESS 9 Web based Business: Business-to-Business Electronic Commerce-Intranets and Extranets -

Intranets and Supply Chain Management - Legal and Ethical issues – web based marketing –

search engines and Directory registration – online advertisements – website design issues

TOTAL : 45

REFERENCE BOOKS: 1. Elias. M. Awad, " Electronic Commerce", Prentice - Hall of India Pvt Ltd, 2002. 2. Ravi Kalakota, Andrew B. Whinston, "Electronic Commerce - A Manager's guide", Addison -

Wesley, 2000.

3. Efraim Turban, Jae Lee, David King, H.Michael Chung, ―Electronic Commerce – A Managerial

Perspective", Addison - Wesley, 2001.

4. Elias M Award, ―Electronic Commerce from Vision to Fulfillment‖, 3rd Edition, PHI, 2006 5. Judy Strauss, Adel El-Ansary, Raymond Frost, ―E-Marketing‖, 3RD Edition, Pearson

Education, 2003

6. Ravi Kalakota, Andrew B. Whinston, "Frontiers of Electronic Commerce‖, Addition – Wesley,

2000.

7. Gary P Schneider ―Electronic commerce‖, Thomson learning & James T Peny Cambridge USA, 2001.

8.Manlyn Greenstein and Miklos ―Electronic commerce‖ McGraw-Hill, 2002.. 9. Brenda Kienew E commerce Business Prentice Hall, 2001.

UBA12652 INTELLECTUAL PROPERTY RIGHTS L T P C

3 0 0 3 AIM: This course will provide the student with the underlying principles and basic concepts of

Intellectual property rights. OBJECTIVES:

To provide insight on latest technology trends, patents, copyright, strategies, intellectual

property laws, types of intellectual property rights. To allow the students to develop their own framework for analyzing and understanding

IPR. UNIT I BASICS OF IPR 9 An Overview of Intellectual Property (IP) - Importance - Protection of IPR - Forms of Industrial

Properties- Need for IPR- General Framework of IPR- IPR Legislations in India-Tangible and

Intangible Properties-Types of IPRs - Agreement on trade related aspects of IPR- Establishment

of WIPO, General Agreement on Trade and Tariff (GATT).

UNIT II PATENTED INVENTION AND ADMINISTRATION 10 Introduction to Patents – Overview, Historical development, concepts on Novelty, Utility, Non-

Obviousness. Patentable and Non Patentable Inventions. Types of patent application in India-

Guidelines for Registration and Patent-Procedure for Filing of patents. Acquisition of patent rights.

Compulsory Licenses, patent offices in India and jurisdiction.

UNIT III TRADE MARK 8 Concept, purpose ,characteristics and functions of trademark- Trademark act- Trade secret-

Guidelines for Registration of Trademark- Registration procedure- NICE Classification- Sales,

transfer and Licensing of Trademark

UNIT IV COPYRIGHTS AND RELATED ISSUSES 9 Concept of copyright- Copyright and geographical indications- Works protected and not protected

by copyright- India copyright law- Rights conferred by copyright- Copyright infringement-

Computer program and database copyright- Registration of copyright in India-Copyright in digital

era.

UNIT V APPLICATIONS 9 IP Management- IPR Managers-IPR Audit- Trademark audit- Range of IP services-Classification

of IP Services- IPR Regime- Important principles of IP Management- Sectoral IPR- Enforcement

of Intellectual Property Rights- Protection against unfair competition- Patent agents-Examiner of

Patents.

TOTAL : 45

REFERENCE BOOKS:

1. P. Narayanan, ―Intellectual property Rights‖, Eastern law House, Third Edition, 2002. 2. Prof.A.Chandrasekaran, ―Intellectual property law‖, C.Sitaraman & Co, Pvt. Ltd., 2004. 3. Prabuddha Ganguli, ―Intellectual Property Rights‖, TMH, 2001. 4. Subbaram N-R- ―Handbook of Indian Patent Law and Practice‖, S.Viswanathan (Printers

and Publishers) Pvt Ltd, 1998.

5. Dr.Radhakrishnan & Balasubramani, ―Intellectual Property Rights: Text and Cases‖, Excel

Books, 2008. 6. Richard Stim, ―Intellectual Property: Patents, Trademarks and Copyrights‖, Cengage

Learning,2000.

UBA12653 TOTAL QUALITY MANAGEMENT L T P C

(Common to IT & CSE) 3 0 0 3 AIM: This course will provide the student with the underlying principles and techniques of Total Quality

Management (TQM) with emphasis on their application to technical organizations. OBJECTIVES:

To help students to develop a working knowledge of the best practices in Quality and

Process Management. To impart knowledge on the quality management process and key quality management

activities.

UNIT I INTRODUCTION TO QUALITY MANAGEMENT 9 Basic concepts of TQM -Definition of TQM – TQM Framework- reasons for adopting TQM.

Benefits, Quality-vision, mission and policy statements. , Historical Review, Principles of TQM,

Barriers to TQM implementation-Dimensions of product and services, cost of quality UNIT II TQM PRINCIPLES AND PHILOSOPHIES 10 Customer satisfaction – Customer Perception of Quality, Customer Complaints, Service Quality,

Customer Retention, Employee Involvement – Motivation, Empowerment, Teams, Recognition

and Reward, Performance Appraisal, Benefits, Continuous Process Improvement. PDCA cycle,

5S, Kaizen - JIT, POKAYOKE -The Contributions of Deming, Juran Crosby.

UNIT III STATISTICAL PROCESS CONTROL (SPC) 9 The seven tools of quality- Overview of statistical process control -New seven management tools-

Process capability-meaning, significance and measurement – Six-sigma: Concepts, methodology,

applications to manufacturing, service sector including IT industries. UNIT IV TQM TOOLS AND TECHNIQUES 8 Bench marking –Reason to bench mark, bench mark process –FEMA –Stages ,types ,Business

process re-engineering(BPR)-Principles, applications and process. Total Productivity Maintenance

TPM)

UNIT V QUALITY SYSTEMS 9 Need for ISO 9000 and other quality Systems, ISO 9000-2000 Quality Systems-elements, ISO

documentation procedures, Quality Auditing, Introduction to ISO 14000 concepts, Requirements

and benefits and OSHAS 18000, Implementation of TQM

TOTAL : 45

TEXT BOOKS:

1. Dale H.Besterfiled, et al., ―Total Quality Management‖, Pearson Education, Inc. 2003. (Indian reprint

2004). ISBN 81-297-0260-6.

2. Shridhara Bhatk, 1st

Edition 2002, ―Total Quality Management‖, Himalaya Publications. REFERENCE BOOKS:

1. James R.Evans & William M.Lindsay, The Management and Control of Quality, (5th

Edition), South-

Western (Thomson Learning), 2002 (ISBN 0-324-06680-5).

2. Feigenbaum.A.V. ―Total Quality Management, McGraw Hill, 1991. 3. Oakland.J.S. ―Total Quality Management Butterworth – Hinemann Ltd., Oxford. 1989. 4. Narayana V. and Sreenivasan, N.S. Quality Management – Concepts and Tasks, New Age

International 1996.

5. Zeiri. ―Total Quality Management for Engineers Wood Head Publishers, 1991.

6. V.Jayakumar, ―Total quality management‖, 1st

Edition 2005, Lakshmi Publications

M.KUMARASAMY COLLEGE OF ENGINEERING, KARUR

(AUTONOMOUS)

REGULATIONS 2012

B.TECH. INFORMATION TECHNOLOGY

CURRICULUM FROM VII TO VIII SEMESTERS

(Applicable to the students admitted from the Academic year 2012-2013 onwards)

SEMESTER VII

Code No. Course Title L T P C

Maximum Marks

CIA ESE Total

THEORY

UIT12701 Cryptography and Network

Security 3 1 0 4 50 50 100

UIT12702 Multimedia Systems 3 0 0 3 50 50 100

UIT12703 Software Testing 3 0 0 3 50 50 100

E2 Elective – II 3 0 0 3 50 50 100

E3 Elective – III 3 0 0 3 50 50 100

PRACTICAL

UIT12704P Mobile Computing

Laboratory 0 0 3 2 50 50 100

UIT12705P Multimedia Systems

Laboratory 0 0 3 2 50 50 100

UIT12706P Project work Phase-I 0 0 4 2 50 50 100

TOTAL 22 800

SEMESTER VIII

Code No. Course Title L T P C

Maximum Marks

CIA ESE Total

THEORY

UIT12801 Cloud Computing 3 0 0 3 50 50 100

E4 Elective – IV 3 0 0 3 50 50 100

E5 Elective – V 3 0 0 3 50 50 100

PRACTICAL

UIT12802P Project work Phase-II 0 0 24 12 100 100 200

TOTAL 21 500

LIST OF ELECTIVES FOR B.TECH INFORMATION TECHNOLOGY

SEMESTER VII

Code No. Course Title L T P C

UIT12751 Adhoc Networks 3 0 0 3

UIT12753 Fundamentals of Nanoscience 3 0 0 3

UIT12754 Grid Computing 3 0 0 3

UIT12755 Information Security 3 0 0 3

UIT12757 Network Programming and Management 3 0 0 3

UIT12758 Neural Networks 3 0 0 3

UIT12759 Parallel Computing 3 0 0 3

UIT127510 Software Quality Assurance 3 0 0 3

UIT127511 Theory Of Computation 3 0 0 3

UIT127512 User Interface Design 3 0 0 3

UBA12753 Enterprise Resource Planning 3 0 0 3

UBA12754 Principles of Management

3 0 0 3

SEMESTER VIII

Code No. Course Title L T P C

UIT12851 Advanced DBMS 3 0 0 3

UIT12852 Bio Informatics 3 0 0 3

UIT12853 Domain Engineering 3 0 0 3

UIT12854 Information Coding Techniques 3 0 0 3

UIT12855 Multi-Core Architecture and Programming 3 0 0 3

UIT12857 Service Oriented Architecture 3 0 0 3

UIT12858 Soft Computing 3 0 0 3

UIT12859 Software Project Management 3 0 0 3

UIT128510 Web Services 3 0 0 3

UIT128511 Wireless Networks 3 0 0 3

UBA12858 Professional Ethics

3 0 0 3

UEC12851 Digital Image Processing 3 0 0 3

SEMESTER-VII

UIT12701/UCS12701 CRYPTOGRAPHY AND NETWORK SECURITY L T P C (Common to IT & CSE) 3 1 0 4 AIM: To learn about wired and wireless network security with various cryptographic techniques, which include private and public keys algorithms along with attacks types. OBJECTIVES:

Understand OSI security architecture and classical encryption techniques.

Acquire fundamental knowledge on the concepts of finite fields and number theory.

Understand various block cipher and stream cipher models.

Describe the principles of public key cryptosystems, hash functions and digital signature. UNIT I INTRODUCTION & NUMBER THEORY 10 Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical Encryption techniques (Symmetric cipher model, substitution techniques, transposition techniques, steganography).FINITE FIELDS AND NUMBER THEORY: Groups, Rings, Fields-Modular arithmetic-Euclid‟s algorithm-Finite fields- Polynomial Arithmetic –Prime numbers-Fermat‟s and Euler‟s theorem-Testing for primality -The Chinese remainder theorem- Discrete logarithms. UNIT II BLOCK CIPHERS & PUBLIC KEY CRYPTOGRAPHY 10 Data Encryption Standard-Block cipher principles-block cipher modes of operation-Advanced Encryption Standard (AES)-Triple DES-Blowfish-RC5 algorithm. Public key cryptography: Principles of public key cryptosystems-The RSA algorithm-Key management - Diffie Hellman Key exchange-Elliptic curve arithmetic-Elliptic curve cryptography. UNIT III HASH FUNCTIONS AND DIGITAL SIGNATURES 8 Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and MAC –MD5 - SHA - HMAC – CMAC - Digital signature and authentication protocols – DSS – EI Gamal – Schnorr. UNIT IV SECURITY PRACTICE & SYSTEM SECURITY 8 Authentication applications – Kerberos – X.509 Authentication services - Internet Firewalls for Trusted System: Roles of Firewalls – Firewall related terminology- Types of Firewalls - Firewall designs - SET for E-Commerce Transactions. Intruder – Intrusion detection system – Virus and related threats – Countermeasures – Firewalls design principles – Trusted systems – Practical implementation of cryptography and security. UNIT V E-MAIL, IP & WEB SECURITY 9 E-mail Security: Security Services for E-mail-attacks possible through E-mail - establishing keys privacy-authentication of the source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME. IPSecurity: Overview of IPSec - IP and IPv6-Authentication Header-Encapsulation Security Payload (ESP)-Internet Key Exchange (Phases of IKE, ISAKMP/IKE Encoding).

Web Security: SSL/TLS Basic Protocol-computing the keys- client authentication-PKI as deployed by SSLAttacks fixed in v3- Exportability-Encoding-Secure Electronic Transaction (SET).

TOTAL: 45 PERIODS TEXT BOOKS: 1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March 2013.

(UNIT I,II,III,IV).

2. Charlie Kaufman, Radia Perlman and Mike Speciner, ―Network Security”, Prentice Hall of India,

2002. (UNIT V).

REFERENCES: 1. Behrouz A. Ferouzan, ―Cryptography & Network Security‖, Tata Mc Graw Hill, 2007.

2. Man Young Rhee, ―Internet Security: Cryptographic Principles‖, ―Algorithms and Protocols‖, Wiley

Publications, 2003.

3. Charles Pfleeger, ―Security in Computing‖, 4th Edition, Prentice Hall of India, 2006.

4. Ulysess Black, ―Internet Security Protocols‖, Pearson Education Asia, 2000.

5. Charlie Kaufman and Radia Perlman, Mike Speciner, ―Network Security, Second Edition, Private

Communication in Public World‖, PHI 2002.

6. Bruce Schneier and Neils Ferguson, ―Practical Cryptography‖, First Edition, Wiley Dreamtech India

Pvt Ltd, 2003.

7. Douglas R Simson ―Cryptography – Theory and practice‖, First Edition, CRC Press, 1995.

8. http://nptel.ac.in/.

UIT12702/UCS12702 MULTIMEDIA SYSTEMS L T P C (Common to CSE & IT) 3 0 0 3

AIM: To explore the range of technologies that shape this world, investigate the next generation of devices and interfaces, and explore how these might shape the applications and entertainment of the future. OBJECTIVES:

To develop, design and implement two and three dimensional graphical structures

To enable students to acquire knowledge on Multimedia compression and animations

To learn Creation, Management and Transmission of Multimedia objects

UNIT – I INTRODUCTION AND QOS 9

QOS Requirements and Constraints - Concepts – Resources - Establishment Phase – Run -Time

Phase - Management Architectures

UNIT – II OPERATING SYSTEMS 9

Real-Time Processing – Scheduling – Interprocess Communication-Memory and Management – Server

Architecture - Disk Management.

UNIT – III FILE SYSTEMS AND NETWORKS 9

Traditional and Multimedia File Systems-Caching Policy-Batching-Piggy backing-Ethernet-Gigabit

Ethernet-Token Ring-100VG Any LAN-Fiber Distributed Data Interface (FDDI)- ATM Networks-

MANWAN.

UNIT – IV COMMUNICATION 9

Transport Subsystem-Protocol Support for QOS-Transport of Multimedia-Computer Supported

Cooperative Work-Architecture-Session Management-MBone Applications.

UNIT – V SYNCHRONIZATION 9

Synchronization in Multimedia Systems-Presentation-Synchronization Types-Multimedia

Synchronization Methods-Case Studies-MHEG-MODE-ACME.

TOTAL: 45

REFERENCES:

1. Ralf Steinmetz and Klara Nahrstedt, ―Multimedia Systems‖, Springer, I Edition 2004.

2. Ralf Steinmetz and Klara Nahrstedt , Media Coding and Content Processing, Prentice hall,2002

3. Vaughan T, Multimedia, Tata McGraw Hill, 1999.

4. Mark J.B., Sandra K.M., Multimedia Applications Development using DVI technology,McGraw Hill,

1992.

5. K. R. Rao, Zoran S. Bojkovic, Dragorad A. Milovacovic, D. A. Milovacovic , Multimedia

6. Communication Systems: Techniques, Standards, and Networks, Prentice Hall, 1st Edition,2002

7. Ze-Nian Li and Mark S. Drew, Fundamentals of Multimedia, Pearson, 2004.

UIT12703/UCS127511 SOFTWARE TESTING L T P C (Common to IT & CSE) 3 0 0 3 AIM: To provide students with skills and knowledge critical to the successful testing of software. OBJECTIVES:

Expose the criteria for test cases.

Learn the design of test cases.

Be familiar with test management and test automation techniques.

Be exposed to test metrics and measurements.

UNIT I INTRODUCTION 9 Testing as an Engineering Activity – Testing as a Process – Testing axioms – Basic definitions – Software Testing Principles – The Tester‟s Role in a Software Development Organization – Origins of Defects – Cost of defects – Defect Classes – The Defect Repository and Test Design – Defect Examples – Developer/Tester Support of Developing a Defect Repository – Defect Prevention strategies. UNIT II TEST CASE DESIGN 9 Test case Design Strategies – Using Black Bod Approach to Test Case Design – Random Testing – Requirements based testing – Boundary Value Analysis – Equivalence Class Partitioning – State-based testing – Cause-effect graphing – Compatibility testing – user documentation testing – domain testing – Using White Box Approach to Test design – Test Adequacy Criteria – static testing vs. structural testing – code functional testing – Coverage and Control Flow Graphs – Covering Code Logic – Paths – code complexity testing – Evaluating Test Adequacy Criteria. UNIT III LEVELS OF TESTING 9 The need for Levers of Testing – Unit Test – Unit Test Planning – Designing the Unit Tests – The Test Harness – Running the Unit tests and Recording results – Integration tests – Designing Integration Tests – Integration Test Planning – Scenario testing – Defect bash elimination System Testing – Acceptance testing – Performance testing – Regression Testing – Internationalization testing – Ad-hoc testing – Alpha, Beta Tests – Testing OO systems – Usability and Accessibility testing – Configuration testing – Compatibility testing – Testing the documentation – Website testing. UNIT IV TEST AMANAGEMENT 9 People and organizational issues in testing – Organization structures for testing teams – testing services – Test Planning – Test Plan Components – Test Plan Attachments – Locating Test Items – test management – test process – Reporting Test Results – The role of three groups in Test Planning and Policy Development – Introducing the test specialist – Skills needed by a test specialist – Building a Testing Group. UNIT V TEST AUTOMATION 9 Software test automation – skill needed for automation – scope of automation – design and architecture for automation – requirements for a test tool – challenges in automation – Test metrics and measurements – project, progress and productivity metrics.

TOTAL: 45 PERIODS TEXT BOOKS:

1. Srinivasan Desikan and Gopalaswamy Ramesh, ―Software Testing – Principles and Practices‖, Pearson Education, 2006.

2. Ron Patton, ― Software Testing‖, Second Edition, Sams Publishing, Pearson Education, 2007. REFERENCES: 1. Ilene Burnstein, ― Practical Software Testing‖, Springer International Edition, 2003. 2. Edward Kit,‖ Software Testing in the Real World – Improving the Process‖, Pearson Education, 1995. 3. Boris Beizer,‖ Software Testing Techniques‖ – 2nd Edition, Van Nostrand Reinhold, New York, 1990. 4. Aditya P. Mathur, ―Foundations of Software Testing _ Fundamental Algorithms and Techniques‖, Dorling Kindersley (India) Pvt. Ltd., Pearson Education, 2008.

UIT12704P/UCS12706P MOBILE COMPUTING LABORATORY L T P C (Common to CSE & IT) 0 0 3 2

AIM: To make the students to be familiar with the basic concepts of Mobile Communication and Mobile devices. OBJECTIVES: • To know the components and structure of mobile application development frameworks for Android

and Windows OD based mobiles

• To understand how to work with various mobile application development frameworks

• To learn the basic and important design concepts and issues in development of mobile applications

• To understand the capabilities and limitations of mobile devices

1. Develop an application that uses GUI components, Font and Colours

2. Develop an application that uses Layout Managers and event listeners.

3. Develop a native calculator application.

4. Write an application that draws basic graphical primitives on the screen.

5. Develop an application that makes use of database.

6. Develop an application that makes use of RSS Feed.

7. Implement an application that implements Multi threading

8. Develop a native application that uses GPS location information.

9. Implement an application that writes data to the SD card.

10. Implement an application that creates an alert upon receiving a message.

11. Write a mobile application that creates alarm clock

UIT12705P/UCS12707P MULTIMEDIA SYSTEMS LABORATORY L T P C (Common to CSE & IT) 0 0 3 2

AIM:

To acquire knowledge on multimedia concepts using various tools in Adobe Photoshop and

Macromedia Flash. OBJECTIVES: • To apply and display the transformations in the output for various multimedia concepts

• To gain knowledge on the resources and tools of photoshop and flash

• To have hands on training in various tools in Adobe Photoshop and Flash

• To emphasize on the practical issues in designing using multimedia concepts

PHOTOSHOP

1. Perform Copy, Cut, Paste, Move functions using Selection tools.

2. Perform Copy, Paste Into, Move Tool, Zoom Tool, Transform, Opacity using Lasso- and

Polygonal Lasso Selection Tools.

3. Refine the picture and perform Invert selection using Quick Select Tool (or Magic Wand Tool).

4. Format several layers of a picture using Paint Bucket Tool, Color Picker, Brush Tool

5. Use Layers and Eraser Tool in a picture.

6. Use Text Tool to add text to the speech bubbles and Use the Transform function and the Move

Tool in cartoons.

7. Perform selection type and color balance using selection tools on a picture.

8. Use crop and canvas tool in a picture.

9. Use Clone stamp tool and smudge tool in a picture.

10. Use filters in a picture.

FLASH

1. Perform motion tweening

2. Create a 24 spokes on a wheel

3. Change and shape an object using a shape tweening concept

4. Working on layers

5. Masking layers

UIT12751/UCS12751 ADHOC NETWORKS L T P C

(Common to CSE & IT) 3 0 0 3 AIM: To introduce students to the theory, architecture, protocols and techniques in wireless and mobile

networks.

OBJECTIVES:

To introduce students to the mathematical models and network protocol designs in wireless

networks

To provide a systematic exposition of network protocols and their cross – layer interactions

To provide a broad perspective on the active research areas in wireless adhoc networks

UNIT I INTRODUCTION 9

Introduction-Fundamentals of Wireless Communication Technology - The Electromagnetic Spectrum -

Radio Propagation Mechanisms - Characteristics of the Wireless Channel - IEEE 802.11 Standard –

Origin Of Ad hoc: Packet Radio Networks - Technical Challenges - Architecture of PRNETs -

Components of Packet Radios – Ad hoc Wireless Networks -What is an Ad Hoc Network?

Heterogeneity in Mobile Devices - Wireless Sensor Networks - Traffic Profiles - Types of Ad hoc

Mobile Communications - Types of Mobile Host Movements - Challenges Facing Ad Hoc Mobile

Networks

UNIT II AD HOC ROUTING PROTOCOLS 9

Introduction - Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks - Classifications

of Routing Protocols -Table-Driven Routing Protocols - Destination Sequenced Distance Vector

(DSDV) - Wireless Routing Protocol (WRP) - Cluster Switch Gateway Routing (CSGR) - On- Demand

Approaches - Ad Hoc On-Demand Distance Vector Routing (AODV) - Dynamic Source Routing

(DSR) -Temporally Ordered Routing Algorithm (TORA) – Hybrid Routing - Zone Routing Protocol

(ZRP)

UNIT III TRANSPORT LAYER AND SECURITY PROTOCOLS 9

Introduction - Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless Networks – Design

Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks -Classification of Transport Layer

Solutions - TCP Over Ad Hoc Wireless Networks - Security in Ad Hoc Wireless Networks - Network

Security Requirements - Issues and Challenges in Security Provisioning - Network Security Attacks -

Key Management - Secure Routing in Ad Hoc Wireless Networks – Security-Aware Ad Hoc routing

protocol – Security-Aware AODV UNIT IV QUALITY OF SERVICE 9 Introduction - Issues and Challenges in Providing QoS in Ad Hoc Wireless Networks -Classifications of

QoS Solutions - MAC Layer Solutions - Network Layer Solutions - QoS Frameworks for Ad Hoc

Wireless Networks

UNIT V ENERGY MANAGEMENT 9 Introduction - Need for Energy Management in Ad Hoc Wireless Networks - Classification of Energy

Management Schemes – Battery Management Schemes - Transmission Power Management Schemes

- System Power Management Schemes

TOTAL: 45 HOURS

TEXT BOOK:

1. 1. C.Siva Ram Murthy and B.S. Manoj ―Ad Hoc Wireless Networks: Architectures and

Protocols‖, Prentice Hall PTR, 2012.

REFERENCE BOOKS:

1. Feng ZHAO and Leonidas GUIBAS, Wireless Sensor Networks: An Information Processing

Approach, Morgan Kaufman Publishers, 2012.

2. C.K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall PTR 2008.

3. Charles E. Perkins, Ad Hoc Networking, Addison Wesley, 2008.

UIT12753 / UCS12856 FUNDAMENTALS OF NANOSCIENCE L T P C

(Common to IT & CSE) 3 0 0 3

AIM: To be able to critically evaluate nanoscience concepts and therefore be equipped to delve deeper into

nano science research.

OBJECTIVES:

To demonstrateunderstanding techniques of microscopy for investigations on the nanoscale

To acquire knowledge of basic approaches to synthesize inorganic colloidal nanoparticles and

their self-assembly in solution and surfaces

To understand and describe 8the use of unique optical properties of nanoscale metallic

structures for analytical and biological applications

UNIT I INTRODUCTION 10 Nanoscale Science and Technology- Implications for Physics, Chemistry, Biology and Engineering-

Classifications of nanostructured materials- nano particles- quantum dots, nanowires-ultra-thinfilms-

multilayered materials. Length Scales involved and effect on properties: Mechanical, Electronic,

Optical, Magnetic and Thermal properties. Introduction to properties and motivation for study

(qualitative only).

UNIT II PREPARATION METHODS 10 Bottom-up Synthesis-Top-down Approach: Precipitation, Mechanical Milling, Colloidal routes, Self-

assembly, Vapour phase deposition, MOCVD, Sputtering, Evaporation, Molecular Beam Epitaxy,

Atomic Layer Epitaxy, MOMBE.

UNIT III PATTERNING AND LITHOGRAPHY FOR NANOSCALE DEVICES 5 Introduction to optical/UV electron beam and X-ray Lithography systems and processes, Wet etching,

dry (Plasma /reactive ion) etching, Etch resists-dip pen lithography

UNIT IV PREPARATION ENVIRONMENTS 10 Clean rooms: specifications and design, air and water purity, requirements for particular processes,

Vibration free environments: Services and facilities required. Workingpractices, sample cleaning,

Chemical purification, chemical and biological contamination, Safety issues, flammable and toxic

hazards, biohazards.

UNIT V CHARACTERISATION TECHNIQUES 10 X-ray diffraction technique, Scanning Electron Microscopy - environmental techniques, Transmission

Electron Microscopy including high-resolution imaging, Surface Analysis techniques- AFM, SPM, STM,

SNOM, ESCA, SIMS-Nanoindentation - Quantum dots - Nano wires – Nano tubes - 2D and 3D films

TOTAL:45 HOURS

TEXTBOOKS:

1. A.S. Edelstein and R.C. Cammearata, eds., Nanomaterials: Synthesis, Properties and Applications,

(Institute of Physics Publishing, Bristol and Philadelphia, 1996)

2. N John Dinardo, Nanoscale characterization of surfaces & Interfaces, Second edition, Weinheim

Cambridge, Wiley-VCH, 2000

REFERENCEBOOKS:

1. G Timp (Editor), Nanotechnology, AIP press/Springer, 1999

2. AkhleshLakhtakia (Editor) The Hand Book of Nano Technology, ―NanometerStructure‖, Theory,

Modeling and Simulations. Prentice-Hall of India (P) Ltd, New Delhi, 2007.

UIT12754/UCS12755 GRID COMPUTING L T P C (Common to CSE & IT) 3 0 0 3

AIM: The aim is to introduce the basics of grid computing and to enable designing of efficient grid services

infrastructure.

OBJECTIVES:

To introduce the basic concepts of grid computing

To introduce the tools used for designing grid computing infrastructure

To understand the advantages and limitations of distributed grid computing

UNIT I INTRODUCTION AND OVERVIEW OF GRID COMPUTING 8

Early Grid Activities-Current Grid Activities-An Overview of Grid Business Areas-Grid Applications-Grid

Infrastructure

UNIT II WEB SERVICES AND RELATED TECHNOLOGIES 10

Service – Oriented Architecture-Web Service Architecture-XML, Related Technologies, and Their

Relevance to Web services-XML Messages and Enveloping-Service Message Description

Mechanisms-Relationship between Web Service and Grid Service – Web Service Interoperability and

the Role of the WS-I Organization

UNIT III DISTRIBUTED OBJECT TECHNOLOGY FOR GRID COMPUTING (OGSA) 9

Introduction to Open Grid Services Architecture (OGSA) - Commercial Data Center- National Fusion

Collaboratory- The OGSA Platform Components

UNIT IV OPEN GRID SERVICES INFRASTRUCTURE (OGSI) 9

Introduction-Grid Services-A High-Level Introduction to OGSI – Introduction to Service Data Concepts -

Grid Service: Naming and Change Management Recommendations.

UNIT V OGSA BASIC SERVICES AND THE GRID COMPUTING TOOLKITS 9

Common Management Model (CMM)-Security Architecture- GLOBUS GT3 Toolkit: Architecture

GLOBUSGT3 Toolkit: - Architecture, Programming model, High level services.

.

TOTAL: 45 HOURS

TEXT BOOK:

1.Joshy Joseph & Craig Fellenstein, ―Grid Computing‖, Pearson/PHI PTR-2003.

REFERENCE BOOK:

1.Ahmar Abbas, ―Grid Computing: A Practical Guide to technology and Applications‖, Charles Rivermedia – 2003. ONLINE REFERENCES http://www.cs.uiowa.edu/~jni/GC/ The TeraGrid: http://www.teragrid.org The NSF Middleware initiative: http://www.nsf-middleware.org The Globus Project: http://www.globus.org The Grid Portal Toolkit (Grid Port ): http://www.gridport.net

The Open Grid Computing Environments Consortium: http://www.ogce.org The GridSphere Project: http://www.gridsphere.org IBM Grid Pages: http://www-1.ibm.com/grid/ University of Texas UT Grid: http://utgrid.utexas.edu

UIT12755 INFORMATION SECURITY L T P C 3 0 0 3 AIM: To give an overview about the basics of security and cryptography and to give an exposure to

the security and security practices used in IT industries.

OBJECTIVES:

To learn the concepts and models of security

To design and implement symmetric and asymmetric cryptosystems

To elucidate various security standards followed at the network and application level

To measure the security risk encountered by an organization and the techniques to handle the risk

To learn the concepts of secured software development

UNIT I SECURITY – AN OVERVIEW 9

Basics of Security – CIA Triad – Threats, Attacks and Controls – Aspects of Security – Legal,

Ethical and Professional – Security Models – Depth of Security _ Need for Security at multiple

levels- Security Policies – Role of Trust, Bell-LaPadula model – Biba Integrity model – Chinese

Wall model – Malicious Logic- Viruses, Worms, Logic Bombs – Notion of Trust

UNIT II CRYPTOGRAPHY 9

Classical Cryptosystems – Substitution and Transposition – Blowfish and AES – Public Key

Cryptography – RSA and ELGamal algorithms – Authentication and Key Exchange – Biometric

authentication – Diffie Hellman and Needem Schroeder algorithms – Digital Signatures –

Message Digest – Certificates – Directories and Revocation of Keys and Certificates

UNIT III SECURITY STANDARDS 9

Public Key Infrastructure – Kerberos – X.509 – IPSec – Virtual Private Networks – E-Mail Security – PGP and PEM – Web Security – Secured DNS – SSL , TLS and SET – CoBIT Framework – Compliances – Credit Card Applications – GLBA – Standards – ISO 27000 UNIT IV SECURITY PRACTICES 9 Vulnerability Analysis – Flaw Hypothesis Methodology, NRL taxonomy and Aslam‘s model – Auditing – Anatomy of an Auditing System – Design of Auditing Systems – Posteriori Design – Auditing mechanisms – Risk Analysis and Management – Disaster Recovery Planning / Incident Response Planning – Intrusion Detection System

UNIT V SECURE DEVELOPMENT 9

Secured Coding – OWASP/SANS Top Vulnerabilities – Buffer Overflows – Incomplete mediation – XSS – Anti Cross Site Scripting Libraries – Canonical Data Format – Command

Injection – Redirection – Inference – Application Controls – Secured Software Development Life Cycle – Testing , Maintenance and Operation – Evaluation of Security Systems

TOTAL: 45 HOUR TEXT BOOKS:

1. Wade Trappe, Lawrence C Washington, ―Introduction to Cryptography with

Coding and Theory‖, Second Edition, Pearson, 2007.

2. Matt Bishop, ―Computer Security: Art and Science‖, Pearson, 2003.

REFERENCE BOOKS:

1. Charles Pfleeger, Shari Lawrence Pfleeger, Devin N Paul, ―Security in Coding‖,

Pearson, 2007.

2. Wenbo Mao, ―Modern Cryptography Theory and Practice‖, Pearson, 2004.

UIT12757 NETWORK PROGRAMMING AND MANAGEMENT L T P C

3 0 0 3

OBJECTIVES:

Learn the basics of socket programming using TCP Sockets.

Learn about Socket Options.

Learn to develop Macros for including Objects In MIB Structure.

Understand SNMPv1, v2 and v3 protocols & practical issues.

UNIT I SOCKETS AND APPLICATION DEVELOPMENT 9 Introduction to Socket Programming - System Calls - Address conversion functions - POSIX Signal Handling - Server with multiple clients - Boundary conditions - Server process Crashes, Server host Crashes, Server Crashes and reboots, Server Shutdown - I/O Multiplexing - I/O Models -TCP echo client/server with I/O Multiplexing UNIT II SOCKET OPTIONS 9 Socket options - getsockopt and setsockopt functions - Generic socket options - IP socket options - ICMP socket options - TCP socket options - Multiplexing TCP and UDP sockets - SCTP Sockets - SCTP Client/server - Streaming Example - Domain name system - gethostbyname, gethostbyaddr, getservbyname and getservbyport functions - Protocol Independent functions in TCP Client/Server Scenario UNIT III ADVANCED SOCKETS 9 IPv4 and IPv6 interoperability - Threaded servers - Thread creation and termination - TCP echo server using threads - Mutex - Condition variables - Raw sockets - Raw socket creation - Raw socket output - Raw socket input - ping program - traceroute program UNIT IV SIMPLE NETWORK MANAGEMENT 9 SNMP network management concepts - SNMPv1 - Management information - MIB Structure -

Object syntax - Standard MIB‟s - MIB-II Groups - SNMPv1 protocol and Practical issues. UNIT V SNMP V2, V3 AND RMO 9 Introduction to SNMPv2 - SMI for SNMPV2 - Protocol - SNMPv3 - Architecture and applications - Security and access control model - Overview of RMON.

TOTAL: 45 PERIODS TEXT BOOKS: 1. W. Richard Stevens, ―UNIX Network Programming Vol-I‖, Third Edition, PHI Pearson Education, 2003. 2. William Stallings, ―SNMP, SNMPv2, SNMPv3 and RMON 1 and 2‖, Third Edition, Pearson Edition, 2009.

REFERENCE:

1. D.E. Comer, ―Internetworking with TCP/IP Vol- III: Client-Server Programming and Application BSD Sockets Version‖, Second Edition, Pearson Edition, 2003.

UIT12758/UCS12756 NEURAL NETWORKS L T P C (Common to CSE & IT) 3 0 0 3

AIM: The course introduces the students to a range of topics in the field of artificial neural networks

and to provide familiarity with the associated applications.

OBJECTIVES:

To understand aspects of the social, intellectual, and neurobiological context of neural

networks

To have an understanding of a variety of neural network techniques

To have an awareness of the computational theory underlying NNs

UNIT I INTRODUCTION 9

Definition of ANN-Biological Neural Networks-Applications of ANN-Typical Architectures-Setting

the weights-Common Activation functions-Development of Neural Networks-McCulloch-Pitts

Neuron

UNIT II SIMPLE NEURAL NETS FOR PATTERN CLASSIFICATION 9 General discussion - Hebb net – Perceptron- Adaline - Backpropagation neural net-

Architecture- Delta Learning Rule Algorithm-Applications

UNIT III PATTERN ASSOCIATION 9

Training Algorithm for Pattern Association-Heteroassociative memory neural network

applications-Autoassociative net-Iterative Autoassociative net- Bidirectional Associative

Memory-Applications

UNIT IV NEURAL NETS BASED ON COMPETITION 9

Fixed Weights Competitive Nets- Kohonen‘s Self-Organizing Map –Applications- Learning

Vector Quantization-Applications-Counter Propagation Network- Applications.

UNIT V ADAPTIVE RESONANCE THEORY AND NEOCOGNITRON 9

Motivation – Basic Architecture- Basic Operation-ART1-ART2-Architecture- Algorithm-

applications-Analysis Probabilistic Neural Net-Cascade Correlation- Neocognitron:

Architecture—Algorithm-Applications.

TOTAL: 45 HOURS

TEXT BOOK:

1. LaureneV. Fausett, ―Fundamentals of Neural Networks-Architectures, Algorithms and Applications‖, Pearson Education, 2011.

REFERENCE BOOKS:

1. James. A. Freeman and David.M.Skapura, "Neural Networks Algorithms, Applications

and

Programming Techniques ",Pearson Education, Sixth Reprint, 2011.

2. Simon Haykin, "Neural Networks and Learning Methods”, PHI Learning Pvt. Ltd., 2011.

3. James A. Anderson, “An Introduction to Neural Networks”, PHI Learning Pvt. Ltd., 2011.

4. Martin T. Hagan, Howard B. Demuth, Mark Beale, “Neural Network Design”, Cengage

Learning,

Fourth Indian Reprint, 2010.

5. Bart Kosko, “Neural Networks and Fuzzy Systems-A Dynamical Approach to Machine

Intelligence”, PHI Learning Pvt. Ltd., 2010.

6. http://www.cs.stir.ac.uk/~lss/NNIntro/InvSlides.html

7. http://www.willamette.edu/~gorr/classes/cs449/intro.html

8. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-867-machine-

learning

9. http://ocw.mit.edu/courses/sloan-school-of-management/15-062-datamining-spring-

2003/lecture-notes/NeuralNet2002.pdf

UIT12759/UCS12757 PARALLEL COMPUTING L T P C (Common to CSE & IT) 3 0 0 3

AIM: The course introduces the students to Parallel programming paradigms and algorithms for shared and distributed memory computer architectures; performance analysis; use of shared infrastructure and applications in scientific computing. OBJECTIVES:

To be able to design for high – performance computing applications

To learn the issues in designing parallelism

To introduce the students to various cutting edge technologies in parallel computing UNIT I SCALABILITY AND CLUSTERING 9

Evolution of Computer Architecture – Dimensions of Scalability – Parallel Computer Models – Basic Concepts Of Clustering – Scalable Design Principles – Parallel Programming Overview – Processes, Tasks and Threads – Parallelism Issues – Interaction / Communication Issues – Semantic Issues In Parallel Programs.

UNIT II ENABLING TECHNOLOGIES 9 System Development Trends – Principles of Processor Design – Microprocessor Architecture Families – Hierarchical Memory Technology – Cache Coherence Protocols – Shared Memory Consistency – Distributed Cache Memory Architecture – Latency Tolerance Techniques – Multithreaded Latency Hiding. UNIT III SYSTEM INTERCONNECT 9

Basics of Interconnection Networks – Network Topologies and Properties – Buses, Crossbar

and Multistage Switches, Software Multithreading – Synchronization Mechanisms.

UNIT IV PARALLEL PROGRAMMING 9

Paradigms And Programmability – Parallel Programming Models – Shared Memory Programming. UNIT V MESSAGE PASSING PROGRAMMING 9

Message Passing Paradigm – Message Passing Interface – Parallel Virtual Machine.

TOTAL: 45 HOURS

TEXT BOOKS:

1. Kai Hwang and Zhi.Wei Xu, ―Scalable Parallel Computing‖, Tata Mc GrawHill,

New Delhi, 2003. 2. Michael J. Quinn, ―Parallel Computing Theory and Practice‖, Second Edition,

Tata

McGraw-Hill Publishing Co. Ltd., New Delhi, 2003. REFERENCE BOOKS:

1. David E. Culler & Jaswinder Pal Singh, ―Parallel Computing Architecture: A

Hardware/Software Approach‖, Morgan Kaufman Publishers, 1999.

2. Michael J. Quinn, ―Parallel Programming in C with MPI & OpenMP‖, Tata McGraw-Hill, New Delhi, 2003.

3. Kai Hwang, ―Advanced Computer Architecture‖ Tata McGraw-Hill, New Delhi, 2003.

UIT127510/UCS128510 SOFTWARE QUALITY ASSURANCE L T P C (Common to IT & CSE) 3 0 0 3 OBJECTIVES:

Understand the basic tenets of software quality and quality factors.

Be exposed to the Software Quality Assurance (SQA) architecture and the details of SQA components.

Understand of how the SQA components can be integrated into the project life cycle.

Be familiar with the software quality infrastructure.

Be exposed to the management components of software quality. UNIT I INTRODUCTION TO SOFTWARE QUALITY & ARCHITECTURE 9 Need for Software quality – Quality challenges – Software quality assurance (SQA) – Definition

and objectives – Software quality factors- McCall‟s quality model – SQA system and architecture – Software Project life cycle Components – Pre project quality components – Development and quality plans. UNIT II SQA COMPONENTS AND PROJECT LIFE CYCLE 9 Software Development methodologies – Quality assurance activities in the development process- Verification & Validation – Reviews – Software Testing – Software Testing implementations – Quality of software maintenance – Pre-Maintenance of software quality components – Quality assurance tools – CASE tools for software quality – Software maintenance quality – Project Management. UNIT III SOFTWARE QUALITY INFRASTRUCTURE 9 Procedures and work instructions - Templates - Checklists – 3S developmenting - Staff training and certification Corrective and preventive actions – Configuration management – Software change control – Configuration management audit -Documentation control – Storage and retrieval. UNIT IV SOFTWARE QUALITY MANAGEMENT & METRICS 9 Project process control – Computerized tools - Software quality metrics – Objectives of quality measurement – Process metrics – Product metrics – Implementation – Limitations of software metrics – Cost of software quality – Classical quality cost model – Extended model – Application of Cost model. UNIT V STANDARDS, CERTIFICATIONS & ASSESSMENTS 9 Quality manangement standards – ISO 9001 and ISO 9000-3 – capability Maturity Models – CMM and CMMI assessment methodologies - Bootstrap methodology – SPICE Project – SQA project process standards – IEEE st 1012 & 1028 – Organization of Quality Assurance – Department management responsibilities – Project management responsibilities – SQA units and other actors in SQA systems.

TOTAL : 45 PERIODS

TEXT BOOK: 1. Daniel Galin, ―Software Quality Assurance‖, Pearson Publication, 2009. REFERENCES: 1. Alan C. Gillies, ―Software Quality: Theory and Management‖, International Thomson Computer Press, 1997. 2. Mordechai Ben-Menachem ―Software Quality: Producing Practical Consistent Software‖, International Thompson Computer Press, 1997.

UIT127511/UCS12505 THEORY OF COMPUTATION L T P C (Common to IT & CSE) 3 0 0 3 OBJECTIVES:

Understand various Computing models like Finite State Machine, Pushdown Automata, and Turing Machine.

Be aware of Decidability and Un-decidability of various problems.

Learn types of grammars UNIT I FINITE AUTOMATA 9 Introduction- Basic Mathematical Notation and techniques- Finite State systems – Basic Definitions – Finite Automaton – DFA & NDFA – Finite Automaton with €- moves – Regular

Languages- Regular Expression – Equivalence of NFA and DFA – Equivalence of NDFA‟s with and without €-moves – Equivalence of finite Automaton and regular expressions –Minimization of DFA- - Pumping Lemma for Regular sets – Problems based on Pumping Lemma. UNIT II GRAMMARS 9 Grammar Introduction– Types of Grammar - Context Free Grammars and Languages– Derivations and Languages – Ambiguity- Relationship between derivation and derivation trees – Simplification of CFG – Elimination of Useless symbols - Unit productions - Null productions – Greiback Normal form – Chomsky normal form – Problems related to CNF and GNF UNIT III PUSHDOWN AUTOMATA 9 Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata – Equivalence of Pushdown automata and CFL - pumping lemma for CFL – problems based on pumping Lemma. UNIT IV TURING MACHINES 9 Definitions of Turing machines – Models – Computable languages and functions –Techniques for Turing machine construction – Multi head and Multi tape Turing Machines - The Halting problem – Partial Solvability – Problems about Turing machine- Chomskian hierarchy of languages. UNIT V UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS 9 Unsolvable Problems and Computable Functions – Primitive recursive functions – Recursive and recursively enumerable languages – Universal Turing machine. MEASURING AND CLASSIFYING COMPLEXITY: Tractable and Intractable problems- Tractable and possibly intractable problems - P and NP completeness - Polynomial time reductions.

TOTAL: 45 PERIODS

TEXT BOOKS: 1. Hopcroft J.E., Motwani R. and Ullman J.D, ―Introduction to Automata Theory, Languages and Computations‖, Second Edition, Pearson Education, 2008. (UNIT 1,2,3). 2. John C Martin, ―Introduction to Languages and the Theory of Computation‖, Tata McGraw Hill Publishing Company, New Delhi, Third Edition, 2007. (UNIT 4,5). REFERENCES: 1. Mishra K L P and Chandrasekaran N, ―Theory of Computer Science - Automata, Languages and Computation‖, Third Edition, Prentice Hall of India, 2004. 2. Harry R Lewis and Christos H Papadimitriou, ―Elements of the Theory of Computation‖, Second Edition, Prentice Hall of India, Pearson Education, New Delhi, 2003. 3. Peter Linz, ―An Introduction to Formal Language and Automata‖, Third Edition, Narosa Publishers, New Delhi, 2002. 4. Kamala Krithivasan and Rama. R, ―Introduction to Formal Languages, Automata Theory and Computation‖, Pearson Education 2009.

IT127512 / UCS128511 USER INTERFACE DESIGN L T P C (Common to IT & CSE - Recommended by Infosys) 3 0 0 3

AIM: The course aims to provide students with knowledge of the theoretical foundations of human

computer interaction; appreciation for human factors in software systems, and for what makes

an interface good; and practice in designing user-centered interfaces.

OBJECTIVES:

To provide in-depth understanding of the methods and techniques that can be utilized in

the design, implementation and testing of user interfaces

To develop critical capabilities that enable evaluation and selection of appropriate

methods and techniques for interface design

To engender practical abilities in visual and technical aspects of the design process

UNIT I INTRODUCTION 9

An Introduction and Overview – Defining the User Interface – Importance of Good Design –

Human Computer Interface – Characteristics of Graphical and Web User Interfaces – The GUI –

The Web User Interface – 10 Usability Heuristics for UID

UNIT II HUMAN COMPUTER INTERACTIONS 9 The User Interface Design Process – Human Characteristics in Design – Human

Considerations in Design – Understand the Business Function – Business Definition and

Requirement Analysis – Determining the Basic Business Function - Design Standards or Style

Guides – System Training and Documentation needs - Menus – Structures of Menus –

Functions of Menus – Contents of Menu – Formatting – Phrasing the Menu – Selecting Menu

Choices – Navigating Menus – Graphical Menus

UNIT III WINDOWS 9

Characteristics – Components – Presentation Styles – Types of windows – Window

Management – Organizing Window Functions – Window Operations – Web Systems – Device

Based Controls – Characteristics of Device Based Controls – Selecting the Proper Device

Based Controls – Screen Based Controls – Operable Controls – Text Entry / Read-Only

Controls – Selection Controls – Combination Entry – Custom Controls – Presentation Controls –

Other Operable Controls

UNIT IV MULTIMEDIA 9

Text for Web Pages – Providing Effective Feedback and Guidance and Assistance – Providing

the Proper Feedback – Guidance and Assistance – International Considerations – Accessibility

– Icons and Images – Multimedia – Coloring – Choosing the Proper Colors

UNIT V WINDOWS LAYOUT TEST 9

Usability Test – Purpose and Importance – Scope of Testing – Prototypes – Kinds of Tests –

Developing and Conducting the Test – Analyze , Modify and Retest – Evaluation

TOTAL: 45 HOURS

TEXT BOOKS: 1. Wilbert. O. Galitz, ―The Essential Guide to User Interface Design‖, Wiley - India, Second Edition, 2012.

2. Deborah Mayhew, ―The Usability Engineering Lifecycle‖, Morgan Kaufmann, 1999

REFERENCE BOOKS:

1. Ben Sheiderman, ―Design the User Interface‖, Pearson Education, 1998.

2. Alan Cooper, ―The Essential of User Interface Design‖, Wiley – Dream Tech Ltd 2002.

3. Sharp, Rogers, Preece, ‗Interaction Design‘, Wiley India Edition, 2007.

UBA12753 / UBA12854 ENTERPRISE RESOURCE PLANNING L T P C (Common to IT & CSE) 3 0 0 3

AIM: To understand the strategic importance of ERP in business process and how to create

competitive advantage from managerial point of view.

OBJECTIVES:

To understand the importance of Enterprise-wide systems to business operations

To understand basic concepts, tools and techniques of Enterprise Resource Planning

To understand issues of ERP architecture, design, development, implementation, and

project management

To gain exposure to enterprise software from SAP

To Understand the steps and activities in the ERP life cycle

UNIT I INTRODUCTION TO ERP 9

Overview – Benefits of ERP – ERP and Related Technologies – Business Process

Reengineering – Data Warehousing – Data Mining – On–line Analytical Processing – Supply

Chain Management.

UNIT II ERP IMPLEMENTATION 9 Implementation Life Cycle – Implementation Methodology – Hidden Costs – Organizing

Implementation – Vendors, Consultants and Users – Contracts – Project Management and

Monitoring

UNIT III BUSINESS MODULES 9

Business Modules in an ERP Package – Finance – Manufacturing – Human Resource – Plant

Maintenance – Materials Management – Quality Management – Sales and Distribution.

UNIT IV ERP MARKET 9

ERP Market Place – SAP AG – PeopleSoft – Baan Company – JD Edwards World Solutions Company – Oracle Corporation – QAD – System Software Associates.

UNIT V ERP – PRESENT AND FUTURE 9 Turbo Charge the ERP System – EIA – RP and E–Commerce – ERP and Internet – Future

Directions in ERP.

TOTAL: 45 HOURS

TEXT BOOKS: 1. Alexis Leon, ―ERP DEMYSTIFIED‖, Tata McGraw Hill, Second Edition, 2008.

2. Vinod Kumar Garg and N.K.Venkita Krishnan, ―Enterprise Resource Planning-Concepts and

Practice‖, Prentice Hall of India.

REFERENCE BOOKS:

1. Joseph A. Brady, Ellen F. Monk, Bret J. Wangner, ―Concepts in Enterprise Resource

Planning‖ , Thomson Learning, 2001.

2. Jose Antonio Fernandz, ― The SAP R /3 Hand book‖, Tata McGraw Hill

3 .Mary Sumner, ―Enterprise Resource Planning‖, Pearson Education, 2007.

UBA12754/UBA12703 PRINCIPLES OF MANAGEMENT L T P C (Common to IT & CSE) 3 0 0 3

AIM: To learn the different principles and techniques of management in planning, organizing,

directing and controlling.

OBJECTIVES:

To study the evolution of Management

To study the functions and principles of Management

To learn the application of the principles in an organization

UNIT I INTRODUCTION TO MANAGEMENT AND ORGANIZATIONS 9 Definition of Management – Science or Art – Manager Vs Entrepreneur – types of managers –

managerial roles and skills – Evolution of Management – Scientific Management – Types of

Business organization –Public and Private sector enterprises – Organization culture and

Environment – Current trends and issues in Management.

UNIT II PLANNING 9 Nature and purpose of planning – planning process – types of planning – objectives – setting

objectives – policies – Planning premises – Mission & Vision Statement –Strategic Management

– Planning Tools and Techniques – Decision making steps and process.

UNIT III ORGANISING & STAFFING 9 Nature and purpose – Formal and informal organization – organization chart – organization

structure – types –– Job Design – Human Resource Management – HR Planning,

Recruitment,& E-Recruitment and Selection, Training and Development, Performance

Management, Career planning and management.

UNIT IV DIRECTING 9 Foundations of individual and group behavior – motivation theories – motivational techniques –

job satisfaction – job enrichment – leadership – types and theories of leadership –

communication – process of communication – barrier in communication – effective

communication – communication and IT.

UNIT V CONTROLLING 9

System and process of controlling – budgetary and non-budgetary control techniques – use of

computers and IT in Management control – Productivity problems and management – control

and performance – direct and preventive control - reporting

TOTAL: 45 HOURS

TEXT BOOKS:

1. Harold Koontz & Heinz Weihrich ―Essentials of management‖ Tata McGraw Hill, 1998.

REFERENCE BOOKS:

1. Stephen P.Robbins & Mary Coulter, ―Management‖, Prentice Hall (India) Pvt.Ltd., 10th

Edition, 2009.

2. JAF Stoner, Freeman R.E and Daniel R Gilbert ―Management‖, Pearson Education, 6th

Edition, 2004.

3. Stephen A.Robbins & David A. Decenzo & Mary Coulter, ―Fundamentals of Management‖

Pearson

Education, 7th Edition, 2011.

4. Robert Kreitner & Mamata Mohapatra, ―Management‖, Biztantra, 2008.

5. Tripathy PC & Reddy PN, ―Principles of Management‖, Tata McGraw Hill, 1999.

SEMESTER VIII

UIT12801/UCS12801 CLOUD COMPUTING L T P C (Recommended by Infosys - Common to CSE & IT) 3 0 0 3 AIM: To emphasize virtualized data centers and cloud systems for understanding, research. OBJECTIVES:

To introduce the broad perceptive of cloud architecture and model

To understand the concept of Virtualization

To be familiar with the lead players in cloud.

To understand the features of cloud simulator

To apply different cloud programming model as per need.

To be able to set up a private cloud.

To understand the design of cloud Services.

To learn to design the trusted cloud Computing system

UNIT I UNDERSTANDING CLOUD COMPUTING 6 Cloud Computing – History of Cloud Computing – Cloud Architecture – Cloud Storage – Why Cloud Computing Matters – Advantages of Cloud Computing – Disadvantages of Cloud Computing – Companies in the Cloud Today – Cloud Services UNIT II DEVELOPING CLOUD SERVICES 10 Web-Based Application – Pros and Cons of Cloud Service Development – Types of Cloud Service Development – Software as a Service – Platform as a Service – Web Services – On-Demand Computing – Discovering Cloud Services Development Services and Tools – Designing UI for the Cloud - Amazon Ec2 – Google App Engine – IBM Clouds UNIT III CLOUD COMPUTING FOR EVERYONE 10 Centralizing Email Communications – Collaborating on Schedules – Collaborating on To- Do Lists – Collaborating Contact Lists – Cloud Computing for the Community – Collaborating on Group Projects and Events – Cloud Computing for the Corporation UNIT IV USING CLOUD SERVICES 10 Collaborating on Calendars, Schedules and Task Management – Exploring Online Scheduling Applications – Exploring Online Planning and Task Management - Collaborating on Event Management – Collaborating on Contact Management - Collaborating on Project Management – Collaborating on Word Processing -Collaborating on Databases – Storing and Sharing Files

UNIT V OTHER WAYS TO COLLABORATE ONLINE 9 Collaborating via Web-Based Communication Tools – Evaluating Web Mail Services –Evaluating Web Conference Tools – Collaborating via Social Networks and Groupware –Collaborating via Blogs and Wikis

TOTAL: 45 HOURS REFERENCES:

1. Lars Nielsen‖The Little Book of Cloud Computing‖, 2013 Edition [Kindle Edition]

2. Kumar Saurabh, ―Cloud Computing – Insights into New Era Infrastructure‖, Wiley Indian Edition, 2011.

3. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online, Que Publishing, August 2008.

4. Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for On-demand Computing, Applications and Data Centers in the Cloud with SLAs, Emereo Pty Limited, July 2008.

UIT12851/UCS12851 Advanced DBMS L T P C (Common to CSE & IT) 3 0 0 3 AIM: To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram, make a study of SQL, know the fundamental concepts of transaction processing OBJECTIVES:

Be familiar with a commercial relational database system (Oracle) by writing SQL using the system.

Be familiar with the relational database theory, and be able to write relational algebra expressions for queries.

UNIT I PARALLEL AND DISTRIBUTED DATABASES 9 Database System Architectures: Centralized and Client-Server Architectures – Server System Architectures – Parallel Systems- Distributed Systems – Parallel Databases: I/O Parallelism – Inter and Intra Query Parallelism – Inter and Intra operation Parallelism – Distributed Database Concepts - Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing – Three Tier Client Server Architecture- Case Studies. UNIT II OBJECT AND OBJECT RELATIONAL DATABASES 9 Concepts for Object Databases: Object Identity – Object structure – Type Constructors – Encapsulation of Operations – Methods – Persistence – Type and Class Hierarchies – Inheritance – Complex Objects – Object Database Standards, Languages and Design: ODMG Model – ODL – OQL – Object Relational and Extended – Relational Systems : Object Relational features in SQL / Oracle – Case Studies. UNIT III XML DATABASES 9 XML Databases: XML Data Model – DTD - XML Schema - XML Querying – Web Databases – JDBC – Information Retrieval – Data Warehousing – Data Mining. UNIT IV MOBILE DATABASES 9 Mobile Databases: Location and Handoff Management - Effect of Mobility on Data Management - Location Dependent Data Distribution - Mobile Transaction Models - Concurrency Control - Transaction Commit Protocols- Mobile Database Recovery Schemes. UNIT V INTELLIGENT DATABASES 9 Active databases – Deductive Databases – Knowledge bases – Multimedia Databases- Multidimensional Data Structures – Image Databases – Text/Document Databases- Video Databases – Audio Databases – Multimedia Database Design.

TOTAL PERIODS:45

REFERENCES: 1. Henry F Korth, Abraham Silberschatz and S. Sudharshan, ―Database System Concepts‖, Sixth Edition, McGraw Hill, 2011. 2. C.J.Date, A.Kannan and S.Swamynathan,‖An Introduction to Database Systems‖, Eighth Edition, Pearson Education, 2006. 3. R. Elmasri, S.B. Navathe, ―Fundamentals of Database Systems‖, Fifth Edition, Pearson Education/Addison Wesley, 2007. 4. Thomas Cannolly and Carolyn Begg, ―Database Systems, A Practical Approach to Design, Implementation and Management‖, Third Edition, Pearson Education, 2007.

5. Subramaniam, ― Multimedia Databases‖, Morgan Kauffman Publishers, 2008.

UIT12852 / UCS12752 BIO INFORMATICS L T P C (Common to IT & CSE) 3 0 0 3

AIM: To provide an in-depth knowledge in the field of Bioinformatics OBJECTIVES:

To get exposed to the domain of bioinformatics

To understand the role of data warehousing and data mining for bioinformatics

To learn to model bioinformatics based applications

To understand how to deploy the pattern matching and visualization techniques in bioinformatics

To study the Microarray technologies for genome expression

UNIT I – BIOINFORMATICS: AN INTRODUCTION 9 Introduction-Historical Overview and Definition- Bioinformatics Applications-Major Databases in Bioinformatics- Data Management and Analysis- Molecular Biology and Bioinformatics- Central Dogma of Molecular Biology UNIT II –DATABASES 9 Introduction- Characteristics of Bioinformatics Databases- Categories of Bioinformatics Databases- Navigating databases- Sequence Databases- Nucleotide sequence database- secondary Nucleotide sequence database –protein sequence databases- structure databases- Structure file formats- Protein Structure Database Collaboration- PDB- CATH –SCOP- Other databases- Enzyme Databases- MEROPS- Pathway Databases:CAZy UNIT III – TOOLS 9 Introduction- Need for Tools- Knowledge Discovery- Data- Mining Tools- Data Submission tools- Nucleotide Sequence Submission and Protein Submission tools- Data Analysis tools- Prediction Tools- Phylogenetic trees and Phylogenetic Analysis- Modelling Tools UNIT IV – ALGORITHMS 9 Introduction- Classification of Algorithms- Biological Algorithms- Implementing Algorithms- Biological Algorithms- Bioinformatics Tasks and Corresponding Algorithms- Data Analysis Algorithms- Sequence Comparison Algorithms – Substitution Matrices Algorithms –Sequence Alignment Optimal Algorithms Prediction Algorithms- Phylogenetic prediction Algorithm – Protein Structure Prediction UNIT V–GENOME ANALYSIS AND SEQUENCE ALIGNMENT 9 Introduction- Genome Analysis- Genome mapping- The Sequence Assembly Problem- Genome Sequencing- Biological Motivation of Alignment Problems- Methods of Sequence Alignments- Using Scoring matrices- Measuring Sequence Detection Efficiency- Working with FASTA and BLAST

TOTAL: 45 HOURS

TEXT BOOKS

1. OrpitaBosu, Simminder KaurThukral , ―Bioinformatics: Database, Tools,Algorithms‖, Oxford University Press, Chennai, 2007. (Part B---Unit-II, Part C---Unit-III, Part D---Unit-IV)

2. Rastogi S. C., NamitaMendiratta, Parag Rastogi, ―Bioinformatics: Methods and Applications: Genomics, Proteomics and Drug Discovery‖, Third Edition, PHI Learning Pvt. Ltd., New Delhi, 2011.(Chapter-1---Unit-I, Chapter 3,4 and 6--Unit-V)

REFERENCES

1. Bryan Bergeron, ―Bioinformatics computing‖, PHI Learning Pvt. Ltd, New Delhi, 2010. 2. Rastogi S.C., NamitaMendiratta, Parag Rastogi, ―Bioinformatics: Concepts‖,Skills &

Applications, Second Edition, CBS Publishers & Distributors Pvt. Ltd,2009 3. Arthur M. Lesk, ―Introduction to Bioinformatics‖, Third Edition, Oxford University Press,

Chennai, 2010 4. Gautham N., ―Bioinformatics:Databases and Algorithms‖, alpha Science 2006 5. http://staff.aub.edu.lb/~webbic/nemer/index.html 6. http://bip.weizmann.ac.il/education/course/introbioinfo/04/lect1/introbioinfo04/index.html 7. http://engineeringppt.net/algorithms-in-bioinformatics-pdf-lecture- notes/

UIT12853 DOMAIN ENGINEERING L T P C 3 0 0 3

AIM: To learn about the basic principles of Domain Engineering and its analysis, design process and tools OBJECTIVES:

Develop an application that uses GUI components, Font and Colours

Develop an application that uses Layout Managers and event listeners.

Develop a native calculator application.

Write an application that draws basic graphical primitives on the screen.

Develop an application that makes use of database.

Develop an application that makes use of RSS Feed.

Implement an application that implements Multi threading

Develop a native application that uses GPS location information.

Implement an application that writes data to the SD card.

Implement an application that creates an alert upon receiving a message.

Write a mobile application that creates alarm clock

UNIT I DOMAIN ENGINEERING BASICS 9

Domain Engineering – Application Engineering – System Life Cycle Models – Developing a

Domain Architectural Model – The Reusability Process – Domain Repositories – Establishing a

Reusable Repository – Domain Specific Repository (DSR) – Domain Repository and Application

Development

UNIT II DOMAIN MODELLING AND ANALYSIS 9

Domain Prototype Model – Domain Functional Model – Domain Dynamic Model – Domain

Object Model – Domain Information Model – Domain Data Dictionary (All models with case

study)., - Benefits of Domain Analysis – Domain Analysis for Reusability – KAPTUR – Design

Recovery – Integrated Computer Aided Manufacturing (ICAM) – Integrated Definition(IDEF)

Process Model – Feature Oriented Domain Analysis (FODA) - Joint Object Oriented Domain

Analysis(JODA)

UNIT III DOMAIN DESIGN PROCESS 9

Domain Design – The Object Oriented Domain Design Methods – The Object Oriented Method

– Domain Implementation – Object Oriented Life Cycle Model – ASSET Collection – Selection

Criteria for Reuse Assets – Asset Submitting Schema – Asset Certification – Levels of

Certification – Assessing the Repository for an Asset – The Reuse Asset Anomaly Process –

Collection of Metric

UNIT IV PRODUCT DEVELOPMENT ORGANIZATION AND MANAGEMENT 9

Strategic Product Development – A Cooperative Model for Cross Divisional Product

Development for a Software Product Line – A Component Oriented Platform for Architecting

Product Families – Component Based Product Line Development Freeing Product Line

Architectures from Execution Dependencies

UNIT V TOOLS AND TECHNIQUES 9

A Hierarchy of COTS Certification Criteria – A Toolset for Product Line Development –

Development / Maintenance / Reuse – Software Evolution in Product Lines – Developing

Engineered Product Support Applications – Domain Engineered Configuration Control – Starting

a Product Line Approach for an Envisioned Market – Scoping Software Product Lines

TOTAL : 45 HOURS

TEXT BOOKS:

1. Jag Sodhi, Prince Sodhi – Software Reuse(Domain Analysis and Design Processes)

2. R. Glowinski, J. Perieaux, z-cshi – ―Domain Decomposition Methods in Sciences and

Engineering‖ – John Willionsons – 1997.

REFERENCES:

1. Software Product Lines – Research Issues in Engineering and Management, Kakola,

Timo; Duenas, Juan Carlos (Eds.), Sringer, 2006.

2. Proceeding of the First International Bi-Conference Workshop on Domain Engineering,

2009.

UIT12854 INFORMATION CODING TECHNIQUES L T P C 3 0 0 3

AIM: To give an overall understanding on the Information theories and coding techniques. OBJECTIVES:

1. To introduce to the students the concept of information and entropy of Information 2. To give the student the concept of compression of source coding: text, audio and speech

image and video information , error control of Information.

UNIT I INFORMATION THEORY 9

Information – Entropy, Information rate, classification of codes, Kraft McMillan inequality, Source

coding theorem, Shannon - Fano coding, Huffman coding, Extended Huffman coding - Joint and

conditional entropies, Mutual information - Discrete memoryless channels – BSC, BEC –

Channel capacity, Shannon limit.

UNIT II SOURCE CODING: TEXT, AUDIO AND SPEECH 9

Text: Adaptive Huffman Coding, Arithmetic Coding, LZW algorithm – Audio: Perceptual coding,

Masking techniques, Psychoacoustic model, MEG Audio layers I,II,III, Dolby AC3 - Speech:

Channel Vocoder, Linear Predictive Coding.

UNIT III SOURCE CODING: IMAGE AND VIDEO 9

Image and Video Formats – GIF, TIFF, SIF, CIF, QCIF – Image compression: READ, JPEG –

Video Compression: Principles-I,B,P frames, Motion estimation, Motion compensation, H.261,

MPEG standard.

UNIT IV ERROR CONTROL CODING: BLOCK CODES 9

Definitions and Principles: Hamming weight, Hamming distance, Minimum distance decoding -

Single parity codes, Hamming codes, Repetition codes - Linear block codes, Cyclic codes -

Syndrome calculation, Encoder and decoder – CRC.

UNIT V ERROR CONTROL CODING: CONVOLUTIONAL CODES 9

Convolution codes – code tree, trellis, state diagram - Encoding – Decoding: Sequential search

and Viterbi algorithm – Principle of Turbo coding, Ungerboeck‘s TCM Design Rules-TCM

decoder Performance Evaluation for AWGN Channel-Computation of dfree- TCM for Fading

Channels.

TOTAL: 45 HOURS

TEXT BOOKS:

1. R Bose, ―Information Theory, Coding and Cryptography‖, TMH 2007

2. Fred Halsall, ―Multimedia Communications: Applications, Networks, Protocols and

Standards‖, Pearson Education Asia, 2002

3. Simon Haykin, Communication Systems, Wiley and sons Limited, fifth edition, 2008,

ISBN 9971513056

REFERENCES

1. K Sayood, ―Introduction to Data Compression‖ 3/e, Elsevier 2006

2. S Gravano, ―Introduction to Error Control Codes‖, Oxford University Press 2007

3. Amitabha Bhattacharya, ―Digital Communication‖, TMH 2006

UIT12855 MULTI-CORE ARCHITECTURE AND PROGRAMMING L T P C

3 0 0 3 AIM: To understand this subject as a pragmatic examination of multicore programming and the hardware architecture of modern multicore processors OBJECTIVES :

To understand the shift from Single core to multicore processors

To understand the different parallel programming models

To measure the parallel program performance

Understand the challenges in parallel and multi-threaded programming.

Learn about the various parallel programming paradigms, and solutions

UNIT I MULTI-CORE PROCESSORS 9 Single core to Multi-core architectures – SIMD and MIMD systems – Interconnection networks - Symmetric and Distributed Shared Memory Architectures – Cache coherence - Performance Issues -Parallel program design. UNIT II PARALLEL PROGRAM CHALLENGES 9 Performance – Scalability – Synchronization and data sharing – Data races – Synchronization primitives (mutexes, locks, semaphores, barriers) – deadlocks and livelocks – communication between threads (condition variables, signals, message queues and pipes). UNIT III SHARED MEMORY PROGRAMMING WITH OpenMP 9 OpenMP Execution Model – Memory Model – OpenMP Directives – Work-sharing Constructs – Library functions – Handling Data and Functional Parallelism – Handling Loops - Performance Considerations. UNIT IV DISTRIBUTED MEMORY PROGRAMMING WITH MPI 9 MPI program execution – MPI constructs – libraries – MPI send and receive – Point-to-point and Collective communication – MPI derived datatypes – Performance evaluation UNIT V PARALLEL PROGRAM DEVELOPMENT 9 Case studies - n-Body solvers – Tree Search – OpenMP and MPI implementations and comparison.

TOTAL: 45 PERIODS TEXT BOOKS: 1. Peter S. Pacheco, ―An Introduction to Parallel Programming‖, Morgan-Kauffman/Elsevier, 2011.

2. Darryl Gove, ―Multicore Application Programming for Windows, Linux, and Oracle Solaris‖, Pearson, 2011 (unit 2) REFERENCES: 1. Michael J Quinn, ―Parallel programming in C with MPI and OpenMP‖, Tata McGraw Hill, 2003.

2. Shameem Akhter and Jason Roberts, ―Multi-core Programming‖, Intel Press, 2006.

UIT12857 / UCS12759 SERVICE ORIENTED ARCHITECTURE L T P C (Common to IT & CSE) 3 0 0 3

AIM: To understand the concepts of Service oriented Architecture, Analysis Techniques and to develop skills and knowledge about service designs and web service standards. OBJECTIVES:

Learn XML fundamentals.

Be exposed to build applications based on XML.

Understand the key principles behind SOA.

Be familiar with the web services technology elements for realizing SOA.

Learn the various web service standards.

UNIT I INTRODUCTION TO XML 9 XML document structure – Well formed and valid documents – Namespaces – DTD – XML Schema – X-Files. UNIT II BUILDING XML- BASED APPLICATIONS 9 Parsing XML – using DOM, SAX – XML Transformation and XSL – XSL Formatting – Modeling Databases in XML. UNIT III SERVICE ORIENTED ARCHITECTURE 9 Characteristics of SOA, Comparing SOA with Client-Server and Distributed architectures – Benefits of SOA -- Principles of Service orientation – Service layers. UNIT IV WEB SERVICES 9 Service descriptions – WSDL – Messaging with SOAP – Service discovery – UDDI – Message Exchange Patterns – Orchestration – Choreography –WS Transactions. UNIT V BUILDING SOA-BASED APPLICATIONS 9 Service Oriented analysis and design – Service Modeling – Design standards and guidelines – Composition – WS – BPEL – WS coordination – WS policy – WS Security – SOA support in J2EE.

TOTAL: 45 PERIODS

TEXTBOOKS: 1. Ron Schmelzer et al. ― XML and Web Services‖, Pearson Education, 2002 2. Thomas Erl,

―Service Oriented Architecture: Concepts, Technology, and Design‖, Pearson Education, 2005.

REFERENCES: 1. Frank P.Coyle, ―XML, Web Services and the Data Revolution‖, Pearson Education, 2002. 2. Eric Newcomer, Greg Lomow, ―Understanding SOA with Web Services‖, Pearson Education, 2005. 3. Sandeep Chatterjee and James Webber, ―Developing Enterprise Web Services: An Architect's Guide‖, Prentice Hall, 20044. 4. James McGovern,Sameer Tyagi, Michael E.Stevens, Sunil Mathew, ‖Java Web. Services Architecture‖, Morgan Kaufmann Publishers, 2003.

UIT12858 / UCS127510 SOFT COMPUTING L T P C (Common to IT & CSE) 3 0 0 3 AIM: To give an overall understanding on the theories those are available to solve hard real- world problems. OBJECTIVES:

Learn the various soft computing frame works.

Be familiar with design of various neural networks.

Be exposed to fuzzy logic.

Learn genetic programming.

Be exposed to hybrid systems. UNIT I INTRODUCTION 9 Artificial neural network: Introduction, characteristics- learning methods – taxonomy – Evolution of neural networks- basic models - important technologies - applications. Fuzzy logic: Introduction - crisp sets- fuzzy sets - crisp relations and fuzzy relations: cartesian product of relation - classical relation, fuzzy relations, tolerance and equivalence relations, non-iterative fuzzy sets. Genetic algorithm- Introduction - biological background - traditional optimization and search techniques - Genetic basic concepts. UNIT II NEURAL NETWORKS 9 McCulloch-Pitts neuron - linear separability - hebb network - supervised learning network: perceptron networks - adaptive linear neuron, multiple adaptive linear neuron, BPN, RBF, TDNN- associative memory network: auto-associative memory network, hetero-associative memory network, BAM, hopfield networks, iterative autoassociative memory network & iterative associative memory network –unsupervised learning networks: Kohonen self organizing feature maps, LVQ – CP networks, ART network. UNIT III FUZZY LOGIC 9 Membership functions: features, fuzzification, methods of membership value assignments-Defuzzification: lambda cuts - methods - fuzzy arithmetic and fuzzy measures: fuzzy arithmetic - extension principle - fuzzy measures - measures of fuzziness -fuzzy integrals - fuzzy rule base and approximate reasoning : truth values and tables, fuzzy propositions, formation of rules-decomposition of rules, aggregation of fuzzy rules, fuzzy reasoning-fuzzy inference systems-overview of fuzzy expert system-fuzzy decision making. UNIT IV GENETIC ALGORITHM 9 Genetic algorithm and search space - general genetic algorithm – operators - Generational cycle - stopping condition – constraints - classification - genetic programming – multilevel optimization – real life problem- advances in GA. UNIT V HYBRID SOFT COMPUTING TECHNIQUES & APPLICATIONS 9

Neuro-fuzzy hybrid systems - genetic neuro hybrid systems - genetic fuzzy hybrid and fuzzy genetic hybrid systems - simplified fuzzy ARTMAP - Applications: A fusion approach of multispectral images with SAR, optimization of traveling salesman problem using genetic algorithm approach, soft computing based hybrid fuzzy controllers.

TOTAL PERIODS:45

TEXT BOOKS:

1. J.S.R.Jang, C.T. Sun and E.Mizutani, ―Neuro-Fuzzy and Soft Computing‖, PHI / Pearson Education 2004.

2. S.N.Sivanandam and S.N.Deepa, "Principles of Soft Computing", Wiley India Pvt Ltd, 2011.

REFERENCES: 1. S.Rajasekaran and G.A.Vijayalakshmi Pai, "Neural Networks, Fuzzy Logic and Genetic Algorithm: Synthesis & Applications", Prentice-Hall of India Pvt. Ltd., 2006. 2. George J. Klir, Ute St. Clair, Bo Yuan, ―Fuzzy Set Theory: Foundations and Applications‖ Prentice Hall, 1997. 3. David E. Goldberg, ―Genetic Algorithm in Search Optimization and Machine Learning‖ Pearson Education India, 2013. 4. James A. Freeman, David M. Skapura, ―Neural Networks Algorithms, Applications, and Programming Techniques, Pearson Education India, 1991. 5. Simon Haykin, ―Neural Networks Comprehensive Foundation‖ Second Edition, Pearson Education, 2005.

UIT12859 / UCS12859 SOFTWARE PROJECT MANAGEMENT L T P C (Common to IT & CSE) 3 0 0 3 AIM: To attain knowledge in training software project managers and other individuals involved in software project planning and tracking and oversight in the implementation of the software project management process OBJECTIVES:

To outline the need for Software Project Management

To highlight different techniques for software cost estimation and activity planning.

UNIT I PROJECT EVALUATION AND PROJECT PLANNING 9 Importance of Software Project Management – Activities Methodologies – Categorization of Software Projects – Setting objectives – Management Principles – Management Control – Project portfolio Management – Cost-benefit evaluation technology – Risk evaluation – Strategic program Management – Stepwise Project Planning. UNIT II PROJECT LIFE CYCLE AND EFFORT ESTIMATION 9 Software process and Process Models – Choice of Process models - mental delivery – Rapid Application development – Agile methods – Extreme Programming – SCRUM – Managing interactive processes – Basics of Software estimation – Effort and Cost estimation techniques – COSMIC Full function points - COCOMO II A Parametric Productivity Model - Staffing Pattern. UNIT III ACTIVITY PLANNING AND RISK MANAGEMENT 9 Objectives of Activity planning – Project schedules – Activities – Sequencing and scheduling – Network Planning models – Forward Pass & Backward Pass techniques – Critical path (CRM) method – Risk identification – Assessment – Monitoring – PERT technique – Monte Carlo simulation – Resource Allocation – Creation of critical patterns – Cost schedules. UNIT IV PROJECT MANAGEMENT AND CONTROL 9 Framework for Management and control – Collection of data Project termination – Visualizing progress – Cost monitoring – Earned Value Analysis- Project tracking – Change control- Software Configuration Management – Managing contracts – Contract Management. UNIT V STAFFING IN SOFTWARE PROJECTS 9 Managing people – Organizational behavior – Best methods of staff selection – Motivation – The Oldham-Hackman job characteristic model – Ethical and Programmed concerns – Working in teams – Decision making – Team structures – Virtual teams – Communications genres – Communication plans.

TOTAL: 45 PERIODS

TEXTBOOK: 1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata McGraw Hill, New Delhi, 2012. REFERENCES: 1. Robert K. Wysocki ―Effective Software Project Management‖ – Wiley Publication,2011. 2. Walker Royce: ―Software Project Management‖- Addison-Wesley, 1998. 3. Gopalaswamy Ramesh, ―Managing Global Software Projects‖ – McGraw Hill Education (India), Fourteenth Reprint 2013.

UIT128510 / UCS128512 WEB SERVICES L T P C (Common to IT & CSE) 3 0 0 3

AIM: The basic aim of this subject is to provide students with insight into XML Web Services, various key technologies for web services OBJECTIVES:

To know about XML Web Services

To know protocol architecture of XML services

To learn how the web services can be developed using XML

To learn about various security issues in the XML document. UNIT I INTRODUCTION 9 Role Of XML – XML and the Web – XML Language Basics – SOAP – Web Services – Revolutions of Xml –Service Oriented Architecture (SOA) – Introduction to SOAP. UNIT II XML TECHNOLOGY 9 XML-Namespaces – Structuring With Schemas and DTD – Presentation Techniques –Transformation – XML Infrastructure. UNIT III RESTFUL WEB SERVICES 9 Introduction to REST – RESTful Architectural Principles – REST Vs SOAP – Designing RESTful Services –The Object Model – Model the URIs – Defining the Data Format – Assigning HTTP Methods - RESTful Java Clients. UNIT IV WEB SERVICES 9 Overview – Architecture – Key Technologies – UDDI – WSDL – ebXML – Web services in E-Com –Overview of .NET And J2EE. UNIT V XML SECURITY AND XML INPRACTICE 9 Security Overview – Canonicalization – XML Security Frame Work – XML Encryption – XML Digital Signature –XKMS Structure – Guidelines for Signing XML Documents – XML in Practice.

TOTAL: 45 HOURS

TEXT BOOK: 1. Frank. P. Coyle, XML, Web Services And The Data Revolution, Pearson Education, 2002. REFERENCES: 1. Ramesh Nagappan, Robert Skoczylas and Rima Patel Sriganesh, ―Developing Java Web Services‖, Wiley Publishing Inc., 2004. 2 .Sandeep Chatterjee, James Webber, ―Developing Enterprise Web Services‖, Pearson Education, 2004. 3 .McGovern, et al., ―Java Web Services Architecture‖, Morgan Kaufmann Publishers, 2005

UIT128511 WIRELESS NETWORKS L T P C

3 0 0 3

AIM:

To develop advanced network building skills and to study performance issues in advanced wireless and mobile networks.

OBJECTIVES:

Understand the design issues in ad hoc and sensor networks.

Learn the different types of MAC protocols.

Be familiar with different types of adhoc routing protocols.

Be expose to the TCP issues in adhoc networks.

Learn the architecture and protocols of wireless sensor networks. UNIT I INTRODUCTION 9 Fundamentals of Wireless Communication Technology – The Electromagnetic Spectrum – Radio propagation Mechanisms – Characteristics of the Wireless Channel -mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs) :concepts and architectures. Applications of Ad Hoc and Sensor networks. Design Challenges in Ad hoc and Sensor Networks. UNIT II MAC PROTOCOLS FOR AD HOC WIRELESS NETWORKS 9 Issues in designing a MAC Protocol- Classification of MAC Protocols- Contention based protocols- Contention based protocols with Reservation Mechanisms- Contention based protocols with Scheduling Mechanisms – Multi channel MAC-IEEE 802.11 UNIT III ROUTING PROTOCOLS AND TRANSPORT LAYER IN AD HOC WIRELESS NETWORKS 9 Issues in designing a routing and Transport Layer protocol for Ad hoc networks- proactive routing, reactive routing (on-demand), hybrid routing- Classification of Transport Layer solutions-TCP over Ad hoc wireless Networks. UNIT IV WIRELESS SENSOR NETWORKS (WSNS) AND MAC PROTOCOLS 9 single node architecture: hardware and software components of a sensor node - WSN Network architecture: typical network architectures-data relaying and aggregation strategies -MAC layer protocols: self-organizing, Hybrid TDMA/FDMA and CSMA based MAC- IEEE

802.15.4. 91 UNITV WSN ROUTING, LOCALIZATION & QOS 9 Issues in WSN routing – OLSR- Localization – Indoor and Sensor Network Localization-absolute and relative localization, triangulation-QOS in WSN-Energy Efficient Design-Synchronization-Transport Layer issues.

TOTAL : 45 PERIODS

TEXT BOOK:

1. C. Siva Ram Murthy, and B. S. Manoj, "Ad hoc Wireless Networks: Architectures and Protocols ", Prentice Hall Professional Technical Reference, 2008.

REFERENCES: 1. Carlos De Morais Cordeiro, Dharma Prakash Agrawal ―Ad Hoc & Sensor Networks: Theory and Applications‖, World Scientific Publishing Company, 2006. 2. Feng Zhao and Leonides Guibas, "Wireless Sensor Networks", Elsevier Publication – 2002. 3. Holger Karl and Andreas Willig ―Protocols and Architectures for Wireless Sensor Networks‖, Wiley, 2005 3. Kazem Sohraby, Daniel Minoli, & Taieb Znati, ―Wireless Sensor Networks-Technology, Protocols, and Applications‖, John Wiley, 2007. 4. Anna Hac, ―Wireless Sensor Network Designs‖, John Wiley, 2003.

UBA12858 PROFESSIONAL ETHICS L T P C (Common to CSE & IT) 3 0 0 3 AIM: To learn about the Human Values and Ethics that are followed in the field of engineering. OBJECTIVES:

To create an awareness on Engineering Ethics and Human Values.

To instill Moral and Social Values and Loyalty.

To appreciate the rights of others. UNIT I HUMAN VALUES 9

Morals, Values and Ethics - Integrity - Work Ethic - Service Learning - Civic Virtue - Respect for Others - Living Peacefully - caring - Sharing - Honesty - Courage - Valuing Time - Co-operation - Commitment - Empathy - Self-Confidence - Character - Spirituality

UNIT II ENGINEERING ETHICS 9

Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy - Models of Professional Roles - theories about right action - Self-interest - customs and religion - uses of ethical theories.

UNIT III ENGINEERING AS SOCIAL EXPERIMENTATION 9

Engineering as experimentation - engineers as responsible experimenters - codes of ethics - a balanced outlook on law - the challenger case study.

UNIT IV SAFETY, RESPONSIBILITIES AND RIGHTS 9

Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk - the three mile island and chernobyl case studies. Collegiality and loyalty - respect for authority - collective bargaining - confidentiality - conflicts of interest - occupational crime - professional rights - employee rights - Intellectual Property Rights (IPR) - discrimination.

UNIT V GLOBAL ISSUES 9

Multinational corporations - Environmental ethics - computer ethics - weapons development - engineers as managers-consulting engineers-engineers as expert witnesses and advisors -moral leadership-sample code of Ethics like ASME, ASCE, IEEE, Institution of Engineers(India), Indian Institute of Materials Management, Institution of electronics and telecommunication engineers(IETE),India, etc.

TOTAL: 45 HOURS

TEXT BOOKS:

1. Mike Martin and Roland Schinzinger, "Ethics in Engineering", McGraw-Hill, New York, 1996.

2. Govindarajan M, Natarajan S, Senthil Kumar V. S, "Engineering Ethics", Prentice Hall of India, New Delhi, 2004.

REFERENCES:

1. Charles D. Fleddermann, "Engineering Ethics", Pearson Education / Prentice Hall,

New Jersey, 2004 (Indian Reprint)

2. Charles E Harris, Michael S. Protchard and Michael J Rabins, "Engineering Ethics -

Concepts and Cases", Wadsworth Thompson Learning, United States, 2000 (Indian

Reprint now available)

3. John R Boatright, "Ethics and the Conduct of Business", Pearson Education, New

Delhi, 2003.

4. Edmund G Seebauer and Robert L Barry, "Fundamentals of Ethics for Scientists and

Engineers", Oxford University Press, Oxford, 2001.

UEC12851 DIGITAL IMAGE PROCESSING L T P C

3 0 0 3

AIM: To introduce the student to various Image processing and Pattern recognition techniques. OBJECTIVES:

To study the Image fundamentals.

To study the mathematical morphology necessary for Image processing and Image segmentation.

To study the Image Representation and description and feature extraction.

To study the principles of Pattern Recognition.

To know the various applications of Image processing. UNIT I DIGITAL IMAGE FUNDAMENTALS 9 Elements of digital image processing systems- Elements of visual perception- basic relationship between pixels - brightness- contrast- hue- saturation- mach band effect- Color image fundamentals - RGB- HSI models- Image sampling and Quantization- dither. UNIT II IMAGE TRANSFORMS 9 1D DFT- 2D DFT & its properties - DCT- DST- Walsh- Hadamard- KLT- Haar-Wavelet Transform-Introduction about Ridgelet Transform. UNIT III IMAGE ENHANCEMENT AND RESTORATION 9 Image Enhancement: Spatial domain enhancement: gray level transformations - histogram equalization and specification techniques- Image addition, subtraction, averaging- Median- Geometric mean- Harmonic mean- Contra harmonic mean filters- Homomorphic filtering. Image Restoration: Degradation model- Unconstrained and Constrained restoration- Inverse filter - Wiener filter- CLMS Filter. UNIT IV IMAGE SEGMENTATION AND REPRESENTATION 9 Image Segmentation: Point- line and edge detection- Edge linking- Thresholding -Region based segmentation: Region Growing, Region splitting and merging. Image representation: chain codes – polygonal approximations – signatures – Boundary segments – skeletons. UNIT V IMAGE COMPRESSION 9 Need for data compression- Lossless compression: Huffman coding, Arithmetic coding, Run length coding, Bit plane Coding, LZW coding. Lossy compression: Transform coding, wavelet coding. Compression standards: Binary Image Compression standards (JBIG)-still image compression standard (JPEG), video compression standard (MPEG).

TOTAL: 45 HOURS

TEXT BOOKS:

1. Rafael C.Gonzalez, Richard E.Woods, ―Digital Image Processing‖, Pearson Second

Edition 2004

2. Dr.S.Jayaraman, Digital Image Processing TMH New Delhi ,2009.

REFERENCES:

1. Anil K.Jain, ―Fundamentals of Digital Image Processing‖, Pearson Education 2003

2. Sridhar.S, ―Digital Image Processing‖, Oxford University Press, First Edition – 2011

3. David Salomon, ―Data Compression: The Complete Reference‖, Springer, Verlag

NewYork Inc-- 2nd Edition- 2001

4. William K-Pratt- ‗Digital Image Processing‘- John Wiley- NewYork- 2002

5. Kenneth R.Castleman-―Digital Image Processing”-Pearson-2003