B.Tech. 1 st Semester Code Name of the Subject Lecture Tutorial Practical Credits · 2015-01-03 · a) Write a C program to find the sum of individual digits of a positive integer

B.Tech. 1st Semester

Code Name of the Subject Lecture Tutorial Practical Credits

HS 1401 English – I 3 1 - 4

MATH 1401 Mathematics – I 3 1 - 4

CHE 1401 Engineering Chemistry 3 1 - 4

EEE 1401 Elements of Electrical

Engineering 3 1 - 4

CHEM 1401 Environmental Studies 3 1 - 4

HS 1203 English Lab - - 3 2

CHE 1202 Engineering chemistry Lab - - 3 2

ME 1203 Engineering Work Shop - - 3 2

Total 15 5 09 26

B.Tech. 2nd

Semester


HS 1401 English – II 3 1 - 4

MATH 1401 Mathematics – II 3 1 - 4

PHY 1401 Engineering Physics 3 1 - 4

ME 1401 Elements of Mechanical

Engineering 3 1 - 4

CSE 1401 Fundamentals of Computer

Programming 3 1 - 4

PHY 1202 Engineering Physics Lab - - 3 2

CSE 1202 Computer Programming Lab - - 3 2

ME 1202 Engineering Drawing - - 3 2

Total 15 5 09 26

B. Tech 3rd

Semester

Code Subject Lecture Tutorial Practical Credits

MATH 2404 Mathematical Methods 3 1 - 4

ECE 2406 Digital Logic Design 3 1 - 4

IT 2401 Data Structures 3 1 - 4

CSE 2403 Computer Organization 3 1 - 4

CSE 2404 Discrete Structures and Graph

Theory 3 1 - 4

IT 2203 Data Structures Lab - - 3 2

CSE 2205 Digital Logic Design Lab - - 3 2

Total 15 05 06 24

B. Tech 4th Semester


IT 2405 Database Management Systems 3 1 - 4

IT 2402 Object Oriented Programming

through Java 3 1 - 4

CSE 2406 Data Communication Systems 3 1 - 4

CSE 2407 Operating Systems 3 1 - 4

CSE 2408 Theory of Computation 3 1 - 4

IT 2207 Database Management Systems Lab - - 3 2


through Java Lab - - 3 2

Total 15 05 06 24

B.Tech. 5th

Semester


ECE 3428 Microprocessors and Interfacing 3 1 - 4

IT 3409 Computer Networks 3 1 - 4

IT 2406 Design and Analysis of Algorithms 3 1 - 4

CSE 3409 Software Engineering 3 1 - 4

CSE 3410 Unix Programming 3 1 - 4

ECE 3230 Microprocessors and Interfacing Lab - - 3 2

IT 3211 Computer Networks Lab - - 3 2

CSE 3211 Unix Programming Lab - - 3 2

Total 15 05 9 26

B.Tech. 6th

Semester

Code Subject Lecture Tutorial

Practical Credits

CSE 3412 Computer Graphics 3 1 - 4

CSE 3413 Information Security 3 1 - 4

CSE 3414 Language Processors 3 1 - 4

Elective - I

ECE 3421 Digital Signal Processing

3 1

- 4 ECE 4433 Embedded systems

CSE 3415 Advanced Databases

Elective - II (Open Elective)

IT 3418 Cloud Computing ( IT)

3 1 4

Disaster Management (Civil)

ECE 3425 Fundamentals of Global Positioning

System (ECE)

CHEM 3425 Industrial Safety and Hazards

Management (Chem.)

ME 3431 Operations Research (Mech.)

EEE 3427 Renewable Energy Resources(EEE)

CSE 3416 Soft Computing (CSE)

GMR 30001 Audit Course

Laboratories

CSE 3217 Information Security Lab - 3 2

CSE 3218 Language processor Lab - 3 2

GMR 30206 Term Paper - 3 2

Total 15 05 9 26

B.Tech. 7th

Semester


IT3413 Data Warehousing and Data Mining 3 1 - 4

IT3414 Object Oriented Analysis and Design 3 1 - 4

IT3415 Web Technologies 3 1 - 4

Elective-III

CSE4419 Distributed Systems

3 1 - 4 CSE4420 Middleware Technologies

CSE4421 Software Project Management

Elective-IV

ECE4431 Digital Image Processing

3 1 - 4 CSE4422 Mobile Computing

CSE4423 Multimedia Systems

Laboratories

IT3219 Object Oriented Analysis and Design Lab - - 3 2

IT3220 Web Technologies Lab - - 3 2

GMR 40203 Internship 2

GMR40204 Mini Project 2

Total 15 05 06 28

B.Tech. 8th

Semester


HS3405 Engineering Economics & Project

management 3 1

- 4

Elective-V

IT4423 Information Retrival System

3 1

- 4 CSE4424 Big Data Analytics

CSE4425 Bio-Informatics

Elective-VI

CSE4426 E-commerce

3 1 - 4 CSE4427 Object Oriented Software Engineering

CSE4428 Pattern Recognition

GMR41205 Main Project 12

Total 09 03 24

B.Tech- 2nd

Semester

Common for ECE,CSE & IT Branches

SYLLABUS

(Applicable for 2013-14 admitted batch)

Course Title: Fundamentals of Computer Programming Course Code: CSE 1401

L T P C

3 1 0 4

Course Objectives: The course content enables students to:

• Understand the fundamentals of program development steps.

• Give solution to a problem in various ways using algorithm, pseudo code and flow chart

• Experience the use of the condition statements and looping statements (for, while and do-while) in

program writing.

• Learn string handling and string manipulation operations

• Understand the usage of user defined and predefined functions

• Learn about various types of pointers and their initialization and their utilization in real life.

• Learn about text file , binary files and the File handling operations

• Know about derived data types like structures and unions.

Course Outcomes: At the end of the course students will be able to:

• Apply arrays, looping and condition concepts in student grading system.

• Use structures for storing student records.

• Use files concepts for storing the student records permanently as a database.

• Apply pointers concepts in connecting the nodes in the computer networks.

• Apply recursion in writing AI programs (Prolog Programming)

UNIT I: 11+3 Hrs

PROBLEM SOLVING: Introduction to problem solving, Algorithm / pseudo code, flowchart, program

development steps, Computer Languages

BASICS OF C: Structure of a C program, identifiers, basic data types and sizes. Constants, variables,

arithmetic, relational and logical operators, increment and decrement operators, conditional operator,

assignment operators, bit-wise operators expressions, type conversions, conditional expressions, precedence

and order of evaluation

UNIT II: 11+4 Hrs

SELECTION – MAKING DECISIONS: Two-way selection: if- else, null else, nested if, Multi-way

selection: switch, else-if, Iterative Loops – while, do-while and for statements, break, continue

ARRAYS: Array concepts, declaration, definition, accessing elements , storing elements, strings and string

manipulations, 2-D arrays , Multidimensional arrays

UNIT III: 12+4 Hrs

FUNCTIONS-MODULAR PROGRAMMING: Functions, basics, parameter passing, storage classes-

extern, auto, register, static, scope rules, block structure, user defined functions, standard library functions,

recursive functions, passing 1-D and 2-D arrays to functions.

POINTERS: Pointer concepts, initialization of pointer variables, pointers and function arguments, passing

by address, dangling memory, address arithmetic, Character pointers and functions, pointers to pointers,

dynamic memory management functions

UNIT IV: 11+4Hrs

STRUCTURES AND UNIONS : Derived types, structures, declaration, definition and initialization of

structures, accessing structures, nested structures, arrays of structures, structures and functions, pointers to

structures, unions, typedef, bit-fields.

FILE HANDLING: Input and output – concept of a file, text files and binary files, Formatted I/O(1), file

I/O operations

Text Books: 1. C Programming Second Edition-E.Balaguruswamy

2. Let Us C –Yashwant, Kanetkar,BPB publication

Reference Books: 1. C Programming: A Problem - Solving Approach, Forouzan, E. V. Prasad, Giliberg, Cengage, 2010.

2. The C – Programming Language- B.W. Kernighan, Dennis M. Ritchie, PHI

3. C and Data Structure –Ashok N.Kamthane, Person Edition

B.Tech- 2nd

Semester


SYLLABUS


Course Title: COMPUTER PROGRAMMING LAB Course Code: CSE 1202

L T P C

0 0 3 2

Course Objectives: Students undergoing this course are expected to:

• Learn program development steps like coding, compilation, execution and debugging.

• Develop programs using Branching & Looping statements.

• Develop applications using structures and unions

• Understand the use of recursion

• Experiment different file operations


• Plan a solution for a problem by writing a program.

• Develop searching and sorting algorithms using loop statements.

• Write telephone directory program using files concepts

• Develop stacks, queues and trees programs using structures and pointers concepts

List of Experiments :

Exercise l :

a) Write C-programs to perform simple mathematical operations using basic C operators.

b) Write a C program to find the roots of a quadratic equation.

Exercise 2:

a) Write a C program, which takes two integer operands and one operator from the user, performs the

operation and then prints the result. (Consider the operators +,-,*, /, % and use Switch Statement)

b) Write a C program to generate the first n terms of the Fibonacci sequence.

c) Write a C program which checks a given integer is Fibonacci number or not.

Exercise 3:

a) Write a C program to find the sum of individual digits of a positive integer.

b) Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by

the user.

Exercise 4: Write a C program to implement the following

a) Addition of Two Matrices

b) Matrix multiplication by checking compatibility


a) Simple programming examples to manipulate strings.

b) Verifying a string for its palindrome property

Exercise 6:

a) Write a C function to generate Pascal’s triangle.

b) Write a C function to construct a pyramid of numbers.

Exercise 7: Write a C program that uses functions to perform the following operations:

i. To insert a sub-string in to given main string from a given position.

ii. To delete n Characters from a given position in a given string.

Exercise 8:

a) Write a C program to read two numbers, x and n, and then compute the sum of the geometric

progression using function1+x+x2+x

3+………….+x

n

b) write a C program to find factorial of a given integer using recursion


a) Pointer based function to exchange value of two integers using call by reference.

b) Program for matrix multiplication using pointers

Exercise 10: Write a C program that uses functions to perform the following operations using Structure:

i) Reading a complex number ii) Writing a complex number

iii) Addition of two complex numbers iv) Multiplication of two complex numbers

Exercise 11:

Examples which explore the use of structures, union and other user defined variables.

Exercise 12:

a) Write a C program which copies one file to another.

b) Write a C program to reverse the first n characters in a file. (Note: The file name and n are specified on

the command line)

Manual/Books:

1. C Programming Lab manual – Department of CSE-GMRIT Rajam

Department of Computer Science & Engineering

B.Tech - 3rd

Semester

SYLLABUS (Applicable for 2012-13 admitted batch)

Course Title: MATHEMATICAL METHODS Course Code:

L T P C

3 1 0 4


• Solve linear system of equations,

• Apply numerical techniques in Engineering problems.

• Apply the concept of curve fitting for the data given.

• Learn the knowledge of finding the area bounded by curves using numerical methods.

• Know the methods of finding the roots of transcendental equations.

Course Outcomes: At the end of the course students are able to:

• Apply Linear system of equations in animation and simulation techniques used in applications like

Gaming and Prototype Modeling for incorporating simulated physical phenomena such as quality,

collision, friction, fluid flow etc.

• Understand the use of the concept of linear equations in the study of “Computer Vision”, used in areas

such as Artificial Intelligence, Industrial Robotics, Human Computer Interaction, Video Tracking etc.

• Understand the use of the concepts of Linear system of equations, Eigen values & vectors in the study of

Pattern Recognition, Document Clustering and Classification, etc.

• Apply the concepts of curve fitting in data clustering and classification studied in Data Mining

• Solve problems using Lagrange method of interpolation

• Use Newton divided difference interpolation in Information Security for securing the message (message

is converted into polynomial)

• Apply Lagrange interpolation techniques in group key generation, key agreement and key management

• Use interpolation with evenly spaced points in 3D Computer Graphics

• Apply numerical integration techniques in applications such as Simulation for Prototyping

• Simulate real world phenomena and events

• Analyze and solve science & engineering problems applying the mathematical methods.

UNIT – I 15 Hrs Linear systems of equations: Rank-Echelon form, Normal form – Solution of Linear Systems –Rank Method

and Gauss Seidal Method.

Eigen values - Eigen vectors – Properties – Cayley-Hamilton Theorem - Inverse and powers of a matrix by

using Cayley-Hamilton theorem.

Quadratic forms- Reduction of quadratic form to canonical form – Rank - Positive,

negative definite - semi definite - index – signature.

UNIT – II 15 Hrs Solution of Algebraic and Transcendental Equations: Introduction – The Bisection Method – The Method of

False Position – The Iteration Method – Newton-Raphson Method.

Curve fitting: Fitting a straight line –Second degree curve-exponential curve-power curve by method of least

squares.

UNIT-III 15 Hrs Interpolation: Introduction- Errors in Polynomial Interpolation – Finite differences- Forward Differences-

Backward differences –Central differences – Symbolic relations and separation of symbols-Differences of a

polynomial-Newton’s formulae for interpolation – Interpolation with unevenly spaced points - Lagrange’s

Interpolation formula.

UNIT – IV 15 Hrs Numerical Differentiation and Integration – Differentiation using finite differences - Trapezoidal rule –

Simpson’s 1/3 Rule –Simpson’s 3/8 Rule.

Numerical solution of Ordinary Differential equations: Solution by Taylor’s series-Picard’s Method of

successive Approximations-Euler’s Method-Runge-Kutta Methods –Predictor-Corrector Methods- Milne’s

Method.

Text Book : 1. Mathematical Methods , Volume-III, T.K.V Iyengar, & others, S.Chand Co. New Delhi

2. Ravindranath, V. and Vijayalaxmi,A, A Text Book on Mathematical Methods, Himalaya Publishing

House, Bombay.

Reference Books : 1. Rukmangadachari, E. Mathematical Methods, Pearson Education, Delhi.

2. Kreszig, Erwin “Advanced Engineering Mathematics”, 8th

Edition, Wiley Student Edition.

3. Peter O’ Neil, “Engineering Mathematics”, Cengage Learning. Gordon, “Engineering Mathematics”,

Pearson Education


B.Tech - 3rd

Semester


Course Title: COMPUTER ORGANIZATION Course Code:

L T P C

3 1 0 4


• Understand how a computer system performs tasks by executing different micro-operations.

• Understand the basic organization of Computer system and its operation.

• Understand the instruction formats with different addressing modes, used by the CPU for instruction

processing.

• Know how control unit generates signals for carrying out instruction execution.

• Understand and analyze how the CPU performs basic arithmetic operations.

• Understand the organization of the memory system and its effect on performance of the computer.

• Understand how data transfer takes place among the various peripherals in the computer system.

• Know the different forms of concurrent processing and its effect on execution speed of the computer.


• Know the different components of the computer system, their functions and their interconnections.

• Know the various instruction formats that the processor follows.

• How the control unit generates control signals to execute a particular instruction.

• Understand how the memory system can be suitably designed to improve the performance of the

computer.

• Know how high speed computers can be designed by using the pipelining and multiprocessor concepts.

UNIT – I 16Hrs COMPUTER FUNCTION AND REGISTER TRANSFER LANGUAGES: Computer types, Functional

units, Register transfer language. Register transfer, Bus and memory transfers

MICRO-OPERATIONS: Arithmetic micro-operations, Logic micro-operations, Shift micro- operations,

Arithmetic logic shift unit

BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes,

Computer registers, Computer instructions, Timing and Control, Instruction cycle, Memory-Reference

instructions, Register-Reference instruction, Input-Output instruction, Interrupts, Design of basic computer

UNIT – II 14Hrs CENTRAL PROCESSING UNIT: Stack organization, Instruction formats, Addressing modes, Data

Transfer and manipulation, Program control, reduced instruction set computer, Complex instruction set

computer

CONTROL UNIT DESIGN: Hardwired control unit design, Micro-programmed Control unit design,

Control memory, Address sequencing, Micro-program example

UNIT-III 16Hrs COMPUTER ARITHMETIC: Fixed point representation, Floating point representation, Addition and

subtraction, Multiplication algorithms, Division algorithms, Floating point arithmetic operations

THE MEMORY SYSTEM: Memory hierarchy,Semiconductor RAM memories, Read-only memories,

Cache memories, Performance considerations, Secondary storage, Virtual memories

UNIT-IV 14Hrs INPUT-OUTPUT ORGANIZATION: Peripheral devices, Input-Output interface, Asynchronous data

transfer, Modes of transfer, Priority interrupt,Direct memory access, Input-Output processor (IOP)

PIPELINE AND VECTOR PROCESSING: Parallel processing, Pipelining, Arithmetic pipeline,

Instruction pipeline, Vector processing, Multiprocessors-loosely coupled and tightly coupled

Text Books:

1. Computer Organization by Carl Hamacher, ZvonksVranesic, SafeaZaky, 5

thEdition, McGraw Hill

2. Computer Systems Architecture by M.Moris Mano, 3rd

Edition, Pearson/PHI

Reference Books: 1. Computer Organization and Architecture – William Stallings 6

th Edition, Pearson/PHI

2. Structured Computer Organization – Andrew S. Tanenbaum, 4th

Edition PHI/Pearson

3. Fundamentals of Computer Organization and Design, - SivaramaDandamudi Springer Int. Edition


B.Tech - 3rd

Semester


Course Title: DATA STRUCTURES Course Code:

L T P C

3 1 0 4


• Understand various data structures and their importance in algorithm design.

• Implement the linear data structures stack and queue using array.

• Implement various forms of linked-lists.

• Implement various Hashing techniques using appropriate data structures.

• Demonstrate different Binary Tree Traversals.

• Demonstrate Binary Search Tree operations.

• Understand the advantages of height balanced trees.

• Implement graphs using either adjacency matrix or adjacency list.


• Create and manage data structures for developing real world applications.

• Use algorithms and data structures in well-written modular code in an adequate and optimal way.

• Apply the data structure array for various list processing operations such as searching and sorting.

• Decide to use array or linked-list for solving a given problem.

• Differentiate between linear and non-linear data structures.

• Use appropriate Data Structure for implementation of various algorithms in subsequent course of the

study.

UNIT – I 16 Hrs Data Structures and their importance in algorithm design: linear and non-linear data structures

Searching: Linear search and Binary Search

Sorting: Selection sort, bubble sort, insertion sort

Stacks: Basic operations, Implementation using array, Applications – Recursion, Infix to Postfix conversion

Queues: Basic operations, Linear queue, Circular Queue, implementation using array

UNIT – II 14Hrs Linked Lists:Basic operations, singly linked lists, doubly and circular linked lists

Hashing:Hashing Functions, Open hashing(chaining), closed hashing(open addressing – linear probing,

quadratic probing, double hashing), rehashing

UNIT-III 16Hrs

Trees: Binary Trees, Terminology, Representation of Binary Trees using arrays and linked lists, Binary tree

traversals, Creation of binary tree from in-order, pre-order and post-order traversals

Binary Search Trees: Searching, Insertion and deletion in BST

Heaps:Max-heap/ Min-heap, insertions and deletions, Heap sort

UNIT-IV 14Hrs

Balanced Trees: AVL trees, Height of AVL Tree, Balancing AVL tree by rotations, insertions and deletions

B-Trees: B-Tree of order M, insertions and deletions

Graphs: Graph Traversals (BFS & DFS)

Text Books: 1. Fundamentals of Data Structures in C, Horowitz, Sahni and Anderson Freed , 2

nd edition ,

Universities Press

2. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, Pearson Education

Reference Books: 1. Data Structures using C, A.S.Tanenbaum, Y. Langsam and M.J. Augenstein, Pearson Education

2. Data Structures with C, Seymour Lipschutz, McGraw Hill

3. Classic Data Structures, DebasisSamanta, 2nd

Edition, PHI


B.Tech - 3rd

Semester


Course Title: DIGITAL LOGIC DESIGN Course Code:

L T P C

3 1 0 4

Course objectives:Students undergoing this course are expected to:

• Understand the different number system, its conversions and binary arithmetic.

• Know the fundamentals of Boolean algebra and theorems, Karnaugh maps including the minimization

of logic functions to SOP or POS form.

• Analysis of logic circuits and optimization techniques to minimize gate count, signals, IC count, or time

delay.

• Strengthen the principles of logic design and use of simple memory devices, flip-flops, and sequential

circuits.

• Fortify the documentation standards for logic designs, standard sequential devices, including counters

and registers.

• Understand the logic design of programmable devices, including PLDs

• Understand RAMS, and ROMS including its sequencing and control

Course outcomes:After undergoing the course students will be able to:

• Differentiate between analog and digital representations.

• Convert a number from one number system to its equivalent in of the other Number system.

• Understand the difference between BCD and straight binary.

• Implement logic circuits using basic AND, OR and NOT gates.

• Use De-Morgan’s theorem to simplify logic expressions.

• Describe the concept of active LOW and active HIGH logic signals.

• Use Boolean algebra and K-map as tool to simplify and design logic circuits.

• Design simple logic circuits without the help of truth tables.

• Construct and analyze the operation of flip-flop and troubleshoot various types of flip-flop circuits.

• Understand the internal logic diagrams of Integrated circuits

• Design various types of sequential circuits like counters, state machines etc

UNIT- I 15Hrs

NUMBER SYSTEMS ANDBOOLEAN ALGEBRA:

Review of number systems, conversion of numbers from one radix to another radix, complement

representation of negative numbers-binary arithmetic, 4-bit codes: BCD, Excess-3, Floating point

representation(IEEE 754 Standard), Fixed point representation, Basic logic

operations. Basic theorems and properties of Boolean Algebra, switching functions, Canonical and Standard

forms-Algebraic simplification digital logic gates, universal gates and Multilevel NAND/NOR realizations,

Generation of self dual functions. Gray code, error detection and error correction codes, parity checking even

parity, odd parity, Hamming code

UNIT- II 15Hrs

BOOLEAN FUNCTIONMINIMIZATION AND COMBINATIONAL LOGIC CIRCUITS:

Minimization of switching functions using K-Map up to 6-variables, Tabularminimization, minimal SOP and

POS Realization, Problem solving using K-map such as code converters binary Multiplier. Half adder, Full

adder, full subtractor, Ripple carry adder, Carry look ahead adder, Multiplexer, De-Multiplexer, Encoder,

Priority encoder, Decoder, MUX Realization of switching functions Parity bit generator.

UNIT- III 15Hrs

PLDs AND SEQUENTIAL CIRCUITS – I:

Basic PLD’s-ROM, PROM, PLA, PAL, Realization of Switching functions using PLD’s, comparison of

PROM, PLA, and PAL, Classification of sequential circuits (synchronous and asynchronous): basic flip-

flops, truth tables and excitation tables (NAND RS latch, NOR RS latch, RS flip-flop, JK flip-flop, T flip-

flop, D flip-flop with reset and clear terminals), Conversion of

flip-flops.

UNIT- IV 15Hrs

SEQUENTIAL CIRCUITS – II AND SM CHARTS:

Design of registers, Buffer register, Control buffer register, Shift register, Bi-directional shift register,

Universal shift register, Design of Asynchronous &Synchronous counters - Up, Down, Up down, Johnson

counters, Ring counters, Finite state machine-capabilities and limitations, Mealy and Moore state machines,

Mealy to Moore conversion and vice-versa, Derivation of the SM chart, Reduction of state tables and state

assignment, Realization of SM Chart.

Text Books: 1. Digital Design – Morris Mano, 3

rd Edition, PHI.

2. Fundamentals of Digital Logic with Verilog Design – Stephen Brown, ZvonkoVranesic, TMH.

3. Fundamentals of Logic Design – Charles H. Roth, 3rd

Edition Thomson Publications.

4. Digital Design Principles & Practices – John F. Wakerly, 3rd

Edition, PHI/ Pearson Education Asia

Reference Books:

1. Switching & Finite Automata theory – ZviKohavi, 2nd

Edition TMH.

2. Modern Digital Electronics by RP Jain, TMH.


B.Tech - 3rd

Semester

SYLLABUS


Course Title: DISCRETE STRUCTURES AND GRAPH THEORY Course Code:

L T P C

3 1 0 4

Course Objectives:The course content enables students to:

• Comprehend the structure of statements (and arguments) involving predicates and quantifiers. Students

can able to apply logic on statements.

• Understand the applications of graph theory to various practical problems.

• Understand the basic properties of sets and relations.

• Understand proofs of various properties in group theory.

• Know the concept of permutations and combinations.

• Know how to solve a recursive problem.


• Apply the concept of logical equivalence and its relationship to logic circuits and Boolean functions.

• Use Concepts of graph theory to provide solutions for routing applications in computer networks.

• Use concepts of functions for data retrieval in database applications.

• Apply concepts of counting and probability in data mining.

• Apply the recurrence relation for analyzing recursive algorithms.

UNIT – I 16 Hrs Mathematical Logic: Statements and notations, Connectives, Well-formed formulas, Truth Tables,

Tautology, Two-state Device and Statement logic, Equivalence implication, Normal forms.

Predicates: Predicate logic, Free & Bound variables, Rules of inference, Consistency, Proof by

contradiction.

UNIT – II 14 Hrs Graph Theory: Representation of Graph, DFS, BFS, Planar Graphs, Chromatic Number, Graph Theory and

Applications, Basic Concepts of Isomorphism and Sub graphs, Euler circuits, Hamiltonian graphs, Spanning

Trees, Minimal spanning tree,

UNIT-III 14 Hrs Set Theory: Basic concepts of set theory, Properties of binary Relations, Equivalence, Compatibility and

partial ordering relations, Hasse diagram. Functions: Inverse Function, Composition of functions, Recursive

Functions, Lattice and its Properties.

Algebraic structures: Algebraic systems Examples and general properties, Semi groups and Monoids,

Groups, Sub group

UNIT-IV 16 Hrs Elementary Combinatorics: Basis of counting, Permutations & Combinations with repetitions,

Constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, the principles of Inclusion–

Exclusion, Pigeon hole principle and its application.

Recurrence Relation: Generating Functions, Function of Sequences, Calculating Coefficient ofgenerating

function, Recurrence relations, Solving recurrence relation by substitution and Generating functions.

Text Books: 1. Discrete Mathematical Structures with applications to computer science Tremblay J.P. &

P.Manohar, TMH

2. Discrete Mathematics for Computer Scientists & Mathematicians, J.L. Mott, A. Kandel, T.P.

Baker, Prentice Hall.

Reference Books: 1.Discrete Mathematics with Applications, Thomas Koshy, Elsevier

2. Discrete Mathematical structures Theory and application-Malik &Sen

3. Graph theory with applications to engineering and computer science, by NarsinghDeo –PHI

4. Elements of Discrete Mathematics - A Computer Oriented Approach, C. L. Liu, D. P.Mohapatra ,

3rd

Edition , TMH.


B.Tech - 3rd

Semester

SYLLABUS


Course Title: DATA STRUCTURES LAB Course Code:

L T P C

0 0 3 2

Implement the following experiments:

1.Write programs to perform Linear search and Binary search for a Key value in a given list.

2.Implement any two sorting techniques using an appropriate data structure

3.Implement Stacks and Queues using arrays

4.Implement Singly Linked Lists.

5.Implement Doubly Linked Lists

6.Implement Stacks and Queues using linked lists

7.Implement Open Hashing (Chaining) and Closed Hashing (Linear Probing)usingappropriate

data structures

8.Write a program to demonstrate different Binary Tree Traversals.

9.Write a program to demonstrate BST operations

10.Write a program to demonstrate AVL tree operations

11.Write a program to demonstrate Heap operations

12.Write a program to demonstrate different Graph Traversals


B.Tech - 3rd

Semester

SYLLABUS


Course Title: DIGITAL LOGIC DESIGN LAB Course Code:

L T P C

0 0 3 2


1. Number base conversions

2. 4-bit word Parity generator/checker

3. Realization of Logic gates and Verification of Truth Tables

4. Verification of Boolean Laws and Theorems using Truth tables

5. Realization of basic gates using Universal gates

6. Construction of half-adder, half-subtractor, full-adder, full-subtractor and verification of their truth

tables

7. Verification of the properties of decoders and encoders

8. Verification of the functioning of Multiplexer and De-multiplexers

9. Realization of 4-Bit comparator using IC.

10. Realization of Flip-Flops using IC’s.

11. Verification of functioning of Basic Shift Register (SR), SI/SO SR, SI/PO SR, PI/SO SR, PI/PO

12. Realization of Up/Down ,Modulo - 5, Modulo – 10 counters


B.Tech- 4th

Semester


Course Title: DATA COMMUNICATIONSYSTEMS Course Code:

L T P C

3 1 0 4

Course objectives : The course content enables students to:

• Understand fundamentals of Standards and n/w architecture and Types of Data Transmission and

Modulation systems

• Understand the building blocks of an Optical Fiber system

• To explore the terminology used in optical fibers.

• Analyzing PCM and their types and T CARRIERS and TDM , FDM

• Understand the Electromagnetic Waves and Satellite Communications Systems

• Designing the Telephone Circuit with various arrangements

• Acquire knowledge about Cellular Telephone Systems and Digital Cellular Telephone

• Emphasize data on various error detection and correction techniques.

• Explore the concepts of Character –and Bit- Oriented Protocols,

• Explore Asynchronous and Synchronous Data – Link Protocols and HDLC

Course Outcomes:At the end of the course students will be able to:

• Acquire knowledge of fundamental concepts of data transmissions standards and to learn the

fundamental digital techniques for Communication.

• Understand the design, operation and capabilities of optical fiber systems.

• Acquire knowledge of various digital transmissions(PCM)&multiplexing of FDM and TDM

• Design a system, component or process as per needs and specification.

• Develop applications by analyzing the requirements of software.

• Understand the technical specifications of electronic communication design.

• Know the concepts of Mobile Communications.

• Explore the knowledge of various error detection and correction techniques.

• Design and analyze the experiment and interpret data.

• Acquire knowledge of Data link protocols like Character –and Bit- Oriented Protocols and HDLC.

UNIT – I 16Hrs

INTRODUCTION TO DATA COMMUNICATIONS AND NETWORKING: Standards Organizations for Data Communications, Layered Network Architecture, Open Systems

Interconnection, Serial and parallel Data Transmission.

Signals, Noise, Modulation and De-Modulation: Signal Analysis, Electrical Noise, M-ary Encoding, Analog

and Digital Modulation systems.

Metallic Cable Transmission Media: Metallic Transmission Lines, Metallic Transmission Line Types,

Metallic Transmission Line Equivalent Circuit, Wave Propagation on Metallic Transmission Lines,Optical

Fiber Transmission Media:Optical Fiber Communications System Block Diagram, Optical Fiber Modes

Optical Fiber construction, Propagation of Light Through an Optical fiber Cable.

UNIT – II 15hrs

DIGITAL TRANSMISSION: Pulse Modulation, Pulse code Modulation, Linear Versus Nonlinear PCM Codes, Delta Modulation, PCM

and Differential PCM.

MULTIPLEXING and T CARRIERS: Time-Division Multiplexing, T1 Digital Carrier System, North

American Digital Multiplexing Hierarchy, TCarriersystems, Frequency-Division Multiplexing.

Wireless Communications Systems:Electromagnetic Polarization, Rays and Wave fronts, Electromagnetic

Radiation, the Inverse Square Law, Terrestrial Propagation of Electromagnetic Waves, Microwave

Communications Systems, Satellite Communications Systems.

UNIT-III 15Hrs

TELEPHONE INSTRUMENTS AND SIGNALS: The Subscriber Loop, Standard Telephone Set, Basic Telephone Call Procedures, Cordless Telephones,

Paging systems.

The Telephone Circuit: Telephone Message- Channel Noise and Noise Weighting, Transmission Parameters

and Private-Line Circuits, Voice-Frequency Circuit Arrangements.

Cellular Telephone Systems: First- Generation Analog Cellular Telephone, Second-Generation Cellular

Telephone Systems, N-AMPS, Digital Cellular Telephone, Global system for Mobile Communications,

Personal Communications Satellite System.

UNIT-IV 14Hrs

DATA COMMUNICATIONS CODES, ERROR CONTROL, AND DATA FORMATS: Data Communications, Character Codes, Error Control, Error Detection and Correction.

Data Communications Equipment: Digital Service Unit and Channel Service Unit, Voice- Band Modern

Block Diagram, Voice- Band Data Communication Modems.

Data –Link Protocols:Data –Link Protocol Functions, Character –and Bit- Oriented Protocols, Asynchronous

Data – Link Protocols, Synchronous Data – Link Protocols, High – Level Data – Link Control

Text Books :

1. Introduction to Data Communications and Networking, Wayne Tomasi, Pearson

Education.

2. Data Communications and Networking, Behrouz A Forouzan, 4th

Edition, TMH.

Reference Books: 1.Computer Communications and Networking Technologies, Gallow,2

nd Edition Thomson

2. Computer Networking and Internet, Fred Halsll, Lingana Gouda Kulkarni, 5th

Edition,

PearsonEducation.


B.Tech- 4th

Semester


Course Title: DATABASE MANAGEMENT SYSTEMS Course Code:

L T P C

3 1 0 4


• Understand the differences between File system and DBMS, Data Models and database system

structure.

• Know how to use the integrity constraints over the relations and expressive power of Algebra and

calculus

• Learn the query language features which are the core of SQL’s DML, Join operations and Triggers.

• Learn normalization procedure to eliminate the redundancy in the databases

• know the concept of the transaction management which is the foundation for concurrent execution and

recovery from the system failure in a DBMS

• Learn the recovery techniques for managing the database effectively and avoid the data lose.

• Know how to arrange the records in a file when the file is stored on the external storage.


• Identify and define the data models needed to design a database

• Create conceptual and logical database design for Large enterprises

• Apply Integrity constrains over the relations

• Apply normalization process on existing database for eliminating redundancy

• Apply the recovery techniques for managing the database effectively to avoid the data lose

UNIT I 15Hrs

Introduction to DBMS: Database System Applications, database System Vs file System, View of Data,

Data Abstraction, Instances and Schemas, data models, the ER Model, Relational Model, Network model,

Hierarchy model. Database Languages: DDL, DML, DCL.DBMS architecture.

Database Design: Introduction to database design, ER Model, Additional features

of ER Model, Conceptual Design with the ER Model, Conceptual design for large enterprises.

UNIT II 15Hrs

Introduction to the Relational Model: Integrity constraints, Relational Algebra, Selection and projection

set operations, renaming, Joins, Division, Relational calculus: Tuple relational Calculus , Views.

SQL Queries: Form of Basic SQL Query, Introduction to Nested Queries ,Correlated Nested Queries ,Set

Comparison Operators, Aggregative Operators – NULL values ,Outer Join, Logical connectivity’s ,AND,

OR and NOT , Triggers.

UNIT III 15Hrs

Schema refinement: Problems Caused by redundancy, Decompositions, Functional dependency, FIRST,

SECOND, THIRD Normal forms – BCNF, Multi valued Dependencies – FOURTH Normal Form.

Transactions: Transaction State, ACID properties of transaction, serial schedule, parallel schedule,conflicts

in concurrent Executions, Serializability, Recoverability, performance of locking, transaction support in

SQL.

UNIT IV 15Hrs

Concurrency Control: Introduction to Lock Management, Lock Conversions, Dealing with Deadlocks,

Specialized Locking Techniques, Concurrency without Locking.

Crash Recovery: Introduction to ARIES, the Log, other recovery related structures, the Write-Ahead Log

Protocol, Check pointing – recovering from a system.

Data on External Storage: File Organization and Indexing, Cluster Indexes, Primary and Secondary

Indexes, Index data Structures, Hash Based Indexing, Indexed Sequential Access Methods (ISAM), B+

Trees: A Dynamic Index Structure,

Database Security: Threats and risks, Database access control,Types of privileges,

TEXT BOOKS :

1. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGrawHill3rd

Edition

2. Database System Concepts, Silberschatz, Korth, McGraw hill, 5th

Edition.

REFERENCES :

1. Database Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7th

Edition.

2. Fundamentals of Database Systems, Elmasri&Navatha Pearson Education

3. Introduction to Database Systems, C.J.Date Pearson Education


B.Tech- 4th

Semester


Course Title: OBJECT ORIENTED PROGRAMMING THROUGH JAVA Course Code:

L T P C

3 1 0 4


• Understand fundamentals of object-oriented concepts through Java.

• Understand how java achieves platform independence using concept of bytecode.

• Extend existing code and develop new application to demonstrate code reusability

• Keep the related class of code together to create a package and import the same for future application

development.

• Implement multiple inheritances using interface concept.

• Explore concepts of concurrent programming by using multi threading.

• Handle runtime errors through exception handling mechanism.

• Provide graphical user interface for their application programs.

• Write applications that handle user interactions through various peripheral devices.


• Know the concepts of classes, objects, members of a class and the relationships among them

• Implement Applications using Packages

• Handle runtime errors using Exceptions handling mechanism.

• Develop application for concurrent processing using Thread concepts

• Design interactive applications for use on internet.

• Design applets that take user response through various peripheral devices such as mouse and

keyboard by event handling mechanism

UNIT- I 14Hrs

Introduction to Java: Overview of Object Oriented Programming principles, Importance of Java to the Internet, Bytecode,

Methods, classes and instances. Data types, arrays, control statements, simple java program.

Classes and Objects – constructors, methods, access control, this keyword, overloading methodsand

constructors, garbage collection.

UNIT-II 14Hrs Inheritance: Hierarchical abstractions, Base class and subclass, subtype, substitutability, forms of

inheritance-specialization, specification, construction, extension, limitation, combination. Benefits of

inheritance, super keyword, final keyword with inheritance, polymorphism, abstract classes.

Packages: Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages,

Member access rules.

Interface: Defining an interface, differences between classes and interfaces, implementing interface,

variables in interface and extending interfaces.

UNIT- III 16Hrs Exception handling: Concepts and benefits of exception handling, exception hierarchy, usage of try, catch,

throw, throws and finally, built-in and User Defined Exceptions,

Multithreading: Definition thread, thread life cycle, creating threads, synchronizing threads, daemon

threads.

UNIT IV 16 Hrs Applets: Concepts of Applets, differences between applets and applications, life cycle of an applet, types of

applets, creating applets, passing parameters to applets,The AWT class hierarchy, user interface components-

labels, button, Text components.

Event Handling: Events, Delegation event model, handling mouse and keyboard events, Adapter classes,

inner classes. Compare basic AWT components with swing components. More user interface components -

canvas, scrollbars, check box, choices, lists panels – scrollpane, dialogs, menubar, layout manager types.

Text Books: 1. Java: The complete reference, Herbert schildt, 7

th Edition, TMH.

2. An Introduction to Object-Oriented Programming by Timothy A Budd, 3rd

Edition ,Addison Wesley

Longman

Reference Books: 1. Java: How to Program, Dietal&Dietal, 8

th Edition, PHI

2. Programming with Java A Primer, E.Balaguruswamy Tata McGraw Hill Companies

3. Core Java 2, Vol 1, Fundamentals by Cay.S.Horstmann and Gary Cornell, 7th

Edition, Pearson Education.

4. BIG JAVA Compatible with Java 5 & 6, Cay Horstmann ,3rd

Edition , Wiley Publishers.


B.Tech- 4th

Semester


Course Title: OPERATING SYSTEMS Course Code:

L T P C

3 1 0 4


• Understand Objectives, Functions, Services of Operating Systems and Learn the Concepts of Process

and Process Scheduling

• Understandissues related to Process Synchronization and focus on principles of Deadlock and related

problems of Starvation

• Comprehend the mechanisms used in Memory Management and Virtual Memory.

• Understand the concepts of File System and Disk Scheduling


• Understand the various concepts of process

• Implement concurrency mechanisms

• Implement Bankers Algorithms to handle deadlocks

• Design and analyze mechanisms used in memory management

• Develop processor scheduling, Paging technique Algorithms

UNIT – I 14 Hrs Operating Systems Overview: Introduction to Operating Systems, Operating System Structure, Operating

System Operations, Operating System Services, System calls, Types of System Calls.

Process Management: Introduction to Process, Process Scheduling, Operations on Processes, Inter Process

Communication, Process Scheduling Criteria, and Scheduling Algorithms and its Evaluation.

UNIT – II 16 Hrs Process Synchronization: Introduction to Process synchronization, The Critical-Section Problem,

Peterson’s Solution, Synchronization Hardware, Semaphores, and Classical Problems of Synchronization

using Semaphores

Deadlocks: System Model, Deadlock Characterization, Methods for Handling

Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock.

UNIT-III 15 Hrs Memory Management: Introduction to Memory Management, Swapping, Contiguous Memory Allocation,

Paging, Segmentation.

Virtual Memory Management: Introduction to Virtual Memory Concept, Demand Paging, Copy on Write,

Page Replacement Algorithms, Allocation of Frames, Thrashing.

UNIT-IV 15 Hrs File System: File Concept, Access Methods, Directory Structure, File System Structure, Allocation Methods,

Free-Space Management.

Secondary Storage Structure: Overview of Mass Storage Structure, Disk Structure, Disk Scheduling.

Text Books: 1. Operating System Concepts- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7

thEdition,

John Wiley

2. Operating Systems Internal and Design Principles, Stallings, 6th

Edition–2005, Pearson education

Reference Books: 1. Operating systems- A Concept based Approach-D.M.Dhamdhere, 2

nd Edition, TMH

2. Operating System A Design Approach-Crowley, TMH.

3. Modern Operating Systems, Andrew S Tanenbaum, 3rd

edition, PHI.


B.Tech- 4th

Semester


Course Title: THEORY OF COMPUTATION Course Code:

L T P C

3 1 0 4


• Understand the concept of Set Operations, Cardinality and Denumerable sets. Acquire knowledge to

design, specify and test deterministic and nondeterministic finite automata that recognize regular

languages.

• Understand tuple descriptions of Mealy and Moore finite-state machines, State diagrams, state tables and

their relationship.

• Acquire the idea to write regular expressions and regular grammars that produce regular languages.

• Identify non-regular languages using the Pumping Lemma.

• Acquire Knowledge of Formal Languages, Grammars, Derivations and parse trees.

• Understand the concept of transforming context-free grammars by removing useless productions, lambda

productions and unit productions.

• Acquire the idea to design, specify and test grammars and also deterministic/nondeterministic pushdown

automata that recognize context-free languages.

• Understand the knowledge to design, specify and test Turing Machines that recognize recursively

enumerable languages.


• Know the regular expressions and regular grammars that produce regular languages

• Analyze and solve Chomsky and Greibach normal forms.

• Design deterministic and nondeterministic finite automata that recognize regular languages.

• Develop push down automata for context free grammars.

• Design Turing machines those recognize recursively enumerable languages.

UNIT – I 16Hrs Finite automata: Finite state machine, definitions, finite automation model, acceptance of strings and

languages, Deterministic finite automaton and non-deterministic finite automaton, transition diagrams. NFA

with ε transitions, Equivalence between NFA with and without ε transitions, NFA

to DFA conversion, minimization of FSM, equivalence between two FSM’s Finite Automata with output-

Moore and Mealy machines.

UNIT – II 14Hrs Regular languages: Regular sets, regular expressions, identity rules, Constructing finite Automata for a

given regular expressions, Conversions of Finite Automata to Regular expressions. Pumping lemma of

regular sets, closure properties of regular sets (proofs not required).Regular grammars-right linear and left

linear grammars, interconversion between regular grammar and FA, Context free grammar, derivation trees,

right most and leftmost derivation of strings.

UNIT – III 15Hrs Context Free Grammars and PDA: Ambiguity in context free grammars. Minimization of Context Free

Grammars, Chomsky normal form, Greibach normal form, Enumeration of properties of CFL (proofs

omitted).Push down automata, definition, model, acceptance of CFL, acceptance by final state and

acceptance by empty state. Inter conversion CFL and PDA.

UNIT – IV 15Hrs Turing Machine: Turing Machine, definition, model, design of TM, Computable functions, recursively

enumerable languages, types of Turing machines,Chomsky hierarchy of languages, linear bounded automata

and context sensitive language, undecidability of posts Correspondence problem, Turing reducibility,

Definition of P and NP problems, NP complete and NP hard problems.

Text book: 1. Introduction to Automata theory Language and Computation by Jeffery D. Ullman and John E. Hopcroft,

Narosa Publishing House.

2. Introduction to computer theory, Daniel I.A cohen, John Wiley.

REFERENCES:

1. Theory of computer science –Automata language and computation – Mishra and Chandrashekaran,

2nd

Edition, PHI.

2. Elements of theory of computation, Lewis H.P & Papadimitriou C.H, Pearson/ PHI


B.Tech- 4th

Semester


Course Title: DATABASE MANAGEMENT SYSTEMS LAB Course Code:

L T P C

0 0 3 2


1. Execute Single line and Groupfunctions for a table.

2. Implement Queries using GROUP BY &HAVINGclauses, set operators and set comparison operators.

3. a) Execute DCL commands

b) Creation and dropping of Views.

4. Create and manipulate various DB objects for a table.

5. a)Creation of simple PL/SQL program which includes declaration section, executable section

and exception –Handling section

b)Insert data into student table and use COMMIT, ROLLBACK and SAVEPOINT in PL/SQL

block.

6. Develop a program that includes the features of NESTED IF and CASE. The program can be extended

using the NULLIF and COALESCE functions.

7. Develop a Program using WHILE LOOPS, numeric FOR LOOPS, nested loops using ERROR Handling,

BUILT –IN Exceptions, User-defined Exceptions, RAISE- APPLICATION ERROR.

8. Develop a Program using creation of procedures, passing parameters IN and OUT of PROCEDURES.

9. Develop a Program using creation of stored functions, invoke functions in SQL Statements and write

complex functions.

10. Develop a Program using packages.

11. Write PL/SQL procedure for an application using cursors.

12. Create sample triggers and assertions


B.Tech- 4th

Semester


Course Title: OBJECTORIENTED PROGRAMMING THROUGH JAVALAB

Course code:

L T P C

0 0 3 2

Implement the followingexperiments:

Use JDK 1.5 or above on any platform e.g. Windows or Unix.

1. Write a Java program to demonstrate String handling methods.

2. Write a Java program for sorting a given list using inheritance concept.

3. Write a Java program for creating one base class for student personal details and inherit those details into

the sub class of student Educational details to display complete student information.

4. Write a Java program to implement matrix operations using multidimensional arrays

5. Write a Java program that illustrates runtime polymorphism

6. Write a Java program, to demonstrate tokenizing given string/text using StringTokenizer class

7. Write a Java program to create a package which has classes and methods to read Student Admission

details.

8. Write a Java program to define and handle Exceptions in the implementation of Program3.(also make use

of throw, throws).

9. Write a Java program to create multiple threads for different calculator operations.

10. Write an Applet to draw various geometrical shapes

11. Write a Java program for handling mouse events.

12. Write a Java Program to design a Job Application/ Student Admission Form.

13. Write a Java program that works as a simple Calculator.

Department of Computer Science and Engineering

B.Tech- 5th

Semester


Course Title: MICROPROCESSORS AND INTERFACING Course Code: ECE 3429

L T P C

3 1 0 4

Course objectives:

Students undergoing this course are expected to:

1. familiarize with the architecture of 8086 processor, assembling language programming and

interfacing with various modules.

2. Learn to Interface various I/O peripherals like ADC, DAC, Keyboard, stepper motor etc., with

microprocessors using 8255 PPI.

3. do any type of industrial and real time applications by knowing the concepts of Microprocessors

4. understand 8251-USARTand serial communication concepts.

Course Outcomes:

After undergoing the course, students will be able to

1. Understand the full internal workings of a typical simple CPU including the utilization of the various

hardware resources during the execution of instructions.

2. Introduce the design of basic I/O hardware and microprocessor interfacing: memory chip selection,

memory expansion, I/O interfacing.

3. Interface input and output devices like LCD, LED, Keyboards ADC, DAC and stepper motor to

microprocessors.

4. Design the home appliances and toys using Microprocessor chips.

UNIT- I

8086 Architecture: (12 hours)

8086-Functional Diagram, Register Organization, Signal description, Physical Memory Organization,

Minimum and Maximum mode operations of 8086, Timing Diagrams.

UNIT- II

Instruction Set of 8086: ( 16 hours)

Addressing modes, Data Transfer Instructions, Arithmetic Instructions, Bit Manipulation Instructions,

Branch Instructions, Processor Control Instructions and String Instructions.Assembler Directives, Procedures

and macros, Assembly Language Programming Examples.

UNIT- III

Programmable devices and Interfacing of I/O with 8086: ( 16 hours)

Semiconductor Memory Interfacing, 8255 PPI-Various modes of operations, Stepper Motor interfacing, D/A

and A/D Conversions, DMA Controller 8257.

UNIT-IV

8086 Interrupts and Serial Communication (16 hours)

8086 interrupts and Interrupt Vector Table (IVT), Programmable Interrupt Controller 8259A, Serial data

transfer schemes. Asynchronous and Synchronous data transfer schemes, Programmable Communication

Interface 8251 USART, TTL to RS 232C and RS232C to TTL conversion, Sample program of serial data

transfer.

Text Books:

1. Ray and Bhurchandi, “ Advanced Microprocessors”, Tata McGraw-Hill 2nd

edition 2007

2. D.V.Hall, “Microprocessor and Interfacing “, Tata McGraw-Hill.

Reference Books:

1. Microcomputer system 8086/8088 family architecture, programming and design Liu and GA Gibson,

PHI second edition


B.Tech- 5th

Semester


Course Title: Computer Networks Course Code:

L T P C

3 1 0 4

Course Objectives:

The course content enables students to :

� Understand basic network models and Different transmission used for data communication.

� Recognize the data link design issues and various data link protocols used for data transmission.

� Understand different routing algorithms used for data transmission from source to destination in a

network layer.

� Know how internet address are installed and how internet protocols are used in connecting internet.

Course Outcomes:

At the end of the course students are able to:

� Suggest appropriate network model for data communication.

� Know how reliable data communication is achieved through data link layer.

� Propose appropriate routing algorithm for data routing.

� Connect internet to the system and knowledge of trouble shooting.

UNIT I: INTRODUCTION (11+4) Hours Network Hardware, Network Software, and Reference Models: OSI, TCP/IP, The ARPANET, Network

Topologies , Physical Layer: Transmission media: Magnetic Media, Twisted pair, Base band Coaxial Cable,

Fiber optics, Wireless Transmission: Electromagnetic Spectrum, Radio Transmission, Microwave

Transmission.

UNIT II (12+4) Hours Data link layer: Design issues: framing, error detection and correction, CRC, Elementary Data link

Protocols: Stop and wait, Sliding Window protocols: Go-back-n, Selective Repeat, Medium Access sub

layer: Channel allocation methods, Multiple Access protocols: ALOHA, CSMA,

IEEE Standard 802.3 and Ethernet, IEEE Standard 802.4: Token bus.

UNIT – III: (10+3) Hours Network Layer: Network Layer design issues, Virtual circuit and Datagram subnets, Routing algorithms:

Shortest path routing, Flooding, Hierarchical routing, Distance vector routing. Broad cast and Multi cast

routing, Congestion Control: Congestion prevention policies.

UNIT –IV: (12 +4) Hours The Network layer in the internet: The IP Protocol, IP Addresses, and Internet Control Protocols.

Transport Layer: Transport Services, Connection management, Elements of Transport Protocols, Internet

Transport Protocols: UDP and TCP.

Application Layer - Domain name system, Electronic Mail, WWW

TEXT BOOK: 1. Computer Networks — Andrew S Tanenbaum, 4th Edition. Pearson Education /PHI

REFERENCES: 1. Data Communications and Networking - Behrouz A. Forouzan. Third Edition TMH

2. Understanding communications and Networks, 3rd Edition, W.A. Shay, Thomson


B.Tech- 5th

Semester


Course Title: Design and Analysis of Algorithms Course Code:

L T P C

3 1 0 4

Course Objectives:


� Know asymptotic runtime complexity of algorithms including formulating recurrence relations using

divide and conquer process.

� Understand and design algorithms using greedy strategy and dynamic programming, to arrive at local

best solution.

� Understand and design of algorithms using search space and optimization problem techniques for

finding globally best solution.

� Identify basic computability concepts and the complexity classes like P, NP, and NP-Complete and

Relate real world problems to abstract mathematical problems.

Course Outcomes:


� Analyze the asymptotic runtime complexity of algorithms for real world problems developed using

different algorithmic methods.

� Find the optimal solutions by using advanced design and analysis of

algorithm techniques like greedy method and dynamic programming.

� Apply the search space and optimization problem techniques like backtracking and branch and bound

method to solve problems optimally where advanced algorithm design techniques fail to find solution.

� Distinguish the problems and its complexity as polynomial and NP problems and can formulate some

real world problems to abstract mathematical problems.

UNIT I: (11+5)

Introduction to Algorithm as Technology: Performance Analysis: - Space complexity, Time complexity. Amortized Analysis

Growth of Functions: Asymptotic Notation- Big oh notation, Omega notation, Theta notation, little oh, little

omega.

Recurrences: The Master Method.

Divide and conquer: General method, applications:-Fibonacci Search, Quick sort,

Disjoint Sets: Disjoint operations, UNION-FIND Algorithms

UNIT II: (13+3)

Advanced Design and Analysis of Algorithm Techniques Greedy method: General method, applications:-Job sequencing with deadlines, Minimum cost spanning

trees (Kruskal’s Algorithms), Single source shortest path problem (Dijkstra’s Algorithms), Optimal Merge

Patterns (two way merge pattern).

Dynamic Programming: General method, applications:-Matrix chain multiplication, 0/1 knapsack problem,

all pairs shortest path problem.

UNIT III: (11+3)

Search space and optimization problem techniques Backtracking: General method, applications:-n-queen problem, sum of subsets problem

Branch and Bound: General method, LC Branch and Bound solution & FIFO Branch and Bound solution.

Applications: - Traveling sales person problem

UNIT IV: (11+3)

Introduction to NP Problems and computing algorithms NP-Hard and NP-Complete problems: Basic concepts, NP - Hard and NP Complete classes, Cook’s

theorem.

Number-Theoretic Algorithms: the Chinese remainder theorem, powers of an element

Polynomials and FFT: Representations of polynomials, the Fast Fourier Transform (FFT)

TEXT BOOKS: 1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam, University

press.

2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L. Rivest, and C.Stein, PHI

Pvt. Ltd./ Pearson Education

REFERENCES: 1. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee, S.S.Tseng,

R.C.Chang and T.Tsai, McGraw Hill.

2. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson

education.

3. Algorithms – Richard Johnson baugh and Marcus Schaefer, Pearson Education.


B.Tech- 5th

Semester


Course Title: SOFTWARE ENGINEERING Course Code:

L T P C

3 1 0 4

COURSE OBJECTIVE(S):


� Learn about software myths ,generic view of the process and Understand about process models

� Learn how to perform feasibility study of the projects under the requirement engineering process and

system models.

� Understand about Function oriented design and Architectural styles

� Get the knowledge of software testing and testing strategies, learn about risk management plan and

quality concepts.

COURSE OUTCOME(S):

At the end of the course students are able to :

� Design and develop real-time software projects with effective cost estimation and plan

� Make feasibility study of a project

� Specify the design and architectural style of the software products

� Propose testing strategy for a given software

UNIT I: (12+4)

Introduction: software engineering is discipline, software development projects, emergence of software

engineering, Notable Changes in software development process. The evolving role of software, Changing

Nature of Software, Software myths.

Software life cycle Models: need of life cycle model, classical and iterative waterfall model, Prototype,

Evolutionary, spiral model, comparison of all the models.

UNIT II: (11+4)

Software Requirements: Functional and non-functional requirements, User requirements, System

requirements, Interface specification, the software requirements document.

Requirements engineering process: Feasibility studies, Requirements elicitation and analysis,

Requirements validation, Requirements management.

System models: Context Models, Behavioral model1, Data models, Object models, structured methods

UNIT III: (11+4)

Function Oriented Design: Structured analysis, DFD and its Extension, structured design detailed design.

Design Engineering: Design process and Design quality, Design concepts, the design model.

Creating an architectural design: Software architecture, Data design, Architectural styles and patterns,

Architectural Design

Unit IV: (12+4)

Performing User interface design: Golden rules, User interface analysis and design and steps

Coding and Testing: coding and review, testing, Unit testing, integration testing black box and white box

testing, debugging, system testing, object oriented programs testing,

Risk management: Reactive vs. Proactive Risk strategies, software risks, Risk identification, Risk

projection, Risk refinement, RMMM, RMMM Plan.

Software Quality: Reliability, quality and management system, Quality concepts, ISO, SEI CMMI,PSP, Six

sigma. Quality assurance techniques.

TEXT BOOKS :

1.”Fundamentals of software Engineering” Rajib Mal 3

rd edition, Eastern Economy Edition, ISBN-978-81-

203-3819-7

2. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition.

McGraw-Hill International Edition.

REFERENCE BOOK: 1. Software Engineering- Sommerville, 7th edition, Pearson education.


B.Tech- 5th

Semester


Course Title: UNIX PROGRAMMING Course Code:

L T P C

3 1 0 4

Course Objectives:

The course content enables students to:

� Understand the Unix file system, Unix commands, and Shell programming concepts

� Understand basic functions that perform File I/O and Process

� Illustrate the Inter process communication (IPC) mechanisms used in UNIX OS.

� Understand the purpose of sockets in the client server communication.

Course Outcomes:


� Know how Unix File Structure is organized, familiarize with Unix commands, and implement shell

scripts.

� Apply basic functions of File I/O to see the effect of various I/O sizes on the amount of time required

to read a file.

� Implement and analyze IPC using pipes, semaphores, and messages.

� Implement Client / Server applications using elementary sockets.

UNIT – 1 (12+3) Introduction to Unix file system, vi editor, file handling utilities, security and file permissions, process

utilities, disk utilities, networking commands, text processing utilities and backup utilities.

Working with the Bourne shell: what is a shell, shell responsibilities, pipes and input redirection, output

redirection, here documents, the shell as a programming language, shell meta characters, shell variables,

shell commands, the environment, control structures, shell script examples.

UNIT – 2 (11+4) Unix file structure, directories, low level file access (open, creat, read, write, close, lseek, stat, fstat, octl,

umask, dup, dup2). File and directory maintenance (chmod, chown, unlink, link, symlink, mkdir, rmdir,

chdir, getcwd), Directory handling system calls (opendir, readdir, closedir, rewinddir, seekdir, telldir)

Unix Process: process, process structure, process identifiers, zombie process, fork, vfork, exit, wait, waitpid,

exec functions and system function.

UNIT – 3 (11+4) Signals- Signal functions, unreliable signals, interrupted system calls, kill and raise functions, alarm, pause

functions, abort, sleep functions.

Interprocess Communication Overview: Introductions to IPC, pipes, FIFOs, namespaces, Message Queue.

UNIT – 4 (11+4) Semaphores: Unix System V semaphores, unix kernel support for semaphores, file locking with semaphores.

Sockets: Introduction, UNIX domain protocol, socket addresses, elementary sockets system calls.

TEXT BOOKS:

1. Unix Network Programming, W. R. Stevens Pearson/ PHI

2. Unix the ultimate guide, 3rd

edition, Sumitaba Das, TMH

REFERENCE BOOKS: 1. Advanced Programming in the UNIX® Environment: Second Edition, PE, Stevens.

2. Advanced Unix Programming, N. B. Venkateswarlu, BS publications, 2e.

3. Unix and shell programming, B. A. Forouzan, Richard F Gilberg, Cenange


B.Tech- 5th

Semester


Course Title: MICROPROCESSORS AND INTERFACING LAB Course Code: ECE 3230

L T P C

0 0 3 2

Course objectives : The students are intended to:

� Demonstrate basic knowledge of Microprocessor & Interfacing by understanding the architecture of

8086 processor

� Learn Assemblers like MASM/TASM.

� Learn Assembly language programming and Machine level opcode generation.

� Interface 8086 with various modules like 8255 – PPI, 8251 – USART.

� Design any type of industrial oriented and real time applications by knowing the concepts of

Microprocessor.

Course outcomes : After completing the course the students will able to:

� Control Traffic lights signals using Microprocessors chips.

� Design computers like desktops , laptops using various processors .

� Design the high speed communication circuits using serial bus connection for computers.

� Understand the full internal workings of a typical simple CPU including the utilization of the various


� Introduce the design of basic I/O hardware and microprocessor interfacing: memory chip selection,


List of Experiments

Part-A

Microprocessor 8086: Any 7 Experiments Introduction to MASM/TASM.

1.Arithmetic operation – Multi byte addition and subtraction, Multiplication and Division – Signed and

unsigned Arithmetic operations, ASCII – arithmetic operations. (Any 2 Experiments)

2.Logic operations – Shift and rotate – Converting packed BCD to unpacked BCD, BCD to ASCII

conversion. ( Any 1 Experiment)

3.String operations-- Move Block, Reverse string, Sorting, Inserting, Deleting, Length of the string, String

comparison. ( Any 3 Experiments)

4.Modular Program: Procedures and macros -Near and Far implementation. (Any 1 Experiment)

Part-B

Interfacing 8086 – Any 3 Experiments

1. 8251 – USART.

2. Traffic lights

3. Message Displays

4. Keyboard

5. Stepper Motor

6. DAC


B.Tech- 5th

Semester


Course Title: COMPUTER NETWORKS LAB Course Code:

L T P C

0 0 3 2



� Understand basic network models and Different transmission media used for data communication.

� Understand the data link design issues and various data link protocols used for data transmission.

� Comprehend different routing algorithms used for data transmission from source to destination in a

network layer.

� Know how internet addresses are configured and how internet protocols are used in connecting

internet.

COURSE OUTCOME(S):


� By learning models students suggest appropriate network model for data communication.

� Know how reliable data communication is achieved through data link layer.

� Suggest appropriate routing algorithm for the network.

� Provide internet connection to the system and its installation.

Course Contents

1. a. Familiarization with Networking Components and devices: LAN Adapters,

Hubs, Switches, Routers etc.

b. Familiarization with Transmission media and Tools: Co-axial cable, UTP

Cable, Crimping Tool, Connectors etc.

2. Preparing the UTP cable for cross and direct connections using crimping tool.

3. Implement the data link layer framing methods :

a) character stuffing b) bit Stuffing

4. Implement on a data set of characters the two CRC polynomials: CRC 12, CRC 16

5. Implement on a data set of characters the CRC polynomials: CRC CCIP .

6. Implementation of sliding window protocol: go back n sliding window protocol

7. Implement Dijkstra ‘s algorithm to compute the Shortest path thru a graph.

8. Take an example subnet graph with weights indicating delay between nodes. Now

Obtain Routing table art each node using distance vector routing algorithm.

9. Take an example subnet of hosts. Obtain broadcast tree for it

10. To configure the IP address for a computer connected to LAN and to configure

network parameters of a web browser for the same computer.

11. Configuration of TCP/IP Protocols in Windows .

12. a. Installing of internal modem and connecting to Internet.

b. To configure WiFi for your PC.


B.Tech- 5th

Semester


Course Title: UNIX PROGRAMMING LAB Course Code:

L T P C

0 0 3 2

Course Objectives:


� Understand the shell programming concepts in Unix

� Understand the basic functions provided in Unix and C library to perform file I/O

� Understand the working mechanism of IPC using Pipes, FIFOs, and Message Queues

� Understand how to use semaphores to synchronize two processes

Course Outcomes:


At the end of the course the students will be able:

� Implement various shell programs.

� Implement library functions and system calls in Unix operating system

� Implement IPC using pipes, FIFOs, and Message Queues

� Use semaphores to synchronize two processes.

1. a. Write a shell script to generate a multiplication table.

b. Write a shell script that copies multiple files to a directory.

c. Write a shell script that counts the number of lines and words present in a given file.

2. a. Write a shell script that displays the list of all files in the given directory.

b. Write a shell script to simulate basic functions of a calculator

3. Write a shell script to reverse the rows and columns of a matrix.

4. Write a C program that counts the number of blanks in a text file.

a) Using standard I/O b) Using system calls.

5. Implement in C the following Unix commands using system calls.

a) cat b) Is c) mv

6. Write a program that takes one or more file/directory names as command line input and

reports the following information on the file:

a) File type b) Number of links c) Time of last access d) Read, Write and Execute permissions

7. a. Write a C Program that illustrate uses of the mkdir, opendir, readdir, closedir, and rmdir APIs.

b. Write a C Program that illustrates how to execute two commands concurrently with a

command pipe.

8. a. Write a C Program that displays the real time of a day every 60 seconds.

b. Write a C program to handle user generated signals

9. Write a C Programs that illustrates the following:

a) one-way communication using pipes.

b) Two-way communication using pipes.

10. Write a C program that illustrate IPC using FIFOs

11. Write a C program that illustrate IPC using Message Queues

12. Write a C program that demonstrates file locking using semaphores


B.Tech- 6th

Semester


Course Title: COMPUTER GRAPHICS Course Code:

L T P C

3 1 0 4

Course Objectives:


� Learn basic principles and problems of computer graphics.

� Know application areas of computer graphics, different display devices and their characteristics to

display an object.

� Understand background of the geometrical and mathematical foundations with algorithms for

generating points, lines, circles, ellipses and different polygon curves and surfaces, Learn

coordinate systems and different transformations of the object in 2D and 3D coordinate systems

like rotation, translation, scaling and reflection.

� Understand 3D viewing, rendering, visible surface detection algorithms with animation

fundamentals.

Course Outcomes:


� Be familiarized with contemporary graphics hardware, the actual methodology and techniques to

draw computer graphics, animations etc. for the real world presentation and how it is

implemented in Computer graphics software

� Develop new kinds of graphics and animations.

� Design and develop graphics applications with the implementation of advanced methods such as

ray tracing, texture mapping, illumination and shading and be able to build interactive user

interface to manipulate objects in a 3D scene and also in the development of Web pages.

� Demonstrate the ability to develop an animation movie.

UNIT – I (11+4) Introduction: Application of Computer Graphics, overview of graphics systems, raster scan systems,

random scan systems, raster scan display processors.

Output primitives : Points and lines, line drawing algorithms( Bresenham’s and DDA Line derivations and

algorithms), mid-point circle and ellipse algorithms. Filled area primitives: Inside and outside tests,

Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms.

UNIT – II (11+4) 2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations, matrix

representations and homogeneous coordinates, composite transforms, transformations between coordinate

systems.

2-D viewing: The viewing pipeline, viewing coordinate reference frame, window to view-port coordinate

transformation, viewing functions, Cohen-Sutherland and Cyrus beck line clipping algorithms, Sutherland –

Hodgeman polygon clipping algorithm.

UNIT-III (11+4) 3-D object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier

curve and B-Spline curves, Bezier and B-Spline surfaces.

3-D Geometric transformations: Translation, rotation, scaling, reflection and shear transformations,

composite transformations. 3D Viewing pipeline, clipping, projections (Parallel and Perspective).

UNIT-IV

(12+3) Visible surface detection methods: Classification, back-face detection, depth-buffer, scan-line, depth

sorting, BSPtree methods, area sub-division and octree methods.

Computer animation: Design of animation sequence, general computer animation functions, raster

animation, computer animation languages, key frame systems, motion specifications.

Text Books: 1. 1. Computer Graphics C version, Donald Hearn, M.Pauline Baker, Pearson

2. Computer Graphics with Virtual Reality Systems, Rajesh K Maurya, Wiley

Reference Books: 1. Computer Graphics Principles & practice, 2/e, Foley, VanDam, Feiner, Hughes, Pearson

2. Computer Graphics, Peter, Shirley, CENGAGE


B.Tech- 6th

Semester


Course Title: INFORMATION SECURITY Course Code:

L T P C

3 1 0 4

Course Objectives:


� Understand about various Conventional Encryption Principles designed for providing security.

� Learn public key cryptography, key management principles and Learn Pretty Good Privacy (PGP)

which is a computer program that provides cryptographic privacy and authentication.

� Learn IP Security fundamentals, architecture and identifying the key features IP security system.

� Understand about general requirements for Web security, which focus on standardized schemes.

Course Outcomes:


� To analyze a given system with respect to security of the system.

� To create an understanding of Authentication functions the manner in which Message Authentication

Codes and Hash Functions works.

� To examine the issues and structure of Authentication Service and Electronic Mail Security

� Understand conventional and public key cryptographic approaches used in message encryption.

� Able to identify various types of attacks and its effect over the networks.

UNIT – I: (12+3) Introduction: Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services

(Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability), TCP session

hijacking, UDP hijacking, ARP attacks, & Man-in-the-Middle

Attacks. OSI Security Architecture - Classical Encryption techniques – Cipher Principles.

Conventional Encryption Principles: Conventional encryption algorithms - Data Encryption

Standard (DES), Blowfish, CAST-128, Block Cipher Design Principles and cipher block Modes of

Operation, Evaluation criteria for AES Cipher.

UNIT-II: (11+4) Public Key Cryptography: Public key cryptography principles, public key cryptography algorithms, digital

signatures. Digital Certificates, Certificate Authority and key management

Authentication & Hash Function: Authentication requirements – Authentication functions – Message

Authentication Codes – Hash Functions – Security of Hash Functions and MACs – MD5 message Digest

algorithm - Secure Hash Algorithm –RIPEMD-HMAC Digital Signatures – Authentication Protocols –

Digital Signature Standard.

UNIT-III: (11+4) Network Security Authentication Applications: Kerberos – X.509 Authentication Service – Electronic

Mail Security – PGP – S/MIME

IP Security: IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security

Payload, Combining Security Associations and Key Management.

UNIT – IV: (11+4) Web Security: Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security

(TLS), Secure Electronic Transaction (SET).

System Level Security Intrusion detection – password management – Viruses and related Threats – Virus

Counter measures – Firewall Design Principles – Trusted Systems.

Text Books: 1. Network Security Essentials (Applications and Standards) by William Stallings Pearson Education.

2. Hack Proofing your network by Ryan Russell, Dan Kaminsky, Rain Forest

Puppy, Joe Grand, David Ahmad, Hal Flynn IdoDubrawsky, Steve W.Manzuik and Ryan Permeh,

wileyDreamtech.

References: 1. AtulKahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.

2. William Stallings, “Cryptography and Network Security – Principles and Practices”,

PrenticeHallofIndia,ThirdEdition,2003

3. Charles B. Pfleeger, Shari LawrencePfleeger, “Security in Computing”, Third Edition, Pearson Education,

2003.


B.Tech- 6th

Semester


Course Title: LANGUAGE PROCESSORS Course Code:

L T P C

3 1 0 4

COURSE OBJECTIVES:


� Learn various translators and phases of compiler.

� Learn context free grammars, top-down and bottom-up parsing.

� Learn symbol tables and intermediate code.

� Learn various code optimization and code generation techniques.

COURSE OUTCOMES

At the end of the course, students are able to

� Deal with different translators and to acquire the knowledge of compiler and its Phases.

� Use of formal grammars for specifying the syntax and Semantics of programming languages

� Build symbol tables and generate intermediate code for a given program.

� Apply the code optimization techniques to improve the performance of a program in terms of speed

and space.

� Design a compiler for a concise programming language.

UNIT – I : [15] Overview of language processing , compiler, assembler , interpreters, linkers & loaders, structure of a

compiler, phases of a compiler, Lexical Analysis, Role of Lexical Analysis, Token, patterns and Lexemes,

Lexical Errors, Regular definitions for the language constructs, Transition diagram for recognition of tokens,

Reserved words and identifiers

UNIT-II [16]

Syntax Analysis, Top-down parsing, First and Follow, LL(1) Grammar, Non-Recursive predictive parsing ,

Bottom-up parsing, Shift Reduce Parsing, Model of an LR Parsers, Construction of SLR Tables,

construction of CLR (1), LALR Parsing tables, Dangling ELSE ambiguity.

UNIT-III [14] Semantic analysis, SDT, Intermediate code , three address code, quadruples, triples, indirect triples, abstract

syntax trees, DAG for expressions, symbol tables, Runtime Environment: storage organization, stack

allocation, access to non-local data, heap management

UNIT-IV [15] Machine independent code optimization, Common sub expression elimination, constant folding, copy

propagation, dead code elimination, strength reduction, loop optimization, basic blocks, Flow graph, DAG

for basic blocks, Machine dependent code optimization: Peephole optimization, register allocation,

instruction scheduling

Text books: 1. Compilers, Principles Techniques and Tools- Alfred V Aho, Monical S Lam, Ravi Sethi, Jeffrey D.

Ullman,2nd ed, Pearson,2007.

2. Principles of compiler design, V. Raghavan, 2nd

edition, TMH, 2011.

Reference books: 1. Principles of compiler design, 2nd ed, Nandini Prasad, Elsevier

2. Compiler construction, Principles and Practice, Kenneth C Louden, CENGAGE

3. Implementations of Compiler, A new approach to Compilers including the algebraic

methods, Yunlinsu, SPRINGER


B.Tech- 6th

Semester


Course Title: DIGITAL SIGNAL PROCESSING Course Code: ECE 3421

L T P C

3 1 0 4

Course objectives: The course content enables students to :

1. Enhance the analytical ability of the students in facing the challenges

posed by growing trends in communication, control and signal processing areas.

2. develop ability among students for problem formulation, system design and solving skills

3. demonstrate basic knowledge of Digital Signal Processing by understanding various transformations

4. Understand Various Discrete-time signals and class of Linear shift-invariant systems will be studied

using the convolution sum, and the frequency domain, using transformations.

5. design system with digital network composed of adders, delay elements, and coefficient multipliers.

Course Outcomes: At the end of the course students are able to

1. analyze the system in Time and Frequency domain through its respective tools.

2. demonstrate knowledge of complex number, Fourier series and ability to design electrical and

electronics systems, analyze and interpret data.

3. design the digital filter circuits for generating desired signal wave shapes (non sinusoidal) for

different applications like computers, control systems and counting and timing systems.

4. design the digital computer or digital hardware for quantizing amplitudes of signals.

5. design the various processing circuits that are necessary in the hardware or interfacing blocks in

systems used in radars, satellite etc

UNIT-I

Introduction to Discrete –Time signals and systems (15 hours)

Classification of Discrete time signals & sequences, linear Time Invariant (LTI) systems, (BIBO) stability,

and causality. Linear convolution in time domain and graphical approach.

Concept of Z-transforms, Region of Convergence, properties, Inverse Z transform, Realization of Digital

filter structures: Direct form-I, Direct form-II, Transposed form, cascaded form, Parallel form.

UNIT-II

Discrete –Time signals in Transform domain (15 hours)

Discrete Fourier Series(DFS), Discrete Time Fourier transforms(DTFT), Discrete Fourier transform(DFT),

Properties of DFT , linear convolution using DFT, Circular convolution, Fast Fourier transforms (FFT) -

Radix-2 decimation in time and decimation in frequency FFT Algorithms, Inverse FFT.

UNIT-III

IIR Digital Filters: (15 hours)

Analog filter approximations – Butter worth and Chebyshev , Impulse Invariant transformation , Bilinear

transformation, Design of IIR Digital filters from analog filters.

UNIT-IV

FIR Digital Filters & Multi rate Signal Processing (15 hours)

FIR Digital Filters: Characteristics of FIR Digital Filters, frequency response,

Design of FIR Digital Filters using Window Techniques, Comparison of IIR & FIR filters.

Multi rate Processing: Decimation, interpolation, sampling rate conversion, Implementation of sampling rate

conversion.

Text Books:

1. Digital Signal Processing by Sanjit K.Mitra 2

nd Edition , TATA McGraw Hill

2. Digital Signal Processing, Principles, Algorithms, and Applications: John G. Proakis, Dimitris

G. Manolakis,Pearson Education / PHI, 2007.

Reference Books:

1.Digital Signal Processing – Alan V. Oppenheim, Ronald W. Schafer, PHI Ed., 2006

2. Digital Signal Processing: Andreas Antoniou, TATA McGraw Hill , 2006

3. Digital Signal Processing: MH Hayes, Schaum’s Outlines, TATA Mc-Graw Hill, 2007.


B.Tech- 6th

Semester


Course Title: EMBEDDED SYSTEMS (Elective-III) Course Code: ECE 4433

L T P C

3 1 0 4

Course objectives: Students undergoing this course are expected to:

1. Know Embedded system compared to General Purpose Systems

2. Learn the typical core of Embedded system design with applications.

3. Gain knowledge on selection of an embedded system based on quality attributes.

4. Understand about Hardware and firmware design of embedded system.

5. Learn complete embedded system life cycle and software utility tools for testing and implementation.

Course Outcomes: After undergoing the course, students will be able to

1. Define differences between embedded system and general purpose systems.

2. Describe embedded system with the help of various components.

3. Analyze the design of embedded system with respect to quality attribute and can demonstrate the up

gradations for real time application.

4. Know the hardware software co design of embedded system.

5. Explore different IDEs to design and implementation of embedded system and able to create real time

applications.

UNIT I (16 hours)

INTRODUCTION Introduction to Embedded Systems and Definition Embedded system versus general Computing Systems

History of Embedded Systems, Classification of Embedded Systems Major application areas of Embedded

Systems and Purpose of Embedded Systems The typical Embedded System-core of Embedded System

Memory ,sensors and actuators Communication Interface Embedded Firmware, other system components

PCB and Passive Components Embedded system with an Example

UNIT II (14 hours)

EMBEDDED SYSTEMS-CHARACTERISTICS AND QUALITY ATTRIBUTES Embedded Systems-Characteristics and Quality Attributes Introduction to Characteristics of Embedded

Systems Quality Attributes of Embedded Systems Application Specific Embedded Systems Washing

machine example Domain Specific Example of Embedded Systems Automotive Embedded Systems

Explaining the characteristics with an example

UNIT III (15 hours)

EMBEDDED HARDWARE AND FIRMWARE DESIGN Embedded Hardware Design Introduction to Embedded hardware Analog electronic components Digital

electronic components I/O Types and Examples Serial communication devices Parallel device ports Wireless

devices Timers and Counting Devices Watchdog timer and Real time clock Embedded Firmware Design

Introduction to Embedded firmware design approaches Embedded firmware development languages ISR

concept ,Interrupt sources Interrupt servicing mechanism Multiple interrupts DMA, Device driver

programming Concepts of C versus Embedded C Compiler versus Cross-compiler.

UNIT IV (15 hours)

Hardware Software Co-Design, Implementation and Testing Hardware Software Co-Design Fundamental Issues in Hardware Co-Design Fundamental Issues in Software

Co-Design Computational models in Embedded Design Hardware software trade offs Integration of

Hardware and Firmware ICE Issues in Embedded system Design Design with an real time example.

Embedded System Implementation and Testing The main software utility tool CAD and hardware

Translation tools Pre-processors Interpreters Compilers and Linkers Debugging tools Quality assurance and

testing of the design Testing on host machine Simulators and Laboratory tools

Text Books:: 1.Introduction To Embedded Systems by Shibu .K.V- Tata McGraw Hill Education Private

Limited. 2009

2.Embedded systems Architecture By Tammy Noergaard, Elsevier publications, 2005

Reference Books: 1. Embedded Systems – Raj Kamal, TMS, Second Edition 2008.

2. Embedded System building blocks By Labrosse, CMP publishers

3. Embedded System Design – A Unified Hardware/Software Introduction – Frank Vahid, Tony D. Givargis,

John Wiley, 2002.


B.Tech- 6th

Semester


Course Title: ADVANCED DATABASES Course Code:

L T P C

3 1 0 4

Course Objectives


� Understand distributed architecture and distributed database design.

� Know advanced query processing and distributed query optimization techniques.

� Comprehend the transaction management along with parallel database systems.

� Grasp the object oriented data models database design.

Course outcomes:


� Design an architectural model for distributed database management system.

� Analyze Query processing and query optimization methods.

� Implement transaction management and database reliability for real world scenario.

� Use object-oriented distributed data model for data

UNIT-1 (11+4) Introduction; Distributed Data Processing, Distributed Database System, Promises of DDBSs,Problem areas.

Overview of Relational DBMS: Relational Database Concepts, Normalization, Integrity rules, Relational

data languages.

Distributed DBMS Architecture: Architectural Models for Distributed DBMS, DDMBS

Architecture.

Distributed Database Design: Alternative Design Strategies, Distribution Design issues,

Fragmentation, Allocation.

UNIT-II (12+3) Query Processing and decomposition: Query Processing Objectives, Characterization of query processors,

layers of query processing, query decomposition, Localization of distributed data.

Distributed query Optimization: Query optimization, centralized query optimization,

Distributed query optimization algorithms.

UNIT-III (12+3) Transaction Management: Definition, properties of transaction, types of transactions.

Distributed concurrency control: Serializability, concurrency control Mechanisms & Algorithms, Time

stamped & Optimistic concurrency control Algorithms, Deadlock Management.

Distributed DBMS Reliability: Reliability concepts and Measures, fault-tolerance in Distributed systems,

failures in Distributed DBMS, local & Distributed Reliability Protocols, site failures and Network

partitioning.

Parallel Database Systems: Database Series, Parallel Architecture, Parallel DBMS Techniques,Parallel

exception problems, Parallel Execution for Hierarchical architecture.

UNIT-IV (11+4) Distributed object Database Management Systems: Fundamental object concepts and Models,Object

Distributed Design, Architectural Issues, Object Management, Distributed Object storage,Object query

Processing.

Object Oriented Data Model : Inheritance, Object identity, persistent programming languages,persistence of

objects, comparing OODBMS and ORDBMS

TEXT BOOKS: 1. M.Tamer OZSU and PatuckValduriez:Principles of Distributed Database Systems,

Pearson Edn. Asia, 2001.

2. Stefano Ceri and WillipsePelagatti: Distributed Databases, McGraw Hill.

REFERENCE BOOKS: 1. Henry F Korth, A Silberchatz and Sudershan : Database System Concepts, MGH

2. Raghuramakrishnan and JohhanesGehrke: Database Management Systems,MGH


B.Tech- 6th

Semester


Course Title: SOFT COMPUTING Course Code:

L T P C

3 1 0 4

Course Objectives:


� Understand the soft computing techniques and their roles in building intelligent machines.

� Understand about fundamentals of neural networks and learning methods.

� Learn about Fuzzy logic, sets and relationships between them to understand the Fuzzy system.

� To know about fuzzy logic controlled genetic algorithms to practice the soft computing tools.

Course Outcomes:


� Identify and describe soft computing techniques and their roles in building intelligent machines.

� Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems

� Apply neural networks to pattern classification and regression problems.

� Evaluate and compare solutions by various soft computing approaches for a given problem.

UNIT I: (10+3)

Basic elements of soft Computing – Introduction to soft computing, Fuzzy logic, Neural Networks and

Evolutionary Computing, Evolution of soft computing from computational AI to computing intelligence,

Machine learning basics.

UNIT II: (12+3)

Supervised learning: Artificial Neural Networks- Introduction, Basic models of ANN, important

terminologies, Basic Learning Laws, Supervised Learning Networks, Perceptron Networks, Back

propagation Network. Radial basis function network and Hopfield Networks, Learning Vector Quantization.

UNIT III: (14+5)

Unsupervised Learning Network- Introduction, Fixed Weight Competitive Nets, Maxnet, Hamming

Network, Kohonen Self-Organizing Feature Maps, Learning Vector Quantization, Counter Propagation

Networks, Adaptive Resonance Theory Networks.

UNIT IV: (9+4)

Introduction to Classical Sets and Fuzzy Sets- Crisp Sets and Fuzzy Sets- operations. Classical Relations and

Fuzzy Relations- Cardinality, Properties and composition. equivalence relations.

TEXT BOOKS :

1. Principles of Soft Computing- S N Sivanandam, S N Deepa, Wiley India, 2011

2. V. Kecman, “Learning and Soft computing”, Pearson Education, India

REFERENCES

1. George J. Klir and Bo Yuan, "Fuzzy sets and Fuzzy Logic", Prentice Hall, USA 1995.

2. N. J. Nelsson, "Artificial Intelligence - A New Synthesis", Harcourt Asia Ltd.1998.

3. D.E. Goldberg, "Genetic Algorithms: Search, Optimization and Machine Learning", Addison Wesley,

N.Y, 1989.

4. S. Haykins,“Neural networks: a comprehensive foundation”. Pearson Education, India.


B.Tech- 6th

Semester


Course Title: INFORMATION SECURITY LAB Course Code:

L T P C

0 0 3 2

Course Objectives:


� Experiment various cipher text substitution techniques

� Understand DES encryption algorithm

� Implement RSA algorithm

� Learn the functionality of various security tools.

Course Outcomes:


� Understand theoretical and detailed practical knowledge of network security tools.

� Able to analyze, design, implement and validating solutions to computer network security challenges.

� Implement various symmetric key cryptographic algorithms for message encryption.

Implements various asymmetric key cryptographic algorithms for message encryption.

Course Content

1. Implement Caesar Technique

2. Implement Mono Alphabetic Technique Implementation

3. Implement Play Fair Technique Implementation

4. Implement HillCipher Technique Implementation

5. Implement Simple D.E.S Implementation

6. R.S.A Implementation

7. Implement Diffie-Hellman key exchange algorithm

8. Digital signature generation using Java

9. Implement dual Signature concept.

10. Download any of the following software’s

� Snort

� tcpdump

� HoneyWallRoo

� Sebek

� HIHAT

� HoneyBow

� Nepenthes

11. Identify the Functionality of each of them.

12. Using Snort do the following in a network

a. Identify the Intruders if any.

b. Find the Packet Information.


B.Tech- 6th

Semester


Course Title: LANGUAGE PROCESSORS LAB Course Code:

L T P C

0 0 3 2

Course Objectives


� Implement the actions performed by Lexical Analyzer without using Lex tool.

� Implement Lexical Analyzer using Lex tool.

� Implement Syntax Analyzer or parser using YACC Tool.

� Implement the top-down and bottom-up parsing.

Course Outcomes:


� Apply the knowledge of LEX tool to develop a scanner.

� Compute the first and follow of non-terminals of a grammar.

� Apply the knowledge of YACC tool to develop a parser.

� Design top-down and bottom-up parsers

1. Write a C program to find out whether a given string is an identifier or not

2. Write a C program to find whether string is a keyword or not

3. Write a C program to pick out comments in a c program

4. Write a C program for design a lexical analyzer

5. Implement the lexical analyzer using lex.

6. Write a program to compute first of non-terminals.

7. Write a program to compute follow of non-terminals

8. Design predictive parser for the given language

9. Design LALR bottom up parser for the given language.

10. Implementation of YACC for a given grammar.


B.Tech- 7th

Semester

SYLLABUS

Course Title: Data Warehousing and Data Mining Course Code: IT3413

L T P C

3 1 0 4

Course Objectives The course content enables students to:

• Analyze the difference between On Line Transaction Processing and On Line analytical processing

• Create Multidimensional schemas suitable for data warehousing

• Understand various data mining functionalities

• Understand in detail about data mining algorithms

Course Outcomes At the end of the course students are able to:

• Design a data mart or data warehouse for any organization

• Extract knowledge using data mining techniques

• Adapt to new data mining tools

• Explore recent trends in data mining such as web mining, multimedia mining

UNIT- I (11+4) Hrs Introduction: Fundamentals of data mining, Data Mining Functionalities, Major issues in Data Mining

Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and Transformation,

Data Reduction, Data Warehouse and OLAP Technology for Data Mining Data Warehouse, Multi-

dimensional Data Model, Data Warehouse Architecture

UNIT-II (11+3) Hrs Data Mining Primitives, Languages, and System Architectures : Data Mining Primitives, Data Mining

Query Languages, Designing Graphical User Interfaces Based on a Data Mining Query Language,

Architectures of Data Mining Systems.

Concepts Description: Characterization and Comparison: Data Generalization and Summarization-

Based Characterization, Analytical Characterization: Analysis of Attribute Relevance, Mining Class

Comparisons: Discriminating between Different Classes

UNIT- III (11+4) Hrs Mining Association Rules in Large Databases: Association Rule Mining, Mining Single-Dimensional

Boolean Association Rules from Transactional Databases, Mining Multilevel Association Rules from

Transaction Databases.

Classification and Prediction: Issues Regarding Classification and Prediction, Classification by Decision

Tree Induction, Bayesian Classification, Classification by Back propagation, Prediction.

UNIT IV (12+4) Hrs Cluster Analysis Introduction: Types of Data in Cluster Analysis, A Categorization of Major Clustering

Methods, Partitioning Methods, Density-Based Methods, Grid-Based Methods, Model-Based Clustering

Methods, Outlier Analysis.

Mining Complex Types of Data: Multidimensional Analysis and Descriptive Mining of Complex, Data

Objects, Mining Multimedia Databases, Mining Text Databases, Mining the World Wide Web.

Text Books: 1. Data Mining – Concepts and Techniques - Jiawei Han & Micheline Kamber Harcourt, India.

2. Data Mining Techniques – Arun K Pujari, University Press.

Reference Books: 1. Data Mining Introductory and advanced topics –Margaret H Dunham, Pearson Education

2. Data Warehousing in the Real World – Sam Anahory & Dennis Murray. Pearson Edn

3. Data Warehousing Fundamentals – Paulraj Ponnaiah Wiley Student Edition.


B.Tech- 7th

Semester

SYLLABUS

Course Title: Object Oriented Analysis and Design Course Code: IT3414

L T P C

3 1 0 4

Course objectives: The course content enables students to:

• Develop the different UML diagrams for a software system based on the given requirements.

• Apply forward engineering to convert diagram to code and reverse engineering to convert code to

diagram.

• Analyze & design a s/w system in object oriented approach, using unified modeling language.

• Select appropriate models for a s/w system depending upon the complexity of the system

Course outcomes:


• Understand the use of unified modeling language for object oriented analysis and design

• Know the syntax of different UML diagrams.

• Develop different models for a software system.

• Apply object oriented analysis and design to build a software system

• Apply forward and reverse engineering for a software system.

UNIT – I 11+3 Introduction to UML: Importance of modeling, principles of modeling, object oriented modeling,

conceptual model of the UML, Architecture, Software Development Life Cycle.

Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams.

Advanced Structural Modeling: Advanced classes, advanced relationships, Interfaces, Types and Roles,

Packages.

UNIT – II 12+4 Class & Object Diagrams: Terms, concepts, modeling techniques for Class & Object Diagrams.

Basic Behavioral Modeling-I: Interactions, Interaction diagrams.

UNIT-III 11+4 Basic Behavioral Modeling-II: Use cases, Use case Diagrams, Activity Diagrams.

Advanced Behavioral Modeling: Events and signals, state machines, processes and Threads, time and

space, state chart diagrams.

UNIT-IV 11+4 Architectural Modeling: Component, Deployment, Component diagrams and Deployment diagrams.

Case Study: The Unified Library application.

Text Books: 1. Grady Booch, James Rumbaugh, IvarJacobson : The Unified Modeling Language User Guide, Pearson

Education.

2. Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado: UML 2 Toolkit, WILEY-Dreamtech India

Pvt. Ltd.

Reference Books: 1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education.

2. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hill Companies.

3. Gandharba Swain: Object Oriented Analysis & Design Through Unified Modeling Language, Lakshmi

Publications Pvt. Ltd , New Delhi.


B.Tech- 7th

Semester

SYLLABUS

Course Title: Web Technologies Course Code: IT3415

L T P C

3 1 0 4


• understand best technologies for solving web client/server problems

• analyze and design real time web applications

• use Java script for dynamic effects and to validate form input entry

• Analyze to Use appropriate client-side or Server-side applications


• Choose, understand, and analyze any suitable real time web application.

• Integrate java and server side scripting languages to develop web applications.

• To develop and deploy real time web applications in web servers and in the cloud.

• Extend this knowledge to .Net platforms.

UNIT – I 13+4 HTML Common tags- List, Tables, images, forms, Frames, Links and Navigation, Image Maps

CSS: Introduction, CSS Properties, Controlling Fonts, Text Formatting, Pseudo classes, Selectors, CSS for

Links, Lists, Tables.

Java Script: Learning Java script: Variables, operators, Functions, Control structures, Events, Objects,

Validations.

UNIT – II 10+3 PHP Programming: Introducing PHP: Creating PHP script, Running PHP script.

Working with Variables and constants: Using variables, Using constants, Data types, Operators.

Controlling program flow: conditional statements, control statements, arrays, functions, working with

forms.

UNIT-III 12+4 AJAX: Introduction, AJAX with XML

Servlets: introduction to servlets, Life cycle of servlets, JSDK, The servlet API, the javax. servlet package,

Reading servlet parameters and initialization parameters, The javax. servlet HTTP package, Handling Http

request and responses, Using cookie, session tracking,

Introduction to JSP: The problem with servlet, the anatomy of JSP page, JSP processing, JSP application

design with MVC, Tomcat server and testing tomcat, Generic dynamic content, using scripting elements

implicit JSP objects,

UNIT-IV 10+4 JSP application development: Conditional processing display values using an expression to set an attribute,

Declaring variables and methods, sharing data between JSP pages, Requests and users passing control and

data between pages, Sharing sessions and application data, memory usage considerations

JDBC connectivity in JSP: Data base programming using JDBC, Studying javax.sql.* package, Accessing

a database from a JSP page, Application specific database actions, Deploying JAVA beans in JSP page.

Text Books: 1. Web Technologies, Uttam Roy, OXFORD University press

2. Web programming with HTML, XHTML and CSS, 2e, Jon Duckett, Wiley India

Reference Books: 1. Web programming Bai, Michael Ekedahl, CENAGE Learning , India edition.

2. An Introduction to Web Design + Programming, Paul S.Wang, India Edition


B. Tech- 7th

Semester

SYLLABUS

Course Title: Distributed Systems Course Code: CSE4419

L T P C

3 1 0 4

Course Objectives:


• Understand the principles and techniques behind the design of distributed systems

• Familiar with naming and synchronization mechanisms

• Learn the concepts of fault tolerance and file systems used in distributed systems.

• Know the Importance of the distributed transactions , coordination and agreement


• Learn the core concepts underlying distributed systems designs.

• Identify entities and resources in distributed systems and examine the naming conventions

• Apply and compare the various communication mechanisms in distributed systems.

• Identify issues on how to coordinate and synchronize multiple tasks in a distributed system.

UNIT-1 11+3

Definition of Distributed systems, goals of distributed systems ,types of distributed systems, Distributed

system architecture, architectural styles, system architectures, middleware Communication Fundamentals,

Remote Procedure Call, Message-Oriented Communication, Stream-Oriented Communication, Multicast

Communication.

UNIT-2 12+4 Naming: Names, Identifiers, and Addresses, Flat Naming, Structured Naming, Attribute-Based

Synchronization: Clock Synchronization, Stream Synchronization, Synchronization Mechanisms, Logical

Clocks, Physical clocks

Consistency and Replication: Introduction, Data-Centric Consistency Models, Client-Centric Consistency

Models, Consistency Protocols.

UNIT-3 10+4 Fault Tolerance: Introduction to Fault Tolerance, Process Resilience, Reliable Client-Server

Communication, Reliable Group Communication, peer to peer communications, Distributed Commit,

Recovery.

Distributed File Systems: Introduction to distributed file systems, Architecture, Process, communications,

consistency and replication, Sun network file system.

UNIT-4 12+4 Distributed Transactions: Introduction, Flat and nested distributed transitions, Atomic commit protocol,

concurrency control in distributed transactions, distributed dead locks, Transaction and recovery.

Coordination and Agreement: Introduction, Distributed Mutual exclusion, Elections, multi cast

communication, consensus and related problems.

CASE STUDY: CORBA RMI, CORBA Services.

Text Books:

1. Distributes Systems Principles and paradigms, Second Edition-Andrew S.Tanenbaum, Maarten Van

Steen.

2. Distributed Systems: Concepts and Design, George Coulouris, Jean Dollimore& Tim Kindberg,

4th

ed, 2005, Addison-Wesley

Reference books 1. Distributed Operating Systems, Andrew S.Tanenbaum, Pearson


B. Tech- 7th

Semester

SYLLABUS

Course Title: Middleware Technologies Course Code: CSE4420

L T P C

3 1 0 4

Course Objectives:


• Understand different types, benefits and pitfalls of client server computing models.

• Establish communication between client and server through java RMI and JDBC.

• Implement C#.Net applications using Assemblies, and Callback Interfaces.

• Develop client server applications using heterogeneous programming languages with CORBA

• Learn java bean component model with EJBS and CORBA.

Course Outcomes:


• Choose appropriate client server computing model for given problem.

• Design a dynamic remote application with RMI and JDBC Connectivity.

• Develop client server applications using C#.net

• Select appropriate language for homogeneous and heterogeneous objects.

• Develop real time projects by combining CORBA and database interfacing

UNIT – I 11+4

Introduction to client server computing: Evolution of corporate computing models from centralized to

Distributed computing, client server models. Benefits of client server computing, pitfalls of client server

Programming.

Advanced Java: Review of Java concept like RMI, RMI API, and JDBC.

UNIT – II 11+4

Introducing C# and the .NET Platform; Understanding .NET Assemblies, Object –Oriented Programming

with C#, Callback Interfaces.

Building c# applications: Type Reflection, Late Binding, and Data Access with ADO.NET.

UNIT-III 12+3

Core CORBA / Java: Two types of Client/ Server invocations-static, dynamic. The static CORBA, first

CORBA program, ORBlets with Applets, Dynamic CORBA-The portable count, the dynamic count

Existential CORBA: CORBA initialization protocol, CORBA activation services, CORBA IDL mapping

CORBA java- to- IDL mapping.

UNIT-IV 11+4

Java Bean Component Model: Events, properties, persistency, Introspection of beans, CORBA Beans.

EJBs and CORBA: Object transaction monitors CORBA OTM’s, EJB and CORBA OTM’s, EJB container

frame work, Session and Entity Beans.

Text Books:

1. Client/Server programming with Java and CORBA Robert Orfali and Dan Harkey, John Wiley & Sons ,

SPD 2nd Edition

2. Java programming with CORBA 3rd Edition, G.Brose, A Vogel and K.Duddy, Wiley-dreamtech, India

John wiley and sons

Reference Books:

1. Distributed Computing, Principles and applications, M.L.Liu, Pearson Education

2. Client/Server Survival Guide 3rd edition Robert Orfali Dan Harkey & Jeri Edwards, John Wiley & Sons

3. Client/Server Computing D T Dewire, TMH.

4. Programming C#, Jesse Liberty, SPD-O’Reilly.

5. C# Preciesely Peter Sestoft and Henrik I. Hansen, Prentice Hall of India

6. Intoduction to C# Using .NET Pearson Education


B. Tech- 7th

Semester

SYLLABUS

Course Title: Software Project Management Course Code: CSE4421

L T P C

3 1 0 4

Course Objectives:


• Overview of software project evaluation and the project planning. It also covers the Step Wise

framework in project planning.

• Evaluate and assess the projects and to find the cost of the project using cost benefit evaluation

techniques.

• To produce an activity plan for a project and to estimate the overall duration of the project by

analyzing the risks involved in it.

• Identifying the factors that influence people’s behavior in a project environment and project quality.

• Overview of project possible change management and review of some free open source project

management tools.

Course Outcomes:


• Apply and practice Project Management principles while developing a software.

• Defining and implementing software project planning.

• Analyzing software risks and risk management strategies

• Defining the concepts of software quality and reliability on the basis of international quality

standards.

• Knowing and implementing the software project management tools

UNIT-1

Project Evaluation and Planning 14+4

Activities in Software Project Management, Overview Of Project Planning, Stepwise planning, contract

management, Software processes and process models. Cost Benefit Analysis, Cash Flow Forecasting, Risk

Evaluation. Project costing, Function point analysis, COCOMO 2, Staffing pattern, Effect of schedule

compression, Putnam’s equation, Capers Jones estimating rules of thumb.

UNIT-2

Monitoring and Control 11+4

Project Sequencing and Scheduling Activities, work breakdown structure, Gantt chart, Scheduling resources,

Critical path analysis, Network Planning.

Collecting Data, Visualizing Progress, Cost Monitoring, review techniques, project termination review,

Earned Value analysis, Change Control, Software Configuration Management (SCM), Managing Contracts,

Types Of Contracts, Stages In Contract Placement, Typical Terms of A Contract, Contract Management and

Acceptance.

UNIT-3

Quality Management and People Management 10+4

Risk Management, Nature and Types of Risks, Managing Risks, Hazard Identification, Hazard Analysis,

Risk Planning and Control, PERT and Monte Carlo Simulation techniques.

Introduction, Understanding Behavior, Organizational Behaviour, Selecting The Right Person For The Job,

Motivation, The Oldman – Hackman Job Characteristics Model , Working in Groups, Organization and team

structures, Decision Making, Leadership, Organizational Structures, ISO and CMMI models,

UNIT-4

Project Change Management 10+3

Introduction, Impact of change, Change as a process, Emotional behavior pattern of change, Change

Management plan, dealing with resistance and conflict.

Closure of a Project: Introduction, Project Implementation, Administrative closure, Project Evaluation.

Testing, and Software reliability, test automation, Overview of project management tools: open-source tools

Ganttproject or similar tools

Text Book

1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata

McGraw Hill, New Delhi, 2012.

Reference Books:

1. Pankaj Jalote, “Software Project Management in Practice”, 2002, Pearson, Education Asia.

2. Jack T Marchewka, “Information Technology Project Management”, Third Edition (International

Student Version) , Wiley India

3. Samuel J mantel et.el “Project Management- Core Textbook”, First India Edition, Wiley India

4. Robert K. Wysocki, Effective Software Project Management, Wiley, 2009


B. Tech- 7th

Semester

SYLLABUS

Course Title: Digital Image Processing Course Code: ECE 4431

L T P C

3 1 0 4

Course Objectives:


1. be familiar with basic concepts , image manipulations and methodologies for digital image

processing

2. Learn various image processing techniques like image enhancement, restoration

3. know segmentation ,image compression

4. Understand pseudo and full color processing

5. appreciate the usage of image transforms in image processing

6. Know about MATLAB tool for image processing

Course Outcomes:

After undergoing the course students will be able to

1. appreciate image manipulations and different digital image processing techniques in various fields.

2. Perform basic operations like – Enhancement, Image transform and restoration techniques on image.

3. make use of image segmentation , compression for various applications.

4. Analyze pseudo and full color image processing techniques.

5. Apply the various image transforms used in image processing

6. apply MATLAB to implement the image processing techniques.

UNIT I 18 hours

Digital Image Fundamentals: Fundamental steps in Digital image processing, Digital image representation,

Elements of visual perception, light and electromagnetic spectrum, Image sensing and acquisition, Image

sampling and quantization, basic relationships between pixels. An introduction to mathematical tools in

digital image processing

Color Image Processing: Color fundamentals, color models, Pseudo color Image Processing, Full Color

Image Processing , color transformations.

UNIT II 16 hours

Image transforms: : 2D DFT and its properties, Discrete cosine transform, STFT, Introduction to Wavelet.

Image Enhancement : Enhancement in spatial domain, Intensity transformations, Histogram Processing, ,

smoothing and sharpening. Image Enhancement in Frequency Domain Filters, Smoothing Frequency

Domain Filters, Sharpening Frequency Domain Filters,

UNIT III 12 hours

Color image enhancement: Image smoothing and sharpening-spatial domain and frequency domain

Image Restoration: A Model of the Image Degradation/Restoration Process, Linear Position-Invariant

Degradations, Inverse filtering, Minimum Mean Square Error (Wiener) Filter, Constrained Least squares

filtering.

UNIT IV 14 hours

Image segmentation: Fundamentals, point, Line and Edge detection, , Thresholding, Region based

Segmentation.

Image Compression: Fundamentals, Image Compression Models, Elements of Information Theory,Error

Free Compression, Lossy Compression, Image compression using DCT and DWT, Introduction to Digital

Image water marking.

Text Book:

1. Rafel C.Gonzalez and Richard E.Woods, “Digital Image Processing”, Pearson Education,3 rd edition

2011

Reference Books:

1. Anil K. Jain, “Fundamentals of Digital Image Processing”, 2003, Pearson Education.

2. S.Jayaraman S.Esakirajan T.Veerakaumar” Digital Image Processing” Mc Graw Hill publishres,

2009

3. S.Sridhar,” Digital Image Processing” oxford publishers, 2011

4. Chanda & Majumdar, “Digital Image Processing and Analysis” 2003, PHI.

5. M.Sonka,V. Hlavac, R. Boyle, “Image Processing, Analysis and Machine Vision”, Vikas Publishing

House


B. Tech- 7th

Semester

SYLLABUS

Course Title: Mobile Computing Course Code: CSE4422

L T P C

3 1 0 4

Course Objectives:


• Differentiate between various medium access schemes

• Understand the concept of Mobile IP and packet delivery

• Know the importance of Wireless Sensor Networks

• Configure an Ad hoc network using NS3

Course Outcomes:


• Demonstrate knowledge of different voice and data communication standards

• Analyze the need for optimizations in Mobile IP

• Distinguish between proactive and reactive routing in an Ad hoc network

• Develop simple app using Android

UNIT – I 12+4

Mobile Communications - Overview: Wireless transmission, voice and data communication standards –

1G/2G/3G/4G, WPAN, WLAN, applications, limitations, mobile computing architecture, overview on

mobile devices and systems

Wireless Medium Access Control: Motivation for a specialized MAC (Hidden and exposed terminals, Near

and far terminals, MACA), modulation, Spread spectrum, SDMA, FDMA, TDMA, CDMA

GSM: services, system architecture, radio interface, localization, call handling, handover, security, GPRS,

EDGE

UNIT – II 10+3

Mobile Network Layer: Mobile IP, IP packet delivery, agent advertisement and discovery, registration,

tunneling and encapsulation, optimizations, Dynamic Host Configuration Protocol

Mobile Transport Layer: Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP

UNIT – III 12+4

Mobile Ad hoc Network (MANET): Introduction, Properties, applications, limitations, routing issues,

routing algorithms – proactive (DSDV & OLSR) and reactive (DSR & AODV)

Wireless Sensor Network (WSN): Introduction, architecture, applications, security in ad hoc networks

Wireless LAN: IEEE 802.11, System architecture, Protocol layers

UNIT – IV 11+4

Network Simulator: Overview on different network simulators, NS3, configuration of MANET and WSN

Mobile OS: Overview on different mobile OSs, Android OS, architecture, app development examples

Wireless Application Protocol (WAP): Introduction, architecture

Text Books:

1. Mobile Computing, Raj Kamal, Oxford press, Second Edition

2. Mobile Communications, Jochen Schiller, Pearson Education, Second Edition

Reference Books:

1. Mobile Computing, Asoke K Talukder, Hasan Ahmed and Roopa Yavagal, McGraw Hill

2. Fundamentals of Mobile Computing, Prasant Kumar Pattnaik and Rajib Mall, PHI Learning

3. http://www.isi.edu/nsnam/ns/doc/ns_doc.pdf (NS2 manual)


B. Tech- 7th

Semester

SYLLABUS

Course Title: Multimedia Systems Course Code: CSE4423

L T P C

3 1 0 4

Course Objective: The course content enables students to:

• Employ different realizations of multimedia tools.

• Put into practice various multimedia applications and Action scripts.

• Examine various storage technologies.

• Relate video compression Techniques for real time applications.

Course Outcome: At the end of the course students are able to:

• Use different realizations of multimedia tools.

• Implement various multimedia applications and Action scripts.

• Analyze various storage technologies.

• Apply video compression Techniques for real time applications.

UNIT-I 12+4

Fundamental concepts in Text and Image: Multimedia and hypermedia, World Wide Web, overview

of multimedia software tools. Graphics and image data representation graphics/image data types,

file formats, Color in image and video: color science, color models in images, color models in video.

Fundamental concepts in video and digital audio: Types of video signals, analog video, digital

video, digitization of sound, MIDI

UNIT – II 11+4

Action Script I: Action Script Features, Object-Oriented Action Script, Data types and Type

Checking, Classes, Authoring an Action Script Class.

Action Script II: Inheritance, Authoring an Action Script 2.0 Subclass, Interfaces, Packages, Exceptions.

UNIT – III 11+3

Application Development: An OOP Application Frame work, Using Components with Action Script Movie

Clip Subclasses.

Multimedia data compression: Lossless compression algorithm: Run-Length Coding, Variable

Length Coding, Dictionary Based Coding, and Arithmetic Coding.

UNIT – IV 11+4

Basic Video Compression Techniques: Introduction to video compression, video compression based

on motion compensation, search for motion vectors, MPEG.

TEXT BOOKS:

1. Fundamentals of Multimedia by Ze-Nian Li and Mark S. Drew PHI/Pearson Education.

2. Essentials Action Script 2.0, Colin Moock, SPD O, REILLY.

REFERENCES:

1. Digital Multimedia, Nigel chapman and jenny chapman, Wiley-Dreamtech

2. Macromedia Flash MX Professional 2004 Unleashed, Pearson.

3. Multimedia and communications Technology, Steve Heath, Elsevier(Focal Press).

4. Multimedia Applications, Steinmetz, Nahrstedt, Springer.

5. Multimedia Basics by Weixel Thomson

6. Multimedia Technology and Applications, David Hilman, Galgotia


B. Tech- 7th

Semester

SYLLABUS

Course Title: Object Oriented Analysis and Design Lab Course Code: IT3219

L T P C

0 0 3 2

Course Objectives: This course is designed to enable the students to:

• Know the practical issues of the different Object oriented analysis and design concepts.

• Inculcate the art of object oriented software analysis design.

• Apply forward and reverse engineering of a software system.

• Carry out the analysis and design of a system in an object oriented way.

Course outcomes: After undergoing the course students are able to:


• Create different UML diagrams for a software system

• Identify appropriate models to represent a software system.

• Analyze and design a software system in an object oriented style using tools like Rational Rose.

List of Experiments 1. The student should take up the case study of Unified Library application which is mentioned in the theory,

and Model it in different views i.e. Use case view, logical view, component view, Deployment view,

Database design, forward and Reverse Engineering, and Generation of documentation of the project.

2. Student has to take up another case study of his/her own interest and do the same whatever mentioned in

first problem. Some of the ideas regarding case studies are given in reference books which were mentioned

in theory syllabus can be referred for some idea.

Reference Books:

1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education.

2. Pascal Roques: Modeling Software Systems Using UML2, WILEY-Dream tech India Pvt. Ltd.


4. Mark Priestley: Practical Object-Oriented Design with UML, TATA Mc Graw Hill




B. Tech- 7th

Semester

SYLLABUS

Course Title: Web Technologies Lab Course Code: IT3220

L T P C

0 0 3 2


• Understand the web technologies to create adaptive web pages for web application.

• use CSS to implement a variety of presentation effects to the web application

• know the concept and implementation of cookies as well as related privacy concerns

• Develop a sophisticated web application that employs the MVC architecture.

Course Outcomes: At the end of this course the student can answer how to:

• Integrate frontend and backend web technologies in distributed systems.

• Facilitate interface between frontend and backend of a web application.

• Debug, test and deploy web applications in different web servers.

• Migrate the web applications to the other platforms like .Net

Experiment-1: Design the following static web pages required for a Training and placement cell web site.

1) Home Page 2) Login Page 3) Registration page

Experiment-2: 4) Company Details Page 5) Alumni Details Page 6) Placement Staff Details Page

Experimen-3: 7) Student personal Info Page 8) Student Academic Info page 9) Semester Wise Percentage &

their Aggregate page

Experiment-4: Validate login page and registration page using regular expressions.

Experiment-5: Apply different font styles, font families, font colors and other formatting styles to the above

static web pages.

Experiment-6: Install wamp server and tomcat server, access above developed static web pages using these

servers.

Experiment-7: Write a servlet/PHP to connect to the database, Insert the details of the users who register

with the web site, whenever a new user clicks the submit button in the registration.

Experiment-8: Write a JSP/PHP to connect to the database, Insert the details of the student academic

information with student academic info page.

Experiment-9: User Authentication:

Assume four users user1user2, user3 and user4 having the passwords pwd1, pwd2, pwd3 and pwd4

respectively. Write a servlet for doing the following.

1. Create a Cookie and add these four user id’s and passwords to this Cookie.

2. Read the user id and passwords entered in the Login form (week1) and authenticate with the values (user

id and passwords) available in the cookies.

If he is a valid user (i.e., user-name and password match) you should welcome him by name (user-name) else

you should display “You are not an authenticated user “.

Use init-parameters to do this. Store the user-names and passwords in the webinf.xml and access them in the

servlet by using the get In it Parameters () method.

Experiment-10: Write a JSP which does the following job:

Authenticate the user when he submits the login form using the user name and password from the

database.

Experiment-11: write a JSP to insert the student’s semester wise percentages and calculate aggregate and

insert into database.

Experiment-12: write a JSP to search the students according to their aggregate and produce sorted list or

according to their Enroll number.


B.Tech- 8th

Semester

SYLLABUS

Course Title: Engineering Economics and Project Management Course Code: HS3405

L T P C

3 1 0 4


• Acquaint the basic concepts of Engineering Economics and its application

• Know various methods available for evaluating the investment proposals

• Make the optimal decisions acquiring the knowledge on financial accounting

• Gain the relevant knowledge in the field of management theory and practice

• Understand the project management lifecycle and be knowledgeable on the various phases from

project initiation through closure


• Understand basic principles of engineering economics

• Evaluate investment proposals through various capital budgeting methods

• Apply the knowledge to prepare the simple financial statements of a company for measuring

performance of business firm

• Analyze key issues of organization, management and administration

• Evaluate project for accurate cost estimates and plan future activities

UNIT-I:

Introduction to Engineering Economics: 10 + 3 Concept of Engineering Economics – Types of efficiency – Theory of Demand - Elasticity of demand-

Supply and law of Supply – Indifference Curves.

Demand Forecasting & Cost Estimation: Meaning – Factors governing Demand Forecasting – Methods – Cost Concepts – Elements of Cost – Break

Even Analysis.

UNIT-II:

Investment Decisions & Market Structures: 11 +6 Time Value of Money – Capital Budgeting Techniques - Types of Markets – Features – Price Out-put

determination under Perfect Competition, Monopoly, Monopolistic and Oligopoly

Financial Statements & Ratio Analysis: Introduction to Financial Accounting - Double-entry system – Journal – Ledger - Trail Balance – Final

Accounts (with simple adjustments) – Ratio Analysis (Simple problems).

UNIT-III:

Introduction to Management: 12 + 2 Concepts of Management – Nature, Importance – Functions of Management, Levels - Evolution of

Management Thought – Decision Making Process - Methods of Production (Job, Batch and Mass

Production) - Inventory Control, Objectives, Functions – Analysis of Inventory – EOQ.

UNIT-IV:

Project Management: 12 +4 Introduction – Project Life Cycle – Role Project Manager - Project Selection – Technical Feasibility –

Project Financing – Project Control and Scheduling through Networks - Probabilistic Models – Time-Cost

Relationship (Crashing) – Human Aspects in Project Management.

Text Books: 1. Fundamentals of Engineering Economics by Pravin Kumar, Wiley India Pvt. Ltd. New

Delhi, 2012.

2. Project Management by Rajeev M Gupta, PHI Learning Pvt. Ltd. New Delhi, 2011.

Reference Books: 1. Engineering economics by Panneer Selvam, R, Prentice Hall of India, New Delhi, 2013.

2. Engineering Economics and Financial Accounting (ASCENT Series) by A. Aryasri & Ramana

Murthy, McGraw Hill, 2004.

3. Project Management by R.B.Khanna, PHI Learning Pvt. Ltd. New Delhi, 2011.

4. Project Management by R. Panneer Selvam & P.Senthil Kumar, PHI Learning Pvt. Ltd. New Delhi,

2009.

5. Management Science by A.Aryasri, Tata McGraw Hill, 2013

6. Koontz & Weihrich: Essentials of Management, 6/e, TMH, 2007


B.Tech- 8th

Semester

SYLLABUS

Course Title: Information Retrieval Systems Course Code: IT4423

L T P C

3 1 0 4


• Understand the Functionalities of IRS

• Create indices to extract data efficiently from Information Storage

• Learn document management, retrieval and searching the web.

• Apply Clustering for the data to be stored to IRS

• Understand working of Search Engines and ways to improve them.

• Know about hypermedia architectures, design and usability of IRS

Course outcomes:

At the end of the course the students are able to:

• Learn Classical and advanced techniques employed by Web Search engines

• Know different ways of representation and retrieval of documents.

• Apply techniques of preprocessing needed for IRS

• Develop an IRS by using different user search techniques and text search algorithms

UNIT- I 11+3 Introduction: Definition, Objectives, Functional Overview, Relationship to DBMS, Digital libraries and

Data Warehouses.

Information Retrieval System Capabilities: Search, Browse, Miscellaneous.

UNIT-II 12+4 Cataloging and Indexing: Objectives, Indexing Process, Automatic Indexing, Information Extraction.

Data Structures: Introduction, Stemming Algorithms, Inverted file structures, N-gram data structure, PAT

data structure, Signature file structure, Hypertext data structure.

UNIT- III 11+4 Automatic Indexing: Classes of automatic indexing, Statistical indexing, Natural language, Concept

indexing, Hypertext linkages

Document and Term Clustering: Introduction, Thesaurus generation, Item clustering, Hierarchy of

clusters.

UNIT IV 11+4 User Search Techniques: Search statements and binding, Similarity measures and ranking, Relevance

feedback, Selective dissemination of information search, Searching the Internet and hypertext, Information

Visualization

Text Search Algorithms: Introduction, Software text search algorithms, Hardware text search systems.

Text Books:

1. Kowalski, Gerald, Mark T Maybury: Information Retrieval Systems: Theory and Implementation,

Kluwer Academic Press, 1997.

Reference Books:

1. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures and Algorithms, Prentice Hall,

1992.

2. Modern Information Retrieval By Yates Pearson Education.

3. Information Storage & Retrieval By Robert Korfhage – John Wiley & Sons.


B.Tech- 8th

Semester

SYLLABUS

Course Title: Big Data Analytics Course Code: CSE4424

L T P C

3 1 0 4

COURSE OBJECTIVES:


• To introduce the fundamental concepts of BIG Data

• To introduce various analytical techniques to crunch massive data

• To have a knowhow about applications which uses Big Data

• To know the Architectural components to handle Big Data.

• To have a model to handle massive data using Hadoop Map Reduce.

COURSE OUTCOMES:


• Identify the need for big data analytics for a domain.

• Apply big data analytics for a given problem.

• Suggest areas to apply big data to increase business outcome.

• Use Hadoop, Map Reduce Framework handle massive data

UNIT I 10 +3

Introduction to Big Data: Analytics – Nuances of big data – Value – Issues – Case for Big data – Big data options Team challenge –

Big data sources – Acquisition – Nuts and Bolts of Big data. Features of Big Data -Security, Compliance,

auditing and protection - Evolution of Big data – Best Practices for Big data Analytics - Big data

characteristics - Volume, Veracity, Velocity, Variety.

UNIT II 11 +4

Applications of Big Data & Data Analysis: Drivers for big data – Automation – Monetization- Applications of Big Data.- Social Media Command

Center-Product knowledge hub-infrastructure and knowledge hub-Product selection, Design and

Engineering- Location Based services- Online Advertizing- Improved Risk management. Analytic data sets –

Analytic methods –analytic tools – Cognos – Micro strategy - Pentaho.

UNIT-III 11 + 4

Architectural components: Massively Parallel Processing Platforms (MPP) - Unstructured data analytics and reporting-Context sensitive

and domain specific searches- categories and ontology-focus on specific time slice-big data and single view

of customer-Data privacy protection- Real time adaptive analytics and decision engine.

UNIT IV 13+4

Hadoop Framework: Big data implementation-Revolutionary, Evolutionary and Hybrid Approaches- Overview of Hadoop-

RDBMS (vs) HADOOP- IBM for Big Data – Map Reduce Framework and Architecture. Hadoop Distributed

file systems –Features of HDFS- Developing Map reduce – Analyzing big data with twitter.

Text Books: 1. Big Data Analytics: Disruptive Technologies for Changing the Game, Dr. Arvind Sathi, MC

Press online.

2. Hadoop: The Definitive Guide, Tom White, O'Reilly Media / Yahoo Press, 2012

Reference Books: 1. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with

Advanced Analytics”, Wiley and SAS Business Series, 2012.

2. Paul Zikopoulos, Chris Eaton, Paul Zikopoulos, “Understanding Big Data: Analytics for

Enterprise Class Hadoop and Streaming Data”, McGraw Hill, 2011.


B.Tech- 8th

Semester

SYLLABUS

Course Title: Bio-Informatics Course Code: CSE4425

L T P C

3 1 0 4

COURSE OBJECTIVES:


• Understand the theoretical basis behind bioinformatics.

• Search databases accessible on the WWW for literature relating to molecular biology and

biotechnology.

Retrieve protein structures from databases.

• Find homologues, analyze sequences, construct and interpret evolutionary trees.

• Understand homology modeling

COURSE OUTCOMES:


• Extract information from different types of bioinformatics data (gene, protein, disease, etc.),

including their biological characteristics and relationships

• Analyze processed data with the support of analytical and visualization tools

• Carry out bioinformatics research under advisement, including systems biology, structural

bioinformatics and proteomics

• Manipulate DNA and protein sequences using stand-alone PC programs and programs available on

the WWW

UNIT –I 10+3

Introduction:

Definitions, Sequencing, Biological sequence/structure, Genome Projects, Pattern recognition an prediction,

Folding problem, Sequence Analysis, Homology and Analogy.

Protein Information Resources:

Biological databases, Primary sequence databases, Protein Sequence databases, Secondary databases, Protein

pattern databases, and Structure classification databases.

Unit-II 11+4

Genome Information Resources:

DNA sequence databases, specialized genomic resources

DNA Sequence analysis:

Importance of DNA analysis, Gene structure and DNA sequences, Features of DNA sequence analysis, EST

(Expressed Sequence Tag) searches, Gene hunting, Profile of a cell, EST analysis, Effects of EST data on

DNA databases

Unit-III 12+4

Pair wise alignment techniques:

Database searching, Alphabets and complexity, Algorithm and programs, Comparing two sequences, sub-

sequences, Identity and similarity, The Dotplot, Local and global similarity, different alignment techniques,

Dynamic Programming, Pair wise database searching.

Multiple sequence alignment :

Definition and Goal, The consensus, computational complexity, Manual methods,

Simultaneous methods, Progressive methods, Databases of Multiple alignments and searching

Unit-IV 12+4

Secondary database searching:

Importance and need of secondary database searches, secondary database structure and building a sequence

search protocol

Analysis packages:

Analysis package structure, commercial databases, commercial software, comprehensive packages, packages

specializing in DNA analysis, Intranet Packages, Internet Packages.

Text Books:

1. Introduction to Bioinformatics, by T K Attwood & D J Parry-Smith Addison Wesley Longman

2. Bioinformatics- A Beginner’s Guide by Jean-Michel Claveriw, Cerdric Notredame, WILEY dreamlech

India Pvt. Ltd

Reference Books:

1. Introduction to Bioinformatics by M.Lesk OXFORD publishers (Indian Edition)


B.Tech- 8th

Semester

SYLLABUS

Course Title: E – Commerce Course Code: CSE4426

L T P C

3 1 0 4

COURSE OBJECTIVES:


• Acquaint with fundamental terms and concepts of e-commerce.

• Compare and contrast the types of business models and e-commerce models

• Analyze important strategic planning factors when implementing e-commerce

initiatives.

• Recommend appropriate technical resources for e-commerce projects.

COURSE OUTCOMES:


• Examine some typical distributed applications.

• Detail some of the problems that are encountered when developing distributed

applications.

• Understand some of the technologies that are used to support distributed applications.

• Illustrate some of the business models used in the internet.

UNIT - I 11+3 Electronic Commerce-Frame work, anatomy of E-Commerce applications, E-Commerce

Consumer applications, E-Commerce organization applications.

Consumer Oriented Electronic commerce - Mercantile Process models.

UNIT - II 11+4 Electronic payment systems - Digital Token-Based, Smart Cards, Credit Cards, Risks in

Electronic Payment systems.

Inter Organizational Commerce - EDI, EDI Implementation, Value added networks

UNIT - III 12+4 Intra Organizational Commerce - work Flow, Automation Customization and internal

Commerce, Supply chain Management

Corporate Digital Library - Document Library, digital Document types, corporate Data Warehouses.

Advertising and Marketing - Information based marketing, Advertising on Internet, on-line marketing

process, market research.

UNIT-IV 11+4 Consumer Search and Resource Discovery - Information search and Retrieval, Commerce

Catalogues, Information Filtering

Multimedia - key multimedia concepts, Digital Video and electronic Commerce, Desktop video processing,

Desktop video conferencing.

TEXT BOOK: 1. Frontiers of electronic commerce – Kalakata, Whinston, Pearson.

REFERENCES: 1. E-Commerce fundamentals and applications Hendry Chan, Raymond Lee, Tharam Dillon,

Ellizabeth Chang, John Wiley.

2. E-Commerce, S.Jaiswal – Galgotia.


B. Tech - 8th

Semester

SYLLABUS

Course Title: Object Oriented Software Engineering Course Code: CSE4427

L T P C

3 1 0 4

COURSE OBJECTIVES:


• Understand about software process models, planning, and estimation of projects.

• Learn software project development CASE tools using object oriented design concept.

• Know the projects under the requirement engineering process and use case models.

• Study and experiment with alternative design models of the software development process.

COURSE OUTCOMES:


• Relate the object oriented methodology and implementation of software and the management of the

software project.

• Apply the knowledge of object oriented design tools including use cases, UML, Java and the JDK.

• Study and experiment with alternative models of the software development process from the

Prototyping method to dynamic modeling.

• Practice the principles and techniques by developing a “real world” software system.

Unit I: 11+3 Introduction to Classical software Engineering - Historical, Economic and Maintenance aspects.

Introduction to Object Oriented Paradigm. Different phases in structured paradigm and Objective Oriented

Paradigm. Software Process and different life cycle models and corresponding strengths and weaknesses.

Planning and Estimation -Estimation of Duration and Cost, COCOMO components of software. Project

Management plan.

Unit II: 11+4 Tools for step wise refinement - Cost - Benefit analysis, Introduction to software metrics and CASE

tools. Taxonomy and scope of CASE tools. Introduction to testing, with focus on Utility, Reliability,

Robustness, Performance, Correctness.

Modules to objects-Cohesion and Coupling, Data Encapsulation and Information hiding aspects of objects.

Inheritance, polymorphism and Dynamic Binding aspects. Cohesion and coupling of objects. Reusability,

Portability and Interoperability aspects.

Unit III: 13+4 Requirement phase - Rapid Prototyping method, Specification phase, Specification Document, Formal

methods of developing specification document, Examples of other semi - formal

methods of using Finite-

State- Machines, Petri nets.

Analysis phase - Use case Modeling, Class Modeling, Dynamic Modeling.

Unit IV: 10+4 Design phase - Formal techniques for detailed design.

IIM Phases - Implementation, Integration and maintenance phases.

Software Testing Tools: selenium, QTP, Winrunner, Silktest, LoadRunner

TEXT BOOKS: 1. Object oriented and Classical Software Engineering, 7/e, Stephen R. Schach, TMH

2. Object oriented and classical software Engineering, Timothy Lethbridge, Robert Laganiere, TMH

REFERENCEBOOKS: 1. Component-based software engineering: 7thinternational symposium, CBSE 2004, IvicaCrnkovic,

Springer

2. Software Testing Tools by Dr KVKK Prasad,dreamtech press


B. Tech- 8th

Semester

SYLLABUS

Course Title: Pattern Recognition Course Code: CSE4428

L T P C

3 1 0 4


• Understand the possibilities and limitations of pattern recognition

• Apply decision functions suitable for given problem

• Validate different clustering algorithms

• Learn Bayesian approach to pattern recognition

• Analyze various dimensionality reduction techniques


• Implement decision functions

• Analyze tradeoffs involved in various classification techniques

• Apply various dimensionality reduction methods whether through feature selection or feature

extraction

• Develop model for solving problems in more specialized areas such as speech

• Recognition, optical character recognition etc.,

UNIT – I 11+4 hrs

Introduction: Fundamental problems in pattern recognition system design, Design concepts and methodologies, Simple

pattern recognition model.

Decisions and Distance Functions: Linear and generalized decision functions, Pattern space and weight space, Geometrical properties,

implementations of decision functions, Minimum-distance pattern classifications.

UNIT – II 15+5 hrs

Statistical Pattern Recognition:

Bayes Decision Theory, Minimum Error and Minimum Risk Classifiers, Discriminate Function and Decision

Boundary ,Normal Density ,Discriminate Function for Discrete Features

Non Parametric Decision Making:

Histogram, kernel and window estimation, nearest neighbor classification techniques. Minimum squared

error discriminant functions, choosing a decision making techniques.

UNIT-III 9+3hrs

Hierarchical Clustering:

Introduction, agglomerative clustering algorithm, the single-linkage, complete-linkage and average-linkage

algorithm. Ward’s method Partition clustering-Forg’s algorithm, K-means’s algorithm, Iso data algorithm.

UNIT-IV 10+3 hrs

Dimensionality Problem:

Dimension and Accuracy, Computational complexity, Dimensionality Reduction, Fisher Linear and Multiple

discriminant Analysis. Application of pattern recognition techniques in bio-metric, facial recognition, IRIS,

Finger prints, etc.,

Text Books:

1. Pattern recognition and Image Analysis, Gose. Johnsonbaugh Jost, PHI.

2. Pattern Recognition Principle, Tou. Rafael. Gonzalez, Pea.

Reference Books:

1. Bishop, C. M. Pattern Recognition and Machine Learning. Springer. 2007

2. Pattern Classification, Richard duda, Hart., David Strok, Wiley.

Course titles and content of B.Tech- 5th to8th semesters – 2013 admitted batch (AR 2013) Practice school



HS 1401 English – I 3 1 - 4




Engineering 3 1 - 4





Total 15 5 09 26

B. Tech. 2nd

Semester


HS 1401 English – II 3 1 - 4




Engineering 3 1 - 4


Programming 3 1 - 4


CSE 1202 Computer Programming Lab - - 3 2


Total 15 5 09 26

B. Tech 3rd Semester







Theory 3 1 - 4



Total 15 05 06 24

B. Tech 4th Semester











Total 15 05 06 24

B.Tech. 5th

Semester






Elective - I

ECE 3428 Microprocessors and Interfacing

3 1 - 4 CSE 3415 Advanced Database

CSE 3412 Computer Graphics

Mini Project

- - 3 2

Laboratories



Total 15 05 9 26

B.Tech. 6th

Semester


Practical Credits

CSE3429 Data Mining 3 1 - 4


CSE 3414 Language Processors 3 1 - 4

Elective - II

ECE 3421 Digital Signal Processing

3 1

- 4

CSE 3413 Information Security

CSE4422 Mobile Computing

CSE3430 Real Time Operating System

Elective - III (Open Elective)


3 1 4



System (ECE)


Management (Chem.)





Laboratories

CSE 3218 Language processor Lab - 3 2

IT3219 Object Oriented Analysis and Design Lab - 3 2

GMR 30206 Term Paper - - 3 2

Total 15 05 9 26

B. Tech. 7th

or 8th

Semester



management 3 1

- 4

IT4430 Design Patterns 3 1 - 4

Elective-IV

ECE 4433 Embedded systems

3 1

- 4 CSE4419 Distributed Systems

CSE4420 Middleware Technologies


Elective-V


3 1 - 4 CSE4424 Big Data Analytics

CSE4427 Object Oriented Software Engineering

CSE4431 Wireless Ad-hoc Networks

Laboratories

CSE4232 Data Mining Lab. - - 3 2

CSE4233 Design & Analysis of Algorithms Lab. - - 3 2

Total 12 04 06 20

B. Tech. 7th

or 8th

Semester

Practice School - - - 20

Total - - - 20

B.Tech- 2nd

Semester


SYLLABUS



L T P C

3 1 0 4





program writing.












UNIT I: 11+3 Hrs







UNIT II: 11+4 Hrs

SELECTION – MAKING DECISIONS: Two-way selection: if- else, null else, nested if, Multi-way

selection: switch, else-if, Iterative Loops – while, do-while and for statements, break, continue



UNIT III: 12+4 Hrs

FUNCTIONS-MODULAR PROGRAMMING: Functions, basics, parameter

passing, storage classes- extern, auto, register, static, scope rules, block structure, user defined functions,

standard library functions, recursive functions, passing 1-D and 2-D arrays to functions.




UNIT IV: 11+4Hrs





I/O operations






B.Tech- 2nd

Semester


SYLLABUS



L T P C

0 0 3 2













Exercise l :



Exercise 2:





Exercise 3:


c) Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by

the user.







Exercise 6:




iii. To insert a sub-string in to given main string from a given position.

iv. To delete n Characters from a given position in a given string.

Exercise 8:

c) Write a C program to read two numbers, x and n, and then compute the sum of the geometric


3+………….+x

n

d) write a C program to find factorial of a given integer using recursion







Exercise 11:


Exercise 12:



the command line)

Manual/Books:



B.Tech - 3rd

Semester

SYLLABUS



L T P C

3 1 0 4























• Analyze and solve science & engineering problems applying the mathematical methods.





Quadratic forms- Reduction of quadratic form to canonical form – Rank - Positive, negative definite - semi

definite - index – signature.



Curve fitting: Fitting a straight line –Second degree curve-exponential curve-

power curve by method of least squares.









Method.



House, Bombay.





Pearson Education


B.Tech - 3rd

Semester



L T P C

3 1 0 4





processing.











computer.

• Know how high speed computers can be designed by using the pipelining and multiprocessor concepts.





BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes, Computer registers,

Computer instructions, Timing and Control, Instruction cycle, Memory-Reference instructions, Register-

Reference instruction, Input-Output instruction, Interrupts, Design of basic computer

UNIT – II 14Hrs

CENTRAL PROCESSING UNIT: Stack organization, Instruction formats,

Addressing modes, Data Transfer and manipulation, Program control, reduced instruction set computer,

Complex instruction set computer











Text Books:








Edition PHI/Pearson



B.Tech - 3rd

Semester



L T P C

3 1 0 4

















study.









UNIT-III 16Hrs





UNIT-IV 14Hrs





nd edition ,

Universities Press





Edition, PHI


B.Tech - 3rd

Semester



L T P C

3 1 0 4






delay.


circuits.


and registers.












• Construct and analyze the operation of flip-flop and troubleshoot various types of flip-flop circuits.



UNIT- I 15Hrs




representation(IEEE 754 Standard), Fixed point representation, Basic logic operations. Basic theorems and

properties of Boolean Algebra, switching functions, Canonical and Standard forms-Algebraic simplification

digital logic gates, universal gates and Multilevel NAND/NOR realizations, Generation of self dual

functions. Gray code, error detection and error correction codes, parity checking even parity, odd parity,

Hamming code

UNIT- II 15Hrs


Minimization of switching functions using K-Map up to 6-variables,

Tabularminimization, minimal SOP and POS Realization, Problem solving using K-map such as code

converters binary Multiplier. Half adder, Full adder, full subtractor, Ripple carry adder, Carry look ahead

adder, Multiplexer, De-Multiplexer, Encoder, Priority encoder, Decoder, MUX Realization of switching

functions Parity bit generator.

UNIT- III 15Hrs






flip-flops.

UNIT- IV 15Hrs








rd Edition, PHI.






Reference Books: 1. Switching & Finite Automata theory – ZviKohavi, 2

nd Edition TMH.



B.Tech - 3rd

Semester



L T P C

3 1 0 4















UNIT – I 16 Hrs Mathematical Logic: Statements and notations, Connectives, Well-formed formulas, Truth Tables,

Tautology, Two-state Device and Statement logic, Equivalence implication, Normal forms.


contradiction.








Groups, Sub group

UNIT-IV 16 Hrs

Elementary Combinatorics: Basis of counting, Permutations & Combinations

with repetitions, Constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, the

principles of Inclusion–Exclusion, Pigeon hole principle and its application.




P.Manohar, TMH







3rd

Edition , TMH.


B.Tech - 3rd

Semester

SYLLABUS



L T P C

0 0 3 2









data structures







B.Tech - 3rd

Semester

SYLLABUS



L T P C

0 0 3 2








tables








B.Tech- 4th

Semester



L T P C

3 1 0 4



Modulation systems






















UNIT – I 16Hrs





Metallic Cable Transmission Media: Metallic Transmission Lines, Metallic

Transmission Line Types, Metallic Transmission Line Equivalent Circuit, Wave Propagation on Metallic

Transmission Lines,Optical Fiber Transmission Media:Optical Fiber Communications System Block

Diagram, Optical Fiber Modes Optical Fiber construction, Propagation of Light Through an Optical fiber

Cable.

UNIT – II 15hrs








UNIT-III 15Hrs


Paging systems.



Cellular Telephone Systems: First- Generation Analog Cellular Telephone, Second-Generation Cellular

Telephone Systems, N-AMPS, Digital Cellular Telephone, Global system for Mobile Communications,

Personal Communications Satellite System.

UNIT-IV 14Hrs






Text Books : 1. Introduction to Data Communications and Networking, Wayne Tomasi, Pearson Education.


Edition, TMH.


nd Edition Thomson


Edition,

PearsonEducation.


B.Tech- 4th

Semester



L T P C

3 1 0 4



structure.


calculus













UNIT I 15Hrs




Database Design: Introduction to database design, ER Model, Additional features of ER Model, Conceptual

Design with the ER Model, Conceptual design for large enterprises.

UNIT II 15Hrs






UNIT III 15Hrs



Transactions: Transaction State, ACID properties of transaction, serial schedule,

parallel schedule,conflicts in concurrent Executions, Serializability, Recoverability, performance of locking,

transaction support in SQL.

UNIT IV 15Hrs









TEXT BOOKS :


Edition


Edition.

REFERENCES :


Edition.




B.Tech- 4th

Semester



L T P C

3 1 0 4



• Understand how java achieves platform independence using concept of

bytecode.



development.







• Know the concepts of classes, objects, members of a class and the relationships among them







UNIT- I 14Hrs















threads.




Event Handling: Events, Delegation event model, handling mouse and keyboard

events, Adapter classes, inner classes. Compare basic AWT components with swing components. More user

interface components - canvas, scrollbars, check box, choices, lists panels – scrollpane, dialogs, menubar,

layout manager types.


th Edition, TMH.



Longman


th Edition, PHI







B.Tech- 4th

Semester



L T P C

3 1 0 4




















using Semaphores

Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock

Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock.









thEdition,

John Wiley




nd Edition, TMH



edition, PHI.


B.Tech- 4th

Semester



L T P C

3 1 0 4




languages.

• Understand tuple descriptions of Mealy and Moore finite-state machines, State

diagrams, state tables and their relationship.






• Acquire the idea to design, specify and test grammars and also deterministic/nondeterministic pushdown

automata that recognize context-free languages.











with ε transitions, Equivalence between NFA with and without ε transitions, NFA to DFA conversion,

minimization of FSM, equivalence between two FSM’s Finite Automata with output-Moore and Mealy

machines.

















REFERENCES:


2nd

Edition, PHI.



B.Tech- 4th

Semester



L T P C

0 0 3 2










block.







complex functions.





B.Tech- 4th

Semester



Course code:

L T P C

0 0 3 2









19. Write a Java program, to demonstrate tokenizing given string/text using

StringTokenizer class


details.

21. Write a Java program to define and handle Exceptions in the implementation of Program3.(also make use

of throw, throws).







B.Tech- 5th

Semester

SYLLABUS

Course Title: Computer Networks Course Code: IT 3409

L T P C

3 1 0 4

Course Objectives:


• Understand basic network models and Different transmission used for data communication.

• Recognize the data link design issues and various data link protocols used for data transmission.

• Understand different routing algorithms used for data transmission from source to destination in a

network layer.

• Know how internet address are installed and how internet protocols are used in connecting internet.

Course Outcomes:


• Suggest appropriate network model for data communication.

• Know how reliable data communication is achieved through data link

layer.

• Propose appropriate routing algorithm for data routing.

• Connect internet to the system and knowledge of trouble shooting.

UNIT I: INTRODUCTION 11+4 Network Hardware, Network Software, and Reference Models: OSI, TCP/IP, The ARPANET, Network

Topologies, Physical Layer: Transmission media: Magnetic Media, Twisted pair, Base band Coaxial Cable,


Transmission.



layer: Channel allocation methods, Multiple Access protocols: ALOHA, CSMA, IEEE Standard 802.3 and

Ethernet, IEEE Standard 802.4: Token bus.












B.Tech- 5th

Semester

SYLLABUS

Course Title: Design and Analysis of Algorithms Course Code: IT 2406

L T P C

3 1 0 4

Course Objectives:


• Know asymptotic runtime complexity of algorithms including formulating recurrence relations using


• Understand and design algorithms using greedy strategy and dynamic programming, to arrive at local

best solution.

• Understand and design of algorithms using search space and optimization problem techniques for


• Identify basic computability concepts and the complexity classes like P, NP, and NP-Complete and


Course Outcomes:


• Analyze the asymptotic runtime complexity of algorithms for real world problems developed using


• Find the optimal solutions by using advanced design and analysis of algorithm techniques like greedy

method and dynamic programming.

• Apply the search space and optimization problem techniques like backtracking and branch and bound


• Distinguish the problems and its complexity as polynomial and NP problems and can formulate some


UNIT I: (11+5)



omega.




UNIT II: (13+3)






UNIT III: (11+3)




UNIT IV: (11+3)


theorem.




press.





5. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.

6. Algorithms – Richard Johnson baugh and Marcus Schaefer, Pearson

Education.


B.Tech- 5th

Semester

SYLLABUS


L T P C

3 1 0 4 Course

Objectives: The course content enables students to:










UNIT – I

13+4 HTML Common tags- List, Tables, images, forms, Frames, Links and Navigation, Image Maps




Validations.


Working with Variables and constants: Using variables, Using constants, Data types, Operators.


forms.













Text Books: 5. Web Technolgies, Uttam Roy, OXFORD University press



An Introduction to Web Design + Programming, Paul S.Wang, India Edition


B.Tech- 5th

Semester

SYLLABUS

Course Title: Software Engineering Course Code: CSE3409

L T P C

3 1 0 4



• Learn about software myths ,generic view of the process and Understand about process models

• Learn how to perform feasibility study of the projects under the requirement engineering process and

system models.

• Understand about Function oriented design and Architectural styles

• Get the knowledge of software testing and testing strategies, learn about risk management plan and

quality concepts.

COURSE OUTCOME(S):


• Design and develop real-time software projects with effective cost estimation and plan

• Make feasibility study of a project

• Specify the design and architectural style of the software products

• Propose testing strategy for a given software

UNIT I: (12+4)






UNIT II: (11+4) Software Requirements: Functional and non-functional requirements, User requirements, System

requirements, Interface specification, the software requirements document.




UNIT III: (11+4) Function Oriented Design: Structured analysis, DFD and its Extension, structured design detailed design.




Unit IV: (12+4)








TEXT BOOKS:



203-3819-7





B.Tech- 5th

Semester

SYLLABUS

Course Title: Microprocessors and Interfacing Course Code: ECE 3429

L T P C

3 1 0 4

Course objectives:


• Familiarize with the architecture of 8086 processor, assembling language programming and


• Learn to Interface various I/O peripherals like ADC, DAC, Keyboard, stepper motor etc., with


• do any type of industrial and real time applications by knowing the concepts of Microprocessors

• Understand 8251-USARTand serial communication concepts.

Course Outcomes:


• Understand the full internal workings of a typical simple CPU including the utilization of the various


• Introduce the design of basic I/O hardware and microprocessor interfacing: memory chip selection,


• Interface input and output devices like LCD, LED, Keyboards ADC, DAC

and stepper motor to microprocessors.

• Design the home appliances and toys using Microprocessor chips.

UNIT- I 8086 Architecture: (12 hours) 8086-Functional Diagram, Register Organization, Signal description, Physical Memory Organization,

Minimum and Maximum mode operations of 8086, Timing Diagrams.

UNIT- II Instruction Set of 8086: (16 hours) Addressing modes, Data Transfer Instructions, Arithmetic Instructions, Bit Manipulation Instructions,



UNIT- III Programmable devices and Interfacing of I/O with 8086: ( 16 hours)



UNIT-IV

8086 Interrupts and Serial Communication (16 hours) 8086 interrupts and Interrupt Vector Table (IVT), Programmable Interrupt Controller 8259A, Serial data



transfer.

Text Books:


edition 2007


Reference Books:


PHI second edition


B.Tech- 5th

Semester

SYLLABUS

Course Title: Advanced Databases Course Code: CSE3415

L T P C

3 1 0 4

Course Objectives


• Understand distributed architecture and distributed database design.

• Know advanced query processing and distributed query optimization techniques.

• Comprehend the transaction management along with parallel database systems.

• Grasp the object oriented data models database design.

Course outcomes:


• Design an architectural model for distributed database management system.

• Analyze Query processing and query optimization methods.

• Implement transaction management and database reliability for real world scenario.

• Use object-oriented distributed data model for data

UNIT-1 (11+4) Introduction; Distributed Data Processing, Distributed Database System, Promises of DDBSs, Problem areas.

Overview of Relational DBMS: Relational Database Concepts, Normalization,

Integrity rules, Relational data languages.


Architecture.












partitioning.

Parallel Database Systems: Database Series, Parallel Architecture, Parallel DBMS Techniques, Parallel


UNIT-IV (11+4) Distributed object Database Management Systems: Fundamental object concepts and Models, Object

Distributed Design, Architectural Issues, Object Management, Distributed Object storage, Object query

Processing.

Object Oriented Data Model : Inheritance, Object identity, persistent programming languages, persistence of


TEXT BOOKS: 1. M.Tamer OZSU and Patuck Valduriez: Principles of Distributed Database Systems,


2. Stefano Ceri and Willipse Pelagatti: Distributed Databases, McGraw Hill.




B.Tech- 5th

Semester

SYLLABUS

Course Title: Computer Graphics Course Code: CSE3412

L T P C

3 1 0 4

Course Objectives:


• Learn basic principles and problems of computer graphics.

• Know application areas of computer graphics, different display devices and their characteristics to

display an object.

• Understand background of the geometrical and mathematical foundations with algorithms for




• Understand 3D viewing, rendering, visible surface detection algorithms with animation

fundamentals.

Course Outcomes:


• Be familiarized with contemporary graphics hardware, the actual

methodology and techniques to draw computer graphics, animations etc. for the real world

presentation and how it is implemented in Computer graphics software

• Develop new kinds of graphics and animations.

• Design and develop graphics applications with the implementation of advanced methods such as

ray tracing, texture mapping, illumination and shading and be able to build interactive user

interface to manipulate objects in a 3D scene and also in the development of Web pages.

• Demonstrate the ability to develop an animation movie.




algorithms), mid-point circle and ellipse algorithms.

Filled area primitives: Inside and outside tests,


UNIT – II

(11+4) 2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations, matrix


systems.




UNIT-III

(11+4) 3-D object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier




UNIT-IV (12+3) Visible surface detection methods: Classification, back-face detection, depth-buffer, scan-line, depth




Text Books: 1. Computer Graphics C version, Donald Hearn, M.Pauline Baker, Pearson





B.Tech- 5th

Semester

SYLLABUS

Course Title: Computer Networks Lab Course Code: IT 3211

L T P C

0 0 3 2



• Understand basic network models and Different transmission media used for data communication.

• Understand the data link design issues and various data link protocols used for data transmission.

• Comprehend different routing algorithms used for data transmission from source to destination in a

network layer.

• Know how internet addresses are configured and how internet protocols are used in connecting

internet.

COURSE OUTCOME(S):


• By learning models students suggest appropriate network model for data communication.

• Know how reliable data communication is achieved through data link layer.

• Suggest appropriate routing algorithm for the network.

• Provide internet connection to the system and its installation.

Course Contents

1. a. Familiarization with Networking Components and devices: LAN

Adapters,






b) character stuffing b) bit Stuffing














B. Tech- 5th

Semester

SYLLABUS


L T P C

0 0 3 2














Experimen-3: 7) Student personal Info Page 8) Student Academic Info page 9)

Semester Wise Percentage & their Aggregate page



static web pages.


servers.














servlet by using the get In it Parameters() method.



database.






B. Tech- 6th

Semester

SYLLABUS

Course Title: Data Mining Course Code: CSE 3429

L T P C

3 1 0 4

Course Objectives:


• Understand fundamentals of data mining concepts.

• Understand the concept of association rule mining and generate association rules.

• Learn classification algorithms and classify the real data set.

• Analyze clustering methods and understand mining complex data types.

Course Outcomes:

At the end of the course students will be able to:

• Apply relevant preprocessing techniques on different data sets for mining.

• Implement Association rule mining concept and generate association rules.

• Apply classification/clustering techniques on different types of data and analyze patterns.

• Suggest appropriate data mining techniques to mine different types of data.

UNIT I: 11+4 Introduction: What is data mining, Motivating challenges, the origins of data mining, Data Mining Tasks.

Data: Types of data, Data quality, Data preprocessing, Measures of similarity and dissimilarity - Basics,

Similarity and Dissimilarity between Simple Attributes, Similarities and Dissimilarities between Data

objects, Examples of proximity measures, Issues in proximity Calculations,

selection of the right proximity Measure.

UNIT II: 12+4 Mining Association Rules in Large Databases - Association Rule Mining, Mining Single-Dimensional

Boolean Association Rules from Transactional Databases, Mining Multilevel Association Rules from

Transaction Databases, Mining Multidimensional Association Rules from data sources, From

Association Mining to Correlation Analysis, Constraint-Based Association Mining.

UNIT III: 10+3 Classification - Preliminaries, General approach to solving a classification problem, Decision tree induction,

Rule-based classifier, Nearest-Neighbor classifiers, Bayesian classifiers, Artificial Neural Network.

UNIT IV: 12+4 Cluster Analysis - Overview, K-means, Agglomerative Hierarchical Clustering, DBSCAN, Prototype-based

clustering, Cluster Evaluation.

Mining Complex Types of Data - Multidimensional Analysis and Descriptive Mining of Complex,

Data Objects, Mining Spatial Databases, Mining Multimedia Databases, Mining Text Databases, Mining

the World Wide Web.

Text Books: 1. Introduction to Data Mining, Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Pearson Education.

2. Data Mining Concepts and Techniques, Jiawei Han & Micheline Kamber Harcourt India.

Reference Books: 1. Data Mining Introductory and advanced topics, Margaret H Dunham, Pearson Education.

2. Data Mining Techniques, Arun K Pujari, University Press.


B. Tech - 6th

Semester

SYLLABUS


L T P C

3 1 0 4




diagram.



Course outcomes:










Advanced Structural Modeling: Advanced classes, advanced relationships,

Interfaces, Types and Roles, Packages.









Education.


Pvt. Ltd.






B. Tech - 6th

Semester

SYLLABUS

Course Title: Language Processors Course Code: CSE3414

L T P C

3 1 0 4

COURSE OBJECTIVES:


• Learn various translators and phases of compiler.

• Learn context free grammars, top-down and bottom-up parsing.

• Learn symbol tables and intermediate code.

• Learn various code optimization and code generation techniques.

COURSE OUTCOMES

At the end of the course, students are able to:

• Deal with different translators and to acquire the knowledge of compiler and its Phases.

• Use of formal grammars for specifying the syntax and Semantics of programming languages

• Build symbol tables and generate intermediate code for a given program.

• Apply the code optimization techniques to improve the performance of a program in terms of speed

and space.

• Design a compiler for a concise programming language.

UNIT – I: [15]

Overview of language processing , compiler, assembler , interpreters, linkers &

loaders, structure of a compiler, phases of a compiler, Lexical Analysis, Role of Lexical Analysis, Token,

patterns and Lexemes, Lexical Errors, Regular definitions for the language constructs, Transition diagram for

recognition of tokens, Reserved words and identifiers

UNIT-II [16]














edition, TMH, 2011.






B. Tech - 6th

Semester

SYLLABUS

Course Title: Digital Signal Processing Course Code: ECE 3421

L T P C

3 1 0 4


• Enhance the analytical ability of the students in facing the challenges posed by growing trends in

communication, control and signal processing areas.

• develop ability among students for problem formulation, system design and solving skills

• demonstrate basic knowledge of Digital Signal Processing by understanding various transformations

• Understand Various Discrete-time signals and class of Linear shift-invariant systems will be studied


• Design system with digital network composed of adders, delay elements, and coefficient

multipliers.


• Analyze the system in Time and Frequency domain through its respective tools.

• Demonstrate knowledge of complex number, Fourier series and ability to design electrical and


• Design the digital filter circuits for generating desired signal wave shapes (non sinusoidal) for


• Design the digital computer or digital hardware for quantizing amplitudes of signals.

• Design the various processing circuits that are necessary in the hardware or interfacing blocks in

systems used in radars, satellite etc

UNIT-I

Introduction to Discrete –Time signals and systems (15 hours) Classification of Discrete time signals & sequences, linear Time Invariant (LTI) systems, (BIBO) stability,




UNIT-II

Discrete –Time signals in Transform domain (15 hours) Discrete Fourier Series(DFS), Discrete Time Fourier transforms(DTFT), Discrete Fourier transform(DFT),



UNIT-III

IIR Digital Filters: (15 hours) Analog filter approximations – Butter worth and Chebyshev , Impulse Invariant transformation , Bilinear


UNIT-IV

FIR Digital Filters & Multi rate Signal Processing (15 hours) FIR Digital Filters: Characteristics of FIR Digital Filters, frequency response, Design of FIR Digital Filters

using Window Techniques, Comparison of IIR & FIR filters.


conversion.

Text Books:




G. Manolakis, Pearson Education / PHI, 2007.

Reference Books:





B. Tech - 6th

Semester

SYLLABUS

Course Title: INFORMATION SECURITY Course Code: CSE 3413

L T P C 3 1 0 4

Course bjectives: The course content enables students to :

Understand about various Conventional Encryption Principles designed for providing

security. • Learn public key cryptography, key management principles and Learn Pretty Good Privacy (PGP)

which is a computer program that provides cryptographic privacy and authentication. • Learn IP Security fundamentals, architecture and identifying the key features IP security system. • Understand about general requirements for Web security, which focus on standardized

schemes. Course Outcomes: At the end of the course students are able to:

• Analyze a given system with respect to security of the system. • Create an understanding of Authentication functions the manner in which Message

Authentication Codes and Hash Functions works. • Examine the issues and structure of Authentication Service and Electronic Mail Security

Understand conventional and public key cryptographic approaches used in message encryption.

• Able to identify various types of attacks and its effect over the networks.

UNIT – I: (12+3) Introduction: Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services (Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability), TCP session hijacking, UDP hijacking, ARP attacks, & Man-in-the-Middle Attacks. OSI Security Architecture - Classical Encryption techniques – Cipher Principles. Conventional Encryption Principles: Conventional encryption algorithms - Data Encryption Standard (DES), Blowfish, CAST-128, Block Cipher Design Principles and cipher block Modes of Operation, Evaluation criteria for AES Cipher.

UNIT-II: (11+4) Public Key Cryptography: Public key cryptography principles, public key cryptography algorithms, digital signatures. Digital Certificates, Certificate Authority and key management Authentication & Hash Function: Authentication requirements – Authentication functions – Message Authentication Codes – Hash Functions – Security of Hash Functions and MACs – MD5 message Digest algorithm - Secure Hash Algorithm –RIPEMD-HMAC Digital Signatures – Authentication Protocols – Digital Signature Standard.

UNIT-III 11+4 Network Security Authentication Applications: Kerberos – X.509 Authentication Service –

Electronic Mail Security – PGP – S/MIME

IP Security: IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating

Security Payload, Combining Security Associations and Key Management.

UNIT – IV: (11+4) Web Security: Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS), Secure Electronic Transaction (SET). System Level Security Intrusion detection – password management – Viruses and related Threats

– Virus Counter measures – Firewall Design Principles – Trusted Systems.

Text Books: 1. Network Security Essentials (Applications and Standards) by William Stallings Pearson Education. 2. Hack Proofing your network by Ryan Russell, Dan Kaminsky, Rain Forest Puppy, Joe Grand, David

Ahmad, Hal Flynn IdoDubrawsky, Steve W.Manzuik and Ryan Permeh, wileyDreamtech.

References: 1. AtulKahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003. 2. William Stallings, “Cryptography and Network Security – Principles and Practices”,

PrenticeHallofIndia,ThirdEdition,2003 3. Sfsdffs ff Charles B. Pfleeger, Shari LawrencePfleeger, “Security in Computing”, Third

Edition, Pearson Education, 2003.


B. Tech - 6th

Semester

SYLLABUS


L T P C

3 1 0 4

Course Objectives:






Course Outcomes:






UNIT – I 12+4 Mobile Communications - Overview: Wireless transmission, voice and data communication standards –

1G/2G/3G/4G, WPAN, WLAN, applications, limitations, mobile computing architecture, overview on

mobile devices and systems




EDGE

UNIT – II 10+3 Mobile Network Layer: Mobile IP, IP packet delivery, agent advertisement and discovery, registration,



UNIT – III 12+4 Mobile Ad hoc Network (MANET): Introduction, Properties, applications, limitations, routing issues,




UNIT – IV 11+4




Text Books:



Reference Books:





B. Tech - 6th

Semester

SYLLABUS

Course Title: Real Time Operating System Course Code: CSE4430

L T P C

3 1 0 4

Course Objectives:


• Explain the concept of a real-time system and why these systems are usually implemented as

concurrent processes

• Describe a design process for real-time systems.

• Explain the role of a real-time operating system.

• Introduce generic process architectures for monitoring and control and data acquisition systems

Course Outcomes:


• Present the mathematical model of the system and to develop real time algorithm for task scheduling.

• Understand capabilities Handling Resource Sharing and dependencies among Real-time Tasks

• Generate a high-level analysis for Scheduling Real-time tasks in multiprocessor and distributed

systems

• Understand the working of real time operating systems and real time database.

UNIT-I

REAL-TIME SYSTEMS 11+4 Introduction: What is real time, Applications of Real-Time systems, A basic model of Real-time system,

Characteristics of Real-time system, Safety and Reliability, Types of Real-time tasks, timing constraints,

Modeling timing constraints

Some important concepts, Types of Real-time tasks and their characteristics, Task scheduling, Clock-Driven

scheduling, Hybrid

schedulers, Event-Driven scheduling, Earliest Deadline First (EDF) scheduling.

UNIT-II 11+ 4 Rate monotonic algorithm (RMA). Some issues associated with RMA. Issues in using RMA practical

situations.

Handling Resource Sharing and dependencies among Real-time Tasks: Resource sharing among real-time

tasks. Priority inversion. Priority Inheritance Protocol (PIP), Highest Locker Protocol (HLP). Priority Ceiling

Protocol (PCP).Different types of priority inversions under PCP. Important features of PCP. Some issues in

using a resource sharing protocol. Handling task dependencies.

UNIT-III 11+ 4 Scheduling Real-time tasks in multiprocessor and distributed systems:

Multiprocessor task allocation, Dynamic allocation of tasks. Fault tolerant scheduling of tasks. Clock in

distributed Real-time systems, Centralized clock synchronization

Commercial Real-time operating systems: Time services, Features of a Real-time operating system, Unix as

a Real-time operating system, Unix-based Real-time operating systems, Windows as a Real-time operating

system, POSIX-RT, A survey of contemporary Real-time operating systems. Benchmarking real-time

systems.

UNIT-IV 11+ 4 Real-time Databases: Example applications of Real-time databases. Review of basic database concepts,

Real-time databases, Characteristics of temporal data.

Concurrency control in real-time databases. Commercial real-time databases. Real-time Communication:

Basic concepts, Examples of applications, Real-time communication in a LAN an d Real-time

communication over packet switched networks.

Text Book: 1. Real-time Systems Theory and Practice by Rajib Mall, Pearson Publication, 2008.

References Books: 1. Jane W. S. Liu, Real-Time Systems, Pearson Education, 2000.

2. C.M. Krishna and K.G. Shin, Real-Time Systems, TMH.


B. Tech - 6th

Semester

SYLLABUS

Course Title: SOFT COMPUTING Course Code: CSE 3416

L T P C

3 1 0 4

Course Objectives:


• Understand the soft computing techniques and their roles in building intelligent machines.

• Understand about fundamentals of neural networks and learning methods.

• Learn about Fuzzy logic, sets and relationships between them to understand the Fuzzy system.

• To know about fuzzy logic controlled genetic algorithms to practice the soft computing tools.

Course Outcomes:


• Identify and describe soft computing techniques and their roles in building intelligent machines.

• Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems

• Apply neural networks to pattern classification and regression problems.

• Evaluate and compare solutions by various soft computing approaches for a given problem.

UNIT I: (10+3)




UNIT II: (12+3)




UNIT III: (14+5)




UNIT IV: (9+4)



TEXT BOOKS:



REFERENCE BOOKS:




N.Y, 1989.



B. Tech - 6th

Semester

SYLLABUS

Course Title: Language Processors Lab Course Code: CSE 3218

L T P C

0 0 3 2

Course Objectives


• Implement the actions performed by Lexical Analyzer without using Lex tool.

• Implement Lexical Analyzer using Lex tool.

• Implement Syntax Analyzer or parser using YACC Tool.

• Implement the top-down and bottom-up parsing.

Course Outcomes:


• Apply the knowledge of LEX tool to develop a scanner.

• Compute the first and follow of non-terminals of a grammar.

• Apply the knowledge of YACC tool to develop a parser.

• Design top-down and bottom-up parsers












B. Tech- 6th

Semester

SYLLABUS


L T P C

0 0 3 2


















2. Pascal Roques: Modeling Software Systems Using UML2, WILEY-Dreamtech India Pvt. Ltd.

3. AtulKahate: Object Oriented Analysis & Design, The McGraw-Hill Companies.

4. Mark Priestley: Practical Object-Oriented Design with UML,TATAMcGrawHill


Publications Pvt.Ltd , New Delhi.


B.Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4















UNIT-I:




Even Analysis.

UNIT-II:





UNIT-III:




UNIT-IV:





Delhi, 2012.







2009.




B. Tech- 7th

or 8th

Semester

SYLLABUS

Course Title: Design Patterns Course Code: IT4430

L T P C

3 1 0 4

Course Objectives: The course content enables students to: • Understand different types of Design patterns • Apply patterns in programming projects to make code more readable • Create an object-oriented design using design patterns • Learn advanced design techniques, principles, practices, and approaches in solving problems • Compare design patterns with object-oriented designs

Course Outcome: At the end of the course students are able to:

• Classify and document design patterns

• Understand patterns to manage algorithms and assign responsibilities to objects

• Apply patterns to solve design problems

• Create new design patterns

UNIT – I (11+3) Hrs Introduction: What Is a Design Pattern? Design Patterns in Smalltalk MVC, Describing Design Patterns,

The Catalog of Design Patterns, Organizing the Catalog, How Design Patterns Solve Design Problems, How

to Select a Design Pattern, How to Use a Design Pattern.

UNIT – II (12+4) Hrs Creational Patterns: Abstract Factory, Builder, Factory Method, Prototype, Singleton, Discussion of

Creational Patterns. Structural Pattern Part-I: Adapter, Bridge, Composite.

UNIT-III (11+4) Hrs Structural Pattern Part-II: Decorator, Façade, Flyweight, Proxy.

Behavioral Patterns Part-I: Chain of Responsibility, Command, Interpreter, Iterator.

UNIT-IV

(11+4) Hrs Behavioral Patterns Part-II: Mediator, Memento, Observer, State, Strategy, Template Method,Visitor,

Discussion of Behavioral Patterns.

What to Expect from Design Patterns: A Brief History, the Pattern Community An Invitation, A Parting

Thought.

TEXT BOOK: 1. Design Patterns By Erich Gamma, Pearson Education

REFERENCE BOOKS: 1. Pattern’s in JAVA Vol-I By Mark Grand ,WileyDreamTech.

2. JAVA Enterprise Design Patterns Vol-III By Mark Grand ,Wiley DreamTech.

3. Head First Design Patterns By Eric Freeman-Oreilly-spd

4. Design Patterns Explained By Alan Shalloway,Pearson Education


B.Tech- 7th

or 8th

Semester

SYLLABUS

Course Title: Embedded Systems Course Code: ECE 4433

L T P C

3 1 0 4

Course objectives: Students undergoing this course are expected to:

• Know Embedded system compared to General Purpose Systems

• Learn the typical core of embedded system design with applications.

• Gain knowledge on selection of an embedded system based on quality attributes.

• Understand about Hardware and firmware design of embedded system.

• Learn complete embedded system life cycle and software utility tools for testing and implementation.

Course Outcomes: After undergoing the course, students will be able to

• Define differences between embedded system and general purpose systems.

• Describe embedded system with the help of various components.

• Analyze the design of embedded system with respect to quality attribute and can demonstrate the up

gradations for real time application.

• Know the hardware software co design of embedded system.

• Explore different IDEs to design and implementation of embedded system and able to create real time

applications.

UNIT I (16 hours)

Introduction Introduction to Embedded Systems and Definition Embedded system versus general Computing Systems

History of Embedded Systems, Classification of Embedded Systems Major application areas of Embedded

Systems and Purpose of Embedded Systems The typical Embedded System-core of Embedded System

Memory ,sensors and actuators Communication Interface Embedded Firmware, other system components

PCB and Passive Components Embedded system with an Example

UNIT II (14 hours)

Embedded Systems-Characteristics and Quality Attributes Embedded Systems-Characteristics and Quality Attributes Introduction to Characteristics of Embedded

Systems Quality Attributes of Embedded Systems Application Specific Embedded Systems Washing

machine example Domain Specific Example of Embedded Systems Automotive Embedded Systems

Explaining the characteristics with an example

UNIT III (15 hours)

EMBEDDED HARDWARE AND FIRMWARE DESIGN Embedded Hardware Design Introduction to Embedded hardware Analog electronic components Digital

electronic components I/O Types and Examples Serial communication devices Parallel device ports Wireless

devices Timers and Counting Devices Watchdog timer and Real time clock Embedded Firmware Design

Introduction to Embedded firmware design approaches Embedded firmware development languages ISR

concept ,Interrupt sources Interrupt servicing mechanism Multiple interrupts DMA, Device driver

programming Concepts of C versus Embedded C Compiler versus Cross-compiler.

UNIT IV (15 hours)

Hardware Software Co-Design, Implementation and Testing Hardware Software Co-Design Fundamental Issues in Hardware Co-Design Fundamental Issues in Software

Co-Design Computational models in Embedded Design Hardware software trade offs Integration of

Hardware and Firmware ICE Issues in Embedded system Design Design with an real time example.

Embedded System Implementation and Testing The main software utility tool CAD and hardware

Translation tools Pre-processors Interpreters Compilers and Linkers Debugging tools Quality assurance and

testing of the design Testing on host machine Simulators and Laboratory tools

Text Books:: 1.Introduction To Embedded Systems by Shibu .K.V- Tata McGraw Hill Education Private

Limited. 2009

2.Embedded systems Architecture By Tammy Noergaard, Elsevier publications, 2005

Reference Books: 4. Embedded Systems – Raj Kamal, TMS, Second Edition 2008.

5. Embedded System building blocks By Labrosse, CMP publishers

6. Embedded System Design – A Unified Hardware/Software Introduction – Frank Vahid, Tony D. Givargis,

John Wiley, 2002.


B.Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4

Course Objectives:

The course content enables students to





Course Outcomes: At the end of the course students are able to :





UNIT-1 11+3




Communication.








Recovery.

Distributed File Systems: Introduction to distributed file systems, Architecture,

Process, communications, consistency and replication, Sun network file system.






Text Books:

3. Distributes Systems Principles and paradigms,Second Edition-Andrew S.Tanenbaum,Maarten Van

Steen.


4th




B.Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4

COURSE OBJECTIVES:







COURSE OUTCOMES:







UNIT – I 11+4 Introduction to client server computing: Evolution of corporate computing models from centralized to


Programming.


UNIT – II 11+4 Introducing C# and the .NET Platform; Understanding .NET Assemblies, Object –Oriented Programming



UNIT-III 12+3 Core CORBA / Java: Two types of Client/ Server invocations-static, dynamic. The static CORBA, first


Existential CORBA: CORBA initialization protocol, CORBA activation services, CORBA IDL mapping

CORBA java- to- IDL mapping.

UNIT-IV 11+4




Text Books:


SPD 2nd Edition


John wiley and sons

Reference Books:








B. Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4

Course Objectives:





techniques.





management tools.

Course Outcomes:






standards.


UNIT-1






UNIT-2




Collecting Data, Visualizing Progress, Cost Monitoring, review techniques, project

termination review, Earned Value analysis, Change Control, Software Configuration Management (SCM),

Managing Contracts, Types Of Contracts, Stages In Contract Placement, Typical Terms of A Contract,

Contract Management and Acceptance.

UNIT-3







UNIT-4







Text Book

2. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth

Edition, Tata McGraw Hill, New Delhi, 2012.

Reference Books:




7. Samuel J mantel et.el “Project Management- Core Textbook”, First India Edition,

Wiley India



B. Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4

Course Objectives:



processing






Course Outcomes:








UNIT I 18 hours



sampling and quantization, basic relationships between pixels. An introduction to mathematical tools in

digital image processing



UNIT II 16 hours





UNIT III 12 hours




filtering.

UNIT IV 14 hours


Segmentation.




Text Book:


2011

Reference Books:



2009




House


B. Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4

COURSE OBJECTIVES:







COURSE OUTCOMES:






UNIT I 10 +3





UNIT II 11 +4





UNIT-III 11 + 4




UNIT IV 13+4





Press online.







B. Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4

COURSE OBJECTIVES:






COURSE OUTCOMES:



software project.









Management plan.




Modules to objects -Cohesion and Coupling, Data Encapsulation and Information hiding aspects of objects.



Unit III: 13+4 Requirement phase - Rapid Prototyping method, Specification phase , Specification Document, Formal

methods of developing specification document, Examples of other semi - formal methods of using Finite-



Unit IV: 10+4 Design phase -Data oriented design, Object Oriented design, Formal techniques for detailed design.




REFERENCEBOOKS: 3. Component-based softwareengineering:7thinternational symposium, CBSE 2004, IvicaCrnkovic,

Springer


B. Tech- 7th

or 8th

Semester

SYLLABUS

Course Title: Wireless Ad Hoc Networks Course Code: CSE4431

L T P C

3 1 0 4


• Understand the architecture of Wireless Ad Hoc Network


• Understand issues and challenges in Providing QoS in Ad Hoc Wireless Networks



• Analyze MAC protocols for Ad Hoc Wireless Networks

• Analyze Routing protocols for Ad Hoc Wireless Networks

• Understand the need for Energy Management in Ad Hoc Wireless Networks

• Understand the issues and challenges in Wireless Network security

UNIT-I:

(11+4) Wireless Ad Hoc Networks: Introduction, Properties, applications, limitations, Issues in Ad Hoc Wireless

Networks, Ad Hoc Wireless Internet.

MAC Protocols: Introduction, Issues in Designing a MAC protocol for Ad Hoc Wireless Networks, Design

goals of a MAC Protocol for Ad Hoc Wireless Networks, Classifications of MAC Protocols, Contention -

Based Protocols, Contention - Based Protocols with reservation Mechanisms, Contention – Based MAC

Protocols with Scheduling Mechanisms

UNIT -III: (12+4) Routing Protocols: Introduction, Issues in Designing a Routing Protocol for Ad Hoc Wireless

Networks, Classification of Routing Protocols, Proactive/ Table–Driven Routing Protocols, Reactive/ On–

Demand Routing Protocols, Hybrid Routing Protocols, Hierarchical Routing Protocols, Power – Aware

Routing Protocols.

Transport Layer: 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, Other Transport Layer Protocol for Ad

Hoc Wireless Networks,

UNIT –III: (11+3) Quality of Service: Introduction, Issues and Challenges in Providing QoS in Ad Hoc Wireless

Networks, Classification of QoS Solutions, MAC Layer Solutions, Network Layer Solutions, QoS

Frameworks for Ad Hoc Wireless Networks.

Energy Management: Introduction, Need for Energy Management in Ad Hoc Wireless Networks,

Classification of Ad Hoc Wireless Networks, Battery Management Schemes, Transmission Power

Management Schemes, System Power Management Schemes.

UNIT – IV: (11+4) Security Protocols: Network Security Requirements, Issues and Challenges in Security Provisioning,

Network Security Attacks, Key Management, Secure Routing in Ad Hoc Wireless Networks.

Wireless Sensor Networks: Introduction, Sensor Network Architecture, Data Dissemination, Data

Gathering, Location Discovery, Quality of a Sensor Network, Evolving Standards, Other Issues.

TEXT BOOKS: 1. Ad Hoc Wireless Networks: Architectures and Protocols - C. Siva Ram Murthy and

B.S.Manoj, 2004, PHI.

2. Wireless Ad- hoc and Sensor Networks: Protocols, Performance and Control - Jagannathan

Sarangapani, CRC Press

REFERENCE BOOKS: 1. Wireless Sensor Networks - C. S. Raghavendra, Krishna M. Sivalingam, 2004, Springer

2. Ad- Hoc Mobile Wireless Networks: Protocols & Systems, C.K. Toh ,First ed. Pearson Education


B. Tech- 7th

or 8th

Semester

SYLLABUS

Course Title: Data Mining Lab. Course Code: CSE4232

L T P C

0 0 3 2



• Conceptualize the data mining problem

• Perform Preprocess data

• analyze and visualize the data with data mining techniques

• Perform predictive modeling

• Generate association rules for business data

COURSE OUTCOME(S):


• Implement the algorithms to solve data mining problem using WEKA tool

• Identify an appropriate method to apply in a given situation

• Communicate results in terms relevant to science, business etc.

• Apply different clustering techniques to characterize subgroups.

Course Contents Implement the following by using WEKA/ Clementine

1. Introduction to Graphical User Interface (GUI) of WEKA

2. Perform Data Pre-processing on sample data set

3. Introduction to IBM SPSS Modeler and nodes palette

4. Preparing the data for analysis using data audit node.

5. Automated data preparation using data audited node.

6. Perform Association Analysis to derive the association rules.

7. Implement the Classification using Decision Tree Induction.

8. Classification using Regression.

9. Bayesian Classification.

10. Classifying telecommunications churn by using Binomial Regression.

11. Market basket analysis using rule induction/C5.0.

12. Predicting Loan defaulters using Bayesian Networks.

13. K-means clustering.

14. Hierarchical clustering.


B. Tech- 7th

or 8th

Semester

SYLLABUS

Course Title: Design and Analysis of Algorithms Lab. Course Code: CSE4233

L T P C

0 0 3 2

Course Objectives:





best solution.





Course Outcomes:










1. Implement Fibonacci Search to search a given key.

2. Sort a given set of elements using the Quick sort method and determine the time required to sort the

elements. Repeat the experiment for different values of n, the number of elements in the list to be

sorted and plot a graph of the time taken versus n.

Also use same set of data to sort using merge sort and compare with quick sort.

3. A) From a given vertex in a weighted connected graph, find shortest paths to other vertices using

Dijikstra’s algorithm.

B) Compute the transitive closure of a given directed graph using Warshall's algorithm.

4. Implement 0/1 Knapsack problem using Dynamic Programming.

5. Find a subset of a given set S = {sl, s2... sn} of n positive integers whose sum is equal to a given

positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions {1, 2, 6} and

{1, 8}. A suitable message is to be displayed of a problem instance with all possible solution.

6. Implement any scheme to find the optimal solution for the Traveling

Salesperson problem and then solve the same problem.

7. A) Implement non-deterministic method to sort a given set of numbers.

B) Implement 0/1 Knapsack problem using non-deterministic method.

8. A) Implement the Chinese remainder theorem

B) Implement Modular Exponentiation Algorithm to compute ab mod n where a, b, and n are

positive integers

Course titles and content of B.Tech- 5th to8th semesters – 2013 admitted batch (AR 2013) Non-Practice school



HS 1401 English – I 3 1 - 4




Engineering 3 1 - 4





Total 15 5 09 26

B.Tech. 2nd

Semester


HS 1401 English – II 3 1 - 4




Engineering 3 1 - 4


Programming 3 1 - 4


CSE 1202 Computer Programming

Lab - - 3 2


Total 15 5 09 26

B.Tech 3rd

Semester







Theory 3 1 - 4



Total 15 05 06 24

B.Tech 4th

Semester











Total 15 05 06 24

B.Tech. 5th

Semester






Elective - I

ECE 3428 Microprocessors and Interfacing

3 1 - 4 CSE 3415 Advanced Database

CSE 3412 Computer Graphics

GMR40204 Mini Project - - 3 2

Laboratories



Total 15 05 9 26

B.Tech. 6th

Semester


Practical Credits

CSE3429 Data Mining 3 1 - 4


CSE3414 Language Processors 3 1 - 4

Elective - II

ECE 3421 Digital Signal Processing 3 1 4

CSE 3413 Information Security

CSE4422 Mobile Computing -

CSE 3430

Real Time Operating System

Elective - III (Open Elective)


3 1 4



System (ECE)


Management (Chem.)





Laboratories

CSE3218 Language processor Lab - 3 2

IT3219 Object Oriented Analysis and Design Lab - 3 2

GMR 30206 Term Paper - - 3 2

Total 15 05 9 26

B. Tech. 7th

Semester


IT4430 Design Patterns 3 1 - 4

Elective-IV

CSE4419 Distributed Systems

3 1

- 4 CSE4420 Middleware Technologies


Elective-V


3 1 - 4 CSE4431 Wireless Ad-hoc Networks

CSE4424 Big Data Analytics

Laboratories

CSE4232 Data Mining Lab. - - 3 2

CSE4233 Design & Analysis of Algorithms Lab. - - 3 2

Total 09 03 06 16

B. Tech. 8th

Semester



management 3 1

- 4

CSE4427 Object Oriented Software Engineering 3 1 - 4

Elective-VI

CSE4425 Bio-Informatics

3 1

- 4 CSE4426 E-commerce

CSE4428 Pattern Recognition

Laboratories

GMR41205 Main Project 12

Total 09 03 06 24

B.Tech- 2nd

Semester


SYLLABUS



L T P C

3 1 0 4





program writing.












UNIT I: 11+3 Hrs







UNIT II: 11+4 Hrs

SELECTION – MAKING DECISIONS: Two-way selection: if- else, null else,

nested if, Multi-way selection: switch, else-if, Iterative Loops – while, do-while and for statements, break,

continue



UNIT III: 12+4 Hrs

FUNCTIONS-MODULAR PROGRAMMING: Functions, basics, parameter passing, storage classes-

extern, auto, register, static, scope rules, block structure, user defined functions, standard library functions,

recursive functions, passing 1-D and 2-D arrays to functions.




UNIT IV: 11+4Hrs





I/O operations






B.Tech- 2nd

Semester


SYLLABUS



L T P C

0 0 3 2













Exercise l :



Exercise 2:





Exercise 3:


d) Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by

the user.







Exercise 6:




v. To insert a sub-string in to given main string from a given position.

vi. To delete n Characters from a given position in a given string.

Exercise 8:

e) Write a C program to read two numbers, x and n, and then compute the sum of the geometric


3+………….+x

n

f) write a C program to find factorial of a given integer using recursion







Exercise 11:


Exercise 12:



the command line)

Manual/Books:



B.Tech - 3rd

Semester



L T P C

3 1 0 4























• Analyze and solve science & engineering problems applying the mathematical

methods.





Quadratic forms- Reduction of quadratic form to canonical form – Rank - Positive, negative definite - semi

definite - index – signature.



Curve fitting: Fitting a straight line –Second degree curve-exponential curve-power curve by method of least

squares.









Method.



House, Bombay.





Pearson Education


B.Tech - 3rd

Semester



L T P C

3 1 0 4





processing.











computer.

• Know how high speed computers can be designed by using the pipelining and

multiprocessor concepts.





BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes, Computer registers,

Computer instructions, Timing and Control, Instruction cycle, Memory-Reference instructions, Register-

Reference instruction, Input-Output instruction, Interrupts, Design of basic computer

UNIT – II 14Hrs CENTRAL PROCESSING UNIT: Stack organization, Instruction formats, Addressing modes, Data

Transfer and manipulation, Program control, reduced instruction set computer, Complex instruction set

computer











Text Books:








Edition PHI/Pearson



B.Tech - 3rd

Semester



L T P C

3 1 0 4

















study.









UNIT-III 16Hrs





UNIT-IV 14Hrs





nd edition ,

Universities Press





Edition, PHI


B.Tech - 3rd

Semester



L T P C

3 1 0 4






delay.


circuits.


and registers.












• Construct and analyze the operation of flip-flop and troubleshoot various types

of flip-flop circuits.



UNIT- I 15Hrs




representation(IEEE 754 Standard), Fixed point representation, Basic logic operations. Basic theorems and

properties of Boolean Algebra, switching functions, Canonical and Standard forms-Algebraic simplification

digital logic gates, universal gates and Multilevel NAND/NOR realizations, Generation of self dual

functions. Gray code, error detection and error correction codes, parity checking even parity, odd parity,

Hamming code

UNIT- II 15Hrs


Minimization of switching functions using K-Map up to 6-variables, Tabularminimization, minimal SOP and

POS Realization, Problem solving using K-map such as code converters binary Multiplier. Half adder, Full

adder, full subtractor, Ripple carry adder, Carry look ahead adder, Multiplexer, De-Multiplexer, Encoder,

Priority encoder, Decoder, MUX Realization of switching functions Parity bit generator.

UNIT- III 15Hrs






flip-flops.

UNIT- IV 15Hrs








rd Edition, PHI.






Reference Books: 1. Switching & Finite Automata theory – ZviKohavi, 2

nd Edition TMH.



B.Tech - 3rd

Semester

SYLLABUS



L T P C

3 1 0 4















UNIT – I 16 Hrs

Mathematical Logic: Statements and notations, Connectives, Well-formed

formulas, Truth Tables, Tautology, Two-state Device and Statement logic, Equivalence implication, Normal

forms.


contradiction.








Groups, Sub group

UNIT-IV 16 Hrs Elementary Combinatorics: Basis of counting, Permutations & Combinations with repetitions,

Constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, the principles of Inclusion–

Exclusion, Pigeon hole principle and its application.




P.Manohar, TMH







3rd

Edition , TMH.


B.Tech - 3rd

Semester

SYLLABUS



L T P C

0 0 3 2









data structures







B.Tech - 3rd

Semester

SYLLABUS



L T P C

0 0 3 2








tables








B.Tech- 4th

Semester



L T P C

3 1 0 4



Modulation systems






















UNIT – I 16Hrs





Metallic Cable Transmission Media: Metallic Transmission Lines, Metallic Transmission Line Types,

Metallic Transmission Line Equivalent Circuit, Wave Propagation on Metallic Transmission Lines,Optical

Fiber Transmission Media:Optical Fiber Communications System Block Diagram, Optical Fiber Modes

Optical Fiber construction, Propagation of Light Through an Optical fiber Cable.

UNIT – II 15hrs








UNIT-III 15Hrs


Paging systems.



Cellular Telephone Systems: First- Generation Analog Cellular Telephone,

Second-Generation Cellular Telephone Systems, N-AMPS, Digital Cellular Telephone, Global system for

Mobile Communications, Personal Communications Satellite System.

UNIT-IV 14Hrs






Text Books : 1. Introduction to Data Communications and Networking, Wayne Tomasi, Pearson Education.


Edition, TMH.


nd Edition Thomson


Edition,

PearsonEducation.


B.Tech- 4th

Semester



L T P C

3 1 0 4



structure.


calculus













UNIT I 15Hrs




Database Design: Introduction to database design, ER Model, Additional features of ER Model, Conceptual

Design with the ER Model, Conceptual design for large enterprises.

UNIT II 15Hrs






UNIT III 15Hrs



Transactions: Transaction State, ACID properties of transaction, serial schedule, parallel schedule,conflicts

in concurrent Executions, Serializability, Recoverability, performance of locking, transaction support in

SQL.

UNIT IV 15Hrs









TEXT BOOKS :


Edition


Edition.

REFERENCES :


Edition.




B.Tech- 4th

Semester



L T P C

3 1 0 4



• Understand how java achieves platform independence using concept of bytecode.



development.







• Know the concepts of classes, objects, members of a class and the

relationships among them







UNIT- I 14Hrs















threads.




Event Handling: Events, Delegation event model, handling mouse and keyboard events, Adapter classes,

inner classes. Compare basic AWT components with swing components. More user interface components -

canvas, scrollbars, check box, choices, lists panels – scrollpane, dialogs, menubar, layout manager types.


th Edition, TMH.



Longman


th Edition, PHI







B.Tech- 4th

Semester



L T P C

3 1 0 4




















using Semaphores

Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock

Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock.









thEdition,

John Wiley




nd Edition, TMH



edition, PHI.


B.Tech- 4th

Semester



L T P C

3 1 0 4




languages.

• Understand tuple descriptions of Mealy and Moore finite-state machines, State diagrams, state tables and

their relationship.






• Acquire the idea to design, specify and test grammars and also

deterministic/nondeterministic pushdown automata that recognize context-free languages.











with ε transitions, Equivalence between NFA with and without ε transitions, NFA to DFA conversion,

minimization of FSM, equivalence between two FSM’s Finite Automata with output-Moore and Mealy

machines.

















REFERENCES:


2nd

Edition, PHI.



B.Tech- 4th

Semester



L T P C

0 0 3 2










block.







complex functions.





B.Tech- 4th

Semester



Course code:

L T P C

0 0 3 2









32. Write a Java program, to demonstrate tokenizing given string/text using StringTokenizer class


details.

34. Write a Java program to define and handle Exceptions in the implementation of

Program3.(also make use of throw, throws).







B.Tech- 5th

Semester

SYLLABUS

Course Title: Computer Networks Course Code: IT 3409

L T P C

3 1 0 4

Course Objectives:


• Understand basic network models and Different transmission used for data communication.

• Recognize the data link design issues and various data link protocols used for data transmission.

• Understand different routing algorithms used for data transmission from source to destination in a

network layer.

• Know how internet address are installed and how internet protocols are used in connecting internet.

Course Outcomes:


• Suggest appropriate network model for data communication.


• Propose appropriate routing algorithm for data routing.

• Connect internet to the system and knowledge of trouble shooting.

UNIT I: INTRODUCTION 11+4 Network Hardware, Network Software, and Reference Models: OSI, TCP/IP, The ARPANET, Network

Topologies, Physical Layer: Transmission media: Magnetic Media, Twisted pair, Base band Coaxial Cable,


Transmission.



layer: Channel allocation methods, Multiple Access protocols: ALOHA, CSMA, IEEE Standard 802.3 and

Ethernet, IEEE Standard 802.4: Token bus.












B. Tech- 5th

Semester

SYLLABUS

Course Title: Design and Analysis of Algorithms Course Code: IT 2406

L T P C

3 1 0 4

Course Objectives:





best solution.





Course Outcomes:










UNIT I:

(11+5)



omega.




UNIT II: (13+3)






UNIT III: (11+3)




UNIT IV: (11+3)


theorem.




press.





8. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.

9. Algorithms – Richard Johnson baugh and Marcus Schaefer, Pearson Education.


B.Tech- 5th

Semester

SYLLABUS


L T P C

3 1 0 4 Course

Objectives: The course content enables students to:










UNIT – I 13+4 HTML Common tags- List, Tables, images, forms, Frames, Links and Navigation, Image Maps




Validations.


Working with Variables and constants: Using variables, Using constants, Data

types, Operators.


forms.













Text Books: 9. Web Technolgies, Uttam Roy, OXFORD University press



An Introduction to Web Design + Programming, Paul S.Wang, India Edition


B.Tech- 5th

Semester

SYLLABUS

Course Title: Software Engineering Course Code: CSE3409

L T P C

3 1 0 4



• Learn about software myths ,generic view of the process and Understand about process models

• Learn how to perform feasibility study of the projects under the requirement engineering process and

system models.

• Understand about Function oriented design and Architectural styles

• Get the knowledge of software testing and testing strategies, learn about risk management plan and

quality concepts.

COURSE OUTCOME(S):


• Design and develop real-time software projects with effective cost estimation and plan

• Make feasibility study of a project

• Specify the design and architectural style of the software products

• Propose testing strategy for a given software

UNIT I: (12+4)






UNIT II: (11+4)

Software Requirements: Functional and non-functional requirements, User

requirements, System requirements, Interface specification, the software requirements document.




UNIT III: (11+4) Function Oriented Design: Structured analysis, DFD and its Extension, structured design detailed design.




Unit IV: (12+4)








TEXT BOOKS:



203-3819-7





B.Tech- 5th

Semester

SYLLABUS

Course Title: Microprocessors and Interfacing Course Code: ECE 3429

L T P C

3 1 0 4

Course objectives:


• Familiarize with the architecture of 8086 processor, assembling language programming and


• Learn to Interface various I/O peripherals like ADC, DAC, Keyboard, stepper motor etc., with


• do any type of industrial and real time applications by knowing the concepts of Microprocessors

• Understand 8251-USARTand serial communication concepts.

Course Outcomes:


• Understand the full internal workings of a typical simple CPU including the utilization of the various


• Introduce the design of basic I/O hardware and microprocessor interfacing: memory chip selection,


• Interface input and output devices like LCD, LED, Keyboards ADC, DAC and stepper motor to

microprocessors.

• Design the home appliances and toys using Microprocessor chips.

UNIT- I 8086 Architecture: (12 hours)

8086-Functional Diagram, Register Organization, Signal description, Physical

Memory Organization, Minimum and Maximum mode operations of 8086, Timing Diagrams.

UNIT- II Instruction Set of 8086: (16 hours) Addressing modes, Data Transfer Instructions, Arithmetic Instructions, Bit Manipulation Instructions,



UNIT- III Programmable devices and Interfacing of I/O with 8086: ( 16 hours)



UNIT-IV

8086 Interrupts and Serial Communication (16 hours) 8086 interrupts and Interrupt Vector Table (IVT), Programmable Interrupt Controller 8259A, Serial data



transfer.

Text Books:


edition 2007


Reference Books:


PHI second edition


B.Tech- 5th

Semester

SYLLABUS

Course Title: Advanced Databases Course Code: CSE3415

L T P C

3 1 0 4

Course Objectives


• Understand distributed architecture and distributed database design.

• Know advanced query processing and distributed query optimization techniques.

• Comprehend the transaction management along with parallel database systems.

• Grasp the object oriented data models database design.

Course outcomes:


• Design an architectural model for distributed database management system.

• Analyze Query processing and query optimization methods.

• Implement transaction management and database reliability for real world scenario.

• Use object-oriented distributed data model for data

UNIT-1 (11+4) Introduction; Distributed Data Processing, Distributed Database System, Promises of DDBSs, Problem areas.

Overview of Relational DBMS: Relational Database Concepts, Normalization, Integrity rules, Relational

data languages.


Architecture.












partitioning.

Parallel Database Systems: Database Series, Parallel Architecture, Parallel DBMS Techniques, Parallel


UNIT-IV (11+4) Distributed object Database Management Systems: Fundamental object concepts and Models, Object

Distributed Design, Architectural Issues, Object Management, Distributed Object storage, Object query

Processing.

Object Oriented Data Model : Inheritance, Object identity, persistent programming languages, persistence of


TEXT BOOKS: 1. M.Tamer OZSU and Patuck Valduriez: Principles of Distributed Database Systems,


2. Stefano Ceri and Willipse Pelagatti: Distributed Databases, McGraw Hill.




B.Tech- 5th

Semester

SYLLABUS

Course Title: Computer Graphics Course Code: CSE3412

L T P C

3 1 0 4

Course Objectives:


• Learn basic principles and problems of computer graphics.

• Know application areas of computer graphics, different display devices and their characteristics to

display an object.

• Understand background of the geometrical and mathematical foundations with algorithms for




• Understand 3D viewing, rendering, visible surface detection algorithms with animation

fundamentals.

Course Outcomes:


• Be familiarized with contemporary graphics hardware, the actual methodology and techniques to

draw computer graphics, animations etc. for the real world presentation and how it is

implemented in Computer graphics software

• Develop new kinds of graphics and animations.

• Design and develop graphics applications with the implementation of

advanced methods such as ray tracing, texture mapping, illumination and shading and be able to

build interactive user interface to manipulate objects in a 3D scene and also in the development of

Web pages.

• Demonstrate the ability to develop an animation movie.




algorithms), mid-point circle and ellipse algorithms.

Filled area primitives: Inside and outside tests,


UNIT – II (11+4) 2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations, matrix


systems.




UNIT-III (11+4) 3-D object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier




UNIT-IV (12+3) Visible surface detection methods: Classification, back-face detection, depth-buffer, scan-line, depth




Text Books: 1. Computer Graphics C version, Donald Hearn, M.Pauline Baker, Pearson





B.Tech- 5th

Semester

SYLLABUS

Course Title: Computer Networks Lab Course Code: IT 3211

L T P C

0 0 3 2



• Understand basic network models and Different transmission media used for data communication.

• Understand the data link design issues and various data link protocols used for data transmission.

• Comprehend different routing algorithms used for data transmission from source to destination in a

network layer.

• Know how internet addresses are configured and how internet protocols are used in connecting

internet.

COURSE OUTCOME(S):


• By learning models students suggest appropriate network model for data communication.


• Suggest appropriate routing algorithm for the network.

• Provide internet connection to the system and its installation.

Course Contents

1. a. Familiarization with Networking Components and devices: LAN

Adapters,






c) character stuffing b) bit Stuffing














B. Tech- 5th

Semester

SYLLABUS


L T P C

0 0 3 2














Experimen-3: 7) Student personal Info Page 8) Student Academic Info page 9)

Semester Wise Percentage & their Aggregate page



static web pages.


servers.














servlet by using the get In it Parameters() method.



database.






B. Tech- 6th

Semester

SYLLABUS

Course Title: Data Mining Course Code: CSE 3429

L T P C

3 1 0 4

Course Objectives:


• Understand fundamentals of data mining concepts.

• Understand the concept of association rule mining and generate association rules.

• Learn classification algorithms and classify the real data set.

• Analyze clustering methods and understand mining complex data types.

Course Outcomes:

At the end of the course students will be able to:

• Apply relevant preprocessing techniques on different data sets for mining.

• Implement Association rule mining concept and generate association rules.

• Apply classification/clustering techniques on different types of data and analyze patterns.

• Suggest appropriate data mining techniques to mine different types of data.

UNIT I: 11+4 Introduction: What is data mining, Motivating challenges, the origins of data mining, Data Mining Tasks.

Data: Types of data, Data quality, Data preprocessing, Measures of similarity and dissimilarity - Basics,

Similarity and Dissimilarity between Simple Attributes, Similarities and Dissimilarities between Data

objects, Examples of proximity measures, Issues in proximity Calculations, selection of the right proximity

Measure.

UNIT II: 12+4

Mining Association Rules in Large Databases - Association Rule Mining,

Mining Single-Dimensional Boolean Association Rules from Transactional Databases, Mining

Multilevel Association Rules from Transaction Databases, Mining Multidimensional Association Rules

from data sources, From Association Mining to Correlation Analysis, Constraint-Based Association

Mining.

UNIT III: 10+3 Classification - Preliminaries, General approach to solving a classification problem, Decision tree induction,

Rule-based classifier, Nearest-Neighbor classifiers, Bayesian classifiers, Artificial Neural Network.

UNIT IV: 12+4 Cluster Analysis - Overview, K-means, Agglomerative Hierarchical Clustering, DBSCAN, Prototype-based

clustering, Cluster Evaluation.

Mining Complex Types of Data - Multidimensional Analysis and Descriptive Mining of Complex,

Data Objects, Mining Spatial Databases, Mining Multimedia Databases, Mining Text Databases, Mining

the World Wide Web.

Text Books: 3. Introduction to Data Mining, Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Pearson Education.

4. Data Mining Concepts and Techniques, Jiawei Han & Micheline Kamber Harcourt India.

Reference Books: 2. Data Mining Introductory and advanced topics, Margaret H Dunham, Pearson Education.

2. Data Mining Techniques, Arun K Pujari, University Press.


B. Tech - 6th

Semester

SYLLABUS


L T P C

3 1 0 4




diagram.



Course outcomes:










Advanced Structural Modeling: Advanced classes, advanced relationships, Interfaces, Types and Roles,

Packages.









Education.


Pvt. Ltd.






B. Tech - 6th

Semester

SYLLABUS

Course Title: Language Processors Course Code: CSE3414

L T P C

3 1 0 4

COURSE OBJECTIVES:


• Learn various translators and phases of compiler.

• Learn context free grammars, top-down and bottom-up parsing.

• Learn symbol tables and intermediate code.

• Learn various code optimization and code generation techniques.

COURSE OUTCOMES

At the end of the course, students are able to:

• Deal with different translators and to acquire the knowledge of compiler and its Phases.

• Use of formal grammars for specifying the syntax and Semantics of programming languages

• Build symbol tables and generate intermediate code for a given program.

• Apply the code optimization techniques to improve the performance of a program in terms of speed

and space.

• Design a compiler for a concise programming language.

UNIT – I: [15] Overview of language processing , compiler, assembler , interpreters, linkers & loaders, structure of a

compiler, phases of a compiler, Lexical Analysis, Role of Lexical Analysis, Token, patterns and Lexemes,

Lexical Errors, Regular definitions for the language constructs, Transition diagram

for recognition of tokens, Reserved words and identifiers

UNIT-II [16]














edition, TMH, 2011.






B. Tech - 6th

Semester

SYLLABUS

Course Title: Digital Signal Processing Course Code: ECE 3421

L T P C

3 1 0 4


• Enhance the analytical ability of the students in facing the challenges posed by growing trends in

communication, control and signal processing areas.

• develop ability among students for problem formulation, system design and solving skills

• demonstrate basic knowledge of Digital Signal Processing by understanding various transformations

• Understand Various Discrete-time signals and class of Linear shift-invariant systems will be studied


• Design system with digital network composed of adders, delay elements, and coefficient

multipliers.


• Analyze the system in Time and Frequency domain through its respective tools.

• Demonstrate knowledge of complex number, Fourier series and ability to design electrical and


• Design the digital filter circuits for generating desired signal wave shapes (non sinusoidal) for


• Design the digital computer or digital hardware for quantizing amplitudes of signals.

• Design the various processing circuits that are necessary in the hardware or

interfacing blocks in systems used in radars, satellite etc

UNIT-I

Introduction to Discrete –Time signals and systems (15 hours) Classification of Discrete time signals & sequences, linear Time Invariant (LTI) systems, (BIBO) stability,




UNIT-II

Discrete –Time signals in Transform domain (15 hours) Discrete Fourier Series(DFS), Discrete Time Fourier transforms(DTFT), Discrete Fourier transform(DFT),



UNIT-III

IIR Digital Filters: (15 hours) Analog filter approximations – Butter worth and Chebyshev , Impulse Invariant transformation , Bilinear


UNIT-IV

FIR Digital Filters & Multi rate Signal Processing (15 hours) FIR Digital Filters: Characteristics of FIR Digital Filters, frequency response, Design of FIR Digital Filters

using Window Techniques, Comparison of IIR & FIR filters.


conversion.

Text Books:




G. Manolakis, Pearson Education / PHI, 2007.

Reference Books:





B. Tech - 6th

Semester

SYLLABUS

Course Title: INFORMATION SECURITY Course Code: CSE 3413

L T P C 3 1 0 4

Course bjectives: The course content enables students to :

Understand about various Conventional Encryption Principles designed for providing security.

• Learn public key cryptography, key management principles and Learn Pretty Good Privacy (PGP)

which is a computer program that provides cryptographic privacy and authentication. • Learn IP Security fundamentals, architecture and identifying the key features IP security system. • Understand about general requirements for Web security, which focus on standardized

schemes. Course Outcomes: At the end of the course students are able to:

• Analyze a given system with respect to security of the system. • Create an understanding of Authentication functions the manner in which Message

Authentication Codes and Hash Functions works. • Examine the issues and structure of Authentication Service and Electronic Mail Security

Understand conventional and public key cryptographic approaches used in message encryption.

• Able to identify various types of attacks and its effect over the networks.

UNIT – I: (12+3) Introduction: Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services (Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability), TCP session hijacking, UDP hijacking, ARP attacks, & Man-in-the-Middle Attacks. OSI Security Architecture - Classical Encryption techniques – Cipher Principles. Conventional Encryption Principles: Conventional encryption algorithms - Data Encryption Standard (DES), Blowfish, CAST-128, Block Cipher Design Principles and cipher block Modes of Operation, Evaluation criteria for AES Cipher.

UNIT-II: (11+4) Public Key Cryptography: Public key cryptography principles, public key cryptography algorithms, digital signatures. Digital Certificates, Certificate Authority and key management Authentication & Hash Function: Authentication requirements – Authentication functions – Message Authentication Codes – Hash Functions – Security of Hash Functions and MACs – MD5 message Digest algorithm - Secure Hash Algorithm –RIPEMD-HMAC Digital Signatures – Authentication Protocols – Digital Signature Standard.

UNIT-III 11+4 Network Security Authentication Applications: Kerberos – X.509 Authentication Service –

Electronic Mail Security – PGP – S/MIME

IP Security: IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating

Security Payload, Combining Security Associations and Key Management.

UNIT – IV: (11+4) Web Security: Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS), Secure Electronic Transaction (SET). System Level Security Intrusion detection – password management – Viruses and related Threats

– Virus Counter measures – Firewall Design Principles – Trusted Systems.

Text Books: 3. Network Security Essentials (Applications and Standards) by William Stallings Pearson Education. 4. Hack Proofing your network by Ryan Russell, Dan Kaminsky, Rain Forest Puppy, Joe Grand, David

Ahmad, Hal Flynn IdoDubrawsky, Steve W.Manzuik and Ryan Permeh, wileyDreamtech.

References: 1. AtulKahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003. 4. William Stallings, “Cryptography and Network Security – Principles and Practices”,

PrenticeHallofIndia,ThirdEdition,2003 5. Sfsdffs ff Charles B. Pfleeger, Shari LawrencePfleeger, “Security in Computing”, Third

Edition, Pearson Education, 2003.


B. Tech - 6th

Semester

SYLLABUS


L T P C

3 1 0 4

Course Objectives:






Course Outcomes:






UNIT – I 12+4

Mobile Communications - Overview: Wireless transmission, voice and data

communication standards – 1G/2G/3G/4G, WPAN, WLAN, applications, limitations, mobile computing

architecture, overview on mobile devices and systems




EDGE

UNIT – II 10+3 Mobile Network Layer: Mobile IP, IP packet delivery, agent advertisement and discovery, registration,



UNIT – III 12+4 Mobile Ad hoc Network (MANET): Introduction, Properties, applications, limitations, routing issues,




UNIT – IV 11+4




Text Books:



Reference Books:





B. Tech - 6th

Semester

SYLLABUS

Course Title: Real Time Operating System Course Code: CSE3430

L T P C

3 1 0 4

Course Objectives:


• Explain the concept of a real-time system and why these systems are usually implemented as

concurrent processes

• Describe a design process for real-time systems.

• Explain the role of a real-time operating system.

• Introduce generic process architectures for monitoring and control and data acquisition systems

Course Outcomes:


• Present the mathematical model of the system and to develop real time algorithm for task scheduling.

• Understand capabilities Handling Resource Sharing and dependencies among Real-time Tasks

• Generate a high-level analysis for Scheduling Real-time tasks in multiprocessor and distributed

systems

• Understand the working of real time operating systems and real time

database.

UNIT-I

REAL-TIME SYSTEMS 11+4 Introduction: What is real time, Applications of Real-Time systems, A basic model of Real-time system,

Characteristics of Real-time system, Safety and Reliability, Types of Real-time tasks, timing constraints,

Modeling timing constraints

Some important concepts, Types of Real-time tasks and their characteristics, Task scheduling, Clock-Driven

scheduling, Hybrid

schedulers, Event-Driven scheduling, Earliest Deadline First (EDF) scheduling.

UNIT-II 11+ 4 Rate monotonic algorithm (RMA). Some issues associated with RMA. Issues in using RMA practical

situations.

Handling Resource Sharing and dependencies among Real-time Tasks: Resource sharing among real-time

tasks. Priority inversion. Priority Inheritance Protocol (PIP), Highest Locker Protocol (HLP). Priority Ceiling

Protocol (PCP).Different types of priority inversions under PCP. Important features of PCP. Some issues in

using a resource sharing protocol. Handling task dependencies.

UNIT-III 11+ 4 Scheduling Real-time tasks in multiprocessor and distributed systems:

Multiprocessor task allocation, Dynamic allocation of tasks. Fault tolerant scheduling of tasks. Clock in

distributed Real-time systems, Centralized clock synchronization

Commercial Real-time operating systems: Time services, Features of a Real-time operating system, Unix as

a Real-time operating system, Unix-based Real-time operating systems, Windows as a Real-time operating

system, POSIX-RT, A survey of contemporary Real-time operating systems. Benchmarking real-time

systems.

UNIT-IV 11+ 4 Real-time Databases: Example applications of Real-time databases. Review of basic database concepts,

Real-time databases, Characteristics of temporal data.

Concurrency control in real-time databases. Commercial real-time databases. Real-time Communication:

Basic concepts, Examples of applications, Real-time communication in a LAN an d Real-time

communication over packet switched networks.

Text Book: 1. Real-time Systems Theory and Practice by Rajib Mall, Pearson Publication, 2008.

References Books: 1. Jane W. S. Liu, Real-Time Systems, Pearson Education, 2000.

2. C.M. Krishna and K.G. Shin, Real-Time Systems, TMH.


B. Tech - 6th

Semester

SYLLABUS

Course Title: SOFT COMPUTING Course Code: CSE 3416

L T P C

3 1 0 4

Course Objectives:


• Understand the soft computing techniques and their roles in building intelligent machines.

• Understand about fundamentals of neural networks and learning methods.

• Learn about Fuzzy logic, sets and relationships between them to understand the Fuzzy system.

• To know about fuzzy logic controlled genetic algorithms to practice the soft computing tools.

Course Outcomes:


• Identify and describe soft computing techniques and their roles in building intelligent machines.

• Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems

• Apply neural networks to pattern classification and regression problems.

• Evaluate and compare solutions by various soft computing approaches for a given problem.

UNIT I:

(10+3)




UNIT II: (12+3)




UNIT III: (14+5)




UNIT IV: (9+4)



TEXT BOOKS:



REFERENCE BOOKS:




N.Y, 1989.



B. Tech - 6th

Semester

SYLLABUS

Course Title: Language Processors Lab Course Code: CSE 3218

L T P C

0 0 3 2

Course Objectives


• Implement the actions performed by Lexical Analyzer without using Lex tool.

• Implement Lexical Analyzer using Lex tool.

• Implement Syntax Analyzer or parser using YACC Tool.

• Implement the top-down and bottom-up parsing.

Course Outcomes:


• Apply the knowledge of LEX tool to develop a scanner.

• Compute the first and follow of non-terminals of a grammar.

• Apply the knowledge of YACC tool to develop a parser.

• Design top-down and bottom-up parsers












B. Tech- 6th

Semester

SYLLABUS


L T P C

0 0 3 2


















2. Pascal Roques: Modeling Software Systems Using UML2, WILEY-Dreamtech India Pvt. Ltd.

3. AtulKahate: Object Oriented Analysis & Design, The McGraw-Hill Companies.

4. Mark Priestley: Practical Object-Oriented Design with UML,TATAMcGrawHill


Publications Pvt.Ltd , New Delhi.


B. Tech- 7th

Semester

SYLLABUS


L T P C

3 1 0 4

Course Objectives:

The course content enables students to





Course Outcomes: At the end of the course students are able to :





UNIT-1 11+3




Communication.








Recovery.

Distributed File Systems: Introduction to distributed file systems, Architecture, Process, communications,

consistency and replication, Sun network file system.






Text Books:

5. Distributes Systems Principles and paradigms,Second Edition-Andrew S.Tanenbaum,Maarten Van

Steen.


4th




B. Tech- 7th

Semester

SYLLABUS


L T P C

3 1 0 4

COURSE OBJECTIVES:







COURSE OUTCOMES:







UNIT – I 11+4 Introduction to client server computing: Evolution of corporate computing models from centralized to


Programming.


UNIT – II 11+4 Introducing C# and the .NET Platform; Understanding .NET Assemblies, Object –Oriented Programming



UNIT-III 12+3 Core CORBA / Java: Two types of Client/ Server invocations-static, dynamic. The static CORBA, first


Existential CORBA: CORBA initialization protocol, CORBA activation services,

CORBA IDL mapping CORBA java- to- IDL mapping.

UNIT-IV 11+4




Text Books:


SPD 2nd Edition


John wiley and sons

Reference Books:








B. Tech- 7th

Semester

SYLLABUS


L T P C

3 1 0 4

Course Objectives:





techniques.





management tools.

Course Outcomes:






standards.


UNIT-1






UNIT-2




Collecting Data, Visualizing Progress, Cost Monitoring, review techniques, project termination review,

Earned Value analysis, Change Control, Software Configuration Management (SCM), Managing Contracts,

Types Of Contracts, Stages In Contract Placement, Typical Terms of A Contract, Contract Management and

Acceptance.

UNIT-3







UNIT-4







Text Book

3. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth

Edition, Tata McGraw Hill, New Delhi, 2012.

Reference Books:




11. Samuel J mantel et.el “Project Management- Core Textbook”, First India Edition,

Wiley India



B. Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4

Course Objectives:



processing






Course Outcomes:








UNIT I 18 hours



sampling and quantization, basic relationships between pixels. An introduction to

mathematical tools in digital image processing



UNIT II 16 hours





UNIT III 12 hours




filtering.

UNIT IV 14 hours


Segmentation.




Text Book:


2011

Reference Books:



2009




House


B. Tech - 7th

Semester

SYLLABUS

Course Title: Wireless Ad Hoc Networks Course Code: CSE4431

L T P C

3 1 0 4


• Understand the architecture of Wireless Ad Hoc Network


• Understand issues and challenges in Providing QoS in Ad Hoc Wireless Networks



• Analyze MAC protocols for Ad Hoc Wireless Networks

• Analyze Routing protocols for Ad Hoc Wireless Networks

• Understand the need for Energy Management in Ad Hoc Wireless Networks

• Understand the issues and challenges in Wireless Network security

UNIT-I:

(11+4) Wireless Ad Hoc Networks: Introduction, Properties, applications, limitations, Issues in Ad Hoc Wireless

Networks, Ad Hoc Wireless Internet.

MAC Protocols: Introduction, Issues in Designing a MAC protocol for Ad Hoc Wireless Networks, Design

goals of a MAC Protocol for Ad Hoc Wireless Networks, Classifications of MAC Protocols, Contention -

Based Protocols, Contention - Based Protocols with reservation Mechanisms, Contention – Based MAC

Protocols with Scheduling Mechanisms

UNIT -III: (12+4) Routing Protocols: Introduction, Issues in Designing a Routing Protocol for Ad Hoc Wireless

Networks, Classification of Routing Protocols, Proactive/ Table–Driven Routing Protocols, Reactive/ On–

Demand Routing Protocols, Hybrid Routing Protocols, Hierarchical Routing Protocols, Power – Aware

Routing Protocols.

Transport Layer: 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, Other Transport

Layer Protocol for Ad Hoc Wireless Networks,

UNIT –III: (11+3) Quality of Service: Introduction, Issues and Challenges in Providing QoS in Ad Hoc Wireless

Networks, Classification of QoS Solutions, MAC Layer Solutions, Network Layer Solutions, QoS

Frameworks for Ad Hoc Wireless Networks.

Energy Management: Introduction, Need for Energy Management in Ad Hoc Wireless Networks,

Classification of Ad Hoc Wireless Networks, Battery Management Schemes, Transmission Power

Management Schemes, System Power Management Schemes.

UNIT – IV: (11+4) Security Protocols: Network Security Requirements, Issues and Challenges in Security Provisioning,

Network Security Attacks, Key Management, Secure Routing in Ad Hoc Wireless Networks.

Wireless Sensor Networks: Introduction, Sensor Network Architecture, Data Dissemination, Data

Gathering, Location Discovery, Quality of a Sensor Network, Evolving Standards, Other Issues.

TEXT BOOKS: 3. Ad Hoc Wireless Networks: Architectures and Protocols - C. Siva Ram Murthy and

B.S.Manoj, 2004, PHI.

4. Wireless Ad- hoc and Sensor Networks: Protocols, Performance and Control - Jagannathan

Sarangapani, CRC Press

REFERENCE BOOKS: 3. Wireless Sensor Networks - C. S. Raghavendra, Krishna M. Sivalingam, 2004, Springer

4. Ad- Hoc Mobile Wireless Networks: Protocols & Systems, C.K. Toh ,First ed. Pearson Education


B.Tech- 7th

Semester

SYLLABUS


L T P C

3 1 0 4

COURSE OBJECTIVES:







COURSE OUTCOMES:






UNIT I 10 +3





UNIT II 11 +4





UNIT-III 11 + 4




UNIT IV 13+4





Press online.







B. Tech- 7th

or 8th

Semester

SYLLABUS

Course Title: Data Mining Lab. Course Code: CSE4232

L T P C

0 0 3 2



• Conceptualize the data mining problem

• Perform Preprocess data

• analyze and visualize the data with data mining techniques

• Perform predictive modeling

• Generate association rules for business data

COURSE OUTCOME(S):


• Implement the algorithms to solve data mining problem using WEKA tool

• Identify an appropriate method to apply in a given situation

• Communicate results in terms relevant to science, business etc.

• Apply different clustering techniques to characterize subgroups.

Course Contents Implement the following by using WEKA/ Clementine

15. Introduction to Graphical User Interface (GUI) of WEKA

16. Perform Data Pre-processing on sample data set

17. Introduction to IBM SPSS Modeler and nodes palette

18. Preparing the data for analysis using data audit node.

19. Automated data preparation using data audited node.

20. Perform Association Analysis to derive the association rules.

21. Implement the Classification using Decision Tree Induction.

22. Classification using Regression.

23. Bayesian Classification.

24. Classifying telecommunications churn by using Binomial Regression.

25. Market basket analysis using rule induction/C5.0.

26. Predicting Loan defaulters using Bayesian Networks.

27. K-means clustering.

28. Hierarchical clustering.


B. Tech- 7th

or 8th

Semester

SYLLABUS

Course Title: Design and Analysis of Algorithms Lab. Course Code: CSE4233

L T P C

0 0 3 2

Course Objectives:





best solution.





Course Outcomes:










4. Implement Fibonacci Search to search a given key.

5. Sort a given set of elements using the Quick sort method and determine the time required to sort the

elements. Repeat the experiment for different values of n, the number of elements in the list to be

sorted and plot a graph of the time taken versus n.

Also use same set of data to sort using merge sort and compare with quick sort.

6. A) From a given vertex in a weighted connected graph, find shortest paths to other vertices using

Dijikstra’s algorithm.

B) Compute the transitive closure of a given directed graph using Warshall's algorithm.

4. Implement 0/1 Knapsack problem using Dynamic Programming.

5. Find a subset of a given set S = {sl, s2... sn} of n positive integers whose sum is equal to a given

positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions {1, 2, 6} and

{1, 8}. A suitable message is to be displayed of a problem instance with all possible solution.

6. Implement any scheme to find the optimal solution for the Traveling Salesperson problem and then

solve the same problem.

7. A) Implement non-deterministic method to sort a given set of numbers.

B) Implement 0/1 Knapsack problem using non-deterministic method.

8. A) Implement the Chinese remainder theorem

B) Implement Modular Exponentiation Algorithm to compute ab mod n where a, b, and n are

positive integers


B.Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4















UNIT-I:




Even Analysis.

UNIT-II:





UNIT-III:




UNIT-IV:





Delhi, 2012.







2009.




B. Tech- 7th

or 8th

Semester

SYLLABUS


L T P C

3 1 0 4

COURSE OBJECTIVES:






COURSE OUTCOMES:



software project.









Management plan.




Modules to objects -Cohesion and Coupling, Data Encapsulation and Information hiding aspects of objects.



Unit III: 13+4 Requirement phase - Rapid Prototyping method, Specification phase , Specification Document, Formal

methods of developing specification document, Examples of other semi - formal methods of using Finite-



Unit IV: 10+4 Design phase -Data oriented design, Object Oriented design, Formal techniques for detailed design.




REFERENCEBOOKS: 4. Component-based softwareengineering:7thinternational symposium, CBSE 2004, IvicaCrnkovic,

Springer


B. Tech - 8th

Semester

SYLLABUS

Course Title: BIOINFORMATICS Course Code: CSE4425

L T P C

3 1 0 4

COURSE OBJECTIVES:


• Understand the theoretical basis behind bioinformatics.

• Search databases accessible on the WWW for literature relating to molecular biology and

biotechnology.

Retrieve protein structures from databases.

• Find homologues, analyze sequences, construct and interpret evolutionary trees.

• Understand homology modelling

COURSE OUTCOMES:


• Extract information from different types of bioinformatics data (gene, protein, disease, etc.),

including their biological characteristics and relationships

• Analyze processed data with the support of analytical and visualization tools

• Carry out bioinformatics research under advisement, including systems biology, structural

bioinformatics and proteomics

• Manipulate DNA and protein sequences using stand-alone PC programs and programs available on

the WWW

UNIT –I 10+3

Introduction:

Definitions, Sequencing, Biological sequence/structure, Genome Projects, Pattern recognition an prediction,

Folding problem, Sequence Analysis, Homology and Analogy.

Protein Information Resources:

Biological databases, Primary sequence databases, Protein Sequence databases, Secondary databases, Protein

pattern databases, and Structure classification databases.

Unit-II 11+4

Genome Information Resources:

DNA sequence databases, specialized genomic resources

DNA Sequence analysis:

Importance of DNA analysis, Gene structure and DNA sequences, Features of

DNA sequence analysis, EST (Expressed Sequence Tag) searches, Gene hunting, Profile of a cell, EST

analysis, Effects of EST data on DNA databases

Unit-III 12+4

Pair wise alignment techniques:

Database searching, Alphabets and complexity, Algorithm and programs, Comparing two sequences, sub-

sequences, Identity and similarity, The Dotplot, Local and global similarity, different alignment techniques,

Dynamic Programming, Pair wise database searching.

Multiple sequence alignment :

Definition and Goal, The consensus, computational complexity, Manual methods,

Simultaneous methods, Progressive methods, Databases of Multiple alignments and searching

Unit-IV 12+4

Secondary database searching:

Importance and need of secondary database searches, secondary database structure and building a sequence

search protocol

Analysis packages:

Analysis package structure, commercial databases, commercial software, comprehensive packages, packages

specializing in DNA analysis, Intranet Packages, Internet Packages.

Text Books:

1. Introduction to Bioinformatics, by T K Attwood & D J Parry-Smith Addison Wesley Longman

2. Bioinformatics- A Beginner’s Guide by Jean-Michel Claveriw, CerdricNotredame, WILEY dreamlech

India Pvt. Ltd

Reference Books:

1. Introduction to Bioinformatics by M.Lesk OXFORD publishers (Indian Edition)


B.Tech- 8th Semester

SYLLABUS

Course Title: E – Commerce Course Code: CSE4426

L T P C

3 1 0 4

COURSE OBJECTIVES:


• Acquaint with fundamental terms and concepts of e-commerce.

• Compare and contrast the types of business models and e-commerce models

• Analyze important strategic planning factors when implementing e-commerce initiatives.

• Recommend appropriate technical resources for e-commerce projects.

COURSE OUTCOMES:


• Examine some typical distributed applications.

• Detail some of the problems that are encountered when developing distributed applications.

• Understand some of the technologies that are used to support distributed applications.

• Illustrate some of the business models used in the internet.

UNIT - I 11+3 Electronic Commerce-Frame work, anatomy of E-Commerce applications, E-Commerce

Consumer applications, E-Commerce organization applications. Consumer Oriented Electronic commerce -

Mercantile Process models.

UNIT - II 11+4 Electronic payment systems - Digital Token-Based, Smart Cards, Credit Cards, Risks in

Electronic Payment systems. Inter Organizational Commerce - EDI, EDI Implementation, Value added

networks

UNIT - III 12+4 Intra Organizational Commerce - work Flow, Automation Customization and internal

Commerce, Supply chain Management

Corporate Digital Library - Document Library, digital Document types, corporate Data Warehouses.

Advertising and Marketing - Information based marketing, Advertising on Internet, on-line marketing

process, market research.

UNIT-IV 11+4

Consumer Search and Resource Discovery - Information search and Retrieval,

Commerce

Catalogues, Information Filtering

Multimedia - key multimedia concepts, Digital Video and electronic Commerce, Desktop video processing,

Desktop video conferencing.

TEXT BOOK: 1. Frontiers of electronic commerce – Kalakata, Whinston, Pearson.

REFERENCES: 1. E-Commerce fundamentals and applications Hendry Chan, Raymond Lee, Tharam Dillon,

Ellizabeth Chang, John Wiley.

2. E-Commerce, S.Jaiswal – Galgotia.


B. Tech- 8th

Semester

SYLLABUS

Course Title: Pattern Recognition Course Code: CSE4428

L T P C

3 1 0 4


• Understand the possibilities and limitations of pattern recognition

• Apply decision functions suitable for given problem

• Validate different clustering algorithms

• Learn Bayesian approach to pattern recognition

• Analyze various dimensionality reduction techniques


• Implement decision functions

• Analyze tradeoffs involved in various classification techniques

• Apply various dimensionality reduction methods whether through feature selection or feature

extraction

• Develop model for solving problems in more specialized areas such as speech

• Recognition, optical character recognition etc.,

UNIT – I 11+4 hrs

Introduction: Fundamental problems in pattern recognition system design, Design concepts and methodologies, Simple

pattern recognition model.

Decisions and Distance Functions: Linear and generalized decision functions, Pattern space and weight space, Geometrical properties,

implementations of decision functions, Minimum-distance pattern classifications.

UNIT – II 15+5 hrs

Statistical Pattern Recognition:

Bayes Decision Theory, Minimum Error and Minimum Risk Classifiers, Discriminate Function and Decision

Boundary ,Normal Density ,Discriminate Function for Discrete Features

Non Parametric Decision Making:

Histogram, kernel and window estimation, nearest neighbor classification

techniques. Minimum squared error discriminant functions, choosing a decision making techniques.

UNIT-III 9+3hrs

Hierarchical Clustering:

Introduction, agglomerative clustering algorithm, the single-linkage, complete-linkage and average-linkage

algorithm. Ward’s method Partition clustering-Forg’s algorithm, K-means’s algorithm, Isodata algorithm.

UNIT-IV 10+3 hrs

DimensionalityProblem:

Dimension and Accuracy, Computational complexity, Dimensionality Reduction, Fisher Linear and Multiple

discriminant Analysis.

Application of pattern recognition techniques in bio-metric, facial recognition, IRIS, Finger prints, etc.,

Text Books:

3. Pattern recognition and Image Analysis, Gose. Johnsonbaugh Jost, PHI.

4. Pattern Recognition Principle, Tou. Rafael. Gonzalez, Pea.

Reference Books:

3. Bishop, C. M. Pattern Recognition and Machine Learning. Springer. 2007

4. Pattern Classification, Richard duda, Hart., David Strok, Wiley.

Documents

B.Tech. 1 st Semester Code Name of the Subject Lecture Tutorial Practical Credits · 2015-01-03 · a) Write a C program to find the sum of individual digits of a positive integer