JN

TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
JN
TU
W
or
ld
 w. e. f. AY 2016-17

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B.Tech I Year COURSE STRUCTURE (2016-17)

(Common for EEE, ECE, CSE, EIE, BME, IT, ETE, ECM, ICE)

I YEAR II SEMESTER

Course
S. No Course Title L T P Credits
Code
1 PH201BS Engineering Physics-II 3 0 0 3
2 MA202BS Mathematics-II 4 1 0 4
3 MA203BS Mathematics-III 4 1 0 4
4 CS204ES Computer Programming in C 3 0 0 3
5 ME205ES Engineering Graphics 2 0 4 4
6 CH206BS Engineering Chemistry Lab 0 0 3 2
7 PH207BS Engineering Physics Lab 0 0 3 2
8 CS208ES Computer Programming in C Lab 0 0 3 2
9 *EA209MC NCC/NSO 0 0 0 0
Total Credits 16 2 13 24

*Mandatory Course.
 PH201BS: ENGINEERING PHYSICS - II

B.Tech. I Year II Sem. L T/P/D C

3 0/0/0 3
Course Objectives:
 To understand the behavior of a particle quantum mechanically.
 To be able to distinguish pure and impure semi conductors and understand formation
of P-N Junction.
 To understand various magnetic and dielectric properties of materials.
 To study super conductor behavior of materials.

Course Outcomes: After completion of this course the student is able to

 Realize the importance of behavior of a particle quantum mechanically.
 Learn concentration estimation of charge carriers in semi conductors.
 Learn various magnetic dielectric properties and apply them in engineering applications.
 Know the basic principles and applications of super conductors.

UNIT - I
Principles of Quantum Mechanics: Waves and particles, de-Broglie hypothesis, matter waves,
Davisson and Germer experiment, Heisenberg uncertainty principle, Schrodinger time
independent wave equation, physical significance of wave function, particle in 1-D potential
box, electron in periodic potential, Kronig-Penny model (qualitative treatment), E-K curve,
origin of energy band formation in solids.

UNIT - II
Semiconductor Physics: Fermi level in intrinsic and extrinsic semiconductors, calculation of
carrier concentration in intrinsic & extrinsic semiconductors, direct and indirect band gap
semiconductors, formation of PN junction, open circuit PN junction, energy diagram of PN
junction diode, solar cell: I-V characteristics and applications.

UNIT - III
Dielectric Properties: Electric dipole, dipole moment, dielectric constant, polarizability,
electric susceptibility, displacement vector, electronic, ionic and orientation polarizations and
calculation of their polarizabilitites, internal field, Clausius-Mossotti relation, Piezoelectricity,
pyroelectricity and ferroelectricity-BaTiO3 structure.

UNIT - IV
Magnetic Properties & Superconductivity: Permeability, field intensity, magnetic field
induction, magnetization, magnetic susceptibility, origin of magnetic moment, Bohr magneton,
classification of dia, para and ferro magnetic materials on the basis of magnetic moment,
hysteresis curve based on domain theory, soft and hard magnetic materials, properties of anti-
ferro and ferri magnetic materials,
Superconductivity: Superconductivity phenomenon, Meissner effect, applications of
superconductivity.
UNIT - V
Introduction to nanoscience: Origin of nanoscience, nanoscale, surface to volume ratio,
quantum confinement, dominance of electromagnetic forces, random molecular motion, bottom-
up fabrication: Sol-gel, CVD and PVD techniques, top-down fabrication: ball mill method,
characterization by XRD, SEM and TEM.

Text Books:
1. Solid State Physics, A. J. Dekkar, Macmillan publishers Ind. Ltd.,
2. Solid State Physics, Chales Kittel, Wiley student edition.
3. Fundamentals of Physics, Alan Giambattisa, BM Richardson and Robert C Richardson,
Tata McGraw hill Publishers.

Reference Books:
1. Modern Engineering Physics, K. Vijaya Kumar, S. Chandralingam S. Chand & Co. Pvt.
Ltd.,
2. University Physics, Francis W. Sears, Hugh D. Young, Marle Zeemansky and Roger A
Freedman, Pearson Education.
3. Fundamentals of Acoustics, Kinster and Frey, John Wiley and Sons.
4. Introduction to Quantum Mechanics Leonard I. Schiff McGraw-Hill
 MA102BS/MA202BS: MATHEMATICS - II
(Advanced Calculus)

B.Tech. I Year II Sem. L T/P/D C

4 1/0/0 4

Prerequisites: Foundation course (No prerequisites).

Course Objectives: To learn

 concepts & properties of Laplace Transforms
 solving differential equations using Laplace transform techniques
 evaluation of integrals using Beta and Gamma Functions
 evaluation of multiple integrals and applying them to compute the volume and areas
of regions
 the physical quantities involved in engineering field related to the vector valued
functions.
 the basic properties of vector valued functions and their applications to line, surface
and volume integrals.

Course Outcomes: After learning the contents of this course the student must be able to
 use Laplace transform techniques for solving DE’s
 evaluate integrals using Beta and Gamma functions
 evaluate the multiple integrals and can apply these concepts to find areas, volumes,
moment of inertia etc of regions on a plane or in space
 evaluate the line, surface and volume integrals and converting them from one to
another

UNIT – I
Laplace Transforms: Laplace transforms of standard functions, Shifting theorems,
derivatives and integrals, properties- Unit step function, Dirac’s delta function, Periodic
function, Inverse Laplace transforms, Convolution theorem (without proof).
Applications: Solving ordinary differential equations (initial value problems) using Laplace
transforms.

UNIT - II
Beta and Gamma Functions: Beta and Gamma functions, properties, relation between Beta
and Gamma functions, evaluation of integrals using Beta and Gamma functions.
Applications: Evaluation of integrals.

UNIT – III
Multiple Integrals: Double and triple integrals, Change of variables, Change of order of
integration. Applications: Finding areas, volumes & Center of gravity (evaluation using Beta
and Gamma functions).

UNIT – IV
Vector Differentiation: Scalar and vector point functions, Gradient, Divergence, Curl and
their physical and geometrical interpretation, Laplacian operator, Vector identities.
UNIT – V
Vector Integration: Line Integral, Work done, Potential function, area, surface and volume
integrals, Vector integral theorems: Greens, Stokes and Gauss divergence theorems (without
proof) and related problems.

Text Books:
1. Advanced Engineering Mathematics by R K Jain & S R K Iyengar, Narosa Publishers
2. Engineering Mathematics by Srimanthapal and Subodh C. Bhunia, Oxford Publishers

References:
1. Advanced Engineering Mathematics by Peter V. O. Neil, Cengage Learning
Publishers.
2. Advanced Engineering Mathematics by Lawrence Turyn, CRC Press
 MA203BS: Mathematics - III
(Statistical and Numerical Methods)

B.Tech. I Year II Sem. L T/P/D C

4 1/0/0 4
Prerequisites: Foundation course (No prerequisites).

Course Objectives: To learn

 random variables that describe randomness or an uncertainty in certain realistic
situation
 binomial geometric and normal distributions
 sampling distribution of mean, variance, point estimation and interval estimation
 the testing of hypothesis and ANOVA
 the topics those deals with methods to find roots of an equation
 to fit a desired curve by the method of least squares for the given data
 solving ordinary differential equations using numerical techniques

Course Outcomes: After learning the contents of this course the student must be able to
 differentiate among random variables involved in the probability models which are
useful for all branches of engineering
 calculate mean, proportions and variances of sampling distributions and to make
important decisions s for few samples which are taken from a large data
 solve the tests of ANOVA for classified data
 find the root of a given equation and solution of a system of equations
 fit a curve for a given data
 find the numerical solutions for a given first order initial value problem

UNIT – I
Random variables and Distributions:
Introduction, Random variables, Discrete random variable, Continuous random variable,
Probability distribution function, Probability density function, Expectation, Moment
generating function, Moments and properties. Discrete distributions: Binomial and geometric
distributions. Continuous distribution: Normal distributions.

UNIT – II
Sampling Theory: Introduction, Population and samples, Sampling distribution of means ( 
Known)-Central limit theorem, t-distribution, Sampling distribution of means (  unknown)-
Sampling distribution of variances –  2 and F- distributions, Point estimation, Maximum
error of estimate, Interval estimation.

UNIT – III
Tests of Hypothesis: Introduction, Hypothesis, Null and Alternative Hypothesis, Type I and
Type II errors, Level of significance, One tail and two-tail tests, Tests concerning one mean
and proportion, two means-proportions and their differences-ANOVA for one-way classified
data.
UNIT – IV
Algebraic and Transcendental Equations & Curve Fitting: Introduction, Bisection
Method, Method of False position, Iteration methods: fixed point iteration and Newton
Raphson methods. Solving linear system of equations by Gauss-Jacobi and Gauss-Seidal
Methods.
Curve Fitting: Fitting a linear, second degree, exponential, power curve by method of least
squares.

UNIT – V
Numerical Integration and solution of Ordinary Differential equations: Trapezoidal rule-
Simpson’s 1/3rd and 3/8th rule- Solution of ordinary differential equations by Taylor’s series,
Picard’s method of successive approximations, Euler’s method, Runge-Kutta method (second
and fourth order)

Text Books:
1. Probability and Statistics for Engineers by Richard Arnold Johnson, Irwin Miller and
John E. Freund, New Delhi, Prentice Hall.
2. Probability and Statistics for Engineers and Sciences by Jay L. Devore, Cengage
Learning.
3. Numerical Methods for Scientific and Engineering Computation by M. K. Jain, S. R.
K. Iyengar and R. K. Jain, New Age International Publishers

References:
1. Fundamentals of Mathematical Statistics by S. C. Guptha & V. K. Kapoor, S. Chand.
2. Introductory Methods of Numerical Analysis by S. S. Sastry, PHI Learning Pvt. Ltd.
3. Mathematics for engineers and scientists by Alan Jeffrey, 6th edition, CRC press.
 CS104ES/CS204ES: COMPUTER PROGRAMMING IN C

B.Tech. I Year II Sem. L T/P/D C

3 0/0/0 3

Course Objectives:
 To learn the fundamentals of computers.
 To understand the various steps in Program development.
 To learn the syntax and semantics of C Programming Language.
 To learn how to write modular and readable C Programs.
 To learn to write programs using structured programming approach in C to solve
problems.

Course Outcomes:
 Demonstrate the basic knowledge of computer hardware and software.
 Ability to write algorithms for solving problems.
 Ability to draw flowcharts for solving problems.
 Ability to code a given logic in C programming language.
 Gain knowledge in using C language for solving problems.

UNIT - I
Introduction to Computers – Computer Systems, Computing Environments, Computer
Languages, Creating and running programs, Program Development, algorithms and flowcharts ,
Number systems-Binary, Decimal, Hexadecimal and Conversions, storing integers and real
numbers.
Introduction to C Language – Background, C Programs, Identifiers, Types, Variables,
Constants, Input / Output, Operators(Arithmetic, relational, logical, bitwise etc.), Expressions,
Precedence and Associativity, Expression Evaluation, Type conversions, Statements- Selection
Statements(making decisions) – if and switch statements, Repetition statements ( loops)-while,
for, do-while statements, Loop examples, other statements related to looping – break, continue,
goto, Simple C Program examples.

UNIT - II
Functions-Designing Structured Programs, Functions, user defined functions, inter function
communication, Standard functions, Scope, Storage classes-auto, register, static, extern, scope
rules, type qualifiers, recursion- recursive functions, Limitations of recursion, example C
programs.
Arrays – Concepts, using arrays in C, inter function communication, array applications- linear
search, binary search and bubble sort, two – dimensional arrays, multidimensional arrays, C
program examples.

UNIT - III
Pointers – Introduction (Basic Concepts), Pointers for inter function communication, pointers to
pointers, compatibility, Pointer Applications-Arrays and Pointers, Pointer Arithmetic and
arrays, Passing an array to a function, memory allocation functions, array of pointers,
programming applications, pointers to void, pointers to functions.
Strings – Concepts, C Strings, String Input / Output functions, arrays of strings, string
manipulation functions, string / data conversion, C program examples.

UNIT - IV
Enumerated, Structure and Union Types – The Type Definition (typedef), Enumerated types,
Structures –Declaration, initialization, accessing structures, operations on structures, Complex
structures-Nested structures, structures containing arrays, structures containing pointers, arrays
of structures, structures and functions, Passing structures through pointers, self referential
structures, unions, bit fields, C programming examples, command–line arguments,
Preprocessor commands.

UNIT – V
Input and Output – Concept of a file, streams, text files and binary files, Differences between
text and binary files, State of a file, Opening and Closing files, file input / output functions
(standard library input / output functions for files), file status functions (error handling),
Positioning functions (fseek ,rewind and ftell), C program examples.

Text Books:
1. Computer Science: A Structured Programming Approach Using C, B. A. Forouzan and
R. F. Gilberg, Third Edition, Cengage Learning.
2. Programming in C. P. Dey and M Ghosh , Second Edition, Oxford University Press.

Reference Books:
1. The C Programming Language, B.W. Kernighan and Dennis M. Ritchie, Second
Edition, Pearson education.
2. Programming with C, B. Gottfried, 3rd edition, Schaum’s outlines, McGraw Hill
Education (India) Pvt Ltd.
3. C From Theory to Practice, G S. Tselikis and N D. Tselikas, CRC Press.
4. Basic computation and Programming with C, Subrata Saha and S. Mukherjee,
Cambridge University Press.
 ME106ES/ME205ES: ENGINEERING GRAPHICS

B.Tech. I Year II Sem. L T/P/D C

2 0/0/4 4
Pre-requisites: None

Course objectives:
 To provide basic concepts in engineering drawing.
 To impart knowledge about standard principles of orthographic projection of objects.
 To draw sectional views and pictorial views of solids.

Course Outcomes:
 Ability to prepare working drawings to communicate the ideas and information.
 Ability to read, understand and interpret engineering drawings.

UNIT – I
Introduction To Engineering Drawing: Principles of Engineering Graphics and their
Significance, Conic Sections including the Rectangular Hyperbola – General method only.
Cycloid, Epicycloid and Hypocycloid Involute. Scales – Plain, Diagonal, and Vernier Scales.

UNIT - II
Orthographic Projections: Principles of Orthographic Projections – Conventions –
Projections of Points and Lines Projections of Plane regular geometric figures.—Auxiliary
Planes.

UNIT – III
Projections of Regular Solids – Auxiliary Views.

UNIT – IV
Sections or Sectional views of Right Regular Solids – Prism, Cylinder, Pyramid, Cone –
Auxiliary views – Sections of Sphere. Development of Surfaces of Right Regular Solids –
Prism, Cylinder, Pyramid, and Cone

UNIT – V
Isometric Projections: Principles of Isometric Projection – Isometric Scale – Isometric Views
– Conventions – Isometric Views of Lines, Plane Figures, Simple and Compound Solids –
Isometric Projection of objects having non- isometric lines. Isometric Projection of Spherical
Parts. Conversion of Isometric Views to Orthographic Views and Vice-versa – Conventions
Auto CAD: Basic principles only.

Text Books:
1. Engineering Drawing / Basant Agrawal and Mc Agrawal/ Mc Graw Hill
2. Engineering Drawing/ M.B. Shah, B.C. Rane / Pearson.
Reference Books:
1. Engineering Drawing / N.S. Parthasarathy and Vela Murali/ Oxford
2. Engineering Drawing N.D. Bhatt / Charotar
 CH206BS: ENGINEERING CHEMISTRY LAB

B.Tech. I Year II Sem. L T/P/D C

0 0/3/0 2

LIST OF EXPERIMENTS

Volumetric Analysis:
1. Estimation of Ferrous ion by Dichrometry.
2. Estimation of hardness of water by Complexometric method using EDTA.
3. Estimation of Ferrous and Ferric ions in a given mixture by Dichrometry.
4. Estimation Ferrous ion by Permanganometry.
5. Estimation of copper by Iodomery.
6. Estimation of percentage of purity of MnO2 in pyrolusite
7. Determination of percentage of available chlorine in bleaching powder.
8. Determination of salt concentration by ion- exchange resin.

Instrumental methods of Analysis:

1. Estimation of HCl by Conductometry.
2. Estimation of Ferrous ion by Potentiometry.
3. Determination of Ferrous iron in cement by Colorimetric method.
4. Determination of viscosity of an oil by Redwood / Oswald’s Viscometer.
5. Estimation of manganese in KMnO4 by Colorimetric method.
6. Estimation o f HCl and Acetic acid in a given mixture by Conductometry.
7. Estimation of HCl by Potentiometry.

Preparation of Polymers:
1. Preparation of Bakelite and urea formaldehyde resin.

Note: All the above experiments must be performed.

Text Books:
1. Vogel’s Text Book of Quantitative Chemical Analysis, 5th Edition (2015)
2. G. H. Jeffery, J. Bassett, J. Mendham and R. C. Denney.
3. A Text Book on experiments and calculations in Engineering Chemistry by S.S. Dara S.
Chand & Company Ltd., Delhi (2003).
 PH107BS/PH207BS: ENGINEERING PHYSICS LAB

B.Tech. I Year II Sem. L T/P/D C

0 0/3/0 2

LIST OF EXPERIMENTS

1. Dispersive power of the material of a prism – Spectrometer.

2. Determination of wavelengths of white source – Diffraction grating.
3. Newton’s Rings – Radius of curvature of Plano convex lens.
4. Melde’s experiment – Transverse and longitudinal modes.
5. Charging, discharging and time constant of an R-C circuit.
6. L-C-R circuit – Resonance & Q-factor.
7. Magnetic field along the axis of current carrying coil – Stewart and Gees method and to
verify Biot – Savart’s law.
8. Study the characteristics of LED and LASER diode.
9. Bending losses of fibres & Evaluation of numerical aperture of a given fibre.
10. Energy gap of a material of p-n junction.
11. Torsional pendulum – Rigidity modulus.
12. Wavelength of light, resolving power and dispersive power of a diffraction grating using
laser.
13. V-I characteristics of a solar cell.

Note: Minimum 10 experiments must be performed.

 CS108ES/CS208ES: COMPUTER PROGRAMMING IN C LAB

B.Tech. I Year II Sem. L T/P/D C

0 0/3/0 2

Course Objective:
 To write programs in C using structured programming approach to solve the problems.

Course Outcomes:
 Ability to design and test programs to solve mathematical and scientific problems.
 Ability to write structured programs using control structures and functions.

Recommended Systems/Software Requirements:

 Intel based desktop PC
 GNU C Compiler

1. a) Write a C program to find the factorial of a positive integer.

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

2. a) Write a C program to determine if the given number is a prime number or not.

b) A Fibonacci sequence is defined as follows: the first and second terms in the sequence
are 0 and 1. Subsequent terms are found by adding the preceding two terms in the
sequence. Write a C program to generate the first n terms of the sequence.

3. a) Write a C program to construct a pyramid of numbers.

b) Write a C program to calculate the following Sum:
Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10!

4. a) The least common multiple (LCM) of two positive integers a and b is the smallest
integer that is evenly divisible by both a and b. Write a C program that reads two
integers and calls LCM (a, b) function that takes two integer arguments and returns their
LCM. The LCM (a, b) function should calculate the least common multiple by calling
the GCD (a, b) function and using the following relation:
LCM (a, b) = ab / GCD (a, b)
b) Write a C program that reads two integers n and r to compute the ncr value using the
following relation:
(n, r) = n! / r! (n-r)! . Use a function for computing the factorial value of an integer.

5. a) Write C program that reads two integers x and n and calls a recursive function to
n
compute x
b) Write a C program that uses a recursive function to solve the Towers of Hanoi problem.

c) Write a C program that reads two integers and calls a recursive function to compute
value.
6. a) Write a C program to generate all the prime numbers between 1 and n, where n is a value
supplied by the user using Sieve of Eratosthenes algorithm.
b) Write a C program that uses non recursive function to search for a Key value in a given
list of integers. Use linear search method.

7. a) Write a menu-driven C program that allows a user to enter n numbers and then choose
between finding the smallest, largest, sum, or average. The menu and all the choices
are to be functions. Use a switch statement to determine what action to take. Display an
error message if an invalid choice is entered.
b) Write a C program that uses non recursive function to search for a Key value in a given
sorted list of integers. Use binary search method.

8 a) Write a C program that implements the Bubble sort method to sort a given list of
integers in ascending order.
b) Write a C program that reads two matrices and uses functions to perform the following:
1. Addition of two matrices
2. Multiplication of two matrices

9. a) Write a C program that uses functions to perform the following operations:

1. to insert a sub-string into a given main string from a given position.
2. to delete n characters from a given position in a given string.
b) Write a C program that uses a non recursive function to determine if the given string is a
palindrome or not.

10. a) Write a C program to replace a substring with another in a given line of text.
b) Write a C program that reads 15 names each of up to 30 characters, stores them
in an array, and uses an array of pointers to display them in ascending (ie.
alphabetical) order.

11. a) 2’s complement of a number is obtained by scanning it from right to left and
complementing all the bits after the first appearance of a 1. Thus 2’s complement of
11100 is 00100. Write a C program to find the 2’s complement of a binary number.
b) Write a C program to convert a positive integer to a roman numeral. Ex. 11 is converted
to XI.

12. a) Write a C program to display the contents of a file to standard output device.
b) Write a C program which copies one file to another, replacing all lowercase characters
with their uppercase equivalents.

13. a) Write a C program to count the number of times a character occurs in a text file. The file
name and the character are supplied as command-line arguments.
b) Write a C program to compare two files, printing the first line where they differ.
14. a) Write a C program to change the nth character (byte) in a text file. Use fseek function.
 b) Write a C program to reverse the first n characters in a file. The file name and n are
specified on the command line. Use fseek function.

15. a) Write a C program to merge two files into a third file (i.e., the contents of the firs t file
followed by those of the second are put in the third file).
b) Define a macro that finds the maximum of two numbers. Write a C program that uses
the macro and prints the maximum of two numbers.

Reference Books:
1. Mastering C, K.R. Venugopal and S.R. Prasad, TMH Publishers.
2. Computer Programming in C, V. Rajaraman, PHI.
3. Programming in C, Stephen G. Kochan, Fourth Edition, Pearson Education.
4. C++: The complete reference, H. Schildt, TMH Publishers.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B.TECH. COMPUTER SCIENCE AND ENGINEERING

COURSE STRUCTURE & SYLLABUS (2016-17)

ld
II YEAR I SEMESTER

Course
S. No Course Title L T P Credits
Code

or
1 MA301BS Mathematics – IV 4 1 0 4
2 CS302ES Data Structures through C++ 4 0 0 4
CS303ES Mathematical Foundations of Computer
3 4 0 0 4
Science
4 CS304ES Digital Logic Design 3 0 0 3

W
5 CS305ES Object Oriented Programming through Java 3 0 0 3
6 CS306ES Data Structures through C++ Lab 0 0 3 2
7 CS307ES IT Workshop 0 0 3 2
CS308ES Object Oriented Programming through Java
8 0 0 3 2
Lab
9 * MC300ES Environmental Science and Technology 3 0 0 0
TU
Total Credits 21 1 9 24

II YEAR II SEMESTER

Course
S. No Course Title L T P Credits
JN

Code
1 CS401BS Computer Organization 4 0 0 4
2 CS402ES Database Management Systems 4 0 0 4
3 CS403ES Operating Systems 4 0 0 4
4 CS404ES Formal Languages and Automata Theory 3 0 0 3
5 SM405MS Business Economics and Financial Analysis 3 0 0 3
6 CS406ES Computer Organization Lab 0 0 3 2
7 CS407ES Database Management Systems Lab 0 0 3 2
ll

8 CS408ES Operating Systems Lab 0 0 3 2

9 * MC400HS Gender Sensitization Lab 0 0 3 0
Total Credits 18 0 12 24
A

* Satisfactory/Unsatisfactory
 MA301BS: MATHEMATICS - IV
(Complex Variables and Fourier Analysis)

B.Tech. II Year I Sem. L T P C

4 1 0 4

ld
Prerequisites: Foundation course (No Prerequisites).

Course Objectives: To learn

 differentiation and integration of complex valued functions

or
 evaluation of integrals using Cauchy’s integral formula
 Laurent’s series expansion of complex functions
 evaluation of integrals using Residue theorem
 express a periodic function by Fourier series and a non-periodic function by Fourier
transform

W
 to analyze the displacements of one dimensional wave and distribution of one
dimensional heat equation

Course Outcomes: After learning the contents of this paper the student must be able to:
 analyze the complex functions with reference to their analyticity, integration using
Cauchy’s integral theorem
TU
 find the Taylor’s and Laurent’s series expansion of complex functions
 the bilinear transformation
 express any periodic function in term of sines and cosines
 express a non-periodic function as integral representation
 analyze one dimensional wave and heat equation
JN

UNIT – I
Functions of a complex variable: Introduction, Continuity, Differentiability, Analyticity,
properties, Cauchy, Riemann equations in Cartesian and polar coordinates. Harmonic and
conjugate harmonic functions-Milne-Thompson method

UNIT - II
Complex integration: Line integral, Cauchy’s integral theorem, Cauchy’s integral formula,
and Generalized Cauchy’s integral formula, Power series: Taylor’s series- Laurent series,
ll

Singular points, isolated singular points, pole of order m – essential singularity, Residue,
Cauchy Residue theorem (Without proof).
A

UNIT – III
Evaluation of Integrals: Types of real integrals:

c  2
a) Improper real integrals  f ( x) dx (b)  f (cos ,sin  )d
c


Bilinear transformation- fixed point- cross ratio- properties- invariance of circles.

 UNIT – IV
Fourier series and Transforms: Introduction, Periodic functions, Fourier series of periodic
function, Dirichlet’s conditions, Even and odd functions, Change of interval, Half range sine
and cosine series.
Fourier integral theorem (without proof), Fourier sine and cosine integrals, sine and cosine,
transforms, properties, inverse transforms, Finite Fourier transforms.

ld
UNIT – V
Applications of PDE: Classification of second order partial differential equations, method of
separation of variables, Solution of one dimensional wave and heat equations.

or
TEXT BOOKS:
1. A first course in complex analysis with applications by Dennis G. Zill and Patrick
Shanahan, Johns and Bartlett Publishers.
2. Higher Engineering Mathematics by Dr. B. S. Grewal, Khanna Publishers.

W
3. Advanced engineering Mathematics with MATLAB by Dean G. Duffy

REFERENCES:
1. Fundamentals of Complex Analysis by Saff, E. B. and A. D. Snider, Pearson.
2. Advanced Engineering Mathematics by Louis C. Barrett, McGraw Hill.
TU
JN
ll
A
 CS302ES: DATA STRUCTURES THROUGH C++

B.Tech. II Year I Sem. L T P C

4 0 0 4

Course Objectives:

ld
 To understand the basic concepts such as Abstract Data Types, Linear and Non Linear
Data structures.
 To understand the notations used to analyze the Performance of algorithms.
 To understand the behavior of data structures such as stacks, queues, trees, hash

or
tables, search trees, Graphs and their representations.
 To choose an appropriate data structure for a specified application.
 To understand and analyze various searching and sorting algorithms.
 To learn to implement ADTs such as lists, stacks, queues, trees, graphs, search trees
in C++ to solve problems.

W
Course Outcomes:
 Ability to choose appropriate data structures to represent data items in real world
problems.
 Ability to analyze the time and space complexities of algorithms.
 Ability to design programs using a variety of data structures such as stacks, queues,
TU
hash tables, binary trees, search trees, heaps, graphs, and B-trees.
 Able to analyze and implement various kinds of searching and sorting techniques.

UNIT - I
C++ Programming Concepts: Review of C, input and output in C++, functions in C++-
value parameters, reference parameters, Parameter passing, function overloading, function
templates, Exceptions-throwing an exception and handling an exception, arrays, pointers,
JN

new and delete operators, class and object, access specifiers , friend functions, constructors
and destructor, Operator overloading, class templates, Inheritance and Polymorphism..
Basic Concepts - Data objects and Structures, Algorithm Specification-Introduction,
Recursive algorithms, Data Abstraction, Performance analysis- time complexity and space
complexity, Asymptotic Notation-Big O, Omega and Theta notations, Complexity Analysis
Examples, Introduction to Linear and Non Linear data structures.
ll

UNIT - II
Representation of single, two dimensional arrays, sparse matrices-array and linked
representations.
A

Linear list ADT-array representation and linked representation, Singly Linked Lists-
Operations-Insertion, Deletion, Circularly linked lists-Operations for Circularly linked lists,
Doubly Linked Lists- Operations- Insertion, Deletion.
 Stack ADT, definition, array and linked implementations, applications-infix to postfix
conversion, Postfix expression evaluation, recursion implementation, Queue ADT, definition,
array and linked Implementations, Circular queues-Insertion and deletion operations.
UNIT - III
Trees – definition, terminology, Binary trees-definition, Properties of Binary Trees, Binary
Tree ADT, representation of Binary Trees-array and linked representations, Binary Tree

ld
traversals, Threaded binary trees, Priority Queues –Definition and applications, Max Priority
Queue ADT-implementation-Max Heap-Definition, Insertion into a Max Heap, Deletion
from a Max Heap.

or
UNIT - IV
Searching - Linear Search, Binary Search, Hashing-Introduction, hash tables, hash functions,
Overflow Handling, Comparison of Searching methods.
Sorting-Insertion Sort, Selection Sort, Radix Sort, Quick sort, Heap Sort, Merge sort,
Comparison of Sorting methods.

W
.
UNIT - V
Graphs–Definitions, Terminology, Applications and more definitions, Properties, Graph
ADT, Graph Representations- Adjacency matrix, Adjacency lists, Graph Search methods -
DFS and BFS, Complexity analysis,
Search Trees-Binary Search Tree ADT, Definition, Operations- Searching, Insertion and
Deletion, Balanced search trees-AVL Trees-Definition and Examples only, B-Trees-
TU
Definition and Examples only, Red-Black Trees-Definitions and Examples only, Comparison
of Search Trees.

TEXT BOOKS:
1. Data structures, Algorithms and Applications in C++, 2nd Edition, Sartaj Sahni,
Universities Press.
JN

2. Data structures and Algorithms in C++, Adam Drozdek, 4th edition, Cengage learning.

REFERENCE BOOKS:
1. Data structures with C++, J. Hubbard, Schaum’s outlines, TMH.
2. Data structures and Algorithms in C++, M.T. Goodrich, R. Tamassia and D. Mount,
Wiley India.
3. Data structures and Algorithm Analysis in C++, 3rd edition, M. A. Weiss, Pearson.
4. Classic Data Structures, D. Samanta, 2nd edition, PHI.
ll
A
 CS303ES: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

B.Tech. II Year I Sem. L T P C

4 0 0 4

Course Objectives:

ld
 To introduce the concepts of mathematical logic.
 To introduce the concepts of sets, relations, and functions.
 To perform the operations associated with sets, functions, and relations.
 To relate practical examples to the appropriate set, function, or relation model, and

or
interpret the associated operations and terminology in context.
 To introduce generating functions and recurrence relations.
 To use Graph Theory for solving problems.

Course Outcomes

W
 Ability to apply mathematical logic to solve problems.
 Understand sets, relations, functions, and discrete structures.
 Able to use logical notation to define and reason about fundamental mathematical
concepts such as sets, relations, and functions.
 Able to formulate problems and solve recurrence relations.
 Able to model and solve real-world problems using graphs and trees.
TU
UNIT - I
Mathematical logic: Introduction, Statements and Notation, Connectives, Normal Forms,
Theory of Inference for the Statement Calculus, The Predicate Calculus, Inference Theory of
the Predicate Calculus.
JN

UNIT - II
Set theory: Introduction, Basic Concepts of Set Theory, Representation of Discrete
Structures, Relations and Ordering, Functions.
Algebraic Structures: Introduction, Algebraic Systems, Semi groups and Monoids, Groups,
Lattices as Partially Ordered Sets, Boolean algebra.

UNIT - III
Elementary Combinatorics: Basics of Counting, Combinations and Permutations,
ll

Enumeration of Combinations and Permutations, Enumerating Combinations and

Permutations with Repetitions, Enumerating Permutations with Constrained Repetitions,
Binomial Coefficients, The Binomial and Multinomial Theorems, The Principle of Inclusion-
A

Exclusion.

UNIT - IV
Recurrence Relations: Generating Functions of Sequences, Calculating Coefficients of
generating functions, Recurrence relations, Solving recurrence relations by substitution and
 Generating functions, The method of Characteristic roots, Solutions of Inhomogeneous
Recurrence Relations.

UNIT - V
Graphs: Basic Concepts, Isomorphisms and Subgraphs, Trees and their Properties, Spanning
Trees, Directed Trees, Binary Trees, Planar Graphs, Euler’s Formula, Multigraphs and Euler

ld
Circuits, Hamiltonian Graphs, Chromatic Numbers, The Four-Color Problem.

TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science, J.P.

or
Tremblay, R. Manohar, McGraw Hill education (India) Private Limited. (UNITS - I ,
II )
2. Discrete Mathematics for Computer Scientists & Mathematicians, Joe L. Mott,
Abraham Kandel, Theodore P. Baker, Pearson , 2 nd ed. (Units - III, IV, V )

W
REFERENCE BOOKS:
1. Discrete Mathematics and its Applications, Kenneth H. Rosen, 7th Edition, McGraw
Hill education (India) Private Limited.
2. Discrete Mathematics, D.S. Malik & M.K. Sen, Revised edition Cengage Learning.
3. Elements of Discrete Mathematics, C. L. Liu and D. P. Mohapatra, 4th edition,
McGraw Hill education (India) Private Limited.
4. Discrete Mathematics with Applications, Thomas Koshy, Elsevier.
TU
5. Discrete and Combinatorial Mathematics, R. P. Grimaldi, Pearson.
JN
ll
A
 CS304ES: DIGITAL LOGIC DESIGN

B.Tech. II Year I Sem. L T P C

3 0 0 3
Course Objectives:
 To understand basic number systems, codes and logical gates.

ld
 To understand the concepts of Boolean algebra.
 To understand the use of minimization logic to solve the Boolean logic expressions..
 To understand the design of combinational and sequential circuits.
 To understand the state reduction methods for Sequential circuits.

or
 To understand the basics of various types of memories.

Course Outcomes:
 Able to understand number systems and codes.
 Able to solve Boolean expressions using Minimization methods.

W
 Able to design the sequential and combinational circuits.
 Able to apply state reduction methods to solve sequential circuits.

UNIT - I
Digital Systems, Binary Numbers, Number base conversions, Octal, Hexadecimal and other
base numbers, complements, signed binary numbers, Floating point number representation,
TU
binary codes, Error detection and correction, binary storage and registers, binary logic,
Boolean algebra and logic gates , Basic theorems and properties of Boolean Algebra,
Boolean functions, canonical and standard forms, Digital Logic Gates.

UNIT - II
Gate–Level Minimization, The K-Map Method, Three-Variable Map, Four-Variable Map,
Five-Variable Map , sum of products , product of sums simplification, Don’t care conditions ,
JN

NAND and NOR implementation and other two level implementations, Exclusive-OR
function.

UNIT - III
Combinational Circuits (CC), Analysis procedure, Design Procedure, Combinational circuit
for different code converters and other problems, Binary Adder-Subtractor, Decimal Adder,
Binary Multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexers, De-
ll

multiplexers.

UNIT - IV
A

Synchronous Sequential Circuits, Latches, Flip-flops, analysis of clocked sequential circuits,

Registers, Shift registers, Ripple counters, Synchronous counters, other counters.
Asynchronous Sequential Circuits -Introduction, Analysis procedure, Circuits with latches,
Design procedure, Reduction of state and follow tables, Race- free state assignment, Hazards.
 UNIT - V
Memory: Introduction, Random-Access memory, Memory decoding, ROM, Programmable
Logic Array, Programmable Array Logic, Sequential programmable devices.
Register Transfer and Microoperations - Register Transfer Language, Register Transfer, Bus
and Memory Transfers,
Arithmetic Microoperations, Logic Microoperations, Shift Microoperations, Arithmetic Logic

ld
Shift Unit.

TEXT BOOKS:
1. Digital Design, M. Morris Mano, M.D.Ciletti, 5th edition, Pearson.(Units I, II, III, IV,

or
Part of Unit V)
2. Computer System Architecture, M.Morris Mano, 3rd edition, Pearson.(Part of Unit V)

REFERENCE BOOKS:
1. Switching and Finite Automata Theory, Z. Kohavi, Tata McGraw Hill.

W
2. Fundamentals of Logic Design, C. H. Roth, L. L. Kinney, 7th edition, Cengage
Learning.
3. Fundamentals of Digital Logic & Micro Computer Design, 5TH Edition, M.
Rafiquzzaman, John Wiley.
TU
JN
ll
A
 CS305ES: OBJECT ORIENTED PROGRAMMING THROUGH JAVA

B.Tech. II Year I Sem. L T P C

3 0 0 3

Course Objectives:

ld
 To introduce the object oriented programming concepts.
 To understand object oriented programming concepts, and apply them in solving
problems.
 To introduce the principles of inheritance and polymorphism; and demonstrate how

or
they relate to the design of abstract classes
 To introduce the implementation of packages and interfaces
 To introduce the concepts of exception handling and multithreading.
 To introduce the design of Graphical User Interface using applets and swing controls.

W
Course Outcomes
 Able to solve real world problems using OOP techniques.
 Able to understand the use of abstract classes.
 Able to solve problems using java collection framework and I/o classes.
 Able to develop multithreaded applications with synchronization.
 Able to develop applets for web applications.
TU
 Able to design GUI based applications

UNIT - I
Object-oriented thinking- A way of viewing world – Agents and Communities, messages
and methods, Responsibilities, Classes and Instances, Class Hierarchies- Inheritance, Method
binding, Overriding and Exceptions, Summary of Object-Oriented concepts. Java buzzwords,
JN

An Overview of Java, Data types, Variables and Arrays, operators, expressions, control
statements, Introducing classes, Methods and Classes, String handling.
Inheritance– Inheritance concept, Inheritance basics, Member access, Constructors, Creating
Multilevel hierarchy, super uses, using final with inheritance, Polymorphism-ad hoc
polymorphism, pure polymorphism, method overriding, abstract classes, Object class, forms
of inheritance- specialization, specification, construction, extension, limitation, combination,
benefits of inheritance, costs of inheritance.
ll

UNIT - II
Packages- Defining a Package, CLASSPATH, Access protection, importing packages.
Interfaces- defining an interface, implementing interfaces, Nested interfaces, applying
A

interfaces, variables in interfaces and extending interfaces.

Stream based I/O(java.io) – The Stream classes-Byte streams and Character streams,
Reading console Input and Writing Console Output, File class, Reading and writing Files,
Random access file operations, The Console class, Serialization, Enumerations, auto boxing,
generics.
 UNIT - III
Exception handling - Fundamentals of exception handling, Exception types, Termination or
resumptive models, Uncaught exceptions, using try and catch, multiple catch clauses, nested
try statements, throw, throws and finally, built- in exceptions, creating own exception sub
classes.
Multithreading- Differences between thread-based multitasking and process-based

ld
multitasking, Java thread model, creating threads, thread priorities, synchronizing threads,
inter thread communication.

UNIT - IV

or
The Collections Framework (java.util)- Collections overview, Collection Interfaces, The
Collection classes- Array List, Linked List, Hash Set, Tree Set, Priority Queue, Array Deque.
Accessing a Collection via an Iterator, Using an Iterator, The For-Each alternative, Map
Interfaces and Classes, Comparators, Collection algorithms, Arrays, The Legacy Classes and
Interfaces- Dictionary, Hashtable ,Properties, Stack, Vector

W
More Utility classes, String Tokenizer, Bit Set, Date, Calendar, Random, Formatter, Scanner

UNIT - V
GUI Programming with Swing – Introduction, limitations of AWT, MVC architecture,
components, containers. Understanding Layout Managers, Flow Layout, Border Layout,
Grid Layout, Card Layout, Grid Bag Layout.
Event Handling- The Delegation event model- Events, Event sources, Event Listeners,
TU
Event classes, Handling mouse and keyboard events, Adapter classes, Inner classes,
Anonymous Inner classes.
A Simple Swing Application, Applets – Applets and HTML, Security Issues, Applets and
Applications, passing parameters to applets. Creating a Swing Applet, Painting in Swing, A
Paint example, Exploring Swing Controls- JLabel and Image Icon, JText Field, The Swing
Buttons- JButton, JToggle Button, JCheck Box, JRadio Button, JTabbed Pane, JScroll Pane,
JN

JList, JCombo Box, Swing Menus, Dialogs.

TEXT BOOKS
1. Java The complete reference, 9th edition, Herbert Schildt, McGraw Hill Education
(India) Pvt. Ltd.
2. Understanding Object-Oriented Programming with Java, updated edition, T. Budd,
Pearson Education.
ll

REFERENCE BOOKS
1. An Introduction to programming and OO design using Java, J. Nino and F.A. Hosch,
John Wiley & sons.
A

2. Introduction to Java programming, Y. Daniel Liang, Pearson Education.

3. Object Oriented Programming through Java, P. Radha Krishna, Universities Press.
4. Programming in Java, S. Malhotra, S. Chudhary, 2nd edition, Oxford Univ. Press.
5. Java Programming and Object oriented Application Development, R. A. Johnson,
Cengage Learning.
 CS306ES: DATA STRUCTURES THROUGH C++ LAB

B.Tech. II Year I Sem. L T P C

0 0 3 2

Course Objectives:

ld
 To write and execute programs in C++ to solve problems using data structures such as
arrays, linked lists, stacks, queues, trees, graphs, hash tables and search trees.
 To learn to write C++programs to implement various sorting and searching
algorithms

or
Course Outcomes:
 Able to identify the appropriate data structures and algorithms for solving real world
problems.
 Able to implement various kinds of searching and sorting techniques.
 Able to implement data structures such as stacks, queues, Search trees, and hash

W
tables to solve various computing problems.

1. Write a C++ program that uses functions to perform the following:

a) Create a singly linked list of integers.
b) Delete a given integer from the above linked list.
c) Display the contents of the above list after deletion.
TU
2. Write a template based C++ program that uses functions to perform the following:
a) Create a doubly linked list of elements.
b) Delete a given element from the above doubly linked list.
c) Display the contents of the above list after deletion.

3. Write a C++ program that uses stack operations to convert a given infix expression into its
JN

postfix equivalent, Implement the stack using an array.

4. Write a C++ program to implement a double ended queue ADT using an array, using a
doubly linked list.

5. Write a C++ program that uses functions to perform the following:

a) Create a binary search tree of characters.
ll

b) Traverse the above Binary search tree recursively in preorder, in order and post order,

6. Write a C++ program that uses function templates to perform the following:
A

a) Search for a key element in a list of elements using linear search.

b) Search for a key element in a list of sorted elements using binary search.

7. Write a C++ program that implements Insertion sort algorithm to arrange a list of integers
in ascending order.
 8. Write a template based C++ program that implements selection sort algorithm to arrange a
list of elements in descending order.

9. Write a template based C++ program that implements Quick sort algorithm to arrange a list
of elements in ascending order.

ld
10. Write a C++ program that implements Heap sort algorithm for sorting a list of integers in
ascending order.

11. Write a C++ program that implements Merge sort algorithm for sorting a list of integers

or
in ascending order

12. Write a C++ program to implement all the functions of a dictionary (ADT) using hashing.

13. Write a C++ program that implements Radix sort algorithm for sorting a list of integers in

W
ascending order

14. Write a C++ program that uses functions to perform the following:
a) Create a binary search tree of integers.
b) Traverse the above Binary search tree non recursively in inorder.

15. Write a C++ program that uses functions to perform the following:
TU
a) Create a binary search tree of integers.
b) Search for an integer key in the above binary search tree non recursively.
c) Search for an integer key in the above binary search tree recursively.

REFERENCE BOOKS
1. Data Structures using C++, D. S. Malik, 2 nd edition, Cengage learning.
JN

2. Data Structures using C++, V. Patil, Oxford University Press.

3. Fundamentals of Data structures in C++, 2nd edition, E. Horowitz, S. Sahni and D.
Mehta, Universities Press.
4. C++ Plus Data Structures, 4th edition, Nell Dale, Jones and Bartlett student edition.
ll
A
 CS307ES: IT WORKSHOP

B.Tech. II Year I Sem. L T P C

0 0 3 2

Course Objectives:

ld
 The IT Workshop is a training lab course to get training on PC Hardware, Internet &
World Wide Web, and Productivity tools for documentation, Spreadsheet
computations, and Presentation.
 To introduce to a personal computer and its basic peripherals, the process of

or
assembling a personal computer, installation of system software like MS Windows,
Linux and the required device drivers, hardware and software level troubleshooting
process.
 To introduce connecting the PC on to the internet from home and workplace and
effectively usage of the internet, Usage of web browsers, email, newsgroups and

W
discussion forums. To get knowledge in awareness of cyber hygiene, i.e., protecting
the personal computer from getting infected with the viruses, worms and other cyber
attacks.
 To introduce the usage of Productivity tools in crafting professional word documents,
excel spreadsheets and power point presentations using open office tools and LaTeX.
TU
Course Outcomes:
 Apply knowledge for computer assembling and software installation.
 Ability how to solve the trouble shooting problems.
 Apply the tools for preparation of PPT, Documentation and budget sheet etc.

PC Hardware: The students should work on working PC to disassemble and assemble to

working condition and install operating system like Linux or any other on the same PC.
JN

Students are suggested to work similar tasks in the Laptop scenario wherever possible.

Problem 1: Every student should identify the peripherals of a computer, components in a

CPU and its functions. Draw the block diagram of the CPU along with the configuration of
each peripheral and submit to your instructor. Every student should disassemble and
assemble the PC back to working condition.
ll

Problem 2: Every student should individually install operating system like Linux or MS
windows on the personal computer. The system should be configured as dual boot with both
windows and Linux.
A

Problem 3: Hardware Troubleshooting: Students have to be given a PC which does not boot
due to improper assembly or defective peripherals. They should identify the problem and fix
it to get the computer back to working condition.
 Problem 4: Software Troubleshooting: Students have to be given a malfunctioning CPU due
to system software problems. They should identify the problem and fix it to get the computer
back to working condition.

Internet & World Wide Web.

Problem 5: Orientation & Connectivity Boot Camp: Students should get connected to their

ld
Local Area Network and access the Internet. In the process they configure the TCP/IP setting.
Finally students should demonstrate how to access the websites and email.

Problem 6: Web Browsers, Surfing the Web: Students customize their web browsers with

or
the LAN proxy settings, bookmarks, search toolbars and pop up blockers. Also, plug-ins like
Macromedia Flash and JRE for applets should be configured.

Problem 7: Search Engines & Netiquette: Students should know what search engines are and
how to use the search engines. Usage of search engines like Google, Yahoo, ask.com and

W
others should be demonstrated by student.

Problem 8: Cyber Hygiene: Students should learn about viruses on the internet and install
antivirus software. Student should learn to customize the browsers to block pop ups, block
active x downloads to avoid viruses and/or worms.

Problem 9: Develop home page: Student should learn to develop his/her home page using
TU
HTML consisting of his/her photo, name, address and education details as a table and his/her
skill set as a list.

Productivity tools: LaTeX and Word

Word Orientation: An overview of LaTeX and Microsoft (MS) office / equivalent (FOSS)
tool word should be learned: Importance of LaTeX and MS office / equivalent (FOSS) tool
JN

Word as word Processors, Details of the three tasks and features that should be covered in
each, using LaTeX and word – Accessing, overview of toolbars, saving files, Using help and
resources, rulers, format painter.

Problem 10: Using LaTeX and Word to create project certificate. Features to be covered:-
Formatting Fonts in word, Drop Cap in word, Applying Text effects, Using Character
Spacing, Borders and Colors, Inserting Header and Footer, Using Date and Time option in
both LaTeX and Word.
ll

Problem 11: Creating project abstract Features to be covered:-Formatting Styles, Inserting

table, Bullets and Numbering, Changing Text Direction, Cell alignment, Footnote, Hyperlink,
A

Symbols, Spell Check, Track Changes.

Problem 12: Creating a Newsletter: Features to be covered:- Table of Content, Newspaper

columns, Images from files and clipart, Drawing toolbar and Word Art, Formatting Images,
Textboxes, Paragraphs in word.
 Problem 13 - Spreadsheet Orientation: Accessing, overview of toolbars, saving
spreadsheet files, Using help and resources. Creating a Scheduler:- Gridlines, Format Cells,
Summation, auto fill, Formatting Text

Problem 14: Calculating GPA - .Features to be covered:- Cell Referencing, Formulae in

spreadsheet – average, std. deviation, Charts, Renaming and Inserting worksheets, Hyper

ld
linking, Count function, Sorting, Conditional formatting.

Problem 15: Creating Power Point: Student should work on basic power point utilities and
tools in Latex and Ms Office/equivalent (FOSS) which help them create basic power point

or
presentation. PPT Orientation, Slide Layouts, Inserting Text, Formatting Text, Bullets and
Numbering, Auto Shapes, Lines and Arrows, Hyperlinks, Inserting Images, Tables and
Charts

REFERENCE BOOKS:

W
1. Introduction to Information Technology, ITL Education Solutions limited, Pearson
Education.
2. LaTeX Companion – Leslie Lamport, PHI/Pearson.
3. Comdex Information Technology course tool kit Vikas Gupta, WILEY Dreamtech
4. IT Essentials PC Hardware and Software Companion Guide Third Edition by David
Anfinson and Ken Quamme. – CISCO Press, Pearson Education.
5. PC Hardware and A+ Handbook – Kate J. Chase PHI (Microsoft)
TU
JN
ll
A
 CS308ES: OBJECT ORIENTED PROGRAMMING THROUGH JAVA LAB

B.Tech. II Year I Sem. L T P C

0 0 3 2

Course Objectives:

ld
 To write programs using abstract classes.
 To write programs for solving real world problems using java collection frame work.
 To write multithreaded programs.
 To write GUI programs using swing controls in Java.

or
 To introduce java compiler and eclipse platform.
 To impart hands on experience with java programming.

Course Outcomes:
 Able to write programs for solving real world problems using java collection frame

W
work.
 Able to write programs using abstract classes.
 Able to write multithreaded programs.
 Able to write GUI programs using swing controls in Java.

Note:
TU
1. Use Linux and MySQL for the Lab Experiments. Though not mandatory, encourage
the use of Eclipse platform.
2. The list suggests the minimum program set. Hence, the concerned staff is requested to
add more problems to the list as needed.

1. Use Eclipse or Net bean platform and acquaint with the various menus. Create a test
project, add a test class, and run it. See how you can use auto suggestions, auto fill.
JN

Try code formatter and code refactoring like renaming variables, methods, and
classes. Try debug step by step with a small program of about 10 to 15 lines which
contains at least one if else condition and a for loop.

2. Write a Java program that works as a simple calculator. Use a grid layout to arrange
buttons for the digits and for the +, -,*, % operations. Add a text field to display the
result. Handle any possible exceptions like divided by zero.
ll

3. A) Develop an applet in Java that displays a simple message.

b) Develop an applet in Java that receives an integer in one text field, and computes
A

its factorial Value and returns it in another text field, when the button named
“Compute” is clicked.

4. Write a Java program that creates a user interface to perform integer divisions. The
user enters two numbers in the text fields, Num1 and Num2. The division of Num1
 and Num 2 is displayed in the Result field when the Divide button is clicked. If Num1
or Num2 were not an integer, the program would throw a Number Format Exception.
If Num2 were Zero, the program would throw an Arithmetic Exception. Display the
exception in a message dialog box.

5. Write a Java program that implements a multi-thread application that has three

ld
threads. First thread generates random integer every 1 second and if the value is even,
second thread computes the square of the number and prints. If the value is odd, the
third thread will print the value of cube of the number.

or
6. Write a Java program for the following:
i) Create a doubly linked list of elements.
ii) Delete a given element from the above list.
iii) Display the contents of the list after deletion.

W
7. Write a Java program that simulates a traffic light. The program lets the user select
one of three lights: red, yellow, or green with radio buttons. On selecting a button, an
appropriate message with “Stop” or “Ready” or “Go” should appear above the buttons
in selected color. Initially, there is no message shown.

8. Write a Java program to create an abstract class named Shape that contains two
integers and an empty method named print Area (). Provide three classes named
TU
Rectangle, Triangle, and Circle such that each one of the classes extends the class
Shape. Each one of the classes contains only the method print Area () that prints the
area of the given shape.

9. Suppose that a table named Table.txt is stored in a text file. The first line in the file is
the header, and the remaining lines correspond to rows in the table. The elements are
JN

separated by commas. Write a java program to display the table using Labels in Grid
Layout.

10. Write a Java program that handles all mouse events and shows the event name at the
center of the window when a mouse event is fired (Use Adapter classes).

11. Write a Java program that loads names and phone numbers from a text file where the
data is organized as one line per record and each field in a record are separated by a
ll

tab (\t). It takes a name or phone number as input and prints the corresponding other
value from the hash table (hint: use hash tables).
A

12. Write a Java program that correctly implements the producer – consumer problem
using the concept of interthread communication.

13. Write a Java program to list all the files in a directory including the files present in all
its subdirectories.
 14. Write a Java program that implements Quick sort algorithm for sorting a list of names
in ascending order

15. Write a Java program that implements Bubble sort algorithm for sorting in descending
order and also shows the number of interchanges occurred for the given set of
integers.

ld
REFERENCE BOOKS
1. Java for Programmers, P. J. Deitel and H. M. Deitel, 10th Edition Pearson education.
2. Thinking in Java, Bruce Eckel, Pearson Education.

or
3. Java Programming, D. S. Malik and P. S. Nair, Cengage Learning.
4. Core Java, Volume 1, 9th edition, Cay S. Horstmann and G Cornell, Pearson.

W
TU
JN
ll
A
 MC300ES: ENVIRONMENTAL SCIENCE AND TECHNOLOGY

B.Tech. II Year I Sem. L T P C

3 0 0 0

Course Objectives:

ld
 Understanding the importance of ecological balance for sustainable development.
 Understanding the impacts of developmental activities and mitigation measures
 Understanding the environmental policies and regulations

or
Course Outcomes:
Based on this course, the Engineering graduate will understand /evaluate / develop
technologies on the basis of ecological principles and environmental regulations which in
turn helps in sustainable development

W
UNIT - I
Ecosystems: Definition, Scope and Importance of ecosystem. Classification, structure, and
function of an ecosystem, Food chains, food webs, and ecological pyramids. Flow of energy,
Biogeochemical cycles, Bioaccumulation, Biomagnification, ecosystem value, services and
carrying capacity, Field visits.
TU
UNIT - II
Natural Resources: Classification of Resources: Living and Non-Living resources, water
resources: use and over utilization of surface and ground water, floods and droughts, Dams:
benefits and problems. Mineral resources: use and exploitation, environmental effects of
extracting and using mineral resources, Land resources: Forest resources, Energy
resources: growing energy needs, renewable and non renewable energy sources, use of
alternate energy source, case studies.
JN

UNIT - III
Biodiversity And Biotic Resources: Introduction, Definition, genetic, species and ecosystem
diversity. Value of biodiversity; consumptive use, productive use, social, ethical, aesthetic
and optional values. India as a mega diversity nation, Hot spots of biodiversity. Field visit.
Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts;
conservation of biodiversity: In-Situ and Ex-situ conservation. National Biodiversity act.
ll

UNIT - IV
Environmental Pollution and Control Technologies: Environmental Pollution:
A

Classification of pollution, Air Pollution: Primary and secondary pollutants, Automobile and
Industrial pollution, Ambient air quality standards. Water pollution: Sources and types of
pollution, drinking water quality standards. Soil Pollution: Sources and types, Impacts of
modern agriculture, degradation of soil. Noise Pollution: Sources and Health hazards,
standards, Solid waste: Municipal Solid Waste management, composition and characteristics
 of e-Waste and its management. Pollution control technologies: Wastewater Treatment
methods: Primary, secondary and Tertiary.
Overview of air pollution control technologies, Concepts of bioremediation. Global
Environmental Problems and Global Efforts: Climate change and impacts on human
environment. Ozone depletion and Ozone depleting substances (ODS). Deforestation and
desertification. International conventions / Protocols: Earth summit, Kyoto protocol, and

ld
Montréal Protocol.

UNIT - V
Environmental Policy, Legislation & EIA: Environmental Protection act, Legal aspects

or
Air Act- 1981, Water Act, Forest Act, Wild life Act, Municipal solid waste management and
handling rules, biomedical waste management and handling rules, hazardous waste
management and handling rules. EIA: EIA structure, methods of baseline data acquisition.
Overview on Impacts of air, water, biological and Socio-economical aspects. Strategies for
risk assessment, Concepts of Environmental Management Plan (EMP). Towards

W
Sustainable Future: Concept of Sustainable Development, Population and its explosion,
Crazy Consumerism, Environmental Education, Urban Sprawl, Human health,
Environmental Ethics, Concept of Green Building, Ecological Foot Print, Life Cycle
assessment (LCA), Low carbon life style.

TEXT BOOKS:
1. Textbook of Environmental Studies for Undergraduate Courses by Erach Bharucha
TU
for University Grants Commission.
2. Environmental Studies by R. Rajagopalan, Oxford University Press.

REFERENCE BOOKS:
1. Environmental Science: towards a sustainable future by Richard T. Wright. 2008
PHL Learning Private Ltd. New Delhi.
JN

2. Environmental Engineering and science by Gilbert M. Masters and Wendell P. Ela.

2008 PHI Learning Pvt. Ltd.
3. Environmental Science by Daniel B. Botkin & Edward A. Keller, Wiley INDIA
edition.
4. Environmental Studies by Anubha Kaushik, 4 th Edition, New age international
publishers.
5. Text book of Environmental Science and Technology - Dr. M. Anji Reddy 2007, BS
Publications.
ll
A
 CS401ES: COMPUTER ORGANIZATION
B.Tech. II Year II Sem. L T P C
4 0 0 4

Course Objectives:
 To understand basic components of computers.

ld
 To understand the architecture of 8086 processor.
 To understand the instruction sets, instruction formats and various addressing modes
of 8086.
 To understand the representation of data at the machine level and how computations

or
are performed
at machine level.
 To understand the memory organization and I/O organization.
 To understand the parallelism both in terms of single and multiple processors.

W
Course Outcomes:
 Able to understand the basic components and the design of CPU, ALU and Control
Unit.
 Ability to understand memory hierarchy and its impact on computer
cost/performance.
 Ability to understand the advantage of instruction level parallelism and pipelining for
TU
high performance Processor design.
 Ability to understand the instruction set, instruction formats and addressing modes of
8086.
 Ability to write assembly language programs to solve problems.

UNIT - I
JN

Digital Computers: Introduction, Block diagram of Digital Computer, Definition of

Computer Organization, Computer Design and Computer Architecture.
Basic Computer Organization and Design: Instruction codes, Computer Registers,
Computer instructions, Timing and Control, Instruction cycle, Memory Reference
Instructions, Input – Output and Interrupt, Complete Computer Description.
Micro Programmed Control: Control memory, Address sequencing, micro program
example, design of control unit.
ll

UNIT - II
Central Processing Unit: The 8086 Processor Architecture, Register organization, Physical
memory organization, General Bus Operation, I/O Addressing Capability, Special Processor
A

Activities, Minimum and Maximum mode system and timings.

8086 Instruction Set and Assembler Directives-Machine language instruction formats,
Addressing modes, Instruction set of 8086, Assembler directives and operators.
 UNIT - III
Assembly Language Programming with 8086- Machine level programs, Machine coding the
programs, Programming with an assembler, Assembly Language example programs.
Stack structure of 8086, Interrupts and Interrupt service routines, Interrupt cycle of 8086,
Interrupt programming, Passing parameters to procedures, Macros, Timings and Delays.

ld
UNIT - IV
Computer Arithmetic: Introduction, Addition and Subtraction, Multiplication Algorithms,
Division Algorithms, Floating - point Arithmetic operations.
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous

or
data transfer, Modes of Transfer, Priority Interrupt, Direct memory Access, Input –Output
Processor (IOP),Intel 8089 IOP.

UNIT - V
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary memory, Associate

W
Memory, Cache Memory.
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline,
Instruction Pipeline, RISC Pipeline, Vector Processing, Array Processors.
Multi Processors: Characteristics of Multiprocessors, Interconnection Structures, Inter
processor arbitration, Inter processor communication, and synchronization.

TEXT BOOKS:
TU
1. Computer System Architecture, M. Moris Mano, Third Edition, Pearson. (UNIST-I
, IV , V)
2. Advanced Microprocessors and Peripherals, K M Bhurchandi, A.K Ray ,3 rd edition,
McGraw Hill India Education Private Ltd. (UNITS - II, III).

REFERENCE:
JN

1. Microprocessors and Interfacing, D V Hall, SSSP Rao, 3 rd edition, McGraw Hill

India Education Private Ltd.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky: Computer Organization, 5th
Edition, Tata McGraw Hill, 2002
3. Computer Organization and Architecture, William Stallings, 9th Edition, Pearson.
4. David A. Patterson, John L. Hennessy: Computer Organization and Design – The
Hardware / Software Interface ARM Edition, 4th Edition, Elsevier, 2009.
ll
A
 CS402ES: DATABASE MANAGEMENT SYSTEMS

B.Tech. II Year II Sem. L T P C

4 0 0 4

Course Objectives:

ld
 To understand the basic concepts and the applications of database systems.
 To master the basics of SQL and construct queries using SQL.
 To understand the relational database design principles.
 To become familiar with the basic issues of transaction processing and concurrency

or
control.
 To become familiar with database storage structures and access techniques.

Course Outcomes:
 Demonstrate the basic elements of a relational database management system.

W
 Ability to identify the data models for relevant problems.
 Ability to design entity relationship model and convert entity relationship diagrams
into RDBMS and formulate SQL queries on the data.
 Apply normalization for the development of application software.

UNIT - I
TU
Introduction: Database System Applications, Purpose of Database Systems, View of Data,
Database Languages – DDL, DML, Relational Databases, Database Design, Data Storage
and Querying, Transaction Management, Database Architecture, Data Mining and
Information Retrieval, Specialty Databases, Database Users and Administrators, History of
Database Systems.
Introduction to Data base design: Database Design and ER diagrams, Entities, Attributes
and Entity sets, Relationships and Relationship sets, Additional features of ER Model,
JN

Conceptual Design with the ER Model, Conceptual Design for Large enterprises.
Relational Model: Introduction to the Relational Model, Integrity Constraints over
Relations, Enforcing Integrity constraints, Querying relational data, Logical data base
Design: ER to Relational, Introduction to Views, Destroying /Altering Tables and Views.

UNIT - II
Relational Algebra and Calculus: Preliminaries, Relational Algebra, Relational calculus –
ll

Tuple relational Calculus, Domain relational calculus, Expressive Power of Algebra and
calculus.
SQL: Queries, Constraints, Triggers: Form of Basic SQL Query, UNION,INTERSECT, and
A

EXCEPT, Nested Queries, Aggregate Operators, NULL values Complex Integrity

Constraints in SQL, Triggers and Active Data bases, Designing Active Databases..
 UNIT - III
Schema Refinement and Normal Forms: Introduction to Schema Refinement, Functional
Dependencies - Reasoning about FDs, Normal Forms, Properties of Decompositions,
Normalization, Schema Refinement in Database Design, Other Kinds of Dependencies.

UNIT - IV

ld
Transaction Management: Transactions, Transaction Concept, A Simple Transaction
Model, Storage Structure, Transaction Atomicity and Durability, Transaction Isolation,
Serializability, Transaction Isolation and Atomicity Transaction Isolation Levels,
Implementation of Isolation Levels.

or
Concurrency Control: Lock–Based Protocols, Multiple Granularity, Timestamp-Based
Protocols, Validation-Based Protocols, Multiversion Schemes.
Recovery System-Failure Classification, Storage, Recovery and Atomicity, Recovery
Algorithm, Buffer Management, Failure with loss of nonvolatile storage, Early Lock Release
and Logical Undo Operations, Remote Backup systems.

W
UNIT - V
Storage and Indexing: Overview of Storage and Indexing: Data on External Storage, File
Organization and Indexing, Index Data Structures, Comparison of File Organizations.
Tree-Structured Indexing: Intuition for tree Indexes, Indexed Sequential Access Method
(ISAM), B+ Trees: A Dynamic Index Structure, Search, Insert, Delete.
Hash- Based Indexing: Static Hashing, Extendible hashing, Linear Hashing, Extendible vs.
TU
Linear Hashing.

TEXT BOOKS:
1. Data base Management Systems, Raghu Ramakrishnan, Johannes Gehrke, McGraw
Hill Education (India) Private Limited, 3rd Edition. (Part of UNIT-I, UNIT-II,
UNIT-III, UNIT-V)
JN

2. Data base System Concepts, A. Silberschatz, Henry. F. Korth, S. Sudarshan,

McGraw Hill Education(India) Private Limited l, 6th edition.( Part of UNIT-I,
UNIT-IV)

REFERENCE BOOKS:
1. Database Systems, 6th edition, R Elmasri, Shamkant B.Navathe, Pearson
Education.
2. Database System Concepts, Peter Rob & Carlos Coronel, Cengage Learning.
ll

3. Introduction to Database Management, M. L. Gillenson and others, Wiley Student

Edition.
4. Database Development and Management, Lee Chao, Auerbach publications, Taylor
A

& Francis Group.

5. Introduction to Database Systems, C. J. Date, Pearson Education.
 CS403ES: OPERATING SYSTEMS

B.Tech. II Year II Sem. L T P C

3 0 0 3

Course Objectives:

ld
 To understand the OS role in the overall computer system
 To study the operations performed by OS as a resource manager
 To understand the scheduling policies of OS
 To understand the different memory management techniques

or
 To understand process concurrency and synchronization
 To understand the concepts of input/output, storage and file management
 To understand the goals and principles of protection
 Introduce system call interface for file and process management
 To study different OS and compare their features.

W
Course Outcomes:
 Apply optimization techniques for the improvement of system performance.
 Ability to design and solve synchronization problems.
 Learn about minimization of turnaround time, waiting time and response time and
also maximization of throughput by keeping CPU as busy as possible.
TU
 Ability to change access controls to protect files.
 Ability to compare the different operating systems.

UNIT - I
Overview-Introduction-Operating system objectives, User view, System view, Operating
system definition ,Computer System Organization, Computer System Architecture, OS
JN

Structure, OS Operations, Process Management, Memory Management, Storage

Management, Protection and Security, Computing Environments.
Operating System services, User and OS Interface, System Calls, Types of System Calls,
System Programs, Operating System Design and Implementation, OS Structure.

UNIT - II
Process and CPU Scheduling - Process concepts-The Process, Process State, Process Control
Block, Threads, Process Scheduling-Scheduling Queues, Schedulers, Context Switch,
ll

Operations on Processes, System calls-fork(),exec(),wait(),exit(), Interprocess

communication-ordinary pipes and named pipes in Unix.
Process Scheduling-Basic concepts, Scheduling Criteria, Scheduling algorithms, Multiple-
A

Processor Scheduling, Real-Time Scheduling, Thread scheduling, Linux scheduling and

Windows scheduling.
Process Synchronization, Background, The Critical Section Problem, Peterson’s solution,
Synchronization Hardware, Semaphores, Classic Problems of Synchronization, Monitors,
Synchronization in Linux and Windows.
 UNIT - III
Memory Management and Virtual Memory – Memory Management Strategies- Background,
Swapping, Contiguous Memory Allocation, Segmentation, Paging, Structure of Page Table,
IA-32 Segmentation, IA-32 Paging.
Virtual Memory Management-Background, Demand Paging, Copy-on-Write, Page
Replacement, Page Replacement Algorithms, Allocation of Frames, Thrashing, Virtual

ld
memory in Windows..

UNIT - IV
Storage Management-File System- Concept of a File, System calls for file operations - open

or
(), read (), write (), close (), seek (), unlink (), Access methods, Directory and Disk Structure,
File System Mounting, File Sharing, Protection.
File System Implementation - File System Structure, File System Implementation, Directory
Implementation, Allocation methods, Free-space Management, Efficiency, and Performance.
Mass Storage Structure – Overview of Mass Storage Structure, Disk Structure, Disk

W
Attachment, Disk Scheduling, Disk Management, Swap space Management

UNIT - V
Deadlocks - System Model, Deadlock Characterization, Methods for Handling Deadlocks,
Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from
Deadlock.
Protection – System Protection, Goals of Protection, Principles of Protection, Domain of
TU
Protection, Access Matrix, Implementation of Access Matrix, Access Control, Revocation of
Access Rights, Capability-Based Systems, Language-Based Protection.

TEXT BOOKS:
1. Operating System Concepts , Abraham Silberschatz, Peter B. Galvin, Greg Gagne, 9th
Edition, Wiley, 2016 India Edition
JN

2. Operating Systems – Internals and Design Principles, W. Stallings, 7th Edition,

Pearson.

REFERENCE BOOKS:
1. Modern Operating Systems, Andrew S Tanenbaum, 3rd Edition, PHI
2. Operating Systems: A concept-based Approach, 2nd Edition, D.M. Dhamdhere,
TMH.
3. Principles of Operating Systems, B. L. Stuart, Cengage learning, India Edition.
ll

4. An Introduction to Operating Systems, P.C.P. Bhatt, PHI.

5. Principles of Operating systems, Naresh Chauhan, Oxford University Press.
A
 CS404ES: FORMAL LANGUAGES AND AUTOMATA THEORY

B.Tech. II Year II Sem. L T P C

3 0 0 3

Course Objectives:

ld
 To provide introduction to some of the central ideas of theoretical computer
science from the perspective of formal languages.
 To introduce the fundamental concepts of formal languages, grammars and
automata theory.
 Classify machines by their power to recognize languages.

or
 Employ finite state machines to solve problems in computing.
 To understand deterministic and non-deterministic machines.
 To understand the differences between decidability and undecidability.

Course Outcomes:

W
 Able to understand the concept of abstract machines and their power to recognize
the languages.
 Able to employ finite state machines for modeling and solving computing
problems.
 Able to design context free grammars for formal languages.
 Able to distinguish between decidability and undecidability.
 Able to gain proficiency with mathematical tools and formal methods.
TU
UNIT - I
Introduction to Finite Automata, Structural Representations, Automata and Complexity, the
Central Concepts of Automata Theory – Alphabets, Strings, Languages, Problems.
Deterministic Finite Automata, Nondeterministic Finite Automata, an application: Text
Search, Finite Automata with Epsilon-Transitions.
JN

UNIT - II
Regular Expressions, Finite Automata and Regular Expressions, Applications of Regular
Expressions, Algebraic Laws for Regular Expressions, Properties of Regular Languages-
Pumping Lemma for Regular Languages, Applications of the Pumping Lemma, Closure
Properties of Regular Languages, Decision Properties of Regular Languages, Equivalence
and Minimization of Automata.
UNIT - III
ll

Context-Free Grammars: Definition of Context-Free Grammars, Derivations Using a

Grammar, Leftmost and Rightmost Derivations, the Language of a Grammar, Sentential
Forms, Parse Tress, Applications of Context-Free Grammars, Ambiguity in Grammars and
A

Languages.
Push Down Automata,: Definition of the Pushdown Automaton, the Languages of a PDA,
Equivalence of PDA's and CFG's, Deterministic Pushdown Automata.
 UNIT - IV
Normal Forms for Context- Free Grammars, the Pumping Lemma for Context-Free
Languages, Closure Properties of Context-Free Languages. Decision Properties of CFL's -
Complexity of Converting among CFG's and PDA's, Running time of conversions to
Chomsky Normal Form.
Introduction to Turing Machines-Problems That Computers Cannot Solve, The Turing

ld
Machine, Programming Techniques for Turing Machines, Extensions to the basic Turing
machine, Restricted Turing Machines, Turing Machines, and Computers

UNIT - V

or
Undecidability: A Language that is Not Recursively Enumerable, An Undecidable Problem
That is RE, Undecidable Problems about Turing Machines, Post's Correspondence Problem,
Other Undecidable Problems, Intractable Problems: The Classes P and NP, An NP-Complete
Problem.

W
TEXT BOOKS:
1. Introduction to Automata Theory, Languages, and Computation, 3 nd Edition, John E.
Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage
Learning.

REFERENCE BOOKS:
TU
1. Introduction to Languages and The Theory of Computation, John C Martin, TMH.
2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
3. A Text book on Automata Theory, P. K. Srimani, Nasir S. F. B, Cambridge
University Press.
4. Introduction to Formal languages Automata Theory and Computation Kamala
Krithivasan, Rama R, Pearson.
5. Theory of Computer Science – Automata languages and computation, Mishra and
Chandrashekaran, 2nd edition, PHI.
JN
ll
A
 SM405ES: BUSINESS ECONOMICS AND FINANCIAL ANALYSIS

B.Tech. II Year II Sem. L T P C

3 0 0 3

Course Objective: To learn the basic Business types, impact of the Economy on Business

ld
and Firms specifically. To analyze the Business from the Financial Perspective.

Course Outcome: The students will understand the various Forms of Business and the
impact of economic variables on the Business. The Demand, Supply, Production, Cost,
Market Structure, Pricing aspects are learnt. The Students can study the firm’s financial

or
position by analysing the Financial Statements of a Company.

UNIT – I
Introduction to Business and Economics:
Business: Structure of Business Firm, Theory of Firm, Types of Business Entities, Limited

W
Liability Companies, Sources of Capital for a Company, Non-Conventional Sources of
Finance.
Economics: Significance of Economics, Micro and Macro Economic Concepts, Concepts
and Importance of National Income, Inflation, Money Supply in Inflation, Business Cycle,
Features and Phases of Business Cycle. Nature and Scope of Business Economics, Role of
Business Economist, Multidisciplinary nature of Business Economics.
TU
UNIT – II
Demand and Supply Analysis:
Elasticity of Demand: Elasticity, Types of Elasticity, Law of Demand, Measurement and
Significance of Elasticity of Demand, Factors affecting Elasticity of Demand, Elasticity of
Demand in decision making, Demand Forecasting: Characteristics of Good Demand
Forecasting, Steps in Demand Forecasting, Methods of Demand Forecasting.
JN

Supply Analysis: Determinants of Supply, Supply Function & Law of Supply.

UNIT- III
Production, Cost, Market Structures & Pricing:
Production Analysis: Factors of Production, Production Function, Production Function with
one variable input, two variable inputs, Returns to Scale, Different Types of Production
Functions.
ll

Cost analysis: Types of Costs, Short run and Long run Cost Functions.
Market Structures: Nature of Competition, Features of Perfect competition, Monopoly,
Oligopoly, and Monopolistic Competition.
A

Pricing: Types of Pricing, Product Life Cycle based Pricing, Break Even Analysis, and Cost
Volume Profit Analysis.
 UNIT - IV
Financial Accounting: Accounting concepts and Conventions, Accounting Equation,
Double-Entry system of Accounting, Rules for maintaining Books of Accounts, Journal,
Posting to Ledger, Preparation of Trial Balance, Elements of Financial Statements, and
Preparation of Final Accounts.

ld
UNIT - V
Financial Analysis through Ratios: Concept of Ratio Analysis, Liquidity Ratios, Turnover
Ratios, Profitability Ratios, Proprietary Ratios, Solvency, Leverage Ratios (simple problems).
Introduction to Fund Flow and Cash Flow Analysis (simple problems).

or
TEXT BOOKS:
1. D. D. Chaturvedi, S. L. Gupta, Business Economics - Theory and Applications,
International Book House Pvt. Ltd. 2013.
2. Dhanesh K Khatri, Financial Accounting, Tata McGraw Hill, 2011.
3. Geethika Ghosh, Piyali Gosh, Purba Roy Choudhury, Managerial Economics, 2e,

W
Tata McGraw Hill Education Pvt. Ltd. 2012.

REFERENCES:
1. Paresh Shah, Financial Accounting for Management 2e, Oxford Press, 2015.
2. S. N. Maheshwari, Sunil K Maheshwari, Sharad K Maheshwari, Financial
Accounting, 5e, Vikas Publications, 2013.
TU
JN
ll
A
 CS406ES: COMPUTER ORGANIZATION LAB

B.Tech. II Year II Sem. L T P C

0 0 3 2

Exercises in Digital Logic Design:

ld
1. Implement Logic gates using NAND and NOR gates
2. Design a Full adder using gates
3. Design and implement the 4:1 MUX, 8:1 MUX using gates /ICs.
4. Design and Implement a 3 to 8 decoder using gates

or
5. Design a 4 bit comparator using gates/IC
6. Design and Implement a 4 bit shift register using Flip flops
7. Design and Implement a Decade counter

Exercises in Micro Processor programming:

Write assembly language programs for the following using GNU Assembler.

W
1. Write assembly language programs to evaluate the expressions:
i) a = b + c – d * e
ii) z = x * y + w – v +u / k
a. Considering 8-bit, 16 bit and 32 bit binary numbers as b, c, d, e.
b. Considering 2 digit, 4 digit and 8 digit BCD numbers.
Take the input in consecutive memory locations and also Display the results by using
TU
“int xx” of 8086. Validate program for the boundary conditions.
2. Write an ALP of 8086 to take N numbers as input. And do the following operations on
them.
a. Arrange in ascending and descending order.
3. Write an ALP of 8086 to take N numbers as input. And do the following operations on
them.
JN

a. Find max and minimum

b. Find average
Considering 8-bit, 16 bit binary numbers and 2 digit, 4digit and 8 digit BCD numbers.
Display the results by using “int xx” of 8086. Validate program for the boundary
conditions.
4. Write an ALP of 8086 to take a string of as input (in ‘C’ format)and do the following
Operations on it.
a. Find the length
ll

b. Find it is Palindrome or n.
Considering 8-bit, 16 bit binary numbers and 2 digit, 4digit and 8 digit BCD numbers.
Display the results by using “int xx” of 8086. Validate program for the boundary
A

conditions.

5. Write an ALP of 8086 to take a string of as input (in ‘C’ format) and do the following
Operations on it.
a. Find whether given string substring or not.
 6. Write an ALP of 8086 to take a string of as input (in ‘C’ format) and do the following
Operations on it
a. Find the Armstrong number
b. Find the Fibonacci series for n numbers
Display the results by using “int xx” of 8086.

ld
7. Write the ALP to implement the above operations as procedures and call from the main
procedure.

8. Write an ALP of 8086 to find the factorial of a given number as a Procedure and call from
the main program which display the result.

or
REFERENCE BOOKS:
1. Switching theory and logic design –A. Anand Kumar PHI, 2013
2. Advanced microprocessor & Peripherals-A. K. Ray and K. M. Bherchandavi, TMH,
2nd edition.

W
3. Switching and Finite Automatic theory-Zvi Kohavi, Niraj K.Jha Cambridge, 3rd
edition
4. Digital Design –Morris Mano, PHI, 3rd edition
5. Microprocessor and Interfacing –Douglas V. Hall, TMGH 2nd edition.
TU
JN
ll
A
 CS407ES: DATABASE MANAGEMENT SYSTEMS LAB

B.Tech. II Year II Sem. L T P C

0 0 3 2

Course Objectives: This lab enables the students to practice the concepts learnt in the subject

ld
DBMS by developing a database for an example company named “Roadway Travels” whose
description is as follows. The student is expected to practice the designing, developing and
querying a database in the context of example database “Roadway travels”. Students are
expected to use “Mysql” database.

or
Course Outcomes:
 Ability to design and implement a database schema for given problem.
 Apply the normalization techniques for development of application software to
realistic problems.
 Ability to formulate queries using SQL DML/DDL/DCL commands.

W
Roadway Travels: "Roadway Travels" is in business since 1997 with several buses
connecting different places in India. Its main office is located in Hyderabad.

The company wants to computerize its operations in the following areas:

 Reservations and Ticketing
TU
 Cancellations

Reservations & Cancellation: Reservations are directly handled by booking office.

Reservations can be made 30 days in advance and tickets issued to passenger. One
Passenger/person can book many tickets (to his/her family).
Cancellations are also directly handed at the booking office.
JN

In the process of computerization of Roadway Travels you have to design and develop a
Database which consists the data of Buses, Passengers, Tickets, and Reservation and
cancellation details. You should also develop query’s using SQL to retrieve the data from the
database.

The above process involves many steps like 1. Analyzing the problem and identifying the
Entities and Relationships, 2. E-R Model 3. Relational Model 4. Normalization 5.
ll

Creating the database 6. Querying. Students are supposed to work on these steps week wise
and finally create a complete “Database System” to Roadway Travels. Examples are given
at every experiment for guidance to students.
A

Experiment 1: E-R Model

Analyze the problem carefully and come up with the entities in it. Identify what data has to be
persisted in the database. This contains the entities, attributes etc.
 Identify the primary keys for all the entities. Identify the other keys like candidate keys,
partial keys, if any.
Example:
Entities: 1. BUS 2. Ticket 3. Passenger
Relationships: 1. Reservation 2. Cancellation
Primary Key Attributes: 1. Ticket ID (Ticket Entity) 2. Passport ID (Passenger Entity)

ld
3. Bus_NO (Bus Entity)
Apart from the above mentioned entities you can identify more. The above mentioned are
few.
Note: The student is required to submit a document by writing the Entities and Keys to the

or
lab teacher.

Experiment 2: Concept design with E-R Model

Relate the entities appropriately. Apply cardinalities for each relationship. Identify strong
entities and weak entities (if any). Indicate the type of relationships (total / partial). Try to

W
incorporate generalization, aggregation, specialization etc wherever required.

Example: E-R diagram for bus

Bus NO Source
TU
BUS Destination

Date of
Departu Journey
re Time Reserv
JN

Ticket ation
NO Sex
Destinati
Source on
Ticket
Departu
Age re Time
ll

Note: The student is required to submit a document by drawing the E-R Diagram to the lab
teacher.
A

Experiment 3: Relational Model

Represent all the entities (Strong, Weak) in tabular fashion. Represent relationships in a
tabular fashion. There are different ways of representing relationships as tables based on the
cardinality. Represent attributes as columns in tables or as tables based on the requirement.
 Different types of attributes (Composite, Multi-valued, and Derived) have different way of
representation.
Example: The passenger tables look as below. This is an example. You can add more
attributes based on your E-R model. This is not a normalized table.
Passenger
Name Age Sex Address Passport ID

ld
Ticket
_id

or
Note: The student is required to submit a document by Represent relationships in a tabular
fashion to the lab teacher.

W
Experiment 4: Normalization
Database normalization is a technique for designing relational database tables to minimize
duplication of information and, in so doing, to safeguard the database against certain types of
logical or structural problems, namely data anomalies. For example, when multiple instances
of a given piece of information occur in a table, the possibility exists that these instances will
not be kept consistent when the data within the table is updated, leading to a loss of data
TU
integrity. A table that is sufficiently normalized is less vulnerable to problems of this kind,
because its structure reflects the basic assumptions for when multiple instances of the same
information should be represented by a single instance only.

For the above table in the First normalization we can remove the multi valued attribute
Ticket_id and place it in another table along with the primary key of passenger.
JN

First Normal Form: The above table can be divided into two tables as shown below.
Passenger
Name Age Sex Address Passport ID
ll

Passport ID Ticket_id
A

You can do the second and third normal forms if required. Any how Normalized tables are
given at the end.
 Experiment 5: Installation of Mysql and practicing DDL commands
Installation of MySql. In this week you will learn Creating databases, How to create tables,
altering the database, dropping tables and databases if not required. You will also try
truncate, rename commands etc.

Example for creation of a normalized “Passenger” table.

ld
CREATE TABLE Passenger (
Passport_id INTEGER PRIMARY KEY,
Name VARCHAR (50) Not NULL,
Age Integer Not NULL,

or
Sex Char,
Address VARCHAR (50) Not NULL);

Similarly create all other tables.

W
Note: Detailed creation of tables is given at the end.

Experiment 6: Practicing DML commands

DML commands are used to for managing data within schema objects. Some examples:
 SELECT - retrieve data from the a database
 INSERT - insert data into a table
 UPDATE - updates existing data within a table
TU
 DELETE - deletes all records from a table, the space for the records remain

Inserting values into “Bus” table:

Insert into Bus values (1234,’hyderabad’, ‘tirupathi’);
Insert into Bus values (2345,’hyderabd’,’Banglore’);
Insert into Bus values (23,’hyderabd’,’Kolkata’);
JN

Insert into Bus values (45,’Tirupathi,’Banglore’);

Insert into Bus values (34,’hyderabd’,’Chennai’);

Inserting values into “Passenger” table:

Insert into Passenger values (1, 45,’ramesh’, 45,’M’,’abc123’);
Insert into Passenger values (2, 78,’geetha’, 36,’F’,’abc124’);
Insert into Passenger values (45, 90,’ram’, 30,’M’,’abc12’);
Insert into Passenger values (67, 89,’ravi’, 50,’M’,’abc14’);
ll

Insert into Passenger values (56, 22,’seetha’, 32,’F’,’abc55’);

Few more Examples of DML commands:

A

Select * from Bus; (selects all the attributes and display)

UPDATE BUS SET Bus No = 1 WHERE BUS NO=2;
 Experiment 7: Querying
In this week you are going to practice queries (along with sub queries) using ANY, ALL, IN,
Exists, NOT EXISTS, UNION, INTERSECT, Constraints etc.

Practice the following Queries:

1. Display unique PNR_no of all passengers.

ld
2. Display all the names of male passengers.
3. Display the ticket numbers and names of all the passengers.
4. Find the ticket numbers of the passengers whose name start with ‘r’ and ends with ‘h’.
5. Find the names of passengers whose age is between 30 and 45.
6. Display all the passengers names beginning with ‘A’

or
7. Display the sorted list of passengers names

Experiment 8 and Experiment 9: Querying (continued…)

You are going to practice queries using Aggregate functions (COUNT, SUM, AVG, and
MAX and MIN), GROUP BY, HAVING and Creation and dropping of Views.

W
1. Write a Query to display the Information present in the Passenger and cancellation
tables. Hint: Use UNION Operator.
2. Display the number of days in a week on which the 9W01 bus is available.
3. Find number of tickets booked for each PNR_no using GROUP BY CLAUSE. Hint:
Use GROUP BY on PNR_No.
4. Find the distinct PNR numbers that are present.
5. Find the number of tickets booked by a passenger where the number of seats is greater
TU
than 1. Hint: Use GROUP BY, WHERE and HAVING CLAUSES.
6. Find the total number of cancelled seats.

Experiment 10: Triggers

In this week you are going to work on Triggers. Creation of insert trigger, delete trigger,
update trigger. Practice triggers using the above database.
Eg: CREATE TRIGGER updcheck BEFORE UPDATE ON passenger
JN

FOR EACH ROW

BEGIN
IF NEW.TickentNO > 60 THEN
SET New.Tickent no = Ticket no;
ELSE
SET New.Ticketno = 0;
END IF;
END;
ll

Experiment 11: Procedures

In this session you are going to learn Creation of stored procedure, Execution of procedure
A

and modification of procedure. Practice procedures using the above database.

Eg: CREATE PROCEDURE myProc()
BEGIN
SELECT COUNT (Tickets) FROM Ticket WHERE age>=40;
End;
 Experiment 12: Cursors
In this week you need to do the following: Declare a cursor that defines a result set.
Open the cursor to establish the result set. Fetch the data into local variables as needed from
the cursor, one row at a time. Close the cursor when done

CREATE PROCEDURE myProc(in_customer_id INT)

ld
BEGIN
DECLARE v_id INT;
DECLARE v_name VARCHAR (30);
DECLARE c1 CURSOR FOR SELECT stdId,stdFirstname FROM students WHERE

or
stdId=in_customer_id;
OPEN c1;
FETCH c1 into v_id, v_name;
Close c1;
END;

W
Tables
BUS
Bus No: Varchar: PK (public key)
Source : Varchar
Destination : Varchar

Passenger
TU
PPNO: Varchar (15)) : PK
Name: Varchar (15)
Age : int (4)
Sex:Char (10) : Male / Female
Address: VarChar (20)
Passenger_Tickets
JN

PPNO: Varchar (15)) : PK

Ticket_No: Numeric (9)
Reservation
PNR_No: Numeric (9) : FK
Journey_date : datetime (8)
No_of_seats : int (8)
Address: Varchar (50)
Contact_No: Numeric (9) --> Should not be less than 9 and Should not accept any other
ll

character other than Integer

Status: Char (2) : Yes / No
A

Cancellation
PNR_No: Numeric(9) : FK
Journey_date : datetime(8)
No_of_seats : int (8)
Address : Varchar (50)
 Contact_No: Numeric (9) --> Should not be less than 9 and Should not accept any other
character other than Integer
Status: Char (2) : Yes / No

Ticket
Ticket_No: Numeric (9): PK

ld
Journey_date : datetime(8)
Age : int (4)
Sex:Char(10) : Male / Female
Source : Varchar

or
Destination : Varchar
Dep_time : Varchar

REFERENCE BOOKS:
1. Introduction to SQL, Rick F. Vander Lans, Pearson education.

W
2. Oracle PL/SQL, B. Rosenzweig and E. Silvestrova, Pearson education.
3. SQL & PL/SQL for Oracle 10 g, Black Book, Dr. P. S. Deshpande, Dream Tech.
4. Oracle Database 11 g PL/SQL Programming, M. Mc Laughlin, TMH.
TU
JN
ll
A
 CS408ES: OPERATING SYSTEMS LAB

B.Tech. II Year II Sem. L T P C

0 0 3 2
Course Objectives:
 To write programs in Linux environment using system calls.

ld
 To implement the scheduling algorithms.
 To implement page replacement algorithms
 To implement file allocation methods.
 To understand and implement ipc mechanism using named and unnamed pipes.
 To develop solutions for synchronization problems using semaphores.

or
Course Outcomes:
 Ability to develop application programs using system calls in Unix.
 Ability to implement interprocess communication between two processes.
 Ability to design and solve synchronization problems.
 Ability to simulate and implement operating system concepts such as scheduling,

W
deadlock management, file management, and memory management.

Use Linux operating system and GNU C compiler.

List of Programs:
1. Write C programs to simulate the following CPU scheduling algorithms:
a) Round Robin b) SJF
2. Write C programs to simulate the following CPU scheduling algorithms:
TU
a) FCFS b) Priority
3. Write C programs to simulate the following File organization techniques:
a) Single level directory b) Two level c) Hierarchical
4. Write C programs to simulate the following File allocation methods:
a)Contiguous b)Linked c)Indexed
5. Write a C program to copy the contents of one file to another using system calls.
JN

6. Write a C program to simulate Bankers Algorithm for Dead Lock Avoidance

7. Write a C program to simulate Bankers Algorithm for Dead Lock Prevention
8. Write C programs to simulate the following page replacement algorithms:
a) FIFO b) LRU c) LFU
9. Write C programs to simulate the following techniques of memory management:
a) Paging b) Segmentation
10. Write a C program to implement the ls | sort command. (Use unnamed Pipe)
11. Write a C program to solve the Dining- Philosopher problem using semaphores.
ll

12. Write C programs to implement ipc between two unrelated processes using named pipe.

REFERENCE BOOKS:
A

1. An Introduction to Operating Systems, P.C.P Bhatt, 2 nd edition, PHI.

2. Unix System Programming Using C++, Terrence Chan, PHI/Pearson.
3. Modern Operating Systems, Andrew S Tanenbaum, 3rd Edition, PHI
 MC400HS: GENDER SENSITIZATION LAB

B.Tech. II Year II Sem. L T P C

0 0 3 0
Course Objectives:
 To develop students’ sensibility with regard to issues of gender in contemporary

ld
India.
 To provide a critical perspective on the socialization of men and women.
 To introduce students to information about some key biological aspects of genders.
 To expose the students to debates on the politics and economics of work.

or
 To help students reflect critically on gender violence.
 To expose students to more egalitarian interactions between men and women.

Course Outcomes:
 Students will have developed a better understanding of important issues related to

W
gender in contemporary India.
 Students will be sensitized to basic dimensions of the biological, sociological,
psychological and legal aspects of gender. This will be achieved through discussion of
materials derived from research, facts, everyday life, literature, and film.
 Students will attain a finer grasp of how gender discrimination works in our society
and how to counter it.
 Students will acquire insight into the gendered division of labour and its relation to
TU
politics and economics.
 Men and women students and professionals will be better equipped to work and live
together as equals.
 Students will develop a sense of appreciation of women in all walks of life.
 Through providing accounts of studies and movements as well as the new laws that
provide protection and relief to women, the textbook will empower students to
JN

understand and respond to gender violence.

UNIT - I
UNDERSTANDING GENDER
Gender: Why Should We Study It? (Towards a World of Equals: Unit -1)
Socialization: Making Women, Making Men (Towards a World of Equals: Unit -2)
Introduction. Preparing for Womanhood. Growing up Male. First lessons in Caste. Different
ll

Masculinities.

UNIT - II
A

GENDER AND BIOLOGY:

Missing Women: Sex Selection and Its Consequences (Towards a World of Equals: Unit -4)
Declining Sex Ratio. Demographic Consequences.
Gender Spectrum: Beyond the Binary (Towards a World of Equals: Unit -10)
Two or Many? Struggles with Discrimination.
 UNIT - III
GENDER AND LABOUR
Housework: the Invisible Labour (Towards a World of Equals: Unit -3)
“My Mother doesn’t Work.” “Share the Load.”
Women’s Work: Its Politics and Economics (Towards a World of Equals: Unit -7)
Fact and Fiction. Unrecognized and Unaccounted work. Additional Reading: Wages and

ld
Conditions of Work.

UNIT-IV
ISSUES OF VIOLENCE

or
Sexual Harassment: Say No! (Towards a World of Equals: Unit -6)
Sexual Harassment, not Eve-teasing- Coping with Everyday Harassment- Further Reading:
“Chupulu”.
Domestic Violence: Speaking Out (Towards a World of Equals: Unit -8)
Is Home a Safe Place? -When Women Unite [Film]. Rebuilding Lives. Additional Reading:

W
New Forums for Justice.
Thinking about Sexual Violence (Towards a World of Equals: Unit -11)
Blaming the Victim-“I Fought for my Life….” - Additional Reading: The Caste Face of
Violence.

UNIT - V
GENDER: CO - EXISTENCE
TU
Just Relationships: Being Together as Equals (Towards a World of Equals: Unit -12)
Mary Kom and Onler. Love and Acid just do not Mix. Love Letters. Mothers and Fathers.
Additional Reading: Rosa Parks-The Brave Heart.

TEXTBOOK
All the five Units in the Textbook, “Towards a World of Equals: A Bilingual Textbook on
JN

Gender” written by A. Suneetha, Uma Bhrugubanda, Duggirala Vasanta, Rama Melkote,

Vasudha Nagaraj, Asma Rasheed, Gogu Shyamala, Deepa Sreenivas and Susie Tharu and
published by Telugu Akademi, Hyderabad,Telangana State in the year 2015.

Note: Since it is an Interdisciplinary Course, Resource Persons can be drawn from the fields
of English Literature or Sociology or Political Science or any other qualified faculty who has
expertise in this field from engineering departments.
ll

REFERENCE BOOKS:
1. Menon, Nivedita. Seeing like a Feminist. New Delhi: Zubaan-Penguin Books, 2012
2. Abdulali Sohaila. “I Fought For My Life…and Won.”Available online at:
A

http://www.thealternative.in/lifestyle/i-fought-for-my-lifeand-won-sohaila-abdulal/
 R16 B.TECH CSE.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B.TECH. COMPUTER SCIENCE AND ENGINEERING

III YEAR COURSE STRUCTURE & SYLLABUS (R16)

Applicable From 2016-17 Admitted Batch

ld
III YEAR I SEMESTER

Course
S. No Course Title L T P Credits
Code

or
1 CS501PC Design and Analysis of Algorithms 4 0 0 4
2 CS502PC Data Communication and Computer Networks 4 0 0 4
3 CS503PC Software Engineering 4 0 0 4
4 SM504MS Fundamentals of Management 3 0 0 3
5 Open Elective –I 3 0 0 3

W
6 CS505PC Design and Analysis of Algorithms Lab 0 0 3 2
7 CS506PC Computer Networks Lab 0 0 3 2
8 CS507PC Software Engineering Lab 0 0 3 2
9 *MC500HS Professional Ethics 3 0 0 0
Total Credits 21 0 9 24
TU
III YEAR II SEMESTER

Course
S. No Course Title L T P Credits
Code
1 CS601PC Compiler Design 4 0 0 4
2 CS602PC Web Technologies 4 0 0 4
JN

3 CS603PC Cryptography and Network Security 4 0 0 4

4 Open Elective-II 3 0 0 3
5 Professional Elective-I 3 0 0 3
6 CS604PC Cryptography and Network Security Lab 0 0 3 2
7 CS605PC Web Technologies Lab 0 0 3 2
8 EN606HS Advanced English Communication Skills Lab 0 0 3 2
Total Credits 18 0 9 24
ll

During Summer Vacation between III and IV Years: Industry Oriented Mini Project
A
 R16 B.TECH CSE.

Professional Elective – I

CS611PE Mobile Computing

CS612PE Design Patterns
CS613PE Artificial Intelligence
CS614PE Information Security Management (Security Analyst - I)

ld
CS615PE Introduction to Analytics (Associate Analytics - I)

*Open Elective subjects’ syllabus is provided in a separate document.

*Open Elective – Students should take Open Electives from the List of Open Electives

or
Offered by Other Departments/Branches Only.

Ex: - A Student of Mechanical Engineering can take Open Electives from all other
departments/branches except Open Electives offered by Mechanical Engineering Dept.

W
TU
JN
ll
A
 R16 B.TECH CSE.

DESIGN AND ANALYSIS OF ALGORITHMS

B.Tech. III Year I Sem. L T P C

Course Code: CS501PC 4 0 0 4

Course Objectives

ld
 To analyze performance of algorithms.
 To choose the appropriate data structure and algorithm design method for a specified
application.
 To understand how the choice of data structures and algorithm design methods

or
impacts the performance of programs.
 To solve problems using algorithm design methods such as the greedy method, divide
and conquer, dynamic programming, backtracking and branch and bound.
 To understand the differences between tractable and intractable problems.
 To introduce P and NP classes.

W
Course Outcomes:
 Ability to analyze the performance of algorithms.
 Ability to choose appropriate algorithm design techniques for solving problems.
 Ability to understand how the choice of data structures and the algorithm design
methods impact the performance of programs.
TU
UNIT - I
Introduction-Algorithm definition, Algorithm Specification, Performance Analysis-Space
complexity, Time complexity, Randomized Algorithms.
Divide and conquer- General method, applications - Binary search, Merge sort, Quick sort,
Strassen’s Matrix Multiplication.
JN

UNIT - II
Disjoint set operations, union and find algorithms, AND/OR graphs, Connected Components
and Spanning trees, Bi-connected components Backtracking-General method, applications-
The 8-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.

UNIT - III
Greedy method- General method, applications- Knapsack problem, Job sequencing with
ll

deadlines, Minimum cost spanning trees, Single source shortest path problem.

UNIT - IV
A

Dynamic Programming- General Method, applications- Chained matrix multiplication, All

pairs shortest path problem, Optimal binary search trees, 0/1 knapsack problem, Reliability
design, Traveling sales person problem.
 R16 B.TECH CSE.

UNIT - V
Branch and Bound- General Method, applications-0/1 Knapsack problem, LC Branch and
Bound solution, FIFO Branch and Bound solution, Traveling sales person problem.
NP-Hard and NP-Complete problems- Basic concepts, Non-deterministic algorithms, NP -
Hard and NP- Complete classes, Cook’s theorem.

ld
TEXT BOOKS:
1. Fundamentals of Computer Algorithms, 2nd Edition, Ellis Horowitz, Sartaj Sahni and
S. Rajasekharan, Universities Press.
2. Design and Analysis of Algorithms, P. H. Dave, H.B.Dave,2nd edition, Pearson

or
Education.

REFERENCE BOOKS
1. Algorithm Design: Foundations, Analysis and Internet examples, M. T. Goodrich and
R. Tomassia, John Wiley and sons.

W
2. Design and Analysis of Algorithms, S. Sridhar, Oxford Univ. Press
3. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson Education.
4. Foundations of Algorithms,, R. Neapolitan and K. Naimipour, 4th edition, Jones and
Bartlett Student edition.
5. Introduction to Algorithms,3 rd Edition, T. H. Cormen, C. E.Leiserson, R. L. Rivest,
and C. Stein, PHI
TU
JN
ll
A
 R16 B.TECH CSE.

DATA COMMUNICATION AND COMPUTER NETWORKS

B.Tech. III Year I Sem. L T P C

Course Code: CS502PC 4 0 0 4

Course Objectives:

ld
 To introduce the fundamental various types of computer networks.
 To demonstrate the TCP/IP and OSI models with merits and demerits.
 To explore the various layers of OSI Model.
 To introduce UDP and TCP Models.

or
Course Outcomes:
 Students should be understand and explore the basics of Computer Networks and
Various Protocols. He/She will be in a position to understand the World Wide Web
concepts.

W
 Students will be in a position to administrate a network and flow of information
further he/she can understand easily the concepts of network security, Mobile and ad
hoc networks.

UNIT – I
Data Communications: Components – Direction of Data flow – Networks – Components
and Categories – Types of Connections – Topologies –Protocols and Standards – ISO / OSI
TU
model, Example Networks such as ATM, Frame Relay, ISDN Physical layer: Transmission
modes, Multiplexing, Transmission Media, Switching, Circuit Switched Networks, Datagram
Networks, Virtual Circuit Networks.

UNIT – II
Data link layer: Introduction, Framing, and Error – Detection and Correction – Parity – LRC
JN

– CRC Hamming code, Flow and Error Control, Noiseless Channels, Noisy Channels,
HDLC, Point to Point Protocols. 111 Medium Access sub layer: ALOHA, CSMA/CD, LAN
– Ethernet IEEE 802.3, IEEE 802.5 – IEEE 802.11, Random access, Controlled access,
Channelization.

UNIT – III
Network layer: Logical Addressing, Internetworking, Tunneling, Address mapping, ICMP,
IGMP, Forwarding, Uni-Cast Routing Protocols, Multicast Routing Protocols.
ll

UNIT – IV
Transport Layer: Process to Process Delivery, UDP and TCP protocols, Data Traffic,
A

Congestion, Congestion Control, QoS, Integrated Services, Differentiated Services, QoS in

Switched Networks.
 R16 B.TECH CSE.

UNIT – V
Application Layer: Domain name space, DNS in internet, electronic mail, SMTP, FTP,
WWW, HTTP, SNMP.

TEXT BOOKS:
1. Data Communications and Networking, Behrouz A. Forouzan , Fourth Edition TMH,

ld
2006.
2. Computer Networks, Andrew S Tanenbaum, 4th Edition. Pearson Education, PHI.

REFERENCES:

or
1. Data communications and Computer Networks, P.C .Gupta, PHI.
2. An Engineering Approach to Computer Networks, S. Keshav, 2 nd Edition, Pearson
Education.
3. Understanding communications and Networks, 3 rd Edition, W.A. Shay, Cengage
Learning.

W
4. Computer Networking: A Top-Down Approach Featuring the Internet. James F.
Kurose & Keith W. Ross, 3 rd Edition, Pearson Education.
5. Data and Computer Communication, William Stallings, Sixth Edition, Pearson
Education, 2000
TU
JN
ll
A
 R16 B.TECH CSE.

SOFTWARE ENGINEERING

B.Tech. III Year I Sem. L T P C

Course Code: CS503PC 4 0 0 4

Course Objectives:

ld
 To understanding of software process models such as waterfall and evolutionary
models.
 To understanding of software requirements and SRS document.
 To understanding of different software architectural styles.

or
 To understanding of software testing approaches such as unit testing and integration
testing.
 To understanding on quality control and how to ensure good quality software.

Course Outcomes:

W
 Ability to identify the minimum requirements for the development of application.
 Ability to develop, maintain, efficient, reliable and cost effective software solutions
 Ability to critically thinking and evaluate assumptions and arguments.

UNIT- I
Introduction to Software Engineering: The evolving role of software, Changing Nature of
TU
Software, legacy software, Software myths.
A Generic view of process: Software engineering- A layered technology, a process
framework, The Capability Maturity Model Integration (CMMI), Process patterns, process
assessment, personal and team process models.
Process models: The waterfall model, Incremental process models, Evolutionary process
models, Specialized process models, The Unified process.
JN

UNIT- II
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 models, Data models, Object models, structured
methods.
ll

UNIT- III
Design Engineering: Design process and Design quality, Design concepts, the design model,
A

pattern based software design.

Creating an architectural design: software architecture, Data design, Architectural styles and
patterns, Architectural Design, assessing alternative architectural designs, mapping data flow
into a software architecture.
 R16 B.TECH CSE.

Modeling component-level design: Designing class-based components, conducting

component-level design, object constraint language, designing conventional components.
Performing User interface design: Golden rules, User interface analysis, and design, interface
analysis, interface design steps, Design evaluation.

UNIT- IV

ld
Testing Strategies: A strategic approach to software testing, test strategies for conventional
software, Black-Box and White-Box testing, Validation testing, System testing, the art of
Debugging.
Product metrics: Software Quality, Frame work for Product metrics, Metrics for Analysis

or
Model, Metrics for Design Model, Metrics for source code, Metrics for testing, Metrics for
maintenance.
Metrics for Process and Products: Software Measurement, Metrics for software quality.

UNIT- V

W
Risk management: Reactive vs Proactive Risk strategies, software risks, Risk identification,
Risk projection, Risk refinement, RMMM, RMMM Plan.
Quality Management: Quality concepts, Software quality assurance, Software Reviews,
Formal technical reviews, Statistical Software quality Assurance, Software reliability, The
ISO 9000 quality standards.

TEXT BOOKS:
TU
1. Software engineering A practitioner’s Approach, Roger S Pressman, sixth edition
McGraw Hill International Edition.
2. Software Engineering, Ian Sommerville, seventh edition, Pearson education.

REFERENCE BOOKS:
1. Software Engineering, A Precise Approach, Pankaj Jalote, Wiley India, 2010.
JN

2. Software Engineering : A Primer, Waman S Jawadekar, Tata McGraw-Hill, 2008

3. Fundamentals of Software Engineering, Rajib Mall, PHI, 2005
4. Software Engineering, Principles and Practices, Deepak Jain, Oxford University
Press.
5. Software Engineering1: Abstraction and modeling, Diner Bjorner, Springer
International edition, 2006.
6. Software Engineering2: Specification of systems and languages, Diner Bjorner,
Springer International edition 2006.
ll

7. Software Engineering Foundations, Yingxu Wang, Auerbach Publications, 2008.

8. Software Engineering Principles and Practice, Hans Van Vliet, 3 rd edition, John
Wiley &Sons Ltd.
A

9. Software Engineering 3: Domains, Requirements, and Software Design, D. Bjorner,

Springer International Edition.
10. Introduction to Software Engineering, R. J. Leach, CRC Press.
 R16 B.TECH CSE.

FUNDAMENTALS OF MANAGEMENT

B.Tech. III Year I Sem. L T P C

Course Code: SM504MS 3 0 0 3

Course Objective: To understand the Management Concepts, applications of Concepts in

ld
Practical aspects of business and development of Managerial Skills.

Course Outcome: The students understand the significance of Management in their

Profession. The various Management Functions like Planning, Organizing, Staffing, Leading,
Motivation and Control aspects are learnt in this course. The students can explore the

or
Management Practices in their domain area.

UNIT - I
Introduction to Management: Definition, Nature and Scope, Functions, Managerial Roles,
Levels of Management, Managerial Skills, Challenges of Management; Evolution of

W
Management- Classical Approach- Scientific and Administrative Management; The
Behavioral approach; The Quantitative approach; The Systems Approach; Contingency
Approach, IT Approach.

UNIT - II
Planning and Decision Making: General Framework for Planning - Planning Process, Types
TU
of Plans, Management by Objectives; Development of Business Strategy. Decision making
and Problem Solving - Programmed and Non Programmed Decisions, Steps in Problem
Solving and Decision Making; Bounded Rationality and Influences on Decision Making;
Group Problem Solving and Decision Making, Creativity and Innovation in Managerial
Work.

UNIT - III
JN

Organization and HRM: Principles of Organization: Organizational Design &

Organizational Structures; Departmentalization, Delegation; Empowerment, Centralization,
Decentralization, Recentralization; Organizational Culture; Organizational Climate and
Organizational Change.
Human Resource Management & Business Strategy: Talent Management, Talent
Management Models and Strategic Human Resource Planning; Recruitment and Selection;
Training and Development; Performance Appraisal.
ll

UNIT - IV
Leading and Motivation: Leadership, Power and Authority, Leadership Styles; Behavioral
A

Leadership, Situational Leadership, Leadership Skills, Leader as Mentor and Coach,

Leadership during adversity and Crisis; Handling Employee and Customer Complaints, Team
Leadership.
 R16 B.TECH CSE.

Motivation - Types of Motivation; Relationship between Motivation, Performance and

Engagement, Content Motivational Theories - Needs Hierarchy Theory, Two Factor Theory,
Theory X and Theory Y.

UNIT - V
Controlling: Control, Types and Strategies for Control, Steps in Control Process, Budgetary

ld
and Non- Budgetary Controls. Characteristics of Effective Controls, Establishing control
systems, Control frequency and Methods.

Text Books:

or
1. Management Fundamentals, Robert N Lussier, 5e, Cengage Learning, 2013.
2. Fundamentals of Management, Stephen P. Robbins, Pearson Education, 2009.

References:
1. Essentials of Management, Koontz Kleihrich, Tata McGraw Hill.

W
2. Management Essentials, Andrew DuBrin, 9e, Cengage Learning, 2012.
TU
JN
ll
A
 R16 B.TECH CSE.

DESIGN AND ANALYSIS OF ALGORITHMS LAB

B.Tech. III Year I Sem. L T P C

Course Code: CS505PC 0 0 3 2

Course Objectives:

ld
 To write programs in java to solve problems using divide and conquer strategy.
 To write programs in java to solve problems using backtracking strategy.
 To write programs in java to solve problems using greedy and dynamic programming
techniques.

or
Course Outcomes:
 Ability to write programs in java to solve problems using algorithm design techniques
such as Divide and Conquer, Greedy, Dynamic programming, and Backtracking.

W
List of Experiments:

1. Write a java program to implement Quick sort algorithm for sorting a list of integers
in ascending order
2. Write a java program to implement Merge sort algorithm for sorting a list of integers
in ascending order.
3. i) Write a java program to implement the dfs algorithm for a graph.
TU
4. ii) Write a. java program to implement the bfs algorithm for a graph.
5. Write a java programs to implement backtracking algorithm for the N-queens
problem.
6. Write a java program to implement the backtracking algorithm for the sum of subsets
problem.
7. Write a java program to implement the backtracking algorithm for the Hamiltonian
Circuits problem.
JN

8. Write a java program to implement greedy algorithm for job sequencing with
deadlines.
9. Write a java program to implement Dijkstra’s algorithm for the Single source shortest
path problem.
10. Write a java program that implements Prim’s algorithm to generate minimum cost
spanning tree.
11. Write a java program that implements Kruskal’s algorithm to generate minimum cost
ll

spanning tree
12. Write a java program to implement Floyd’s algorithm for the all pairs shortest path
problem.
A

13. Write a java program to implement Dynamic Programming algorithm for the 0/1
Knapsack problem.
14. Write a java program to implement Dynamic Programming algorithm for the Optimal
Binary Search Tree Problem.
 R16 B.TECH CSE.

REFERENCE BOOKS
1. Data structures, Algorithms and Applications in java, 2nd Edition, S. Sahani,
Universities Press.
2. Data structures and Algorithms in java, 3rd edition, A. Drozdek, Cengage Learning.
3. Data structures with Java, J. R. Hubbard, 2nd edition, Schaum’s Outlines, TMH.
4. Data structures and algorithms in Java, 2 nd Edition, R. Lafore, Pearson Education.

ld
5. Data Structures using Java, D. S. Malik and P.S. Nair, Cengage Learning.

or
W
TU
JN
ll
A
 R16 B.TECH CSE.

COMPUTER NETWORKS LAB

B.Tech. III Year I Sem. L T P C

Course Code: CS506PC 0 0 3 2

Course Objectives:

ld
 To Understand the functionalities of various layers of OSI model
 To understand the operating System functionalities

Course Outcomes:

or
 Ability to understand the encryption and decryption concepts in Linux environment
 Ability to apply appropriate algorithm for the finding of shortest route.
 Ability to configure the routing table

System/ Software Requirement

W
 Intel based desktop PCs LAN CONNECTED with minimum of 166 MHZ or faster
processor with at least 64 MB RAM and 100 MB free disk space

Computer Networks Lab:

1. Implement the data link layer framing methods such as character, character stuffing,
and bit stuffing.
2. Implement on a data set of characters the three CRC polynomials – CRC 12, CRC 16
TU
and CRC CCIP .
3. Implement Dijkstra‘s algorithm to compute the Shortest path thru a graph.
4. Take an example subnet graph with weights indicating delay between nodes. Now
obtain Routing table art each node using distance vector routing algorithm
5. Take an example subnet of hosts. Obtain broadcast tree for it.
6. Take a 64 bit playing text and encrypt the same using DES algorithm.
JN

7. Write a program to break the above DES coding

8. Using RSA algorithm encrypts a text data and Decrypt the same.
ll
A
 R16 B.TECH CSE.

SOFTWARE ENGINEERING LAB

B.Tech. III Year I Sem. L T P C

Course Code: CS507PC 0 0 3 2

Course Objectives:

ld
 To understand the software engineering methodologies involved in the phases for
project development.
 To gain knowledge about open source tools used for implementing software
engineering methods.

or
 To exercise developing product-startups implementing software engineering methods.
 Open source Tools: StarUML / UMLGraph / Topcased

Prepare the following documents and develop the software project startup, prototype model,
using software engineering methodology for at least two real time scenarios or for the sample

W
experiments.

 Problem Analysis and Project Planning -Thorough study of the problem – Identify
Project scope, Objectives and Infrastructure.

 Software Requirement Analysis – Describe the individual Phases/modules of the

project and Identify deliverables. Identify functional and non-functional requirements.
TU
 Data Modeling – Use work products – data dictionary.

 Software Designing - Develop use case diagrams and activity diagrams, build and test
class diagrams, sequence diagrams and add interface to class diagrams.

 Prototype model – Develop the prototype of the product.

JN

The SRS and prototype model should be submitted for end semester examination.

List of Sample Experiments:

1. Course management system (CMS)

A course management system (CMS) is a collection of software tools providing an online
environment for course interactions. A CMS typically includes a variety of online tools and
ll

environments, such as:

 An area for faculty posting of class materials such as course syllabus and handouts
 An area for student posting of papers and other assignments
A

 A grade book where faculty can record grades and each student can view his or her
grades
 An integrated email tool allowing participants to send announcement email messages
to the entire class or to a subset of the entire class
 A chat tool allowing synchronous communication among class participants
 R16 B.TECH CSE.

 A threaded discussion board allowing asynchronous communication among

participants

In addition, a CMS is typically integrated with other databases in the university so that
students enrolled in a particular course are automatically registered in the CMS as
participants in that course.

ld
The Course Management System (CMS) is a web application for department personnel,
Academic Senate, and Registrar staff to view, enter, and manage course information formerly
submitted via paper.

or
Departments can use CMS to create new course proposals, submit changes for existing
courses, and track the progress of proposals as they move through the stages of online
approval.

2. Easy Leave

W
This project is aimed at developing a web based Leave Management Tool, which is of
importance to either an organization or a college.
The Easy Leave is an Intranet based application that can be accessed throughout the
organization or a specified group/Dept. This system can be used to automate the workflow of
leave applications and their approvals. The periodic crediting of leave is also automated.
There are features like notifications, cancellation of leave, automatic approval of leave, report
generators etc in this Tool.
TU
Functional components of the project:
There are registered people in the system. Some are approvers. An approver can also be a
requestor. In an organization, the hierarchy could be Engineers/Managers/Business
Managers/Managing Director etc. In a college, it could be Lecturer/Professor/Head of the
Department/Dean/Principal etc.
JN

Following is a list of functionalities of the system: A person should be able to

 login to the system through the first page of the application
 change the password after logging into the system
 see his/her eligibility details (like how many days of leave he/she is eligible for etc)
 query the leave balance
 see his/her leave history since the time he/she joined the company/college
ll

 apply for leave, specifying the from and to dates, reason for taking leave, address for
communication while on leave and his/her superior's email id
 see his/her current leave applications and the leave applications that are submitted to
A

him/her for approval or cancellation

 approve/reject the leave applications that are submitted to him/her
 withdraw his/her leave application (which has not been approved yet)
 Cancel his/her leave (which has been already approved). This will need to be
approved by his/her Superior
 R16 B.TECH CSE.

 get help about the leave system on how to use the different features of the system
 As soon as a leave application /cancellation request /withdrawal /approval /rejection
/password-change is made by the person, an automatic email should be sent to the
person and his superior giving details about the action
 The number of days of leave (as per the assumed leave policy) should be
automatically credited to everybody and a notification regarding the same be sent to

ld
them automatically
 An automatic leave-approval facility for leave applications which are older than 2
weeks should be there. Notification about the automatic leave approval should be sent
to the person as well as his superior

or
3. E-Bidding
Auctions are among the latest economic institutions in place. They have been used since
antiquity to sell a wide variety of goods, and their basic form has remained unchanged. In this
dissertation, we explore the efficiency of common auctions when values are interdependent-

W
the value to a particular bidder may depend on information available only to others-and
asymmetric. In this setting, it is well known that sealed-bid auctions do not achieve efficient
allocations in general since they do not allow the information held by different bidders to be
shared.

Typically, in an auction, say of the kind used to sell art, the auctioneer sets a relatively low
TU
initial price. This price is then increased until only one bidder is willing to buy the object, and
the exact manner in which this is done varies. In my model a bidder who drops out at some
price can "reenter" at a higher price.

With the invention of E-commerce technologies over the Internet the opportunity to bid from
the comfort of one’s own home has seen a change like never seen before. Within the span of
a few short years, what may have began as an experimental idea has grown to an immensely
JN

popular hobby, and in some cases, a means of livelihood, the Auction Patrol gathers
tremendous response every day, all day. With the point and click of the mouse, one may bid
on an item they may need or just want, and in moments they find that either they are the top
bidder or someone else wants it more, and you're outbid! The excitement of an auction all
from the comfort of home is a completely different experience.

Society cannot seem to escape the criminal element in the physical world, and so it is the
ll

same with Auction Patrols. This is one area where in a question can be raised as to how safe
Auction Patrols.
A

Proposed system
To generate the quick reports
To make accuracy and efficient calculations
To provide proper information briefly
To provide data security
 R16 B.TECH CSE.

To provide huge maintenance of records

Flexibility of transactions can be completed in time

4. Electronic Cash counter

This project is mainly developed for the Account Division of a Banking sector to provide
better interface of the entire banking transactions. This system is aimed to give a better out

ld
look to the user interfaces and to implement all the banking transactions like:
 Supply of Account Information
 New Account Creations
 Deposits

or
 Withdraws
 Cheque book issues
 Stop payments
 Transfer of accounts
 Report Generations.

W
Proposed System:
The development of the new system contains the following activities, which try to automate
the entire process keeping in view of the database integration approach.
 User friendliness is provided in the application with various controls.
 The system makes the overall project management much easier and flexible.
TU
 Readily upload the latest updates, allows user to download the alerts by clicking the
URL.
 There is no risk of data mismanagement at any level while the project development is
under process.
 It provides high level of security with different level of authentication
JN
ll
A
 R16 B.TECH CSE.

PROFESSIONAL ETHICS

B.Tech. III Year I Sem. L T P C

Course Code: MC500HS 3 0 0 0

Course Objective: To enable the students to imbibe and internalize the Values and Ethical

ld
Behaviour in the personal and Professional lives.

Course Outcome: The students will understand the importance of Values and Ethics in their
personal lives and professional careers. The students will learn the rights and responsibilities

or
as an employee, team member and a global citizen.

UNIT - I
Introduction to Professional Ethics: Basic Concepts, Governing Ethics, Personal &
Professional Ethics, Ethical Dilemmas, Life Skills, Emotional Intelligence, Thoughts of

W
Ethics, Value Education, Dimensions of Ethics, Profession and professionalism, Professional
Associations, Professional Risks, Professional Accountabilities, Professional Success, Ethics
and Profession.

UNIT - II
Basic Theories: Basic Ethical Principles, Moral Developments, Deontology, Utilitarianism,
Virtue Theory, Rights Theory, Casuist Theory, Moral Absolution, Moral Rationalism, Moral
TU
Pluralism, Ethical Egoism, Feminist Consequentialism, Moral Issues, Moral Dilemmas,
Moral Autonomy.

UNIT - III
Professional Practices in Engineering: Professions and Norms of Professional Conduct,
Norms of Professional Conduct vs. Profession; Responsibilities, Obligations and Moral
JN

Values in Professional Ethics, Professional codes of ethics, the limits of predictability and
responsibilities of the engineering profession.
Central Responsibilities of Engineers - The Centrality of Responsibilities of Professional
Ethics; lessons from 1979 American Airlines DC-10 Crash and Kansas City Hyatt Regency
Walk away Collapse.

UNIT - IV
Work Place Rights & Responsibilities, Ethics in changing domains of Research, Engineers
ll

and Managers; Organizational Complaint Procedure, difference of Professional Judgment

within the Nuclear Regulatory Commission (NRC), the Hanford Nuclear Reservation.
Ethics in changing domains of research - The US government wide definition of research
A

misconduct, research misconduct distinguished from mistakes and errors, recent history of
attention to research misconduct, the emerging emphasis on understanding and fostering
responsible conduct, responsible authorship, reviewing & editing.
 R16 B.TECH CSE.

UNIT - V
Global issues in Professional Ethics: Introduction – Current Scenario, Technology
Globalization of MNCs, International Trade, World Summits, Issues, Business Ethics and
Corporate Governance, Sustainable Development Ecosystem, Energy Concerns, Ozone
Deflection, Pollution, Ethics in Manufacturing and Marketing, Media Ethics; War Ethics; Bio
Ethics, Intellectual Property Rights.

ld
TEXT BOOKS:
1. Professional Ethics: R. Subramanian, Oxford University Press, 2015.
2. Ethics in Engineering Practice & Research, Caroline Whitbeck, 2e, Cambridge

or
University Press 2015.

REFERENCES:
1. Engineering Ethics, Concepts Cases: Charles E Harris Jr., Michael S Pritchard,
Michael J Rabins, 4e , Cengage learning, 2015.

W
2. Business Ethics concepts & Cases: Manuel G Velasquez, 6e, PHI, 2008.
TU
JN
ll
A
 R16 B.TECH CSE.

COMPILER DESIGN

B.Tech. III Year II Sem. L T P C

Course Code: CS601PC 4 0 0 4

Course Objectives:

ld
 To understand the various phases in the design of a compiler.
 To understand the design of top-down and bottom-up parsers.
 To understand syntax directed translation schemes.
 To introduce lex and yacc tools.

or
 To learn to develop algorithms to generate code for a target machine.

Course Outcomes:
 Ability to design, develop, and implement a compiler for any language.
 Able to use lex and yacc tools for developing a scanner and a parser.

W
 Able to design and implement LL and LR parsers.
 Able to design algorithms to perform code optimization in order to improve the
performance of a program in terms of space and time complexity.
 Ability to design algorithms to generate machine code

UNIT - I
TU
Introduction: Language Processors, the structure of a compiler, the science of building a
compiler, programming language basics.
Lexical Analysis: The Role of the Lexical Analyzer, Input Buffering, Recognition of
Tokens, The Lexical-Analyzer Generator Lex, Finite Automata, From Regular Expressions to
Automata, Design of a Lexical-Analyzer Generator, Optimization of DFA-Based Pattern
Matchers.
JN

UNIT - II
Syntax Analysis: Introduction, Context-Free Grammars, Writing a Grammar, Top-Down
Parsing, Bottom-Up Parsing, Introduction to LR Parsing: Simple LR, More Powerful LR
Parsers, Using Ambiguous Grammars, Parser Generators.

UNIT - III
Syntax-Directed Translation: Syntax-Directed Definitions, Evaluation Orders for SDD's,
ll

Applications of Syntax-Directed Translation, Syntax-Directed Translation Schemes, and

Implementing L-Attributed SDD's.
Intermediate-Code Generation: Variants of Syntax Trees, Three-Address Code, Types and
A

Declarations, Type Checking, Control Flow, Back patching, Switch-Statements, Intermediate

Code for Procedures.
 R16 B.TECH CSE.

UNIT - IV
Run-Time Environments: Storage organization, Stack Allocation of Space, Access to
Nonlocal Data on the Stack, Heap Management, Introduction to Garbage Collection,
Introduction to Trace-Based Collection.
Code Generation: Issues in the Design of a Code Generator, The Target Language,
Addresses in the Target Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks,

ld
A Simple Code Generator, Peephole Optimization, Register Allocation and Assignment,
Dynamic Programming Code-Generation.

UNIT - V

or
Machine-Independent Optimizations: The Principal Sources of Optimization, Introduction
to Data-Flow Analysis, Foundations of Data-Flow Analysis, Constant Propagation, Partial-
Redundancy Elimination, Loops in Flow Graphs.

TEXT BOOKS

W
1. Compilers: Principles, Techniques and Tools, Second Edition, Alfred V. Aho, Monica
S. Lam, Ravi Sethi, Jeffry D. Ullman, Pearson.

REFERENCE BOOKS
1. Compiler Construction-Principles and Practice, Kenneth C Louden, Cengage
Learning.
2. Modern compiler implementation in C, Andrew W Appel, Revised edition,
TU
Cambridge University Press.
3. The Theory and Practice of Compiler writing, J. P. Tremblay and P. G. Sorenson,
TMH
4. Writing compilers and interpreters, R. Mak, 3rd edition, Wiley student edition.
5. lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly
JN
ll
A
 R16 B.TECH CSE.

WEB TECHNOLOGIES

B.Tech. III Year II Sem. L T P C

Course Code: CS602PC 4 0 0 4

Course Objectives:

ld
 To introduce PHP language for server side scripting
 To introduce XML and processing of XML Data with Java
 To introduce Server side programming with Java Servlets and JSP
 To introduce Client side scripting with Javascript and AJAX.

or
Course Outcomes:
 gain knowledge of client side scripting, validation of forms and AJAX programming
 have understanding of server side scripting with PHP language
 have understanding of what is XML and how to parse and use XML Data with Java

W
 To introduce Server side programming with Java Servlets and JSP

UNIT - I
Introduction to PHP: Declaring variables, data types, arrays, strings, operators, expressions,
control structures, functions, Reading data from web form controls like text boxes, radio
buttons, lists etc., Handling File Uploads, Connecting to database (MySQL as reference),
TU
executing simple queries, handling results, Handling sessions and cookies
File Handling in PHP: File operations like opening, closing, reading, writing, appending,
deleting etc. on text and binary files, listing directories

UNIT - II
XML: Introduction to XML, Defining XML tags, their attributes and values, Document Type
Definition, XML Schemas, Document Object Model, XHTML
JN

Parsing XML Data - DOM and SAX Parsers in java.

UNIT - III
Introduction to Servlets: Common Gateway Interface (CGI), Lifecycle of a Servlet,
deploying a servlet, The Servlet API, Reading Servlet parameters, Reading Initialization
parameters, Handling Http Request & Responses, Using Cookies and Sessions, connecting to
a database using JDBC.
ll

UNIT - IV
Introduction to JSP: The Anatomy of a JSP Page, JSP Processing, Declarations, Directives,
A

Expressions, Code Snippets, implicit objects, Using Beans in JSP Pages, Using Cookies and
session for session tracking, connecting to database in JSP.
 R16 B.TECH CSE.

UNIT- V
Client side Scripting: Introduction to Javascript: Javascript language - declaring variables,
scope of variables, functions, event handlers (onclick, onsubmit etc.), Document Object
Model, Form validation. Simple AJAX application.

TEXT BOOKS:

ld
1. Web Technologies, Uttam K Roy, Oxford University Press
2. The Complete Reference PHP – Steven Holzner, Tata McGraw-Hill

REFERENCE BOOKS:

or
1. Web Programming, building internet applications, Chris Bates 2 nd edition, Wiley
Dreamtech
2. Java Server Pages –Hans Bergsten, SPD O’Reilly
3. Java Script, D. Flanagan, O’Reilly,SPD.
4. Beginning Web Programming-Jon Duckett WROX.

W
5. Programming World Wide Web, R. W. Sebesta, Fourth Edition, Pearson.
6. Internet and World Wide Web – How to program, Dietel and Nieto, Pearson.
TU
JN
ll
A
 R16 B.TECH CSE.

CRYPTOGRAPHY AND NETWORK SECURITY

B.Tech. III Year II Sem. L T P C

Course Code: CS603PC 4 0 0 4

Course Objectives:

ld
 Explain the objectives of information security
 Explain the importance and application of each of confidentiality, integrity,
authentication and availability
 Understand various cryptographic algorithms.

or
 Understand the basic categories of threats to computers and networks
 Describe public-key cryptosystem.
 Describe the enhancements made to IPv4 by IPSec
 Understand Intrusions and intrusion detection
 Discuss the fundamental ideas of public-key cryptography.

W
 Generate and distribute a PGP key pair and use the PGP package to send an encrypted
e-mail message.
 Discuss Web security and Firewalls

Course Outcomes:
 Student will be able to understand basic cryptographic algorithms, message and web
TU
authentication and security issues.
 Ability to identify information system requirements for both of them such as client
and server.
 Ability to understand the current legal issues towards information security.

UNIT – I
Security Concepts: Introduction, The need for security, Security approaches, Principles of
JN

security, Types of Security attacks, Security services, Security Mechanisms, A model for
Network Security
Cryptography Concepts and Techniques: Introduction, plain text and cipher text,
substitution techniques, transposition techniques, encryption and decryption, symmetric and
asymmetric key cryptography, steganography, key range and key size, possible types of
attacks.
ll

UNIT – II
Symmetric key Ciphers: Block Cipher principles, DES, AES, Blowfish, RC5, IDEA, Block
cipher operation, Stream ciphers, RC4.
A

Asymmetric key Ciphers: Principles of public key cryptosystems, RSA algorithm, Elgamal
Cryptography, Diffie-Hellman Key Exchange, Knapsack Algorithm.
 R16 B.TECH CSE.

UNIT – III
Cryptographic Hash Functions: Message Authentication, Secure Hash Algorithm (SHA-
512), Message authentication codes: Authentication requirements, HMAC, CMAC, Digital
signatures, Elgamal Digital Signature Scheme.
Key Management and Distribution: Symmetric Key Distribution Using Symmetric &
Asymmetric Encryption, Distribution of Public Keys, Kerberos, X.509 Authentication

ld
Service, Public – Key Infrastructure

UNIT – IV
Transport-level Security: Web security considerations, Secure Socket Layer and Transport

or
Layer Security, HTTPS, Secure Shell (SSH)
Wireless Network Security: Wireless Security, Mobile Device Security, IEEE 802.11
Wireless LAN, IEEE 802.11i Wireless LAN Security

UNIT – V

W
E-Mail Security: Pretty Good Privacy, S/MIME IP Security: IP Security overview, IP
Security architecture, Authentication Header, Encapsulating security payload, Combining
security associations, Internet Key Exchange
Case Studies on Cryptography and security: Secure Multiparty Calculation, Virtual
Elections, Single sign On, Secure Inter-branch Payment Transactions, Cross site Scripting
Vulnerability.
TU
TEXT BOOKS:
1. Cryptography and Network Security - Principles and Practice: William Stallings,
Pearson Education, 6 th Edition
2. Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 3 rd Edition

REFERENCE BOOKS:
JN

1. Cryptography and Network Security: C K Shyamala, N Harini, Dr T R Padmanabhan,

Wiley India, 1 st Edition.
2. Cryptography and Network Security : Forouzan Mukhopadhyay, Mc Graw Hill, 3 rd
Edition
3. Information Security, Principles, and Practice: Mark Stamp, Wiley India.
4. Principles of Computer Security: WM. Arthur Conklin, Greg White, TMH
5. Introduction to Network Security: Neal Krawetz, CENGAGE Learning
6. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning
ll
A
 R16 B.TECH CSE.

MOBILE COMPUTING
(PROFESSIONAL ELECTIVE - I)

B.Tech. III Year II Sem. L T P C

Course Code: CS611PE 3 0 0 3

ld
Course Objectives:
 To make the student understand the concept of mobile computing paradigm, its novel
applications and limitations.
 To understand the typical mobile networking infrastructure through a popular GSM

or
protocol
 To understand the issues and solutions of various layers of mobile networks, namely
MAC layer, Network Layer & Transport Layer
 To understand the database issues in mobile environments & data delivery models.
 To understand the ad hoc networks and related concepts.

W
 To understand the platforms and protocols used in mobile environment.

Course Outcomes:
 Able to think and develop new mobile application.
 Able to take any new technical issue related to this new paradigm and come up with a
solution(s).
TU
 Able to develop new ad hoc network applications and/or algorithms/protocols.
 Able to understand & develop any existing or new protocol related to mobile
environment

UNIT - I
Introduction: Mobile Communications, Mobile Computing – Paradigm, Promises/Novel
Applications and Impediments and Architecture; Mobile and Handheld Devices, Limitations
JN

of Mobile and Handheld Devices.

GSM – Services, System Architecture, Radio Interfaces, Protocols, Localization, Calling,
Handover, Security, New Data Services, GPRS, CSHSD, DECT.

UNIT – II
(Wireless) Medium Access Control (MAC): Motivation for a specialized MAC (Hidden
and exposed terminals, Near and far terminals), SDMA, FDMA, TDMA, CDMA, Wireless
ll

LAN/(IEEE 802.11)
Mobile Network Layer: IP and Mobile IP Network Layers, Packet Delivery and Handover
Management, Location Management, Registration, Tunneling and Encapsulation, Route
A

Optimization, DHCP.

UNIT – III
Mobile Transport Layer: Conventional TCP/IP Protocols, Indirect TCP, Snooping TCP,
Mobile TCP, Other Transport Layer Protocols for Mobile Networks.
 R16 B.TECH CSE.

Database Issues: Database Hoarding & Caching Techniques, Client-Server Computing &
Adaptation, Transactional Models, Query processing, Data Recovery Process & QoS Issues.

UNIT - IV
Data Dissemination and Synchronization: Communications Asymmetry, Classification of
Data Delivery Mechanisms, Data Dissemination, Broadcast Models, Selective Tuning and

ld
Indexing Methods, Data
Synchronization – Introduction, Software, and Protocols

UNIT - V

or
Mobile Adhoc Networks (MANETs): Introduction, Applications & Challenges of a
MANET, Routing, Classification of Routing Algorithms, Algorithms such as DSR, AODV,
DSDV, etc. , Mobile Agents, Service Discovery.
Protocols and Platforms for Mobile Computing: WAP, Bluetooth, XML, J2ME, Java
Card, Palm OS, Windows CE, Symbian OS, Linux for Mobile Devices, Android.

W
TEXT BOOKS:
1. Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second Edition, 2009.
2. Raj Kamal, “Mobile Computing”, Oxford University Press, 2007, ISBN: 0195686772.

REFERENCE BOOKS:
1. Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second Edition, 2004.
TU
2. Stojmenovic and Cacute, “Handbook of Wireless Networks and Mobile Computing”,
Wiley, 2002, ISBN 0471419028.
3. Reza Behravanfar, “Mobile Computing Principles: Designing and Developing
Mobile Applications with UML and XML”, ISBN: 0521817331, Cambridge
University Press, Oct 2004.
JN
ll
A
 R16 B.TECH CSE.

DESIGN PATTERNS
(PROFESSIONAL ELECTIVE - I)

B.Tech. III Year II Sem. L T P C

Course Code: CS612PE 3 0 0 3

ld
Prerequisites
1. A Course on Software Engineering”
2. A Course on “Object Oriented Programming Through Java”

or
Course Objectives:
 The aim of the course is to appreciate the idea behind Design Patterns in handling
common problems faced during building an application
 This course covers all pattern types from creational to structural, behavioral to
concurrency and highlights the scenarios when one pattern must be chosen over

W
others.
Course Outcomes:
 Create software designs that are scalable and easily maintainable
 Understand the best use of Object Oriented concepts for creating truly OOP programs
 Use creational design patterns in software design for class instantiation
 Use structural design patterns for better class and object composition
TU
 Use behavioral patterns for better organization and communication between the
objects
 Use refactoring to compose the methods for proper code packaging
 Use refactoring to better organize the class responsibilities of current code

UNIT - I
Introduction: What is a design pattern? design patterns in Smalltalk MVC, Describing
JN

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
Designing a Document Editor: Design Problems, Document Structure, Formatting,
Embellishing the User Interface, Supporting Multiple Look-and-Feel Standards, Supporting
ll

Multiple Window Systems, User Operations Spelling Checking and Hyphenation, Summary

UNIT - III
A

Creational Patterns: Abstract Factory, Builder, Factory Method, Prototype, Singleton,

Discussion of Creational Patterns.

UNIT - IV
Structural Pattern: Adapter, Bridge, Composite, Decorator, Façade, Flyweight, Proxy
 R16 B.TECH CSE.

UNIT - V
Behavioral Patterns: Chain of Responsibility, Command, Interpreter, Iterator, Mediator,
Memento, Observer, State, Strategy, Template Method, Visitor.

TEXT BOOK:
1. Design Patterns, Erich Gamma, Pearson Education

ld
REFERENCE BOOKS:
1. Pattern’s in Java, Vol –I, Mark Grand, Wiley Dream Tech.
2. Patterns in Java, Vol-II, Mark Grand, Wiley Dream Tech.

or
3. Java Enterprise Design Patterns Vol-III, Mark Grand, Wiley Dream Tech.
4. Head First Design Patterns, Eric Freeman, O’reily publications

W
TU
JN
ll
A
 R16 B.TECH CSE.

ARTIFICIAL INTELLIGENCE
(Professional Elective - I)

B.Tech. III Year II Sem. L T P C

Course Code: CS613PE 3 0 0 3

ld
Course Objectives:
 To learn the difference between optimal reasoning vs human like reasoning
 To understand the notions of state space representation, exhaustive search, heuristic
search along with the time and space complexities

or
 To learn different knowledge representation techniques
 To understand the applications of AI: namely Game Playing, Theorem Proving,
Expert Systems, Machine Learning and Natural Language Processing

Course Outcomes:

W
 Possess the ability to formulate an efficient problem space for a problem expressed in
English.
 Possess the ability to select a search algorithm for a problem and characterize its time
and space complexities.
 Possess the skill for representing knowledge using the appropriate technique
 Possess the ability to apply AI techniques to solve problems of Game Playing, Expert
TU
Systems, Machine Learning and Natural Language Processing

UNIT - I
Introduction, History, Intelligent Systems, Foundations of AI, Sub areas of AI, Applications.
Problem Solving - State-Space Search and Control Strategies: Introduction, General Problem
Solving, Characteristics of Problem, Exhaustive Searches, Heuristic Search Techniques,
Iterative-Deepening A*, Constraint Satisfaction. Game Playing, Bounded Look-ahead
JN

Strategy and use of Evaluation Functions, Alpha-Beta Pruning

UNIT - II
Logic Concepts and Logic Programming: Introduction, Propositional Calculus, Propositional
Logic, Natural Deduction System, Axiomatic System, Semantic Tableau System in
Propositional Logic, Resolution Refutation in Propositional Logic, Predicate Logic, Logic
Programming.
ll

Knowledge Representation: Introduction, Approaches to Knowledge Representation,

Knowledge Representation using Semantic Network, Extended Semantic Networks for KR,
Knowledge Representation using Frames.
A

UNIT - III
Expert System and Applications: Introduction, Phases in Building Expert Systems, Expert
System Architecture, Expert Systems Vs Traditional Systems, Truth Maintenance Systems,
Application of Expert Systems, List of Shells and Tools.
 R16 B.TECH CSE.

Uncertainty Measure - Probability Theory: Introduction, Probability Theory, Bayesian Belief

Networks, Certainty Factor Theory, Dempster-Shafer Theory.

UNIT-IV
Machine-Learning Paradigms: Introduction. Machine Learning Systems. Supervised and
Unsupervised Learning. Inductive Learning. Learning Decision Trees (Text Book 2),

ld
Deductive Learning. Clustering, Support Vector Machines.
Artificial Neural Networks: Introduction, Artificial Neural Networks, Single-Layer Feed-
Forward Networks, Multi-Layer Feed-Forward Networks, Radial-Basis Function Networks,
Design Issues of Artificial Neural Networks, Recurrent Networks.

or
UNIT-V
Advanced Knowledge Representation Techniques: Case Grammars, Semantic Web
Natural Language Processing: Introduction, Sentence Analysis Phases, Grammars and
Parsers, Types of Parsers, Semantic Analysis, Universal Networking Knowledge.

W
TEXT BOOKS:
1. Saroj Kaushik. Artificial Intelligence. Cengage Learning. 2011
2. Russell, Norvig: Artificial intelligence, A Modern Approach, Pearson Education,
Second Edition. 2004

REFERENCE BOOK:
TU
1. Rich, Knight, Nair: Artificial intelligence, Tata McGraw Hill, Third Edition 2009.
2. Introduction to Artificial Intelligence by Eugene Charniak, Pearson.
3. Introduction to Artificial Intelligence and expert systems Dan W.Patterson. PHI.
4. Artificial Intelligence by George Fluger rearson fifth edition.
JN
ll
A
 R16 B.TECH CSE.

INFORMATION SECURITY MANAGEMENT (SECURITY ANALYST-I)

(PROFESSIONAL ELECTIVE - I)

B.Tech. III Year II Sem. L T P C

Course Code: CS614PE 3 0 0 3

ld
Course Objectives:
 To introduce the terminology, technology and its applications
 To introduce the concept of Security Analyst
 To introduce the tools, technologies & programming languages which are used in day
to day security analyst job role

or
UNIT - I
Information Security Management: Information Security Overview, Threats and Attack
Vectors, Types of Attacks, Common Vulnerabilities, and Exposures (CVE), Security Attacks,
Fundamentals of Information Security, Computer Security Concerns, Information Security
Measures etc.

W
Manage your work to meet requirements (NOS 9001)

UNIT - II
Fundamentals of Information Security: Key Elements of Networks, Logical Elements of
Network, Critical Information Characteristics, Information States etc.
Work effectively with Colleagues (NOS 9002)
TU
UNIT - III
Data Leakage: What is Data Leakage and statistics, Data Leakage Threats, Reducing the
Risk of Data Loss, Key Performance Indicators (KPI), Database Security etc.

UNIT - IV
Information Security Policies, Procedures, and Audits: Information Security Policies-
JN

necessity-key elements & characteristics, Security Policy Implementation, Configuration,

Security Standards-Guidelines & Frameworks etc.

UNIT - V
Information Security Management – Roles and Responsibilities: Security Roles &
Responsibilities, Accountability, Roles, and Responsibilities of Information Security
Management, team-responding to emergency situation-risk analysis process etc.
ll

TEXT BOOKS:
1. Management of Information Security by Michael E. Whitman and Herbert J. Mattord
A

REFERENCES:
1. http://www.iso.org/iso/home/standards/management-standards/iso27001.htm
2. http://csrc.nist.gov/publications/nistpubs/800-55-Rev1/SP800-55-rev1.pdf
 R16 B.TECH CSE.

INTRODUCTION TO ANALYTICS (ASSOCIATE ANALYTICS -I)

(PROFESSIONAL ELECTIVE - I)

B.Tech. III Year II Sem. L T P C

Course Code: CS615PE 3 0 0 3

ld
Course Objectives:
 To introduce the terminology, technology and its applications
 To introduce the concept of Analytics for Business
 To introduce the tools, technologies & programming languages which is used in day

or
to day analytics cycle

UNIT - I
Introduction to Analytics and R programming (NOS 2101): Introduction to R, R Studio
(GUI): R Windows Environment, introduction to various data types, Numeric, Character,

W
date, data frame, array, matrix etc., Reading Datasets, Working with different file types .txt,.
csv etc. Outliers, Combining Datasets, R Functions and loops.
Manage your work to meet requirements (NOS 9001): Understanding Learning
objectives, Introduction to work & meeting requirements, Time Management, Work
management & prioritization, Quality & Standards Adherence,

UNIT - II
TU
Summarizing Data & Revisiting Probability (NOS 2101): Summary Statistics -
Summarizing data with R, Probability, Expected, Random, Bivariate Random variables,
Probability distribution. Central Limit Theorem etc.
Work effectively with Colleagues (NOS 9002): Introduction to work effectively, Team
Work, Professionalism, Effective Communication skills, etc.
JN

UNIT - III
SQL using R Introduction to NoSQL, Connecting R to NoSQL databases. Excel and R
integration with R connector.

UNIT - IV
Correlation and Regression Analysis (NOS 9001): Regression Analysis, Assumptions of
OLS Regression, Regression Modelling. Correlation, ANOVA, Forecasting,
Heteroscedasticity, Autocorrelation, Introduction to Multiple Regression etc.
ll

UNIT - V
Understand the Verticals - Engineering, Financial and others (NOS 9002)
A

Understanding systems viz. Engineering Design, Manufacturing, Smart Utilities, Production

lines, Automotive, Technology etc. Understanding Business problems related to various
businesses.
Requirements Gathering: Gathering all the data related to Business objective.
 R16 B.TECH CSE.

TEXT BOOK:
1. Student’s Handbook for Associate Analytics.

REFERENCE BOOKS:
1. Introduction to Probability and Statistics Using R, ISBN: 978-0-557-24979-4, is a
textbook written for an undergraduate course in probability and statistics.

ld
2. An Introduction to R, by Venables and Smith and the R Development Core Team.
This may be downloaded for free from the R Project website (http://www.r-
project.org/, see Manuals). There are plenty of other free references available from the
R Project website.

or
3. Montgomery, Douglas C., and George C. Runger, Applied statistics and probability
for engineers. John Wiley & Sons, 2010
4. Time Series Analysis and Mining with R. Yanchang Zhao.

W
TU
JN
ll
A
 R16 B.TECH CSE.

CRYPTOGRAPHY AND NETWORK SECURITY LAB

B.Tech. III Year II Sem. L T P C

Course Code: CS604PC 0 0 3 2

1. Write a C program that contains a string (char pointer) with a value ‘Hello world’.

ld
The program should XOR each character in this string with 0 and displays the result.

2. Write a C program that contains a string (char pointer) with a value ‘Hello world’.
The program should AND or and XOR each character in this string with 127 and
display the result.

or
3. Write a Java program to perform encryption and decryption using the following
algorithms
a. Ceaser cipher b. Substitution cipher c. Hill Cipher

4. Write a C/JAVA program to implement the DES algorithm logic.

W
5. Write a C/JAVA program to implement the Blowfish algorithm logic.

6. Write a C/JAVA program to implement the Rijndael algorithm logic.

7. Write the RC4 logic in Java Using Java cryptography; encrypt the text “Hello world”
using Blowfish. Create your own key using Java key tool.
TU
8. Write a Java program to implement RSA algorithm.

9. Implement the Diffie-Hellman Key Exchange mechanism using HTML and

JavaScript.

10. Calculate the message digest of a text using the SHA-1 algorithm in JAVA.
JN

11. Calculate the message digest of a text using the MD5 algorithm in JAVA.
ll
A
 R16 B.TECH CSE.

WEB TECHNOLOGIES LAB

B.Tech. III Year II Sem. L T P C

Course Code: CS605PC 0 0 3 2

Course Objectives:

ld
 To enable the student to program web applications using the following technologies
HTML, Javascript , AJAX, PHP, Tomcat Server, Servlets, JSP

Course Outcomes:
 Use LAMP Stack for web applications

or
 Use Tomcat Server for Servlets and JSPs
 Write simple applications with Technologies like HTML, Javascript, AJAX, PHP,
Servlets and JSPs
 Connect to Database and get results
 Parse XML files using Java (DOM and SAX parsers)

W
Note:
1. Use LAMP Stack (Linux, Apache, MySQL and PHP) for the Lab Experiments.
Though not mandatory, encourage the use of Eclipse platform wherever applicable
2. The list suggests the minimum program set. Hence, the concerned staff is requested to
add more problems to the list as needed
TU
1. Install the following on the local machine
 Apache Web Server (if not installed)
 Tomcat Application Server locally
 Install MySQL (if not installed)
 Install PHP and configure it to work with Apache web server and MySQL (if not
JN

already configured)

2. Write an HTML page including javascript that takes a given set of integer numbers and
shows them after sorting in descending order.

3. Write an HTML page including any required Javascript that takes a number from one text
field in the range of 0 to 999 and shows it in another text field in words. If the number is
out of range, it should show “out of range” and if it is not a number, it should show “not a
ll

number” message in the result box.

4. Write an HTML page that has one input, which can take multi-line text and a submit
A

button. Once the user clicks the submit button, it should show the number of characters,
words and lines in the text entered using an alert message. Words are separated with
white space and lines are separated with new line character.
 R16 B.TECH CSE.

5. Write an HTML page that contains a selection box with a list of 5 countries. When the
user selects a country, its capital should be printed next to the list. Add CSS to customize
the properties of the font of the capital (color, bold and font size).

6. Create an XML document that contains 10 users information. Write a Java program,
which takes User Id as input and returns the user details by taking the user information

ld
from the XML document using (a) DOM Parser and (b) SAX parser

Implement the following web applications using (a) PHP, (b) Servlets and (c) JSP:

or
7. A user validation web application, where the user submits the login name and password
to the server. The name and password are checked against the data already available in
Database and if the data matches, a successful login page is returned. Otherwise a failure
message is shown to the user.
8. Modify the above program to use an xml file instead of database.

W
9. Modify the above program to use AJAX to show the result on the same page below the
submit button.

10. A simple calculator web application that takes two numbers and an operator (+, -, /, * and
%) from an HTML page and returns the result page with the operation performed on the
operands.
TU
11. Modify the above program such that it stores each query in a database and checks the
database first for the result. If the query is already available in the DB, it returns the value
that was previously computed (from DB) or it computes the result and returns it after
storing the new query and result in DB.
JN

12. A web application takes a name as input and on submit it shows a hello <name> page
where <name> is taken from the request. It shows the start time at the right top corner of
the page and provides a logout button. On clicking this button, it should show a logout
page with Thank You <name> message with the duration of usage (hint: Use session to
store name and time).

13. A web application that takes name and age from an HTML page. If the age is less than
18, it should send a page with “Hello <name>, you are not authorized to visit this site”
ll

message, where <name> should be replaced with the entered name. Otherwise it should
send “Welcome <name> to this site” message.
A

14. A web application for implementation:

The user is first served a login page which takes user's name and password. After
submitting the details the server checks these values against the data from a database and
takes the following decisions.
If name and password matches, serves a welcome page with user's full name.
 R16 B.TECH CSE.

If name matches and password doesn't match, then serves “password mismatch” page
If name is not found in the database, serves a registration page, where user’s full name is
asked and on submitting the full name, it stores, the login name, password and full name
in the database (hint: use session for storing the submitted login name and password)

15. A web application that lists all cookies stored in the browser on clicking “List Cookies”

ld
button. Add cookies if necessary.

REFERENCE BOOKS:
1. The Complete Reference PHP – Steven Holzner, Tata McGraw-Hill

or
2. Web Programming, building internet applications, Chris Bates 2nd edition, Wiley
Dreamtech
3. Java Server Pages –Hans Bergsten, SPD O’Reilly
4. Java Script, D.Flanagan, O’Reilly, SPD.
5. Internet and World Wide Web – How to program, Dietel and Nieto, Pearson.

W
TU
JN
ll
A
 R16 B.TECH CSE.

ADVANCED ENGLISH COMMUNICATION SKILLS LAB

B.Tech. III Year II Sem. L T P C

Course Code: EN606HS 0 0 3 2

ld
Introduction
A course on Advanced English Communication Skills (AECS) Lab is considered essential at
the third year level of B.Tech and B.Pharmacy courses. At this stage, the students need to
prepare themselves for their career which requires them to listen to, read, speak and write in
English both for their professional and interpersonal communication. The main purpose of

or
this course is to prepare the students of Engineering for their placements.

Course Objectives: This Lab focuses on using multi-media instruction for language
development to meet the following targets:
 To improve students’ fluency in spoken English

W
 To enable them to listen to English spoken at normal conversational speed
 To help students develop their vocabulary
 To read and comprehend texts in different contexts
 To communicate their ideas relevantly and coherently in writing
 To make students industry-ready
 To help students acquire behavioral skills for their personal and professional life
TU
 To respond appropriately in different socio-cultural and professional contexts

Course Outcomes: Students will be able to:

 Acquire vocabulary and use it contextually
 Listen and speak effectively
 Develop proficiency in academic reading and writing
JN

 Increase possibilities of job prospects

 Communicate confidently in formal and informal contexts

Syllabus
The following course activities will be conducted as part of the Advanced English
Communication Skills (AECS) Lab:
1. Inter-personal Communication and Building Vocabulary - Starting a Conversation
– Responding Appropriately and Relevantly – Using Appropriate Body Language –
ll

Role Play in Different Situations - Synonyms and Antonyms, One-word Substitutes,

Prefixes and Suffixes, Idioms and Phrases and Collocations.
A

2. Reading Comprehension –General Vs Local Comprehension, Reading for Facts,

Guessing Meanings from Context, , Skimming, Scanning, Inferring Meaning.
3. Writing Skills – Structure and Presentation of Different Types of Writing – Letter
Writing/Resume Writing/ e-correspondence/ Technical Report Writing.
 R16 B.TECH CSE.

4. Presentation Skills – Oral Presentations (individual or group) through JAM

Sessions/Seminars/PPTs and Written Presentations through Posters/Projects/Reports/
e-mails/Assignments… etc.,
5. Group Discussion and Interview Skills – Dynamics of Group Discussion,
Intervention, Summarizing, Modulation of Voice, Body Language, Relevance,
Fluency and Organization of Ideas and Rubrics of Evaluation- Concept and Process,

ld
Pre-interview Planning, Opening Strategies, Answering Strategies, Interview through
Tele-conference & Video-conference and Mock Interviews.

Minimum Hardware Requirement: Advanced English Communication Skills (AECS)

or
Laboratory shall have the following infrastructural facilities to accommodate at least 35
students in the lab:
 Spacious room with appropriate acoustics
 Eight round tables with five movable chairs for each table.
 Audio-visual aids

W
 LCD Projector
 Public Address system
 Computer with suitable configuration

Suggested Software: The software consisting of the prescribed topics elaborated above
should be procured and used.
TU
 Oxford Advanced Learner’s Compass, 8th Edition
 DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice.

REFERENCES:
1. Kumar, Sanjay and Pushp Lata. English for Effective Communication, Oxford
University Press, 2015.
2. Konar, Nira. English Language Laboratories – A Comprehensive Manual, PHI
JN

Learning Pvt. Ltd., 2011.

ll
A