CSE

COMPUTER SCIENCE AND ENGINEERING 2020-21
B.Tech. in COMPUTER SCIENCE AND ENGINEERING

COURSE STRUCTURE (R-20)
B. Tech in COMPUTER SCIENCE AND ENGINEERING

Applicable From 2020-21 Admitted Batch
I YEAR I SEMESTER
S. No. Course Code Course Title L T P Credits
1 MA101BS Linear Algebra and Calculus 3 1 0 4

2 AP102BS Applied Physics 3 1 0 4
3 CS103ES Programming for Problem Solving 3 1 0 4
4 EE104ES Basic Electrical Engineering 3 0 0 3
5 ME105ES Engineering Workshop & IT Workshop 0 0 3 1.5
6 AP106BS Applied Physics Lab 0 0 3 1.5
7 CS107ES Programming for Problem Solving Lab 0 0 2 1
8 EE108ES Basic Electrical Engineering Lab 0 0 2 1
9 EN109HS Employability Skills- I (Business English for Engineers) 0 0 2 0
Induction Programme
Total Credits 12 3 12 20
I YEAR II SEMESTER
1 MA201BS Differential Equations and Vector Calculus 3 1 0 4

2 CH202BS Engineering Chemistry 3 0 0 3
3 CS203ES Data Structures 3 0 0 3
4 ME204ES Engineering Graphics 1 0 4 3
5 EN205HS English 2 0 0 2
6 CH206BS Engineering Chemistry Lab 0 0 3 1.5
7 CS207ES Data Structures Lab 0 0 2 1
8 EN208HS English Language and Communication Skills Lab 0 0 3 1.5

9 MA209BS Employability Skills-II (Aptitude ) 1 1 0 0
1|Page

B. Tech in COMPUTER SCIENCE AND ENGINEERING

II YEAR I SEMESTER

1 CS301PC Database Management Systems 3 0 0 3
2 CS302PC Computer Organization and Architecture 3 1 0 4
3 CS303PC Operating Systems 3 0 0 3
4 CS304PC Object Oriented Programming through Java 3 0 0 3
5 CS305PC Discrete Mathematics 3 0 0 3
6 CS306PC Database Management Systems Lab 0 0 2 1
7 CS307PC Operating Systems Lab 0 0 3 1.5
8 CS308PC Java Programming Lab 0 0 3 1.5
9 *MC309 Gender Sensitization Lab 0 0 2 0
10 MC310 Employability Skills-III 0 0 2 0
II YEAR II SEMESTER
S. No Course Code Course Title L T P Credits

1 SM401MS Business Economics & Financial Analysis 3 0 0 3
2 MA402BS Computer Oriented Statistical Methods 3 1 0 4
3 CS403ES Analog & Digital Electronics 3 0 0 3
4 CS404PC Python Programming 3 0 0 3
5 CS405PC Software Engineering 3 0 0 3
6 CS406ES Analog & Digital Electronics Lab 0 0 2 1
7 CS407PC Python Programming Lab 0 0 3 1.5
8 CS408PC Software Engineering Lab 0 0 3 1.5
9 *MC409 Environmental Science 3 0 0 0
10 MC410 Employability Skills-IV 0 0 2 0
*MC – Satisfied/Unsatisfied
2|Page

III YEAR I SEMESTER

1 CS501PC Design and Analysis of Algorithms 3 1 0 4
2 CS502PC Computer Networks 3 0 0 3
3 CS503PC Artificial Intelligence 3 0 0 3
4 CS504PC Formal Languages and Automata Theory 3 0 0 3
5 Professional Elective - I 3 0 0 3
6 CS505PC Artificial Intelligence Lab 0 0 2 1
7 CS506PC Computer Networks Lab 0 0 3 1.5
8 CS507PC Design and Analysis of Algorithms Lab 0 0 3 1.5
9 *MC509 Constitution of India 3 0 0 0
10 MC510 Devops 0 0 2 0
III YEAR II SEMESTER

1. CS601PC Compiler Design 3 0 0 3
2. CS602PC Machine Learning 3 1 0 4
3. CS603PC Web Technologies 3 0 0 3
4. Professional Elective - II 3 0 0 3
5. Open Elective-I 3 0 0 3
6. EN604HS Advanced Communication Skills Lab 0 0 3 1.5
7. CS605PC Machine Learning Lab 0 0 2 1
8. CS606PC Web Technologies Lab 0 0 3 1.5
9. *MC609 Intellectual Property Rights 3 0 0 0
10
MC610 Cyber Security 0 0 2 0
3|Page

IV YEAR I SEMESTER

1 CS701PC Data Mining 3 0 0 3
2 CS702PC Internet of Things 3 0 0 3
3 Professional Elective - III 3 0 0 3
4 Professional Elective -IV 3 0 0 3
5 Open Elective-II / MOOCS 3 0 0 3
6 CS703PC Data Mining Lab 0 0 3 1.5
7 CS704PC Internet of Things Lab 0 0 3 1.5
8 CS705PROJ Industry Oriented Mini Project 0 0 4 2
9 CS706PROJ Project -I 0 0 6 3
IV YEAR II SEMESTER

1 Professional Elective -V / MOOCS 3 0 0 3
2 Professional Elective -VI 3 0 0 3
3 Open Elective-III / MOOCS 3 0 0 3
4 CS801PROJ Seminar 0 0 2 1
5 CS802PROJ Project -II 0 0 16 8
4|Page


Professional Elective – I
CS511PE Cryptography & Network Security
CS512PE Data Analytics using R
CS513PE Principle of Programming Languages
CS514PE Computer Graphics
Professional Elective – II
CS621PE Network Programming & Management
CS622PE Natural Language Processing
CS623PE Software Project Management
CS624PE Information Retrieval System
Professional Elective – III

CS731PE Information Security & Risk management
CS732PE Deep Learning
CS733PE Object Oriented Modeling and Design
CS734PE Image Processing
Professional Elective – IV
CS741PE Distributed Systems
CS742PE Semantic web and Social Networks
CS743PE Software Testing Methodologies
CS744PE Pattern Recognition
Professional Elective – V / MOOCS

CS851PE Blockchain Technology
CS852PE Mobile Application Development
CS853PE Design Patterns
CS854PE Virtual Reality
Professional Elective - VI
CS861PE Cyber Forensics And Security
CS862PE Robotics Process Automation
CS863PE Cloud Computing
CS864PE Computer Vision
5|Page

Open Elective-I
CS611OE Database Management Systems
CS612OE Operating Systems
CS613OE Software Engineering
CS614OE Java Programming
Open Elective-II
CS721OE Introduction to Data Analytics
CS722OE Linux Programming
CS723OE Software Project Management
CS724OE Python Programming
Open Elective-III
CS831OE R Programming
CS832OE Block Chain Technology
CS833OE Software Testing Methodologies
CS834OE Web Programming
6|Page
B.Tech. I Year Syllabus (wef A.Y. 2020-21)

Common for CSE, CSD, CSC and INF
I YEAR I SEMESTER

1 MA101BS Linear Algebra and Calculus 3 1 0 4
2 AP102BS Applied Physics 3 1 0 4
3 CS103ES Programming for Problem Solving 3 1 0 4
4 EE104ES Basic Electrical Engineering 3 0 0 3
5 ME105ES Engineering Workshop & IT Workshop 0 0 3 1.5
6 AP106BS Applied Physics Lab 0 0 3 1.5
7 CS107ES Programming for Problem Solving Lab 0 0 2 1
8 EE108ES Basic Electrical Engineering Lab 0 0 2 1
9 EN109HS Employability skills- I (Business English for Engineers) 0 0 2 0
Induction Program
I YEAR II SEMESTER
1 MA201BS Differential Equations and Vector Calculus 3 1 0 4

2 CH202BS Engineering Chemistry 3 0 0 3
3 CS203ES Data Structures 3 0 0 3
4 ME204ES Engineering Graphics 1 0 4 3
5 EN205HS English 2 0 0 2
6 CH206BS Engineering Chemistry Lab 0 0 3 1.5
7 CS207ES Data Structures Lab 0 0 2 1
8 EN208HS English Language and Communication Skills 0 0 3 1.5
9 MA209BS Employability skills-II (Aptitude (or) Mathematics Lab) 0 0 2 0
CMR ENGINEERING COLLEGE, HYDERABAD

B.Tech. I Year I Sem. L T P C
3 1 0 4
MA101BS: LINEAR ALGEBRA AND CALCULUS
Common to CSE, CSM, CSD, CSC, INF, ECE and ME
Course Objectives:
To learn
 Types of matrices and their properties.
 Concept of a rank of the matrix and applying this concept to know the consistency and solving the system of
linear equations.
 Concept of Eigen values and eigenvectors and to reduce the quadratic form to canonical form.
 Concept of Sequence.
 Concept of nature of the series.
 Geometrical approach to the mean value theorems and their application to the mathematical problems
 Evaluation of improper integrals using Beta and Gamma functions.
 Partial differentiation, concept of total derivative
 Finding maxima and minima of function of two and three variables.
Course Outcomes:
After learning the contents of this paper the student must be able to
 Write the matrix representation of a set of linear equations and to analyse the solution of the system of
equations
 Find the Eigen values and Eigen vectors
 Reduce the quadratic form to canonical form using orthogonal transformations.
 Analyse the nature of sequence and series.
 Solve the applications on the mean value theorems.
 Evaluate the improper integrals using Beta and Gamma functions
 Find the extreme values of functions of two variables with/ without constraints.
UNIT-I: Matrices
Matrices: Types of Matrices, Symmetric, Hermitian, Skew-symmetric, Skew-Hermitian, orthogonal matrices, Unitary
Matrices, rank of a matrix by Echelon form and Normal form, Inverse of Non-singular matrices by Gauss-Jordan method,
System of linear equations, solving system of Homogeneous and Non-Homogeneous equations. Gauss elimination method,
Gauss Seidel Iteration Method.
UNIT-II: Eigen values and Eigen vectors

Linear Transformation and Orthogonal Transformation: Eigen values and Eigenvectors and their properties,
Diagonalization of a matrix, Cayley-Hamilton Theorem (without proof), finding inverse and power of a matrix by Cayley-
Hamilton Theorem; Quadratic forms and Nature of the Quadratic Forms; Reduction of Quadratic form to canonical forms
by Orthogonal Transformation
UNIT-III: Sequences & Series

Sequence: Definition of a Sequence, limit; Convergent, Divergent and Oscillatory sequences. Series: Convergent,
Divergent and Oscillatory Series; Series of positive terms, Comparison test, p-test, D-Alembert’s ratio test, Raabe’s test,
Cauchy’s Integral test, Cauchy’s root test; logarithmic test. Alternating series: Leibnitz test, Alternating Convergent series,
Absolute and Conditionally Convergence.
UNIT-IV: Calculus:
Mean value theorems: Rolle’s theorem, Lagrange’s Mean value theorem with their Geometrical Interpretation and
applications, Cauchy’s Mean value Theorem. Taylor’s Series. Applications of definite integrals to evaluate surface areas
and volumes of revolutions of curves (Only in Cartesian coordinates), Definition of Improper Integral: Beta and Gamma
functions and their applications.
UNIT-V: Multivariable calculus (Partial Differentiation and applications

Partial Differentiation; Euler’s Theorem; Total derivative, Jacobian, Functional dependence independence, Maxima and
minima of functions of two variables and three variables using method of Lagrange multipliers.
TEXTBOOKS:
8|Page
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.
3. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9thEdition, Pearson, Reprint, 2002.
REFERENCES BOOK:
1. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications Reprint, 2008.
2. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11 thReprint, 2010
9|Page

B.Tech I Year I Sem. LTP C
3 10 4
AP102BS: APPLIED PHYSICS
Common to CSE, INF, CSD, CSC
Course Objectives:
To learn
 The course primarily aims at understanding the behavior of matter in the condensed state and tries to explore
the causes with reference to micro level mechanism of the solid matter.
 The objective of the first chapter is to study the micro level behavior of the quantum particles of the matter and
their nature as wave and particle.
 The second chapter aims to assess the draw backs of the free electron theory leading to the introduction of the
Band Theory of Solids.
 In the third chapter task to discuss dielectric and magnetic properties of the materials.
 In the fourth chapter, it is expected to understand the basic principles behind the coherent artificial light source
(LASER) with reference to their construction, mechanism, operation and classification etc. In second part of
this chapter aimed at to study an advanced communication system presently ruling the world throughout i.e.
Fiber Optic communication system.
 In the fifth chapter plan to discuss on fabrication of nano particles and their characterization techniques.
Course Outcomes: After learning the contents of this paper the student must be able to
 Predict the behavior of particle and wave and solve their wave functions.
 Distinguish the different types of Semiconductor devices.
 Recall and choose different materials based on their properties.
 Examine normal light and laser light and its application in communication.
 Categorize Nano materials by fabrication methods.
UNIT-I:
Principles of quantum mechanics: Introduction to quantum physics, Waves and particles, Matter waves, de-Broglie
Hypothesis, Characteristics of matter waves, Davisson and Germer’s experiment, Heisenberg’s uncertainty principle,
Physical significance of the wave function, Schrodinger’s time - independent wave equation, Particle in one
dimensional potential Box.
Electron theory of Metals: Draw backs of classical free electron theory, Electron in a periodic potential, Kronig-
Penny model (Qualitative Treatment), Origin of energy band formation in solids, Classification of materials, Effective
mass of an electron.
UNIT-II:
Semiconductor Physics: Introduction to semi conductors, Fermi level, Calculation of carrier concentration in intrinsic
and extrinsic (p-type & n-type) semiconductors, Direct and indirect band gap semiconductors, Hall effect and
applications.
Physics of Semiconductor Devices: Formation of PN junction, I-V characteristics of PN junction diode, Construction,
working and applications: LED, Photo diodes and Solar cells.
UNIT-III:
Dielectric Properties: Electric dipole, Dipole moment, Dielectric constant, Electronic, ionic and orientation
polarizations and calculation of polarizabilities: electronic and ionic, Internal fields in solids, Clausius - Mossotti
equation, concept of Piezo-electricity, Pyro- electricity and Ferro - electricity.
Magnetic Properties: Origin of magnetic moment, Bohr magneton, Classification of magnetic materials: dia, para,
ferro, anti ferro and ferri magnetic materials on the basis of magnetic moment, Domain theory of ferro magnetism on
the basis of hysteresis curve.
UNIT-IV:
Lasers: Characteristics of lasers, Absorption, Spontaneous and stimulated emission of radiation, Meta stable state,
Population inversion, Lasing action, Einstein’s coefficients and relation between them, Ruby laser, Helium-neon laser,
Diode laser and applications of lasers.

Fiber Optics: Principle and construction (structure) of an optical fiber, Acceptance angle, Numerical aperture, Types
of optical fibers: step index and graded index fibres, Losses in optical fibers: absorption, scattering and bending and
applications of optical fibres in communication.
UNIT-V:
Nanotechnology: Origin of nanotechnology, Nano scale, Surface to volume ratio, Quantum confinement, random
molecular motion, dominance of electromagnetic forces, Bottom-up fabrication: Sol-Gel method, Top-down
fabrication: Chemical vapour Deposition, Physical vapour deposition, Characterization techniques (XRD, SEM &
TEM) and applications of nanotechnology.
TEXT BOOKS:
1. Principles of Physics by Halliday, Resnick, Walker, Wiley India Pvt Ltd, 9th Edition.
2. Introduction to Solid State Physics by Charles Kittel, Wiley India Pvt Ltd, 7th Edition
3. Engineering Physics by R.K.GAUR & S.L.GUPTA, Dhanpat Rai Publications.
4. Solid State Physics by A J Dekker, MACMILLAN INDIA LTD.
REFERENCE BOOKS:
1. Modern Engineering Physics by Dr.K.Vijaya Kumar, Dr. S. Chandralingam, S.CHAND & COMPANY LTD
2. Applied Physics by P.K.Mittal, I K International Publishers
3. Applied Physics by P.K. Palanisamy :Scitech publishers
4. Introduction to Nanotechnology by Charles P.Poole, Jr.Frank J ownes, John Wiley & sons
5. Applied Physics for Engineers by P. Madusudana Rao, Academic Publishing Company
6. Engineering Physics by Sanjay D Jain, Girish G Sahasrbudha: University Press.

B.Tech. I Year I Sem. LT P C
3 1 0 4
CS103ES: PROGRAMMING FOR PROBLEM SOLVING
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 the usage of structured programming approach in solving problems.
Course Outcomes: The student will learn

 To write algorithms and to draw flowcharts for solving problems.
 To convert the algorithms/flowcharts to C programs.
 To code and test a given logic in C programming language.
 To decompose a problem into functions and to develop modular reusable code.
 To use arrays, pointers, strings and structures to write C programs.
 Searching and sorting problems.
Unit - 1: Introduction to Programming

Introduction to components of a computer system: disks, primary and secondary memory, Processor, operating system,
compilers, creating, compiling and executing a program etc., Number systems .Introduction to Algorithms: steps to
solve logical and numerical problems. Representation of Algorithm, Flowchart/Pseudo code with examples, Program
design and structured Programming. Introduction to C Programming Language: variables (with data types and space
Requirements), Syntax and Logical Errors in compilation, object and executable code, Operators, expressions and
precedence, Expression evaluation, Storage classes (auto, extern, Static and register), type conversion, the main method
and command line arguments Bitwise operations: Bitwise AND, OR, XOR and NOT operators Conditional Branching
and Loops: Writing and evaluation of conditionals and consequent Branching with if, if-else, switch-case, ternary
operator, goto, Iteration with for, while, do while Loops.
I/O: Simple input and output with scanf and printf, formatted I/O, Introduction to stdin, stdout and stderr, Command
line arguments.
Unit - II: Arrays, Strings, Structures and Pointers:

Arrays: one and two dimensional arrays, creating, accessing and manipulating elements of arrays.
Strings: Introduction to strings, handling strings as array of characters, basic string functions available in C (strlen,
strcat, strcpy, strstr etc.), arrays of strings
Structures: Defining structures, initializing structures, unions, Array of structures
Pointers: Idea of pointers, Defining pointers, Pointers to Arrays and Structures, Use of Pointers in self-referential
structures, usage of self referential structures in linked list (no Implementation), Enumeration data type
Unit - III: Preprocessor and File handling in C:

Preprocessor: Commonly used Preprocessor commands like include, define, undef, if, ifdef, Ifndef.
Files: Text and Binary files, Creating and Reading and writing text and binary files, Appending data to existing files,
Writing and reading structures using binary files, Random Access using fseek, ftell and rewind functions.
Unit - IV: Function and Dynamic Memory Allocation:

Functions: Designing structured programs, declaring a function, Signature of a function, Parameters and return type of
a function, passing parameters to functions, call by value, Passing arrays to functions, passing pointers to functions,
idea of call by reference, Some C Standard functions and libraries
Recursion: Simple programs, such as Finding Factorial, Fibonacci series etc., Limitations of Recursive functions
Dynamic memory allocation: Allocating and freeing memory, Allocating memory for arrays Of different data types
Unit - V: Introduction to Algorithms:

Algorithms for finding roots of quadratic equations, finding minimum and maximum numbers of a given set, finding if
a number is prime number, etc. Basic searching in an array of elements (linear and binary search techniques),Basic
algorithms to sort array of elements (Bubble, Insertion and Selection sort algorithms),Basic concept of order of
complexity through the example programs
TEXT BOOKS:
1. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill

2. B.A. Forouzan and R.F. Gilberg C Programming and Data Structures, Cengage Learning, (3rd Edition)
REFERENCE BOOKS:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, PrenticeHall of India
2. R.G. Dromey, How to solve it by Computer, Pearson (16th Impression)
3. Programming in C, Stephen G. Kochan, Fourth Edition, Pearson Education.
4. Herbert Schildt, C: The Complete Reference, Mc Graw Hill, 4th Edition

B.Tech I Year I Sem. LT P C
3 0 0 3
EE104ES: BASIC ELECTRICAL ENGINEERING
Common to CSE, INF, CSD and CSC
Course Objectives:
 To introduce the concepts of electrical circuits and its components.
 To understand magnetic circuits, DC circuits and AC single phase and three phase circuits.
 To study and understand different types of DC/AC machines and transformers.
 To import the knowledge of various electrical installations.
 To introduce the concept of power, power factor, its improvement.
Course Outcomes:
 To analyse and solve electrical circuits using network laws and theorems.
 To understand and analyse basic electric and magnetic circuits.
 To study the working principles of electrical machines.
 To introduce components of low voltage electrical installations.
UNIT- I: D.C CIRCUITS

Electrical circuit elements (R,L,C), voltage and current sources, KVL & KCL, analysis of simple circuits with DC
excitation. Superposition, Thevenin and Norton theorems. Time-domain analysis of first – order RL and RC circuits.
UNIT-II: A.C CIRCUITS

Representation of sinusoidal waveforms, peak and rms values, phasor representation, real power, reactive power,
apparent power, power factor, analysis of single-phase ac circuits consisting of R , L , C , RL , RC , RLC combinations
(series and parallel), resonance in series R-L-C circuit.
Three-phase balanced circuit, voltage and current relations in star and delta connections.
UNIT-III: TRANSFORMS
Ideal and practical transformers, equivalent circuits, losses in transformers, regulations and efficiency. Auto-
transformer and three-phase transformer connections.
UNIT-IV: ELECTRICAL MACHINES

DC generators : Construction, working and emf equation, DC motors : construction, working, back emf , torque
equation, generation of rotating magnetic fields , construction and working of a three-phase induction motor,
significance of torque-slip characteristic. Loss components and efficiency, construction and working of synchronous
generators.
UNIT-V: ELECTRICAL INSTALLATIONS

Components of LT switchgear: switch fuse unit (SFU), MCB, ELCB, MCCB, Types of wires and cables, earthing,
types of batteries, important characteristics for batteries. Elementary calculations for energy consumption, power factor
improvement and battery backup.
SUGGESTED TEXT-BOOKS/REFERENCE-BOOKS:
1. Basic electrical engineering -D. P. Kothari and I. J. Nagrath , 3rd edition 2010, Tata Mc Graw Hill.
2. D.C.Kulshreshtha, “ Basic electrical engineering”, Mc Graw Hill, 2009.
3. L.S. Bobrow , “ Fundamentals of electrical engineering” , oxford university press, 2011.
4. Electrical and Electronics Technology, E. Hughes, 10th edition, Pearson, 2010.
5. Electrical engineering fundamental, Vincent Deltoro, second edition, Prentice Hall India, 1989.

B.Tech. I Year I Sem. L TP C
0 0 3 1.5
ME105ES: ENGINEERING WORKSHOP & IT WORKSHOP

Pre-requisites: Practical skill
Course Objectives:
 To Study of different hand operated power tools, uses and their demonstration
 To gain a good basic working knowledge required for the production of various engineering products.
 To provide hands on experience about use of different engineering materials, tools,
 equipments and processes those are common in the engineering field.
 To develop a right attitude, team working, precision and safety at work place.
 It explains the construction, function, use and application of different working tools, equipment and
machines.
 To study commonly used carpentry joints.
 To have practical exposure to various welding and joining processes.
 Identify and use marking out tools, hand tools, measuring equipment and to work to prescribed tolerances.
Course Outcomes:
Upon completion of the course, the students will be able to
 Apply safety norms while handling the workshop equipment
 Prepare required models using various engineering trades
 Make use of various power tools
LIST OF EXPERIMENTS
Part-A: Engineering Workshop
1. House Wiring
Power point, light fitting and switches.
2. Carpentry
Study of tools and joints; Practice in planning, chiseling, marking and sawing; Joints: Cross joint, T joint, Dove tail
joint.
3. Fitting
Study of tools, practice in filing, cutting, drilling and tapping; Male and female joints, stepped joints.
4. Tin Smithy
Preparation of Open scoop, Cylinder, square/rectangular tray
5. Black Smithy
S-Hook, Square /Hexagonal headed bolt.
6. Foundry
Preparation of green sand mold using single piece / split pattern
7. Demonstration of Power Tools

Drilling machine, power hacksaw, grinding machine and wood cutting machine.
Part-B: IT Workshop
Course Objectives:
The IT Workshop for engineers is a training lab course spread over 54 hours. The modules include training on PC
Hardware, Internet & World Wide Web and Productivity tools including Word, Excel and Power Point.
PC Hardware introduces the students to a personal computer and its basic peripherals, the process of assembling a
personal computer, installation of system software like MS Windows, Linux and the required device drivers. In
addition hardware and software level troubleshooting process, tips and tricks would be covered. The students should
work on working PC to disassemble and assemble to working condition and install Windows and Linux on the
same PC. Students are suggested to work similar tasks in the Laptop scenario wherever possible.
Internet & World Wide Web module introduces the different ways of hooking the PC on to the internet from home
and workplace and effectively usage of the internet. Usage of web browsers, email, newsgroups and discussion forums
would be covered. In addition, awareness of cyber hygiene, i.e., protecting the personal computer from getting infected
with the viruses, worms and other cyber attacks would be introduced.
Productivity tools module would enable the students in crafting professional word documents, excel spread sheets and
power point presentations using the Microsoft suite of office tools and LaTeX. (Recommended to use Microsoft office
2007 in place of MS Office 2003)
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.
 Install and make use of operating systems and MS office tools
1. Windows Operating System & Drivers Installation

Windows 7/8/10. LAN, graphics, audio, video and command prompt, commands.
2. Network Connections & Troubleshooting

IP configurations, connecting devices in LAN through bridge, hub, switch; Wi-Fi, Li-Fi and Bluetooth settings;
Crimping: Crossover, strait over. Hardware and software trouble shooting.
3. Cyber Hygiene
Introduction to Virus, worms, threats. Threats on Internet, Configure the Systems to be Internet safety, Install antivirus,
personal firewall, block pop-ups, block active x downloads
4. MS Word
Prepare the project document and resume.
5. MS Excel
Spread sheet basics, modifying worksheets, formatting cells, formulas and functions, sorting and filtering, charts.
6. MS Power Point
Power point screen, working with slides, add content, work with text, working with tables, graphics, slide animation,
reordering slides, adding sound to a presentation.
7. PC Hardware
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.
TEXT BOOKS:
1. Workshop Practice /B. L. Juneja / Cengage
2. Workshop Manual / K. Venugopal / Anuradha.
3. Comdex Information Technology course tool kit, Vikas Gupta, WILEY Dreamtech
REFERENCE BOOKS:
1. Work shop Manual - P. Kannaiah/ K. L. Narayana/ S
Introduction to Information Technology, ITL Education Solutions limited, Pearson Education.
B.Tech. I Year I Sem. L T P C

0 0 3 1.5
AP106BS: APPLIED PHYSICS LAB
List of Experiments:
1. Energy gap of P-N junction diode: To determine the energy gap of a semiconductor diode.
2. Solar Cell: To study the V-I Characteristics of solar cell.
3. LED & LASER: To study the I-V characteristics of LED and LASER
4. Stewart – Gee’s experiment: Determination of magnetic field along the axis of a current carrying coil.
5. Hall effect: To determine Hall co-efficient of a given semiconductor.
6. Photoelectric effect: To determine work function of a given material.
7. Diffraction: Determination of wavelength of a given light source.
8. Optical fibre: To determine the bending losses and Numerical aperture.
9. LCR Circuit: To determine the Quality factor of LCR Circuit.
10. R-C Circuit: To determine the time constant of R-C circuit.
11. Newton's rings experiment: Determination of radius of curvature of a plano convex lens.
Note: Any 8 experiments are to be performed

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

0 0 2 1
CS107ES: PROGRAMMING FOR PROBLEM SOLVING LAB
[Note:The programs may be executed using any available Open Source/ Freely available IDE
Some of the Tools available are:
CodeLite: https://codelite.org/
Code:Blocks: http://www.codeblocks.org/
DevCpp : http://www.bloodshed.net/devcpp.html
Eclipse: http://www.eclipse.org
This list is not exhaustive and is NOT in any order of preference]
Course Objectives:
The students will learn the following:
 To work with an IDE to create, edit, compile, run and debug programs
 To analyze the various steps in program development.
 To develop programs to solve basic problems by understanding basic concepts in C
 like operators, control statements etc.
 To develop modular, reusable and readable C Programs using the concepts like
 functions, arrays etc.
 To write programs using the Dynamic Memory Allocation concept.
 To create, read from and write to text and binary files
Course Outcomes: The candidate is expected to be able to:

 formulate the algorithms for simple problems
 translate given algorithms to a working and correct program
 correct syntax errors as reported by the compilers
 identify and correct logical errors encountered during execution
 represent and manipulate data with arrays, strings and structures
 use pointers of different types
 create, read and write to and from simple text and binary files
 modularize the code with functions so that they can be reused
Practice sessions:
a. Write a simple program that prints the results of all the operators available in C (including pre/ post increment,
bitwise and/or/not, etc.). Read required operand values from standard input.
b. Write a simple program that converts one given data type to another using auto conversion and casting. Take
the values form standard input.
Simple numeric problems:

a. Write a program for fiend the max and min from the three numbers.
b. Write the program for the simple, compound interest.
c. Write program that declares Class awarded for a given percentage of marks, where mark<40%=Failed, 40% to
<60% = Second class, 60% to <70%=First class, >= 70% = Distinction. Read percentage from standard input.
d. Write a program that prints a multiplication table for a given number and the number of rows in the table. For
example, for a number 5 and rows = 3, the output should be:
5x1=5
5 x 2 = 10
5 x 3 = 15
e. Write a program that shows the binary equivalent of a given positive number between 0 to 255.
Expression Evaluation:
a. A building has 10 floors with a floor height of 3 meters each. A ball is dropped from the top of the building.
Find the time taken by the ball to reach each floor. (Use the formula s = ut+(1/2)at^2 where u and a are the
initial velocity in m/sec (= 0) and acceleration in m/sec^2 (= 9.8 m/s^2)).
b. Write a C program, which takes two integer operands and one operator from the user, performs the operation
and then prints the result. (Consider the operators +,-,*, /, % and use Switch Statement)
c. Write a program that finds if a given number is a prime number
d. Write a C program to find the sum of individual digits of a positive integer and test given number is palindrome
e. 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.
f. Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by the user
g. Write a C program to find the roots of a Quadratic equation.
h. Write a C program to calculate the following, where x is a fractional value
1-x/2 +x^2/4-x^3/6
i. Write a C program to read in two numbers, x and n, and then compute the sum of this geometric progression:
1+x+x^2+x^3+………….+x^n. For example: if n is 3 and x is 5, then the program computes 1+5+25+125
Arrays and Pointers and Functions:

a. Write a C program to find the minimum, maximum and average in an array of integers.
b. Write a functions to compute mean, variance, Standard Deviation, sorting of n elements in single dimension
array.
c. Write a C program that uses functions to perform the following:
i. Addition of Two Matrices
ii. Multiplication of Two Matrices
iii. Transpose of a matrix with memory dynamically allocated for the new matrix as row and column
counts may not be same.
d. Write C programs that use both recursive and non-recursive functions
i. To find the factorial of a given integer.
ii. To find the GCD (greatest common divisor) of two given integers.
iii. To find x^n
e. Write a program for reading elements using pointer into array and display the values using array.
f. Write a program for display values reverse order from array using pointer.
g. Write a program through pointer variable to sum of n elements from array.
Files:
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.
c. 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.
d. Write a C program that does the following:
It should first create a binary file and store 10 integers, where the file name and 10 values are given in the
command line. (hint: convert the strings using atoi function)
Now the program asks for an index and a value from the user and the value at that index should be changed to
the new value in the file. (hint: use fseek function)
The program should then read all 10 values and print them back.
e. 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).
Strings:
a. Write a C program to convert a Roman numeral ranging from I to L to its decimal equivalent.
b. Write a C program that converts a number ranging from 1 to 50 to Roman equivalent
c. Write a C program that uses functions to perform the following operations:
i. To insert a sub-string in to a given main string from a given position.
ii. To delete n Characters from a given position in a given string.
d. Write a C program to determine if the given string is a palindrome or not (Spelled same in both directions with
or without a meaning like madam, civic, noon, abcba, etc.)
e. Write a C program that displays the position of a character ch in the string S or – 1 if S doesn‘t contain ch.
f. Write a C program to count the lines, words and characters in a given text.
Miscellaneous:
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 to construct a pyramid of numbers as follows:
1 * 1 1 *
12 ** 23 22 **
123 *** 456 333 * **
4444 **
*
Sorting and Searching:

a. Write a C program that uses non recursive function to search for a Key value in a given list of integers using
linear search method.
b. Write a C program that uses non recursive function to search for a Key value in a given sorted list of integers
using binary search method.
c. Write a C program that implements the Bubble sort method to sort a given list of integers in ascending order.
d. Write a C program that sorts the given array of integers using selection sort in descending order
e. Write a C program that sorts the given array of integers using insertion sort in ascending order
f. Write a C program that sorts a given array of names
REFERENCE BOOKS:
i. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill
ii. B.A. Forouzan and R.F. Gilberg C Programming and Data Structures, Cengage Learning, (3rd Edition)
iii. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India
iv. R.G. Dromey, How to solve it by Computer, Pearson (16th Impression)
v. Programming in C, Stephen G. Kochan, Fourth Edition, and Pearson Education.
vi. Herbert Schildt, C: The Complete Reference, Mc Graw Hill, 4th Edition
B. Tech I Year I Sem. LTPC

0 02 1
EE108ES: BASIC ELECTRICAL ENGINEERING LAB
Course objectives:
 To analyze a given network by applying various electrical laws and network theorems.
 To know the response of electrical circuits for different excitations
 To calculate, measure and know the relation between basic electrical parameters.
 To analyze the performance characteristics of DC and AC electrical machines.
Course Outcomes:
 Get an exposure to basic electrical laws.
 Understand the response of different types of electrical circuits to different excitations.
 Understand the measurement, calculation and relation between the basic electrical parameters.
 Understand the basic characteristics of transformers and electrical machines.
List of experiments/demonstrations:
1. Verification of Ohms Law
2. Verification of KVL and KCL
3. Transient Response of Series RL and RC circuits using DC excitation
4. Transient Response of RLC Series circuit using DC excitation
5. Resonance in series RLC circuit
6. Calculations and Verification of Impedance and Current of RL, RC and RLC series circuits.
7. Measurement of Voltage, Current and Real Power in primary and Secondary Circuits of a Single Phase
Transformer
8. Load Test on Single Phase Transformer (Calculate Efficiency and Regulation)
9. Three Phase Transformer: Verification of Relationship between Voltages and Currents (Star-Delta, Delta-Delta,
Delta-star, Star-Star)
10. Measurement of Active and Reactive Power in a balanced Three-phase circuit
11. Performance Characteristics of a Separately/Self Excited DC Shunt/Compound Motor
12. Torque-Speed Characteristics of a Separately/Self Excited DC Shunt/Compound Motor
13. Performance Characteristics of a Three-phase Induction Motor
14. Torque-Speed Characteristics of a Three-phase Induction Motor
15. No-Load Characteristics of a Three-phase Alternator
B.Tech. I Year I Sem. LT PC

0 0 2 0
EN109HS: EMPLOYABILITY SKILLS- I (BUSINESS ENGLISH FOR ENGINEERS)

Introduction
The rapid breakdown of national barriers over the last decade has resulted in English language skills acquiring a great
deal of importance in business sector. Ability to communicate at work place is vital, particularly in the present
professional and business climate. In a world with ever-growing levels of globalization and interconnectivity,
the significance of Business Communication increased rapidly. But lack of exposure towards Business
Communication is a serious handicap for many aspirants. By recognizing this, the institution has focused to train the
Engineering Students for Business Communication and motivating to appear BEC examination which is an
internationally recognized qualification for getting employability. It has been introduced from B.Tech first year
onwards, that can instruct and prepare the students to get the advantage when enter the job world. In today’s
globalization, it is more significant to show employers that you can communicate in English effectively in every-
day business circumstances.
Course Objectives:
• It provides language Skills for real life business situations and improves confidence among
students.
• To train the students to qualify the BEC examination
• Develop study skills and communication skills in formal and informal situations.
Course Outcomes: Students should be able to

• Use Business English Language effectively in spoken and written forms.
• Comprehend the given texts and respond appropriately.
• Communicate confidently in various contexts and different cultures.
• Acquire basic proficiency in English including reading and listening comprehension, writing and speaking
skills
Syllabus
Exercise-I
 Business Communication Skills: Intrapersonal skills and Interpersonal skills.
 Active Listening Skills- Listening Comprehension.
 Reading skills: Skimming and Scanning.
 Verbal Ability: Fundamentals of Grammar - Sentence Structure - Parts of Speech.
 Online Communication- “The power of word of mouse”: an article on the power of online customer opinions
Exercise-II
 Corporate Communication: First impression, Personal Grooming, Corporate & Business etiquettes.
 Business Relationships: Career advice: letters to an advice column, corporate gift-giving, teamwork, thinking
globally- “Global HR Management”: an article.
 Technical and Business Vocabulary: Idioms, Phrases, Collocations, Abbreviations, and Analogy.
 Reading Skills: Intensive Reading and Extensive Reading
Exercise-III
 Presentation Skills: Group Discussion, Presentations Telephone Handling
 Reading Comprehension and Techniques: Interpreting bar charts, pie chart, table, and tree diagram.
 Listening to statistical information: short extracts- “Cafe Coffee Day”: an article on the growth of the Indian
Coffee shop;
Exercise-IV
 Writing skills: Paragraph writing, Business letters, E-mail, Memo, Report and Essay writing.
 Recruitment- Preparing for an interview, Staff development: “Advertisements for training courses: variation
between a memo and an advert: sport and business” an article.
 “Picture Description” including Description of Photos/Images/Posters/Advertisement etc.,
Exercise-V
 Exercises on Common Errors in Grammar: Tenses, Passive forms, Model verbs, Degrees of comparison,
Articles, Reference words, word types and Quantity expressions.
 Usage of Words: Model verbs of obligation, Contrast words, words to describe causes and effects.
 Practice of previous BEC Exam: Listening tracks, Reading, Writing and Speaking parts, Communication
activities, and Exam skills practice.
REFERENCES:
1. Business BENCHMARK,2nd Edition, South Asian Edition Student’s Book- CUP
2. Swan, M. (2016). Practical English Usage. Oxford University Press.
3. Kumar, S and Lata, P. (2018). Communication Skills. Oxford University Press.
4. Wood, F.T. (2007). Remedial English Grammar. Macmillan.
5. Hamp-Lyons, L. (2006). Study Writing. Cambridge University Press.
WEBSITE LINKS:
 http://www.cambridge.org
 http://www.learnenglish.com
 http://www.eslgames.com
 https://www.cambridgeenglish.org/supporting-teachers/
 .https://britishcouncil.zoom.us/webinar/register/WN_Ddm6jFvxTpWAfYwWeZzX_Q
 .https://www.cambridge.org/gb/education/elevate-trial/
 https://learnenglishteens.britishcouncil.org/skills/listening
 https://www.cambridgeenglish.org/teaching-english/resources-for-teachers/webinars/assessing-writing-
introducing-new-teacher-guides/
B.Tech I Year II Sem. LT P C

3 1 0 4
MA201BS: DIFFERENTIAL EQUATIONS AND VECTOR CALCULUS
Course Objectives: To learn

 Methods of solving the differential equations of first and higher order.
 Concepts & properties of Laplace Transforms
 Solving differential equations using Laplace transform techniques
 Evaluation of multiple integrals and their applications.
 The physical quantities involved in engineering field related to vector valued functions
 The basic properties of vector valued functions and their applications to line, surface and volume integrals
 Solve higher differential equation and apply the concept of differential equation to real world problems
 Use Laplace transform techniques for solving DE’s.
 Evaluate the multiple integrals and apply the concept to find areas, volumes.
 Evaluate the line, surface and volume integrals and converting them from one to another.
UNIT-I: First Order ODE

Exact, linear and Bernoulli’s equations; Applications : Newton’s law of cooling, Law of natural growth and decay;
Equations not of first degree: equations solvable for p, equations solvable for y, equations solvable for x and Clairaut’s
type.
UNIT-II: Ordinary Differential Equations of Higher Order
Second order linear differential equations with constant coefficients: Non-Homogeneous terms of the type e as, sin ax ,
cos ax, polynomials in x, easV(x) and x V(x); method of variation of parameters; Equations reducible to linear ODE
with constant coefficients: Legendre’s equation, Cauchy-Euler equation.
UNIT-III: Multivariable Calculus (Integration)
Evaluation of Double Integrals (Cartesian and polar coordinates); change of order of integration (only Cartesian form);
Evaluation of Triple Integrals: Change of variables (Cartesian to polar) for double and (Cartesian to Spherical and
Cylindrical polar coordinates) for triple integrals.
Applications: Areas (by double integrals) and volumes (by double integrals and triple integrals), Centre of mass and
Gravity (constant and variable densities) by double and triple integrals (applications involving cubes, sphere and
rectangular parallelopiped).
UNIT-IV: Vector Differentiation
Vector point functions and scalar point functions. Gradient, Divergence and Curl. Directional derivatives, Tangent
plane and normal line. Vector Identities. Scalar potential functions. Solenoidal and Irrotational vectors.
UNIT-V: Vector Integration
Line, Surface and Volume Integrals. Theorems of Green, Gauss and Stokes (without proofs) and their applications.
TEXT BOOKS:
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition,2010
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,2006
3. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9thEdition,Pearson, Reprint,2002.
REFERENCES:
1. Paras Ram, Engineering Mathematics, 2nd Edition, CBS Publishes
2. S. L. Ross, Differential Equations, 3rd Ed., Wiley India,1984.
B.Tech. I Year II Sem. L T P C

3 0 0 3
CH202BS:-ENGINEERING CHEMISTRY
Course Objectives
 To bring adaptability to the concepts of chemistry and to acquire the required skills to become a perfect
engineer.
 To impart basic knowledge of atomic, molecular and electronic modifications which makes the student to
understand the technology based on them
 To acquire the knowledge of electrochemistry, corrosion and water treatment which are essential for the
Engineers and in industry.
Course Outcomes: The basic concepts included in this course will help the student to gain:
 Identify different types of boiler troubles, choose appropriate method for softening and cleaning of water
 Define and differentiate atomic and molecular orbital, describe band theory for solid
 Compare and contrast the chemical behavior & physical properties of polymers .Identify the materials &
methods that prevent corrosion in a particular environment
 Explain different types of electrode, electrode potential and determine EMF of a cell using Nernst equation
 Understanding on different types of fuels, their synthesis and analysis
UNIT-I:
Water and its treatment
Introduction – hardness of water – causes of hardness – types of hardness: temporary and permanent – expression and
units of hardness – Estimation of hardness of water by complexometric method. Numerical problems. Boiler troubles:
Sludges, scales and Caustic embrittlement. Boiler feed water and its treatment –Internal treatment(Calgon conditioning,
Phosphate conditioning and Colloidal conditioning). External Treatment- Softening of water by ion exchange
processes.
Potable water – specifications, steps involved in the treatment of potable water - Disinfection of potable water by
chlorination and Ozonization Desalination of water – Reverse osmosis
Unit-II:
Molecular structure and Theories of Bonding: Atomic and Molecular orbitals
Linear Combination of Atomic Orbitals (LCAO), molecular orbital of diatomic molecules, molecular energy level
diagram of N2, O2, and F2 molecules. π-molecular orbitals of butadiene and benzene.
Crystal Field Theory (CFT): Salient Features of CFT- Crystal Field Splitting of Transition metal ion d-orbitals in
Tetrahedral, Octahedral and square planar geometries. Band structure of solids and effect of doping on conductance.
Unit-III:
Electrochemistry & Batteries
Electrochemistry: Electrochemical cells: Daniel cell – cell notation, cell reaction and cell EMF – Numerical problems.
Electrochemical series and its applications- Nernst equation . Construction and functioning of Standard hydrogen
electrode, calomel electrode, Quinhydrone and glass electrode. Determination of pH of a solution by using
Quinhydrone and glass electrode.
Batteries: Primary (Lithium cell) and secondary batteries (Lead – acid storage battery and Lithium ion battery).
Fuel cells: Hydrogen–Oxygen fuel cell, Methanol-Oxygen fuel cell ,Advantages and Applications.
UNIT-IV:
Fuels and Combustions.
Classification – solid fuels: coal – analysis of coal - proximate and ultimate analysis and their significance.
Liquid fuels – petroleum and its refining – cracking – types – fixed bed catalytic cracking. Knocking – octane and
cetane rating, synthetic petrol, Bergius and Fischer-Tropsch’s process.
Gaseous fuels - constituents, characterstics and applications of natural gas, LPG and CNG. Analysis of flue gas by
Orsat’s apparatus – Numerical Problems.
Combustion – Definition, Calorific value of fuel – HCV, LCV; Determination of calorific value by Junker’s gas
calorimeter – theoretical calculation of Calorific value by Dulong’s formula – Numerical problems on combustion.
Unit-V:
Engineering Materials and Corrosion
Polymers: Introduction, classification and mechanism of polymerisation- Addition (Free radical polymerisation
mechanism and Condensation polymerisation. Classification of polymers - Thermoplastics & Thermosetting resins.
Types of Polymerization of polymers (i) Addition (ii) Condensation (iii) Co-Polymerization.
Preparation, properties and engineering application of PVC, Teflon and Bakelite. Fibers- characteristics of fibers –
preparation, properties and uses of Nylon – 6,6 and Dacron – Fiber Reinforced Plastics (FRP) Glass Fibres –
applications. Rubber – Natural rubber and its vulcanization. Synthetic Elastomers- Buna S, Butyl rubber and Thiokol
Rubber.
Conducting polymers: Introduction, classification and mechanism of conduction in Poly-acetylene, applications of
conducting polymers.
Biodegradable polymers: Introduction preparation, properties and applications of polylactic acid
Corrosion: Causes and effects of corrosion – theories of chemical and electrochemical corrosion – mechanism of
electrochemical corrosion, Types of wet corrosion: Galvanic, water-line and pitting corrosion. Factors affecting rate of
corrosion- nature of metal and nature of environment– Corrosion control methods – Cathodic protection (sacrificial
anodic and impressed current). Surface coatings: Metallic coatings & methods of application of metallic coatings - hot
dipping (galvanization & tinning), metal cladding, Electroless plating ( Ni plating)
TEXT BOOKS:
1. Engineering Chemistry by P.C Jain and M.Jain, Dhanpatrai Publishing Company, New Delhi 2010.
2. Engineering Chemistry by Prasanta Rath,B. Rama Devi, Ch.Venkata Ramana Reddy and subhendu
Chakroborty, Cengage learning, New Delhi. 2019.
3. Physical Chemistry, by P.W. Atkins
REFERENCE BOOKS
1. Engineering Chemistry by B. Siva Shankar Mc.Graw Hill Publishing Company Limited, New Delhi 3 rd, 2015
2. Text Book of Engineering Chemistry by S.S. Dara &Mukkati S. Chand & Co Publishers, New Delhi (2010)

3 0 0 3
CS203ES: DATA STRUCTURES
Common for CSE, CSM, CSD, CSC, INF, ECE and ME
Prerequisites: A course on “Programming for Problem Solving”.
Course Objectives:
 Exploring basic data structures such as stacks and queues.
 Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs.
 Introduces sorting and pattern matching algorithms
Course Outcomes:
 Ability to select the data structures that efficiently model the information in a problem.
 Ability to assess efficiency trade-offs among different data structure implementations or combinations.
 Implement and know the application of algorithms for sorting and pattern matching.
 Design programs using a variety of data structures, including hash tables, binary and general tree structures,
search trees, tries, heaps, graphs, and AVL-trees.
UNIT - I
Introduction to Data Structures, abstract data types, Linear list – singly linked list implementation, insertion, deletion
and searching operations on linear list, Stacks-Operations, array and linked representations of stacks, stack
applications, Queues-operations, array and linked representations.
UNIT - II
Dictionaries: linear list representation, skip list representation, operations - insertion, deletion and searching.
Hash Table Representation: hash functions, collision resolution-separate chaining, open addressing-linear probing,
quadratic probing, double hashing, rehashing, extendible hashing.
UNIT - III
Search Trees: Binary Search Trees, Definition, Implementation, Operations- Searching, Insertion and Deletion, AVL
Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and Searching, Red –Black, Splay Trees.
UNIT - IV
Graphs: Graph Implementation Methods. Graph Traversal Methods.
Sorting: Heap Sort, External Sorting- Model for external sorting, Merge Sort.
UNIT - V
Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer –Moore algorithm, the Knuth-
Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries.
TEXTBOOKS:
1. Fundamentals of Data Structures in C, 2 ndEdition, E. Horowitz, S. Sahni and Susan Anderson Freed,
Universities Press.
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson Education.
REFERENCE BOOKS:
1. Data Structures: A Pseudocode Approach with C, 2 ndEdition, R. F. Gilberg and B.A. Forouzan, Cengage
Learning.
B.Tech I Year II Sem. LTPC

104 3
ME204ES: ENGINEERING GRAPHICS
Pre-requisites: Nil
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: At the end of the course, the student will be able to:
• Preparing working drawings to communicate the ideas and information.
• Read, understand and interpret engineering drawings.
• Estimate different projections of lines, planes, solids and sectional views
• Able to sketch two-dimensional orthographic drawings and three-dimensional isometric views
• Create and modify two-dimensional orthographic drawings using Auto CAD software
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, Scales – Plain &
Diagonal.
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 - Sections or Sectional views of Right Regular Solids – Prism,
Cylinder, Pyramid, Cone – Auxiliary views – Sections of Sphere
UNIT – IV
Development of Surfaces of Right Regular Solids – Prism, Cylinder, Pyramid and Cone, Intersection of Solids:
Intersection of – Prism vs Prism- Cylinder Vs Cylinder
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
Introduction to CAD:
Introduction to CAD Software Package Commands.- Free Hand Sketches of 2D- Creation of 2D Sketches by CAD
Package
TEXTBOOKS:
1. Engineering Drawing N.D. Bhatt /Charotar
2. Engineering Drawing / N. S. Parthasarathy and Vela Murali/Oxford
REFERENCE BOOKS:
1. Engineering Drawing / Basant Agrawal and McAgrawal/ McGrawHill
2. Engineering Drawing/ M. B. Shah, B.C. Rane /Pearson.
3. Computer Aided Engineering Drawing – K Balaveera Reddy et al – CBSPublishers
4. Engineering Drawing and Graphics / K.Venugopal/ New Age InternationalPublishers
5. Engineering Drawing / K.L.Narayana, P.kannaiah/SCITECH
B.Tech. I Year II Sem. LTPC

2 00 2
EN205HS: ENGLISH
INTRODUCTION
In view of the growing importance of English as a tool for global communication and the consequent emphasis on
training students to acquire language skills, the syllabus of English has been designed to develop linguistic,
communicative and critical thinking competencies of Engineering students.
In English classes, the focus should be on the skills development in the areas of vocabulary, grammar, reading and
writing. For this, the teachers should use the prescribed text for detailed study. The students should be encouraged to
read the texts leading to reading comprehension and different passages may be given for practice in the class.
Learning Objectives: The course will help to

a. Improve the language proficiency of students in English with an emphasis on Vocabulary, Grammar, Reading
and Writing skills.
b. equip students to study academic subjects more effectively and critically using the theoretical and practical
components of English syllabus.
c. develop study skills and communication skills in formal and informal situations.
Course Outcomes: Students should be able to

 use English Language effectively in spoken and written forms.
 comprehend the given texts and respond appropriately.
 communicate confidently in various contexts and different cultures.
 acquire basic proficiency in English including reading and listening comprehension, writing and speaking
skills.
SYLLABUS
UNIT –I:
‘The Raman Effect’ from the prescribed textbook ‘English for Engineers’ published by
Cambridge University Press.
Vocabulary Building: The Concept of Word Formation --The Use of Prefixes and Suffixes. Grammar: Identifying
Common Errors in Writing with Reference to Articles and Prepositions.
Reading: Reading and Its Importance- Techniques for Effective Reading.
Writing: Paragraph writing – Types, Features of a Paragraph - Creating Coherence-Organizing Principles of
Paragraphs in Documents. Importance of Proper Punctuation
UNIT –II:
‘Ancient Architecture in India’ from the prescribed textbook ‘English for Engineers’ published by Cambridge
University Press.
Vocabulary: Synonyms and Antonyms, Idioms and Phrases.
Grammar: Identifying Common Errors in Writing with Reference to Noun-pronoun Agreement and Subject-verb
Agreement.
Reading: Improving Reading Comprehension Skills – Techniques for Good Comprehension
Writing: Writing Formal Letters E.g.., Letter of Complaint, Letter of Requisition, and Job Application with Resume.
UNIT –III:
‘Blue Jeans’ from the prescribed textbook ‘English for Engineers’ published by Cambridge University Press.
Vocabulary: Collocations, one word substitute
Grammar: Identifying Common Errors in Writing with Reference to Misplaced Modifiers and Tenses.
Reading: Sub-skills of Reading- Skimming and Scanning
Writing: Defining- Describing Objects, Places and Events – Classifying- Providing Examples or Evidence
UNIT –IV:
‘What Should You Be Eating’ from the prescribed textbook ‘English for Engineers’ published by Cambridge
University Press.
Vocabulary: Standard Abbreviations in English, Verbal Analogy.
Grammar: Redundancies in Oral and Written Communication, Tag questions.
Reading: sub skills- Intensive Reading and Extensive Reading
Writing: Writing Practices- Essay Writing and Précis Writing.
UNIT –V:
‘Mokshagundam Visvesvaraya’ from the prescribed text book by JNTUH ‘Epitome of Wisdom’ - Maruthi
Publications.
Vocabulary: Technical Vocabulary and their Usage
Grammar: Error identification
Reading: “If Poem” by Rudyard Kipling
Writing: Creative writing- Advertisement making, Poster preparation, Technical Reports- Characteristics of a Report
Writing,
PRESCRIBED TEXTBOOK:
1. Sudarshana, N.P. and Savitha, C. (2018). English for Engineers. Cambridge University Press.
2. ‘Epitome of Wisdom’ - Maruthi Publications.
3. Handouts for ‘If’ poem.
REFERENCES:
1. Swan, M. (2016). Practical English Usage. Oxford University Press.
2. Kumar, S and Lata, P.(2018). Communication Skills. Oxford University Press.
3. Wood, F.T. (2007).Remedial English Grammar. Macmillan.
4. Zinsser, William. (2001). On Writing Well. Harper Resource Book.
5. Hamp-Lyons, L. (2006).Study Writing. Cambridge University Press.
6. Exercises in Spoken English. Parts I –III. CIEFL, Hyderabad. Oxford University Press.
B.Tech. I Year II Sem. LT P C

0 0 3 1.5
CH206BS: ENGINEERING CHEMISTRY LAB
LIST OF EXPERIMENTS: (PERFORM ANY 10 EXPERIMENTS)
Volumetric Analysis:
Experiment No. 1: Determination total hardness of water by complexometric method using EDTA.
Experiment No. 2: Estimation of ferrous iron in the given solution by permanganometry.
Experiment No. 3: Estimation of amount of chloride in water.
Conductometry:
Experiment No. 4: Estimation of HCl by Conductometric titrations
Experiment No. 5: Estimation of Acetic acid by Conductometric titrations
Potentiometry:
Experiment No. 6: Estimation of Ferrous iron by Potentiometry using KMnO4
Experiment No. 7: Estimation of HCl by Potentiometry using NaOH
pH Metry:
Experiment No. 8: Estimation of HCl by pH Metry using NaOH
Colorimetry:
Experiment No. 9: Estimation of Manganese by Colorimetry.
Physical properties:
Experiment No. 10: Determination of surface tension of liquid by using stalagmometer
Experiment No. 11: Determination of viscosity of liquid by using Ostwald’s viscometer.
Drug Synthesis:
Experiment No. 12: Preparation of Aspirin and Paracetamol.
B.Tech I Year II Sem. L T PC

0 0 2 1
CS207ES: DATA STRUCTURES LAB
Common for CSE, CSM, CSD, CSC, INF, ECE and ME
Prerequisites: A Course on “Programming for problem solving”.

Course Objectives:
 It covers various concepts of C programming language
 It introduces searching and sorting algorithms
 It provides an understanding of data structures such as stacks and queues.
Course Outcomes:
 Ability to develop C programs for computing and real-life applications using basic elements like control
statements, arrays, functions, pointers and strings, and data structures like stacks, queues and linked lists.
 Ability to Implement searching and sorting algorithms
LIST OF EXPERIMENTS
1. Write a program that uses functions to perform the following operations on singly linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
2. Write a program that uses functions to perform the following operations on doubly linked list.:
3. Write a program that uses functions to perform the following operations on circular linked list.:
4. Write a program that implement stack (its operations)using
i) Arrays ii) Pointers
5. Write a program that implement Queue (its operations)using
i) Arrays ii) Pointers
6. Write a program that implements the following sorting methods to sort a given list of integers in ascending
order
i) Bubble sort ii) Selection sort iii) Insertion sort
7. Write a program that use both recursive and non recursive functions to perform the following searching
operations for a Key value in a given list of integers:
i) Linear search ii) Binary search
8. Write a program to implement the tree traversal methods.
9. Write a program to implement the graph traversal methods.
TEXTBOOKS:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson Freed,
Universities Press.
2. Data Structures using C–A.S.Tanenbaum,Y.Langsam, and M.J.Augenstein,
PHI/Pearson Education.
REFERENCES:
1. Data Structures: A Pseudocode Approach with C, 2 nd Edition, R. F. Gilberg and B. A. Forouzan, Cengage
Learning.

0 0 3 1.5
EN208HS: ENGLISH LANGUAGE AND COMMUNICATION SKILS LAB
The Language Lab focuses on the production and practice of sounds of language and familiarizes the students with the
use of English in everyday situations both in formal and informal contexts.
Course Objectives:
• To facilitate computer-assisted multi-media instruction enabling individualized and independent language
learning
• To sensitize students to the nuances of English speech sounds, word accent, intonation and rhythm
• To bring about a consistent accent and intelligibility in students’ pronunciation of English by providing an
opportunity for practice in speaking
• To improve the fluency of students in spoken English and neutralize their mother tongue influence
• To train students to use language appropriately for public speaking and interviews
Learning Outcomes: Students will be able to attain
• Better understanding of nuances of English language through audio- visual experience and group activities
• Neutralization of accent for intelligibility
• Speaking skills with clarity and confidence which in turn enhances their employability skills
Syllabus
English Language and Communication Skills Lab (ELCS) shall have two parts:
a. Computer Assisted Language Learning (CALL) Lab
b. Interactive Communication Skills (ICS) Lab
Listening Skills
Objectives
1. To enable students develop their listening skills so that they may appreciate its role in the LSRW skills
approach to language and improve their pronunciation
2. To equip students with necessary training in listening so that they can comprehend the speech of people of
different backgrounds and regions
Students should be given practice in listening to the sounds of the language, to be able to recognize them and find the
distinction between different sounds, to be able to mark stress and recognize and use the right intonation in sentences.
 Listening for general content
 Listening to fill up information
 Intensive listening
 Listening for specific information
Speaking Skills
Objectives
 To involve students in speaking activities in various contexts
 To enable students express themselves fluently and appropriately in social and professional contexts
 Oral practice: Just A Minute (JAM) Sessions
 Describing objects/situations/people
 Role play – Individual/Group activities
Exercise – I
CALL Lab: Introduction to Phonetics – Speech Sounds – Vowels and Consonants.
ICS Lab: Ice-Breaking Activity and JAM Session
Exercise – II
CALL Lab: Structure of Syllables – Past Tense Marker and Plural Marker, Weak Forms and Strong Forms.
ICS Lab: Situational Dialogues – Role Play- Expressions in Various Situations –Making Requests and Seeking
Permissions - Telephone Etiquette.
Exercise - III
CALL Lab: Minimal Pairs- Word Accent and Stress Shifts.
ICS Lab: Listening for General Details, Oral Presentations, instructions on formal presentations and Practice.
Exercise – IV
CALL Lab: Listening for Specific Details, Intonation and Common Errors in Pronunciation.
ICS Lab: Group Discussion for General Purpose
Exercise – V
CALL Lab: Neutralization of Mother Tongue Influence and Conversation Practice
ICS Lab: Introduction to Interview Skills: Mock Interviews.
Minimum Requirement of infrastructural facilities for ELCS Lab:

1. Computer Assisted Language Learning (CALL) Lab:
The Computer Assisted Language Learning Lab has to accommodate 40 students with
40 systems, with one Master Console, LAN facility and English language learning software for self- study by
students.
System Requirement (Hardware component):

Computer network with LAN facility (minimum 40 systems with multimedia) with the following specifications:
i) Computers with Suitable Configuration
ii) High Fidelity Headphones
2. Interactive Communication Skills (ICS) Lab:
The Interactive Communication Skills Lab: A Spacious room with movable chairs and audio-visual aids
with a Public-Address System, a LCD and a projector etc.
B.Tech. I Year II Sem. LT P C

0 0 2 0
MA209BS: EMPLOYABILITY SKILLS-II (APTITUDE)
Course Objectives:
 To enhance the problem solving skills, to improve the basic mathematical skills and to help students who are
preparing for any type of competitive examinations.
Course Outcomes:
 Students will be expected to actively do mathematics such as analyzing data, constructing hypotheses, solving
problems, reflecting on their work, and making connections. The Quantitative techniques is organized around
big mathematical and statistical concepts.
Unit-I:
H.C.F & L.C.M: Division Method, Factorisation method, H.C.F.& L.C.M. of fractions.
Averages: Arithmetic mean, Geometric mean, Harmonic mean.
Problems on Ages: using algebraic equations.
Percentages: Percentage difference, Percentage increase & decrease, fraction to Percentage, Percentage vs per cent.
Unit-II:
Profit & Loss: Cost price, selling price, percentages of profit & loss.
Partnerships: definition, Ratio of division of gains, working and sleeping partners.
Simple & compound interest: Principal amount, interest, time & rate of interest.
Unit-III:
Time & Work: Introduction, time & work by using fractions and percentages, negative work.
Pipes & Cisterns: Inlet, Outlet, time to emptying & filling a tank.
Unit-IV:
Time & Distance: Time, speed, Average and Distance related problems.
Boats & Streams: Upstream, downstream, still water, stream related problems. Average speed, distance, speed when
time is given.
Problems on trains: pass a point, Stationary object of length, moving objects same & opposite directions.
Unit-V:
Permutations & Combinations: Definitions, permutations with repetitions allowed & not allowed, rank of dictionary
words.
Probability: Basic definitions, axioms, addition theorem, conditional probability, multiplication theorem, total
probability theorem, baye’s theorem.
TEXTBOOKS:
1. Quantitative aptitude by Dr.R.S.Aggarwal, S.Chand publications
REFERENCES:
1. https://amzn.to/2ZPul7k
2. https://amzn.to/2LjDsI4.

II YEAR I SEMESTER

1 CS301PC Database Management Systems 3 0 0 3
2 CS302PC Computer Organization and Architecture 3 1 0 4
3 CS303PC Operating Systems 3 0 0 3
4 CS304PC Object Oriented Programming through Java 3 0 0 3
5 CS305PC Discrete Mathematics 3 0 0 3
6 CS306PC Database Management Systems Lab 0 0 2 1
7 CS307PC Operating Systems Lab 0 0 3 1.5
8 CS308PC Java Programming Lab 0 0 3 1.5
9 *MC309 Gender Sensitization Lab 0 0 2 0
10 MC310 Employability Skills-III 0 0 2 0
II YEAR II SEMESTER

1 SM401MS Business Economics & Financial Analysis 3 0 0 3
2 MA402BS Computer Oriented Statistical Methods 3 1 0 4
3 CS403PC Python Programming 3 0 0 3
4 CS404ES Analog & Digital Electronics 3 0 0 3
5 CS405PC Software Engineering 3 0 0 3
6 CS406PC Python programming Lab 0 0 3 1.5
7 CS407ES Analog & Digital Electronics Lab 0 0 2 1
8 CS408PC Software Engineering Lab 0 0 3 1.5
9 *MC409 Environmental Science 3 0 0 0
10 MC410 Employability Skills-IV 0 0 2 0

L T P C
B.TECH II Year I Sem.
3 0 0 3
CS301PC: DATABASE MANAGEMENT SYSTEMS
Common to CSE, CSD and CSC
Prerequisites: A course on “Data Structures.

Course Objectives:
 To understand the basic concepts and the applications of database systems.
 To master the basics of SQL and construct queries using SQL.
 Topics include data models, database design, relational model, relational algebra, transaction control,
concurrency control, storage structures and access techniques.
Course Outcomes:
 Gain knowledge of fundamentals of DBMS, database design and normal forms
 Master the basics of SQL for retrieval and management of data.
 Be acquainted with the basics of transaction processing and concurrency control.
 Familiarity with database storage structures and access techniques
UNIT - I
Database System Applications: A Historical Perspective, File Systems versus a DBMS, the Data Model, Levels of
Abstraction in a DBMS, Data Independence, Structure of a DBMS
Introduction to Database Design: Database Design and ER Diagrams, Entities, Attributes, and Entity Sets,
Relationships and Relationship Sets, Additional Features of the ER Model, Conceptual Design With the ER Model
UNIT - II
Introduction to the Relational Model: Integrity constraint over relations, enforcing integrity constraints, querying
relational data, logical data base design, introduction to views, destroying/altering tables and views.
Relational Algebra, Tuple relational Calculus, Domain relational calculus.
UNIT - III
SQL: QUERIES, CONSTRAINTS, TRIGGERS: form of basic SQL query, UNION, INTERSECT, and EXCEPT,
Nested Queries, aggregation operators, NULL values, complex integrity constraints in SQL, triggers and active data
bases.
Schema Refinement: Problems caused by redundancy, decompositions, problems related to decomposition, reasoning
about functional dependencies, FIRST, SECOND, THIRD normal forms, BCNF, lossless join decomposition, multi-
valued dependencies, FOURTH normal form, FIFTH normal form.
UNIT - IV
Transaction Concept, Transaction State, Implementation of Atomicity and Durability, Concurrent Executions,
Serializability, Recoverability, Implementation of Isolation, Testing for serializability, Lock Based Protocols,
Timestamp Based Protocols, Validation- Based Protocols, Multiple Granularity, Recovery and Atomicity, Log–Based
Recovery, Recovery with Concurrent Transactions.
UNIT - V
Data on External Storage, File Organization and Indexing, Cluster Indexes, Primary and Secondary Indexes, Index data
Structures, Hash Based Indexing, Tree base Indexing, Comparison of File Organizations, Indexes and Performance
Tuning, Intuitions for tree Indexes, Indexed Sequential Access Methods (ISAM), B+ Trees: A Dynamic Index Structure.
TEXT BOOKS:
1. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata Mc GrawHill 3rd Edition
2. Database System Concepts, Silberschatz, Korth, Mc Graw hill, Vedition.
REFERENCES:
1. Database Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7thEdition.
2. Fundamentals of Database Systems, Elmasri Navrate, Pearson Education
3. Introduction to Database Systems, C. J. Date, Pearson Education
4. Oracle for Professionals, The X Team, S.Shah and V. Shah,SPD.
5. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL,Shah,PHI.
6. Fundamentals of Database Management Systems, M. L. Gillenson, Wiley Studen tEdition.
B.TECH II Year I Sem. L T P C

3 1 0 4
CS302PC: COMPUTER ORGANIZATION AND ARCHITECTURE
Common to CSE, INF, CSM and CSC
Pre-requisite: A Course on “Digital Logic Design and Microprocessors”.

Course Objectives:
 The purpose of the course is to introduce principles of computer organization and the basic architectural
concepts.
 It begins with basic organization, design, and programming of a simple digital computer and introduces simple
register transfer language to specify various computer operations.
 Topics include computer arithmetic, instruction set design, micro programmed control unit, pipelining and
vector processing, memory organization and I/O systems, and multiprocessors
Course Outcomes:
 Understand the basics of instructions sets and their impact on process or design.
 Demonstrate an understanding of the design of the functional units of a digital computer system.
 Evaluate cost performance and design trade-offs in designing and constructing a computer processor including
memory.
 Design a pipeline for consistent execution of instructions with minimum hazards.
 Recognize and manipulate representations of numbers stored in digital computers
UNIT - I
Digital Computers: Introduction, Block diagram of Digital Computer, Definition of Computer Organization, Computer
Design and Computer Architecture.
Register Transfer Language and Micro operations: Register Transfer language, Register Transfer, Bus and memory
transfers, Arithmetic Micro operations, logic micro operations, shift micro operations, Arithmetic logic shift unit.
Basic Computer Organization and Design: Instruction codes, Computer Registers Computer instructions, Timing and
Control, Instruction cycle, Memory Reference Instructions, Input – Output and Interrupt.
UNIT - II
Microprogrammed Control: Control memory, Address sequencing, micro program example, design of control unit.
Central Processing Unit: General Register Organization, Instruction Formats, Addressing modes, Data Transfer and
Manipulation, Program Control.
UNIT - III
Data Representation: Data types, Complements, Fixed Point Representation, Floating Point Representation.
Computer Arithmetic: Addition and subtraction, multiplication Algorithms, Division Algorithms, Floating – point
Arithmetic operations. Decimal Arithmetic unit, Decimal Arithmetic operations.
UNIT - IV
Input-Output Organization: Input-Output Interface, Asynchronous data transfer, Modes of Transfer, Priority Interrupt
Direct memory Access.
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary memory, Associate Memory, Cache Memory.
UNIT - V
Reduced Instruction Set Computer: CISC Characteristics, RISC Characteristics.
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC
Pipeline, Vector Processing, Array Processor.
Multi Processors: Characteristics of Multiprocessors, Interconnection Structures, Interprocessor arbitration,
Interprocessor communication and synchronization, Cache Coherence.
TEXT BOOKS:
1. Computer System Architecture – M. Moris Mano, Third Edition, Pearson/PHI.
REFERENCES:
1. Computer Organization – Car Hamacher, Zvonks Vranesic, Safea Zaky, V th Edition, McGraw Hill.
2. Computer Organization and Architecture – William Stallings Sixth Edition,Pearson/PHI.
3. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition,PHI/Pearson.

B.TECH II Year I Sem. LT P C

3 0 0 3
CS303PC: OPERATING SYSTEMS
Common to CSE, INF, CSM, CSD and CSC
Prerequisites:
 A course on “Computer Programming and Data Structures”.
 A course on “Computer Organization and Architecture”.
Course Objectives:
 Provide an introduction to operating system concepts (i.e., processes, threads, scheduling, synchronization,
deadlocks, memory management, file and I/O subsystems and protection)
 Introduce the issues to be considered in the design and development of operating system
 Introduce basic Unix commands, system call interface for process management, inter process communication
and I/O in Unix
Course Outcomes:
 Will be able to control access to a computer and the files that may be shared
 Demonstrate the knowledge of the components of computer and their respective roles in computing.
 Ability to recognize and resolve user problems with standard operating environments.
 Gain practical knowledge of how programming languages, operating systems, and architectures interact and how
to use each effectively.
UNIT - I
Operating System - Introduction, Structures - Simple Batch, Multiprogrammed, Time-shared, Personal Computer,
Parallel, Distributed Systems, Real-Time Systems, System components, Operating System services, System Calls
UNIT - II
Process and CPU Scheduling - Process concepts and scheduling, Operations on processes, Cooperating Processes,
Threads, and Interposes Communication, Scheduling Criteria, Scheduling Algorithms, Multiple -Processor Scheduling.
System call interface for process management-fork, exit, wait, waitpid, exec
UNIT - III
Deadlocks - System Model, Deadlocks Characterization, Methods for Handling Deadlocks, Deadlock Prevention,
Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock
Process Management and Synchronization - The Critical Section Problem, Synchronization Hardware, Semaphores,
and Classical Problems of Synchronization, Critical Regions, Monitors Interprocess Communication Mechanisms:
IPC between processes on a single computer system, IPC between processes on different systems, using pipes, FIFOs,
message queues, shared memory.
UNIT - IV
Memory Management and Virtual Memory - Logical versus Physical Address Space, Swapping, Contiguous
Allocation, Paging, Segmentation, Segmentation with Paging, Demand Paging, Page Replacement, Page Replacement
Algorithms.
UNIT - V
File System Interface and Operations -Access methods, Directory Structure, Protection, File System Structure,
Allocation methods, Free-space Management. Usage of open, create, read, write, close, lseek, stat, ioctl system calls.
TEXT BOOKS:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7 th Edition, JohnWiley
2. Advanced programming in the UNIX environment, W.R. Stevens, Pearson education.
REFERENCE BOOKS:
1. Operating Systems – Internals and Design Principles Stallings, Fifth Edition–2005, Pearson Education/PHI
2. Operating System A Design Approach- Crowley,TMH.
3. Modern Operating Systems, Andrew S. Tanenbaum 2nd edition,Pearson/PHI
4. UNIX programming environment, Kernighan and Pike, PHI/ PearsonEducation
5. UNIX Internals -The New Frontiers, U. Vahalia, PearsonEducation.


3 0 0 3
CS304PC: OBJECT ORIENTED PROGRAMMING THROUGH JAVA
Common to CSE and INF
Course Objectives:
 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 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.
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.
 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, 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.
UNIT - II
Packages- Defining a Package, CLASSPATH, Access protection, importing packages, Interfaces- defining an interface,
implementing interfaces, Nested interfaces, applying 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 multitasking, Java thread model,
creating threads, thread priorities, synchronizing threads, inter thread communication.
UNIT - IV
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
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, 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, 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.
REFERENCE BOOKS:
1. An Introduction to programming and OO design using Java, J. Nino and F.A. Hosch, John Wiley &sons
2. Introduction to Java programming, Y. Daniel Liang, Pearson Education.
3. Object Oriented Programming through Java, P. Radha Krishna, University 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.


3 0 0 3
CS305PC: DISCRETE MATHEMATICS
Common to CSE, INF and CSM
Prerequisites: An understanding of Mathematics in general is sufficient.

Course Objectives
 Introduces the elementary discrete mathematics for computer science and engineering.
 Topics include formal logic notation, methods of proof, induction, sets, relations, graph theory, permutations and
combinations, counting principles; recurrence relations and generating functions.
Course Outcomes:
 Ability to understand and construct precise mathematical proofs
 Ability to use logic and set theory to formulate precise statements
 Ability to analyze and solve counting problems on finite and discrete structures
 Ability to describe and manipulate sequences
 Ability to apply graph theory in solving computing problems
UNIT - I
The Foundations: Logic and Proofs: Propositional Logic, Applications of Propositional Logic, Propositional
Equivalence, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs, Proof Methods
and Strategy.
UNIT - II
Basic Structures, Sets, Functions, Sequences, Sums, Matrices and Relations Sets, Functions, Sequences & Summations,
Cardinality of Sets and Matrices Relations, Relations and Their Properties, n-ary Relations and Their Applications,
Representing Relations, Closures of Relations, Equivalence Relations, Partial Orderings.
UNIT - III
Algorithms, Induction and Recursion: Algorithms, The Growth of Functions, Complexity of Algorithms
Induction and Recursion: Mathematical Induction, Strong Induction and Well-Ordering, Recursive Definitions and
Structural Induction, Recursive Algorithms, Program Correctness
UNIT - IV
Discrete Probability and Advanced Counting Techniques: An Introduction to Discrete Probability, Probability
Theory, Bayes’ Theorem, Expected Value and Variance
Advanced Counting Techniques: Recurrence Relations, Solving Linear Recurrence Relations, Divide-and-Conquer
Algorithms and Recurrence Relations, Generating Functions, Inclusion- Exclusion, Applications of Inclusion-Exclusion
UNIT - V
Graphs: Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Representing Graphs and Graph
Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path Problems, Planar Graphs, Graph Coloring.
Trees: Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees
TEXT BOOKS:
1. Discrete Mathematics and its Applications with Combinatorics and Graph Theory- Kenneth HRosen, 7 th Edition,
TMH.
REFERENCES BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science-J.P. Tremblayand R. Manohar, TMH,
2. Discrete Mathematics for Computer Scientists & Mathematicians: Joe L. Mott, Abraham Kandel, Teodore P.
Baker, 2nd ed, Pearson Education.
3. Discrete Mathematics- Richard Johnsonbaugh, 7Th Edn., Pearson Education.
4. Discrete Mathematics with Graph Theory- Edgar G. Goodaire, Michael M.Parmenter.
5. Discrete and Combinatorial Mathematics - an applied introduction: Ralph.P. Grimald, 5 th edition, Pearson
Education.

L T P C
0 0 2 1
CS306PC: DATABASE MANAGEMENT SYSTEMS LAB
Common to CSE, CSD and CSC
Co-requisites:
 Co-requisite of course “Database Management Systems”
Course Objectives:
 Introduce ER data model, database design and normalization
 Learn SQL basics for data definition and data manipulation
Course Outcomes:
 Design database schema for a given application and apply normalization
 Acquire skills in using SQL commands for data definition and data manipulation.
 Develop solutions for database applications using procedures, cursors and triggers
LIST OF EXPERIMENTS:
1. Concept design with E-R Model
2. Relational Model
3. Normalization
4. Practicing DDL commands
5. Practicing DML commands
6. Querying (using ANY, ALL, IN, Exists, NOT EXISTS, UNION, INTERSECT, Constraints etc.)
7. Queries using Aggregate functions, GROUP BY, HAVING and Creation and dropping of Views.
8. Triggers (Creation of insert trigger, delete trigger, update trigger)
9. Procedures
10. Usage of Cursors
TEXT BOOKS:
1. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata Mc Graw Hill, 3rdEdition
2. Database System Concepts, Silberschatz, Korth, McGraw Hill, Vedition.
REFERENCES BOOKS:
1. Database Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7thEdition.
2. Fundamentals of Database Systems, Elmasri Navrate, Pearson Education
3. Introduction to Database Systems, C.J. Date, Pearson Education
4. Oracle for Professionals, The X Team, S. Shah and V. Shah,SPD.
5. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL, Shah,PHI.
6. Fundamentals of Database Management Systems, M. L. Gillenson, Wiley Student Edition.

0 0 3 1.5
CS307PC: OPERATING SYSTEMS LAB (Using UNIX/LINUX)

Common to CSE, INF, CSM, CSD and CSC
Prerequisites:
 A course on “Programming for Problem Solving”.
 A course on “Computer Organization and Architecture”.
Co-requisite:
 A course on “Operating Systems”.
Course Objectives:
 To provide an understanding of the design aspects of operating system concepts through simulation
 Introduce basic Unix commands, system call interface for process management, interprocess communication and
I/O in Unix
Course Outcomes:
 Simulate and implement operating system concepts such as scheduling, deadlock management, file management
and memory management.
 Able to implement C programs using Unix system calls
1. Write C programs to simulate the following CPU Scheduling algorithms
a) FCFS b)SJF c)Round Robin d)priority
2. Write programs using the I/O system calls of UNIX/LINUX operating system (open, read, write, close, fcntl,
seek, stat, opendir, readdir)
3. Write a C program to simulate Bankers Algorithm for Deadlock Avoidance and Prevention.
4. Write a C program to implement the Producer – Consumer problem using semaphores using UNIX/LINUX
system calls.
5. Write C programs to illustrate the following IPC mechanisms
a) Pipes b) FIFOs c) Message Queues d) Shared
Memory
6. Write C programs to simulate the following memory management techniques
a) Paging b) Segmentation
TEXT BOOKS:
1. Operating System Principles- Abraham Silberschatz, Peter B. Galvin, Greg Gagne 7th Edition, John Wiley
2. Advanced programming in the Unix environment, W.R. Stevens, Pearson education.
REFERENCE BOOKS:
1. Operating Systems – Internals and Design Principles, William Stallings, Fifth Edition–2005, Pearson
Education/PHI
2. Operating System - A Design Approach-Crowley,TMH.
3. Modern Operating Systems, Andrew S Tanenbaum, 2nd edition,Pearson/PHI
4. UNIX Programming Environment, Kernighan and Pike, PHI/Pearson Education
5. UNIX Internals: The New Frontiers, U. Vahalia, Pearson Education
L T P C
B.TECH II Year I Sem
0 0 3 1.5
CS308PC: JAVA PROGRAMMING LAB
Course Objectives:
 To write programs using abstract classes.
 To write programs for solving real world problems using java collection framework.
 To write multithreaded programs.
 To write GUI programs using swing controls in Java.
 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 framework.
 Able to write programs using abstract classes.
 Able to write multithreaded programs.
 Able to write GUI programs using swing controls in Java.
Note:
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. 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.
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 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 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.
6. Write a Java program for the following: Create a doubly linked list of elements. Delete a given element from the
above list.Display the contents of the list after deletion.
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 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 separated by commas. Write a java program to
display the table using Labels in GridLayout.
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 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).
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.
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.
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.
L T P C
0 0 2 0
*MC309: GENDER SENSITIZATION LAB (An Activity-based Course)
COURSE DESCRIPTION
This course offers an introduction to Gender Studies, an interdisciplinary field that asks critical questions about
the meanings of sex and gender in society. The primary goal of this course is to familiarize students with key issues,
questions and debates in Gender Studies, both historical and contemporary. It draws on multiple disciplines – such as
literature, history, economics, psychology, sociology, philosophy, political science, anthropology and media studies – to
examine cultural assumptions about sex, gender, and sexuality.
This course integrates analysis of current events through student presentations, aiming to increase awareness of
contemporary and historical experiences of women, and of the multiple ways that sex and gender interact with race,
class, caste, nationality and other social identities. This course also seeks to build an understanding and initiate and
strengthen programmes combating gender- based violence and discrimination. The course also features several exercises
and reflective activities designed to examine the concepts of gender, gender-based violence, sexuality, and rights. It will
further explore the impact of gender-based violence on education, health and development.
Objectives of the Course

 To develop students’ sensibility with regard to issues of gender in contemporary 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.
 To help students reflect critically on gender violence.
 To expose students to more egalitarian interactions between men and women.
Learning Outcomes
 Students will have developed a better understanding of important issues related to 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 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 understand and respond to gender violence.
UNIT - I: UNDERSTANDING GENDER
Introduction: Definition of Gender-Basic Gender Concepts and Terminology-Exploring Attitudes towards Gender-
Construction of Gender-Socialization: Making Women, Making Men Preparing for Womanhood. Growing up Male.
First lessons in Caste.
UNIT – II: GENDER ROLES AND RELATIONS
Two or Many? -Struggles with Discrimination-Gender Roles and Relations-Types of Gender Roles- Gender Roles and
Relationships Matrix-Missing Women-Sex Selection and Its Consequences- Declining Sex Ratio. Demographic
Consequences-Gender Spectrum: Beyond the Binary
UNIT – III: GENDER AND LABOUR
Division and Valuation of Labour-Housework: The Invisible Labor- “My Mother doesn’t Work.” “Share the Load.”-
Work: Its Politics and Economics -Fact and Fiction. Unrecognized and Unaccounted work.
Gender Development Issues-Gender, Governance and Sustainable Development-Gender and Human Rights-Gender and
Mainstreaming
UNIT – IV: GENDER - BASED VIOLENCE
The Concept of Violence- Types of Gender-based Violence-Gender-based Violence from a Human Rights Perspective-
Sexual Harassment: Say No! -Sexual Harassment, not Eve-teasing- Coping with Everyday Harassment- Further
Reading: “Chupulu”.
Domestic Violence: Speaking OutIs Home a Safe Place? -When Women Unite [Film]. Rebuilding Lives. Thinking
about Sexual Violence Blaming the Victim-“I Fought for my Life….”
UNIT – V: GENDER AND CULTURE
Gender and Film-Gender and Electronic Media-Gender and Advertisement-Gender and Popular Literature- Gender
Development Issues-Gender Issues - Gender Sensitive Language-Gender and Popular Literature - Just Relationships:
Being Together as Equals
Mary Kom and Onler. Love and Acid just do not Mix. Love Letters. Mothers and Fathers. Rosa Parks- The Brave Heart.
Note: Since it is 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.
 Classes will consist of a combination of activities: dialogue-based lectures, discussions, collaborative learning
activities, group work and in-class assignments. Apart from the above prescribed book, Teachers can make
use of any authentic materials related to the topics given in the syllabus on“Gender”.
 ESSENTIAL READING: The Textbook, “Towards a World of Equals: A Bilingual Textbook on Gender”
written by A.Suneetha, Uma Bhrugubanda, DuggiralaVasanta, Rama Melkote, Vasudha Nagaraj, Asma
Rasheed, GoguShyamala, Deepa Sreenivas and Susie Tharupublished by Telugu Akademi, Telangana
Government in 2015.
ASSESSMENT AND GRADING

 Discussion & Classroom Participation:20%
 Project/Assignment:30%
 End Term Exam:50%
L T P C
0 0 2 0
MC310: EMPLOYABILITY SKILLS-III
UNIT - I
Module 1 - Introduction to Python and Computer Programming: Python - a tool, not a reptile, there is more than
one Python, let's start our Python adventure
Module 2 - Data Types, Variables, Basic Input-Output Operations, Basic Operators: Your first program, Python
literals, Operators - data manipulation tools, Variables - data-shaped boxes, How to talk to computer?
UNIT - II
Module 3 - Boolean Values, Conditional Execution, Loops, Lists and List Processing, Logical and Bitwise
Operations: Making decisions in Python, Python's loops, Logic and bit operations in Python, Lists - collections of data,
Sorting simple lists - the bubble sort algorithm, Lists - some more details, Lists in advanced applications
Module 4 - Functions, Tuples, Dictionaries, and Data Processing: Writing functions in Python, How functions
communicate with their environment?, Returning a result from a function, Scopes in Python ,Let's make some fun...
sorry, functions ,Tuples and dictionaries
Module 5 - Modules, Packages, String and List Methods, and Exceptions: Using modules, Some useful modules,
What is package?, Errors - the programmer's daily bread, The anatomy of exception, Some of the most useful
exceptions, Characters and strings vs. computers, Python's nature of strings, String methods, Strings in action, Four
simple programs
UNIT - III
Module 6 - The Object-Oriented Approach: Classes, Methods, Objects, and the Standard Objective Features;
Exception Handling, and Working with Files: Basic concepts of object programming, A short journey from
procedural to object approach, Properties, Methods, Inheritance - one of object programming foundations, Exceptions
once again, Generators and closures, Processing files, Working with real files
UNIT - IV
Module: 7 Data Structures: List Data Structures, Stacks, Queues, Searching & Sorting, Trees, Graphs
UNIT - V
Module: 8 Databases Management, Mysql & Mongo DB: Creating Database, Insertion, Deletion, Updating, Selection
B.TECH II Year II Sem. L T P C

3 0 0 3
SM401MS: BUSINESS ECONOMICS AND FINANCIAL ANALYSIS
Prerequisites: None
Course Objective: To learn the basic Business types, impact of the Economy on Business 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 position by analyzing 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 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.
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.
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.
Cost analysis: Types of Costs, Short run and Long run Cost Functions.
Market Structures: Nature of Competition, Features of Perfect competition, Monopoly, Oligopoly, Monopolistic
Competition.
Pricing: Types of Pricing, Product Life Cycle based Pricing, Break Even Analysis, 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, Preparation of Final Accounts.
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).
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, 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.
B.TECH II Year II Sem. LTPC

3 104
MA402BS: COMPUTER ORIENTED STATISTICAL METHODS
Common to CSE, INF and CSM
Pre-requisites: Mathematics courses of first year of study.
Course Objectives: To learn

 The theory of Probability, and probability distributions of single and multiple random variables
 The sampling theory and testing of hypothesis and making inferences
 Stochastic process and Markov chains.
 Apply the concepts of probability and distributions to some case studies
 Correlate the material of one unit to the material in other units
 Resolve the potential misconceptions and hazards in each topic of study.
UNIT - I
Probability: Sample Space, Events, Counting Sample Points, Probability of an Event, Additive Rules, Conditional
Probability, Independence, and the Product Rule, Bayes’ Rule.
Random Variables and Probability Distributions: Concept of a Random Variable, Discrete Probability Distributions,
Continuous Probability Distributions, Statistical Independence.
UNIT - II
Mathematical Expectation: Mean of a Random Variable, Variance and Covariance of Random Variables, Means and
Variances of Linear Combinations of Random Variables, Chebyshev’s Theorem.
Discrete Probability Distributions: Introduction and Motivation, Binomial, Distribution, Geometric Distributions and
Poisson distribution.
UNIT - III
Continuous Probability Distributions: Continuous Uniform Distribution, Normal Distribution, Areas under the
Normal Curve, Applications of the Normal Distribution, Normal Approximation to the Binomial, Gamma and
Exponential Distributions.
Fundamental Sampling Distributions: Random Sampling, Some Important Statistics, Sampling Distributions,
Sampling Distribution of Means and the Central Limit Theorem, Sampling Distribution of S2, t –Distribution, F-
Distribution.
UNIT - IV
Estimation & Tests of Hypotheses: Introduction, Statistical Inference, Classical Methods of Estimation.: Estimating
the Mean, Standard Error of a Point Estimate, Prediction Intervals, Tolerance Limits, Estimating the Variance,
Estimating a Proportion for single mean, Difference between Two Means, between Two Proportions for Two Samples
and Maximum Likelihood Estimation.
Statistical Hypotheses: General Concepts, Testing a Statistical Hypothesis, Tests Concerning a Single Mean, Tests on
Two Means, Test on a Single Proportion, Two Samples: Tests on Two Proportions.
UNIT - V
Stochastic Processes and Markov Chains: Introduction to Stochastic processes- Markov process. Transition
Probability, Transition Probability Matrix, First order and Higher order Markov process, n- step transition probabilities,
Markov chain, Steady state condition, Markov analysis.
TEXT BOOKS:
1. Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers, Keying Ye, Probability & Statistics for Engineers &
Scientists, 9th Ed. Pearson Publishers.
2. S C Gupta and V K Kapoor, Fundamentals of Mathematical statistics, Khanna publications.

3. S. D. Sharma, Operations Research, Kedarnath and Ramnath Publishers, Meerut, Delhi
REFERENCE BOOKS:
1. T.T. Soong, Fundamentals of Probability And Statistics For Engineers, John Wiley & Sons Ltd,2004.
2. Sheldon M Ross, Probability and statistics for Engineers and scientists, Academic Press.

B.TECH II Year II Sem. LT P C
3 0 0 3
CS403ES: ANALOG AND DIGITAL ELECTRONICS
Common to CSE and CSC
Course Objectives:
 To introduce components such as diodes, BJTs and FETs.
 To know the applications of components.
 To give understanding of various types of amplifier circuits
 To learn basic techniques for the design of digital circuits and fundamental concepts used in the design of digital
systems.
 To understand the concepts of combinational logic circuits and sequential circuits.
Course Outcomes: Upon completion of the Course, the students will be able to:
 Know the characteristics of various components.
 Understand the utilization of components.
 Design and analyze small signal amplifier circuits.
 Learn Postulates of Boolean algebra and to minimize combinational functions
 Design and analyze combinational and sequential circuits
 Know about the logic families and realization of logic gates.
UNIT - I
Diodes and Applications: Junction diode characteristics: Open circuited p-n junction, p-n junction as a rectifier, V-I
characteristics, effect of temperature, diode resistance, diffusion capacitance, diode switching times, breakdown diodes,
Tunnel diodes, photo diode, LED.
Diode Applications - clipping circuits, comparators, Half wave rectifier, Full wave rectifier, rectifier with capacitor
filter.
UNIT - II
BJTs: Transistor characteristics: The junction transistor, transistor as an amplifier, CB, CE, CC configurations,
comparison of transistor configurations, the operating point, self-bias or Emitter bias, bias compensation, thermal
runaway and stability, transistor at low frequencies, CE amplifier response, gain bandwidth product, Emitter follower,
RC coupled amplifier, two cascaded CE and multi stage CE amplifiers.
UNIT - III
FETs and Digital Circuits: FETs: JFET, V-I characteristics, MOSFET, low frequency CS and CD amplifiers, CS and
CD amplifiers.
Digital Circuits: Digital (binary) operations of a system, OR gate, AND gate, NOT, EXCLUSIVE OR gate, De Morgan
Laws, NAND and NOR DTL gates, modified DTL gates, HTL and TTL gates, output stages, RTL and DCTL, CMOS,
Comparison of logic families.
UNIT - IV
Combinational Logic Circuits: Basic Theorems and Properties of Boolean Algebra, Canonical and Standard Forms,
Digital Logic Gates, The Map Method, Product-of-Sums Simplification, Don’t-Care Conditions, NAND and NOR
Implementation, Exclusive-OR Function, Binary Adder-Subtractor, Decimal Adder, Binary Multiplier, Magnitude
Comparator, Decoders, Encoders, Multiplexers.
UNIT - V
Sequential Logic Circuits: Sequential Circuits, Storage Elements: Latches and flip flops, Analysis of Clocked
Sequential Circuits, State Reduction and Assignment, Shift Registers, Ripple Counters, Synchronous Counters,
Random-Access Memory, Read-Only Memory.
TEXTBOOKS:
1. Integrated Electronics: Analog and Digital Circuits and Systems, 2/e, Jaccob Millman, Christos Halkias and
Chethan D. Parikh, Tata McGraw-Hill Education, India,2010.

2. Digital Design, 5/e, Morris Mano and Michael D. Cilette, Pearson,2011.
REFERENCE BOOKS:
1. Electronic Devices and Circuits, Jimmy J Cathey, Schaum’s outline series,1988.
2. Digital Principles, 3/e, Roger L. Tokheim, Schaum’s outline series,1994.
B.TECH II Year II Sem.

L T P C
61 COMPUTER SCIENCE AND ENGINEERING 2020-21
3 0 0 3
CS404PC: PYTHON PROGRAMMING
Course Objectives: This course will enable students to

 Learn Syntax and Semantics and create Functions in Python.
 Handle Strings and Files in Python.
 Understand Lists, Dictionaries and Regular expressions in Python.
 Implement Object Oriented Programming concepts in Python.
 Build Web Services and introduction to Network and Database Programming in Python.
Course Outcomes: The students should be able to:

 Examine Python syntax and semantics and be fluent in the use of Python flow control and functions.
 Demonstrate proficiency in handling Strings and File Systems.
 Create, run and manipulate Python Programs using core data structures like Lists, Dictionaries and use Regular
Expressions.
 Interpret the concepts of Object-Oriented Programming as used in Python.
 Implement exemplary applications related to Network Programming, Web Services and Databases in Python.
UNIT - I
Python Basics, Objects- Python Objects, Standard Types, Other Built-in Types, Internal Types, Standard Type
Operators, Standard Type Built-in Functions, Categorizing the Standard Types, Unsupported Types
Numbers - Introduction to Numbers, Integers, Floating Point Real Numbers, Complex Numbers, Operators, Built-in
Functions, Related Modules
Sequences - Strings, Lists, and Tuples, Mapping and Set Types
UNIT - II
FILES: File Objects, File Built-in Function [ open() ], File Built-in Methods, File Built-in Attributes, Standard Files,
Command-line Arguments, File System, File Execution, Persistent Storage Modules, Related Modules
Exceptions: Exceptions in Python, Detecting and Handling Exceptions, Context Management, *Exceptions as Strings,
Raising Exceptions, Assertions, Standard Exceptions, *Creating Exceptions, Why Exceptions (Now)?, Why Exceptions
at All?, Exceptions and the sys Module, Related Modules
Modules: Modules and Files, Namespaces, Importing Modules, Importing Module Attributes, Module Built-in
Functions, Packages, Other Features of Modules
UNIT - III
Regular Expressions: Introduction, Special Symbols and Characters, Res and Python Multithreaded Programming:
Introduction, Threads and Processes, Python, Threads, and the Global Interpreter Lock, Thread Module, Threading
Module, Related Modules
UNIT - IV
GUI Programming: Introduction, Tkinter and Python Programming, Brief Tour of Other GUIs, Related Modules and
Other GUIs
WEB Programming: Introduction, Wed Surfing with Python, Creating Simple Web Clients, Advanced Web Clients,
CGI-Helping Servers Process Client Data, Building CGI Application Advanced CGI, Web (HTTP) Servers
UNIT – V
Database Programming: Introduction, Python Database Application Programmer’s Interface (DB-API), Object
Relational Managers (ORMs), Related Modules
TEXTBOOKS:
1. Core Python Programming, Wesley J. Chun, Second Edition, Pearson.
II Year B.Tech II-Sem L T P C

3 0 0 3
CS405PC: SOFTWARE ENGINEERING
Course Objectives
 The aim of the course is to provide an understanding of the working knowledge of the techniques for estimation,
design, testing and quality management of large software development projects.
 Topics include process models, software requirements, software design, software testing, software
process/product metrics, risk management, quality management and UML diagrams
Course Outcomes
 Ability to translate end-user requirements into system and software requirements, using e.g. UML, and structure
the requirements in a Software Requirements Document(SRD).
 Identifyandapplyappropriatesoftwarearchitecturesandpatternstocarryouthighleveldesign of a system and be able
to critically compare alternative choices.
 Willhaveexperienceand/orawarenessoftestingproblemsandwillbeabletodevelopasimple testing report
UNIT - I
Introduction to Software Engineering: The evolving role of software, changing nature of 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, the unified process.
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.
UNIT - III
Design Engineering: Design process and design quality, design concepts, the design model.
Creatinganarchitecturaldesign:softwarearchitecture,datadesign,architecturalstylesandpatterns, architectural design,
conceptual model of UML, basic structural modeling, class diagrams, sequence diagrams, collaboration diagrams, use
case diagrams, component diagrams.
UNIT - IV
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, metrics for analysis model, metrics for design model, metrics for source code,
metrics for testing, metrics for maintenance.
UNIT - V
Metrics for Process and Products: Software measurement, metrics for software quality.
Risk management: Reactive Vs proactive risk strategies, software risks, risk identification, risk projection, risk
refinement, RMMM, RMMM plan.
QualityManagement:Qualityconcepts,softwarequalityassurance,softwarereviews,formaltechnical reviews, statistical

software quality assurance, software reliability, the ISO 9000 quality standards.
TEXT BOOKS:
1. Software Engineering, A practitioner’s Approach-Roger S. Pressman,6 th edition, McGraw Hill International
Edition.
2. Software Engineering- Sommerville, 7th edition, Pearson Education.
3. The unified modeling language user guide Grady Booch, James Rambaugh, Ivar Jacobson, Pearson Education.
REFERENCES:
1. SoftwareEngineering,anEngineeringapproach-JamesF.Peters,WitoldPedrycz,JohnWiley.
2. Software Engineering principles and practice- Waman S Jawadekar, The Mc Graw-Hill Companies.
3. Fundamentals of object-oriented design using UML Meiler page-Jones: Pearson Education.
4. Software Engineering by K K Agarwal and Yogesh Singh 3rd Edition, New Age International.

0 0 2 1
CS406ES: ANALOG AND DIGITAL ELECTRONICS LAB
Common to CSE and CSC
Course Objectives
 To introduce components such as diodes, BJTs and FETs.
 To know the applications of components.
 To give understanding of various types of amplifier circuits
 To learn basic techniques for the design of digital circuits and fundamental concepts used in the design of digital
systems.
 To understand the concepts of combinational logic circuits and sequential circuits.
Course Outcomes: Upon completion of the Course, the students will be able to:
 Know the characteristics of various components.
 Understand the utilization of components.
 Design and analyze small signal amplifier circuits.
 Postulates of Boolean algebra and to minimize combinational functions
 Design and analyze combinational and sequential circuits
 Known about the logic families and realization of logic gates.
LIST OF EXPERIMENTS
1. Full Wave Rectifier with & without filters
2. Common Emitter Amplifier Characteristics
3. Common Base Amplifier Characteristics
4. Common Source amplifier Characteristics
5. Measurement of h-parameters of transistor in CB, CE, CC configurations
6. Input and Output characteristics of FET in CS configuration
7. Realization of Boolean Expressions using Gates
8. Design and realization logic gates using universal ates
9. generation of clock using NAND / NOR gates
10. Design a 4 – bit Adder /Subtractor
11. Design and realization a Synchronous and Asynchronous counter using flip-flops
12. Realization of logic gates using DTL, TTL, ECL,etc.


0 0 3 1.5
CS407PC:PYTHON PROGRAMMING LAB
Prerequisites: Students should install Python on Linux platform.
Course Objectives
 To be able to introduce core programming basics and program design with functions using Python programming
language.
 To understand a range of Object-Oriented Programming, as well as in-depth data and information processing
techniques.
 To understand the high-performance programs designed to strengthen the practical expertise.
Course Outcomes
 Student should be able to understand the basic concepts scripting and the contributions of scripting language
 Ability to explore python especially the object oriented concepts, and the built in objects of Python.
 Ability to create practical and contemporary applications such as TCP/IP network programming, Web
applications, discrete event simulations
List of Programs
1. Write a program to demonstrate different number data types in Python.
2. Write a program to perform different Arithmetic Operations on numbers in Python.
3. Write a program to create, concatenate and print a string and accessing sub-string from a given string.
4. Write a program to create, append, and remove lists in python.
5. Write a program to demonstrate working with tuples in python.
6. Write a program to demonstrate working with dictionaries in python.
7. Write a Python program to construct the following pattern, using a nested for loop
*
**
***
****
*****
****
***
**
*
8. Write a Python script that prints prime numbers less than20.
9. Write a python program to find factorial of a number using Recursion.
10. Write a program that accepts the lengths of three sides of a triangle as inputs. The program output should indicate
whether or not the triangle is a right triangle (Recall from the Pythagorean Theorem that in a right triangle, the
square of one side equals the sum of the squares of the other two sides).
11. Write a python program to define a module to find Fibonacci Numbers and import the module to another program.
12. Write a python program to define a module and import a specific function in that module to another program.
13. Write a script named copyfile.py. This script should prompt the user for the names of two text files. The contents
of the first file should be input and written to the second file.
14. Write a program that inputs a text file. The program should print all of the unique words in the file in alphabetical
order.
15. Write a Python class to convert an integer to a roman numeral.
16. Write a Python class to implement pow(x,n)
17. Write a Python class to reverse a string word byword.
18. write a Python Program to perform Linear Search
19. write a Python Program to perform Binary Search
20. Write a GUI for an Expression Calculator using tk.

0 0 3 1.5
CS408PC: SOFTWARE ENGINEERING LAB
Prerequisites
 A course on “Programming for Problem Solving”
 A course on “Database Management Systems”
Co-requisite
 A Course on “Software Engineering”
Course Objectives
 To have hands on experience in developing a software project by using various software engineering principles
and methods in each of the phases of software development.
Course Outcomes
 Ability to translate end-user requirements into system and software requirements
 Ability to generate a high-level design of the system from the software requirements
 Willhaveexperienceand/orawarenessoftestingproblemsandwillbeabletodevelopasimple testing report
List of Experiments
Dothefollowing8exercisesforanytwoprojectsgiveninthelistofsampleprojectsoranyother projects:
1) Development of problem statement.
2) PreparationofSoftwareRequirementSpecificationDocument,DesignDocumentsandTesting Phase related
documents.
3) PreparationofSoftwareConfigurationManagementandRiskManagementrelateddocuments.
4) Study and usage of any Design phase CASE tool
5) Performing the Design by using any Design phase CASE tools.
6) Develop test cases for unit testing and integration testing
7) Develop test cases for various white box and black box testing techniques.
Sample Projects:
1. Passport automation System
2. Book Bank
3. Online Exam Registration
4. Stock Maintenance System
5. Online course reservation system
6. E-ticketing
7. Software Personnel Management System
8. Credit Card Processing
9. E-book management System.
10. Recruitment system
TEXT BOOKS:
1. SoftwareEngineering,Apractitioner’sApproach-RogerS.Pressman,6thedition,McGrawHill International Edition.
2. Software Engineering- Sommerville, 7th edition, Pearson Education.
3. The unified modeling language user guide Grady Booch, James Rambaugh, Ivar Jacobson, Pearson Education.

3 0 0 0
*MC409:ENVIRONMENTAL SCIENCE
Course Objectives:
 S – skills (Acquire the skills for identifying and solving environmental problems)
 P – protection qualities(participate in improvement and protection of the environment)
 E – evaluation abilities( develop the ability to evaluate measures for the protection of environment)
 A – attitude (acquire an attitude of concern for the development)
 K – knowledge (gain knowledge about the environment and its allied problems)
Course Outcomes:
Based on this course, the Engineering graduate will
 Define basic definitions and can explain complex relationship between predators, prey and the plant community.
 Categorize resources in natural environment and its relationships with human activities as well as human impacts.
 Demonstrate an awareness, knowledge and appreciation of the intrinsic values of ecological processes and
communities
 Assess different scientific research strategies, including collection, management, evaluation and interpretation of
environmental data and role of information technology in environment
 Examine the transnational character of environmental problems, protection acts and ways of addressing them,
including interactions across local to global scales
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,
biomagnifications, ecosystem value, services and carrying capacity.
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.
UNIT-III:
Biodiversity and biotic resources: Introduction, definition, genetic, species and ecosystem diversity. Values of
biodiversity- consumptive use, productive use, social, ethical, aesthetic and optional values. India as a mega diversity
nation, Hot spots of biodiversity.. Threats to biodiversity: habitat loss, poaching of wildlife, man- wildlife conflicts;
conservation of biodiversity: In-Situ and Ex-situ conservation. National Biodiversity act.
UNIT-IV:
Environmental Pollution and Control Technologies: Environmental Pollution: 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). International conventions / Protocols: Earth
summit, Kyoto protocol and Montréal protocol.
UNIT-V:
Environmental Policy, Legislation & EIA: Environmental protection act, Legal aspects 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 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 for University Grants
Commission.
2. Environmental studies by Anubha Kaushik and C.P.Kaushik
REFERENCE BOOKS:
1. Environmental Studies –From crisis to cure by Dr. R. Rajagopaln
2. Text book for Environmental science and Technology by M. Anji Reddy

3. Environmental engineering and Disaster management by KR.Chandoke
4. Environmental engineering and science- Third edition by Gilbert M.Masters and Wendell P.Ella
5. Environmental studies by O.V.K.Reddy
6. Environmental Science and Engineering by Aloka Debi.

0 0 2 0
MC410: EMPLOYABILITY SKILLS-IV
UNIT-I
Introduction: Why Java, Paradigms, Diff B/W Java & Other (C,C++), Java History, Java Features, Java programming
format, Java Statements, Java Data Types, packages
UNIT-II
OOPS (Object Oriented Programming & Systems): Introduction, Object, Constructors, This Key Word, Inheritance,
Super Key Word, Polymorphism (Over Loading & Over Riding), Abstraction, Interface, Encapsulation, Introduction to all
predefined packages, User Defined Packages, Access Specifiers
UNIT-III
STRING Manipulation: String, String Buffer

Array: What is Array, Single Dimensional Array, Multi Dimensional Array, Sorting of Arrays
UNIT-IV
Exception Handling: Introduction, Pre Defined Exceptions, Try-Catch-Finally, Throws, throw, User Defined Exception
examples
I/O Streams: Introduction, Byte-oriented streams, Character – oriented streams, File
UNIT-V
Multithreading: Introduction, Thread Creations, Thread Life Cycle, Life Cycle Methods, Synchronization, Wait() notify()
notify all() methods
Wrapper Classes: Introduction, Byte, Short, Integer, Long, Float, Double, Character, Boolean classes
Inner Classes: Introduction, Member Inner Class, Static Inner Class, Local Inner Class, Anonymous Inner Class
Collection Frame Work: Introduction, Util Package interfaces, List, Set, Map, List Interface 7 Its Classes, Set Interface &
Its Classes, Map Interface & Is Classes
B.Tech in COMPUTER SCIENCE AND ENGINEERING

COURSE STRUCTURE & SYLLABUS(R-20)
III YEAR I SEMESTER

1 CS501PC Design and Analysis of Algorithms 3 1 0 4

2 CS502PC Computer Networks 3 0 0 3
3 CS503PC Artificial Intelligence 3 0 0 3
4 CS504PC Formal Languages and Automata Theory 3 0 0 3
5 Professional Elective - I 3 0 0 3
6 CS505PC Artificial Intelligence Lab 0 0 2 1
7 CS506PC Computer Networks Lab 0 0 3 1.5
8 CS507PC Design and Analysis of Algorithms Lab 0 0 3 1.5
9 *MC509 Constitution of India 3 0 0 0
10 MC510 Devops 0 0 2 0
III YEAR II SEMESTER

1 CS601PC Compiler Design 3 0 0 3
2 CS602PC Machine Learning 3 1 0 4
3 CS603PC Web Technologies 3 0 0 3
4 Professional Elective - II 3 0 0 3
5 Open Elective-I 3 0 0 3
6 EN604HS Advanced Communication Skills Lab 0 0 3 1.5
7 CS605PC Machine Learning Lab 0 0 2 1

8 CS606PC Web Technologies Lab 0 0 3 1.5
9 *MC609 Intellectual Property Rights 3 0 0 0
10 MC610 Cyber Security 2 0 0 0
Professional Elective – I
CS511PE Cryptography & Network Security
CS512PE Data Analytics using R
CS513PE Principle of Programming Languages
CS514PE Computer Graphics
Professional Elective – II
Network Programming & Management
CS621PE
CS622PE Natural Language Processing
CS623PE Software Project Management
CS624PE Information Retrieval System
B.Tech III Year I-Sem L T P C

3 1 0 4
CS501PC: DESIGN AND ANALYSIS OF ALGORITHMS
(Common to CSE/CSD/CSC/ IT)
Prerequisites:
 A course on “Computer Programming and Data Structures”
 A course on “Advanced Data Structures”
Course Objectives:
 Introduces the notations for analysis of the performance of algorithms.
 Introduces the data structure disjoint sets.
 Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic programming,
greedy, branch and bound methods) and mention problems for which each technique is appropriate;
 Describes how to evaluate and compare different algorithms using worst-, average-, and best- case
analysis.
 Explains the difference between tractable and intractable problems, and introduces the problems that are
P, NP and NP complete.
Course Outcomes:
 Ability to analyze the performance of algorithms
 Ability to choose appropriate data structures and algorithm design methods for a specified
application
 Ability to understand how the choice of data structures and the algorithm design methods impact
the performance of programs
UNIT - I
Introduction: Algorithm, Performance Analysis-Space complexity, Time complexity, Asymptotic
Notations- Big oh notation, Omega notation, Theta notation and Little oh notation.
Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort, Strassen’smatrix
multiplication.
UNIT – II
Disjoint Sets: Disjoint set operations, union and find algorithms
Backtracking: General method, applications, n-queen’s problem, sum of subsets problem, graph Coloring
UNIT – III
Dynamic Programming: General method, applications- Optimal binary search trees, 0/1 knapsack Problem, All
pairs shortest path problem, Traveling sales person problem, Reliability design.
UNIT - IV
Greedy method: General method, applications-Job sequencing with deadlines, knapsack problem, Minimum cost
spanning trees, Single source shortest path problem.
UNIT - V
Branch and Bound: General method, applications - Travelling sales person problem, 0/1 knapsack problem -
LC Branch and Bound solution, FIFO Branch and Bound solution.
NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard and
NP-Complete classes, Cook’s theorem.
TEXT BOOKS:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharan,
University Press.
REFERENCE BOOKS:
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
2. Introduction to Algorithms, second edition, T. H. Cormen, C.E. Leiserson, R. L. Rivest, and C. Stein,
PHI Pvt. Ltd./ Pearson Education.
3. Algorithm Design: Foundations, Analysis and Internet Examples, M.T. Goodrich and R
Tamassia, John Wiley and sons.
B.Tech III Year I-Sem L T P C

3 0 0 3
CS502PC: COMPUTER NETWORKS

(Common to CSE/CSM)
Prerequisites
 A course on “Programming for problem solving”
 A course on “Data Structures”
Course Objectives
 The objective of the course is to equip the students with a general overview of the concepts and
fundamentals of computer networks.
 Familiarize the students with the standard models for the layered approach to communication between
machines in a network and the protocols of the various layers.
Course Outcomes
 Gain the knowledge of the basic computer network technology.
 Gain the knowledge of the functions of each layer in the OSI and TCP/IP reference model.
 Obtain the skills of subnetting and routing mechanisms.
 Familiarity with the essential protocols of computer networks, and how they can be applied in network
design and implementation.
UNIT – I
Network hardware, Network software, OSI, TCP/IP Reference models, Example Networks: ARPANET, Internet.
Physical Layer: Guided Transmission media: twisted pairs, coaxial cable, fiber optics, Wireless
transmission.
UNIT - II
Data link layer: Design issues, framing, Error detection and correction.
Elementary data link protocols: simplex protocol, A simplex stop and wait protocol for an error- freechannel,
A simplex stop and wait protocol for noisy channel.
Sliding Window protocols: A one-bit sliding window protocol, A protocol using Go-Back-N, A
protocolusing Selective Repeat, Example data link protocols.
Medium Access sub layer: The channel allocation problem, Multiple access protocols: ALOHA, Carrier sense
multiple access protocols, collision free protocols. Wireless LANs, Data link layer switching.
UNIT - III
Network Layer: Design issues, Routing algorithms: shortest path routing, Flooding, Hierarchical routing,
Broadcast, Multicast, distance vector routing, Congestion Control Algorithms, Quality of Service,
Internetworking, The Network layer in the internet.
UNIT - IV
Transport Layer: Transport Services, Elements of Transport protocols, Connection management, TCPand UDP
protocols.
UNIT - V
Application Layer –Domain name system, SNMP, Electronic Mail; the World WEB, HTTP, Streaming audio
and video.
TEXT BOOKS:
1. Computer Networks -- Andrew S Tanenbaum, David. j. Wetherall, 5th Edition. Pearson
Education/PHI
REFERENCE BOOKS:
1. An Engineering Approach to Computer Networks-S. Keshav, 2nd Edition, Pearson Education
2. Data Communications and Networking – Behrouz A. Forouzan. Third Edition TMH.
B.Tech. III Year I-Sem L T P C

3 0 0 3
CS503PC: ARTIFICIAL INTELLIGENCE
(Common to CSE/ IT)
Prerequisites:
 A course on “Advanced Data Structures”
 A course on “Design and Analysis of Algorithms”
 A course on “Mathematical Foundations of Computer Science”
 Some background in linear algebra, data structures and algorithms, and probability will all be helpful
Course Objectives:
 To learn the distinction between optimal reasoning Vs. human like reasoning
 To understand the concepts of state space representation, exhaustive search, heuristic search together
with the time and space complexities.
 To learn different knowledge representation techniques.
 To understand the applications of AI, namely game playing, theorem proving, and machine learning.
Course Outcomes:
 Ability to formulate an efficient problem space for a problem expressed in natural language.
 Select a search algorithm for a problem and estimate its time and space complexities.
 Possess the skill for representing knowledge using the appropriate technique for a given problem.
 Possess the ability to apply AI techniques to solve problems of machine learning.
 Ability to solve societal problems using Expert System Concept.
UNIT - I
Introduction: AI problems, Agents and Environments, Structure of Agents, Problem Solving Agents
Basic Search Strategies: Problem Spaces, Uninformed Search (Breadth-First, Depth-First Search,
Depth-first with Iterative Deepening), Heuristic Search (Hill Climbing, Generic Best-First, A*),
Constraint Satisfaction (Backtracking, Local Search)
UNIT - II
Advanced Search: Constructing Search Trees, Stochastic Search, A* Search Implementation,
Minimax Search, Alpha-Beta Pruning
Basic Knowledge Representation and Reasoning: Propositional Logic, First-Order Logic,
Forward Chaining and Backward Chaining, Introduction to Probabilistic Reasoning, Bayes
Theorem
UNIT - III
Advanced Knowledge Representation and Reasoning: Knowledge Representation Issues,
Non- monotonic Reasoning, Other Knowledge Representation Schemes
Reasoning Under Uncertainty: Basic probability, Acting Under Uncertainty, Bayes’ Rule, Representing
Knowledge in an Uncertain Domain, Bayesian Networks
UNIT - IV
Learning: What Is Learning? Rote Learning, Learning by Taking Advice, Learning in Problem Solving,
Learning from Examples, Winston’s Learning Program, Decision Trees.
UNIT - V
Expert Systems: Representing and Using Domain Knowledge, Shell, Explanation, Knowledge Acquisition.
TEXT BOOK
1. Russell, S. and Norvig, P, Artificial Intelligence: A Modern Approach, Third Edition, Prentice- Hall,
2010.
REFERENCE BOOKS
1. Artificial Intelligence, Elaine Rich, Kevin Knight, Shivasankar B. Nair, The McGraw Hill
publications, Third Edition, 2009.
2. George F. Luger, Artificial Intelligence: Structures and Strategies for Complex Problem
Solving, Pearson Education, 6th ed., 2009.
B.TechI III Year I-Sem L T P C

3 0 0 3
CS504PC: FORMAL LANGUAGES AND AUTOMATA THEORY

(Common to CSE /CSM/CSC/IT)
Course Objectives
 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.
 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
 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.
UNIT - I
Introduction to Finite Automata: Structural Representations, Automata and Complexity, the Central
Concepts of Automata Theory – Alphabets, Strings, Languages, Problems.
Nondeterministic Finite Automata: Formal Definition, an application, Text Search, Finite Automata
with Epsilon-Transitions.
Deterministic Finite Automata: Definition of DFA, How a DFA Process Strings, The language of
DFA, Conversion of NFA with €-transitions to NFA without €-transitions. Conversion of NFA to
DFA, Moore and Melay machines
UNIT - II
Regular Expressions: Finite Automata and Regular Expressions, Applications of Regular
Expressions, Algebraic Laws for Regular Expressions, Conversion of Finite Automata to Regular
Expressions. Pumping Lemma for Regular Languages, Statement of the pumping lemma,
Applications of the Pumping Lemma.
Closure Properties of Regular Languages: Closure properties of Regular languages, Decision
Properties of Regular Languages, Equivalence and Minimization of Automata.
UNIT - III
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 Languages.
Push Down Automata: Definition of the Pushdown Automaton, the Languages of a PDA,
Equivalence of PDA's and CFG's, Acceptance by final state, Acceptance by empty stack,
Deterministic Pushdown Automata. From CFG to PDA, From PDA to CFG.
UNIT - IV
Normal Forms for Context- Free Grammars: Eliminating useless symbols, Eliminating €-
Productions. Chomsky Normal form Griebech Normal form.
Pumping Lemma for Context-Free Languages: Statement of pumping lemma, Applications
Closure Properties of Context-Free Languages: Closure properties of CFL’s, Decision Properties

of CFL's
Turing Machines: Introduction to Turing Machine, Formal Description, Instantaneous description, The
language of a Turing machine
UNIT – V
Types of Turing machine: Turing machines and halting
Undecidability: Undecidability, A Language that is Not Recursively Enumerable, An Undecidable
Problem That is RE, Undecidable Problems about Turing Machines, Recursive languages,
Properties of recursive languages, Post's Correspondence Problem, Modified Post Correspondence
problem, Other Undecidable Problems, Counter machines.
TEXT BOOKS:
1. Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John E.
Hopcroft,Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. Theory of Computer Science – Automata languages and computation, Mishra and
Chandrashekaran, 2nd edition, PHI.
REFERENCE BOOKS:
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 the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.
5. Introduction to Formal languages Automata Theory and Computation Kamala
krithivasan, Rama R, Pearson.
B. Tech III Year I Sem LTPC

3 0 03
CS511PE: CRYPTOGRAPHY AND NETWORK SECURITY
(Professional Elective – I)
Course Objectives:
 Explain the objectives of information security

 Explain the importance and application of each of confidentiality, integrity, authentication and availability
 Understand various cryptographic algorithms.
 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.
 Generate and distribute a PGP key pair and use the PGP package to send an encrypted email message.
 Discuss Web security and Firewalls
Course Outcomes:
 Student will be able to understand basic cryptographic algorithms, message and web
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 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.
UNIT – II
Symmetric key Ciphers: Block Cipher principles, DES, AES, Blowfish, RC5, IDEA, Block cipher operation,
Stream ciphers, RC4.
Asymmetric key Ciphers: Principles of public key cryptosystems, RSA algorithm, Elgamal Cryptography,
Diffie-Hellman Key Exchange, Knapsack Algorithm.
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 Service, Public – Key
Infrastructure
UNIT – IV
Transport-level Security: Web security considerations, Secure Socket Layer and Transport 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
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
TEXT BOOKS:
1. Cryptography and Network Security – Principles and Practice: William Stallings, Pearson
Education, 6th Edition
2. Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 3rd Edition
REFERENCE BOOKS:
1. Cryptography and Network Security: C K Shyamala, N Harini, Dr T R Padmanabhan, Wiley India, 1st
Edition.
2. Cryptography and Network Security: Forouzan Mukhopadhyay, Mc Graw Hill, 3rd 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

B. Tech III Year I Sem LTPC
3 003
CS512PE: DATA ANALYTICS USING R
Course Objectives:
 To explore the fundamental concepts of data analytics.
 To learn the principles and methods of statistical analysis
 Discover interesting patterns, analyze supervised and unsupervised models and estimate the accuracy
of the algorithms.
 To understand the various search methods and visualization techniques.
Course Outcomes:
 After the completion of the course, the student will be able to:
 Understanding the building blocks of R- Programming.
 Apply critical R-programming concepts to handle the data.
 Apply statistical concepts on real data.
 Use logistic and linear regression on real data.
 Design Decision tress to analyze the data.
UNIT -I
Introduction to R: Handling Packages in R, Getting Started with R, Working with Directory, Data Types in R,
Commands for Data Exploration Loading and Handling Data in R:Challenges of Analytical Data Processing,
Expression, Variables and Functions, Missing Values Treatment in R, Using the ‘as’ Operator to Change the
Structure of Data, Vectors, Matrices, Factors, List, Aggregating and Group Processing of a Variable, Simple
Analysis Using R, Methods for Reading Data, Comparison of R GUIs for Data Input.
UNIT -II
Descriptive Statistics: Using Statistics ,Percentiles and Quartiles ,Measures of Central Tendency, Measures of
Variability, Grouped Data and the Histogram, Skewness and Kurtosis, Relations between the Mean and
the Standard Deviation ,Methods of Displaying Data, Exploratory Data Analysis.
UNIT -III
Linear Regression using R: Introduction, Model Fitting, Linear Regression Assumptions of Linear Regression,
Validating Linear Assumption.
UNIT -IV
Logistic Regression using R: Introduction, Introduction to Generalized Linear Models, Logistic Regression, Binary
Logistic Regression, Diagnosing Logistic Regression, Multinomial Logistic Regression Models.
UNIT -V
Decision Tree: Introduction, Decision Tree Representation in R, Appropriate Problems for Decision Tree Learning,
Basic Decision Tree Learning Algorithm, Measuring Features, Hypothesis Space Search in Decision Tree Learning,
Inductive Biasin Decision Tree Learning, Why Prefer Short Hypotheses, Issues in Decision Tree Learning.
TEXT BOOKS:
1.Seema Acharya - "Data Analytics Using R" ,Jan 01, 2018, Seema Acharya-MC GRAW HILL
INDIA(2018).
2.Aczel−Sounder pandian: "Complete Business Statistics" 7th Edition Complete Business Statistics,
Seventh Edition McGraw−Hill Primis.
REFERENCE BOOKS:
1.ROBERT I. KABACOFF "R in ActionData analysis and graphics with R" Manning Publications
Co2011
B. Tech III Year I Sem L T P C

3 0 0 3
CS513PE: PRINCIPLES OF PROGRAMMING LANGUAGES

Course Objectives:
 To introduce the various programming paradigms.
 To understand the evolution of programming languages.
 To understand the concepts of OO languages, functional languages, logical andscripting languages.
 To introduce the principles and techniques involved in design and implementation ofmodern
programming languages.
 To introduce the notations to describe the syntax and semantics of programminglanguages.
 To introduce the concepts of concurrency control and exception handling.
 To introduce the concepts of ADT and OOP for software development.
Course Outcomes:
 Ability to express syntax and semantics in formal notation.
 Ability to apply suitable programming paradigm for the application.
 Ability to compare the features of various programming languages.
 Able to understand the programming paradigms of modern programming languages.
 Able to understand the concepts of ADT and OOP.
 Ability to program in different language paradigms and evaluate their relativebenefits.
UNIT-I
Preliminary Concepts: Reasons for studying concepts of programming languages, programming domains,
language evaluation criteria, influences on language design, language categories, language design
trade-offs, implementation methods, programming environments, Evolution of Major Programming Languages.
Syntax and Semantics: General problem of describing syntax, formal methods of describing syntax, attribute
grammars, describing the meanings of programs
UNIT-II
Names, Bindings, and Scopes: Introduction, names, variables, concept of binding, scope, scope and
lifetime, referencing environments, named constants Data types: Introduction, primitive, character,string types,user
defined ordinal types,array, associative arrays, record, tuple types ,list types, union types, pointer and reference
types, type checking, strong typing, type equivalence Expressions and Statements: Arithmetic expressions,
overloaded operators, type conversions, relational and boolean expressions, short- circuit evaluation, assignment
statements, mixed-mode assignment Control Structures – introduction, selection statements, iterative statements,
unconditional branching, guarded commands.
UNIT-III
Subprograms: Fundamentals of subprograms, design issues for subprograms, local referencing
environments, parameter passing methods, parameters that are subprograms, calling subprograms
indirectly, overloaded subprograms, generic subprograms, design issues for functions, user defined
overloaded operators, closures, co routines Implementing subprograms: General semantics of calls
and returns, implementing simple subprograms, implementing subprograms with stack-dynamic local
variables, nested subprograms, blocks, implementing dynamic scoping Abstract Data types: The concept of
abstraction, introductions to data abstraction, design issues, language examples, parameterized ADT, encapsulation
constructs, naming encapsulations
UNIT-IV
Object Oriented Programming: Design issues for OOP, OOP in Smalltalk, C++, Java, Ada 95, Ruby,
Implementation of Object-Oriented constructs.
Concurrency: introduction, introduction to subprogram level concurrency, semaphores, monitors,
message passing, Ada support for concurrency, Java threads, concurrency in functional languages, statement level
concurrency. Exception Handling and Event Handling: Introduction, exception handling in Ada, C++,Java,
introduction to event handling, event handling with Java and C#.
UNIT-V
Functional Programming Languages: Introduction, mathematical functions, fundamentals of functional
programming language, LISP, support for functional programming in primarily imperative languages,
comparison of functional and imperative languages Logic Programming Language:
Introduction, an overview of logic programming, basic elements of prolog, deficiencies of prolog,
applications of logic programming. Scripting Language: Pragmatics, Key Concepts, Case Study : Python –
Values and Types, Variables , Storage and Control, Bindings and Scope, Procedural Abstraction, Data Abstraction,
Separate Compilation, Module Library.
TEXT BOOKS:
1. Concepts of Programming Languages, Robert .W. Sebesta 10th edition, Pearson Education.
2. Programming Language Design Concepts, D. A. Watt, Wiley India Edition.
REFERENCE BOOKS:
1. Programming Languages, A.B. Tucker, R.E. Noonan, TMH.
2. Programming Languages, K. C. Louden and K A Lambert., 3rd edition, Cengage Learning.
3. Programming Language Concepts, C Ghezzi and M Jazayeri, Wiley India.
4. Programming Languages 2nd Edition Ravi Sethi Pearson.
5. Introduction to Programming Languages Arvind Kumar Bansal CRC Press.
B. Tech III Year I Sem LT P C

3 0 0 3
CS514PE: COMPUTER GRAPHICS
Prerequisites:
 Familiarity with the theory and use of coordinate geometry and of linear algebra such asmatrix multiplication.
Course Objectives
 The aim of this course is to provide an introduction of fundamental concepts and theory of computer graphics.
 Topics covered include graphics systems and input devices; geometric representations and 2D/3D
transformations; viewing and projections; illumination and color models; animation; rendering and
implementation; visible surface detection;
Course Outcomes
 Acquire familiarity with the relevant mathematics of computer graphics.
 Be able to design basic graphics application programs, including animation
 Be able to design applications that display graphic images to given specifications
UNIT – I
Introduction: Application areas of Computer Graphics, overview of graphics systems, video-display devices,
raster-scan systems, random scan systems, graphics monitors and workstations and input devices Output primitives:
Points and lines, line drawing algorithms (Bresenham’s and DDA Algorithm), mid-point circle and ellipse
algorithms Polygon Filling: Scan-line algorithm, boundary-fill and flood-fill algorithms
UNIT – II
2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations, matrix
representations and homogeneous coordinates, composite transforms, transformations between coordinate systems2-
D viewing: The viewing pipeline, viewing coordinate reference frame, window to view-port coordinate
transformation, viewing functions, Cohen-Sutherland algorithms, Sutherland – Hodgeman polygon clipping
algorithm.
UNIT – III
object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier curve and
B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models, polygon rendering methods.
UNIT – IV
Geometric transformations: Translation, rotation, scaling, reflection and shear transformations, composite
transformations.3-D viewing: Viewing pipeline, viewing coordinates, view volume and general projection
transforms and clipping.
UNIT – V
Computer animation: Design of animation sequence, general computer animation functions, raster animation,
computer animation languages, key frame systems, motion specifications Visible surface detection methods:
Classification, back-face detection, depth-buffer, BSP-tree methods and area sub-division methods
TEXT BOOKS:
1. “Computer Graphics C version”, Donald Hearn and M. Pauline Baker, Pearson Education
2. “Computer Graphics Principles & practice”, second edition in C, Foley, Van Dam, Feiner andHughes,
Pearson Education.
3. Computer Graphics, Steven Harrington, TMH
REFERENCE BOOKS:
1. Procedural elements for Computer Graphics, David F Rogers, Tata Mc Graw hill, 2nd edition.
2. Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH.
3. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.
B.Tech III Year I-Sem L P T C

0 0 2 1
CS505PC: ARTIFICIAL INTELLIGENCE LAB
Course Objectives:
 Study the concepts of Artificial Intelligence
 Learn the methods of solving problems using Artificial Intelligence
 Introduce the concepts of machine learning
Course Outcomes:
At the end of the course, the students will be able to:
• Identify problems that are amenable to solution by AI methods
• Identify appropriate AI methods to solve a given problem
• Use language/framework of different AI methods for solving problems
• Implement basic AI algorithms
• Design and carry out an empirical evaluation of different algorithms on problem formalization, and
state the conclusions that the evaluation supports
Experiments:
1) Study of Prolog.
2) Write simple fact for the statements using PROLOG.
3) Write predicates One converts centigrade temperatures to Fahrenheit, the other checksif a
temperature is below freezing
4) Write a program to solve the Monkey Banana problem.
5) Write a program in turbo prolog for medical diagnosis and show the advantage and
disadvantage of green and red cuts
6) Write a program to implement factorial, Fibonacci of a given number
7) Write a program to solve 4-Queen and 8-puzzle problem.
8) Write a program to solve traveling salesman problem.
9) Write a program to solve water jug problem using LISP
10) Implementation of A* Algorithm using LISP /PROLOG
11) Implementation of Hill Climbing Algorithm using LISP /PROLOG
12) Implementation of DFS and BFS for water jug problem using LISP /PROLOG
13) Implementation of Towers of Hanoi Problem using LISP /PROLOG
B.Tech. III Year I-Sem L T P C

0 0 3 1.5
CS506PC: COMPUTER NETWORKS LAB
(Common to CSE/CSM)
Course Objectives
 To understand the working principle of various communication protocols.
 To understand the network simulator environment and visualize a network topology
andobserve its performance
 To analyze the traffic flow and the contents of protocol frames
Course Outcomes
 Implement data link layer farming methods
 Analyze error detection and error correction codes.
 Implement and analyze routing and congestion issues in network design.
 Implement Encoding and Decoding techniques used in presentation layer
 To be able to work with different network tools
List of Experiments
1. Implement the data link layer framing methods such as character, character-stuffing and
bitstuffing.
2. Write a program to compute CRC code for the polynomials CRC-12, CRC-16 and CRC CCIP
3. Develop a simple data link layer that performs the flow control using the sliding window
protocol,and loss recovery using the Go-Back-N mechanism.
4. Implement Dijsktra’s algorithm to compute the shortest path through a network
5. Take an example subnet of hosts and obtain a broadcast tree for the subnet.
6. Implement distance vector routing algorithm for obtaining routing tables at each node.
7. Implement data encryption and data decryption
8. Write a program for congestion control using Leaky bucket algorithm.
9. Write a program for frame sorting technique used in buffers.
10. Wireshark
i. Packet Capture Using Wire shark
ii. Starting Wire shark
iii. Viewing Captured Traffic
iv. Analysis and Statistics & Filters.
11. How to run Nmap scan
12. Operating System Detection using Nmap
13. Do the following using NS2 Simulator
i. NS2 Simulator-Introduction
ii. Simulate to Find the Number of Packets Dropped
iii. Simulate to Find the Number of Packets Dropped by TCP/UDP
iv. Simulate to Find the Number of Packets Dropped due to Congestion
v. Simulate to Compare Data Rate& Throughput.
vi. Simulate to Plot Congestion for Different Source/Destination
vii. Simulate to Determine the Performance with respect to Transmission of Packets
B.Tech. III Year I Sem L T P C

0 0 3 2
CS507PC: DESIGN AND ANALYSIS OF ALGORITHMS LAB
(Common to CSE/CSC)
Course Objectives
 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.
Course Outcomes
 Ability to write programs in java to solve problems using algorithm design techniquessuch as
Divide and Conquer, Greedy, Dynamic programming, and Backtracking.
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. ii)
Write a. java program to implement the bfs algorithm for a graph.
4. Write a java programs to implement backtracking algorithm for the N-queensproblem.
5. Write a java program to implement the backtracking algorithm for the sum of subsetsproblem.
6. Write a java program to implement the backtracking algorithm for the Hamiltonian Circuits
problem.
7. Write a java program to implement greedy algorithm for job sequencing withdeadlines.
8. Write a java program to implement Dijkstra’s algorithm for the Single source shortest path problem.
9. Write a java program that implements Prim’s algorithm to generate minimum costspanning tree.
10. Write a java program that implements Kruskal’s algorithm to generate minimum costspanning tree
11. Write a java program to implement Floyd’s algorithm for the all pairs shortest pathproblem.
12. Write a java program to implement Dynamic Programming algorithm for the 0/1 Knapsack
problem.
13. Write a java program to implement Dynamic Programming algorithm for the Optimal Binary Search Tree
Problem.
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, 2nd Edition, R. Lafore, Pearson Education.
5. Data Structures using Java, D. S. Malik and P.S. Nair, Cengage Learning.
B.Tech III Year I Sem L T P C

0 0 2 0
MC509: CONSTITUTION OF INDIA
(Common to CSE/CSM/ IT/ECE/ME)
Course objective:
 To enable the student to understand the importance of constitution

 To understand the structure of executive, legislature and judiciary
 To understand philosophy of fundamental rights and duties
 To understand the autonomous nature of constitutional bodies like Supreme Court and high court, controller
and auditor general of India and election commission of India.
 To understand the central and state relation, financial and administrative.
Course Outcome:
 Able to understand historical background of the constitutional making and its importance for building a
democratic India, the structure of Indian government, the structure of state government, the local
Administration,
 Able to apply the knowledge on directive principle of state policy, the knowledge in strengthening of the
constitutional institutions like CAG, Election Commission and UPSC for sustaining democracy
 Able to analyze the History, features of Indian constitution, the role Governor and Chief Minister, role of
state election commission, the decentralization of power between central, state and local self-government.
 Able to evaluate Preamble, Fundamental Rights and Duties, Zilla Panchayat, block level organization,
various commissions of viz SC/ST/OBC and women.
The Constitution of India is the supreme law of India. Parliament of India cannot make any law which violates the
Fundamental Rights enumerated under the Part III of the Constitution. The Parliament of India has been empowered
to amend the Constitution under Article 368, however, it cannot use this power to change the “basic structure” of the
constitution, which has been ruled and explained by the Supreme Court of India in its historical judgments. The
Constitution of India reflects the idea of “Constitutionalism” – a modern and progressive concept historically
developed by the thinkers of “liberalism” – an ideology which has been recognized as one of the most popular
political ideology and result of historical struggles against arbitrary use of sovereign power by state. The historic
revolutions in France, England, America and particularly European Renaissance and Reformation movement have
resulted into progressive legal reforms in the form of “constitutionalism” in many countries. The Constitution of India
was made by borrowing models and principles from many countries including United Kingdom and America.
The Constitution of India is not only a legal document but it also reflects social, political and economic perspectives
of the Indian Society. It reflects India’s legacy of “diversity”. It has been said that Indian constitution reflects ideals of
its freedom movement; however, few critics have argued that it does not truly incorporate our own ancient legal
heritage and cultural values. No law can be “static” and therefore the Constitution of India has also been amended
more than one hundred times. These amendments reflect political, social and economic developments since the year
1950. The Indian judiciary and particularly the Supreme Court of India has played an historic role as the guardian
of people. It has been protecting not only basic ideals of the Constitution but also strengthened the same through
progressive interpretations of the text of the Constitution. The judicial activism of the Supreme Court of India and its
historic contributions has been recognized throughout the world and it gradually made it “as one of the strongest court
in the world”.
Course content
1. Meaning of the constitution law and constitutionalism

2. Historical perspective of the Constitution of India
3. Salient features and characteristics of the Constitution of India
4. Scheme of the fundamental rights
5. The scheme of the Fundamental Duties and its legal status
6. The Directive Principles of State Policy – Its importance and implementation
7. Federal structure and distribution of legislative and financial powers between the Union and the States
8. Parliamentary Form of Government in India – The constitution powers and status of the President of India
9. Amendment of the Constitutional Powers and Procedure
10. The historical perspectives of the constitutional amendments in India
11. Emergency Provisions: National Emergency, President Rule, Financial Emergency
12. Local Self Government – Constitutional Scheme in India
13. Scheme of the Fundamental Right to Equality
14. Scheme of the Fundamental Right to certain Freedom under Article 19
15.Scope of the Right to Life and Personal Liberty under Article 2
B.Tech. III Year I Sem L T P C

0 0 2 0
MC510: DEVOPS
Course Objectives
 To enable learners realize various aspects of DevOps Ecosystem.
 To enable students appreciate the agile led development environment.
 To enable students to grasp the need of Minimum viable product led development using Sprints.
 To enable students acquire fundamental knowledge of CI/CD and CAMS.
Course Outcomes:
At the end of this course student should be able to :
 Explain traditional software development methodologies like waterfall.
 Apply the Agile Methodology and comparing various other software development models with agile.
 Explain implementing Continuous Integration and Continuous Delivery.
 Explain CAMS for DevOps (Culture, Automation, Measurement and Sharing).
 Create quick MVP prototypes for modules and functionalities.
UNIT I:
TRADITIONAL SOFTWARE DEVELOPMENT
The Advent of Software Engineering, Waterfall method, Developers vs IT Operations conflict
UNIT II:
RISE OF AGILE METHODOLOGIES
Agile movement in 2000, Agile Vs Waterfall Method, Iterative Agile Software Development, Individual and team
interactions over processes and tools, Working software over comprehensive documentation, Customer collaboration over
contract negotiation, Responding to change over following a plan
UNIT III:
DEFINITION OF DEVOPS
Introduction to DevOps, DevOps and Agile.
UNIT IV:
PURPOSE OF DEVOPS
Minimum Viable Product, Application Deployment, Continuous Integration, Continuous
Delivery
UNIT V:
CAMS (CULTURE, AUTOMATION, MEASUREMENT AND SHARING)
CAMS – Culture, CAMS – Automation, CAMS – Measurement, CAMS – Sharing, Test-Driven Development, Configuration
Management, Infrastructure Automation, Root Cause Analysis, Blamelessness, Organizational Learning
TEXT BOOKS:
1. Dev Ops – Volume 1 , Pearson and Xebia Press
REFERENCE BOOKS:
1.The DevOps Handbook - Book by Gene Kim, Jez Humble, Patrick Debois, and Willis Willis
2.What is DevOps? - by Mike Loukides
B.Tech. III Year II Sem L T PC

3 0 0 3
CS601PC: COMPILER DESIGN

(Common to CSE/ CSD/CSC/IT )
Prerequisites
 A course on “Formal Languages and Automata Theory”
 A course on “Computer Organization and architecture”
Course Objectives:
 Introduce the major concepts of language translation and compiler design and impart the knowledge of
practical skills necessary for constructing a compiler.
 Topics include phases of compiler, parsing, syntax directed translation, type checking use of symbol tables,
code optimization techniques, intermediate code generation, code generation and data flow analysis.
Course Outcomes:
 Demonstrate the ability to design a compiler given a set of language features.

 Demonstrate the knowledge of patterns, tokens & regular expressions for lexical analysis.
 Acquire skills in using lex tool & yacc tool for developing a scanner and parser.
 Design and implement LL and LR parsers
 Design algorithms to do code optimization in order to improve the performance of a program in terms of
space and time complexity.
 Design algorithms to generate machine code.
UNIT - I
Introduction: 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.
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 and Parser
Generators.
UNIT - III
Syntax-Directed Translation: Syntax-Directed Definitions, Evaluation Orders for SDD's, Applications of Syntax-
Directed Translation, Syntax-Directed Translation Schemes, Implementing L-Attributed SDD's. Intermediate-Code
Generation: Variants of Syntax Trees, Three-Address Code, Types and Declarations, Type Checking, Control Flow,
Switch-Statements, Intermediate Code for Procedures.
UNIT - IV
Run-Time Environments: 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, A Simple Code Generator, Peephole
Optimization, Register Allocation and Assignment, Dynamic Programming Code-Generation.
UNIT - V
Machine-Independent Optimization: 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:
1. Compilers: Principles, Techniques and Tools, Second Edition, Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffry
D. Ullman.
REFERENCE BOOKS:
1. Lex&Yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly
2. Compiler Construction, Louden, Thomson.
B.Tech. III Year II Sem. L T PC

3 1 0 4
CS602PC: MACHINE LEARNING
(Common to CSE/CSD/CSM)
Prerequisites
 Data Structures
 Knowledge on statistical methods
Course Objectives
 This course explains machine learning techniques such as decision tree learning, Bayesian learning
etc.
 To understand computational learning theory.
 To study the pattern comparison techniques.
Course Outcomes
 Understand the concepts of computational intelligence like machine learning
 Ability to get the skill to apply machine learning techniques to address the real time problems in different
areas
 Understand the Neural Networks and its usage in machine learning application.
UNIT - I
Introduction - Well-posed learning problems, designing a learning system, Perspectives and issues in machine
learning ,Concept learning and the general to specific ordering – introduction, a concept learning task, concept
learning as search, find-S: finding a maximally specific hypothesis, version spaces and the candidate elimination
algorithm, remarks on version spaces and candidate elimination, inductive bias.
Decision Tree Learning – Introduction, decision tree representation, appropriate problems for decision tree
learning, the basic decision tree learning algorithm, hypothesis space search in decision tree learning, inductive bias in
decision tree learning, issues in decision tree learning.
UNIT - II
Artificial Neural Networks-1– Introduction, neural network representation, appropriate problems for network
learning, perceptions, multilayer networks and the back-propagation algorithm.
Artificial Neural Networks-2- Remarks on the Back-Propagation algorithm, An illustrative example: face
recognition, advanced topics in artificial neural networks.
Evaluation Hypotheses – Motivation, estimation hypothesis accuracy, basics of sampling theory, a general approach
for deriving confidence intervals, difference in error of two hypotheses, comparing learning algorithms.
UNIT - III
Bayesian learning – Introduction, Bayes theorem, Bayes theorem and concept learning, Maximum Likelihood and
least squared error hypotheses, maximum likelihood hypotheses for predicting probabilities, minimum description
length principle, Bayes optimal classifier, Gibs algorithm, Naïve Bayes classifier, an example: learning to classify
text, Bayesian belief networks, the EM algorithm. Computational learning theory – Introduction, probably
learning an approximately correct hypothesis, sample complexity for finite hypothesis space, sample complexity for
infinite hypothesis spaces, the mistake bound model of learning.
Instance-Based Learning- Introduction, k-nearest neighbor algorithm, locally weighted regression, radial basis
functions, case-based reasoning, remarks on lazy and eager learning.
Genetic Algorithms – Motivation, Genetic algorithms, an illustrative example, hypothesis space search,
genetic programming, models of evolution and learning, parallelizing genetic algorithms.
Learning Sets of Rules – Introduction, sequential covering algorithms, learning rule sets: summary, learning First-
Order rules, learning sets of First-Order rules: FOIL, Induction as inverted deduction, inverting resolution.
Reinforcement Learning – Introduction, the learning task, Q–learning, non-deterministic, rewards and actions,
temporal difference learning, generalizing from examples, relationship to dynamic programming.
UNIT - V
Analytical Learning-1- Introduction, learning with perfect domain theories: PROLOG-EBG, remarks on
explanation-based learning, explanation-based learning of search control knowledge.
Analytical Learning-2-Using prior knowledge to alter the search objective, using prior knowledge to
augment search operators.
Combining Inductive and Analytical Learning – Motivation, inductive-analytical approaches to learning, using prior
knowledge to initialize the hypothesis.
TEXT BOOKS:
1. Machine Learning – Tom M. Mitchell, - MGH
REFERENCE BOOK:
1. Machine Learning: An Algorithmic Perspective, Stephen Marshland, Taylor & Francis

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

3 0 0 3
CS603PC: WEB TECHNOLOGIES

(Common to CSE/ CSD/CSM/CSC/IT)
Course Objectives:
 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.
Course Outcomes
 Gain knowledge of client-side scripting, validation of forms and AJAX programming
 Understand server-side scripting with PHP language
 Understand what is XML and how to parse and use XML Data with Java
 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), 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
HTML Common tags- List, Tables, images, forms, Frames; Cascading Style sheets;
XML: Introduction to XML, Defining XML tags, their attributes and values, Document Type Definition,
XML Schemes, Document Object Model, XHTML Parsing XML Data – DOM and SAX Parsers in java.
UNIT - III
Introduction to Servlets: Common Gateway Interface (CGI), Life cycle 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.
UNIT - IV
Introduction to JSP: The Anatomy of a JSP Page, JSP Processing, Declarations, Directives,
Expressions, Code Snippets, implicit objects, Using Beans in JSP Pages, Using Cookies and session for
session tracking, connecting to database in JSP.
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.
TEXT BOOKS:
1. Web Technologies, Uttam K Roy, Oxford University Press
2. The Complete Reference PHP — Steven Holzner, Tata McGraw-Hill
REFERENCE BOOKS
1. Web Programming, building internet applications, Chris Bates 2″ edition, Wiley Dreamtech
2. Java Server Pages —Hans Bergsten, SPD O’Reilly,

3. Java Script, D.Flanagan
4. Beginning Web Programming-Jon Duckett WROX.
5. Programming world wide web, R.W.Sebesta, Fourth Edition, Pearson.
6. Internet and World Wide Web — How to program. Dietel and Nieto, Pearson.
B. Tech III Year II Sem LT P C

3 0 0 3
CS621PE: NETWORK PROGRAMMING AND MANAGEMENT
(Professional Elective – II)
Course Objectives: The student should be made to:
 Learn the basics of socket programming using TCP Sockets.

 Learn about Socket Options.
 Learn to develop Macros for including Objects In MIB Structure.
 Understand SNMPv1, v2 and v3 protocols & practical issues.
Course Outcomes: Upon completion of the course, the student should be able to:
 Develop programs using TCP Sockets.

 Use Socket Options.
 Develop Macros for including Objects In MIB Structure.
 Use SNMPv1, v2 and v3 protocols
UNIT- I
ELEMENTARY TCP SOCKETS
Introduction to socket programming – Overview of TCP / IP protocols – Introduction to sockets – Socket address
structures – Byte ordering functions – Address conversion functions– Elementary TCP sockets – Socket – Connect
– Bind – Listen – Accept – Read– Write – Close functions – Iterative server – Concurrent server.
UNIT- II
APPLICATION DEVELOPMENT
TCP echo server – TCP echo client – POSIX signal handling – Server with multiple clients
– Boundary conditions– Server process crashes– Server host crashes – Server crashes and reboots –
Server shutdown – I/O multiplexing – I/O models – Select function – Shutdown function –
TCP echo server (with multiplexing) – Poll function – TCP echo client (with multiplexing)
UNIT- III
SOCKET OPTIONS, ELEMENTARY UDP SOCKETS
Socket options – Get socket and set socket functions – Generic socket options – IP socket options– ICMP
socket options – TCP socket options – Elementary UDP sockets – UDP echo server – UDP
echo client – Multiplexing TCP and UDP sockets – Domain Name System
– Get host byname function – IPV6 support in DNS – Get host byadr function – Getserv
byname and getserv by port functions.
UNIT- IV ADVANCED SOCKETS

IPV4 and IPV6 interoperability – Threaded servers – Thread creation and termination– TCP echo
server using threads – Mutexes – Condition variables – Raw sockets – Raw socket creation – Raw
socket output – Raw socket input – Ping program – Trace route program.
UNIT- V
SIMPLE NETWORK MANAGEMENT
SNMP network management concepts – SNMP management information – Standard MIB‘s
– SNMP V1 protocol and practical issues – Introduction to RMON, SNMP V2 and SNMP V3.
TEXT BOOKS:
1. W. Richard Stevens, “UNIX Network Programming Vol-I”, Third Edition, PHI Pearson
Education, 2003.
2. William Stallings, “SNMP, SNMPv2, SNMPv3 and RMON 1 and 2”, Third Edition, Pearson
Edition, 2009.
REFERENCE BOOKS:
1. D.E. Comer, “Internetworking with TCP/IP Vol- III: Client-Server Programming and Application
BSD Sockets Version”, Second Edition, Pearson Edition, 2003.
B. Tech III Year II Sem LT P C

3 0 0 3
CS622PE: NATURAL LANGUAGE PROCESSING
Prerequisites:
Data structures, finite automata and probability theory
Course Objectives
 Introduce to some of the problems and solutions of NLP and their relation to linguistics and
statistics.
Course Outcomes
 Show sensitivity to linguistic phenomena and an ability to model them with formal grammars.
 Understand and carry out proper experimental methodology for training and evaluating empirical
NLP systems
 Able to manipulate probabilities, construct statistical models over strings and trees, and estimate
parameters using supervised and unsupervised training methods.
 Able to design, implement, and analyze NLP algorithms
 Able to design different language modeling Techniques.
UNIT – I
Finding the Structure of Words: Words and Their Components, Issues and Challenges, Morphological Models
Finding the Structure of Documents: Introduction, Methods, Complexity of the Approaches, Performances of the
Approaches.
UNIT – II
Syntax Analysis: Parsing Natural Language, Tree banks: A Data-Driven Approach to Syntax, Representation of
Syntactic Structure, Parsing Algorithms, Models for Ambiguity Resolution in Parsing, Multilingual Issues.
UNIT – III
Semantic Parsing: Introduction, Semantic Interpretation, System Paradigms, Word Sense Systems, Software.
UNIT – IV
Predicate- Argument Structure, Meaning Representation Systems, Software.
UNIT – V
Discourse Processing: Cohesion, Reference Resolution, Discourse Cohesion and Structure Language
Modeling: Introduction, N-Gram Models, Language Model Evaluation, Parameter Estimation, Language Model
Adaptation, Types of Language Models, Language-Specific Modeling Problems, Multilingual and Cross lingual
Language Modeling.
TEXT BOOKS:
1. Multilingual natural Language Processing Applications: From Theory to Practice – Daniel
M.Bikel and Imed Zitouni, Pearson Publication
2. Natural Language Processing and Information Retrieval: Tanvier Siddiqui, U.S. Tiwary
REFERENCE BOOKS:
1. Speech and Natural Language Processing - Daniel Jurafsky & James H Martin, Pearson Publications

LT P C
B. Tech III Year II Sem 3 0 0 3
CS623PE: SOFTWARE PROJECT MANAGEMENT

Course Objectives:
 Understanding the specific roles within a software organization as related to project and process
management
 Understanding the basic infrastructure competences (e.g., process modeling and measurement)
 Understanding the basic steps of project planning, project management, quality assurance, and
process management and their relationships.
Course Outcomes:
At the end of the course, the student shall be able to:
 Describe and determine the purpose and importance of project management from the perspectives of
planning, tracking and completion of project
 Compare and differentiate organization structures and project structures.
 Implement a project to manage project schedule, expenses and resource with the application of suitable
project management tools
UNIT – I
Conventional Software Management: The waterfall Model, Conventional Software Management Performance,
Evolution of Software Economics: software Economics. Pragmatic Software Cost Estimation. Improving Software
Economics: Reducing Software Product Size, Improving Software Processes, Improving Team Effectiveness,
Improving Automation, Achieving Required Quality, Peer Inspections.
UNIT – II
Conventional and Modern Software Management: Principles of Conventional Software Engineering, Principles
of Modern Software Management, Transitioning to an interactive Process.
Life Cycle Phases: Engineering and Production Stages Inception, Elaboration, Construction, Transition
phases.
UNIT – III
Artifacts of the Process: The Artifact Sets. Management Artifacts, Engineering Artifacts, Programmatic Artifacts.
Model Based Software Architectures: A Management Perspective and Technical Perspective.
UNIT – IV
Flows of the Process: Software Process Workflows. Inter Trans Workflows.
Checkpoints of the Process: Major Milestone, Minor Milestones, Periodic Status Assessments. Interactive Process
Planning: Work Breakdown Structures, Planning Guidelines, Cost and Schedule Estimating. Interaction Planning
Process, Pragmatic Planning.
UNIT – V
Project Organizations and Responsibilities: Line-of-Business Organizations, Project Organizations, and
Evolution of Organizations. Process Automation: Building Blocks, the Project Environment. Project Control and
Process Instrumentation: Server Care Metrics, Management Indicators, Quality Indicators, Life Cycle Expectations
Pragmatic Software
TEXT BOOKS:
1. Walker Rayce, “Software Project Management”, 1998, PEA. Henrey, “Software Project Management”,
Pearson
REFERENCE BOOKS:
1. Richard H.Thayer.” Software Engineering Project Management”, 1997, IEEE ComputerSociety.
2. Shere K.D.: “Software Engineering and Management”, 1998, PHI.
3. S.A. Kelkar, “Software Project Management: A Concise Study”, PHI.
4. Hughes Cotterell, “Software Project Management”, 2e, TMH. 88 5. Kaeron Conway“Software Project
Management from Concept to D
B. Tech III Year II Sem L T P C

3 0 0 3
CS624PE: INFORMATION RETRIEVAL SYSTEMS
Course Objectives:
 To learn the important concepts and algorithms in IRS.
 To understand the data/file structures that are necessary to design, and implement information
retrieval (IR) systems.
Course Outcomes:
 Ability to apply IR principles to locate relevant information large collections of data
 Ability to design different document clustering algorithms
 Implement retrieval systems for web search tasks.
 Design an Information Retrieval System for web search tasks.
UNIT – I
Introduction to Information Retrieval Systems: Definition of Information Retrieval System, Objectives of
Information Retrieval Systems, Functional Overview, Relationship to Database Management Systems, Digital
Libraries and Data Warehouses Information Retrieval System Capabilities: Search Capabilities, Browse Capabilities,
Miscellaneous Capabilities
UNIT – II
Cataloging and Indexing: History and Objectives of Indexing, Indexing Process, Automatic Indexing, Information
Extraction Data Structure: Introduction to Data Structure, Stemming Algorithms, Inverted File Structure, N-Gram
Data Structures, PAT Data Structure, Signature File Structure, Hypertext and XML Data Structures, Hidden
Markov Models
UNIT – III
Automatic Indexing: Classes of Automatic Indexing, Statistical Indexing, Natural Language, Concept Indexing,
Hypertext Linkages Document and Term Clustering: Introduction to Clustering, Thesaurus Generation, Item
Clustering, Hierarchy of Clusters
UNIT – IV
User Search Techniques: Search Statements and Binding, Similarity Measures and Ranking, Relevance
Feedback, Selective Dissemination of Information Search, Weighted Searches of Boolean Systems, Searching the
INTERNET and Hypertext Information Visualization: Introduction to Information Visualization, Cognition and
Perception ,Information Visualization Technologies
UNIT – V
Text Search Algorithms: Introduction to Text Search Techniques, Software Text Search Algorithms, Hardware
Text Search Systems Multimedia Information Retrieval: Spoken Language Audio Retrieval, Non-Speech Audio
Retrieval, Graph Retrieval, Imagery Retrieval, Video Retrieval
TEXT BOOKS:
1. Information Storage and Retrieval Systems – Theory and Implementation, Second Edition, Gerald J.
Kowalski, Mark T. Maybury, Springer
REFERENCE BOOKS:
1. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures and Algorithms, Prentice
Hall, 1992.
2. Information Storage & Retrieval By Robert Korfhage – John Wiley & Sons.
3. Modern Information Retrieval By Yates and Neto Pearson Educatio
B.Tech. III Year II Sem. LP T C

0 0 3 1.5
EN604HS: ADVANCED COMMUNICATION SKILLS LAB
INTRODUCTION:
The introduction of the Advanced Communication Skills Lab is considered essential at 3rd year level. At this stage,
the students need to prepare themselves for their careers which may require them to listen to, read, speak and write in
English both for their interpersonal and professional communication in the globalized context.
The proposed course should be a laboratory course to enable students to use English effectively and perform the
following:
 Gathering ideas and information to organize ideas relevantly and coherently.
 Engaging in debates.
 Participating in group discussions.
 Facing interviews.
 Writing project/research reports/technical reports.
 Making oral presentations.
 Writing formal letters.
 Transferring information from non-verbal to verbal texts and vice-versa.
 Taking part in social and professional communication.
COURSE OBJECTIVES:
This Lab focuses on using multi-media instruction for language development to meet the following targets:
1. To improve the students’ fluency in English, through a well-developed vocabulary and enable them to listen to
English spoken at normal conversational speed and respond appropriately in different socio- cultural and
professional contexts.
2. Further, they would be required to communicate their ideas relevantly and coherently in writing.
3. To prepare all the students for their placements.
COURSE OUTCOMES:
Students will be able to:
• Acquire vocabulary and use it contextually
• Listen and speak effectively
• Develop proficiency in academic reading and writing
• Increase possibilities of job prospects
• Communicate confidently in formal and informal contexts.
SYLLABUS:
The following course content to conduct the activities is prescribed for the Advanced English
Communication Skills (AECS) Lab:
1. Activities on Fundamentals of Inter-personal Communication and Building Vocabulary -

Starting a conversation – responding appropriately and relevantly – using the right body language – Role Play in
different situations & Discourse Skills- using visuals - Synonyms and antonyms, word roots, one- word substitutes,
prefixes and suffixes, study of word origin, business vocabulary, analogy, idioms and phrases, collocations & usage
of vocabulary.
2. Activities on Reading Comprehension –General Vs Local comprehension, reading for facts, guessing
meanings from context, scanning, skimming, inferring meaning, critical reading& effective googling.
3. Activities on Writing Skills – Structure and presentation of different types of writing – letter Writing/resume
writing/ e-correspondence/technical report writing/ – planning for writing – improving students’ writing skills.
4. Activities on Presentation Skills and Team Building – Oral presentations (individual and group) through JAM
Sessions/seminars/PPTs and written presentations through posters/projects/reports/ emails/ assignments etc.
Activities on Presentation Skills, Team Building and Leadership Skills through Problem solving and Team
Development Exercises.
5. Activities on Group Discussion and Interview Skills – Dynamics of group discussion, intervention,
summarizing, modulation of voice, body language, relevance, fluency and organization of ideas and rubrics for
evaluation
 Concept and process, pre-interview planning, opening strategies, answering strategies, interview through tele-
conference & video-conference and Mock Interviews.
MINIMUM REQUIREMENT:
The Advanced Communication Skills (ACS) Laboratory shall have the following infrastructural facilities to
accommodate at least 35 students in the lab:
 Spacious room with appropriate acoustics.
 Round Tables with movable chairs
 Audio-visual aids
 LCD Projector
 Public Address system
 P – IV Processor, Hard Disk – 80 GB, RAM–512 MB Minimum, Speed – 2.8 GHZ
 T. V, a digital stereo & Camcorder
 Headphones of High quality
SUGGESTED SOFTWARE:
The software consisting of the prescribed topics elaborated above should be procured and used.
 Oxford Advanced Learner’s Compass, 7th Edition
 DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice.
 Lingua TOEFL CBT Insider, by Dream tech
 TOEFL & GRE (KAPLAN, AARCO & BARRONS, USA, Cracking GRE by CLIFFS)
TEXT BOOKS:
1. Effective Technical Communication by M Asharaf Rizvi. McGraw Hill Education (India) Pvt. Ltd.2nd
Edition
2. Academic Writing: A Handbook for International Students by Stephen Bailey, Routledge, 5th
Edition.
REFERENCE BOOKS:
1. Learn Correct English – A Book of Grammar, Usage and Composition by Shiv K. Kumar and
Hemalatha Nagarajan. Pearson 2007
2. Professional Communication by Aruna Koneru, McGraw Hill Education (India) Pvt. Ltd, 2016.
3. Technical Communication by Meenakshi Raman & Sangeeta Sharma, Oxford University Press 2009.
4. Technical Communication by Paul V. Anderson. 2007. Cengage Learning pvt. Ltd. New Delhi.
5. English Vocabulary in Use series, Cambridge University Press 2008.
6. Handbook for Technical Communication by David A. McMurrey & Joanne Buckley. 2012. Cengage
Learning.
7. Communication Skills by Leena Sen, PHI Learning Pvt Ltd., New Delhi, 2009.
8. Job Hunting by Colm Downes, Cambridge University Press 2008.
9. English for Technical Communication for Engineering Students, Aysha Vishwamohan, Tata Mc Graw- Hill
2009.
B.Tech. III Year II Sem. LT P C

0 02 1
CS605PC: MACHINE LEARNING LAB
(Common to CSE/CSM/CSD)
Course Objective
 The objective of this lab is to get an overview of the various machine learning techniques and can able to
demonstrate them using python.
Course Outcomes: After the completion of the course the student can able to:
 understand complexity of Machine Learning algorithms and their limitations;
 understand modern notions in data analysis-oriented computing;
 be capable of confidently applying common Machine Learning algorithms in practice and
 implementing their own;
 Be capable of performing experiments in Machine Learning using real-world data.
List of Experiments
1. The probability that it is Friday and that a student is absent is 3 %. Since there are 5 school days in a week, the
probability that it is Friday is 20 %. What is the probability that a student is absent given that today is Friday?
Apply Baye’s rule in python to get the result. (Ans: 15%)
2. Extract the data from database using python
3. Implement k-nearest neighbors classification using python
4. Given the following data, which specify classifications for nine combinations of VAR1 and VAR2
,predict a classification for a case where VAR1=0.906 and VAR2=0.606, using the result of k means clustering with
3 means (i.e., 3 centroids)
VAR1 VAR2 CLASS

1.713 1.586 0
0.180 1.786 1
0.353 1.240 1
0.940 1.566 0
1.486 0.759 1
1.266 1.106 0
1.540 0.419 1
0.459 1.799 1
0.773 0.186 1
5. The following training examples map descriptions of individuals onto high, medium and low credit-
worthiness.
medium skiing design single twenties no ->highRisk high

golf trading married forties yes ->lowRisk
low speedway transport married thirties yes ->medRisk
medium football banking single thirties yes ->lowRisk high
flying media married fifties yes ->highRisk
low football security single twenties no ->medRisk
medium golf media single thirties yes ->medRisk
medium golf transport married forties yes ->lowRisk
high skiing banking single thirties yes ->highRisk low
golf unemployed married forties yes ->highRisk
Input attributes are (from left to right) income, recreation, job, status, age-group, home-owner. Find the unconditional
probability of `golf' and the conditional probability of `single' given ‘medRisk’ in the dataset?
6. Implement linear regression using python.
7. Implement Naïve Bayes theorem to classify the English text
8. Implement an algorithm to demonstrate the significance of genetic algorithm
9. Implement the finite words classification system using Back-propagation algorithm

B.Tech. III Year II Sem. LTP C

0 0 3 1.5
CS606PC: WEB TECHNOLOGIES LAB
(Common to CSE/CSM/CSD/IT)
Course Objectives:
 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
 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)
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
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 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 number” message in the result box.
4. Write an HTML page that has one input, which can take multi-line text and a submit 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.
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 from the XML document using
(a) DOM Parser and (b) SAX parser
7. Implement the following web applications using (a) PHP, (b) Servlets and (c) JSP:
8. 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.
9. Modify the above program to use an xml file instead of database.
10. Modify the above program to use AJAX to show the result on the same page below the submit button.
11. 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.
12. 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.
13. 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).
14. 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” message, where <name> should be replaced with the
entered name. Otherwise it should send “Welcome <name> to this site” message.
15. 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.
 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)
16. A web application that lists all cookies stored in the browser on clicking “List Cookies” button. Add cookies
if necessary.
TEXT BOOKS:
1. WEB TECHNOLOGIES: A Computer Science Perspective, Jeffrey C. Jackson, Pearson Education
REFERENCE BOOKS:
1. The Complete Reference PHP – Steven Holzner, Tata McGraw-Hill
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.
B.Tech. III Year II Sem. LT P C

3 0 0 0
MC609: INTELLECTUAL PROPERTY RIGHTS
(Common to CSE/CSM/ IT/ECE/ME)
COURSE OBJECTIVE:
 Understanding, defining and differentiating different types of intellectual properties (IPs) and their roles in
contributing to organizational competitiveness.
 Understanding the Framework of Strategic Management of Intellectual Property (IP).
 Appreciating and appraising different IP management (IPM) approaches and describing how pioneering
firms initiate, implement and manage IPM programs,
 Explaining how to derive value from IP and leverage its value in new product and service
 Development Exposing to the Legal management of IP and understanding of real life practice of IPM
COURSE OUTCOME:
 Identify different types of Intellectual Properties (IPs), the right of ownership, scope of protection as well
as the ways to create and to extract value from IP.
 Recognize the crucial role of IP in organizations of different industrial sectors for the purposes of product
and technology development.
 Identify activities and constitute IP infringements and the remedies available to the IP owner and describe
the precautious steps to be taken to prevent infringement of proprietary rights in products and technology
development.
 Be familiar with the processes of Intellectual Property Management (IPM) and various approaches for IPM
and conducting IP and IPM auditing and explain how IP can be managed as a strategic resource and suggest
IPM strategy.
 Be able to anticipate and subject to critical analysis arguments relating to the development and reform of
intellectual property right institutions and their likely impact on creativity and innovation.
 Be able to demonstrate a capacity to identify, apply and assess ownership rights and marketing protection
under intellectual property law as applicable to information, ideas, new products and product marketing;
UNIT – I
Introduction to Intellectual property: Introduction, types of intellectual property, international organizations,
agencies and treaties, importance of intellectual property rights.
UNIT – II
Trade Marks: Purpose and function of trademarks, acquisition of trade mark rights, protectable matter, selecting, and
evaluating trade mark, trade mark registration processes.
UNIT – III
Law of copy rights: Fundamental of copy right law, originality of material, rights of reproduction, rights to perform
the work publicly, copy right ownership issues, copy right registration, notice of copy right, International copy right
law.
Law of patents: Foundation of patent law, patent searching process, ownership rights and transfer
UNIT – IV
Trade Secrets: Trade secrete law, determination of trade secrete status, liability for misappropriations of trade
secrets, protection for submission, trade secrete litigation.
Unfair competition: Misappropriation right of publicity, false advertising.
UNIT – V
New development of intellectual property: new developments in trade mark law; copy right law, patent law,
intellectual property audits. International overview on intellectual property, international – trade mark law, copy right
law, International patent law, and international development in trade secrets law.
TEXTBOOKS
1. V. Scople Vinod, Managing Intellectual Property, Prentice Hall of India pvt Ltd, 2012
2. S. V. Satakar, “Intellectual Property Rights and Copy Rights, Ess Ess Publications, New Delhi, 2002
REFERENCE BOOKS:
1. Intellectual property right, Deborah. E. Bouchoux, Cengage learning.
2. Intellectual property right – Unleashing the knowledge economy, prabuddha ganguli, Tata McGraw Hill
Publishing company ltd.
L P T C
B.Tech III Year II Sem 2 0 0 0
MC610: CYBER SECURITY

(COMMON TO CSE/ME/ECE/IT)
Course objectives:
 To familiarize various types of cyber-attacks and cyber-crimes
 To give an overview of the cyber laws
 To study the defensive techniques against these attacks
Course Outcomes:
 The students will be able to understand cyber-attacks, types of cybercrimes, cyber laws and also how to
protect them self and ultimately the entire Internet community from such attacks.
UNIT - I
Introduction to Cyber Security: Basic Cyber Security Concepts, layers of security, Vulnerability, threat, Harmful
acts, Internet Governance – Challenges and Constraints, Computer Criminals, CIA Triad, Assets and Threat, motive
of attackers, active attacks, passive attacks, Software attacks, hardware attacks, Spectrum of attacks, Taxonomy of
various attacks, IP spoofing, Methods of defense, Security Models, risk management, Cyber Threats-Cyber Warfare,
Cyber Crime, Cyber terrorism, Cyber Espionage, etc., Comprehensive Cyber Security Policy.
UNIT - II
Cyberspace and the Law & Cyber Forensics: Introduction, Cyber Security Regulations, Roles of International
Law. The INDIAN Cyberspace, National Cyber Security Policy.
Introduction, Historical background of Cyber forensics, Digital Forensics Science, The Need for Computer
Forensics, Cyber Forensics and Digital evidence, Forensics Analysis of Email, Digital Forensics Lifecycle,
Forensics Investigation, Challenges in Computer Forensics, Special Techniques for Forensics Auditing.
UNIT - III
Cybercrime: Mobile and Wireless Devices: Introduction, Proliferation of Mobile and Wireless Devices, Trends in
Mobility, Credit card Frauds in Mobile and Wireless Computing Era, Security Challenges Posed by Mobile Devices,
Registry Settings for Mobile Devices, Authentication service Security, Attacks on Mobile/Cell Phones, Mobile
Devices: Security Implications for Organizations, Organizational Measures for Handling Mobile, Organizational
Security Policies and Measures in Mobile Computing Era, Laptops.
UNIT - IV
Cyber Security: Organizational Implications: Introduction, cost of cybercrimes and IPR issues, web threats for
organizations, security and privacy implications, social media marketing: security risks and perils for organizations,
social computing and the associated challenges for organizations. Cybercrime and Cyber terrorism:
Introduction, intellectual property in the cyberspace, the ethical dimension of cybercrimes the psychology, mindset
and skills of hackers and other cyber criminals.
UNIT - V
Privacy Issues: Basic Data Privacy Concepts: Fundamental Concepts, Data Privacy Attacks, Data linking and
profiling, privacy policies and their specifications, privacy policy languages, privacy in different domains- medical,
financial, etc.
Cybercrime: Examples and Mini-Cases
Examples: Official Website of Maharashtra Government Hacked, Indian Banks Lose Millions of Rupees,
Parliament Attack, Pune City Police Bust Nigerian Racket, e-mail spoofing instances.
Mini-Cases: The Indian Case of online Gambling, An Indian Case of Intellectual Property Crime,
Financial Frauds in Cyber Domain.
TEXT BOOKS:
1.Nina Godbole and Sunit Belpure, Cyber Security Understanding Cyber Crimes, Computer Forensics and
Legal Perspectives, Wiley
2.B. B. Gupta, D. P. Agrawal, Haoxiang Wang, Computer and Cyber Security: Principles, Algorithm,
Applications, and Perspectives, CRC Press, ISBN 9780815371335, 2018.
REFERENCES:
1.Cyber Security Essentials, James Graham, Richard Howard and Ryan Otson, CRC Press.
2.Introduction to Cyber Security, Chwan-Hwa(john) Wu,J. David Irwin, CRC Press T&F Group
B.Tech in COMPUTER SCIENCE AND ENGINEERING

IV YEAR I SEMESTER

Data Mining
1 CS701PC 3 0 0 3
Internet of Things
2 CS702PC 3 0 0 3
3 Professional Elective - III 3 0 0 3
4 Professional Elective -IV 3 0 0 3
5 Open Elective-II / MOOCS 3 0 0 3
6 CS703PC Data Mining Lab 0 0 3 1.5
7 CS704PC Internet of Things Lab 0 0 3 1.5
8 CS705PROJ Industry Oriented Mini Project 0 0 4 2
9 CS706PROJ Project -I 0 0 6 3
IV YEAR II SEMESTER

1 Professional Elective -V / MOOCS 3 0 0 3
2 Professional Elective –VI 3 0 0 3
3 Open Elective-III / MOOCS 3 0 0 3
4 CS801PROJ Seminar 0 0 2 1
5 CS802PROJ Project -II 0 0 16 8
Professional Elective – III

CS731PE Information Security & Risk management
CS732PE Deep Learning
CS733PE Object Oriented Modeling and Design
CS734PE Image Progressing
Professional Elective – IV
CS741PE Distributed Systems
CS742PE Semantic web and Social Networks
CS743PE Software Testing Methodologies
CS744PE Pattern Recognition
Professional Elective - V
CS851PE Blockchain Technology
CS852PE Mobile Application Development
CS853PE Design Patterns
CS854PE Virtual Reality
Professional Elective - VI
CS861PE Cyber Forensics
CS862PE Robotics Process Automation
CS863PE cloud computing
CS864PE Computer Vision

B.Tech. IV Year I Sem. L T P C
3 0 0 3
CS701PC: DATA MINING

(COMMON TO CSE/IT)
Course Objectives:
• Learn data mining concepts understand association rules mining.
• Discuss classification algorithms learn how data is grouped using clustering
techniques.
• To develop the abilities of critical analysis to data mining systems and applications.
• To implement practical and theoretical understanding of the technologies for datamining
• To understand the strengths and limitations of various data mining models;
Course Outcomes:
• Ability to perform the preprocessing of data and apply mining techniques on it.
• Ability to identify the association rules, classification and clusters in large data sets.
• Ability to solve real world problems in business and scientific information using datamining
• Ability to classify web pages, extracting knowledge from the web
UNIT - I
Introduction to Data Mining: Introduction, What is Data Mining, Definition, KDD, Challenges, Data
Mining Tasks, Data Preprocessing, Data Cleaning, Missing data, Dimensionality Reduction, Feature Subset
Selection, Discretization and Binaryzation, Data Transformation; Measures of Similarity and Dissimilarity-
Basics.
UNIT - II
Association Rules: Problem Definition, Frequent Item Set Generation, The APRIORI Principle, Support
and Confidence Measures, Association Rule Generation; APRIOIRI Algorithm, The Partition Algorithms,
FP-Growth Algorithms, Compact Representation of Frequent Item Set- Maximal Frequent Item Set, Closed
Frequent Item Set.
UNIT - III
Classification: Problem Definition, General Approaches to solving a classification problem , Evaluation of
Classifiers , Classification techniques, Decision Trees-Decision tree Construction , Methods for Expressing
attribute test conditions, Measures for Selecting the Best Split, Algorithm for Decision tree Induction ;
Naive-Bayes Classifier, Bayesian Belief Networks; K- Nearest neighbor classification- Algorithm and
Characteristics.
UNIT - IV
Clustering: Problem Definition, Clustering Overview, Evaluation of Clustering Algorithms, Partitioning
Clustering-K-Means Algorithm, K-Means Additional issues, PAM Algorithm;
Hierarchical Clustering-Agglomerative Methods and divisive methods, Basic Agglomerative Hierarchical
Clustering Algorithm, Specific techniques, Key Issues in Hierarchical Clustering, Strengths and Weakness;
Outlier Detection.
UNIT - V
Web and Text Mining: Introduction, web mining, web content mining, web structure mining, we usage
mining, Text mining –unstructured text, episode rule discovery for texts, hierarchy of categories, text
clustering.
TEXT BOOKS:
1. Data Mining- Concepts and Techniques- Jiawei Han, Micheline Kamber, MorganKaufmann
Publishers, Elsevier, 2 Edition, 2006.
2. Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael Steinbanch,Pearson
Education.
3. Data mining Techniques and Applications, Hongbo Du Cengage India Publishing
REFERENCE BOOKS:
1. Data Mining Techniques, Arun K Pujari, 3rd Edition, Universities Press.
2. Data Mining Principles & Applications – T.V Sveresh Kumar, B.Esware Reddy,Jagadish S
Kalimani, Elsevier.
3. Data Mining, Vikaram Pudi, P Radha Krishna, Oxford University Press

3 0 0 3
CS702PC: INTERNET OF THINGS
(COMMON TO CSE/CSM)
Course Objectives:
• To introduce the terminology, technology and its applications
• To introduce the concept of M2M (machine to machine) with necessary protocols
• To introduce the Python Scripting Language which is used in many IoT devices
• To introduce the Raspberry PI platform, that is widely used in IoT applications
• To introduce the implementation of web based services on IoT devices
Course Outcomes:
• Interpret the impact and challenges posed by IoT networks leading to new architectural models.
• Compare and contrast the deployment of smart objects and the technologies to connect them to
network.
• Appraise the role of IoT protocols for efficient network communication.
• Elaborate the need for Data Analytics and Security in IoT.
• Illustrate different sensor technologies for sensing real world entities and identify the
applications of IoT in Industry.
UNIT - I
Introduction to Internet of Things –Definition and Characteristics of IoT, Physical Design of IoT – IoT
Protocols, IoT communication models, Iot Communication APIs IoT enabaled Technologies – Wireless
Sensor Networks, Cloud Computing, Big data analytics, Communication protocols, Embedded Systems,
IoT Levels and Templates Domain Specific IoTs – Home, City, Environment, Energy, Retail, Logistics,
Agriculture, Industry, health and Lifestyle
UNIT - II
IoT and M2M – Software defined networks, network function virtualization, difference between SDN and
NFV for IoT Basics of IoT System Management with NETCOZF, YANG- NETCONF, YANG, SNMP
NETOPEER
UNIT - III
Introduction to Python - Language features of Python, Data types, data structures, Control of flow,
functions, modules, packaging, file handling, data/time operations, classes, Exception handling Python
packages - JSON, XML, HTTPLib, URLLib, SMTPLib
UNIT - IV
IoT Physical Devices and Endpoints - Introduction to Raspberry PI-Interfaces (serial, SPI, I2C)
Programming – Python program with Raspberry PI with focus of interfacing external gadgets, controlling
output, reading input from pins.
UNIT - V
IoT Physical Servers and Cloud Offerings – Introduction to Cloud Storage models and communication
APIs Webserver – Web server for IoT, Cloud for IoT, Python web application framework Designing a
RESTful web API
TEXT BOOKS:
1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti,
Universities Press, 2015, ISBN: 9788173719547
2. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O'Reilly (SPD),
2014, ISBN: 9789350239759

B.Tech. IV Year I Sem L T P C
3 0 0 3
CS731PE: INFORMATION SECURITY& RISK MANAGEMENT

(Professional Elective – III)
Prerequisites:
A Course on “Computer Networks and a course on Mathematics .
Course Objectives:
 To understand the fundamentals ofCryptography
 To understand various key distribution and managementschemes
 To understand how to deploy encryption techniques to secure data in transit across data
networks
 To apply algorithms used for secure transactions in real worldapplications
 Understand Intrusions and intrusiondetection
 Discuss the fundamental ideas of public-keycryptography.
Course Outcomes:
 Demonstrate the knowledge of cryptography, network security concepts andapplications.
 Ability to apply security principles in systemdesign.
 Ability to identify information system requirements for both of them such as client
andserver.
 Ability to create the firewall and IDS.
 Ability to Evaluating the Risk Analysis Process.
UNIT - I
Information Security Management:
Information Security Overview, Threat and Attack Vectors, Types of Attacks, Common Vulnerabilities and
Exposure(CVE), Security Attacks, Fundamentals of Information Security, Computer Security Concerns,
Information Security Measures etc.
A model for Internetwork security. Classical Encryption Techniques, DES, Strength of DES, Differential and
Linear Cryptanalysis, Block Cipher Design Principles and Modes of operation, Blowfish, Placement of
Encryption Function, Traffic Confidentiality, key Distribution, Random Number Generation.
UNIT - II
Public key Cryptography Principles, RSA algorithm, Key Management, Diffie-Hellman Key Exchange,
Elliptic Curve Cryptography. Message authentication and Hash Functions, Authentication Requirements and
Functions, Message Authentication, Hash Functions and MACs Hash and MAC Algorithms SHA-512, HMAC.
UNIT - III
Digital Signatures: Authentication Protocols, Digital signature Standard, Authentication Applications,
Kerberos, X.509 Directory Authentication Service. Email Security: Pretty Good Privacy (PGP) and S/MIME.
UNIT - IV
Data Leakage: What is Data Leakage and Statistics, Data Leakage Threats, Reducing the Risk of Data
Loss, Key Performance Indicators (KPI), Database Security etc.
IP Security: Overview, IP Security Architecture, Authentication Header, Encapsulating Security
Payload, Combining Security Associations and Key Management.

Web Security: Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security
(TLS), Secure Electronic Transaction (SET). Intruders, Viruses and Worms Intruders, Viruses and related threats
Firewalls: Firewall Design Principles, Trusted Systems, Intrusion Detection Systems
UNIT - V
Information Security Management- Roles and Responsibilities:
Security Roles and Responsibilities, Accountability, Roles and Responsibilities of Information Security Management,
Team Responding to Emergency Situation- Risk Analysis Process etc.
TEXT BOOKS:
1. Cryptography and Network Security (principles and approaches) by William Stallings Pearson
Education, 4th Edition.
2. Management of Information Security by Michael E.Whilman and Herbert J.Mattord
REFERENCE BOOKS:
1. Network Security Essentials (Applications and Standards) by William Stallings Pearson
Education.
2. Principles of Information Security, Whitman,Thomson.

3 0 0 3
CS732PE: DEEP LEARNING

Course Objectives
By the end of the course, students will be able to
 understand complexity of Deep Learning algorithms and their limitations
 understand modern notions in data analysis oriented computing;
 Be capable of confidently applying common Deep Learning algorithms in practiceand
implementing their own;
 Be capable of performing distributed computations;
 Be capable of performing experiments in Deep Learning using real-world data.
Course Outcomes:
By the end of this deep learning course with Tensor Flow, the student will be able to
 Understand the concepts of Tensor Flow, its main functions, operations and the execution pipeline
 Implement deep learning algorithms, understand neural networks and traverse the layers of data
abstraction which will empower the student to understand data moreprecisely.
 Learn topics such as conventional neural networks, recurrent neural networks, training deep networks and
high-level interfaces
 Build deep learning models in Tensor Flow and interpret the results
 Understand the language and fundamental concepts of artificial neural networks
 Troubleshoot and improve deep learning models
 Build own deep learning project
 Differentiate between machine learning, deep learning and artificial intelligence
UNIT-I
Introduction to Tensor Flow: Computational Graph, Key highlights, Creating a Graph,Regression
example, Gradient Descent, Tensor Board, Modularity, Sharing Variables, eras
Perceptions: What is a Perception, XOR Gate
UNIT-II
Activation Functions: Sigmoid, ReLU, Hyperbolic Fns, Softmax
Artificial Neural Networks: Introduction, Perceptron Training Rule, Gradient Descent Rule
UNIT- III
Gradient Descent and Back propagation: Gradient Descent, Stochastic Gradient Descent, Back propagation, Some
problems in ANN
Optimization and Regularization: Overfitting and Capacity, Cross Validation, Feature Selection,
Regularization, Hyperparameters
UNIT-IV
Introduction to Convolutional Neural Networks: Introduction to CNNs, Kernel filter, Principles behind
CNNs, Multiple Filters, CNN applications Introduction to Recurrent Neural Networks: Introduction to RNNs,
Unfolded RNNs,Seq2Seq RNNs, LSTM, RNN applications
UNIT-V
Deep Learning applications: Image Processing, Natural Language Processing,Speech Recognition,
Video Analytics
TEXT BOOKS:
1. Goodfellow, I., Bengio,Y., and Courville, A., Deep Learning, MIT Press, 2016.
2. Francois Chollet, “Deep Learning with Python”, Manning Publications, 2018
References:
1. Bishop, C. ,M., Pattern Recognition and Machine Learning, Springer, 2006.
2. Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
3. Golub, G.,H., and Van Loan,C.,F., Matrix Computations, JHU Press,2013.
4. Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill Education,2004.
5. Phil Kim, “Matlab Deep Learning: With Machine Learning, Neural Networks and Artificial Intelligence” A
press, 2017.
6. Ragav Venkatesan, Baoxin Li, “Convolutional Neural Networks in Visual Computing”, CRC Press, 2018

3 0 0 3
CS733PE: OBJECT ORIENTED MODELLING AND DESIGN
Prerequisites:
 Students who have prior knowledge to the concept of Software Engineering.
 Object oriented language like C++.
Course Objectives
This course will enable students to
 Describe the concepts involved in Object-Oriented modeling and their benefits.

 Demonstrate concept of use-case model, sequence model and state chart model for a given problem
 Explain the facets of the unified process approach to design and build a Software system
 Translate the requirements into implementation for Object Oriented design.
 Choose an appropriate design pattern to facilitate development procedure.
Course Outcomes:
 Describe the concepts of object-oriented and basic class modelling.
 Draw class diagrams, sequence diagrams and interaction diagrams to solve problems.
 Choose and apply a befitting design pattern for the given problem.
UNIT – I
Introduction, Modelling Concepts and Class Modelling: What is Object orientation? What is OO development?
OO Themes; Evidence for usefulness of OO development; OO modelling history. Modelling as Design technique:
Modelling; abstraction; The Three models. Class Modelling: Object and Class Concept; Link and associations
concepts; Generalization and Inheritance; A sample class model; Navigation of class models; Advanced Class
Modelling, Advanced object and class concepts; Association ends; N-ary associations; Aggregation; Abstract
classes; Multiple inheritance; Metadata; Reification; Constraints; Derived Data; Packages.
UNIT – II
UseCase Modelling and Detailed Requirements: Overview; Detailed object oriented Requirements definitions;
System Processes-A use case/Scenario view; Identifying Input and outputs-The System sequence diagram;
Identifying Object Behavior-The state chart Diagram; Integrated Object-oriented Models.
UNIT – III
Process Overview, System Conception and Domain Analysis: Process Overview: 8 Hours Development stages;
Development life Cycle; System Conception: Devising a system concept; elaborating a concept; preparing a
problem statement. Domain Analysis: Overview of analysis; Domain Class model: Domain state model; Domain
interaction model; Iterating the analysis.
UNIT – IV
Use case Realization :The Design Discipline within up iterations: Object 8 Hours Oriented Design-The Bridge
between Requirements and Implementation; Design Classes and Design within Class Diagrams; Interaction
Diagrams-Realizing Use Case and defining methods; Designing with Communication Diagrams; Updating the
Design Class Diagram; Package Diagrams-Structuring the Major Components; Implementation Issues for Three-
Layer Design.
UNIT – V
Design Patterns: Introduction; what is a design pattern?, Describing design 8 Hours patterns, the catalog of design
patterns, Organizing the catalog, How design patterns solve design problems, how to select a design patterns, how to
use a design pattern; Creational patterns: prototype and singleton(only);structural patterns adaptor and proxy(only)
TEXT BOOKS:
1. Michael Blaha, James Rumbaugh: Object Oriented Modelling and Design with UML,2nd Edition,
Pearson Education,2005
2. Satzinger, Jackson and Burd: Object-Oriented Analysis & Design with the Unified Process, Cengage
Learning,2005.
3. Erich Gamma, Richard Helm, Ralph Johnson and john Vlissides: Design Patterns – Elements of Reusable
Object-Oriented Software, Pearson Education,2007.
REFERENCE BOOKS:
1. Grady Booch et.al.: Object-Oriented Analysis and Design with Applications,3rd Edition, Pearson Education,2007.
2. Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michel Stal: Pattern – Oriented Software
Architecture. A system o f Patterns , Volume 1, John Wiley and Sons.2007.
3. Booch, Jacobson, Rambaugh : Object-Oriented Analysis and Design with Applications, 3rd edition, pearson,
Reprint 2013

3 0 0 3
CS734PE: IMAGE PROCESSING
(Professional Elective -III)
Prerequisites
 Students are expected to have knowledge in linear signals and systems, Fourier Transform, basic
linear algebra, basic probability theory and basic programming techniques; knowledge of Digital Signal
Processing is desirable.
 A course on “Computational Mathematics”
 A course on “Computer Oriented Statistical Methods”
Course Objectives
 Provide a theoretical and mathematical foundation of fundamental Digital Image Processing concepts.
 The topics include image acquisition; sampling and quantization; preprocessing; enhancement;
restoration; segmentation; and compression.
Course Outcomes
 Demonstrate the knowledge of the basic concepts of two-dimensional signal acquisition,
sampling, and quantization.
 Demonstrate the knowledge of filtering techniques.
 Demonstrate the knowledge of 2D transformation techniques.
 Demonstrate the knowledge of image enhancement, segmentation, restoration and
compression techniques.
UNIT - I
Digital Image Fundamentals: Digital Image through Scanner, Digital Camera. Concept of Gray Levels. Gray
Level to Binary Image Conversion. Sampling and Quantization. Relationship between Pixels. Imaging Geometry.
2D Transformations-DFT, DCT, KLT and SVD.
UNIT - II
Image Enhancement in Spatial Domain Point Processing, Histogram Processing, Spatial Filtering, Enhancement in
Frequency Domain, Image Smoothing, Image Sharpening.
UNIT - III
Image Restoration Degradation Model, Algebraic Approach to Restoration, Inverse Filtering, Least Mean Square
Filters, Constrained Least Squares Restoration, Interactive Restoration.
UNIT - IV
Image Segmentation Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding, Region
Oriented Segmentation.
UNIT - V
Image Compression Redundancies and their Removal Methods, Fidelity Criteria, Image Compression Models,
Source Encoder and Decoder, Error Free Compression, Lossy Compression.
TEXT BOOKS:
1. Digital Image Processing: R.C. Gonzalez & R. E. Woods, Addison Wesley/ Pearson Education,2nd Ed, 2004.
REFERENCE BOOKS:
1. Fundamentals of Digital Image Processing: A. K. Jain, PHI.
2. Digital Image Processing using MAT LAB: Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins:
Pearson Education India, 2004.
3. Digital Image Processing: William K. Pratt, John Wilely, 3rd Edition, 2004.

3 0 0 3
CS741PE: DISTRIBUTED SYSTEMS

(Professional Elective - IV)
Prerequisites
1. A course on “Operating Systems”
2. A course on “Computer Organization & Architecture”
Course Objectives
 This course provides an insight into Distributed systems.
 Topics include- Peer to Peer Systems, Transactions and Concurrency control, Security and Distributed
shared memory.
Course Outcomes
 Ability to understand Transactions and Concurrency control.
 Ability to understand Security issues.
 Understanding Distributed shared memory.
 Ability to design distributed systems for basic level applications.
UNIT - I
Characterization of Distributed Systems-Introduction, Examples of Distributed systems, Resource sharing and
web, challenges, System models -Introduction, Architectural and Fundamental models, Networking and
Internetworking, Interprocess Communication, Distributed objects and Remote Invocation-Introduction,
Communication between distributed objects, RPC, Events and notifications, Case study-Java RMI.
UNIT - II
Operating System Support- Introduction, OS layer, Protection, Processes and Threads, Communication and
Invocation, Operating system architecture, Distributed File Systems-Introduction, File Service architecture.
UNIT - III
Peer to Peer Systems–Introduction, Napster and its legacy, Peer to Peer middleware, Routing overlays, Overlay
case studies-Pastry, Tapestry, Application case studies-Squirrel, Ocean Store.
Time and Global States-Introduction, Clocks, events and Process states, Synchronizing physical clocks,
logical time and logical clocks, global states, distributed debugging.
Coordination and Agreement-Introduction, Distributed mutual exclusion, Elections, Multicast communication,
consensus and related problems.
UNIT - IV
Transactions and Concurrency Control-Introduction, Transactions, Nested Transactions, Locks, Optimistic
concurrency control, Timestamp ordering. Distributed Transactions-Introduction, Flat and Nested Distributed
Transactions, Atomic commit protocols, Concurrency control in distributed transactions, Distributed
deadlocks, Transaction recovery.
UNIT - V
Replication-Introduction, System model and group communication, Fault tolerant services,
Transactions with replicated data. Distributed shared memory, Design and Implementation issues,
Consistency models.
TEXT BOOKS:
1. Distributed Systems Concepts and Design, G Coulouris, J Dollimore and T Kindberg, FourthEdition, Pearson
Education.
2. Distributed Systems, S.Ghosh, Chapman & Hall/CRC, Taylor & Francis Group, 2010.
REFERENCE BOOKS:
1. Distributed Systems – Principles and Paradigms, A.S. Tanenbaum and M.V. Steen, PearsonEducation.
2. Distributed Computing, Principles, Algorithms and Systems, Ajay D. Kshemakalyani andMukesh Singhal,
Cambridge, rp 2010.

3 0 0 3
CS742PE: SEMANTIC WEB AND SOCIAL NETWORKS

Course Objectives
 To learn Web Intelligence
 To learn Knowledge Representation for the Semantic Web
 To learn Ontology Engineering
 To learn Semantic Web Applications, Services and Technology
 To learn Social Network Analysis and semantic web.
Course Outcomes
 Ability to understand and knowledge representation for the semantic web.
 Ability to create ontology.
 Ability to build a blogs and social networks.
UNIT – I
Thinking and Intelligent Web Applications, The Information Age, The World Wide Web, Limitations of
Today’s Web, The Next Generation Web.
Machine Intelligence, Artificial Intelligence, Ontology, Inference engines, Software Agents,
Berners-Lee www, Semantic Road Map, Logic on the semantic.
UNIT – II
Ontologies and their role in the semantic web, Ontologies Languages for the Semantic Web – Resource
Description Framework(RDF) / RDF Schema, Ontology Web Language(OWL),UML,XML/XML
Schema.
Ontology Engineering, Constructing Ontology, Ontology Development Tools, Ontology Methods, Ontology
Sharing and Merging, Ontology Libraries and Ontology Mapping.
UNIT –III
Logic, Rule and Inference Engines. Semantic Web applications and services, Semantic Search, e- learning,
Semantic Bioinformatics, Knowledge Base.
UNIT – IV
XML Based Web Services, Creating an OWL-S Ontology for Web Services, Semantic Search
Technology, Web Search Agents and Semantic Methods,
What is social Networks analysis, development of the social networks analysis, Electronic Sources for
Network Analysis – Electronic Discussion networks.
UNIT – V
Blogs and Online Communities, Web Based Networks. Building Semantic Web Applications with social
network features.
TEXT BOOKS:
1. Thinking on the Web - Berners Lee, Godel and Turing, Wiley interscience,2008.
2. Social Networks and the Semantic Web, Peter Mika,Springer,2007.
REFERENCE BOOKS:
1. Semantic Web Technologies, Trends and Research in Ontology Based Systems, J.Davies, Rudi
Studer, Paul Warren, John Wiley & Sons.
2. Semantic Web and Semantic Web Services -Liyang Lu Chapman and Hall/CRC Publishers,(Taylor &
Francis Group)
3. Information Sharing on the semantic Web - Heiner Stuckenschmidt; Frank Van Harmelen, Springer
Publications.
4. Programming the Semantic W eb, T.Segaran, C.Evans, J.Taylor,O’Reilly, SPD.

3 0 0 3
CS743PE: SOFTWARE TESTING METHODOLOGIES

Prerequisites
 A course on “Software Engineering”
Course Objectives
 To provide knowledge of the concepts in software testing such as testing process, criteria,
strategies, and methodologies.
 To develop skills in software test automation and management using latest tools.
Course Outcomes
 Design and develop the best test strategies in accordance to the development model.
UNIT - I
Introduction: Purpose of testing, Dichotomies, model for testing, consequences of bugs, taxonomy of
bugs Flow graphs and Path testing: Basics concepts of path testing, predicates, path predicates and
achievable paths, path sensitizing, path instrumentation, application of path testing.
UNIT - II
Transaction Flow Testing: transaction flows, transaction flow testing techniques. Dataflow testing:
Basics of dataflow testing, strategies in dataflow testing, application of dataflow testing. Domain
Testing: domains and paths, Nice & ugly domains, domain
testing, domains and interfaces testing, domain and interface testing, domains and testability.
UNIT - III
Paths, Path products and Regular expressions: path products & path expression, reduction procedure,
applications, regular expressions & flow anomaly detection.
Logic Based Testing: overview, decision tables, path expressions, kv charts, specifications.
UNIT - IV
State, State Graphs and Transition testing: state graphs, good & bad state graphs, state testing,
Testability tips.
UNIT - V
Graph Matrices and Application: Motivational overview, matrix of graph, relations, power of a matrix,
node reduction algorithm, building tools. (Student should be given an exposure to a tool like JMeter or
Win-runner).
TEXT BOOKS:
1. Software Testing techniques - Baris Beizer, Dreamtech, second edition.
2. Software Testing Tools – Dr. K. V. K. K. Prasad, Dreamtech.
REFERENCE BOOKS:
1. The craft of software testing - Brian Marick, Pearson Education.
2. Software Testing Techniques – SPD(Oreille)
3. Software Testing in the Real World – Edward Kit, Pearson.
4. Effective methods of Software Testing, Perry, John Wiley.
5. Art of Software Testing – Meyers, John Wiley.

3 0 0 3
CS744PE: PATTERN RECOGNITION

Prerequisites
 Students are expected to have knowledge basic linear algebra, basic probability
theoryand basic programming techniques;
 A course on “Computational Mathematics”
 A course on “Computer Oriented Statistical Methods”
Course Objectives
 This course introduces fundamental concepts, theories, and algorithms for
patternrecognition and machine learning.
 Topics include: Pattern Representation, Nearest Neighbor Based Classifier, Bayes
Classifier, Hidden Markov Models, Decision Trees, Support Vector Machines,
Clustering,and an application of hand-written digit recognition.
Course Outcomes
 Understand the theory, benefits, inadequacies and possible applications of
variousmachine learning and pattern recognition algorithms
 Identify and employ suitable machine learning techniques in classification,
patternrecognition, clustering and decision problems.
UNIT - I: Introduction: What is Pattern Recognition, Data Sets for Pattern Recognition, Different
Paradigms for Pattern Recognition. Representation: Data Structures for Pattern
Representation,Representation of Clusters, Proximity Measures, Size of Patterns, Abstractions of the Data
Set, Feature Extraction, Feature Selection, Evaluation of Classifier, Evaluation of Clustering.
UNIT - II: Nearest Neighbor Based Classifier: Nearest Neighbor Algorithm, Variants of the NN Algorithm
use of the Nearest Neighbor Algorithm for Transaction Databases, Efficient Algorithms, Data Reduction,
Prototype Selection. Bayes Classifier: Bayes Theorem, Minimum Error Rate Classifier, Estimation of
Probabilities, Comparison with the NNC, Naïve Bayes Classifier, Bayesian Belief Network.
UNIT - III: Hidden Markov Models: Markov Models for Classification, Hidden Morkov Models,
Classification using HMMs. Decision Trees: Introduction, Decision Tree for Pattern Classification,
Construction of Decision Trees, Splitting at the Nodes, Overfitting and Pruning, Examples of Decision Tree
Induction.
UNIT - IV: Support Vector Machines: Introduction, Learning the Linear Discriminant Functions, Neural
Networks, SVM for Classification. Combination of Classifiers: Introduction, Methods for Constructing
Ensembles of Classifiers, Methods for Combining Classifiers.
UNIT - V: Clustering: Why is Clustering Important, Hierarchical Algorithms, Partitional Clustering,

Clustering Large Data Sets. An Application-Hand Written Digit Recognition: Description of the Digit Data,
Preprocessing of Data, Classification Algorithms, Selection of Representative Patterns, Results.
Textbook:
1. Andrew Webb, “Statistical Pattern Recognition”, Arnold publishers, London, 1999.
References:
1. C. M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2006.
2. R. O. Duda, P. E. Hart, D. G. Stork, “Pattern Classification”, John Wiley, 2001.
3. M. Narasimha Murthy, V. Susheela Devi, “Pattern Recognition”, Springer 2011.

3 0 0 3
CS703PC: DATA MINING LAB
(COMMON TO CSE/IT)
Course Objectives:
• To obtain practical experience using data mining techniques on real world data sets.
• Emphasize hands-on experience working with all real data sets.
Course Outcomes:
• Ability to add mining algorithms as a component to the exiting tools
• Ability to apply mining techniques for realistic data.
List of Sample Problems:
Task 1: Credit Risk Assessment

Description:
The business of banks is making loans. Assessing the credit worthiness of an applicant is ofcrucial
importance. You have to develop a system to help a loan officer decide whether the credit of a customer is
good, or bad. A bank's business rules regarding loans must consider two opposing factors. On the one hand,
a bank wants to make as many loans as possible.
Interest on these loans is the banks profit source. On the other hand, a bank cannot afford tomake too many
bad loans. Too many bad loans could lead to the collapse of the bank. The bank's loan policy must involve a
compromise: not too strict, and not too lenient.
To do the assignment, you first and foremost need some knowledge about the world of credit.You can acquire
such knowledge in a number of ways.
• Knowledge Engineering. Find a loan officer who is willing to talk. Interview her andtry to
represent her knowledge in the form of production rules.
• Books. Find some training manuals for loan officers or perhaps a suitable textbook onfinance. Translate
this knowledge from text form to production rule form.
• Common sense. Imagine yourself as a loan officer and make up reasonable ruleswhich can be
used to judge the credit worthiness of a loan applicant.
• Case histories. Find records of actual cases where competent loan officers correctlyjudged when, and
when not to, approve a loan application.
The German Credit Data:

Actual historical credit data is not always easy to come by because of confidentiality rules. Here is one such
dataset, consisting of 1000 actual cases collected in Germany. Credit dataset(original) Excel spreadsheet version
of the German credit data.
In spite of the fact that the data is German, you should probably make use of it for thisassignment. (Unless
you really can consult a real loan officer!)
A few notes on the German dataset
• DM stands for Deutsche Mark, the unit of currency, worth about 90 cents Canadian(but looks and
acts like a quarter).
• owns_telephone. German phone rates are much higher than in Canada so fewerpeople own
telephones.
• foreign_worker. There are millions of these in Germany (many from Turkey). It isvery hard to get
German citizenship if you were not born of German parents.
• There are 20 attributes used in judging a loan applicant. The goal is to classify the applicant
into one of two categories, good or bad.
Subtasks: (Turn in your answers to the following tasks)

• List all the categorical (or nominal) attributes and the real-valued attributes seperately. (5 marks)
• What attributes do you think might be crucial in making the credit assessment? Come up with some simple
rules in plain English using your selected attributes. (5 marks)
• One type of model that you can create is a Decision Tree - train a Decision Tree using the complete dataset
as the training data. Report the model obtained after training. (10 marks)
• Suppose you use your above model trained on the complete dataset, and classify credit good/bad for each
of the examples in the dataset. What % of examples can you classify correctly? (This is also called
testing on the training set) Why do you think you cannot get 100
% training accuracy? (10 marks)
• Is testing on the training set as you did above a good idea? Why or Why not ? (10 marks)
• One approach for solving the problem encountered in the previous question is using cross- validation?
Describe what is cross-validation briefly. Train a Decision Tree again using cross- validation and report
your results. Does your accuracy increase/decrease? Why? (10 marks)
• Check to see if the data shows a bias against "foreign workers" (attribute 20), or "personal- status"
(attribute 9). One way to do this (perhaps rather simple minded) is to remove these attributes from the
dataset and see if the decision tree created in those cases is significantly different from the full dataset
case which you have already done. To remove an attribute, you can use the preprocess tab in Weka's GUI
Explorer. Did removing these attributes have any significant effect? Discuss. (10 marks)
• Another question might be, do you really need to input so many attributes to get good results? Maybe only
a few would do. For example, you could try just having attributes 2, 3, 5, 7, 10, 17 (and 21, the class
attribute (naturally)). Try out some combinations. (You had removed two attributes in problem 7.
Remember to reload the arff data file to get all the attributes initially before you start selecting the ones
you want.) (10 marks)
• Sometimes, the cost of rejecting an applicant who actually has a good credit (case 1) might be higher than
accepting an applicant who has bad credit (case 2). Instead of counting the misclassifcations equally in
both cases, give a higher cost to the first case (say cost 5) and lower cost to the second case. You can do
this by using a cost matrix in Weka. Train your Decision Tree again and report the Decision Tree and
cross- validation results. Are they significantly different from results obtained in problem 6 (using equal
cost)? (10 marks)
• Do you think it is a good idea to prefer simple decision trees instead of having long complex decision
trees? How does the complexity of a Decision Tree relate to the bias of the model? (10 marks)
• You can make your Decision Trees simpler by pruning the nodes. One approach is to use Reduced Error
Pruning - Explain this idea briefly. Try reduced error pruning for training your Decision Trees using
cross-validation (you can do this in Weka) and report the Decision Tree you obtain? Also, report your
accuracy using the pruned model. Does your accuracy increase? (10 marks)
12.(Extra Credit): How can you convert a Decision Trees into "if-then-else rules". Make up your own small
Decision Tree consisting of 2-3 levels and convert it into a set of rules. There also exist different classifiers
that output the model in the form of rules - one such classifier in Weka is rules. PART, train this model and
report the set of rules obtained. Sometimes just one attribute can be good enough in making the decision,
yes, just one ! Can you predict what
attribute that might be in this dataset ? OneR classifier uses a single attribute to make decisions (it chooses the
attribute based on minimum error). Report the rule obtained by training a one R classifier. Rank the
performance of j48, PART and oneR. (10 marks)
Task Resources:
 Mentor lecture on Decision Trees
 Andrew Moore's Data Mining Tutorials (See tutorials on Decision Trees and Cross Validation)
 Decision Trees (Source: Tan, MSU)
 Tom Mitchell's book slides (See slides on Concept Learning and Decision Trees)
Weka resources:
 Introduction to Weka (html version) (download ppt version)
 Download Weka
 Weka Tutorial
 ARFF format
 Using Weka from command line
Task 2: Hospital Management System

Data Warehouse consists Dimension Table and Fact Table.REMEMBER The following
Dimension
The dimension object (Dimension):
_ Name
_ Attributes (Levels) , with one primary key
_ Hierarchies
One time dimension is must.
About Levels and Hierarchies
Dimension objects (dimension) consist of a set of levels and a set of hierarchies defined over those levels. The
levels represent levels of aggregation. Hierarchies describe parent-child relationships among a set of levels.
For example, a typical calendar dimension could contain five levels. Two hierarchies can bedefined on these
levels:
H1: YearL > QuarterL > MonthL > WeekL > DayLH2:
YearL > WeekL > DayL
The hierarchies are described from parent to child, so that Year is the parent of Quarter,Quarter the parent of
Month, and so forth.
About Unique Key Constraints

When you create a definition for a hierarchy, Warehouse Builder creates an identifier key foreach level of the
hierarchy and a unique key constraint on the lowest level (Base Level) Design a Hospital Management system
data warehouse (TARGET) consists of DimensionsPatient, Medicine, Supplier, Time. Where measures are ‘NO
UNITS’, UNIT PRICE. Assume the Relational database (SOURCE) table schemas as follows
TIME (day, month, year),
PATIENT (patient_name, Age, Address, etc.,)
MEDICINE ( Medicine_Brand_name, Drug_name, Supplier, no_units, Uinit_Price, etc.,)SUPPLIER

:( Supplier_name, Medicine_Brand_name, Address, etc., )
If each Dimension has 6 levels, decide the levels and hierarchies, Assume the level namessuitably. Design the
Hospital Management system data warehouse using all schemas. Give theexample 4-D cube with assumption
names.

0 0 3 2
CS704PC: INTERNET OF THINGS LAB (COMMON TO CSE/CSM)
Following are some of the programs that a student should be able to writeand test on
an Raspberry Pi, but not limited to this only.
1 Start Raspberry Pi and try various Linix commands in command terminal window:
ls, cd, touch, mv, rm, man, mkdir, rmdir, tar, gzip, cat, more, less, ps, sudo, cron, chown,chgrp, ping
etc.
• Run some python programs on Pi like:
1. Read your name and print Hello message with name
2. Read two numbers and print their sum, difference, product and division.Word
and character count of a given string
3. Area of a given shape (rectangle, triangle and circle) reading shape and appropriate
valuesfrom standard input
4. Print a name 'n' times, where name and n are read from standard input, using for and
whileloops. Handle Divided by Zero Exception.
5. Print current time for 10 times with an interval of 10 seconds.Read a file line by line and print the
word count of each line.
• Light an LED through Python program
• Get input from two switches and switch on corresponding LEDs
• Flash an LED at a given on time and off time cycle, where the two times are taken from afile.
• Flash an LED based on cron output (acts as an alarm)
• Switch on a relay at a given time using cron, where the relay's contact terminals are
connected to a load.
• Get the status of a bulb at a remote place (on the LAN) through web.
The student should have hands on experience in using various sensors like temperature, humidity,
smoke, light, etc. and should be able to use control web camera, network, and relays connected to the
Pi.
TEXT BOOKS:
1. Pattern Recognition: An Algorithmic Approach: Murty, M. Narasimha, Devi, V.
Susheela, Spinger Pub,1st Ed.
REFERENCE BOOKS:
1. Machine Learning - Mc Graw Hill, Tom M. Mitchell.
2. Fundamentals Of Speech Recognition: Lawrence Rabiner and Biing- Hwang Juang.
Prentice-Hall Pub.


3 0 0 3
CS851PE: BLOCKCHAIN TECHNOLOGY

(Professional Elective - V)
Prerequisites
1. Knowledge in security and applied cryptography;
2. Knowledge in distributed databases
Course Objectives
 To Introduce block chain technology and Cryptocurrency
Course Outcomes
 Learn about research advances related to one of the most popular technological areas today.
UNIT- I
Introduction: Block chain or distributed trust, Protocol, Currency, Cryptocurrency, How a Cryptocurrency works,
Crowdfunding
UNIT- II
Extensibility of Blockchain concepts, Digital Identity verification, Block chain Neutrality, Digital art,
Blockchain Environment
UNIT- III
Blockchain Science: Grid coin, Folding coin, Blockchain Genomics, Bitcoin MOOCs
UNIT- IV
Currency, Token, Tokenizing, Campus coin, Coin drop as a strategy for Public adoption, Currency
Multiplicity, Demurrage currency
UNIT- V
Technical challenges, Business model challenges, Scandals and Public
perception, Government Regulations
Textbooks:
1. Blockchain Blue print for Economy by Melanie Swan
2. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven Goldfeder, Bitcoin
and Cryptocurrency Technologies: A Comprehensive Introduction, Princeton University Press (July
19, 2016).
References:
1. Blockchain Basics: A Non-Technical Introduction in 25 Steps 1st Edition, by DanielDrescher
2.Satoshi Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System

B.Tech. IV Year II -Sem L T P C
3 0 0 3
CS852PE: MOBILE APPLICATION DEVELOPMENT

Prerequisites
1. Acquaintance with JAVA programming
2. A Course on DBMS
Course Objectives
 To demonstrate their understanding of the fundamentals of Android operating systems
 To improves their skills of using Android software development tools
 To demonstrate their ability to develop software with reasonable complexity on mobile
platform
 To demonstrate their ability to deploy software to mobile devices
 To demonstrate their ability to debug programs running on mobile devices
Course Outcomes
 Student understands the working of Android OS Practically.
 Student will be able to develop Android user interfaces
 Student will be able to develop, deploy and maintain the Android Applications.
UNIT - I
Introduction to Android Operating System: Android OS design and Features – Android development
framework, SDK features, Installing and running applications on Android Studio, Creating AVDs,
Typesof Android applications, Best practices in Android programming, Android tools Android
application components – Android Manifest file, Externalizing resources like values, themes,
layouts, Menus etc, Resources for different devices and languages, Runtime Configuration Changes
Android Application Lifecycle – Activities, Activity lifecycle, activity states, monitoring state
changes
UNIT – I I
Android User Interface: Measurements – Device and pixel density independent measuring UNIT - s
Layouts – Linear, Relative, Grid and Table Layouts
User Interface (UI) Components – Editable and non-editable TextViews, Buttons, Radio and Toggle
Buttons, Checkboxes, Spinners, Dialog and pickers
Event Handling – Handling clicks or changes of various UI components
Fragments – Creating fragments, Lifecycle of fragments, Fragment states, Adding fragments to Activity,
adding, removing and replacing fragments with fragment transactions, interfacing between fragments
and Activities, Multi-screen Activities
UNIT - III
Intents and Broadcasts: Intent – Using intents to launch Activities, Explicitly starting new Activity,
ImplicitIntents, Passing data to Intents, Getting results from Activities, Native Actions, using Intent to
dial a number or to send SMS
Broadcast Receivers – Using Intent filters to service implicit Intents, Resolving Intent filters, finding
andusing Intents received within an Activity
Notifications – Creating and Displaying notifications, Displaying Toasts
UNIT - IV
Persistent Storage: Files – Using application specific folders and files, creating files, reading data from
files, listing contents of a directory Shared Preferences – Creating shared preferences, saving and
retrieving data using Shared Preference
UNIT - V
Database – Introduction to SQLite database, creating and opening a database, creating tables, inserting
retrieving and etindelg data, Registering Content Providers, Using content Providers (insert, delete,
retrieve and update)
TEXT BOOKS:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox), 2012
2. Android Application Development for Java Programmers, James C Sheusi, Cengage
Learning,2013
REFERENCE BOOK:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013
3 0 0 3
CS853PE: DESIGN PATTERNS

Prerequisites:
 A Course on Software Engineering”
 A Course on “Object Oriented Programming Through Java”
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 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
 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 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 Multiple Window Systems, User
Operations Spelling Checking and Hyphenation, Summary
UNIT - III
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
UNIT - V
Behavioral Patterns: Chain of Responsibility, Command, Interpreter, Iterator, Mediator, Memento,
Observer, State, Strategy, Template Method, Visitor.
TEXT BOOKS:
1. Design Patterns, Erich Gamma, Pearson Education
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.
3. Java Enterprise Design Patterns Vol-III, Mark Grand, Wiley Dream Tech.
4. Head First Design Patterns, Eric Freeman, O’reily publications
3 0 0 3
CS854PE: VIRTUAL REALITY
Course Objectives:
 This course is designed to give historical and modern overviews and perspectives on virtual reality.
 It describes the fundamentals of sensation, perception, technical and engineering aspects of virtual reality systems.
Course Outcomes:
 Describe how VR systems work and list the applications of VR.
 Understand the design and implementation of the hardware that enables VR systems to be built.
 Understand the system of human vision and its implication on perception and rendering.
 Explain the concepts of motion and tracking in VR systems.
 Describe the importance of interaction and audio in VR systems
UNIT – I
Introduction: The three I’s of virtual reality, commercial VR technology and the five classic components of a VR
system. (1.1, 1.3 and 1.5 of Text Book (1))
UNIT – II
Input Devices: (Trackers, Navigation, and Gesture Interfaces): Three-dimensional position trackers, navigation
and manipulation, interfaces and gesture interfaces. (2.1, 2.2 and 2.3 of Text Book (1)).
Output Devices: Graphics displays, sound displays & haptic feedback. (3.1,3.2 & 3.3 of Text Book (1))
UNIT – III
Modeling: Geometric modeling, kinematics modeling, physical modeling, behaviour modeling, model
management. (5.1, 5.2 and 5.3, 5.4 and 5.5 of Text Book (1)).
UNIT – IV
Human Factors: Methodology and terminology, user performance studies, VR health and safety issues. (7.1, 7.2
and 7.3 of Text Book (1)).
Applications: Medical applications, military applications, robotics applications. (8.1, 8.3 and 9.2 of Text Book (1)).
UNIT – V
VR Programming-I: Introducing Java 3D, loading and manipulating external models, using a lathe to make
shapes. (Chapters 14, 16 and 17 of Text Book (2))
VR Programming-II: 3D Sprites, animated 3D sprites, particle systems. (Chapters 18, 19 and 21 of Text Book
(2))
TEXT BOOKS:
1. Virtual Reality Technology, Second Edition, Gregory C. Burdea & Philippe Coiffet, John Wiley & Sons,
Inc.,
2. Killer Game Programming in Java, Andrew Davison, Oreilly-SPD, 2005.
References:
1. Understanding Virtual Reality, interface, Application and Design, William R.Sherman, Alan
Craig,Elsevier(Morgan Kaufmann).
2. 3D Modeling and surfacing, Bill Fleming, Elsevier(Morgan Kauffman).
3. 3D Game Engine Design, David H.Eberly, Elsevier.
4. Virtual Reality Systems, John Vince, Pearson Education.

3 0 0 3
CS861PE: CYBER FORENSICS AND SECURITY
(Pofessional Elective - VI)
Prerequisites: Network Security

Course Objectives:
 A brief explanation of the objective is to provide digital evidences which are obtained from
digital media.
 In order to understand the objectives of computer forensics, first of all, people have to recognize
the different roles computer plays in a certain crime.
 According to a snippet from the United States Security Service, the functions computer has in
different kinds of crimes.
Course Outcomes:
 Students will understand the usage of computers in forensic, and how to use various forensic
tools for a wide variety of investigations.
 It gives an opportunity to students to continue their zeal in research in computer forensics
UNIT - I
Introduction of Cybercrime: Types, The Internet spawns crime, Worms versus viruses, Computers' roles in
crimes, Introduction to digital forensics, Introduction to Incident - Incident Response Methodology –
Steps - Activities in Initial Response, Phase after detection of an incident
UNIT - II
Initial Response and forensic duplication, Initial Response & Volatile Data Collection from Windows
system -Initial Response & Volatile Data Collection from Unix system – Forensic Duplication: Forensic
duplication: Forensic Duplicates as Admissible Evidence, Forensic Duplication Tool Requirements,
Creating a Forensic. Duplicate/Qualified Forensic Duplicate of a Hard Drive
UNIT - III
Forensics analysis and validation: Determining what data to collect and analyze, validating forensic
data, addressing data-hiding techniques, performing remote acquisitions
Network Forensics: Network forensics overview, performing live acquisitions, developing standard
procedures for network forensics, using network tools, examining the honeynet project.
UNIT - IV
Current Forensic tools: evaluating computer forensic tool needs, computer forensics software tools,
computer forensics hardware tools, validating and testing forensics software E-Mail Investigations:
Exploring the role of e-mail in investigation, exploring the roles of the client and server in e-mail,
investigating e-mail crimes and violations, understanding e-mail servers, using specialized e-mail forensic
tools.
Cell phone and mobile device forensics: Understanding mobile device forensics, understanding
acquisition procedures for cell phones and mobile devices.
UNIT - V
Working with Windows and DOS Systems: understanding file systems, exploring Microsoft File
Structures, Examining NTFS disks, Understanding whole disk encryption, windows registry, Microsoft
startup tasks, MS-DOS startup tasks, virtual machines.
TEXT BOOKS:
1. Kevin Mandia, Chris Prosise, “Incident Response and computer forensics”, Tata McGraw Hill,
2006.
2. Computer Forensics, Computer Crime Investigation by John R. Vacca, Firewall Media, New
Delhi.
3. Computer Forensics and Investigations by Nelson, Phillips Enfinger, Steuart, CENGAGE
Learning
REFERENCE BOOKS:
1. Real Digital Forensics by Keith J. Jones, Richard Bejtiich, Curtis W. Rose, Addison- Wesley
Pearson Education
2. Forensic Compiling, A Tractitioneris Guide by Tony Sammes and Brian Jenkinson, Springer
International edition.

3 0 0 3
CS862PE: ROBOTIC PROCESS AUTOMATION
(Professional Elective - VI)
Course Objectives:
This course will enable students to:
 To understand basic concepts of RPA
 To Describe IIPA, where it can be applied and how it implemented
 To Describe the different types of variables, Control Flow and data manipulation techniques
 To Understand Image, Text and Data Tables Automation
 To Describe various types of Exceptions and strategies to handle
Course outcomes:
The students should be able to:
 To Understand the basic concepts of RPA
 To Describe various components and platforms of RPA
 To Describe the different types of variables, control flow and data manipulation techniques
 To Understand various control techniques and OCR in RPA
 To Describe various types and strategies to handle exception
UNIT-I:
RPA Foundations- What is RPA - Irlavors of RPA- History of RPA- The Benefits of RPA- The downsides of
RPA- RPA Compared to BPO, BPM and BPA - Consumer Willingness for Automation- The Workforce of the
Future- RPA Skills-On-Premise Vs. the Cloud- Web Technology- Programming Languages and Low Code-
OCR-Databases-APls- Al-Cognitive Automation-Agile, Scrum, Kanban and Waterfall0 Devops- Flowcharts.
UNIT-II:
RPA Platforms- Components of RPA- RPA Platforms-About Ui Path- About 0B UiPath - The future of automation
- Record and Play - Downloading and installing UiPath Studio -Learning Ui Path Studio- - Task recorder - Step-by
step examples using the recorder.
UNIT-III:
Sequence, Flowchart, and Control Flow-sequencing the workflow- Activities-Control flow, various types of loops,
and decision making-Step-by step example using Sequence and Flowchart-Step-by-step example using Sequence
and Control flow-Data Manipulation-Variables and Scope Collections- Arguments - Purpose and use-Data table
usage with examples Clipboard management-File operation with step-by-step example-CSV/Excel to data table and
vice versa (with a step-by-step example).
UNIT-IV:
Taking Control of the Controls- Finding and attaching windows- Finding the control- Techniques for waiting for a
control- Act on controls - mouse and keyboard activities- Working with Ui Explorer- Handling events- Revisit
recorder- Screen Scraping- When to use OCR- Types of OCR available- How to use OCR- Avoiding typical
failure points.
UNIT-V:
Exception Handling, Debugging, and Logging- Exception handling- Common exceptions and ways to handle them-
Logging and taking screenshots Debugging techniques- Collecting crash dumps- Error reporting- Future of RPA
TEXT BOOKS:
1. Tom I'aulli, The Robotic Process Automation llandbook:A Guide to Implementing RPA
Systems,2020,lSBN-13 (electronic):978-7-4842-5729-6, Publisher : A press
2. Alok Mani Tripathi, Learning Robotic Process Automation, Publisher: Packt Publishing Release Date:
March 2018 ISBN: 9787788470940
REFERENCE BOOKS:
1. Frank Casale, Rebecca Dilla, Iieidi Jaynes,Lauren Livingston,"lntroduction to Robotic Process
Automation: a Primer", Institute of Robotic Process Automation
2. Richard Murdoch, I{obotic Process Automation: Guide'Io Building Software llobots, Automate
Repetitive Tasks & Become An RPA Consultant
3. Srikanth Merianda, Robotic Process Automation Tools, Process Automation and their benefits:
Understanding RPA and Intelligent Automation
4. https:/fivrvw.rripatl:.r:onr/r'pa/;'ol;otic-pl'occss-ailtt:r'r:irtiou

3 0 0 3
CS863PE: CLOUD COMPUTING
Pre-requisites:
1. A course on “Computer Networks”
2. A course on “Operating Systems”
3. A course on “Distributed Systems”
Course Objectives:
 This course provides an insight into cloud computing
 Topics covered include- distributed system models, different cloud service models, service- oriented
architectures, cloud programming and software environments, resource management.
Course Outcomes:
 Ability to understand various service delivery models of a cloud computing architecture.
 Ability to understand the ways in which the cloud can be programmed and deployed.
 Understanding cloud service providers.
UNIT - I
Computing Paradigms: High-Performance Computing, Parallel Computing, Distributed Computing, Cluster
Computing, Grid Computing, Cloud Computing, Bio computing, Mobile Computing, Quantum Computing,
Optical Computing, Nano computing.
UNIT - II
Cloud Computing Fundamentals: Motivation for Cloud Computing, The Need for Cloud Computing, Defining
Cloud Computing, Definition of Cloud computing, Cloud Computing Is a Service, Cloud Computing Is a
Platform, Principles of Cloud computing, Five Essential Characteristics, Four Cloud Deployment Models
UNIT - III
Cloud Computing Architecture and Management: Cloud architecture, Layer, Anatomy of the Cloud, Network
Connectivity in Cloud Computing, Applications, on the Cloud, Managing the Cloud, Managing the Cloud
Infrastructure Managing the Cloud application, Migrating Application to Cloud, Phases of Cloud Migration
Approaches for Cloud Migration.
UNIT - IV
Cloud Service Models: Infrastructure as a Service, Characteristics of IaaS. Suitability of IaaS, Pros and Cons of
IaaS, Summary of IaaS Providers, Platform as a Service, Characteristics of PaaS, Suitability of PaaS, Pros and
Cons of PaaS, Summary of PaaS Providers, Software as a Service, Characteristics of SaaS, Suitability of SaaS,
Pros and Cons of SaaS, Summary of SaaS Providers, Other Cloud Service Models.
UNIT - V
Cloud Service Providers: EMC, EMC IT, Captiva Cloud Toolkit, Google, Cloud Platform, Cloud Storage,
Google Cloud Connect, Google Cloud Print, Google App Engine, Amazon Web Services, Amazon Elastic
Compute Cloud, Amazon Simple Storage Service, Amazon Simple Queue ,service, Microsoft, Windows Azure,
Microsoft Assessment and Planning Toolkit, SharePoint, IBM, Cloud
Models, IBM Smart Cloud, SAP Labs, SAP HANA Cloud Platform, Virtualization Services Provided by SAP,
Sales force, Sales Cloud, Service Cloud: Knowledge as a Service, Rack space, VMware, Manjra soft, Aneka
Platform
TEXT BOOKS:
1. Essentials of cloud Computing: K. Chandrasekhran, CRC press, 2014
REFERENCE BOOKS:
1. Cloud Computing: Principles and Paradigms by Rajkumar Buyya, James Broberg and Andrzej M.
Goscinski, Wiley, 2011.
2. Distributed and Cloud Computing, Kai Hwang, Geoffery C. Fox, Jack J. Dongarra, Elsevier, 2012.
3. Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance, Tim Mather, Subra
Kumaraswamy, Shahed Latif, O’Reilly, SPD, rp 2011.

3 0 0 3
CS864PE: COMPUTER VISION
Course Objectives:
 To review image processing techniques for computer vision.
 To understand shape and region analysis.
 To understand Hough Transform and its applications to detect lines, circles, ellipses.
 To understand three-dimensional image analysis techniques.
 To understand motion analysis.
 To study some applications of computer vision algorithms.
Course Outcomes: Upon completion of this course, the students should be able to
 Implement fundamental image processing techniques required for computer vision.
 Perform shape analysis.
 Implement boundary tracking techniques.
 Apply chain codes and other region descriptors.
 Apply Hough Transform for line, circle, and ellipse detections.
 Apply 3D vision techniques.
 Implement motion related techniques.
 Develop applications using computer vision techniques.
UNIT - I
Image Processing Foundations: Review of image processing techniques – classical filtering operations –
thresholding techniques – edge detection techniques – corner and interest point detection – mathematical
morphology – texture.
UNIT - II
Shapes and Regions: Binary shape analysis – connectedness – object labeling and counting
– size filtering – distance functions – skeletons and thinning – deformable shape analysis – boundary tracking
procedures – active contours – shape models and shape recognition – centroidal profiles – handling occlusion
–boundary length measures – boundary descriptors – chain codes – Fourier descriptors – region descriptors
– moments.
UNIT - III
Hough Transform: Line detection – Hough Transform (HT) for line detection – foot-of- normal method – line
localization – line fitting – RANSAC for straight line detection – HT based circular object detection– accurate
center location – speed problem – ellipse detection – Case study: Human Iris location– hole detection – generalized
Hough Transform (GHT) – spatial matched filtering – GHT for ellipse detection – object location – GHT for
feature collation.
UNIT - IV
3D Vision and Motion: Methods for 3D vision – projection schemes – shape from shading –
photometric stereo – shape from texture – shape from focus – active range finding – surface
representations – point-based representation – volumetric representations – 3D object recognition – 3D
reconstruction – introduction to motion – triangulation – bundle adjustment
– translational alignment – parametric motion – spline-based motion – optical flow – layered motion.
UNIT - V
Applications: Application: Photo album – Face detection – Face recognition – Eigen faces – Active appearance
and 3D shape models of faces Application: Surveillance – foreground- background separation – particle filters –
Chamfer matching, tracking, and occlusion – combining views from multiple cameras – human gait analysis
Application: In-vehicle vision system: locating roadway – road markings
– identifying road signs – locating pedestrians.
TEXT BOOKS:
1. Simon J. D. Prince, ―Computer Vision: Models, Learning, and Inferenceǁ, Cambridge University
Press, 2012.
2. Mark Nixon and Alberto S. Aquado, ―Feature Extraction & Image Processing for Computer Visionǁ,
Third Edition, Academic Press, 2012.
3. E. R. Davies, ―Computer & Machine Vision, Fourth Edition, Academic Press, 2012.
REFERENCES:
1. D. L. Baggio et al., ―Mastering OpenCV with Practical Computer Vision Projectsǁ,Packt Publishing,
2012.
2. Jan Erik Solem, ―Programming Computer Vision with Python: Tools and algorithms for
analyzing images, O'Reilly Media, 2012.
3. R. Szeliski, ―Computer Vision: Algorithms and Applicationsǁ, Springer 2011.
List of Open Electives to be offered by Department Of Mechanical Engineering

Open Elective-I
1 ME611OE Industrial Robotics
2 ME612OE Non-Conventional Sources of Energy
3 ME613OE Basic Mechanical Engineering
Open Elective-II
1 ME721OE Operations Research
2 ME722OE Total Quality Management
3 ME723OE Measuring Instruments
Open Elective-III
1 ME831OE Principles of Entrepreneurship
2 ME832OE Engineering Materials
3 ME833OE Linear and Non-Linear Optimization Techniques

3 0 0 3
ME611OE: INDUSTRIAL ROBOTICS (Open Elective – I)
Pre-requisites: Basic principles of Kinematics and mechanics

Course Objectives: The goal of the course is to familiarize the students with the concepts and
techniques in robotic engineering, manipulator kinematics, dynamics and control, chose, and incorporate
robotic technology in engineering systems.
 Make the students acquainted with the theoretical aspects of Robotics
 Enable the students to acquire practical experience in the field of Robotics through design projects
and case studies.
 Make the students to understand the importance of robots in various fields of engineering.
 Expose the students to various robots and their operational details.
Course Outcomes: At the end of the course, the student will be able to understand the basic components
of robots. Differentiate types of robots and robot grippers. Model forward and inverse kinematics of robot
manipulators. Analyze forces in links and joints of a robot. Programmed a robot to perform tasks in
industrial applications. Design intelligent robots using sensors.
UNIT – I
Introduction: Automation and Robotics – An over view of Robotics – present and future applications.
Components of the Industrial Robotics: common types of arms. Components, Architecture, number of
degrees of freedom – Requirements and challenges of end effectors, Design of end effectors, Precision of
Movement: Resolution, Accuracy and Repeatability, Speed of Response and Load Carrying Capacity.
UNIT – II
Motion Analysis: Basic Rotation Matrices, Equivalent Axis and Angle, Euler Angles, Composite Rotation
Matrices. Homogeneous transformations as applicable to rotation and translation – problems. Manipulator
Kinematics-H notation-H method of Assignment of frames-H Transformation Matrix, joint coordinates
and world coordinates, Forward and inverse kinematics – problems on Industrial Robotic Manipulators.
UNIT – III
Differential transformation of manipulators, Jacobians – problems. Dynamics: Lagrange – Euler and Newton –
Euler formations – Problems.
Trajectory planning and avoidance of obstacles, path planning, Slew motion, joint interpolated motion
– straight line motion.
UNIT - IV
Robot actuators and Feedback components: Actuators: Pneumatic, Hydraulic actuators, electric &
stepper motors, comparison of Actuators, Feedback components: position sensors – potentiometers,
resolvers, encoders – Velocity sensors, Tactile and Range sensors, Force and Torque sensors – End
Effectors and Tools
UNIT V
Robot Application in Manufacturing: Material Transfer - Material handling, loading and unloading-
Processing - spot and continuous arc welding & spray painting - Assembly and Inspection. Robotic
Programming Methods – Languages: Lead Through Programming, Textual Robotic Languages such as
APT, MCL.
TEXT BOOKS:
1. Industrial Robotics / Groover M P /Mc Graw Hill
2. Introduction to Industrial Robotics / Ramachandran Nagarajan / Pearson
REFERENCE BOOKS:
1. Robot Dynamics and Controls / Spony and Vidyasagar / John Wiley
2. Robot Analysis and control / Asada, Slotine / Wiley Inter-Science
3. Robotics – Fu et al / TMH Publications.

3 0 0 3
ME612OE: NON-CONVENTIONAL SOURCES OF ENERGY (Open Elective – I)
Pre-requisites: None
Course Outcomes: At the end of the course, the student will be able to:
 Identify renewable energy sources and their utilization. Understand the basic concepts of solar radiation
and analyze the working of solar and thermal systems.
 Understand principles of energy conversion from alternate sources including wind, geothermal, ocean,
biomass, biogas and hydrogen.
 Understand the concepts and applications of fuel cells, thermoelectric convertor and MHD
generator.
 Identify methods of energy storage for specific applications
UNIT – I
Principles of Solar Radiation: Role and potential of new and renewable source, the solar energy option,
Environmental impact of solar power - Physics of the sun, the solar constant, extra-terrestrial and terrestrial
solar radiation, Solar radiation on titled surface, Instruments for measuring solar radiation and sun shine, solar
radiation data.
Solar Energy Collection: Flat plate and concentrating collectors, classification of concentrating collectors,
orientation and thermal analysis, advanced collectors.
UNIT - II
Solar Energy Storage and Applications: Different methods, sensible, latent heat and stratified storage, solar
ponds. Solar applications - solar heating/cooling techniques, solar distillation and drying, photovoltaic energy
conversion.
Wind Energy: Sources and potentials, horizontal and vertical axis windmills, performance characteristics,
Betz criteria
UNIT - III
Bio-Mass: Principles of Bio-Conversion, Anaerobic /aerobic digestion, types of Bio-gas digesters, gas yield,
combustion characteristics of biogas, utilization for cooking, I.C. Engine operation, and economic aspects.
UNIT - IV
Geothermal Energy: Resources, types of wells, methods of harnessing the energy, potential in India. Ocean
Energy – OTEC, Principles, utilization, setting of OTEC plants, thermodynamic cycles. Tidal and Wave
energy: Potential and conversion techniques, mini-hydel power plants, their economics.
UNIT –V
Direct Energy Conversion: Need for DEC, Carnot cycle, limitations, Principles of DEC. Thermo- electric
generators, Seebeck, Peltier and Joule Thompson effects, figure of merit, materials, applications, MHD
generators, principles, dissociation and ionization, hall effect, magnetic flux, MHD accelerator, MHD engine,
power generation systems, electron gas dynamic conversion, economic aspects. Fuel cells, principle,
faraday’s laws, thermodynamic aspects, selection of fuels and operating conditions.
TEXT BOOKS:
1. Renewable Energy Resources / Tiwari and Ghosal / Narosa
2. Non- conventional Energy Sources / G.D. Rai/ Khanna Publishers
3. Biological Energy Resources/ Malcolm Fleischer & Chris Lawis/ E&FN Spon.
REFERENCE BOOKS:
1. Renewable Energy Sources / Twidell & Weir
2. Solar Power Engineering / B.S. Magal Frank Kreith & J.F. Kreith
3. Principles of Solar Energy / Frank Krieth & John F Kreider
4. Non-Conventional Energy / Ashok V Desai / Wiley Eastern

5. Non-Conventional Energy Systems / K Mittal / Wheeler

3 0 0 3
ME613OE: BASIC MECHANICAL ENGINEERING (Open Elective – I)
Course Objectives
 To gain an understanding of the basic concepts of various aspects of Mechanical Engineering, fields of
application, their merits, demerits, and limitations and applications.
UNIT - I
Basic Concepts of Thermodynamics and Heat Transfer: Definitions – continuum concept – properties –
point and path functions – systems – processes – thermodynamic equilibrium - laws of thermodynamic- First
law applied to open and closed systems – steady and unsteady flow systems
- Second law – heat engines and heat pumps – efficiency and Coefficient of Performance (COP). Heat
transfer – conduction – general conduction equation in Cartesian coordinates – conduction in composite
walls. Convection – free and forced convection – simple empirical correlations. Radiation – laws – black
body and grey body radiation.
UNIT - II
IC Engines and Air Conditioning: I C engines – classification - construction and working - two and four
stroke engines – S I and C.I. engines – powdered coal as an alternative to diesel fuel.
Air conditioning – air cycles, vapour compression cycle – vapour absorption cycle – psychrometric processes.
Air cooling – methods and simple cooling load calculations. Systems applicable to mining environment.
UNIT - III
Power Transmission: Gears – nomenclature, laws of gearing, types of gears including rack and pinion,
interference, gear trains, calculation of gear ratios, couplings - types, features and applications.
Basic concepts in hydraulic & pneumatic power and devices and their utilisation – simple calculations.
UNIT - IV
Kinematics of Machines: Mechanisms – basics – kinematic concepts and definitions – degree of
freedom, mechanical advantage – transmission angle – description of common mechanisms – quick return
mechanisms, straight line generators, dwell mechanisms, ratchets and escapements – universal joints.
Cams and followers – terminology and definitions, displacement diagrams – uniform velocity, parabolic and
simple harmonic motions.
UNIT - V
Rotodynamic and Vibratory Machines: Fans and compressors – types, construction, working principle,
characteristics and applications. Single stage and multistage air compressors – intercooling. Simple
calculations for output and efficiency.
Vibration – Importance of free and forced vibration. Vibrators and shakers – construction, working principle,
applications and limitations.
Note: HMT Data book to be permitted
TEXT BOOKS:
1. Elements of Mechanical Engineering/ S.N. Lal/ Cengage Learning
2. Theory of Machines and Mechanisms / Shigley J.E., Pennock G.R. and Uicker J. J./ Oxford University
Press, 2003.
REFERENCE BOOKS:
1. Rajput, R.K. Thermal Engineering, 6th Edition, Laxmi Publications, 2007
2. Ballaney, P.L. Thermal Engineering, Khanna Publishers, 24th Edition, 2003

3 0 0 3
ME721OE: OPERATIONS RESEARCH (Open Elective – II)
Prerequisites: None
Course Objectives: Understanding the mathematical importance of development of model in a

particular optimization model for the issue and solving it.
Course Outcome: Understanding the problem, identifying variables & constants, Formulation of
optimization model and applying appropriate optimization technique
UNIT - I
Development-definition-characteristics and phases-Types of models-Operations Research models-
applications.
Allocation: Linear Programming Problem Formulation-Graphical solution- Simplex method-Artificial
variable techniques: Two-phase method, Big-M method.
UNIT - II
Transportation problem - Formulation-Optimal solution, unbalanced transportation problem-
Degeneracy.
Assignment problem- Formulation-Optimal solution, - Variants of Assignment problem- Travelling
salesman problem.
UNIT - III
Sequencing- Introduction-Flow-Shop sequencing- n jobs through two machines – n jobs through three
machines- Job shop sequencing-two jobs through ‘m’ machines
Replacement: Introduction- Replacement of items that deteriorate with time- when money value is
not counted and counted- Replacement of items that fail completely- Group Replacement.
UNIT - IV
Theory of Games: Introduction- Terminology- Solution of games with saddle points and without
saddle points. 2 x 2 games- dominance principle- m x 2 & 2 x n games- Graphical method.
Inventory: Introduction- Single item, Deterministic models- purchase inventory models with one
price break and multiple price breaks- Stochastic models _ Demand may be discrete variable or
continuous variable- single period model and no setup cost.
UNIT - V
Waiting lines: Introduction- Terminology- Single channel- Poisson arrivals and Exponential service
times with infinite population.
Dynamic Programming: Introduction- Terminology, Bellman’s principle of optimality- Applications
of Dynamic programming- shortest path problem- linear programming problem.
TEXT BOOKS:
1. Operations Research/ J. K. Sharma4e./ MacMilan
2. Introduction to OR/ Hillier & Libemann/TMH
REFERENCE BOOKS:
1. Introduction to OR/Taha/PHI
2. Operations Research/NVS Raju/SMS Education/3rd Revised Edition
3. Operations Research /A. M. Natarajan, P.Balasubramaniam, A. Tamilarasi/Pearson Education.
4. Operations Research/ Wagner/ PHI Publications.
5. Operations Research/M.V. Durga Prasad, K.Vijaya Kumar Reddy, J. Suresh Kumar/Cengage
Learning.

3 0 0 3
ME722OE: TOTAL QUALITY MANAGEMENT (Open Elective - II)
UNIT - I
Introduction, The concept of TQM, Quality and Business performance, attitude, and involvement of top
management, communication, culture and management systems.
Management of Process Quality: Definition of quality, Quality Control, a brief history, Product Inspection vs.
Process Control, Statistical Quality Control, Control Charts and Acceptance Sampling.
UNIT - II
Customer Focus and Satisfaction: Process vs. Customer, internal customer conflict, quality focus, Customer
Satisfaction, role of Marketing and Sales, Buyer – Supplier relationships.
Bench Marking: Evolution of Bench Marking, meaning of bench marking, benefits of bench marketing, the
bench marking procedure, pitfalls of bench marketing.
UNIT - III
Organizing for TQM: The systems approach, organizing for quality implementation, making the transition from
a traditional to a TQM organization, Quality Circles, seven Tools of TQM: Stratification, check sheet, Scatter
diagram, lshikawa diagram, paneto diagram, Kepner &Tregoe Methodology.
UNIT - IV
The Cost of Quality: Definition of the Cost of Quality, Quality Costs, Measuring Quality Costs, use of Quality
Cost information, Accounting Systems and Quality Management.
UNIT - V
ISO 9000: Universal Standards of Quality: ISO around the world, The ISO9000 ANSI/ASQC Q- 90. Series
Standards, benefits of ISO 9000 certification, the third party audit, Documentation ISO9000 and services, the
cost of certification implementing the system.
TEXT BOOKS:
1. Total Quality Management / Joel E. Ross/Taylor and Francis Limited
2. Total Quality Management/P. N. Mukherjee/PHI
REFERENCE BOOKS:
1. Beyond TQM / Robert L. Flood.
2. Statistical Quality Control / E. L. Grant.
3. Total Quality Management: A Practical Approach/H. Lal.
4. Quality Management/Kanishka Bedi/Oxford University Press/2011.
5. Total Engineering Quality Management/Sunil Sharma/Macmillan.

3 0 0 3
ME723OE: MEASURING INSTRUMENTS (Open Elective - II)
Course Objectives:
 To provide basic knowledge in transduction principles, sensors and transducer technology and
measurement systems.
 To provide better familiarity with the concepts of Sensors and Measurements.
 To provide the knowledge of various measurement methods of physical parameters like velocity,
acceleration, force, pressure and viscosity.
Course Outcomes: After Completion of the course the student is able to
 Able to identify suitable sensors and transducers for real time applications.
 Able to translate theoretical concepts into working models.
 Able to understand the basic of measuring device and use them in relevant situation.
UNIT - I
Introduction to measurements. Physical measurement. Forms and methods of measurements. Measurement
errors. Statistical analysis of measurement data. Probability of errors. Limiting errors.
Standards. Definition of standard units. International standards. Primary standards. Secondary standards.
Working standards. Voltage standard. Resistance standard. Current standard. Capacitance standard. Time and
frequency standards.
UNIT - II
Passive Sensors
Resistive Sensors: Potentiometers, Strain Gages, Resistive Temperature Detectors (RTDs), Thermistors, Light-
dependent Resistors (LDRs), Resistive Hygrometers, Capacitive Sensors: Variable capacitor, Differential
capacitor, Inductive Sensors: Reluctance variation sensors, Eddy current sensors
UNIT - III
Metrology: Measurement of length – Plainness – Area – Diameter – Roughness – Angle – Comparators – Gauge
Blocks. Optical Methods for length and distance measurements.
Velocity and Acceleration Measurement: Relative velocity – Translational and Rotational velocity
measurements – Revolution counters and Timers - Magnetic and Photoelectric pulse counting stroboscopic
methods. Accelerometers- different types, Gyroscopes-applications.
UNIT - IV
Force and Pressure Measurement: Gyroscopic Force Measurement – Vibrating wire Force transducer. Basics
of Pressure measurement –Manometer types – Force-Balance and Vibrating Cylinder Transducers – High- and
Low-Pressure measurement
UNIT - V
Flow, Density and Viscosity Measurements: Flow Meters- Head type, Area type (Rota meter), electromagnetic
type, Positive displacement type, Density measurements – Strain Gauge load cell method – Buoyancy method.
Units of Viscosity, Two float viscorator –Industrial consistency meter
TEXT BOOKS:
1. Measurement Systems – Applications and Design – by Doeblin E.O., 4/e, McGraw Hill
International, 1990.
2. Principles of Industrial Instrumentation – Patranabis D. TMH. End edition 1997
REFERENCE BOOKS:
1. Sensor Technology Hand Book – Jon Wilson, Newne 2004.
2. Instrument Transducers – An Introduction to their Performance and design – by Herman K.P. Neubrat,
Oxford University Press.

3. Measurement system: Applications and Design – by E.O. Doeblin, McGraw Hill Publications.
4. Electronic Instrumentation by H.S. Kalsi.
B.Tech. IV Year II Sem. L T P C

3 0 0 3
ME831OE: PRINCIPLES OF ENTREPRENEURSHIP (Open Elective – III)
UNIT - I
Introduction to Entrepreneurship: Definition of Entrepreneur Entrepreneurial Traits. Entrepreneur vs Manager,
creating and starting the venture: sources of new ideas, method of generating ideas, creative problem solving –
writing business plan, evaluating business plans. Launching formalities.
UNIT - II
Financing and Managing the new ventures: sources of capital, record keeping, recruitment, motivating and
leading teams, financial controls. Marketing and sales controls. E commerce and Entrepreneurship, internet
advertising – new venture expansion strategies and issues.
UNIT - III
Industrial Financial Support: schemes and functions of directorate of industries, District industries centre (DICs)
Industrial development corporation (IDC), State Financial corporation (SFCs), small scale industries
development corporation (SSIDCs) Khadhi and village industries commission (KVIC) Technical Consultancy
organisation (TCO), Small industries service institute (SISI), national small industries corporation (NSIC), small
industries development bank of india (SIDBI).
UNIT - IV
Production and marketing management: Thrust areas of production management, selection of production
techniques, plant utilisation and maintenance, designing the work place, inventory control, material handling and
quality control. Marketing functions, market segmentation market research and channels of distribution, sales
promotion and product pricing.
UNIT - V
Labour legislation, salient provision of health, safety, and welfare under Indian factories Act, Industrial dispute
act, employees state insurance act, workmen’s compensation act and payment of bonus act .
TEXT BOOKS:
1. Robert Hisrich, & Michael Peters: Entrepreneurship, TMH, 2009.
2. Dollinger: Entrepreneurship, Pearson, 2009.
REFERENCE BOOKS:
1. Vasant Desai, Dynamics of Entrepreneurial Development and Management, Himalaya Publishing
House, 2009.
2. Harvard Business Review on Entrepreneurship, HBR Paper Back.
3. Robert J. Calvin: Entrepreneurial Management, TMH, 2009.
4. Gurmeet Naroola: The entrepreneurial Connection, TMH, 2009.
5. Bolton & Thompson: Entrepreneurs—Talent, Temperament and Techniques, Butterworth
Heinemann, 2009.
6. Agarwal: Indian Economy, Wishwa Prakashan 2009.
7. Dutt & Sundaram: Indian Economy, S. Chand, 2009.
8. B D Singh.: Industrial Relations & Labour Laws, Excel, 2009.
9. Aruna Kaulgud: Entrepreneurship Management by, Vikas publishing house, 2009.
10. Essential of entrepreneurship and small business management by Thomas W. Zimmerer & Norman
M. Searborough, PHI-2009.
11. ND Kapoor: Industrial Law, Sultan Chand & Sons, 2009.

3 0 0 3
ME832OE: ENGINEERING MATERIALS (Open Elective – III)
Course objectives:
 To gain knowledge in applications properties strengthening mechanisms in structural steels and super
alloys and stainless steels
 To develop a fundamental understanding of various electrical and electronic materials
 To highlight the importance of bio materials.
Course Outcomes: At the end of the course, student will be able:

 To select and design components based on their properties and requirements.
 Awareness about the electrical and electronic materials
 Knowledge about bio materials like, titanium and stainless steel based.
UNIT - I
Structural Steels: Introduction, Classification: HSLA steels, Dual phase steels, TRIP steels, Maraging steels, HSS
steels.
UNIT - II
Superalloys: Introduction, Classification, Applications and properties of Ni, Fe, Co based superalloys and their
thermo-mechanical treatments.
UNIT - III
Electrical and Electronic Materials: Introduction, Classification, Applications and properties of Pyro, Piezo,
Ferro-electrics, Extrinsic and Intrinsic semiconductors; super conducting materials.
UNIT - IV
Stainless steels: Ferritic, Martensitic, Austenitic stainless steels.
UNIT - V
Bio materials: Introduction, Property requirements for biomaterials, concept of biocompatibility,
important bio metallic alloys.
TEXT BOOKS:
1. Superalloys-II edited by C.T. SIMS, N.S. Stoloff and W.C. Hagel A Wiley-Inter science publication John Wiley
and sons, New York, 1972.
REFERENCE BOOKS:
1. An Introduction to Materials Science and Engineering, W. D. Callister, John Wiley & Sons (2007).
2. Materials Science and Engineering, V. Raghavan, PHI, 2004.

3 0 0 3
ME833OE: LINEAR AND NON-LINEAR OPTIMIZATION TECHNIQUES (Open Elective - III)
UNIT - I
Linear Programming: Introduction and need for optimization in engineering design, formulating linear
programs, graphical solution of linear programs, special cases of linear programming.
UNIT - II
The Simplex Method: Converting a problem to standard form, the theory of the simplex method, the simplex
algorithm, special situations in the simplex algorithm, obtaining initial feasible solution.
UNIT - III
Duality and Sensitivity Analysis: Sensitivity analysis, shadow prices, dual of a normal linear program,
duality theorems, dual simplex method. Integer Programming: Formulating integer programming problems,
the branch-and-bound algorithm for pure integer programs, the branch-and bound algorithm for mixed integer
programs.
UNIT - IV
Non-linear Programming: Introduction to non-linear programming (NLP), Convex and concave functions,
NLP with one variable, Line search algorithms, Multivariable unconstrained problems, constrained problems,
Lagrange Multiplier, The Karush-Kuhn-Tucker (KKT) conditions, the method of steepest ascent, convex
combination method, penalty function, Quadratic programming,
UNIT - V
Dynamic programming: Evolutionary algorithms: Genetic Algorithm, concepts of multi objective
optimization, Markov Process, Queuing Models.
TEXT BOOKS:
1. S.S. Rao, Engineering Optimization: Theory and Practice, Wiley & Sons, New Jersey, 2009.
REFERENCE BOOKS:
1. F.H. Hiller and G.J. Liberman, Introduction to Operations Research, Tata-McGraw-Hill, 2010.
2. W.L. Winston, Operations Research: Applications and Algorithm, 4th Edition, Cengage Learning, 1994.
3. K. Deb, Optimization for Engineering Design, Prentice Hall, 2013.
4. M.C. Joshi and K. M. Moudgalay, Optimization: Theory and Practice, Narosa, 2004.
List of Open Electives to be offered by Department of Electrical and Communication Engineering

Open Elective-I
1 EC611OE Principles of Electronic Communications

2 EC612OE Micro Processors, Micro controllers and Interfacing
3 EC613OE Digital Image and Video Processing
4 EC614OE Digital Design with Verilog
Open Elective –II
1 EC721OE Principles of Computer Communications and Networks

2 EC722OE Introduction to Embedded Systems
3 EC723OE Fuzzy Logic and Neural Networks
4 EC724OE Electronics Measurements and Instrumentation
Open Elective –III
1 EC831OE Adhoc and Wireless Sensor Networks

2 EC832OE IOT Protocols and Its Applications
3 EC833OE Augmented Reality & Virtual Reality
4 EC834OE Biomedical Instrumentation
B.Tech III Year II Sem. L T P C

3 0 0 3
EC611OE: PRINCIPLES OF ELECTRONIC COMMUNICATIONS
Course Objectives: The objective of this subject is to:

 Introduce the students to modulation and various analog and digital modulation schemes.
 They can have a broad understanding of satellite, optical, cellular, mobile, wireless concepts.
Course Outcomes: By completing this subject, the student can

 Work on various types of modulations.
 Should be able to use these communication modules in implementation.
 Will have a basic understanding of various wireless and cellular, mobile communication systems.
UNIT-I: Introduction: Need for Modulation, Frequency translation, Electromagnetic spectrum, Gain, Attenuation
and decibels.
UNIT-II: Simple description on Modulation: Analog Modulation-AM, FM, Pulse Modulation-PAM, PWM, PCM,
Digital Modulation Techniques-ASK, FSK, PSK, QPSK modulation and demodulation schemes.
UNIT-III: Satellite Communication: Satellite Orbits, satellite communication systems, satellite subsystems, Ground
Stations Satellite Applications, Global Positioning systems.
UNIT-IV: Optical Communication: Optical Principles, Optical Communication Systems, Fiber –Optic Cables,
Optical Fiber Wave Guides- Introduction, Ray Theory Transmission, Total Internal Reflection, Acceptance Angle,
Numerical Aperture, Skew Rays. Optical Transmitters & Receivers, Wavelength Division Multiplexing.
UNIT-V: Cellular and Mobile Communications: Cellular telephone systems, AMPS, GSM, CDMA, and
WCDMA. Wireless Technologies: Wireless LAN, PANs and Bluetooth, Zig Bee and Mesh Wireless networks,
Wimax and MANs, Infrared wireless, RFID communication, UWB.
TEXT BOOKS:
 Principles of Electronic Communication Systems, Louis E. Frenzel, 3e, McGraw Hill publications, 2008.
 Electronic Communications systems, Kennedy, Davis 4e, MC GRAW HILL EDUCATION, 1999.
REFERENCE BOOKS:
 Theodore Rapp port, Wireless Communications – Principles and practice, Prentice Hall, 2002.
 Roger L. Freeman, Fundamentals of Telecommunications, 2e, Wiley publications.
 Introduction to data communications and networking, Wayne Tomasi, Pearson Education, 2005.

3 0 0 3
EC612OE: MICROPROCESSORS, MICROCONTROLLERS AND INTERFACING

(Open Elective-I)
Prerequisites: Digital System Design, Computer Organization and Architecture

Course Objectives: The objectives of the course are to:
1. Familiarize the architecture of microprocessors and micro controllers
2. Develop an in-depth understanding of Instruction set and assembly language programming
3. Provide the knowledge about interfacing techniques of bus & memory
4. Understand the concepts of ARM architecture
Course Outcomes: Upon completing this course, the student will be able to
1. Understands the internal architecture, organization and assembly language programming of 8086
processors.
2. Understands the internal architecture, organization and assembly language programming of
8051/controllers
3. Understands the interfacing techniques to 8051 based systems
4. Understands the internal architecture of ARM processors and its basic concepts
UNIT -I:
8086 Architecture: 8086 Architecture-Functional diagram, Register Organization, Memory Segmentation,
Programming Model, Memory addresses, Physical Memory Organization, Architecture of 8086, Signal
descriptions of 8086, interrupts of 8086.
UNIT -II:
Instruction Set and Assembly Language Programming of 8086: Instruction formats, Addressing modes,
Instruction Set, Assembler Directives, Macros, and Simple Programs involving Logical, Branch and Call
Instructions, Sorting, String Manipulations.
UNIT -III:
Introduction to Microcontrollers: Overview of 8051 Microcontroller, Architecture, I/O Ports, Memory
Organization, Addressing Modes and Instruction set of 8051.
8051 Real Time Control: Programming Timer Interrupts, Programming External Hardware Interrupts,
Programming the Serial Communication Interrupts, Programming 8051 Timers and Counters
UNIT –IV:
I/O And Memory Interface: LCD, Keyboard, External Memory RAM, ROM Interface, ADC, DAC
Interface to 8051.
Serial Communication and Bus Interface: Serial Communication Standards, Serial Data Transfer
Scheme, On board Communication Interfaces-I2C Bus, SPI Bus, UART; External Communication
Interfaces-RS232,USB.
UNIT –V:
ARM Architecture: ARM Processor fundamentals, ARM Architecture – Register, CPSR, Pipeline,
exceptions and interrupts interrupt vector table, ARM instruction set – Data processing, Branch
instructions, load store instructions, Software interrupt instructions, Program status register instructions,
loading constants, Conditional execution, Introduction to Thumb instructions.
TEXT BOOKS:
1. Advanced Microprocessors and Peripherals – A. K. Ray and K. M. Bhurchandani, TMH, 2nd Edition
2006.
2. ARM System Developers guide, Andrew N SLOSS, Dominic SYMES, Chris WRIGHT, Elsevier, 2012
REFERENCE BOOKS:
1. The 8051 Microcontroller, Kenneth. J. Ayala, Cengage Learning, 3rd Ed, 2004.
2. Microprocessors and Interfacing, D. V. Hall, TMGH, 2nd Edition 2006.
3. The 8051 Microcontrollers, Architecture and Programming and Applications -K. Uma Rao, Andhe
Pallavi, Pearson, 2009.
4. Digital Signal Processing and Applications with the OMAP- L138 Experimenter, Donald Reay,
WILEY 2012.

3 0 0 3
EC512PE/EC613OE: DIGITAL IMAGE AND VIDEO PROCESSING
(Professional Elective-I/ Open Elective-I)
Prerequisite: Digital Signal Processing

1. To study the image fundamentals and mathematical transforms necessary for image Processing.
2. To expertise about the image enhancement and restoration techniques
3. To learn image segmentation and image compression procedures.
4. To know the basics of video processing
5. To understand the various motion techniques in video processing
1. Defining the digital image, representation of digital image, the advantages of representation of digital
images in transform domain.
2. Know how an image can be enhanced by using histogram techniques, filtering techniques etc and
understand the concept of image degradation
3. Explore the importance and applications of image segmentation and image compression
4. Understand the 3D representation of video and filters used for the removal of noises in video
5. Implement the various coding techniques used for motion estimation in video
UNIT - I
Fundamentals of Image Processing and Image Transforms:
Introduction, Image sampling, Quantization, Resolution, Image file formats, Elements of image processing
system, Applications of Digital image processing. Introduction, Need for transform, image transforms,
Fourier transform, 2 D Discrete Fourier transform and its transforms, Importance of phase, Walsh
transform, Hadamard transform, Haar transform, slant transform Discrete cosine transform, KL
transform, singular value decomposition, Radon transform, comparison of different image transforms.
UNIT - II
Image Enhancement:
Spatial domain methods: Histogram processing, Fundamentals of Spatial filtering, Smoothingspatial filters,
Sharpening spatial filters. Frequency domain methods: Basics of filtering in frequency domain, image
smoothing, image sharpening, Selective filtering.
Image Restoration:
Introduction to Image restoration, Image degradation, Types of image blur, Classification of image
restoration techniques, Image restoration model, Linear and Nonlinear image restoration techniques, Blind
deconvolution.
UNIT - III
Image Segmentation:Introduction to image segmentation, Point, Line and Edge Detection, Region based
segmentation., Classification of segmentation techniques, Region approach to image segmentation,
clustering techniques, Image segmentation based on thresholding, Edge based segmentation, Edge detection
and linking, Hough transform, Active contour
Image Compression:Introduction, Need for image compression, Redundancy in images, Classification of
redundancy
in images, image compression scheme, Classification of image compression schemes, Fundamentals of
information theory, Run length coding, Shannon – Fano coding, Huffman coding, Arithmetic coding,
Predictive coding, Transformed based compression, Image compression standard, Wavelet-based image
compression, JPEG Standards.
UNIT - IV
Basic Steps of Video Processing:Analog Video, Digital Video. Time-Varying Image Formation models:
Three-Dimensional Motion Models, Geometric Image Formation, Photometric Image Formation, Sampling
of Video signals, Filtering operations.
UNIT - V
2-D Motion Estimation:Optical flow, General Methodologies, Pixel Based Motion Estimation, Block-
Matching Algorithm, Mesh based Motion Estimation, Global Motion Estimation, Region based Motion
Estimation, Multi resolution motion estimation, Waveform based coding, Block based transform coding,
Predictive coding, Application of motion estimation in Video coding.
TEXT BOOKS:
1. Digital Image Processing – Gonzaleze and Woods, 3rdEd., Pearson.
2. Video Processing and Communication – Yao Wang, JoemOstermann and Ya–quin Zhang.
1st Ed., PH Int.
3. S.Jayaraman, S.Esakkirajan and T.VeeraKumar, “Digital Image processing, TataMcGraw Hill publishers, 2009
REFRENCE BOOKS:
1. Digital Image Processing and Analysis-Human and Computer Vision Application with CVIP Tools – Scotte
Umbaugh, 2nd Ed, CRC Press, 2011.
2. Digital Video Processing – M. Tekalp, Prentice Hall International.
3. Digital Image Processing – S.Jayaraman, S.Esakkirajan, T.Veera Kumar – TMH, 2009.
4. Multidimentional Signal, Image and Video Processing and Coding – John Woods, 2ndEd, Elsevier.
5. Digital Image Processing with MATLAB and Labview – Vipula Singh, Elsevier. 6.Video Demystified – A
Hand Book for the Digital Engineer – Keith Jack, 5tEd., Elsevier

3 0 0 3
EC614OE: DIGITAL DESIGN WITH VERILOG
(Open Elective-I)
Prerequisite: Switching Theory & Logic Design

1. Give exposure to Verilog HDL.
2. Explain the Gate level and Data flow level modeling.
3. Digital circuits using Behavioral modeling using Verilog HDL.
4. Understand Switch level modeling and Explain system tasks, Functions & Compiler directives.
5. Design Sequential circuits and to verify the circuits that are testable, reusable and synthesizable.
1. Design digital circuits and describe verilog hardware description language(HDL).
2. Understand Gate level and Dataflow level modeling.
3. Analyze behavioral Modeling of digital circuits.
4. Design Switch level Modeling and system Tasks, Functions, and Complier Directives.
5. Design sequential circuit using verilog HDL and understand testing and verification.
UNIT - I: Introduction to VerilLog HDL: Verilog as HDL, Levels of Design Description, Concurrency,
Simulation and Synthesis, Function Verification, System Tasks, Programming Language Interface, Module,
Simulation and Synthesis Tools
Language Constructs and Conventions: Introduction, Keywords, Identifiers, White Space, Characters,
Comments, Numbers, Strings, Logic Values, Strengths, Data Types, Scalars and Vectors, Parameters, Operators.
UNIT - II: Gate Level Modeling: Introduction, AND Gate Primitive, Module Structure, Other Gate Primitives,
Illustrative Examples, Tristate Gates, Array of Instances of Primitives, Design of Flip-Flops with Gate Primitives,
Delay, Strengths and Construction Resolution, Net Types, Design of Basic Circuit.
Modeling at Dataflow Level: Introduction, Continuous Assignment Structure, Delays and Continuous
Assignments, Assignment to Vector, Operators.
UNIT - III: Behavioural Modeling: Introduction, Operations and Assignments, Functional Bifuracation, 'Intial'
Construct, Assignments with Delays, 'Wait' Construct, Multiple Always Block, Behavioural Level, Blocking and
Non-Blocking Assignments, The 'Case' Statement, Simulation Flow, 'If' an 'if-Else' Constructs, 'Assign- De-
Assign' Constructs, 'Repeat' Construct, for loop, 'The Disable' Construct, 'While Loop', Forever Loop, Parallel
Blocks, Force-Release, Construct, Event.
UNIT - IV: Switch Level Modeling: Basic Transistor Switches, CMOS Switches, BiDirectional Gates, Time
Delays with Switch Primitives, Instantiation with 'Strengths' and 'Delays' Strength Contention with Trireg Nets.
System Tasks, Functions and Compiler Directives: Parameters, Path Delays, Module Parameters. System Tasks
and Functions, File Based Tasks and Functions, Computer Directives, Hierarchical Access, User Defined
Primitives.
UNIT - V: Sequential Circuit Desription: Sequential Models - Feedback Model, Capacitive Model, Implicit
Model, Basic Memory Components, Functional Register, Static Machine Coding, Sequential Synthesis.
Components Test and Verification: Test Bench - Combinational Circuits Testing, Sequential Circuit Testing,
Test Bench Techiniques, Design Verification, Assertion Verification.
TEXT BOOKS:
1. T.R. Padmanabhan, B Bala Tripura Sundari, Design Through Verilog HDL, Wiley 2009.
2. Zainalabdien Navabi, Verliog Digital System Design,TMH, 2nd Edition.
REFERENCE BOOKS:
1. Fundamentals ofDigital Logic with Verilog Design - Stephen Brown,Zvonkoc Vranesic, TMH, 2nd Edition.
2. Advanced Digital Logic Design using Verilog, State Machines & Synthesis for FPGA - Sunggu Lee, Cengage
Learning, 2012.
3. Verilog HDL - Samir Palnitkar, 2nd Edition, Pearson Education, 2009.
4. Advanced Digital Design with Verilog HDL - Michel D. Ciletti, PHI,2009.
B.Tech IV Year I Sem. L T P C

3 0 0 3
EC721OE: PRINCIPLES OF COMPUTER COMMUNICATIONS AND NETWORKS
(Open Elective - II)
Course Objectives:
1. To understand the concept of computer communication.
2. To learn about the networking concept, layered protocols.
3. To understand various communications concepts.
4. To get the knowledge of various networking equipment.
Course Outcomes:
1. The student can get the knowledge of networking of computers, data transmission between computers.
2. Will have the exposure about the various communication concepts.
3. Will get awareness about the structure and equipment of computer network structures.
UNIT - I
Overview of Computer Communications and Networking: Introduction to Computer Communications and
Networking, Introduction to Computer Network, Types of Computer Networks, Network Addressing, Routing,
Reliability, Interoperability and Security, Network Standards, The Telephone System and Data Communications.
UNIT - II
Essential Terms and Concepts: Computer Applications and application protocols, Computer Communications
and Networking models, Communication Service Methods and data transmission modes, analog and Digital
Communications , Speed and capacity of a Communication Channel, Multiplexing and switching, Network
architecture and the OSI reference model.
UNIT - III
Analog and Digital Communication Concepts: Representing data as analog signals, representing data as digital
signals, data rate and bandwidth reduction, Digital Carrier Systems.
UNIT - IV
Physical and data link layer Concepts: The Physical and Electrical Characteristics of wire, Copper media, fiber
optic media, wireless Communications. Introduction to data link Layer , the logical link control and medium
access control sub-layers.
UNIT - V
Network Hardware Components: Introduction to Connectors, Transreceivers and media convertors, repeaters,
network interference cards and PC cards, bridges, switches, switches Vs Routers.
TEXT BOOKS:
1. Computer Communications and Networking Technologies, Michel A. Gallo and William H. Hancock,
Thomson Brooks / Cole.
2. Data Communications and Networking – Behrouz A. Forouzan, Fourth Edition MC GRAW HILL
EDUCATION, 2006.
REFERENCE BOOKS:
1. Principles of Computer Networks and Communications, M. Barry Dumas, Morris Schwartz, Pearson.
2. Computer Networking: A Top-Down Approach Featuring the Internet, James F. Kurose, K. W. Ross, 3rd
Edition, Pearson Education.

3 0 0 3
EC722OE: Introduction to Embedded Systems
(Open Elective-II)
Prerequisite: This subject recommends prior knowledge of basic concepts of microcontrollers and also
microprocessor and also embedded fundamentals.

 To provide an overview of Design Principles of Embedded System.
 To provide clear understanding about the role of firmware, operating systems in correlation with hardware
systems
 Expected to understand the selection procedure of processors in the embedded domain.
 Design procedure of embedded firm ware.
 Expected to visualize the role of real time operating systems in embedded systems.
 Expected to evaluate the correlation between task synchronization and latency issues.
UNIT 1
Introduction to embedded systems: definition of embedded system, embedded systems Vs general computing
systems, history of embedded systems, classification, major application areas, Purpose of embedded systems,
characteristics and quality attributes of embedded systems.
UNIT 2
The Typical Embedded System: Core of the Embedded System, Memory, Sensors and Actuators, Communication
Interface, Embedded Firmware, Other System components.
UNIT 3
Embedded Firmware Design and Development: Embedded Firmware Design, Embedded
Firmware Development Languages, Programming in Embedded C.
UNIT 4
RTOS Based Embedded System Design: Operating System basics, Types of Operating Systems, Tasks, Process,
Threads, Multiprocessing and Multi-tasking, Task Scheduling, Threads-Processes-Scheduling putting them together,
Task Communication, Task Synchronization, Device Drivers, How to choose an RTOS.
UNIT 5
Integration and Testing of Embedded Hardware and Firmware: Integration of Hardware and Firmware, Boards
Bring up. The Embedded System Development Environment: The Integrated Development Environment (IDE), Types
of files generated on Cross-Compilation, Disassembler/Decompiler, Simulators, Emulators and Debugging, Target
Hardware Debugging, Boundary Scan.
TEXT BOOKS:
1. Introduction to Embedded Systems - Shibu K.V, Mc Graw Hill.
REFERENCE BOOKS:
1. Embedded Systems - Raj Kamal, MC GRAW HILL EDUCATION.
2. Embedded System Design - Frank Vahid, Tony Givargis, John Wiley.
3. Embedded Systems – Lyla, Pearson, 2013.

4. An Embedded Software Primer - David E. Simon, Pearson Education.

3 0 0 3
EC724OE: ELECTRONIC MEASUREMNTS AND INSTURMENTATION
(Professional Elective-IV & Open Elective-II)
Prerequisite: Basic Electrical and Electronics Engineering
Course Objectives: The objectives of the course are to

 It provides an understanding of various measuring system functioning and metrics for performance analysis.
 Provides understanding of principle of operation, working of different electronic instruments viz. signal
generators, signal analyzers, recorders and measuring equipment.
 Understanding the concepts of various measuring bridges and their balancing conditions.
 Provides understanding of use of various measuring techniques for measurement of different physical
parameters using different classes of transducers.
1. Describe the basic electrical parameters with different meters and understand the basic definition of
measuring parameters.
2. Discuss the various types of signal generators, signal analyzers for generating and analyzing various real-time
signals.
3. Describe the types of Oscilloscope to measure various signals.
4. Discuss the various physical parameters by appropriately selecting the transducers.
5. Describe the different types of bridge circuits used to measure the physical parameters.
UNIT – I
Block Schematics of Measuring Systems: Performance Characteristics, Static Characteristics, Accuracy,
Precision, Resolution, Types of Errors, Gaussian Error, Root Sum Squares formula, Dynamic Characteristics,
Repeatability, Reproducibility, Fidelity, Lag; Measuring Instruments: DC Voltmeters, D’ Arsonval Movement, DC
Current Meters, AC Voltmeters and Current Meters, Ohmmeters, Multimeters, Meter Protection, Extension of
Range, True RMS Responding Voltmeters, Specifications of Instruments.
UNIT - II
Signal Analyzers: AF, HF Wave Analyzers, Harmonic Distortion, Heterodyne wave Analyzers, Spectrum
Analyzers, Power Analyzers, Capacitance-Voltage Meters, Oscillators. Signal Generators: AF, RF Signal
Generators, Sweep Frequency Generators, Pulse and Square wave Generators, Function Generators, Arbitrary
Waveform Generator, Video Signal Generators, and Specifications
UNIT – III
Oscilloscopes: CRT, Block Schematic of CRO, Time Base Circuits, Lissajous Figures, CRO Probes, High
Frequency CRO Considerations, Delay lines, Applications: Measurement of Time, Period and Frequency
Specifications.
Special Purpose Oscilloscopes: Dual Trace, Dual Beam CROs, Sampling Oscilloscopes, Storage Oscilloscopes,
Digital Storage CROs
UNIT - IV
Transducers: Classification, Strain Gauges, Bounded, unbounded; Force and Displacement Transducers,
Resistance Thermometers, Hotwire Anemometers, LVDT, Thermocouples, Synchros, Special Resistance
Thermometers, Digital Temperature sensing system, Piezoelectric Transducers, Variable Capacitance Transducers,
Magneto Strictive Transducers, gyroscopes, accelerometers.
UNIT - V
Bridges: Wheat Stone Bridge, Kelvin Bridge, and Maxwell Bridge.
Measurement of Physical Parameters: Flow Measurement, Displacement Meters, Liquid level Measurement,
Measurement of Humidity and Moisture, Velocity, Force, Pressure – High Pressure, Vacuum level, Temperature -
Measurements, Data Acquisition Systems.
TEXT BOOKS:
1. Modern Electronic Instrumentation and Measurement Techniques: A.D. Helbincs, W. D. Cooper: PHI 5 th
Edition 2003.
2. Electronic Instrumentation: H. S. Kalsi – TMH, 2nd Edition 2004.
REFERENCE BOOKS:
1. Electrical and Electronic Measurement and Measuring Instruments – A K Sawhney, Dhanpat Rai & Sons,
2013.
2. Electronic Instrumentation and Measurements – David A. Bell, Oxford Univ. Press, 1997.
3. Industrial Instrumentation: T.R. Padmanabham Springer 2009.
4. Electronic Measurements and Instrumentation – K. Lal Kishore, Pearson Education 2010.
B.Tech IV Year II Sem. L T P C

3 0 0 3
EC831OE AD-HOC AND WIRELESS SENSOR NETWORKS

(Open Elective – III)
Prerequisite: Wireless Sensor Networks
Course Objectives:
The objectives of this course are to make the student
1. To study the fundamentals of wireless Ad-Hoc Networks.
2. To study the operation and performance of various Adhoc wireless network protocols.
3. To study the architecture and protocols of Wireless sensor networks.
Course Outcomes:
On completion of this course student will be able to
1. Students will be able to understand the basis of Ad-hoc wireless networks.
2. Students will be able to understand design, operation and the performance of MAC layer protocols of Adhoc
wireless networks.
3. Students will be able to understand design, operation and the performance of routing protocol of Adhoc
wireless network.
4. Students will be able to understand design, operation and the performance of transport layer protocol of
Adhoc wireless networks.
5. Students will be able to understand sensor network Architecture and will be able to distinguish between
protocols used in Adhoc wireless network and wireless sensor networks.
UNIT - I
Wireless LANs and PANs: Introduction, Fundamentals of WLANS, IEEE 802.11 Standards, HIPERLAN
Standard, Bluetooth, Home RF.
AD HOC WIRELESS NETWORKS: Introduction, Issues in Ad Hoc Wireless Networks.
UNIT - II
MAC Protocols: Introduction, Issues in Designing a MAC protocol for Ad Hoc Wireless Networks, Design
goals of a MAC Protocol for Ad Hoc Wireless Networks, Classifications of MAC Protocols, Contention - Based
Protocols, Contention - Based Protocols with reservation Mechanisms, Contention – Based MAC Protocols with
Scheduling Mechanisms, MAC Protocols that use Directional Antennas, Other MAC Protocols.
UNIT - III
Routing Protocols: Introduction, Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks,
Classification of Routing Protocols, Table –Driven Routing Protocols, On – Demand Routing Protocols, Hybrid
Routing Protocols, Routing Protocols with Efficient Flooding Mechanisms, Hierarchical Routing Protocols,
Power – Aware Routing Protocols.
UNIT – IV
Transport Layer Protocols: Introduction, Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless
Networks, Design Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks, Classification of
Transport Layer Solutions, TCP Over Ad Hoc Wireless Networks, Other Transport Layer Protocol for Ad Hoc
Wireless Networks.
UNIT – V
Wireless Sensor Networks: Introduction, Sensor Network Architecture, Data Dissemination, Data Gathering,
MAC Protocols for Sensor Networks, Location Discovery, Quality of a Sensor Network, Evolving Standards,
Other Issues.
TEXT BOOKS:
1. Ad Hoc Wireless Networks: Architectures and Protocols - C. Siva Ram Murthy and B.S.Manoj, 2004, PHI.
2. Wireless Ad- hoc and Sensor Networks: Protocols, Performance and Control - Jagannathan Sarangapani,
CRC Press.
REFERENCES:
1. Ad- Hoc Mobile Wireless Networks: Protocols & Systems, C.K. Toh , 1st Ed. Pearson Education.
2. Wireless Sensor Networks - C. S. Raghavendra, Krishna M. Sivalingam, 2004, Springer

3 0 0 3
EC832OE: IOT PROTOCOLS AND ITS APPLICATIONS
(Open Elective-III)
Prerequisite: Embedded System Design; Internet of Things

1. To introduce the terminology, technology and its applications
2. To introduce the concept of M2M (machine to machine) with necessary protocols
3. To introduce the Python Scripting Language which is used in many IoT devices
4. To introduce the Raspberry PI platform, that is widely used in IoT applications
5. To introduce the implementation of web based services on IoT devices
1. Understand the concept of IOT and M2M
2. Study IOT architecture and applications in various fields
3. Study the security and privacy issues in IOT.
UNIT-I
IoT& Web Technology The Internet of Things Today, Time for Convergence, Towards the IoT Universe, Internet
of Things Vision, IoT Strategic Research and Innovation Directions, IoT Applications, Future Internet
Technologies, Infrastructure, Networks and Communication, Processes, Data Management, Security, Privacy &
Trust, Device Level Energy Issues, IoT Related Standardization, Recommendations on Research Topics.
UNIT-II
M2M to IoT – A Basic Perspective– Introduction, Some Definitions, M2M Value Chains, IoT Value Chains, An
emerging industrial structure for IoT, The international driven global value
chain and global information monopolies. M2M to IoT-An Architectural Overview– Building an architecture, Main
design principles and needed capabilities, An IoT architecture outline, standards considerations.
UNIT-III
IoT Architecture -State of the Art – Introduction, State of the art, Architecture Reference Model- Introduction,
Reference Model and architecture, IoT reference Model, IoT Reference Architecture- Introduction, Functional
View, Information View, Deployment and Operational View, Other Relevant architectural views.
UNIT-IV
IoT Applications for Value Creations Introduction, IoT applications for industry: Future Factory Concepts,
Brownfield IoT, Smart Objects, Smart Applications, Four Aspects in your Business to Master IoT, Value Creation
from Big Data and Serialization, IoT for Retailing Industry, IoT For Oil and Gas Industry, Opinions on IoT
Application and Value for Industry, Home Management, eHealth.
UNIT-V
Internet of Things Privacy, Security and Governance Introduction, Overview of Governance, Privacy and Security
Issues,
TEXTBOOKS
1. Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-on-Approach)”, 1st Edition, VPT, 2014.
2. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to Connecting Everything”, 1 st
Edition, Apress Publications, 2013.
3. Cuno Pfister, “Getting Started with the Internet of Things”, O Reilly Media, 2011.

3 0 0 3
EC833OE: AUGMENTED REALITY & VIRTUAL REALITY
(Open Elective-III)
Prerequisite: NIL
Course Objective:
The objective of the course is to establish and cultivate a broad and comprehensive understanding of this
rapidly evolving and commercially viable field of Computer Science. The technology of VR and AR is really
hitting the ground right now. With these methods, the businesses are trying to get their brands to a whole new
level of success and popularity. Integrating AR/VR in development can provide many advantages like:
Improved Experience for Learning in sectors like education, Increasing Efficiency In Business, Unmatchable
Virtual Experience, Increase In User Engagement, Boost In Brand Loyalty, Mobility, Better Advertising of
products and many more.
Course Outcomes: After completion of this course, student will be able to:
● To understand fundamental computer vision, computer graphics and human-computer interaction
techniques related to VR/AR.
● To understand geometric modeling and Virtual environment.
● To relate and differentiate VR/AR technology.
● To use various types of Hardware and software in virtual Reality systems .
● To implement Virtual/Augmented Reality applications.
UNIT – I
Introduction to Virtual Reality:
Virtual Reality and Virtual Environment: Introduction, Computer graphics, Real time computer graphics,
Flight Simulation, Virtual environment requirement, benefits of virtual reality, Historical development of VR,
Scientific Landmark.
UNIT - II
Computer Graphics And Geometric Modeling:
Introduction, The Virtual world space, positioning the virtual observer, the perspective projection, human
vision, stereo perspective projection, Colour theory, Conversion From 2D to 3D, 3D space curves, 3D
boundary representation, Simple 3D modeling, 3D clipping, Illumination models, Reflection models, Shading
algorithms.
Geometrical Transformations: Introduction, Frames of reference, Modeling transformations, Instances,
Picking, Flying, Scaling the VE, Collision detection.
UNIT – III
Virtual Environment:
Input: Tracker, Sensor, Digital Gloves, Movement Capture, Video-based Input, 3D Menus & 3D Scanner etc.
Output: Visual /Auditory / Haptic Devices.
Generic VR system: Introduction, Virtual environment, Computer environment, VR technology, Model of

interaction, VR Systems. Animating the Virtual Environment: Introduction, The dynamics of numbers, Linear
and Nonlinear interpolation, the animation of objects, linear and non-linear translation, shape & object in
between, free from deformation, particle system.
Physical Simulation: Introduction, Objects falling in a gravitational field, Rotating wheels, Elastic collisions,
projectiles, simple pendulum, springs, Flight dynamics of an aircraft.
UNIT - IV
Augmented Reality:
Taxonomy, technology and features of augmented reality, difference between AR and VR, Challenges with
AR, AR systems and functionality, Augmented reality methods, visualization techniques for augmented
reality, enhancing interactivity in AR environments, evaluating AR systems.
UNIT - V
1. Development Tools and Frameworks:
Human factors: Introduction, the eye, the ear, the somatic senses.
Hardware: Introduction, sensor hardware, Head-coupled displays, Acoustic hardware, Integrated VR
systems.
Software: Introduction, Modelling virtual world, Physical simulation, VR toolkits, Introduction to VRML
2. AR / VR Applications:
Introduction, Engineering, Entertainment, Science, Training.
REFERENCE BOOKS:
1. Grigore C. Burdea, Philippe Coiffet , Virtual Reality Technology, Wiley 2016
2. Alan B. Craig, Understanding Augmented Reality, Concepts and Applications, Morgan Kaufmann, 2013.
3. Alan Craig, William Sherman and Jeffrey Will, Developing Virtual Reality Applications, Foundations of
Effective Design, Morgan Kaufmann, 2009.
4. John Vince, “Virtual Reality Systems “, Pearson Education Asia, 2007.
5. Anand R., “Augmented and Virtual Reality”, Khanna Publishing House, Delhi.

3 0 0 3
EC834OE: BIOMEDICAL INSTRUMENTATION
(Open Elective-III)
Prerequisite: Electronic measurement and instrumentation like static and dynamic charecteristics of
transducers ,working principles of sensors
Course Objectives
 Identify significant biological variables at cellular level and ways to acquire different bio-signals.
 Elucidate the methods to monitor the activity of the heart,brain, eyes and muscles.
 Introduce therapeutic equipment for intensive and critical care
 Outline medical imaging techniques and equipment for certain diagnosis and therapies.
Course Outcomes: After completion of the course the student is able to:
 Understand biosystems and medical systems from an engineering perspective.
 Identify the techniques to acquire record and primarily understand physiological activity of the human
body through cell potential, ECG, EEG, BP and blood flow measurement and EMG.
 Understand the working of various medical instruments and critical care equipment.
 Know the imaging techniques including CT,PET, SPECT and MRI used in diagnosis of various medical
conditions.
UNIT - I:
Bio-Potential Signals and Electrodes: Bio-signals and their characteristics, Organization of cell, Nernst
equation of membrane, Resting and Action potentials. Bio-amplifiers, characteristics of medical instruments,
problems encountered with measurements from living systems. Bio-potential electrodes – Body surface
recording electrodes, Internal electrodes, micro electrodes. Bio-chemical transducers – reference electrode, the
pH electrodes, Blood gas electrodes.
UNIT - II:
Cardiovascular Instrumentation: Heart and cardiovascular system Heart electrical activity, blood pressure
and heart sounds. Cardiovascular measurements electro cardiography – electrocardiogram, ECG Amplifier,
Electrodes and leads, ECG recorder principles. Types of ECG recorders. Principles of blood pressure and blood
flow measurement.
UNIT - III:
Neurological Instrumentation: Neuronal communication, electro encephalogram (EEG), EEG Measurements
EEG electrode-placement system, interpretation of EEG, EEG system Block diagram, preamplifiers and
amplifiers. EMG block diagram and Stimulators
UNIT - IV:
Equipment for Critical Care: Therapeutic equipment - Pacemaker, Defibrillator, Shortwave diathermy,
Hemodialysis machine. Respiratory Instrumentation - Mechanism of respiration, Spirometry,
Pneumotachograph, Ventilators.
UNIT - V: Principles of Medical Imaging: Radiography, computed Radiography, Computed Tomography
(CT), Magnetic Resonance Imaging (MRI), Nuclear Medicine, Single Photon Emission Computed Tomography
(SPECT), Positron Emission Tomography (PET), Ultrasonography, Introduction to Telemedicine.
TEXT BOOKS:
1. Hand-book of Biomedical Instrumentation – by R.S. Khandpur, McGraw-Hill, 2003.
2. Medical Instrumentation, Application and Design – by John G. Webster, John Wiley.
REFERENCE BOOKS:
1. Biomedical Instrumentation and Measurements – by Leslie Cromwell, F.J. Weibell, E.A. Pfeiffer, PHI.
2. Principles of Applied Biomedical Instrumentation – by L.A. Geoddes and L.E. Baker, John Wiley and Sons.
3. Introduction to Biomedical equipment technology-by Joseph Carr and Brown

CSE

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSE

Uploaded by

Copyright:

Available Formats

COMPUTER SCIENCE AND ENGINEERING 2020-21

B.Tech. in COMPUTER SCIENCE AND ENGINEERING

B. Tech in COMPUTER SCIENCE AND ENGINEERING

Applicable From 2020-21 Admitted Batch

S. No. Course Code Course Title L T P Credits

1 MA101BS Linear Algebra and Calculus 3 1 0 4

S. No. Course Code Course Title L T P Credits

1 MA201BS Differential Equations and Vector Calculus 3 1 0 4

8 EN208HS English Language and Communication Skills Lab 0 0 3 1.5

B.Tech. in COMPUTER SCIENCE AND ENGINEERING

Applicable From 2020-21 Admitted Batch

B. Tech in COMPUTER SCIENCE AND ENGINEERING

Applicable From 2020-21 Admitted Batch

S. No. Course Code Course Title L T P Credits

S. No Course Code Course Title L T P Credits

B.Tech. in COMPUTER SCIENCE AND ENGINEERING

Applicable From 2020-21 Admitted Batch

III YEAR I SEMESTER

S. No. Course Code Course Title L T P Credits

III YEAR II SEMESTER

S. No Course Code Course Title L T P Credits

B.Tech. in COMPUTER SCIENCE AND ENGINEERING

Applicable From 2020-21 Admitted Batch

S. No. Course Code Course Title L T P Credits

S. No. Course Code Course Title L T P Credits

B.Tech. in COMPUTER SCIENCE AND ENGINEERING

Applicable From 2020-21 Admitted Batch

Professional Elective – III

Professional Elective – V / MOOCS

B.Tech. in COMPUTER SCIENCE AND ENGINEERING

Applicable From 2020-21 Admitted Batch

B.Tech. I Year Syllabus (wef A.Y. 2020-21)

S. No. Course Code Course Title L T P Credits

S. No. Course Code Course Title L T P Credits

1 MA201BS Differential Equations and Vector Calculus 3 1 0 4

CMR ENGINEERING COLLEGE, HYDERABAD

UNIT-II: Eigen values and Eigen vectors

UNIT-III: Sequences & Series

UNIT-V: Multivariable calculus (Partial Differentiation and applications

CMR ENGINEERING COLLEGE, HYDERABAD

Diode laser and applications of lasers.

CMR ENGINEERING COLLEGE, HYDERABAD

Course Outcomes: The student will learn

Unit - 1: Introduction to Programming

Unit - II: Arrays, Strings, Structures and Pointers:

Unit - III: Preprocessor and File handling in C:

Unit - IV: Function and Dynamic Memory Allocation:

Unit - V: Introduction to Algorithms:

complexity through the example programs

1. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill

CMR ENGINEERING COLLEGE, HYDERABAD

UNIT- I: D.C CIRCUITS

UNIT-II: A.C CIRCUITS

UNIT-IV: ELECTRICAL MACHINES

UNIT-V: ELECTRICAL INSTALLATIONS

CMR ENGINEERING COLLEGE, HYDERABAD

ME105ES: ENGINEERING WORKSHOP & IT WORKSHOP

Pre-requisites: Practical skill

Part-A: Engineering Workshop

7. Demonstration of Power Tools

1. Windows Operating System & Drivers Installation

2. Network Connections & Troubleshooting

CMR ENGINEERING COLLEGE, HYDERABAD

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