Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f.

2021-22 Academic Year

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

IDP (B.Tech + M.Tech)

COURSE STRUCTURE
Applicable from 2021-22 Admitted Batch

I YEAR I SEMESTER

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

1 BSC Matrix Algebra and Calculus 3 1 0 4

2 ESC Programming for Problem Solving 3 0 0 3
3 BSC Engineering Chemistry 3 1 0 4
4 HSMC English 2 0 0 2
5 ESC-LC Programming for Problem Solving Lab 0 0 3 1.5
6 BSC-LC Engineering Chemistry Lab 0 0 2 1
7 HSMC-LC English Language and Communication Skills Lab 0 0 2 1
8 ESC-LC Engineering Workshop Practice 0 0 3 1.5
TOTAL 11 2 10 18
TOTAL
TOTAL

I YEAR II SEMESTER
S. No. Course Code Course Title L T P CREDITS

1. BSC Applied and Multivariable Calculus 3 1 0 4

2. BSC Applied Physics 3 1 0 4
3. ESC Basic Electrical Engineering 3 0 0 3
4. ESC Engineering Graphics 1 0 3 2.5
5. BSC-LC Applied Physics Lab 0 0 3 1.5
6. ESC-LC Basic Electrical Engineering Lab 0 0 2 1
7. ESC-LC Applied Python Programming Lab 0 1 2 2
TOTAL 10 3 10 18

Note : The total Credits in I year are to be 36. Two credits are to be allocated for Applied Python
Programming (L-0; T-1; P-2) in the first year
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

II YEAR I SEMESTER

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

1 ESC Analog & Digital Electronics 3 0 0 3
2 PCC-1 Data Structures 3 0 0 3
3 PCC-2 Discrete Mathematics 3 0 0 3
4 PCC-3 Computer Organization & Architecture 3 0 0 3
5 PCC-4 Object Oriented Programming 3 0 0 3
6 ESC-LC Analog & Digital Electronics Lab 0 0 3 1.5
7 PCC-LC Data Structures Lab 0 0 3 1.5
8 PCC-LC Object Oriented Programming using C++ Lab 0 0 3 1.5

9 PCC-LC IT Workshop Lab 0 0 3 1.5

*MC Constitution of India 2 0 0 0

10
TOTAL 17 0 12 21

II YEAR II SEMESTER

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

1 BSC Applied Statistical Methods 3 1 0 4
2 HSMC Economics & Financial Analysis 3 0 0 3
3 PCC-5 Operating Systems 3 0 0 3
4 PCC-6 Database Management Systems 3 0 0 3
5 PCC-7 Design and Analysis of Algorithms 3 0 0 3
6 PCC-LC Operating Systems Lab 0 0 3 1.5
7 PCC-LC Database Management Systems Lab 0 0 3 1.5
8 PCC-LC Java programming and Algorithms Lab 0 1 2 2
9 *MC Environmental Science 2 0 0 0
TOTAL 17 2 8 21
Note:* MC- Mandatory Course ( Non credit course)
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

III YEAR I SEMESTER

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

1 PCC-8 Formal Languages & Automata Theory 3 0 0 3
2 PCC-10 Computer Networks 3 1 0 4
3 PCC-11 Machine Learning 3 1 0 4
4 PEC-I Professional Elective-I 3 0 0 3
5 PEC-II Professional Elective –II 3 0 0 3
6 PCC-LC Machine Learning with Python Lab 0 1 2 2
7 PCC-LC Computer Networks Lab 0 1 2 2
8 HSMC-LC Advanced English Communication Skills Lab 0 0 2 1
9 *MC Authentication Techniques 2 0 0 0
TOTAL 17 3 8 22
III YEAR II SEMESTER

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

1 PCC-12 Cryptography and Network Security 3 0 0 3
2 PCC-13 Compiler Design 3 1 0 4
3 PCC-14 Software Engineering 3 0 0 3
4 PEC-III Professional Elective - III 3 0 0 3
5 OEC-I Open Elective-I 3 0 0 3
6 PCC-LC Cryptography and Network Security Lab 0 0 3 1.5
7 PCC-LC Devops Lab 0 2 2 3
8 PCC-LC Professional Elective-III Lab 0 0 3 1.5
9 *MC Chatbots 2 0 0 0
TOTAL 17 3 8 22
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

IV YEAR I SEMESTER

Course
S.No. Course Title L T P Credits
Code
1 OE-C Open Elective - II 3 0 0 3
2 PCC (UG) Cyber Security 3 0 0 3
4 PC(PG)-1 Advanced Data Structures and Algorithms 3 0 0 3
3 PEC-4 (UG) Professional Elective – IV 3 0 0 3
5 PEC-5(UG) Professional Elective – V 3 0 0 3
6 PEC-6(UG) Professional Elective – VI 3 0 0 3
Advanced Data Structures and
7 PG (LAB)-1 0 0 4 2
Algorithms Lab
8 LC-CE-9 Cyber Security Lab 0 0 2 1
9 MINI (UG) Mini Project / Summer Internship 0 0 4 2
10 PROJ Project Stage – I 0 0 6 3

Total 18 0 16 26(21UG+5PG)
* To be carried out during the summer vacation between 6 th and 7th semesters

IV YEAR II SEMESTER
Course
S.No. Course Title L T P Credits
Code
1 PC (PG)-2 Big Data Analytics 3 0 0 3
2 PE (PG)-1 Program Elective – I 3 0 0 3
3 PC (PG)-3 Distributed Systems 3 0 0 3
4 PE (PG)-2 Program Elective – II 3 0 0 3
5 PE (PG)-3 Program Elective – III 3 0 0 3
6 PG (LAB)-2 Big Data Analytics Lab 0 0 4 2
7 UG Project Stage – II 0 0 16 8
8 MC (PG) Research Methodology & IPR 2 0 0 2
Total 17 0 20 27(8UG+19PG)
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

V YEAR I SEMESTER

S.N
Course Code Course Title L T P Credits
o.
1 PE (PG)-4 Program Elective – IV 3 0 0 3
2 PC (PG)-4 Social Network Analysis 3 0 0 3
3 OEC (PG)-1 Open Elective 3 0 0 3
4 PG (LAB)-3 Social Network Analysis Lab 0 0 4 2
5 PG Dissertation Phase– I 0 0 20 10
Total Credits 9 0 24 21

V YEAR II SEMESTER

Course
S.No. Course Title L T P Credits
Code
1 PW (PG) Dissertation – II 0 0 32 16
Total Credits 16

Total UG Credits: 151

Total PG Credits: 61
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Professional Elective Core (PEC) Courses for CSE

Professional Elective-I
1. Information Theory & Coding
2. Advanced Computer Architecture
3. Data Mining & Warehousing
4. Digital Image Processing
5. Graph Databases

Professional Elective -II

1. Internet of Things
2. Speech & Video Processing
3. Parallel Computing
4. Advanced Databases
5. Computer Graphics

Professional Elective -III

1. Deep Learning
2. Network Programming
3. Scripting Languages
4. Mobile Application Development
5. Software Testing Methodologies

Professional Elective -IV

1. Reinforcement Learning
2. Embedded Systems
3. Semantic Web
4. Game Theory
5. Adhoc &Sensor networks

Professional Elective -V
1. Robotic Process Automation
2. Mobile Computing
3. Cloud Computing
4. Software Process and Project Management
5. Natural Language Processing

Professional Elective - VI
1. Computer Vision and Robotics
2. Informational Retrieval Systems
3. Blockchain Technologies
4. Software Metrics
5. Cognitive Computing

Open Elective Courses (OEC)

Open Elective - I (Humanities) Open Elective – II (CSE)

1. Entrepreneurship 1. Advanced Python Programming

2. Professional Practice, Law and Ethics 2. Java Programming
3. Cyber Laws & Ethics 3. Introduction to Data Science
 Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year
Open Elective (PG)

1. Industrial Safety
2. Operations Research
3. Cost Management of Engineering Projects
4. Composite Materials
5. Energy from Waste
6. Power from Renewable Energy Sources

Program Elective – I Program Elective – II

1. Digital Forensics 1. Federated Machine Learning
2. Web Security 2. High Performance Computing
3. Introduction to Data Science 3. Optimization Techniques

Program Elective – III Program Elective – IV

1. Augmented Reality and Virtual Reality 1. Fog Computing
2. Smart Technologies 2. Web Services & SOA
3. Quantum Computing 3. Randomized Algorithms
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Matrix Algebra and Calculus

(Common to all Branches)
I Year I Semester
L T P C
3 1 0 4
Pre-requisites: Mathematical Knowledge of 12th / Intermediate level
Objectives:To learn
1. Types of matrices and their properties.
2. Concept of a rank of the matrix and applying this concept to know the consistency and
solving the system of linear equations.
3. Concept of Eigenvalues and Eigenvectors and to reduce the quadratic form to canonical
form
4. Methods of solving the differential equations of first and higher order.
5. Geometrical approach to the mean value theorems and their application to the mathematical
problems
6. Evaluation of surface areas and volumes of revolutions of curves.
7. Evaluation of improper integrals using Beta and Gamma functions.
UNIT-I: Matrices 10 L
Matrices: Rank of a matrix: Echelon form, Normal form, System of linear equations: solving
system of Homogeneous and Non-Homogeneous equations, Gauss-elimination method, LU
Decomposition method.
Linear Transformation and Orthogonal Transformation: Eigenvalues and Eigenvectors and their
properties, Eigenvalues and Eigenvectors of Symmetric, Hermitian, Skew-Symmetric, Skew-
Hermitian, Orthogonal and Unitary matrices.
UNIT-II: Diagonalization of a Matrix 8L
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.
10 L
UNIT-III: Mean value theorems and Beta, Gamma functions
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. (All theorems
without proof).
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-IV: First Order ODE 10 L
Exact differential equations, converting non-exact equations to exact equations, Linear and
Bernoulli’s differential equations. Applications: Newton’s law of cooling, Law of natural growth
and decay, orthogonal trajectories and electrical circuits. First order equations with higher degree:
solvable for the differential coefficient, dependent variable and Independent variable.

UNIT-V: Ordinary Linear Differential Equations of Higher Order 10 L

Second order linear differential equations with constant coefficients - Non-Homogeneous terms of
the type 𝑒 𝑎𝑥 , sin 𝑎𝑥 , cos 𝑎𝑥, polynomials in𝑥, 𝑒 𝑎𝑥 𝑉(𝑥) and 𝑥 𝑉(𝑥) - method of variation of
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

parameters, Equations reducible to linear ODE with constant coefficients, Legendre’s equation,
Cauchy-Euler equation. Applications: Bending of beams, Electrical circuits and simple harmonic
motion.
Course outcomes:
After learning the contents of this paper the student must be able to
1. Write the matrix representation of a set of linear equations and to analyse the solution of
the system of equations
2. Find the Eigenvalues and Eigenvectors
3. Reduce the quadratic form to canonical form using orthogonal transformations.
4. Identify whether the given differential equation of first order is exact or not
5. Solve higher differential equation and apply the concept of differential equation to real
world problems
6. Solve the applications on the mean value theorems.
7. Evaluate the improper integrals using Beta and Gamma functions
Text Books
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36 th Edition, 2010
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley &Sons,2006.

References
1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9thEdition,Pearson, Reprint,
2002.
2. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, LaxmiPublications,
Reprint, 2008.
3. RamanaB.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi,11 thReprint,
2010.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

PROGRAMMING FOR PROBLEM SOLVING

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

3 0 0 3
Objectives
1. To learn the fundamentals of computers.
2. To understand the various steps in Program development.
3. To learn the syntax and semantics of C Programming Language.
4. To learn the usage of structured programming approach in solving problems.
Outcomes
1. Write algorithms and to draw flowcharts for solving problems.
2. Translate the algorithms/flowcharts to programs (in C language).
3. Code and test a given logic in C programming language.
4. Formulate simple algorithms for arithmetic and logical problems.
5. Decompose a problem into functions and to develop modular reusable code.
6. Use arrays, pointers, strings and structures to formulate algorithms and programs.
7. Searching and sorting problems.
UNIT-I:
INTRODUCTION TO COMPUTERS – Computer Systems, Computing Environments, Computer Languages,
Creating and running programs, Software Development Method, Algorithms, Pseudo code, flow charts, applying the
software development method.
INTRODUCTION TO C LANGUAGE – Background, Simple C programs, Identifiers, Basic data types, Variables,
Constants, Input / Output, Operators. Expressions, Precedence and Associatively, Expression Evaluation, Type
conversions, Bit wise operators, Statements, Simple C Programming examples.
UNIT-II:
STATEMENTS – if and switch statements, Repetition statements – while, for, do-while statements, Loop examples,
other statements related to looping – break, continue, go to, Simple C Programming examples.
DESIGNING STRUCTURED PROGRAMS- Functions, basics, user defined functions, inter function
communication, Scope, Storage classes-auto, register, static, extern, scope rules, type qualifiers, recursion- recursive
functions, Preprocessor commands, example C programs
UNIT-III:
ARRAYS AND STRINGS – Concepts, using arrays in C, inter function communication, array applications, two –
dimensional arrays, multidimensional arrays, C program examples. Concepts, C Strings, String Input / Output
functions, arrays of strings, string manipulation functions, string / data conversion, C program examples.
UNIT-IV:
POINTERS – Introduction (Basic Concepts), Pointers for inter function communication, pointers to pointers,
compatibility, memory allocation functions, array of pointers, programming applications, pointers to void, pointers to
functions, command –line arguments.
INPUT AND OUTPUT – Concept of a file, streams, standard input / output functions, formatted input / output
functions, text files and binary files, file input / output operations, file status functions (error handling), C program
examples.
UNIT-V:
DERIVED TYPES – Structures – Declaration, definition and initialization of structures, accessing structures, nested
structures, arrays of structures, structures and functions, pointers to structures, self referential structures, unions,
typedef, bit fields, enumerated types, C programming examples.
SORTING AND SEARCHING – Selection sort, Bubble sort, Insertion sort, Linear search and Binary search
methods.
Textbooks:
1. C Programming & Data Structures, B.A.Forouzan and R.F. Gilberg, Third Edition, Cengage Learning.
2. Problem Solving and Program Design in C, J.R. Hanly and E.B. Koffman, Fifth Edition, Pearson Education.
3. The C Programming Language, B.W. Kernighan and Dennis M.Ritchie, PHI/Pearson Education
References:
1. C for Engineers and Scientists, H.Cheng, Mc.Graw-Hill International Edition
2. Data Structures using C – A. M.Tanenbaum, Y.Langsam, and M.J. Augenstein, Pearson Education / PHI
3. C Programming & Data Structures, P. Dey, M Ghosh R Thereja, Oxford University Press
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ENGINEERING CHEMISTRY

I Year B.Tech. I-Semester L T P C

3 1 0 4

OBJECTIVES:
1. To bring adaptability to the concepts of chemistry and to acquire the required skills to become a
perfect engineer.
2. To acquire the knowledge of water treatment, electrochemistry and corrosion which are essential
for the Engineers and in industry.
3. To acquire the skills pertaining to Polymers and Energy sources to apply them for various
engineering fields etc.
4. To impart then knowledge of Engineering materials and their aspects useful for understanding
material chemistry.

OUTCOMES: The basic concepts included in this course will help the student to gain:
1. Differentiate hard and soft water; solve the related problems on water purification and its
significance in industry and daily life.
2. Understand the principles, concepts of electrochemistry and causes of corrosion, its consequences
and methods to minimize corrosion to improve industrial designs.
3. The required skills to get clear concepts on polymers and energy sources and their applications to
various engineering fields etc.
4. The knowledge of engineering materials such as Portland cement, white cement, concrete and
lubricants etc.

Unit-1: Water and its treatment: (11 hours)

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. Potable water and its specifications. Steps involved in treatment of water – Disinfection
of water by chlorination, breakpoint chlorination, Ozonisation. Boiler troubles - Scale, Sludge,
Priming, Foaming and Caustic embrittlement. Treatment of boiler feed water by Calgon
conditioning, Phosphate conditioning and Colloidal conditioning. External treatment of water- Ion
exchange process. Desalination of water – Reverse osmosis. Numerical problems based on
Determination of hardness of water.
Unit-2: Electrochemistry and corrosion: (12 Hours)

Electrochemistry: Electrochemical cells – Cell, Electrode, electrode potential, standard electrode

potential, Nernst equation-derivation and significance- Electrochemical series and its applications.
Construction and functioning of Calomel, Quinhydrone and glass electrode. Determination of pH
of a solution by using quinhydrone and glass electrode. Numerical problems. Potentiometric
titrations. Batteries – Primary (Lithium cell) and secondary batteries (Lead – acid storage battery
and Lithium ion battery).

Corrosion: Causes and effects of corrosion – Theories of chemical and electrochemical corrosion
– mechanism of electrochemical corrosion. Galvanic corrosion, Concentration cell corrosion-
water-line and pitting corrosion. Factors affecting rate of corrosion, Corrosion control methods-
Cathodic protection – Sacrificial anodic protection and impressed current cathodic methods.
Surface coatings – metallic coatings – Methods of coatings - Hot dipping - galvanization, tinning.
cementation, electroplating and electroless plating of copper.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Unit – 3: Polymeric materials: (11 Hours)

Polymers: Definition, Monomer, functionality and degree of polymerisation. Classification –

Types of Polymerisation - Addition & Condensation – Mechanisms of Polymerisation. Plastics:
Definition, characteristics - Compounding and fabrication- Methods of Moulding - Thermoplastics
and Thermosets – Preparation, properties and applications– PVC, Teflon and Bakelite. Fibres:
Definition, Characteristics. Preparation, Properties and applications of Terylene, Nylon 6:6.
Elastomers: Definition and characteristics. Natural rubber- structure, processing of latex,
Vulcanisation. Preparation, properties and applications of BuNa-S and Butyl rubber. Conducting
Polymers- Definition, Classification. Mechanism of conduction in Polyacetylene, Polyaniline &
Applications. Biodegradable polymers - Concept, Synthetic and Natural polymers, Polylactic acid,
Poly Vinyl alcohol, Nylon-2 and Nylon – 6. Applications and advantages of biodegradable
polymers.
Unit – 4: Energy sources: (12 Hours)

Fuels: Definition, classification with examples. Calorific value. Determination of calorific value
by Junker’s gas Calorimeter. Characteristics of good fuel. Coal: Types- Analysis of coal-
proximate analysis. Petroleum- Refining- Fractional distillation- composition, properties and uses
of petrol, diesel and kerosene. Cracking-types, Moving bed catalytic cracking. Knocking - Octane
and Cetane rating, Composition, characteristics and uses of LPG, CNG. Biodiesel-
Transesterification. Advantages. Hydrogen fuel- Production, storage, advantages and limitations.
Combustion - Definition, Calculation of air required for the combustion of fuel, numerical
problems related to calorific value and combustion.

Unit-5: Engineering Materials: (10 Hours)

Portland cement: Composition and constituents. Setting and hardening of cement, special cements-
properties and uses of High alumina cement, White cement and water proof cement. RCC, Decay
of Concrete. Refractories: Classification, Properties - Refractoriness, RUL, Chemical inertness
and porosity. Characteristics of a good refractory. Engineering Applications. Failure of a
refractory. Lubricants: functions of lubricants, Classification, Mechanism of Lubrication,
Properties - Viscosity, Acid value, Flash & Fire point, Cloud & Pour point, Aniline point.

Text Book:

1. Engineering Chemistry – PC Jain and M Jain – Dhanpath Rai and Sons, New Delhi.
Reference Books:
1. Text book of Engineering Chemistry by Ramadevi, Venkata Ramana Reddy &
Prashanth Rath, Cengage learning publications.
2. A text book of Engineering Chemistry by Thirumala Chary, Laxminarayana, Shashikala.
Pearson Publications.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ENGLISH

I Year B.Tech. I/II-Sem LTPC

2 0 0 2

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, and communicative competencies of Engineering students. In English classes, the focus would be
on the skills development in the areas of vocabulary, grammar, reading and writing. For this, the teachers
use the prescribed text for detailed study. The students are encouraged to read the texts leading to reading
comprehension and different known/unknown passages may be given for practice in the class. The time is
utilized for working out the exercises given after each excerpt. Authentic materials of a similar kind, for
example, newspaper articles, advertisements, promotional material are used to supplement exercises. The
focus in this syllabus is on skill development in the areas of Vocabulary, Grammar, Reading and Writing
Skills and practice of language skills in various contexts.

LEARNING OBJECTIVES

The course will help students to:

a. Improve the language proficiency of students in English with an emphasis on Vocabulary, Grammar,
Reading and Writing skills.
b. Develop study skills and communication skills in formal and informal situations.
c. Equip students to study engineering subjects more effectively and critically using the theoretical
and practical components of the syllabus.

Reading Skills
Objectives
1. To develop an awareness in students about the significance of silent reading and comprehension.
2. To develop students’ ability to guess meanings of words from the context and grasp the overall message
of the text, draw inferences, etc.,
3. To facilitate the students practice the sub-skills of reading viz., Skimming and Scanning the text,
Intensive and Extensive Reading, Reading for Pleasure, Identifying the topic sentence, Inferring lexical
and contextual meaning, Recognizing Coherence/Sequencing of Sentences.

 NOTE: The students will be trained in reading skills using the prescribed texts for detailed study. They
will be tested in reading comprehension of different ‘unseen’ passages which may be taken from
authentic texts, such as magazines/newspaper articles.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Writing Skills

Objectives
1. To bring an awareness in the students about the difference between formal and informal writing
2. To make students understand sentence structures and variations in process writing
3. To develop students’ creativity in different disciplines of academic writing
SYLLABUS

The course content / study material is divided into Five Units.

Unit –I
Chapter entitled ‘Presidential Address’ by Dr. A.P.J. Kalam from “Fluency in English– A Coursebook for
Engineering Students” published by Orient BlackSwan, Hyderabad
Vocabulary: The Concept of Word Formation -The Use of Prefixes and Suffixes- Collocations
Grammar: Punctuation - Identifying Common Errors in Writing with reference to Articles.
Reading: Reading and its Importance- Techniques for Effective Reading.
Writing: Sentence Structures -Use of Phrases and Clauses in Sentences- Paragraph Writing - Creating
Coherence and Cohesiveness.
Unit –II
Chapter entitled Satya Nadella: Email to Employees on his First Day as CEO from “Fluency in English– A
Coursebook for Engineering Students” Published by Orient BlackSwan, Hyderabad.
Vocabulary: Synonyms and Antonyms – Homonyms, Homophones and Homographs
Grammar: Identifying Common Errors in Writing with Reference to Noun-Pronoun Agreement – Words
with appropriate Prepositions - Phrasal Verbs
Reading: Improving Comprehension Skills – Techniques for Good Comprehension
Writing: Writing Formal Letters – Format - Letter of Complaint and Reply - Letter of Requisition and
Reply.
Unit –III
Vocabulary: Acquaintance with Phrases from Foreign Languages (Latin/French) with a focus on usage in
English
Grammar: Tenses - Identifying Common Errors in Writing with Reference to Misplaced Modifiers and
Tenses
Reading: Sub-skills of Reading- Skimming and Scanning.
Writing: Job Application with Resume- Writing Introduction and Conclusion - Essay Writing.
Unit –IV
Chapter entitled ‘Good Manners’ by J.C. Hill from Fluency in English – A Coursebook for Engineering Students”
published by Orient BlackSwan, Hyderabad

Vocabulary: Standard Abbreviations in English – Idioms – One Word Substitutes

Grammar: Subject-Verb Agreement - Redundancies and Clichés in Oral and Written Communication –
Sequence of Tenses.
Reading: Comprehension- Intensive Reading and Extensive Reading- Reading Practice – ‘If’ by
Rudyard Kipling.
Writing: Writing Practices - Information Transfer -Précis Writing.

Unit –V
Chapter entitled ‘Father Dear Father’ by Raj Kinger from Fluency in English – A Coursebook for Engineering
Students” Published by Orient BlackSwan, Hyderabad
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Vocabulary: Technical Vocabulary and their Usage – Indian Colloquial Terms

Grammar: Common Errors in English

Reading: Reading Comprehension-Exercises for Practice.
Writing: Technical Reports- Introduction – Characteristics of a Report – Categories of Reports
Formats- Structure of Reports (Manuscript Format) -Types of Reports - Writing a Report.

Note: Listening and Speaking skills which are given under Unit-6 in AICTE Model Curriculum are
covered in the syllabus of ELCS Lab Course.

 (Note: As the syllabus of English given in AICTE Model Curriculum-2018 for B.Tech First Year is Open-ended, besides following
the prescribed textbook, it is required to prepare teaching/learning materials by the teachers collectively in the form of
handouts based on the needs of the students in their respective colleges for effective teaching/learning in the cl ass.)

COURSE OUTCOMES
Students will be able to:
1. Choose appropriate vocabulary and sentence structures for their oral and written communication.
2. Demonstrate their understanding of the rules of functional grammar.
3. Develop comprehension skills from the known and unknown passages and respond appropriately.
4. Take an active part in drafting paragraphs, letters, essays, abstracts and reports in various contexts
5. Adapt basic proficiency in English

PRESCRIBED TEXTBOOK:
1. “Fluency in English – A Course book for Engineering Students” by Board of Editors: Hyderabad: Orient BlackSwan Pvt. Ltd.
2016. Print.

Suggested Reading:
(i) Practical English Usage. Michael Swan. OUP. 1995.
(ii) Remedial English Grammar. F.T. Wood. Macmillan.2007
(iii) Contemporary English Grammar Structures and Composition. David Green. Macmillan. 2010.
(iv) Communication Skills. Sanjay Kumar and Pushp Lata. Oxford University Press. 2011.
***************
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

PROGRAMMING FOR PROBLEM SOLVING LAB

I Year B.Tech. I-Semester L T P C

0 0 3 1.5

Objectives
1. To learn the fundamentals of computers.
2. To understand the various steps in Program development.
3. To learn the syntax and semantics of C Programming Language.
4. To learn the usage of structured programming approach in solving problems.

Outcomes
1. Write algorithms and to draw flowcharts for solving problems.
2. Translate the algorithms/flowcharts to programs (in C language).
3. Code and test a given logic in C programming language.
4. Formulate simple algorithms for arithmetic and logical problems.
5. Decompose a problem into functions and to develop modular reusable code.
6. Use arrays, pointers, strings and structures to formulate algorithms and programs.
7. Searching and sorting problems.

Week 1:
1. Write a C program to find the sum of individual digits of a positive integer.
2. 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.
3. Write a C program to generate the first n terms of the sequence.
4. Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by the user.
5. Write a C program to find the roots of a quadratic equation.

Week 2:
6. Write a C program to find the factorial of a given integer.
7. Write a C program to find the GCD (greatest common divisor) of two given integers.
8. Write a C program to solve Towers of Hanoi problem.
9. 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)

Week 3:
10. Write a C program to find both the largest and smallest number in a list of integers.
11. Write a C program that uses functions to perform the following:
i) Addition of Two Matrices ii) Multiplication of Two Matrices

Week 4:
12. 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.
13. Write a C program to determine if the given string is a palindrome or not
14. Write a C program that displays the position or index in the string S where the string T begins, or – 1 if S doesn’t
contain T.
15. Write a C program to count the lines, words and characters in a given text.

Week 5:
16. Write a C program to generate Pascal’s triangle.
17. Write a C program to construct a pyramid of numbers
18. Write a C program to read in two numbers, x and n, and then compute the sum of this geometric progression:
1+x+x2+x3+………….+xn
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

For example: if n is 3 and x is 5, then the program computes 1+5+25+125.

Print x, n, the sum
Perform error checking.
For example, the formula does not make sense for negative exponents – if n is less than 0.
Have your program print an error message if n<0, then go back and read in the next pair of numbers of
without computing the sum. Are any values of x also illegal ? If so, test for them too.

Week 6:
19. 2’s complement of a number is obtained by scanning it from right to left and complementing all the bits after the
first appearance of a 1. Thus 2’s complement of 11100 is 00100. Write a C program to find the 2’s complement
of a binary number.
20. Write a C program to convert a Roman numeral to its decimal equivalent.

Week 7:
21. Write a C program that uses functions to perform the following operations:
i) Reading a complex number
ii) Writing a complex number
iii) Addition of two complex numbers
iv) Multiplication of two complex numbers
(Note: represent complex number using a structure.)

Week 8:
22. . i) Write a C program which copies one file to another.
ii) Write a C program to reverse the first n characters in a file.
(Note: The file name and n are specified on the command line.)
23. . i) Write a C program to display the contents of a file.
ii) Write a C program to merge two files into a third file (i.e., the contents of the first file followed by those of
the second are put in the third file)

Week 9:
24. Write a C 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

Week 10:
25. Write C programs 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

Textbooks:

1. C Programming & Data Structures, B.A.Forouzan and R.F. Gilberg, Third Edition, Cengage Learning.
2. Problem Solving and Program Design in C, J.R. Hanly and E.B. Koffman, Fifth Edition, Pearson Education.
3. The C Programming Language, B.W. Kernighan and Dennis M.Ritchie, PHI/Pearson Education

References:

1. C for Engineers and Scientists, H.Cheng, Mc.Graw-Hill International Edition

2. Data Structures using C – A.M.Tanenbaum, Y.Langsam, and M.J. Augenstein, Pearson Education / PHI
3. C Programming & Data Structures, P. Dey, M Ghosh R Thereja, Oxford University Press
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ENGINEERING CHEMISTRY LAB

I Year B.Tech. I-Semester L T P C

0 0 2 1

Objectives
The chemistry laboratory course consists of experiments related to the principles of chemistry required to the
engineering student. The course will make the student to learn:
1. Estimation of hardness and chloride content in water to check its suitability for drinking purpose.
2. To determine the rate constant of reactions from concentrations as an function of time.
3. The measurement of physical properties like adsorption and viscosity.
4. To synthesize the drug molecules and check the purity of organic molecules by thin layer chromatographic
(TLC) technique.
Outcomes
1. Determination of parameters like hardness and chloride content in water.
2. Estimation of rate constant of a reaction from concentration – time relationships.
3. Determination of physical properties like adsorption and viscosity.
4. Calculation of Rf values of some organic molecules by TLC technique.

List of Experiments:

1. Determination of total hardness of water by complexometric method using EDTA

2. Estimation of Fe+2 by Dichrometry.
3. Estimation of an HCl by Conductometric titrations
4. Estimation of Acetic acid by Conductometric titrations
5. Estimation of HCl by Potentiometric titrations
6. Estimation of Fe2+ by Potentiometry using KMnO4
7. Determination of rate constant of acid catalysed hydrolysis of methyl acetate
8. Synthesis of Aspirin and Paracetamol
9. Thin layer chromatography calculation of Rf values. eg ortho and para nitro phenols
10. Determination of acid value of coconut oil
11. Verification of freundlich adsorption isotherm-adsorption of acetic acid on charcoal
12. Determination of viscosity of Coconut oil and ground nut oil by using Ostwald’s viscometer.
13. Determination of surface tension of a give liquid using stalagmometer.
14. Determination of partition coefficient of acetic acid between n-butanol and water.

References:
1. Senior practical physical chemistry, B.D. Khosla, A. Gulati and V. Garg (R. Chand & Co., Delhi)
2. An introduction to practical chemistry, K.K. Sharma and D. S. Sharma (Vikas publishing, N. Delhi)
3. Vogel’s text book of practical organic chemistry 5th edition
4. Text book on Experiments and calculations in Engineering chemistry – S.S. Dara
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ENGLISH LANGUAGE AND COMMUNICATION SKILLS (ELCS) LAB

I Year B.Tech. I-Semester L T P C

0 0 2 1

The English Language and Communication Skills (ELCS) 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.

Objectives

1. To facilitate computer-assisted multi-media instruction enabling individualized and independent

language learning
2. To sensitize the students to the nuances of English speech sounds, word accent, intonation and
rhythm
3. To bring about a consistent accent and intelligibility in students’ pronunciation of English by
providing an opportunity for practice in speaking

4. To improve the fluency of students in spoken English and neutralize their mother tongue influence
5. To train students to use language appropriately for public speaking, group discussions and
interviews
Learning Outcomes

Students will be able to:

1. Understand the nuances of English language through audio- visual experience and group activities
2. Neutralise their accent for intelligibility
3. Speak 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 the 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
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Speaking Skills:
Objectives
1. To involve students in speaking activities in various contexts
2. To enable students express themselves fluently and appropriately in social and professional contexts
• Oral practice
• Describing objects/situations/people
• Role play – Individual/Group activities
• Just A Minute (JAM) Sessions

The following course content is prescribed for the English Language and Communication Skills Lab.

Exercise – I
CALL Lab:
Understand: Listening Skill- Its importance – Purpose- Process- Types- Barriers- Effective Listening.
Practice: Introduction to Phonetics – Speech Sounds – Vowels and Consonants – Minimal Pairs- Consonant
Clusters- Past Tense Marker and Plural Marker- Testing Exercises

ICS Lab:

Understand: Spoken vs. Written language- Formal and Informal English.

Practice: Ice-Breaking Activity and JAM Session- Situational Dialogues – Greetings – Taking Leave –
Introducing Oneself and Others.
Exercise – II

CALL Lab:
Understand: Structure of Syllables – Word Stress– Weak Forms and Strong Forms – Sentence Stress –
Intonation.
Practice: Basic Rules of Word Accent - Stress Shift - Weak Forms and Strong Forms- Sentence Stress –
Intonation - Testing Exercises

ICS Lab:

Understand: Features of Good Conversation – Strategies for Effective Communication.

Practice: Situational Dialogues – Role-Play- Expressions in Various Situations –Making Requests and
Seeking Permissions - Telephone Etiquette.

Exercise - III
CALL Lab:

Understand: Errors in Pronunciation-the Interference of Mother Tongue (MTI).

Practice: Common Indian Variants in Pronunciation – Differences between British and American
Pronunciation -Testing Exercises
ICS Lab:

Understand: Descriptions- Narrations- Giving Directions and Guidelines.

Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Practice: Giving Instructions – Seeking Clarifications – Asking for and Giving Directions – Thanking and
Responding – Agreeing and Disagreeing – Seeking and Giving Advice – Making Suggestions.
Exercise – IV

CALL Lab:
Understand: Listening for General Details.

Practice: Listening Comprehension Tests - Testing Exercises

ICS Lab:
Understand: Public Speaking – Exposure to Structured Talks - Non-verbal Communication- Presentation
Skills.

Practice: Making a Short Speech – Extempore- Making a Presentation.

Exercise – V

CALL Lab:
Understand: Listening for Specific Details.

Practice: Listening Comprehension Tests -Testing Exercises

ICS Lab:

Understand: Group Discussion

Practice: Group Discussion

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 T. V. or LCD, a digital stereo –audio & video system and camcorder
etc.

Suggested Software:

❖ Cambridge Advanced Learners’ English Dictionary with CD.

❖ Grammar Made Easy by Darling Kindersley.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

❖ Punctuation Made Easy by Darling Kindersley.

❖ Oxford Advanced Learner’s Compass, 8th Edition.
❖ English in Mind (Series 1-4), Herbert Puchta and Jeff Stranks with Meredith Levy, Cambridge.
❖ English Pronunciation in Use (Elementary, Intermediate, Advanced) Cambridge University Press.
❖ English Vocabulary in Use (Elementary, Intermediate, Advanced) Cambridge University Press.
❖ TOEFL & GRE (KAPLAN, AARCO & BARRONS, USA, Cracking GRE by CLIFFS).
References:

1. Suzanna, R. A Practical Course in English Pronunciation (with CD). McGraw Hill Education. 2017.
Print.
2. Exercises in Spoken English. Part 1, 2 and 3. CIEFL. Oxford University Press, 1997. Print.
3. Hancock, M. English Pronunciation in Use. Intermediate Cambridge: Cambridge University Press. 2009.
Print.

*****
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ENGINEERING WORKSHOP PRACTICE

I Year B.Tech. I-Semester L T P C
0 0 3 1.5

Pre-requisites: Practical skill

Course Objectives: The objectives of this course is to acquire knowledge on the

i. To impart hands-on practice on Carpentry trade and skills.

ii. To impart hands-on practice on Fitting trade and skills
iii. To impart hands-on practice on Black Smithy trade and skills
iv. To impart hands-on practice on House Wiring trade and skills
v. To impart hands-on practice on Tin Smithy trade and skills
vi. To impart hands-on practice on Plumbing trade and skills
Note: At least two exercises to be done from each trade.

A. Carpentry
1. T-Lap Joint
2. Cross Lap Joint
3. Dovetail Joint

B. Fitting
1. Vee Fit
2. Square Fit
3. Half Round Fit

C. Black Smithy
1. Round rod to Square
2. S-Hook
3. Round Rod to Flat Ring

D. House Wiring
1. Parallel / Series Connection of three bulbs
2. Stair Case wiring
3. Florescent Lamp Fitting

E. Tin Smithy
1. Taper Tray
2. Open Scoop
3. Funnel

F. Plumbing
1. Coupling Joint
2. Elbow Joint
3. T Joint

TEXT BOOKS:
1. Workshop Practice by B.L.Juneja Cengage Learning
2. Elements of Workshop Technology–S. K.Hajra Choudhury and A. K. Hajra Choudhury.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

APPLIED AND MULTIVARIABLE CALCULUS

(Common to all Branches)
I Year II Semester

L T P C
3 1 0 4

Pre-requisites: Mathematical Knowledge of 12th / Intermediate level

Objectives: To learn

1. Concept, properties of Laplace transforms

2. Solving ordinary differential equations using Laplace transforms techniques.
3. Partial differentiation, concept of total derivative
4. Finding maxima and minima of function of two and three variables.
5. Evaluation of multiple integrals and their applications
6. The physical quantities involved in engineering field related to vector valued functions
7. The basic properties of vector valued functions and their applications to line, surface and
volume integrals.

UNIT-I: Laplace transforms: 8L

Laplace Transforms; Laplace Transform of standard functions, first shifting theorem, Laplace
transforms of functions when they are multiplied and divided by ‘t’, Laplace transforms of
derivatives and integrals of function, Evaluation of integrals by Laplace transforms, Laplace
transform of periodic functions,Inverse Laplace transform by different methods, convolution
theorem (without proof), solving Initial value problems by Laplace Transform method.

UNIT-II: Partial Derivatives and applications 10 L

Definitions of Limit and continuity. Partial Differentiation, Euler’s Theorem, Total derivative,
Jacobian, Functional dependence & independence, Maxima and minima of functions of two
variables and three variables, method of Lagrange multipliers.

UNIT-III: Multiple Integration 10 L

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 parallel piped).

UNIT-IV: Vector Differentiation 10 L

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.

10 L
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT-V: Vector Integration

Line, Surface and Volume Integrals, Theorems of Green, Gauss and Stokes (without proofs) and
their applications.

Course outcomes:
After learning the contents of this paper the student must be able to

1. Use the Laplace transforms techniques for solving ODE’s.

2. Find the extreme values of functions of two variables with/ without constraints.
3. Evaluate the multiple integrals and apply the concept to find areas, volumes, centre of
mass and gravity for cubes, sphere and rectangular parallel piped
4. Evaluate the line, surface and volume integrals and converting them from one to another

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. M Apostol , Calculus vol-2, John Wiley & Sons

References
1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9thEdition,Pearson, Reprint,
2002
2. Paras Ram, Engineering Mathematics, 2nd Edition, CBS Publishes
3. S. L. Ross, Differential Equations, 3rd Ed., Wiley India, 1984.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

APPLIED PHYSICS

I Year B.Tech. II-Semester L T P C

3 1 0 4

Course Objectives:
The course enables the student to understand:
1. Basic concepts of quantum physics required to deal with behavior of particles and waves.
2. Carrier concentration and recombination process of semiconductor materials.
3. Basic lasing action, various types of lasers and to learn fundamental concepts of Optical fibres.
4. Various polarization mechanisms in dielectric materials and explore the different types of magnetic
materials.
5. The unique properties of Superconductors.
Course Outcomes:
The student should be able to gain the knowledge on:
1. Wave particle duality and quantization of energy levels.
2. Fundamentals concepts of semiconductor technology.
3. Principles of Lasers and their categorization and properties and categorization of Optical fibres.
4. Characteristics of dielectric and magnetic materials.
5. Various types of superconductors and their transport properties.

UNIT-I: QUANTUM MECHANICS: Introduction to quantum physics, Black body radiation, Planck’s law,
photoelectric effect, Compton effect, wave-particle duality, de Broglie hypothesis, Davisson and Germer
experiment, Heisenberg’s uncertainty principle, Born’s interpretation ofthe wave function, Schrodinger’s time
independent wave equation, particle in one dimensional potential box, potential barrier-tunneling effect.

UNIT-II: SEMICONDUCTOR PHYSICS: Intrinsic and extrinsic semiconductors: Estimation of carrier-

concentration, Dependence of Fermi level on carrier-concentration and variation with temperature, Carrier
generation and recombination, Carrier transport: diffusion and drift, Hall Effect, p-n junction diode: I-V
Characteristics, Zener diode: I-V Characteristics, Bipolar JunctionTransistor (BJT): Construction, Principle of
operation and characteristics.

UNIT- III: LASERS AND FIBRE OPTICS

Lasers: Introduction, Laser Beam Characteristics, Interaction of light with matter and the three Quantum Processes,
Einstein Coefficients and their relations, Light Amplification, Components of Laser, Three requirements for Lasing
Action, Pumping Methods, Types of Lasers: Ruby Laser, He-Ne Laser, Semiconductor Laser, Applications of laser.
Fibre Optics: Introduction to Optical Fibre, Total Internal Reflection, Construction of optical fibre, Acceptance angle
- Numerical Aperture, classification based on materials, Refractive index profile and mode propagation, Losses in
Optical Fibre, Fibre Optic Communication System, Merits of Optical Fibres, Applications.

UNIT-IV: DIELECTRIC AND MAGNETIC MATERIALS

Dielectrics: Introduction, Basic definitions: Electric field, Electric flux density, Dielectric Constant, Polarization
vector, Electric susceptibility, Polarizability, Relation between polaraization, susceptibility and dielectric constant,
Effect of dielectric on the behavior of a capacitor, Calculation of polarizabilities: Electronic, Ionic and Orientation
Polarizations, Internal fields in a solid - Clausius-Mossotti relation, Piezoelectrics, Ferroelectrics and Pyroelectric
materials.
Magnetism: Introduction, Bohr magneton, classification of Dia, Para and Ferro magnetic materials on the
basis of magnetic moment, Hysteresis curve based on domain theory, Soft and hard magnetic materials, Properties
of anti-Ferro and ferri magnetic materials, magneto electrics, multi ferroics.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT-V: SUPERCONDUCTIVITY
Introduction to Superconductivity, Low TC superconductors, Properties of Superconductors: Zero electrical resistance,
Persistent current, Critical temperature, Critical magnetic field, Critical current density, Perfect diamagnetism-
Meissner effect, London penetration depth, Flux quantization, Entropy, Heat capacity, Isotope effect, Type-I and Type-
II Superconductors, BCS Theory, Josephson Effect, High T C Superconductors, Applications.

TEXT BOOKS:
1. Principles of Physics, Jearl Walker, David Halliday and Robert Resnick-Wiley publications.
2. Engineering Physics, B.K. Pandey, S. Chaturvedi – Cengage Learing.
3. A text book of Engineering Physics, Dr. M. N Avadhanulu, Dr. P.G. Kshirsagar- S. Chand.

REFERENCES:
1. Engineering Physics, R. K. Gaur - S.L. Gupta, Dhanpat Rai & Sons
2. J. Singh, Semiconductor Optoelectronics: Physics and Technology, Mc Graw-Hill inc. (1995).
3. Introduction to Solid State Physics by Charles kittel, wiley student edition.
4. S.M. Sze, Semiconductor Devices: Physics and Technology, wiley (2008).
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

BASIC ELECTRICAL ENGINEERING

I Year B.Tech. II-Semester L T P C

3 0 0 3
Pre-requisites: --
Objectives
1. To introduce the concepts of electrical circuits and its components
2. To understand magnetic circuits, DC circuits and AC single phase & three phase circuits
3. To study and understand the different types of DC/AC machines and Transformers.
4. To import the knowledge of various electrical installations.
5. To introduce the concept of power, power factor and its improvement.
Outcomes
1. To analyze and solve electrical circuits using network laws and theorems.
2. To understand and analyze basic Electric and Magnetic circuits
3. To study the working principles of Electrical Machines
4. To introduce components of Low Voltage Electrical Installations

UNIT - I
D.C. CIRCUITS
Electrical circuit elements (R, L and 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 circuits, voltage and current relations in star and delta connections.
UNIT - III
TRANSFORMERS
Ideal and practical transformer, equivalent circuit, losses in transformers, regulation and efficiency. Auto-transformer
and three-phase transformer connections.
UNIT - IV
ELECTRICAL MACHINES
Generation of rotating magnetic fields, Construction and working of a three-phase induction motor, Significance of
torque-slip characteristic. Loss components and efficiency, starting and speed control of induction motor. Single-phase
induction motor. Construction, working, torque-speed characteristic and speed control of separately excited dc motor.
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.
Textbooks:
1. D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill, 2010.
2. D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill, 2009.

References:
1. L. S. Bobrow, “Fundamentals of Electrical Engineering”, Oxford University Press, 2011.
2. E. Hughes, “Electrical and Electronics Technology”, Pearson, 2010.
3. V. D. Toro, “Electrical Engineering Fundamentals”, Prentice Hall India, 1989.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ENGINEERING GRAPHICS

I Year B.Tech. II-Semester L T P C

1 0 3 2.5

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
Outcomes:
At the end of the course, the student will be able to:
• Prepare working drawings to communicate the ideas and information.
• Read, understand and interpret engineering drawings.

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

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

UNIT–III:
Projections of Regular Solids – Auxiliary Views.

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

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

TEXT BOOKS:
1. Engineering Drawing by N.D. Bhatt, Charotar
2. Engineering Drawing and Graphics by Rane and Shah, Pearson Edu.

REFERENCE BOOKS:
1. A Text Book of Engineering Drawing by Dhawan R K, S. Chand
2. Engineering Graphics with Auto CAD by James D Bethune, Pearson Edu.
3. Engineering Graphics by K R Mohan, Dhanpat Rai.
4. Text book on Engineering Drawingby KL Narayana, P Kannaih, Scitech
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

APPLIED PHYSICS LAB

I Year B.Tech. II-Semester L T P C

0 0 3 1.5

Objectives
1. To provide an experimental foundation for the theoretical concepts introduced in the lectures.
2. To teach how to make careful experimental observations and how to think about and draw conclusions from
such data.
3. To help students understand the role of direct observation in physics and to distinguish between inferences
based on theory and the outcomes of experiments.
Outcomes
1. Make careful experimental observations and draw conclusions from such data.
2. Distinguish between inferences based on theory and the outcomes of experiments.
3. Write a technical report which communicates scientific information in a clear and concise manner.

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. Light emitting diode: Plot V-I and P-I characteristics of light emitting diode.
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. LASER: To study the characteristics of LASER sources.
8. Losses in Optical fibre: To determine the bending losses of Optical fibres .
9. LCR Circuit: To determine the resonant frequency and quality factor of LCR Circuit
10. R-C Circuit: To determine the time constant of R-C circuit.
11. PIN photo diode: To study the V-I & P-I characteristics of PIN photo diode detector.
12. Zener diode: To study the V-I Characteristics of Zener diode.

Note: Any 8 experiments are to be performed by each student

Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

BASIC ELECTRICAL ENGINEERING LAB

I Year B.Tech. II-Semester L T P C

0 0 2 1

Pre-requisites: Basic Electrical Engineering

Objectives
1. To analyze a given network by applying various electrical laws and network theorem
2. To know the response of electrical circuits for different excitations
3. To calculate, measure and know the relation between basic electrical parameters.
4. To analyze the performance characteristics of DC and AC electrical machines

Outcomes
1. Get an exposure to basic electrical laws.
2. Understand the response of different types of electrical circuits to different excitations.
3. Understand the measurement, calculation and relation between the basic electrical parameters
4. 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 for DC excitation
4. Transient Response of RLC Series circuit for 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

Textbooks:

1. D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill, 2010.
2. D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill, 2009.

References:

1. L. S. Bobrow, “Fundamentals of Electrical Engineering”, Oxford University Press, 2011.

2. E. Hughes, “Electrical and Electronics Technology”, Pearson, 2010.
3. V. D. Toro, “Electrical Engineering Fundamentals”, Prentice Hall India, 1989.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

APPLIED PYTHON PROGRAMMING LAB

I Year B.Tech. II-Semester L T P C

0 1 2 2

Cycle - 1
1. Downloading and Installing Python and Modules
a) Python 3 on Linux
Follow the instructions given in the URL https://docs.python-guide.org/starting/install3/linux/
b) Python 3 on Windows
Follow the instructions given in the URL https://docs.python.org/3/using/windows.html
(Please remember that Windows installation of Python is harder!)
c) pip3 on Windows and Linux
Install the Python package installer by following the instructions given in the URL
https://www.activestate.com/resources/quick-reads/how-to-install-and-use-pip3/
d) Installing numpy and scipy
You can install any python3 package using the command pip3 install <packagename>
e) Installing jupyterlab
Install from pip using the command pip install jupyterlab
2. Introduction to Python3
a) Printing your biodata on the screen
b) Printing all the primes less than a given number
c) Finding all the factors of a number and show whether it is a perfect number, i.e., the sum of all its factors
(excluding the number itself) is equal to the number itself
3. Defining and Using Functions
a) Write a function to read data from a file and display it on the screen
b) Define a boolean function is palindrome(<input>)
c) Write a function collatz(x) which does the following: if x is odd, x = 3x + 1; if x is even, then x = x/2.
Return the number of steps it takes for x = 1
d) Write a function N(m, s) = exp(-(x-m)2/(2s2))/sqrt(2π)s that computes the Normal distribution
4. The package numpy
a) Creating a matrix of given order m x n containing random numbers in the range 1 to 99999
b) Write a program that adds, subtracts and multiplies two matrices. Provide an interface such that, based
on the prompt, the function (addition, subtraction, multiplication) should be performed
c) Write a program to solve a system of n linear equations in n variables using matrix inverse
5. The package scipy and pyplot
a) Finding if two sets of data have the same mean value
b) Plotting data read from a file
c) Fitting a function through a set a data points using polyfit function
d) Plotting a histogram of a given data set
6. The strings package
a) Read text from a file and print the number of lines, words and characters
b) Read text from a file and return a list of all n letter words beginning with a vowel
c) Finding a secret message hidden in a paragraph of text
d) Plot a histogram of words according to their length from text read from a file

Cycle -2
7. Installing OS on Raspberry Pi
a) Installation using PiImager
b) Installation using image file
• Downloading an Image
• Writing the image to an SD card
• using Linux
• using Windows
• Booting up
Follow the instructions given in the URL
https://www.raspberrypi.com/documentation/computers/getting-started.html
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

8. Accessing GPIO pins using Python

a) Installing GPIO Zero library.
First, update your repositories list:
sudo apt update
Then install the package for Python 3:
sudo apt install python3-gpiozero
b) Blinking an LED connected to one of the GPIO pin
c) Adjusting the brightness of an LED
Adjust the brightness of an LED (0 to 100, where 100 means maximum brightness)
using the in-built PWM wavelength.
9. Collecting Sensor Data
a) DHT Sensor interface
◦ Connect the terminals of DHT GPIO pins of Raspberry Pi.
◦ Import the DHT library using import Adafruit_DHT
◦ Read sensor data and display it on screen.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ANALOG & DIGITAL ELECTRONICS

II Year B.Tech. I-Semester L T P C

3 0 0 3

Objectives
1. To introduce components such as diodes, BJTs and FETs.
2. To know the applications of components.
3. To give understanding of various types of amplifier circuits
4. To learn basic techniques for the design of digital circuits and fundamental concepts
used in thedesign of digital systems.
5. To understand the concepts of combinational logic circuits and sequential circuits.

Outcomes
1. Know the characteristics of various components.
2. Understand the utilization of components.
3. Design and analyze small signal amplifier circuits.
4. Postulates of Boolean algebra and to minimize combinational functions
5. Design and analyze combinational and sequential circuits
6. Known 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, 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 Emitter bias,
bias compensation, thermal runaway and stability, transistor at low frequencies, CE amplifier
response, gain bandwidth product, Emitter follower, RC coupled amplifier.
Field Effect Transistors: JFET, V-I characteristics, MOSFET, low frequency CS and CD amplifiers.

UNIT - III:
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.
Basic Theorems and Properties of Boolean Algebra, Canonical and Standard Forms, Digital
Logic Gates.

UNIT - IV: Combinational logic circuits

The K Map Method, Product-of-Sums Simplification, Don’t-Care Conditions, NAND and NOR
Implementation, Exclusive-OR Function, Binary Adder-Subtractor,Magnitude Comparator,
Decoders, Encoders, Multiplexers, Code converters.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT - V: Sequential logic circuits

Sequential Circuits, Storage Elements: Latches and flip flops, Shift Registers, Ripple
Counters, Synchronous Counters, Random-Access Memory, Read-Only Memory.

Text Books

1. Integrated Electronics: Analog and Digital Circuits and Systems, Jaccob Millman,
Christos Halkias and Chethan D. Parikh, 2nd Edition, Tata McGraw-Hill Education,
India, 2010.
2. Digital Design, Morris Mano and Michael D. Cilette, 5th Edition, Pearson, 2011.

References

1. Electronic Devices and Circuits, Jimmy J Cathey, Schaum’s outline series, 1988.
2. Digital Principles, Roger L. Tokheim, 3rd Edition, Schaum’s outline series, McGraw-Hill,
1994.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DATA STRUCTURES

II Year B.Tech. I-Semester L T P C

3 0 0 3

Prerequisites
1. A course on “Programming for Problem Solving “

Objectives
1. Exploring basic data structures such as stacks and queues.
2. Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs.
3. Introduces sorting and pattern matching algorithms

Outcomes
1. Ability to select the data structures that efficiently model the information in a problem.
2. Ability to assess efficiency trade-offs among different data structure implementations or
combinations.
3. Implement and know the application of algorithms for sorting and pattern matching.
4. 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.
Sortings: 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Textbooks:
1. Fundamentals of data structures in C, E.Horowitz, S.Sahni and Susan Anderson Freed, 2nd Edition,
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, R.F.Gilberg And B.A.Forouzan, 2nd Edition,
Cengage Learning.
2. Introduction to data structures in C, Ashok Kamthane, 1st Edition, PEARSON.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DISCRETE MATHEMATICS

II Year B.Tech. I-Semester L T P C

3 0 0 3

Prerequisites
1. An understanding of Mathematics in general is sufficient.
Objectives
1. Introduces the elementary discrete mathematics for computer science and engineering.
2. Topics include formal logic notation, methods of proof, induction, sets, relations, graph theory,
permutations and combinations, counting principles; recurrence relations and generating functions.
Outcomes
1. Ability to understand and construct precise mathematical proofs
2. Ability to use logic and set theory to formulate precise statements
3. Ability to analyze and solve counting problems on finite and discrete structures
4. Ability to describe and manipulate sequences
5. 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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.

Textbook:

1. Discrete Mathematics and Its Applications with Combinatorics and Graph Theory- Kenneth H Rosen,
7th Edition, TMH.

References:

1. Discrete Mathematical Structures with Applications to Computer Science-J.P. Tremblay and R.

Manohar, TMH,
2. Discrete Mathematics for Computer Scientists & Mathematicians: Joe L. Mott, Abraham Kandel,
Teodore P. Baker, 2nd Edition, Pearson Education.
3. Discrete Mathematics- Richard Johnsonbaugh, 7Th Edition, 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, 5th Edition ,
Pearson Education,.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

COMPUTER ORGANIZATION & ARCHITECTURE

II Year B.Tech. I-Semester L T P C

3 0 0 3

Prerequisites: No prerequisites
Co-requisite: A Course on “Digital Logic Design and Microprocessors”
Objectives
1. The purpose of the course is to introduce principles of computer organization and the basic
architectural concepts.
2. It begins with basic organization, design, and programming of a simple digital computer and
introduces simple register transfer language to specify various computer operations.
3. Topics include computer arithmetic, instruction set design, microprogrammed control unit, pipelining
and vector processing, memory organization and I/O systems, and multiprocessors

Outcomes
1. Understand the basics of instructions sets and their impact on processor design.
2. Demonstrate an understanding of the design of the functional units of a digital computer
system.
3. Evaluate cost performance and design trade-offs in designing and constructing a computer
processor including memory.
4. Design a pipeline for consistent execution of instructions with minimum hazards.
5. 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
Micro Programmed 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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, Arrey Processor.

Multi Processors: Characteristics of Multiprocessors, Interconnection Structures, Interprocessor arbitration,

Interprocessor communication and synchronization, Cache Coherence.

Textbook:

1. Computer System Architecture, M. Moris Mano, 3rd Edition, Pearson/PHI.

References:

1. Computer Organization, Car Hamacher, Zvonks Vranesic, SafeaZaky, 5th Edition, McGraw Hill.
2. Computer Organization and Architecture, William Stallings 6th Edition, Pearson/PHI.
3. Structured Computer Organization, Andrew S. Tanenbaum, 4th Edition, PHI/Pearson.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

OBJECT ORIENTED PROGRAMMING

II Year B.Tech. I-Semester L T P C

3 0 0 3

Prerequisites
1. A course on “Programming for Problem Solving ”

Objectives
1. Introduces object oriented programming concepts using the C++ language.
2. Introduces the principles of data abstraction, inheritance and polymorphism;
3. Introduces the principles of virtual functions and polymorphism
4. Introduces handling formatted I/O and unformatted I/O
5. Introduces exception handling

Outcomes
1. Able to develop programs with reusability
2. Develop programs for file handling
3. Handle exceptions in programming
4. Develop applications for a range of problems using object-oriented programming techniques

UNIT - I
Object Oriented thinking - Different paradigms for problem solving, need for OOP paradigm, differences
between OOP and Procedure oriented programming, Overview of OOP concepts- Abstraction, Encapsulation,
Inheritance and Polymorphism.

C++ Basics: Structure of a C++ program, Data types, Declaration of variables, Expressions, Operators,
Operator Precedence, Evaluation of expressions, Type conversions, Pointers, Arrays, Pointers and Arrays,
Strings, Structures, References.

Flow control statement- if, switch, while, for, do, break, continue, goto statements.

Functions - Scope of variables, Parameter passing, Default arguments, inline functions, Recursive functions,
Pointers to functions.

Dynamic memory allocation and deallocation operators-new and delete, Preprocessor directives.

UNIT - II
C++ Classes And Data Abstraction: Class definition, Class structure, Class objects, Class scope, this pointer,
Friends to a class, Static class members, Constant member functions, Constructors and Destructors, Dynamic
creation and destruction of objects, Data abstraction, ADT and information hiding.

UNIT - III
Inheritance: Defining a class hierarchy, Different forms of inheritance, Defining the Base and Derived
classes, Access to the base class members, Base and Derived class construction, Destructors, Virtual base
class.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Virtual Functions And Polymorphism: Static and Dynamic binding, virtual functions, Dynamic binding
through virtual functions, Virtual function call mechanism, Pure virtual functions, Abstract classes,
Implications of polymorphic use of classes, Virtual destructors.

UNIT - IV
C++ I/O: I/O using C functions, Stream classes hierarchy, Stream I/O, File streams and String streams,
Overloading operators, Error handling during file operations, Formatted I/O.

UNIT-V
Exception Handling: Benefits of exception handling, Throwing an exception, The try block, Catching an
exception, Exception objects, Exception specifications, Stack unwinding, Rethrowing an exception, Catching
all exceptions.

Textbooks:
1. The Complete Reference C++, 4th Edition, Herbert Schildt, TMH.
2. Problem solving with C++: The Object of Programming, 4 th Edition, Walter Savitch, Pearson
Education.

References:

1. The C++ Programming Language, B.Stroutstrup, 3rd Edition, Pearson Education.

2. OOP in C++, T.Gaddis, J.Walters and G.Muganda, 3 rd Edition, Wiley DreamTech Press.
3. Object Oriented Programming in C++, R.Lafore, 3rd Edition, Galigotia Publications pvt ltd.
4. Computer Science, a Structured Programming Approach Using C++, B.A.Forouzan and
R.F.Gilberg, Thomson.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ANALOG & DIGITAL ELECTRONICS LAB

II Year B.Tech. I-Semester L T P C

0 0 3 1.5

Objectives
1. To introduce components such as diodes, BJTs and FETs.
2. To know the applications of components.
3. To give understanding of various types of amplifier circuits
4. To learn basic techniques for the design of digital circuits and fundamental concepts used in
the design of digital systems.
5. To understand the concepts of combinational logic circuits and sequential circuits.

Outcomes
1. Know the characteristics of various components.
2. Understand the utilization of components.
3. Design and analyze small signal amplifier circuits.
4. Postulates of Boolean algebra and to minimize combinational functions
5. Design and analyze combinational and sequential circuits
6. Known about the logic families and realization of logic gates.

List of Experiments

1. Obtain Ripple factor,% Regulation of Full Wave Rectifier with & without filter.
2. Plot the input and output Characteristics of given BJT in CE and CB configurations.
3. Plot the Drain and Transfer Characteristics of given JFET in CS configuration.
4. Draw the Frequency response of a CE Amplifier for the given voltage gain.
5. Realization of Boolean Expressions using Gates and Universal gates.
6. Generate clock signal using NAND / NOR gates.
7. Design a 4 – bit Adder / Subtractor after designing a Fulladder circuit using gates.
8. Design an Universal Shift Register using D flip-flops.
9. Design a 4 – bit Ripple Counter using flip-flops and draw the output waveform.
10. Design a Synchronous and Asynchronous binary counter using JK flip-flops.

Textbooks:
1. Integrated Electronics: Analog and Digital Circuits and Systems, Jaccob Millman, Christos Halkias
and Chethan D. Parikh, 2nd Edition, Tata McGraw-Hill Education, India, 2010.
2. Digital Design, Morris Mano and Michael D. Cilette, 5th Edition, Pearson, 2011.

References:
1. Electronic Devices and Circuits, Jimmy J Cathey, Schaum’s outline series, 1988.
2. Digital Principles, Roger L. Tokheim, 3rd Edition, Schaum’s outline series, McGraw-Hill, 1994.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DATA STRUCTURES LAB

II Year B.Tech. I-Semester L T P C
0 0 3 1.5

Prerequisites:
1. A Course on “Programming for problem solving”
Objectives
1. It covers various concepts of C programming language
2. It introduces searching and sorting algorithms
3. It provides an understanding of data structures such as stacks and queues.
Outcomes
1. 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.
2. 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.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
3. Write a program that uses functions to perform the following operations on circular linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
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, E.Horowitz, S.Sahni and Susan Anderson Freed, 2nd Edition,
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, R.F.Gilberg And B.A.Forouzan, 2nd Edition,
Cengage Learning.
2. Introduction to data structures in C, Ashok Kamthane, 1st Edition, PEARSON.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

OBJECT ORIENTED PROGRAMMING USING C++ LAB

II Year B.Tech. I-Semester L T P C

0 0 3
1.5

Prerequisites: A course on “Programming for Problem Solving”

Objectives
1. Introduces object oriented programming concepts using the C++ language.
2. Introduces the principles of data abstraction, inheritance and polymorphism;
3. Introduces the principles of virtual functions and polymorphism
4. Introduces handling formatted I/O and unformatted I/O
5. Introduces exception handling
Outcomes
1. Ability to develop applications for a range of problems using object-oriented programming
techniques

List of Experiments

1. Program: Write a C++ Program to display names, roll no’s, and grades of 3 students who have appeared in
the examination. Declare the class of name, roll no’s and grade. Create an array of class objects. Read and
display the contents of the array.
2. Program: Write a C++ program to declare struct. Initialize and display contents of member variables.
3. Program: Write a C++ program to declare a class. Declare pointer to class. Initialize and display the contents
of the class member.
4. Program: Given that an EMPLOYEE class contains following members: data members: Employee number,
Employee name, Basic, DA, IT, Net Salary and print data members. Write a C++ program to read the data
of N employee and compute Net salary of each employee (DA=52% of Basic and Income Tax (IT) =30%
of the gross salary).
5. Program: Write a C++ to illustrate the concepts of console I/O operations.
6. Write a C++ program to use scope resolution operator. Display the various values of the same variables
declared at different scope levels.
7. Program: Write a C++ program to allocate memory using new operator.
8. Write a C++ program to create multilevel inheritance. (Hint:classes A1,A2, A3)
9. Write a C++ program to create an array of pointers. Invoke functions using array objects.
10. Write a C++ program to use pointer for both base and derived classes and call the member function. Use
Virtual keyword.
Textbooks:
1. The Complete Reference C++, 4th Edition, Herbert Schildt, TMH.
2. Problem solving with C++: The Object of Programming, 4 th Edition, Walter Savitch, Pearson
Education.
References:
1. The C++ Programming Language, B.Stroutstrup, 3rd Edition, Pearson Education.
2. OOP in C++, T.Gaddis, J.Walters and G.Muganda, 3 rd Edition, Wiley DreamTech Press.
3. Object Oriented Programming in C++, R.Lafore, 3 rd Edition, Galigotia Publications pvt ltd.
4. Computer Science, a Structured Programming Approach Using C++, B.A.Forouzan and
R.F.Gilberg, Thomson.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

IT WORKSHOP LAB

II Year B.Tech. I-Semester L T P C

0 0 3 1.5

Objectives:

The IT Workshop for engineers is a training lab course spread over 60 hours. The modules include training
on PC Hardware, Internet & World Wide Web and Productivity tools including Word, Excel, Power Point and
Publisher.
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, power point presentations and personal web sites using the Microsoft
suite of office tools and LaTeX. (Recommended to use Microsoft office 2007 in place of MS Office 2003)
PC Hardware
Task 1: 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.
Task 2: Every student should disassemble and assemble the PC back to working condition. Lab instructors
should verify the work and follow it up with a Viva. Also students need to go through the video which shows
the process of assembling a PC. A video would be given as part of the course content.
Task 3: Every student should individually install MS windows on the personal computer. Lab instructor
should verify the installation and follow it up with a Viva.
Task 4: Every student should install Linux on the computer. This computer should have windows installed.
The system should be configured as dual boot with both windows and Linux. Lab instructors should verify
the installation and follow it up with a Viva
Task 5: Hardware Troubleshooting: Students have to be given a PC which does not boot due to improper
assembly or defective peripherals. They should identify the problem and fix it to get the computer back to
working condition. The work done should be verified by the instructor and followed up with a Viva.
Task 6: Software Troubleshooting: Students have to be given a malfunctioning CPU due to system software
problems. They should identify the problem and fix it to get the computer back to working condition. The
work done should be verified by the instructor and followed up with a Viva.

Internet & World Wide Web

Task1: Orientation & Connectivity Boot Camp: Students should get connected to their Local Area Network
and access the Internet. In the process they configure the TCP/IP setting. Finally students should demonstrate,
to the instructor, how to access the websites and email. If there is no internet connectivity preparations need
to be made by the instructors to simulate the WWW on the LAN.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Task 2: Web Browsers, Surfing the Web: Students customize their web browsers with the LAN proxy
settings, bookmarks, search toolbars and pop up blockers. Also, plug-ins like Macromedia Flash and JRE for
applets should be configured.

Task 3: Search Engines & Netiquette: Students should know what search engines are and how to use the
search engines. A few topics would be given to the students for which they need to search on Google. This
should be demonstrated to the instructors by the student.

Task 4: Cyber Hygiene: Students would be exposed to the various threats on the internet and would be asked
to configure their computer to be safe on the internet. They need to first install an antivirus software, configure
their personal firewall and windows update on their computer. Then they need to customize their browsers to
block pop ups, block active x downloads to avoid viruses and/or worms.

LaTeX and Word

Task 1 – Word Orientation: The mentor needs to give an overview of LaTeX and Microsoft (MS) office
2007/ equivalent (FOSS) tool word: Importance of LaTeX and MS office 2007/ equivalent (FOSS) tool Word
as word Processors, Details of the four tasks and features that would be covered in each, Using LaTeX and
word – Accessing, overview of toolbars, saving files, Using help and resources, rulers, format painter in word.
Task 2: Using LaTeX and Word to create project certificate. Features to be covered:- Formatting Fonts in
word, Drop Cap in word, Applying Text effects, Using Character Spacing, Borders and Colors, Inserting
Header and Footer, Using Date and Time option in both LaTeX and Word.
Task 3: Creating project abstract Features to be covered:-Formatting Styles, Inserting table, Bullets and
Numbering, Changing Text Direction, Cell alignment, Footnote, Hyperlink, Symbols, Spell Check, Track
Changes.

Task 4 : Creating a Newsletter : Features to be covered:- Table of Content, Newspaper columns, Images
from files and clipart, Drawing toolbar and Word Art, Formatting Images, Textboxes, Paragraphs and Mail
Merge in word.

Excel
Excel Orientation: The mentor needs to tell the importance of MS office 2007/ equivalent (FOSS) tool Excel
as a Spreadsheet tool, give the details of the four tasks and features that would be covered in each. Using Excel
– Accessing, overview of toolbars, saving excel files, Using help and resources.

Task 1: Creating a Scheduler - Features to be covered: Gridlines, Format Cells, Summation, auto fill,
Formatting Text

Task 2 : Calculating GPA - .Features to be covered:- Cell Referencing, Formulae in excel – average,
std.deviation, Charts, Renaming and Inserting worksheets, Hyper linking, Count function,
LOOKUP/VLOOKUP

Task 3: Performance Analysis - Features to be covered:- Split cells, freeze panes, group and outline, Sorting,
Boolean and logical operators, Conditional formatting

Task 4: Charts and Pivot Tables – Charts, Pivot Tables

Task 5: Conditionals and Lookup Tables - Conditional functions, IF functions, Lookup functions

Task 6: Conditional Formatting and Lists - Conditional formatting, Sorting lists, Filtering lists
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

LaTeX and MS/equivalent (FOSS) tool Power Point

Task1: Students will be working on basic power point utilities and tools which help them create basic power
point presentation. Topic covered during this week includes :- PPT Orientation, Slide Layouts, Inserting Text,
Word Art, Formatting Text, Bullets and Numbering, Auto Shapes, Lines and Arrows in both LaTeX and
Powerpoint. Students will be given model power point presentation which needs to be replicated (exactly how
it’s asked).

Task 2: Second week helps students in making their presentations interactive. Topic covered during this week
includes: Hyperlinks, Inserting –Images, Clip Art, Audio, Video, Objects, Tables and Charts.

Task 3: Concentrating on the in and out of Microsoft power point and presentations in LaTeX. Helps them
learn best practices in designing and preparing power point presentation. Topic covered during this week
includes: - Master Layouts (slide, template, and notes), Types of views (basic, presentation, slide slotter, notes
etc), and Inserting – Background, textures, Design Templates, Hidden slides.

References:

1. Comdex Information Technology course tool kit, Vikas Gupta, WILEY Dreamtech
2. The Complete Computer upgrade and repair book, 3rd Edition, Cheryl A Schmidt, WILEY
Dreamtech
3. Introduction to Information Technology, ITL Education Solutions limited, Pearson
Education.
4. PC Hardware and A+Handbook, Kate J. Chase, PHI (Microsoft)
5. LaTeX Companion, Leslie Lamport, PHI/Pearson.
6. IT Essentials PC Hardware and Software Companion Guide Third Edition by David Anfinson
and Ken Quamme. – CISCO Press, Pearson Education. IT Essentials PC Hardware and Software Labs
and Study Guide Third Edition by Patrick Regan – CISCO Press , Pearson Education. Microsoft Office
2007: The Missing Manual - Chris Grover, Mathew MacDonald, E.A.Vander Veer O’reilly Media
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

CONSTITUTION OF INDIA
Mandatory Course

II Year B.Tech. I-Semester L T P C

2 0 0 0

Course Objectives

Students will be able to:

1. Understand the premises informing the twin themes of liberty and freedom from a civil rights perspective.

2. To address the growth of Indian opinion regarding modern Indian intellectuals’ constitutional role and
entitlement to civil and economic rights as well as the emergence of nationhood in the early years of Indian
nationalism.

3. To address the role of socialism in India after the commencement of the Bolshevik Revolution in 1917 and
its impact on the initial drafting of the Indian Constitution.

Syllabus

Unit1 History of Making of the Indian Constitution- History of Drafting Committee - Philosophy of the Indian
Constitution- Preamble Salient Features

Unit2 Contours of Constitutional Rights & Duties - Fundamental Rights

• Right to Equality
• Right to Freedom
• Right against Exploitation
• Right to Freedom of Religion
• Cultural and Educational Rights
• Right to Constitutional Remedies
• Directive Principles of State Policy
• Fundamental Duties.

Unit 3 Organs of Governance: Parliament, Composition, Qualifications and Disqualifications, Powers and
Functions, Executive,President, Governor, Council of Ministers, Judiciary, Appointment and Transfer of
Judges, Qualifications, Powers and Functions

Unit 4 Local Administration: District’s Administration head: Role and Importance, Municipalities:
Introduction, Mayor and role of Elected Representative, CEO of Municipal Corporation. Panchayat raj:
Introduction, PRI: Zila Panchayat. Elected officials and their roles, CEO ZilaPanchayat: Position and role.
Block level: Organizational Hierarchy (Different departments), Village level: Role of Elected and Appointed
officials, Importance of grass root democracy

Unit 5 Election Commission: Election Commission: Role and Functioning. Chief Election Commissioner and
Election Commissioners. State Election Commission: Role and Functioning. Institute and Bodies for the
welfare of SC/ST/OBC and women.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Course Outcomes

Students will be able to:

1. Discuss the growth of the demand for civil rights in India for the bulk of Indians before the arrival of
Gandhi in Indian politics.

2. Discuss the intellectual origins of the framework of argument that informed the conceptualization of
social reforms leading to revolution in India.

3. Discuss the circumstances surrounding the foundation of the Congress Socialist Party [CSP] under the
leadership of Jawaharlal Nehru and the eventual failure of the proposal of direct elections through adult
suffrage in the Indian Constitution

4. Discuss the passage of the Hindu Code Bill of 1956.

Suggested Reading

1. The Constitution of India, 1950 (Bare Act), Government Publication.

2. Dr. S. N. Busi, Dr. B. R. Ambedkar framing of Indian Constitution, 1st Edition, 2015.

3. M. P. Jain, Indian Constitution Law, 7th Edn., Lexis Nexis, 2014.

4. D.D. Basu, Introduction to the Constitution of India, Lexis Nexis, 2015.

****************
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

APPLIED STATISTICAL METHODS

II Year B.Tech. II-Semester L T P C

3 1 0 4
Pre-requisites: Mathematics courses of first year of study.

Objectives:To learn

1. The theory of Probability, and probability distributions of single and multiple random
variables
2.The sampling theory and testing of hypothesis and making inferences
3.Stochastic process and Markov chains.
UNIT-I: : Probability 8L

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, Joint probability distributions

UNIT-II: Expectation and discrete distributions 10 L

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,

Poisson distribution and the poison process.

UNIT-III: Continuous Distributions and sampling 10 L

Continuous Uniform Distribution, Normal Distribution, Areas under the Normal Curve,
Applications of the Normal Distribution, Normal Approximation to the BinomialDistributions.

Fundamental Sampling Distributions: Random Sampling, Some Important Statistics, Sampling

Distributions, Sampling Distribution of Means and the Central Limit Theorem, t –Distribution, F-
Distribution.

UNIT-IV: One- and Two- samples Estimation & Tests of Hypotheses 10 L

Introduction, Statistical Inference, Classical Methods of Estimation,Single Sample: Estimating the

mean, standard error of a point estimate, prediction interval. Two sample: Estimating the
difference between two means, Single sample: Estimating a proportion, Two samples: Estimating
the difference between two proportions, Single sample: Two samples: Estimating the ratio of two
variances.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Statistical Hypotheses: General Concepts, Testing a Statistical Hypothesis,Single sample: Tests

concerning a single mean, Two samples: tests on two means, One sample: test on a single
proportion. Two samples: tests on two proportions, Two- sample tests concerning variances.

UNIT-V: Stochastic Processes And Markov Chains 10 L

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.

Course outcomes:

After learning the contents of this paper the student must be able to

1. Apply the concepts of probability and distributions to some case studies.

2. Formulate and solve problems involving random variables and apply statistical methods
for analysing experimental data.
3. Apply concept of estimation and testing of hypothesis to some case studies.
4. Correlate the material of one unit to the material in other units.

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
References

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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ECONOMICS AND FINANCIAL ANALYSIS

II Year B.Tech. II-Semester L T P C

3 0 0 3
Course Objective:
To prepare engineering students to analyze cost/ revenue/ financial data and to make economic and
financial analysis in decision making process and to examine the performance of companies engaged
in engineering.

Course Outcome:
To perform and evaluate present and future worth of the alternate projects and to appraise projects
by using traditional and DCF Methods. To carry out cost benefit analysis of projects and to calculate
BEP of different alternative projects.

Unit- I: Macro Economic Concepts : Economics- Micro & Macroeconomics-National Income

Accounting - Methods of Estimation- Various Concepts of National Income - Inflation – Causes of
Inflation and Measures to Control Inflation - New Economic Policy -Industrial policy, Trade policy,
and Fiscal policy and its Impact on Industry-Types of companies-Features.
Unit- II: Introduction to Business Economics- Basic Principles of Economics– Fundamental
Concepts- Demand – Demand Determinants - Law of Demand- Demand Forecasting and Methods-
Elasticity of Demand– Supply- Elasticity of Supply- Theory of Firm.
.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, and Monopolistic Competition.
Pricing: Types of Pricing, Product Life Cycle based Pricing, Break Even Analysis, Cost Volume
Profit Analysis (simple problems).
Unit- IV: Introduction to Accounting: Accounting Principles (GAPP), concepts, conventions- -
Double entry system of Book keeping–Accounting rules- Journal- ledger- Trial balance- Trading and
Profit and Loss account- Balance Sheet. (Simple Problems).
Unit- V: Capital Budgeting Techniques: Significance of Capital Budgeting - cash flows-Time
Value of Money- Choosing between alternative investment proposals- Methods of Appraisal
Techniques- Pay Back Period - Average Rate of Return – Net Present Value- Internal Rate of Return
– Profitability Index(simple problems).
Suggested Readings:
1. Henry Malcom Steinar-Engineering Economics, Principles, McGraw Hill Pub.
2. D.D.Chaturvedi, S.L.Gupta, Business Economics - Theory and Applications, International Book
House Pvt. Ltd. 2013.
3. Jain and Narang” Accounting, Kalyani Publishers.
4. Arora, M.N.” Cost Accounting, Vikas Publication.
5. S.N.Maheshwari, Financial Management, Vikas Publishing House.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

OPERATING SYSTEMS

II Year B.Tech. II-Semester L T P C

3 0 0 3

Prerequisites
1. A course on “Computer Programming and Data Structures”
2. A course on “Computer Organization and Architecture”
Objectives

1. Provide an introduction to operating system concepts (i.e., processes, threads, scheduling,

synchronization, deadlocks, memory management, file and I/O subsystems and protection)
2. Introduce the issues to be considered in the design and development of operating system
3. Introduce basic Unix commands, system call interface for process management, interprocess
communication and I/O in Unix
Outcomes

1. Will be able to control access to a computer and the files that may be shared
2. Demonstrate the knowledge of the components of computer and their respective roles in computing.
3. Ability to recognize and resolve user problems with standard operating environments.
4. Gain practical knowledge of how programming languages, operating systems, and architectures interact
and how to use each effectively.

UNIT - I

Introduction to Operating System, 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 Inter process 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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.

Textbooks:

1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th Edition, John
Wiley
2. Advanced programming in the Unix environment, W.R.Stevens, Pearson education.

References:

1. Operating Systems – Internals and Design Principles, Stallings, 5th Edition, Pearson Education/PHI,
2005.
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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DATABASE MANAGEMENT SYSTEMS

II Year B.Tech. II-Semester L T P C

3 0 0 3

Prerequisites
1. A course on “Data Structures”
Objectives

1. To understand the basic concepts and the applications of database systems.

2. To master the basics of SQL and construct queries using SQL.
3. Topics include data models, database design, relational model, relational algebra, transaction
control, concurrency control, storage structures and access techniques.
Outcomes

1. Gain knowledge of fundamentals of DBMS, database design and normal forms

2. Master the basics of SQL for retrieval and management of data.
3. Be acquainted with the basics of transaction processing and concurrency control.
4. Familiarity with database storage structures and access techniques
UNIT - I
Database System Applications: A Historical Perspective, File Systems versus DBMS, the Data Model,
Levels of Abstraction in DBMS, Data Independence, Structure of 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, deleting/altering tables and views.

Relational Algebra, Tuple relational Calculus, Domain relational calculus.

UNIT - III
SQL Queries, Constraints, Triggers: 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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.

Textbooks:
1. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata Mc Graw Hill 3rd
Edition
2. Database System Concepts, Silberschatz, Korth, Mc Graw hill, V edition.

References:

1. Database Systems design, Implementation, and Management, Peter Rob & Carlos Coronel, 7 th
Edition.
2. SQL The Complete Reference, James R. Groff, Paul N. Weinberg, 3 rd Edition,
3. Oracle for Professionals, The X Team, S.Shah and V. Shah, SPD.
4. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL,Shah,PHI.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DESIGN AND ANALYSIS OF ALGORITHMS

II Year B.Tech. II-Semester L T P C

3 0 0 3

Prerequisites
1. A course on “Computer Programming and Data Structures”
2. A course on “Advanced Data Structures”
Objectives
1. Introduces the notations for analysis of the performance of algorithms.
2. Introduces the data structure disjoint sets.
3. Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic
programming, greedy, branch and bound methods) and mention problems for which each technique
is appropriate;
4. Describes how to evaluate and compare different algorithms using worst-, average-, and best-
case analysis.
5. Explains the difference between tractable and intractable problems, and introduces the
problems that are P, NP and NP complete.

Outcomes
1. Ability to analyze the performance of algorithms
2. Ability to choose appropriate data structures and algorithm design methods for a specified
application
3. 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’s matrix
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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard and NP-
Complete classes, Cook’s theorem.

Textbook:
1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and Rajasekharan,University
Press.

References:
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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

OPERATING SYSTEMS LAB

(Using UNIX/LINUX)

II Year B.Tech. II-Semester L T P C

0 0 3 1.5

Prerequisites
1. A course on “Programming for Problem Solving”
2. A course on “Computer Organization and Architecture”

Co-requisite
1. A course on “Operating Systems”

Objectives
1. To provide an understanding of the design aspects of operating system concepts through
simulation
2. Introduce basic Unix commands, system call interface for process management, interprocess
communication and I/O in Unix

Outcomes

1. Simulate and implement operating system concepts such as scheduling, deadlock

management, file management and memory management.
2. Able to implement C programs using Unix system calls

List of Experiments
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

Textbooks:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th
Edition, John Wiley
2. Advanced programming in the Unix environment, W.R.Stevens, Pearson education.

References:
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. / Pearson Education
5. Unix Internals The New Frontiers, U.Vahalia, Pearson Education
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DATABASE MANAGEMENT SYSTEMS LAB

II Year B.Tech. II-Semester L T P C

0 0 3 1.5

Co-requisites
1. Co-requisite of course “Database Management Systems”

Objectives
1. Introduce ER data model, database design and normalization
2. Learn SQL basics for data definition and data manipulation

Outcomes
1. Design database schema for a given application and apply normalization
2. Acquire skills in using SQL commands for data definition and data manipulation.
3. 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
Textbooks:
1. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata Mc Graw Hill 3rd
Edition
2. Database System Concepts, Silberschatz, Korth, Mc Graw hill, V edition.

References:

1. Database Systems design, Implementation, and Management, Peter Rob & Carlos Coronel, 7 th
Edition.
2. SQL The Complete Reference, James R. Groff, Paul N. Weinberg, 3 rd Edition,
3. Oracle for Professionals, The X Team, S.Shah and V. Shah, SPD.
4. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL,Shah,PHI.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

JAVA PROGRAMMING AND ALGORITHMS LAB

II Year B.Tech. II-Semester L T P C

0 1 2 2
Prerequisites
1. A Course on “Data Structures”
2. A Course on “Objected Oriented Programming through Java”

Objectives
1. It covers various concepts of java programming language
2. It introduces searching and sorting algorithms
3. It introduces the feasible and optimal solutions by using the different design methods

Outcomes
1. Develop the feasible and optimal solutions by using Greedy and dynamic programming.
2. Able to design the searching algorithms

Java programming:
1. Write a program to implement Abstraction
2. Write a program to implement Inheritance
3. Write a program to implement Polymorphism
4. Write a program to implement Encapsulation
5. Write a program to implement Methods in Java
• Static, Abstract and Final
6. Write a program to implement Multi threading
7. Write a program to implement String Reverse

Algorithms:
1. Write a program to implement n-Queen’s problem
2. Write a program to implement Optimal Binary Search Tree
3. Write a program to implement 0/1 Knapsack problem by using Dynamic Programming
4. Write a program to implement Greedy Knapsack problem
5. Write a program to implement Prim’s minimum cost spanning tree by using Greedy Method
6. Write a program to implement Kruskal’s minimum cost spanning tree by using Greedy Method
7. Write a program to implement Job sequencing with deadlines by using Greedy Method
8. Write a program to implement Single source shortest path problem by using Greedy Method

Textbooks:
1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and Rajasekharan,University
Press.
References:
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
4. Java The Complete Reference, Herbert Schildt’s, 9th Edition, TATA McGRAW – HILL.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ENVIRONMENTAL SCIENCE

II Year B.Tech. II-Semester L T P C

2 0 0 0
Course Objectives:

• Understanding the importance of ecological balance for sustainable development.

• Understanding the impacts of developmental activities and mitigation measures.
• Understanding the environmental policies and regulations

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

UNIT-I
Ecosystems: Definition, Scope, and Importance of ecosystem. Classification, structure, and function of an
ecosystem, Food chains, food webs, and ecological pyramids. Flow of energy, Biogeochemical cycles,
Bioaccumulation, Biomagnification, ecosystem value, services and carrying capacity. Structural features,
Biotic structure, Abiotic structure, Ecological succession, Types of Ecosystems, Field visits.

UNIT-II
Natural Resources: Classification of Resources: Living and Non-Living resources, water resources: use
and over utilization of surface and ground water, floods and droughts, Dams: benefits and problems.
Mineral resources: use and exploitation, environmental effects of extracting and using mineral resources,
Land resources: Forest resources, Energy resources: growing energy needs, renewable and non
renewable energy sources, use of alternate energy source, case studies. Food recourses: Desertification,
Equitable use of resource for sustainable use style.

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

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. Landslides, floods,
cyclones. Noise Pollution: Sources and Health hazards, standards, Thermal pollution: Introduction,
causes and consequences. Solid waste: Municipal Solid Waste management, composition and
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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 Issues
and Global Efforts: Climate change and impacts on human environment. Ozone depletion and Ozone
depleting substances (ODS). Deforestation and desertification. International conventions / Protocols: Earth
summit, Kyoto protocol, and Montréal Protocol. NAPCC-GoI Initiatives.

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 Goals, 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 R. Rajagopalan, Oxford University Press.

REFERENCE BOOKS:
1. Environmental Science: towards a sustainable future by Richard T. Wright. 2008 PHL Learning Private
Ltd. New Delhi.
2. Environmental Engineering and science by Gilbert M. Masters and Wendell P. Ela. 2008 PHI Learning
Pvt. Ltd.
3. Environmental Science by Daniel B. Botkin & Edward A. Keller, Wiley INDIA edition.
4. Environmental Studies by Anubha Kaushik, 4th Edition, New age international publishers.
5. Text book of Environmental Science and Technology - Dr. M. Anji Reddy 2007, BS Publications.
6. Introduction to Environmental Science by Y. Anjaneyulu, BS.Publications.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

FORMAL LANGUAGES AND AUTOMATA THEORY

III Year B.Tech. I-Semester L T P C

3 0 0 3
Objectives
1. To provide introduction to some of the central ideas of theoretical computer science from the
perspective of formal languages.
2. To introduce the fundamental concepts of formal languages, grammars and automata theory.
3. Classify machines by their power to recognize languages.
4. Employ finite state machines to solve problems in computing.
5. To understand deterministic and non-deterministic machines.
6. To understand the differences between decidability and undecidability.

Outcomes
1. Able to understand the concept of abstract machines and their power to recognize the languages.
2. Able to employ finite state machines for modeling and solving computing problems.
3. Able to design context free grammars for formal languages.
4. Able to distinguish between decidability and undecidability.
5. 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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.

Textbooks:

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.

References:

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, 3 rd edition, Cengage Learning.
5. Introduction to Formal languages Automata Theory and Computation, Kamala Krithivasan, Rama R,
Pearson.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

COMPUTER NETWORKS

III Year B.Tech. I-Semester L T P C

3 1 0 4
Prerequisites
1. A course on “Programming for problem solving”
2. A course on “Data Structures”
Objectives
1. The objective of the course is to equip the students with a general overview of the concepts and
fundamentals of computer networks.
2. 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.
Outcomes
1. Gain the knowledge of the basic computer network technology.
2. Gain the knowledge of the functions of each layer in the OSI and TCP/IP reference model.
3. Obtain the skills of subnetting and routing mechanisms.
4. 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-free
channel, 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 protocol
using 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, TCP and
UDP protocols.
UNIT - V
Application Layer –Domain name system, SNMP, Electronic Mail; the World WEB, HTTP, Streaming audio
and video.
Textbook:
1. Computer Networks, Andrew S Tanenbaum, David. j. Wetherall, 5 th Edition. Pearson Education/PHI
References:
1. An Engineering Approach to Computer Networks, S.Keshav, 2nd Edition, Pearson Education
2. Data Communications and Networking – Behrouz A. Forouzan. 3rd Edition, TMH.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

MACHINE LEARNING

III Year B.Tech. CSE I-Semester L T P C

3 1 0 4

Prerequisites
1. A Course on “Data Structures”
2. Knowledge on statistical methods
Objectives
1. This course explains machine learning techniques such as decision tree learning, Bayesian learning etc.
2. To understand computational learning theory.
3. To study the pattern comparison techniques.

Outcomes
1. Understand the concepts of computational intelligence like machine learning
2. Ability to get the skill to apply machine learning techniques to address the real time problems in different
areas
3. 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 neural
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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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 neighbour algorithm, locally weighted regression, radial
basis functions, case-based reasoning, remarks on lazy and eager learning.

UNIT- IV
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.

Textbook:
1. Machine Learning, Tom M. Mitchell, vMcGraw-Hill

References:

1. Machine Learning: An Algorithmic Perspective, Stephen Marshland, Taylor & Francis

Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

INFORMATION THEORY & CODING

(Professional Elective - I)

III Year B.Tech. I-Semester L T P C

3 0 0 3

Prerequisite
1. A Course on “Digital Communications”

Objectives:
1. To acquire the knowledge in measurement of information and errors.
2. Understand the importance of various codes for communication systems
3. To design encoder and decoder of various codes.
4. To known the applicability of source and channel codes

Outcomes:
1. Learn measurement of information and errors.
2. Obtain knowledge in designing various source codes and channel codes
3. Design encoders and decoders for block and cyclic codes
4. Understand the significance of codes in various applications

UNIT - I
Coding for Reliable Digital Transmission and storage
Mathematical model of Information, A Logarithmic Measure of Information, Average and Mutual Information
and Entropy, Types of Errors, Error Control Strategies.
Source Codes: Shannon-fano coding, Huffman coding

UNIT - II
Linear Block Codes: Introduction to Linear Block Codes, Syndrome and Error Detection, Minimum Distance
of a Block code, Error-Detecting and Error-correcting Capabilities of a Block code, Standard array and
Syndrome Decoding, Probability of an undetected error for Linear Codes over a BSC, Hamming Codes.
Applications of Block codes for Error control in data storage system

UNIT - III
Cyclic Codes : Description, Generator and Parity-check Matrices, Encoding, Syndrome Computation and
Error Detection, Decoding ,Cyclic Hamming Codes, Shortened cyclic codes, Error-trapping decoding for
cyclic codes, Majority logic decoding for cyclic codes.

UNIT - IV
Convolutional Codes : Encoding of Convolutional Codes- Structural and Distance Properties, state, tree,
trellis diagrams, maximum likelihood decoding, Sequential decoding, Majority- logic decoding of
Convolution codes. Application of Viterbi Decoding and Sequential Decoding, Applications of Convolutional
codes in ARQ system.

UNIT - V
BCH Codes: Minimum distance and BCH bounds, Decoding procedure for BCH codes, Syndrome
computation and iterative algorithms, Error locations polynomials for single and double error correction.

Textbooks:
1. Error Control Coding- Fundamentals and Applications –Shu Lin, Daniel J.Costello,Jr, Prentice
Hall, Inc 2014.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

2. Error Correcting Coding Theory-Man Young Rhee, McGraw – Hill Publishing 1989
References:

1. Digital Communications, John G. Proakis, 5th Edition, TMH 2008.

2. Introduction to Error Control Codes, Salvatore Gravano, Oxford
3. Error Correction Coding – Mathematical Methods and Algorithms, Todd K.Moon, 2006, Wiley India.
4. Information Theory, Coding and Cryptography – Ranjan Bose, 2nd Edition, 2009, TMH.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ADVANCED COMPUTER ARCHITECTURE

(Professional Elective - I)

III Year B.Tech. I-Semester L T P C

3 0 0 3

Prerequisites: A Course on “Computer Organization”

Objectives

1. To impart the concepts and principles of parallel and advanced computer architectures.
2. To develop the design techniques of Scalable and multithreaded Architectures.
3. To Apply the concepts and techniques of parallel and advanced computer architectures to design modern
computer systems

Outcomes
Gain knowledge of
1. Computational models and Computer Architectures.
2. Concepts of parallel computer models.
3. Scalable Architectures, Pipelining, Superscalar processors, multiprocessors

UNIT - I
Theory of Parallelism, Parallel computer models, The State of Computing, Multiprocessors and
Multicomputers, Multivector and SIMD Computers, PRAM and VLSI models, Architectural development
tracks, Program and network properties, Conditions of parallelism, Program partitioning and Scheduling,
Program flow Mechanisms, System interconnect Architectures.

UNIT - II
Principals of Scalable performance, Performance metrics and measures, Parallel Processing applications,
Speed up performance laws, Scalability Analysis and Approaches, Hardware Technologies, Processes and
Memory Hierarchy, Advanced Processor Technology, Superscalar and Vector Processors, Memory Hierarchy
Technology, Virtual Memory Technology.

UNIT - III
Bus Cache and Shared memory, Backplane bus systems, Cache Memory organizations, Shared-Memory
Organizations, Sequential and weak consistency models, Pipelining and superscalar techniques, Linear
Pipeline Processors, Non-Linear Pipeline Processors, Instruction Pipeline design, Arithmetic pipeline design,
superscalar pipeline design.

UNIT - IV
Parallel and Scalable Architectures, Multiprocessors and Multicomputers, Multiprocessor system
interconnects, cache coherence and synchronization mechanism, Three Generations of Multicomputers,
Message-passing Mechanisms, Multivetor and SIMD computers, Vector Processing Principals, Multivector
Multiprocessors, Compound Vector processing, SIMD computer Organizations, The connection machine CM-
5,
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT - V
Scalable, Multithreaded and Dataflow Architectures, Latency-hiding techniques, Principals of Multithreading,
Fine-Grain Multicomputers, Scalable and multithreaded Architectures, Dataflow and hybrid Architectures.

Textbook:
1. Advanced Computer Architecture, Kai Hwang, 2nd Edition, Tata McGraw Hill Publishers.

References:
1. Computer Architecture, J.L.Hennessy and D.A. Patterson, 4 th Edition, ELSEVIER.
2. Advanced Computer Architectures, S.G.Shiva, Special Indian edition, CRC,Taylor &Francis.
3. Introduction to High Performance Computing for Scientists and Engineers, G.Hager and G.Wellein,
CRC Press, Taylor & Francis Group.
4. Advanced Computer Architecture, D.Sima, T .Fountain, P.Kacsuk, Pearson education.
5. Computer Architecture, B.Parhami, Oxford Univ. Press.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DATA MINING & WAREHOUSING

(Professional Elective - I)

III Year B.Tech. I-Semester L T P C

3 0 0 3

Prerequisites
1. A course on “Database Management Systems”
2. Knowledge of probability and statistics

Objectives
1. It presents methods for mining frequent patterns, associations, and correlations.
2. It then describes methods for data classification and prediction, and data–clustering approaches.
3. It covers mining various types of data stores such as spatial, textual, multimedia, streams.

Outcomes
1. Ability to understand the types of the data to be mined and present a general classification of tasks
and primitives to integrate a data mining system.
2. Apply preprocessing methods for any given raw data.
3. Extract interesting patterns from large amounts of data.
4. Discover the role played by data mining in various fields.
5. Choose and employ suitable data mining algorithms to build analytical applications
6. Evaluate the accuracy of supervised and unsupervised models and algorithms.

UNIT - I
Data Mining
Data–Types of Data–, Data Mining Functionalities– Interestingness Patterns–Classification of Data Mining
systems– Data mining Task primitives –Integration of Data mining system with a Data warehouse–Major
issues in Data Mining–Data Preprocessing.

UNIT – II
Association Rule Mining
Mining Frequent Patterns–Associations and correlations– Mining Methods– Mining Various kinds of
Association Rules– Correlation Analysis– Constraint based Association mining. Graph Pattern Mining, SPM.

UNIT – III
Classification
Classification and Prediction– Basic concepts–Decision tree induction–Bayesian classification, Rule–based
classification, Lazy learner.

UNIT – IV
Clustering And Applications
Cluster analysis–Types of Data in Cluster Analysis–Categorization of Major Clustering Methods– Partitioning
Methods,–Hierarchical Methods– Density–Based Methods,–Grid–Based Methods, Outlier Analysis.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT - V
Advanced Concepts
Basic concepts in Mining data streams–Mining Time–series data––Mining sequence patterns in Transactional
databases–.Mining Object– Spatial– Multimedia–Text and Web data– Spatial Data mining– Multimedia Data
mining–Text Mining– Mining the World Wide Web.

Textbooks:
1. Data Mining – Concepts and Techniques – Jiawei Han & Micheline Kamber, 3rd Edition Elsevier.
2. Data Mining Introductory and Advanced topics –Margaret H Dunham, PEA.
References:

1. Data Mining: Practical Machine Learning Tools and Techniques, Ian H. Witten and Eibe Frank, 2nd
Edition, Morgan Kaufmann, 2005.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DIGITAL IMAGE PROCESSING

(Professional Elective - I)

III Year B.Tech. I-Semester L T P C

3 0 0 3

Prerequisites
1. 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.
2. A course on “Computational Mathematics”
3. A course on “Computer Oriented Statistical Methods”

Objectives

1. Provide a theoretical and mathematical foundation of fundamental Digital Image Processing concepts.
2. The topics include image acquisition; sampling and quantization; preprocessing; enhancement;
restoration; segmentation; and compression.

Outcomes

1. Demonstrate the knowledge of the basic concepts of two-dimensional signal acquisition, sampling,
and quantization.
2. Demonstrate the knowledge of filtering techniques.
3. Demonstrate the knowledge of 2D transformation techniques.
4. 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Textbook:
1. Digital Image Processing: R.C. Gonzalez & R.E. Woods, 2 nd Edition, Addison Wesley/ Pearson
Education, 2004.
References:
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, 3rd Edition, John Wilely, 2004.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

GRAPH DATABASES
(Professional Elective-I)

III Year B.Tech. CSE I-Semester L T P C

3 0 0 3
Unit I
Introduction, What Is a Graph?, A High-Level View of the Graph Space, Graph Databases, Graph Compute
Engines, The Power of Graph Databases, Performance, Flexibility, Agility

Options for Storing Connected Data, Relational Databases Lack Relationships, NOSQL Databases Also
Lack Relationships, Graph Databases Embrace Relationships

Unit II
Data Modeling with Graphs, Models and Goals, The Labeled Property Graph Model

Querying Graphs: An Introduction to Cypher, Cypher Philosophy, MATCH, RETURN, Other Cypher
Clauses, A Comparison of Relational and Graph Modeling, Relational Modeling in a Systems Management
Domain, Graph Modeling in a Systems Management Domain,Testing the Model

Unit III
Cross-Domain Models, Creating the Shakespeare Graph, Beginning a Query, Declaring Information Patterns
to Find, Constraining Matches, Processing Results,Query Chaining,Common Modeling Pitfalls, Email
Provenance Problem Domain, A Sensible First Iteration?, Second Time’s the Charm, Evolving the Domain ,
Identifying Nodes and Relationships, Avoiding Anti-Patterns

Unit IV
Building a Graph Database Application, Data Modeling, Describe the Model in Terms of the Application’s
Needs, Nodes for Things, Relationships for Structure, Fine-Grained versus Generic Relationships, Model
Facts as Nodes, Represent Complex Value Types as Nodes, Time, Iterative and Incremental Development,
Application Architecture, Embedded versus Server, Clustering, Load Balancing, Testing, Test-Driven Data
Model Development, Performance Testing, Capacity Planning Optimization, Criteria, Performance,
Redundancy, Load, Importing and Bulk Loading Data, Initial Import, Batch Import

Unit V
Graphs in the Real World, Why Organizations Choose Graph Databases, Common Use Cases, Social, Geo
Master Data Management, Network and Data Center Management, Authorization and Access Control
(Communications), Real-World Examples, Social Recommendations (Professional Social Network),
Authorization and Access Control, Geospatial and Logistics

Graph Database Internals, Native Graph Processing, Native Graph Storage, Programmatic APIs, Kernel API,
Core API, Traversal Framework, Nonfunctional Characteristics, Transactions, Recoverability, Availability,
Scale

Textbooks:

1. Graph Databases, 2nd Edition, by Ian Robinson, Jim Webber, Emil Eifrem, June 2015, Publisher(s): O'Reilly
Media, Inc., ISBN: 9781491930892
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

INTERNET OF THINGS
(Professional Elective - II)

III Year B.Tech. CSE I-Semester L T P C

3 0 0 3
Objectives
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
Outcomes
1. Interpret the impact and challenges posed by IoT networks leading to new architectural models.
2. Compare and contrast the deployment of smart objects and the technologies to connect them to
network.
3. Appraise the role of IoT protocols for efficient network communication.
4. Elaborate the need for Data Analytics and Security in IoT.
5. 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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

Textbooks:

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
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SPEECH & VIDEO PROCESSING

(Professional Elective - II)

III Year B.Tech. CSE I-Semester L T P C

3 0 0 3
Unit I: Speech processing concepts
The speech production mechanism, Discrete time speech signals, Pole-Zero modeling of speech , relevant
properties of the fast Fourier transform for speech recognition, convolution, linear and non linear filter banks,
spectral estimation of speech using DFT. Linear Prediction analysis of speech.
Unit II : Speech recognition
Real and Complex Cepstrum, application of cepstral analysis to speech signal, feature extraction for speech,
static and dynamic feature for speech recognition, robustness issues, discrimination in the feature space,
feature selection, MFCC, LPCC, Distance measures, vector quantization models. Gaussian Mixture model,
HMM.
Unit III: Basics of Video Processing
Video formation, perception and representation: Principle of color video, video cameras, video display,
pinhole model, CAHV model, Camera motion, Shape model, motion model, Scene model, two dimensional
motion models. Three Dimensional Rigid Motion, Approximation of projective mapping.
Unit IV: Motion estimation Techniques
Optical flow, motion representation, motion estimation criteria, optimization methods, pixel based motion
estimation, Block matching algorithm, gradient Based, Intensity matching, feature matching, frequency
domain motion estimation, Depth from motion.
Motion analysis applications: Video Summarization, video surveillance.
Unit V: object tracking and segmentation
2D and 3D video tracking, blob tracking, kernel based counter tracking, feature matching, filtering
Mosaicing, video segmentation, mean shift based, active shape model, video short boundary detection.
Interframe compression, Motion compensation,

Text Books:
1. Digital Video processing, A Murat Tekalp, Prentice Hall.
2. Fundamentals of Speech recognition – L. Rabiner and Juang, Prentice Hall signal processing series
3. Discrete-time speech signal processing: principles and practice, Thomas F. Quatieri, Coth.
4. Video Processing and Communications, Yao Wang, J. Osternann and Qin Zhang, Pearson Education

Reference Books:
1. “Speech and Audio Signal Processing”, B.Gold and N. Morgan, Wiley.
2. “Digital image sequence processing, Compression, and analysis”, Todd R. Reed, CRC Press
3 “Handbook of Image and Video processing”, Al Bovik, Academic press, second Edition

Course Outcomes:
1. The student will be able to1. Describe the mechanisms of human speech production system and methods
for speech enhancement.
2. Understand basic algorithms of speech analysis and speech recognition.
3. Explain basic techniques in digital video processing, including imaging characteristics and sensors.
4. Apply motion estimation and object tracking algorithms on video sequence.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

PARALLEL COMPUTING
(Professional Elective - II)

III Year B.Tech. CSE I-Semester L T P C

3 0 0 3
Prerequisites
1. A Course on “Computer Organization & Architecture”
2. A Course on “Operating Systems”
3. A Course on “Computer Programming”
Objectives
1. To introduce the foundations of parallel Computing
2. To learn various parallel computing architectures and programming models
3. To gain knowledge of writing efficient parallel programs
Outcomes
1. Ability to understand the concepts of parallel architectures
2. Ability to select the data structures that efficiently model the information in a problem.
3. Ability to develop an efficient parallel algorithm to solve it.
4. Ability to implement an efficient and correct code to solve it, analyse its performance
UNIT - I
Parallel Computing
Introduction, Motivation and scope - Parallel Programming Platforms – Basic Communication
Operations
UNIT - II
Principles of Parallel Algorithm Design
Analytical Modelling of Parallel Programs
UNIT - III
Programming using Message Passing Paradigm(MPI)
Programming Shared Address Space Platforms(PThreads)
UNIT - IV
Dense Matric Algorithms ( Matrix-Vector Multiplication , Matrix-Matrix Multiplication)
Sorting Algorithms ( Issues, Bubble Sort, Quick Sort, Bucket Sort, Enumeration Sort, Radix Sort)
UNIT - V
Graph Algorithms ( Minimum Spanning Tree: Prim's Algorithm
Single-Source Shortest Paths: Dijkstra's Algorithm ) Search Algorithms ( DFS, BFS)
Textbook
1. Introduction to Parallel Computing, Second Edition, Ananth Grama, George Karypis,
Vipin Kumar, Anshul Gupta, Addison-Wesley, 2003, ISBN: 0201648652

References
1. Parallel Computing – Theory and Practice, Second Edition, Michaek J. Quinn, Tata McGraw-
Hill Edition.
2. Parallel Computers – Architectures and Programming, V. Rajaraman, C. Siva Ram Murthy,PHI.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ADVANCED DATABASES
(Professional Elective - II)

III Year B.Tech. CSE I-Semester L T P C

3 0 0 3
Prerequisites
1. A course on “Database Management Systems”

Objectives
1. The purpose of the course is to enrich the previous knowledge of database systems and exposing the
need for distributed database technology to confront with the deficiencies of the centralized
database systems.
2. Introduce basic principles and implementation techniques of distributed database systems.
3. Equip students with principles and knowledge of parallel and object oriented databases.
4. Topics include distributed DBMS architecture and design; query processing and optimization;
distributed transaction management and reliability; parallel and object database management
systems.

Outcomes
1. Understand theoretical and practical aspects of distributed database systems.
2. Study and identify various issues related to the development of distributed database system.
3. Understand the design aspects of object oriented database system and related development.

UNIT - I
Introduction; Distributed Data Processing, Distributed Database System, Promises of DDBSs, Problem
areas.

Distributed DBMS Architecture: Architectural Models for Distributed DBMS, DDMBS Architecture.

Distributed Database Design: Alternative Design Strategies, Distribution Design issues, Fragmentation,
Allocation.

UNIT - II
Query processing and decomposition: Query processing objectives, characterization of query processors,
layers of query processing, query decomposition, localization of distributed data.

Distributed query Optimization: Query optimization, centralized query optimization, distributed query
optimization algorithms.

UNIT - III
Transaction Management: Definition, properties of transaction, types of transactions, distributed
concurrency control: serializability, concurrency control mechanisms & algorithms, time - stamped &
optimistic concurrency control Algorithms, deadlock Management.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT - IV
Distributed DBMS Reliability: Reliability concepts and measures, fault-tolerance in distributed systems,
failures in Distributed DBMS, local & distributed reliability protocols, site failures and network partitioning.

Parallel Database Systems: Parallel database system architectures, parallel data placement, parallel query
processing, load balancing, database clusters.

UNIT - V
Distributed object Database Management Systems: Fundamental object concepts and models, object
distributed design, architectural issues, object management, distributed object storage, object query
Processing.

Object Oriented Data Model : Inheritance, object identity, persistent programming languages,
persistence of objects, comparison OODBMS and ORDBMS

Textbooks:

1. Principles of Distributed Database Systems, M.Tamer OZSU and Patuck Valduriez, Pearson Edn.
Asia, 2001.

2. Distributed Databases, Stefano Ceri and Giuseppe Pelagatti, McGraw Hill.

References:

1. Database Systems: The Complete Book, Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom, 2nd
Edition, Pearson International Edition
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

COMPUTER GRAPHICS
(Professional Elective - II)

III Year B.Tech. CSE I-Semester L T P C

3 0 0 3
Prerequisites
1. Familiarity with the theory and use of coordinate geometry and of linear algebra such as matrix
multiplication.
2. A course on “Computer Programming and Data Structures”

Objectives
1. The aim of this course is to provide an introduction of fundamental concepts and theory of computer
graphics.
2. 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;

Outcomes
1. Acquire familiarity with the relevant mathematics of computer graphics.
2. Be able to design basic graphics application programs, including animation
3. 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 work stations and input devices

Output primitives: Points and lines, line drawing algorithms (Bresenham’s and DDA Algorithm), midpoint
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 systems

2-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
3-D 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT - IV
3-D 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

Textbooks:

1. Computer Graphics C version, Donald Hearn and M.Pauline Baker, Pearson Education
nd
2. Computer Graphics Principles & practice, 2 Edition in C, Foley, VanDam, Feiner
and Hughes, Pearson Education.
3. Computer Graphics, Steven Harrington, TMH

References:

1. Procedural elements for Computer Graphics, David F Rogers, 2 nd Edition, Tata Mc Graw Hill.
2. Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH.
3. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

MACHINE LEARNING WITH PYTHON LAB

III Year B.Tech. CSE I-Semester L T P C
0 1 2 2

Objective
1. To get an overview of the various machine learning techniques and can able to demonstrate them
using python.

Outcomes
1. Understand complexity of Machine Learning algorithms and their limitations;
2. Understand modern notions in data analysis oriented computing;
3. Be capable of confidently applying common Machine Learning algorithms in practice and
implementing their own;
4. 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 neighbours 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
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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

Textbooks:

1. Machine Learning, Tom M. Mitchell,vMcGraw-Hill

2. A Complete Introduction to the Python Language, Mark Summerfield, 2 nd Edition.
3. Python The Complete Reference, Martin C. Brown, Brandon A. Nordin.

Reference:

1. Machine Learning: An Algorithmic Perspective, Stephen Marshland, Taylor & Francis

Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

COMPUTER NETWORKS LAB

III Year B.Tech. CSE I-Semester L T P C

0 1 2 2

Objectives
1. To understand the working principle of various communication protocols.
2. To understand the network simulator environment and visualize a network topology and observe its
performance
3. To analyze the traffic flow and the contents of protocol frames
Outcomes
1. Implement data link layer farming methods
2. Analyze error detection and error correction codes.
3. Implement and analyze routing and congestion issues in network design.
4. Implement Encoding and Decoding techniques used in presentation layer
5. 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 bit stuffing.
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

Textbook:
1. Computer Networks, Andrew S Tanenbaum, David. j. Wetherall, 5 th Edition. Pearson Education/PHI

References:
1. An Engineering Approach to Computer Networks, S.Keshav, 2nd Edition, Pearson Education
2. Data Communications and Networking – Behrouz A. Forouzan. 3rd Edition, TMH.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ADVANCED ENGLISH COMMUNICATION SKILLS (AECS) LAB

III Year B.Tech. CSE I-Semester L T P C

0 0 2 1

1. Introduction
The introduction of the Advanced Communication Skills Lab is considered essential at 3 rd 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 professional and interpersonal communication in the globalised context.

The proposed course should be a laboratory course to enable students to use ‘good’ English 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.

2. 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 by educated English speakers 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.

3. 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
one’s writing.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

4. Activities on Presentation Skills – Oral presentations (individual and group) through JAM
sessions/seminars/PPTs and written presentations through posters/projects/reports/ e-
mails/assignments etc.
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.
4. Minimum Requirement:
The Advanced English Communication Skills (AECS) 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 Dreamtech
• TOEFL & GRE( KAPLAN, AARCO&BARRONS, USA, Cracking GRE by CLIFFS)

Books Recommended:
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
3. Learn Correct English – A Book of Grammar, Usage and Composition by Shiv K. Kumar and Hemalatha
Nagarajan. Pearson 2007
4. Professional Communication by Aruna Koneru, McGraw Hill Education (India) Pvt. Ltd, 2016.
5. Technical Communication by Meenakshi Raman & Sangeeta Sharma, Oxford University Press 2009.
6. Technical Communication by Paul V. Anderson. 2007. Cengage Learning pvt. Ltd. New Delhi.
7. English Vocabulary in Use series, Cambridge University Press 2008.
8. Handbook for Technical Communication by David A. McMurrey& Joanne Buckley. 2012. Cengage
Learning.
9. Communication Skills by Leena Sen, PHI Learning Pvt Ltd., New Delhi, 2009.
10. Job Hunting by Colm Downes, Cambridge University Press 2008.
11. English for Technical Communication for Engineering Students, Aysha Vishwamohan, Tata Mc Graw-
Hil 2009.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

AUTHENTICATION TECHNIQUES
(Mandate Course)

III Year B.Tech. CSE I-Semester L T P C

2 0 0 0
Unit-1:Definition of Authentication, Identification/verification, Stages and steps of authentication,
Authentication Entity : User, Device and Application; Authentication attributes: Source, Location,
Path, Time duration etc.; Authentication Types : Direct / Indirect, One Way / Mutual, On demand/
Periodic/ Dynamic/Continuous authentication, Assisted/Automatic; 3 Factors of authentication;
Passwords, Generation of passwords of varied length and of mixed type, OTP, passwords generation
using entity identity credentials; Secure capture, processing, storage, verification and retrieval of
passwords;

Unit-2:Physical identification using smart cards, remote control device, proximity sensors,
surveillance camera, authentication in Card present / Card Not Present transactions as ATM/ PoS
Device, mobile phone, wearable device and IoT device based authentication; single sign-on;
Symmetric Key Generation, Key Establishment, Key Agreement Protocols;

Unit-3: Biometrics – photo, face, iris, retinal, handwriting, signature, fingerprint, palm print, hand
geometry, voice – Text based and text independent voice authentication, style of talking, walking,
writing, keystrokes, gait etc. multi-modal biometrics.

Unit-4: Matching algorithms, Patterns analysis,errors, performance measures, ROC Curve;

Authentication Standards – International, UIDAI Standard. Kerberos, X.509 Authentication Service,
Public Key Infrastructure, Scanners and Software; Web Authentication Methods: Http based, Token
Based, OAuthand API.

Unit-5: User authentication protocols in multi-server environment, BAN Logic, Representation of

authentication protocols using BAN Logic, Random Oracle Model, Scyther Tools, Proverif tool,
Chebyshev Chaotic Map, Fuzzy Extractor, Fuzzy Extractor Map, Bloom Filter, LU Decomposition
based User Authentication, Blockchain based authentication.
Reference Books:

1. Protocols for Authentication and Key Establishment, Colin Boyd and Anish Mathuria,
springer, 2021
2. Guide to Biometrics,Ruud M.Bolle,SharathPankanti, Nalini K. Ratha,Andrew W. Senior,
Jonathan H. Connell,Springer 2009.
3. Digital Image Processing using MATLAB, Rafael C. Gonzalez, Richard Eugene Woods,
2nd Edition, Tata McGraw-Hill Education 2010.
4. Biometric System and Data Analysis: Design, Evaluation, and data Mining,TedDunstone
and Neil Yager, Springer.
5. Biometrics Technologies and verification Systems, John Vacca, , Elsevier Inc. , 2007.
6. Pattern Classification, Richard O. Duda, David G.Stork,Peter E. Hart, Wiley 2007.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

CRYPTOGRAPHY AND NETWORK SECURITY

III Year B.Tech. CSE II-Semester L T P C

3 0 0 3

Prerequisites
1. A Course on “Computer Networks”
2. A Course on “Mathematics”

Objectives
1. To understand the fundamentals of Cryptography
2. To understand various key distribution and management schemes
3. To understand how to deploy encryption techniques to secure data in transit across data networks
4. To apply algorithms used for secure transactions in real world applications

Outcomes
1. Demonstrate the knowledge of cryptography, network security concepts and applications.
2. Ability to apply security principles in system design.
3. Ability to identify and investigate vulnerabilities and security threats and mechanisms to counter them.

UNIT - I
Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services
(Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability) and
Mechanisms, 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
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).
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT - V
Intruders, Viruses and Worms Intruders, Viruses and related threats Firewalls: Firewall Design Principles,
Trusted Systems, Intrusion Detection Systems.

Textbook:

1. Cryptography and Network Security (principles and approaches), William Stallings, 4th Edition, Pearson
Education.

References:

1. Network Security Essentials (Applications and Standards), William Stallings Pearson Education.
2. Principles of Information Security, Whitman, Thomson.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

COMPILER DESIGN

III Year B.Tech. CSE II-Semester L T P C

3 1 0 4

Prerequisites

1. A course on “Formal Languages and Automata Theory”

2. A course on “Computer Organization and architecture”
3. A course on “Computer Programming and Data Structures”
Objectives

1. Introduce the major concepts of language translation and compiler design and impart the knowledge
of practical skills necessary for constructing a compiler.
2. Topics include phases of compiler, parsing, syntax directd translation, type checking use of symbol
tables, code optimization techniques, intermediate code generation, code generation and data flow
analysis.
Outcomes

1. Demonstrate the ability to design a compiler given a set of language features.

2. Demonstrate the the knowledge of patterns, tokens & regular expressions for lexical analysis.
3. Acquire skills in using lex tool & yacc tool for devleoping a scanner and parser.
4. Design and implement LL and LR parsers
5. Design algorithms to do code optimization in order to improve the performance of a program in terms
of space and time complexity.
6. 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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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.

Textbook:

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

References:

1. lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly
2. Compiler Construction, Kenneth C. Louden, Thomson. Course Technology.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SOFTWARE ENGINEERING

III Year B.Tech. II-Semester L T P C

3 0 0 3

Objectives
1. 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.
2. Topics include process models, software requirements, software design, software testing, software
process/product metrics, risk management, quality management and UML diagrams

Outcomes
1. 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).
2. Identify and apply appropriate software architectures and patterns to carry out high level design of a
system and be able to critically compare alternative choices.
3. Will have experience and/or awareness of testing problems and will be able to develop a simple 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.
Creating an architectural design: software architecture, data design, architectural styles and patterns,
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.
Quality Management: Quality concepts, software quality assurance, software reviews, formal technical
reviews, statistical software quality assurance, software reliability, the ISO 9000 quality standards.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Textbooks:

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

International Edition.
2. Software Engineering, Ian Sommerville, 7th edition, Pearson Education.
3. The Unified Modeling Language user guide Grady Booch, James Rambaugh, Ivar Jacobson, Pearson
Education.

References:

1. Software Engineering, an Engineering approach- James F. Peters, Witold Pedrycz, John Wiely.
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 Eductaion.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DEEP LEARNING
(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

3 0 0 3

Objectives
1. To introduce the foundations of Artificial Neural Networks
2. To acquire the knowledge on Deep Learning Concepts
3. To learn various types of Artificial Neural Networks
4. To gain knowledge to apply optimization strategies
Outcomes
1. Ability to understand the concepts of Neural Networks
2. Ability to select the Learning Networks in modeling real world systems
3. Ability to use an efficient algorithm for Deep Models
4. Ability to apply optimization strategies for large scale applications

UNIT- I
Artificial Neural Networks Introduction, Basic models of ANN, important terminologies, Supervised
Learning Networks, Perceptron Networks, Adaptive Linear Neuron, Back-propagation Network. Associative
Memory Networks. Training Algorithms for pattern association, BAM and Hopfield Networks.
UNIT- II
Unsupervised Learning Network- Introduction, Fixed Weight Competitive Nets, Maxnet, Hamming Network,
Kohonen Self-Organizing Feature Maps, Learning Vector Quantization, Counter Propagation Networks,
Adaptive Resonance Theory Networks. Special Networks-Introduction to various networks.
UNIT - III
Introduction to Deep Learning, Historical Trends in Deep learning, Deep Feed - forward networks, Gradient-
Based learning, Hidden Units, Architecture Design, Back-Propagation and Other Differentiation Algorithms
UNIT - IV
Regularization for Deep Learning
Parameter norm Penalties, Norm Penalties as Constrained Optimization, Regularization and Under-
Constrained Problems, Dataset Augmentation, Noise Robustness, Semi-Supervised learning, Multi-task
learning, Early Stopping, Parameter Typing and Parameter Sharing, Sparse Representations, Bagging and
other Ensemble Methods, Dropout, Adversarial Training, Tangent Distance, tangent Prop and Manifold,
Tangent Classifier
UNIT - V
Optimization for Train Deep Models
Challenges in Neural Network Optimization, Basic Algorithms, Parameter Initialization Strategies,
Algorithms with Adaptive Learning Rates, Approximate Second-Order Methods, Optimization Strategies and
Meta-Algorithms
Applications
Large-Scale Deep Learning, Computer Vision, Speech Recognition, Natural Language Processing
Textbooks:

1. Deep Learning: An MIT Press Book By Ian Goodfellow and Yoshua Bengio and Aaron Courville
Neural Networks and Learning Machines, Simon Haykin, 3 rd Edition, Pearson Prentice Hall.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

NETWORK PROGRAMMING
(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

3 0 0 3

Objectives
1. To understand inter process and inter-system communication
2. To understand socket programming in its entirety
3. To understand usage of TCP/UDP / Raw sockets
4. To understand how to build network applications
Outcomes

1. To write socket API based programs

2. To design and implement client-server applications using TCP and UDP sockets
3. To analyze network programs

UNIT - I
Introduction to Network Programming: OSI model, Unix standards, TCP and UDP & TCP connection
establishment and Format, Buffer sizes and limitation, standard internet services, Protocol usage by common
internet application.

Sockets : Address structures, value – result arguments, Byte ordering and manipulation function and related
functions Elementary TCP sockets – Socket, connect, bind, listen, accept, fork and exec function, concurrent
servers. Close function and related function.

UNIT - II
TCP client server : Introduction, TCP Echo server functions, Normal startup, terminate and signal handling
server process termination, Crashing and Rebooting of server host shutdown of server host.

Elementary UDP sockets: Introduction UDP Echo server function, lost datagram, summary of UDP
example, Lack of flow control with UDP, determining outgoing interface with UDP.

I/O Multiplexing: I/O Models, select function, Batch input, shutdown function, poll function, TCP Echo
server,

UNIT - III
Socket options: getsockopt and setsockopt functions. Socket states, Generic socket option IPV6 socket
option ICMPV6 socket option IPV6 socket option and TCP socket options.

Advanced I/O Functions-Introduction, Socket Timeouts, recv and send Functions,readv and writev
Functions, recvmsg and sendmsg Functions, Ancillary Data, How Much Data Is Queued?, Sockets and
Standard I/O, T/TCP: TCP for Transactions.

UNIT - IV
Elementary name and Address conversions: DNS, gethost by Name function, Resolver option, Function
and IPV6 support, uname function, other networking information.

Daemon Processes and inetd Superserver – Introduction, syslogd Daemon, syslog Function, daemon_init
Function, inetd Daemon, daemon_inetd Function
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Broadcasting- Introduction, Broadcast Addresses, Unicast versus Broadcast, dg_cli Function Using
Broadcasting, Race Conditions

Multicasting- Introduction, Multicast Addresses, Multicasting versus Broadcasting on A LAN, Multicasting

on a WAN, Multicast Socket Options, mcast_join and Related Functions, dg_cli Function Using Multicasting,
Receiving MBone Session Announcements, Sending and Receiving, SNTP: Simple Network Time Protocol,
SNTP (Continued)

UNIT - V
Raw Sockets-Introduction, Raw Socket Creation, Raw Socket Output, Raw Socket Input, Ping Program, Traceroute
Program, An ICMP Message Daemon,
Datalink Access- Introduction, BPF: BSD Packet Filter, DLPI: Data Link Provider Interface, Linux:
SOCK_PACKET, libpcap: Packet Capture Library, Examining the UDP Checksum Field.
Remote Login: Terminal line disciplines, Pseudo-Terminals, Terminal modes, Control Terminals, rlogin
Overview, RPC Transparency Issues.

Textbooks:

1. UNIX Network Programming, W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, Pearson
Education
2. UNIX Network Programming, W.Richard Stevens, 1st Edition, PHI.

References:

1. UNIX Systems Programming using C++ T CHAN, PHI.

2. UNIX for Programmers and Users, Graham GLASS, King abls, 3rd Edition, Pearson Education
3. Advanced UNIX Programming, M. J. ROCHKIND, 2 nd Edition, Pearson Education
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SCRIPTING LANGUAGES
(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

3 0 0 3

Prerequisites
1. A course on “Computer Programming and Data Structures”
2. A course on “Object Oriented Programming Concepts”
Objectives

1. This course provides an introduction to the script programming paradigm

2. Introduces scripting languages such as Perl, Ruby and TCL.
3. Learning TCL
Outcomes

1. Comprehend the differences between typical scripting languages and typical system and application
programming languages.
2. Gain knowledge of the strengths and weakness of Perl, TCL and Ruby; and select an appropriate
language for solving a given problem.
3. Acquire programming skills in scripting language

UNIT - I
Introduction : Ruby ,Rails, The structure and Excution of Ruby Programs ,Package Management with
RUBYGEMS, Ruby and web : Writing CGI scripts , cookies, Choice of Webservers ,SOAP and webservices

RubyTk – Simple Tk Application ,widgets , Binding events , Canvas ,scrolling

UNIT - II
Extending Ruby : Ruby Objects in C , the Jukebox extension, Memory allocation ,Ruby Type System ,
Embedding Ruby to Other Languages , Embedding a Ruby Interperter

UNIT - III
Introduction to PERL and Scripting

Scripts and Programs, Origin of Scripting , Scripting Today, Characteristics of Scripting Languages,Uses for
Scripting Languages, Web Scripting, and the universe of Scripting Languages. PERL- Names and Values,
Variables, Scalar Expressions, Control Structures, arrays, list, hashes, strings, pattern and regular expressions,
subroutines.

UNIT - IV
Advanced perl

Finer points of looping, pack and unpack, filesystem, eval, datastructures, packages, modules, objects,
interfacing to the operating system, Creating Internet ware applications, Dirty Hands Internet Programming,
security Isses.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT - V
TCL
TCL Structure, syntax, Variables and Data in TCL, Control Flow, Data Structures, input/output, procedures ,
strings , patterns, files, Advance TCL- eval, source, exec and uplevel commands, Name spaces, trapping errors,
event driven programs, making applications internet aware, Nuts and Bolts Internet Programming, Security
Issues, C Interface.

Tk
Tk-Visual Tool Kits, Fundamental Concepts of Tk, Tk by example, Events and Binding , Perl-Tk.

Textbooks:
1. The World of Scripting Languages , David Barron,Wiley Publications.
2. Ruby Programming language by David Flanagan and Yukihiro Matsumoto O’Reilly
3. “Programming Ruby” The Pramatic Programmers guide by Dabve Thomas Second edition

References:
1. Open Source Web Development with LAMP using Linux Apache, MySQL, Perl and PHP,J.Lee and
B.Ware(Addison Wesley) Pearson Education.
2. Perl by Example, E.Quigley, Pearson Education.
3. Programming Perl,Larry Wall,T.Christiansen and J.Orwant, O’Reilly, SPD.
4. Tcl and the Tk Tool kit, Ousterhout, Pearson Education.
5. Perl Power, J.P.Flynt, Cengage Learning.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

MOBILE APPLICATION DEVELOPMENT

(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

3 0 0 3

Prerequisites
1. Acquaintance with JAVA programming
2. A Course on “Database Management Systems”

Objectives
1. To demonstrate their understanding of the fundamentals of Android operating systems
2. To improves their skills of using Android software development tools
3. To demonstrate their ability to develop software with reasonable complexity on mobile platform
4. To demonstrate their ability to deploy software to mobile devices
5. To demonstrate their ability to debug programs running on mobile devices

Outcomes
1. Student understands the working of Android OS Practically.
2. Student will be able to develop Android user interfaces
3. 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, Types of
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 - II
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, Implicit
Intents, Passing data to Intents, Getting results from Activities, Native Actions, using Intent to dial a number
or to send SMS
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Broadcast Receivers – Using Intent filters to service implicit Intents, Resolving Intent filters, finding and using
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)

Textbooks:
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:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SOFTWARE TESTING METHODOLOGIES

(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

3 0 0 3

Prerequisites
1. A course on “Software Engineering”

Objectives
1. To provide knowledge of the concepts in software testing such as testing process, criteria, strategies,
and methodologies.
2. To develop skills in software test automation and management using latest tools.
Outcomes
1. 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).

Textbooks
1. Software Testing techniques, Baris Beizer, 2nd Edition, Dreamtech.
2. Software Testing Tools, Dr.K.V.K.K.Prasad, Dreamtech.

References
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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ENTREPRENEURSHIP
(Open Elective - I)

III Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Course Objective: The aim of this course is to have a comprehensive perspective of inclusive learning,
ability to learn and implement the Fundamentals of Entrepreneurship.

Course Outcome: It enables students to learn the basics of Entrepreneurship and entrepreneurial
development which will help them to provide vision for their own Start-up.

UNIT – I
Entrepreneurial Perspectives
Introduction to Entrepreneurship – Evolution - Concept of Entrepreneurship - Types of Entrepreneurs -
Entrepreneurial Competencies, Capacity Building for Entrepreneurs. Entrepreneurial Training Methods -
Entrepreneurial Motivations - Models for Entrepreneurial Development - The process of Entrepreneurial
Development.

UNIT - II
New Venture Creation
Introduction, Mobility of Entrepreneurs, Models for Opportunity Evaluation; Business plans – Purpose,
Contents, Presenting Business Plan, Procedure for setting up Enterprises, Central level - Startup and State
level - T Hub, Other Institutions initiatives.

UNIT – III
Management of MSMEs and Sick Enterprises
Challenges of MSMEs, Preventing Sickness in Enterprises – Specific Management Problems; Industrial
Sickness; Industrial Sickness in India – Symptoms, process and Rehabilitation of Sick Units.

UNIT – IV
Managing Marketing and Growth of Enterprises
Essential Marketing Mix of Services, Key Success Factors in Service Marketing, Cost and Pricing,
Branding, New Techniques in Marketing, International Trade.

UNIT – V
Strategic perspectives in Entrepreneurship
Strategic Growth in Entrepreneurship, The Valuation Challenge in Entrepreneurship, The Final Harvest of
New Ventures, Technology, Business Incubation, India way – Entrepreneurship; Women Entrepreneurs –
Strategies to develop Women Entrepreneurs, Institutions supporting Women Entrepreneurship in India.

TEXT BOOKS:
1. Entrepreneurship Development and Small Business Enterprises, Poornima M. Charantimath, 2e,
Pearson, 2014.
2. Entrepreneurship, a South – Asian Perspective, D.F. Kuratko and T. V. Rao, 3e, Cengage, 2012.
3. Entrepreneurship, Arya Kumar, 4 e, Pearson 2015.
4. The Dynamics of Entrepreneurial Development and Management, Vasant Desai, Himalaya Publishing
House, 2015.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

PROFESSIONAL PRACTICE, LAW AND ETHICS

(Open Elective - I)

III Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Course Objectives:
• To make the students understand the types of roles they are expected to play in the society as
practitioners of the civil engineering profession
• To develop some ideas of the legal and practical aspects of their profession.

Course Outcome: The students will understand the importance of professional practice, Law and Ethics
in their personal lives and professional careers. The students will learn the rights and responsibilities as an
employee, team member and a global citizen

UNIT - I
Professional Practice and Ethics: Definition of Ethics, Professional Ethics - Engineering Ethics, Personal
Ethics; Code of Ethics - Profession, Professionalism, Professional Responsibility, Conflict of Interest, Gift Vs
Bribery, Environmental breaches, Negligence, Deficiencies in state-of-the-art; Vigil Mechanism, Whistle
blowing, protected disclosures. Introduction to GST- Various Roles of Various Stake holders

UNIT - II
Law of Contract: Nature of Contract and Essential elements of valid contract, Offer and Acceptance,
Consideration, Capacity to contract and Free Consent, Legality of Object. Unlawful and illegal agreements,
Contingent Contracts, Performance and discharge of Contracts, Remedies for breach of contract.
Contracts-II: Indemnity and guarantee, Contract of Agency, Sale of goods Act -1930: General Principles,
Conditions & Warranties, Performance of Contract of Sale.

UNIT - III
Arbitration, Conciliation and ADR (Alternative Dispute Resolution) system: Arbitration – meaning, scope
and types – distinction between laws of 1940 and 1996; UNCITRAL model law – Arbitration and expert
determination; Extent of judicial intervention; International commercial arbitration; Arbitration
agreements – essential and kinds, validity, reference and interim measures by court; Arbitration tribunal –
appointment, challenge, jurisdiction of arbitral tribunal, powers, grounds of challenge, procedure and
court assistance; Distinction between conciliation, negotiation, mediation and arbitration, confidentiality,
resort to judicial proceedings, costs; Dispute Resolution Boards; Lok Adalats.

UNIT - IV
Engagement of Labour and Labour & other construction-related Laws: Role of Labour in Civil Engineering;
Methods of engaging labour- on rolls, labour sub-contract, piece rate work; Industrial Disputes Act, 1947;
Collective bargaining; Industrial Employment (Standing Orders) Act, 1946; Workmen’s Compensation Act,
1923; Building & Other - Construction Workers (regulation of employment and conditions of service) Act
(1996) and Rules (1998); RERA Act 2017, NBC 2017.

UNIT - V
Law relating to Intellectual property: Introduction – meaning of intellectual property, main forms of IP,
Copyright, Trademarks, Patents and Designs, Secrets; Law relating to Copyright in India including Historical
evolution of Copy Rights Act, 1957, Meaning of copyright – computer programs, Ownership of copyrights
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

and assignment, Criteria of infringement, Piracy in Internet – Remedies and procedures in India; Law
relating to Patents under Patents Act, 1970

TEXT BOOKS:
1. Professional Ethics: R. Subramanian, Oxford University Press, 2015.
2. Ravinder Kaur, Legal Aspects of Business, 4e, Cengage Learning, 2016.

REFERENCE BOOKS:
1. RERA Act, 2017.
2. Wadhera (2004), Intellectual Property Rights, Universal Law Publishing Co.
3. T. Ramappa (2010), Intellectual Property Rights Law in India, Asia Law House.
4. O.P. Malhotra, Law of Industrial Disputes, N.M. Tripathi Publishers.
 Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

CYBER LAWS & ETHICS

(Open Elective - I)

III Year B.Tech. CSE II-Semester L T P C

3 0 0 3

Course Objectives
1. To make the students understand the types of roles they are expected to play in the society as
practitioners of the civil engineering profession
2. To develop some ideas of the legal and practical aspects of their profession.

Course Outcomes
1. The students will understand the importance of professional practice, Law and Ethics in their personal
lives and professional careers.
2. The students will learn the rights and responsibilities as an employee, team member and a global
citizen

UNIT-I
Introduction to Computer Security: Definition, Threats to security, Government requirements, Information
Protection and Access Controls, Computer security efforts, Standards, Computer Security mandates and
legislation, Privacy considerations, International security activity.

UNIT-II
Secure System Planning and administration, Introduction to the orange book, Security policy requirements,
accountability, assurance and documentation requirements, Network Security, The Red book and
Government network evaluations.

UNIT-III
Information security policies and procedures: Corporate policies- Tier 1, Tier 2 and Tier3 policies - process
management-planning and preparation-developing policies-asset classification policydeveloping standards.

UNIT- IV
Information security: fundamentals-Employee responsibilities- information classification- Information
handling- Tools of information security- Information processing-secure program administration.

UNIT-V
Organizational and Human Security: Adoption of Information Security Management Standards, Human
Factors in Security- Role of information security professionals.

REFERENCES:
1. Debby Russell and Sr. G. T Gangemi, "Computer Security Basics (Paperback)”, 2 nd Edition, O’ Reilly
Media, 2006.
2. Thomas R. Peltier, “Information Security policies and procedures: A Practitioner’s Reference”, 2nd
Edition Prentice Hall, 2004.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

3. Kenneth J. Knapp, “Cyber Security and Global Information Assurance: Threat Analysis and Response
Solutions”, IGI Global, 2009.
4. Thomas R Peltier, Justin Peltier and John blackley,” Information Security Fundamentals”, 2 nd Edition,
Prentice Hall, 1996
5. Jonathan Rosenoer, “Cyber law: the Law of the Internet”, Springer-verlag, 1997 6. James Graham,
“Cyber Security Essentials” Averbach Publication T & F Group.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

III Year B.Tech. CSE II-Semester L T P C

0 0 3 1.5
CRYPTOGRAPHY AND NETWORK SECURITY LAB
Prerequisites
1. A Course on “Computer Networks” Co-requisite

2. A course on “Network Security and Cryptography”

Objective:
1. To get practical exposure of Cryptography algorithms
Outcome:
1. Get the skill to provide security services like authentication confidentiality to the real systems.
2. Get the knowledge to solve security issues in day to day life.

List of Experiments

1. Perform an Experiment for port scanning with nmap

2. Setup a honepot and monitor the honipot on the network
3. Instal a jcrpt tool(or any other eqvivalent ) and demonstrate Asymmetric ,Symmetric crypto
algorithm ,Hash and Digital/PKI signatures studied in theory Network security and management
4. Using snort perform realtime traffic analysis and packet logging
5. Generate minimum 10 passwords of length 12 cahracters using open ssl command
6. Perform practical approach to implement Footprinting-Gathering target information using Dmitry-
Dmagic,UAtester
7. Write a program to perform encryption and decryption using the following substitution ciphers.
8. Caeser cipher
9. Play fair cipher
10. Hill Cipher
11. Write a program to implement the DES algorithm.
12. Write a program to implement RSA algorithm.
13. Calculate the message digest of a text using the SHA-1 algorithm.
14. Working with sniffers for monitoring network communication (Wireshark).
15. Configuring S/MIME for email communication.
16. Using Snort, perform real time traffic analysis and packet logging.

Textbooks:

1. Cryptography and Network Security (principles and approaches), William Stallings, 4 th Edition,
Pearson Education.

References:

1. Network Security Essentials (Applications and Standards), William Stallings Pearson Education.
Principles of Information Security, Whitman, Thomson.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DEVOPS LAB

III Year B.Tech. CSE II-Semester L T P C

0 2 2 3
Course Objectives:

1. Describe the agile relationship between development and IT operations.

2. Understand the skill sets and high-functioning teams involved in
3. DevOps and related methods to reach a continuous delivery capability
4. Implement automated system update and DevOps lifecycle
Course Outcomes:
1. Identify components of Devops environment
2. Apply different project management, integration, testing and code deployment tool
3. Investigate different DevOps Software development, models
4. Demonstrate continuous integration and development using Jenkins.

List Of Experiments:
1. Write code for a simple user registration form for an event.
2. Explore Git and GitHub commands.
3. Practice Source code management on GitHub. Experiment with the source code written in
exercise 1.
4. Jenkins installation and setup, explore the environment.
5. Demonstrate continuous integration and development using Jenkins.
6. Explore Docker commands for content management.
7. Develop a simple containerized application using Docker.
8. Integrate Kubernetes and Docker
9. Automate the process of running containerized application developed in exercise 7 using
Kubernetes.
10. Install and Explore Selenium for automated testing.
11. Write a simple program in JavaScript and perform testing using Selenium.
12. Develop test cases for the above containerized application using selenium.

Textbooks
1. Joakim Verona. Practical Devops, Second Edition. Ingram short title; 2nd edition (2018).
ISBN-10: 1788392574
2. Deepak Gaikwad, Viral Thakkar. DevOps Tools from Practitioner's Viewpoint. Wiley
publications. ISBN: 9788126579952

Reference books / Learning Resources

1. Len Bass, Ingo Weber, Liming Zhu. DevOps: A Software Architect's Perspective. Addison
Wesley

2. Edureka DevOps Full Course - https://youtu.be/S_0q75eD8Yc

 Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DEEP LEARNING LAB

(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

0 0 3 1.5

CourseObjectives:

1. To Build The Foundation Of Deep Learning.

2. To Understand How To Build The Neural Network.
3. To enable students to develop successful machine learning concepts.

CourseOutcomes:

1. Upon the Successful Completion of the Course, the Students would be able to:
2. Learn The Fundamental Principles Of Deep Learning.
3. Identify The Deep Learning Algorithms For Various Types of Learning Tasks in various
domains.
4. Implement Deep Learning Algorithms And Solve Real-world problems.
LIST OF EXPERIMENTS:
1. Setting up the Spyder IDE Environment and Executing a Python Program
2. Installing Keras, Tensorflow and Pytorch libraries and making use of them
3. Applying the Convolution Neural Network on computer vision problems
4. Image classification on MNIST dataset (CNN model with Fully connected layer)
5. Applying the Deep Learning Models in the field of Natural Language Processing
6. Train a sentiment analysis model on IMDB dataset, use RNN layers with LSTM/GRU notes
7. Applying the Autoencoder algorithms for encoding the real-world data
8. Applying Generative Adversial Networks for image generation and unsupervised tasks.

TextBooks:

1. DeepLearningbyIanGoodfellow,YoshuaBengioandAaronCourville,MITPress.
2.TheElementsofStatisticalLearningbyT.Hastie,R.Tibshirani,andJ.Friedman, Springer.
3. Probabilistic Graphical Models.Koller,andN.Friedman,MITPress.

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.

Extensive Reading:
• http://www.deeplearning.net
• https://www.deeplearningbook.org/
•https://developers.google.com/machine-learning/crash-course/ml-intro
• www.cs.toronto.edu/~fritz/absps/imagenet.pdf
• http://neuralnetworksanddeeplearning.com/
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

NETWORK PROGRAMMING LAB

(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

0 0 3 1.5
Objectives

1. To understand inter process and inter-system communication

2. To understand socket programming in its entirety
3. To understand usage of TCP/UDP / Raw sockets
4. To understand how to build network applications
Outcomes

1. To write socket API based programs

2. To design and implement client-server applications using TCP and UDP sockets
3. To analyze network programs
List of Experiments
1. Implement programs for Inter Process Communication using PIPE, Message Queue and Shared
Memory.
2. Write a programme to create an integer variable using shared memory concept and increment the
variable simultaneously by two processes. Use semaphores to avoid race conditions.
3. Design TCP iterative Client and server application to reverse the given input sentence
4. Design TCP iterative Client and server application to reverse the given input sentence
5. Design TCP client and server application to transfer file
6. Design a TCP concurrent server to convert a given text into upper case using multiplexing system call
“select”
7. Design a TCP concurrent server to echo given set of sentences using poll functions
8. Design UDP Client and server application to reverse the given input sentence
9. Design UDP Client server to transfer a file
10. Design using poll client server application to multiplex TCP and UDP requests for converting a given
text into upper case.
11. Design a RPC application to add and subtract a given pair of integers

Textbooks:

1. UNIX Network Programming, by W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, Pearson
Education.

2. UNIX Network Programming, 1st Edition, - W.Richard Stevens. PHI.

Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SCRIPTING LANGUAGES LAB

(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

0 0 3 1.5

Prerequisites: Any High level programming language (C,C++)

Objectives
1. To Understand the concepts of scripting languages for developing web based projects
2. To understand the applications the of Ruby , TCL , Perl scripting languages

Outcomes
1. Ability to understand the differences between Scripting languages and programming languages
2. Able to gain some fluency programming in Ruby, Perl, TCL

List of Experiments

1. Write a Ruby script to create a new string which is n copies of a given string where n is a non-negative
integer
2. Write a Ruby script which accept the radius of a circle from the user and compute the parameter and
area.
3. Write a Ruby script which accept the user's first and last name and print them in reverse order with a
space between them
4. Write a Ruby script to accept a filename from the user print the extension of that
5. Write a Ruby script to find the greatest of three numbers
6. Write a Ruby script to print odd numbers from 10 to 1
7. Write a Ruby scirpt to check two integers and return true if one of them is 20 otherwise return their
sum
8. Write a Ruby script to check two temperatures and return true if one is less than 0 and the other is
greater than 100
9. Write a Ruby script to print the elements of a given array
10. Write a Ruby program to retrieve the total marks where subject name and marks of a student stored
in a hash
11. Write a TCL script to find the factorial of a number
12. Write a TCL script that multiplies the numbers from 1 to 10
13. Write a TCL script for Sorting a list using a comparison function
14. Write a TCL script to (i)create a list (ii )append elements to the list (iii)Traverse the list
(iv)Concatenate the list
15. Write a TCL script to comparing the file modified times.
16. Write a TCL script to Copy a file and translate to native format.
17. a) Write a Perl script to find the largest number among three numbers.
b) Write a Perl script to print the multiplication tables from 1-10 using subroutines.
18. Write a Perl program to implement the following list of manipulating functions
a) Shift
b) Unshift
c) Push
19. a) Write a Perl script to substitute a word, with another word in a string.
b) Write a Perl script to validate IP address and email address.
20. Write a Perl script to print the file in reverse order using command line arguments
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Textbooks:
1. The World of Scripting Languages , David Barron,Wiley Publications.
2. Ruby Programming language by David Flanagan and Yukihiro Matsumoto O’Reilly
3. “Programming Ruby” The Pramatic Programmers guide by Dabve Thomas Second edition

References:
1. Open Source Web Development with LAMP using Linux Apache, MySQL, Perl and PHP,J.Lee and
B.Ware(Addison Wesley) Pearson Education.
2. Perl by Example, E.Quigley, Pearson Education.
3. Programming Perl,Larry Wall,T.Christiansen and J.Orwant, O’Reilly, SPD.
4. Tcl and the Tk Tool kit, Ousterhout, Pearson Education.
5. Perl Power, J.P.Flynt, Cengage Learning.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

MOBILE APPLICATION DEVELOPMENT LAB

(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

0 0 3 1.5

Prerequisites: --- NIL---

Objectives

1. To learn how to develop Applications in android environment.

2. To learn how to develop user interface applications.
3. To learn how to develop URL related applications.
Outcomes

1. Student understands the working of Android OS Practically.

2. Student will be able to develop user interfaces.
3. Student will be able to develop, deploy and maintain the Android Applications.

List of Experiments

1. Create an Android application that shows Hello + name of the user and run it on an emulator. (b)
Create an application that takes the name from a text box and shows hello message along with the
name entered in text box, when the user clicks the OK button.

2. Create a screen that has input boxes for User Name, Password, Address, Gender (radio buttons for
male and female), Age (numeric), Date of Birth (Date Picket), State (Spinner) and a Submit button.
On clicking the submit button, print all the data below the Submit Button. Use (a) Linear Layout (b)
Relative Layout and (c) Grid Layout or Table Layout.

3. Develop an application that shows names as a list and on selecting a name it should show the details
of the candidate on the next screen with a “Back” button. If the screen is rotated to landscape mode
(width greater than height), then the screen should show list on left fragment and details on right
fragment instead of second screen with back button. Use Fragment transactions and Rotation event
listener.

4. Develop an application that uses a menu with 3 options for dialing a number, opening a website and
to send an SMS. On selecting an option, the appropriate action should be invoked using intents.

5. Develop an application that inserts some notifications into Notification area and whenever a
notification is inserted, it should show a toast with details of the notification.

6. Create an application that uses a text file to store user names and passwords (tab separated fields and
one record per line). When the user submits a login name and password through a screen, the details
should be verified with the text file data and if they match, show a dialog saying that login is
successful. Otherwise, show the dialog with Login Failed message.

7. Create a user registration application that stores the user details in a database table.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

8. Create a database and a user table where the details of login names and passwords are stored. Insert
some names and passwords initially. Now the login details entered by the user should be verified with
the database and an appropriate dialog should be shown to the user.

9. Create an admin application for the user table, which shows all records as a list and the admin can
select any record for edit or modify. The results should be reflected in the table.

10. Develop an application that shows all contacts of the phone along with details like name, phone
number, mobile number etc.

11. Create an application that saves user information like name, age, gender etc. in shared preference and
retrieves them when the program restarts.

12. Create an alarm that rings every Sunday at 8:00 AM. Modify it to use a time picker to set alarm time.

13. Create an application that shows the given URL (from a text field) in a browser.

Textbooks:
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:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SOFTWARE TESTING METHODOLOGIES LAB

(Professional Elective - III)

III Year B.Tech. CSE II-Semester L T P C

0 0 3 1.5
Prerequisites
1. A basic knowledge of programming.

Objectives
1. To provide knowledge of Software Testing Methods.
2. To develop skills in software test automation and management using latest tools.
Outcome
1. Design and develop the best test strategies in accordance to the development model.

List of Experiments
1. Recording in context sensitive mode and analog mode
2. GUI checkpoint for single property
3. GUI checkpoint for single object/window
4. GUI checkpoint for multiple objects
5. a) Bitmap checkpoint for object/window
b) Bitmap checkpoint for screen area
6. Database checkpoint for Default check
7. Database checkpoint for custom check
8. Database checkpoint for runtime record check
9. a) Data driven test for dynamic test data submission
b) Data driven test through flat files
c) Data driven test through front grids
d) Data driven test through excel test
10. a) Batch testing without parameter passing
b) Batch testing with parameter passing
11. Data driven batch
12. Silent mode test execution without any interruption
13. Test case for calculator in windows application
Textbooks:

1. Software Testing techniques, Baris Beizer, 2nd Edition, Dreamtech.

2. Software Testing Tools, Dr.K.V.K.K.Prasad, Dreamtech.

References:

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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

CHATBOTS

III Year B.Tech. CSE II-Semester L T P C

2 0 0 0
Course Objectives:
Knowledge on concepts of chatbots and understanding the developer environment bot framework.

Course Outcomes:
1. Understand basic concepts of chatbots
2. Analyze different entities in building bots
3. Understand the concepts of advanced bot building
4. Discuss different types of chatbot use cases

Unit- I
Introduction to Chatbots: Definition of chatbots, Journey of Chatbots, Rise of Chatbots,
Messaging Platforms,

Unit- II : Setting Up the Developer Environment Botframework

Local Installation, Installing NodeJS, Following the Development Pipeline, Storing Messages in
Database.

Unit III: Basics of Bot Building- Intents, Entities

Unit IV: Advanced Bot Building

Design Principles, Showing Product Results, Saving Messages, Building Your Own Intent
Classifier

Unit V: Business and Monetization

Analytics, Chatbot Use Cases- Modes of Communication- Business-to-Business (B2B),
ChapBusiness-to-Consumer (B2C) Consumer-to-Consumer (C2C)Business-to-Employee (B2E),
Employee-to-Employee (E2E), Chatbots by Industry Vertical

Textbooks:
1. Rashid Khan, Anik Das, Build Better Chatbots: A Complete Guide to Getting Started with
Chatbots, Apress
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ADVANCED PYTHON PROGRAMMING

(Open Elective – II)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites: Python

Unit I
Introduction to Matplotlib, Plot Components, Matplotlib Architechture, Graphing with Matplotlib
pyplot: Pyplot API, Line Graphs, Scatter Graph, Pei Charts, Bar Charts, Figures and Subplots.
Unit II
Reading and Writing Files: Introduction, Obtaining References to Files, Reading Files , File Contents
Iteration, Writing Data to Files, Using Files and with Statements, The Fileinput Module, Renaming
Files,, Deleting Files, Random Access Files, Directories, Temporary Files, Working with Paths
Stream IO: Introduction, What is a Stream?, Python Streams, IOBase, Raw IO/UnBuffered IO
Classes, Binary IO/Buffered IO Classes, Text Stream Classes, Stream Properties, Closing Streams,
Returning to the open() Function
Working with CSV Files: CSV Files, The CSV Writer Class, The CSV Reader Class , CSV
DictWriter Class , CSV DictReader Class
Unit III
Concurrency and Parallelism: Introduction to Concurrency and Parallelism, Concurrency ,
Parallelism , Distribution, Grid Computing, Concurrency and Synchronisation , Object Orientation
and Concurrency , Threads V Processes
Threading: Threads, Thread States, Creating a Thread, Instantiating the Thread Class, Thread Class
, The Threading Module Functions, Passing Arguments to a Thread, Extending the Thread Class,
Daemon Threads, Threads, Thread Local Data, Timers, The Global Interpreter Lock
Multiprocessing: The Process Class, Working with the Process , Alternative Ways to Start a Process,
Using a Pool, Exchanging Data Between Processes, Sharing State Between Processes, Process
Shared Memory
Unit IV
Database Access: Introduction to Databases: What Is a Database? . Data Relations, The Database
Schema, SQL and Databases , Data Manipulation Language, Transactions in Databases
Python DB-API: Accessing a Database from Python, The Connect Function , The Connection Object
The Cursor Object, Mappings from Database Types to Python Types, Generating Errors, Row
Descriptions, Transactions in PyMySQL
PyMySQL Module: Working with the PyMySQL Module, Importing the Module, Connect to the
Database, Obtaining the Cursor Object, Using the Cursor Object, Information About the Results,
Fetching Results, Close the Connection, Complete PyMySQL Query Example, Inserting Data to the
Database, Updating Data in the Database, Deleting Data in the Database, Creating tables
Unit V
Testing: Introduction to Testing: Introduction, Types of Testing, What Should Be Tested? Testing
Software Systems (Unit Testing, Integration Testing, System Testing, Installation/Upgrade Testing,
Smoke Tests) Automating Testing, Test Driven Development: The TDD Cycle, Test Complexity,
Refactoring. Design for Testability: Testability Rules of Thumb
PyTest Testing Framework: Introduction, What Is PyTest?, Setting Up PyTest, A Simple PyTest,
Working with PyTest, Parameterised Tests.
Textbook:
1) “Advanced Guide to Python 3 Programming” by John Hunt, Ian Mackie, University of
Sussex, Brighton, UK
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

JAVA PROGRAMMING
(Open Elective – II)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites

1. A course on “Computer Programming & Data Structures”

Objectives
1. Introduces object oriented programming concepts using the Java language.
2. Introduces the principles of inheritance and polymorphism; and demonstrates how they relate
to the design of abstract classes
3. Introduces the implementation of packages and interfaces
4. Introduces exception handling, event handling and multithreading
5. Introduces the design of Graphical User Interface using applets and AWT

Outcomes

1. Develop Programs with reusability

2. Develop programs to handle multitasking
3. Develop programs to handle exceptions
4. Develop applications for a range of problems using object-oriented programming techniques
5. Design simple Graphical User Interface applications

UNIT I
Object oriented thinking and Java Basics- Need for oop paradigm, summary of oop concepts,
History of Java, Java buzzwords, data types, variables, scope and life time of variables, arrays,
operators, expressions, control statements, type conversion and casting, simple java program,
concepts of classes, objects, constructors, methods, access control, this keyword, garbage collection,
overloading methods and constructors, parameter passing, recursion, nested and inner classes,
exploring string class.

UNIT II

Inheritance, Packages and Interfaces – Hierarchical abstractions, Base class object, subclass,
subtype, substitutability, forms of inheritance- specialization, specification, construction, extension,
limitation, combination, benefits of inheritance, costs of inheritance. Member access rules, super
uses, using final with inheritance, polymorphism- method overriding, abstract classes, the Object
class.
Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages,
differences between classes and interfaces, defining an interface, implementing interface, applying
interfaces, variables in interface and extending interfaces.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Exploring java.io.

UNIT III
Exception handling and Multithreading-- Concepts of exception handling, benefits of exception
handling, exception hierarchy, usage of try, catch, throw, throws and finally, built in exceptions,
creating own exception sub classes.
String handling, Exploring java.util.

UNIT IV

Event Handling: Events, Event sources, Event classes, Event Listeners, Delegation event model,
handling mouse and keyboard events, Adapter classes.
The AWT class hierarchy, user interface components- labels, button, canvas, scrollbars, text
components, check box, check box group, choices, lists, dialog box, handling menus, layout manager:
layout manager types – border, grid, flow, card and grid bag.

UNIT V
Multi Threading: Differences between multi threading and multitasking, thread life cycle, creating
threads, thread priorities, synchronizing threads, interthread communication, thread groups, daemon
threads.
Applets – Concepts of Applets, differences between applets and applications, life cycle of an applet,
types of applets, creating applets, passing parameters to applets.

Text Books
1. Java the complete reference, 7th editon, Herbert Schildt, TMH.
2. Understanding OOP with Java, updated edition, T. Budd, Pearson Eduction.

References
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. An introduction to Java programming and object oriented application development, R.A.
Johnson- Thomson.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

INTRODUCTION TO DATA SCIENCE

(Open Elective – II)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Course Objectives:
• Learn concepts, techniques and tools they need to deal with various facets of data science
practice, including data collection and integration
• Understand the basic types of data and basic statistics
• Identify the importance of data reduction and data visualization techniques

Course Outcomes: After completion of the course, the student should be able to
• CO-1: Understand basic terms what Statistical Inference means. Identify probability
distributions commonly used as foundations for statistical modeling. Fit a model to data
• CO-2: describe the data using various statistical measures
• CO-3: utilize R elements for data handling
• CO-4: perform data reduction and apply visualization techniques.

UNIT-I: Introduction
What is Data Science? - Big Data and Data Science hype – and getting past the hype - Datafication
- Current landscape of perspectives - Statistical Inference - Populations and samples - Statistical
modeling, probability distributions, fitting a model – Over fitting.
Basics of R: Introduction, R-Environment Setup, Programming with R, Basic Data Types.

UNIT-II: Data Types & Statistical Description

Types of Data: Attributes and Measurement, What is an Attribute? The Type of an Attribute, The
Different Types of Attributes, Describing Attributes by the Number of Values, Asymmetric
Attributes, Binary Attribute, Nominal Attributes, Ordinal Attributes, Numeric Attributes, Discrete
versus Continuous Attributes.
Basic Statistical Descriptions of Data: Measuring the Central Tendency: Mean, Median, and Mode,
Measuring the Dispersion of Data: Range, Quartiles, Variance, Standard Deviation, and Inter-
quartile Range, Graphic Displays of Basic Statistical Descriptions of Data.

UNIT-III
Vectors: Creating and Naming Vectors, Vector Arithmetic, Vector sub setting, Matrices:
Creating and Naming Matrices, Matrix Sub setting, Arrays, Class.
Factors and Data Frames: Introduction to Factors: Factor Levels, Summarizing a Factor, Ordered
Factors, Comparing Ordered Factors, Introduction to Data Frame, sub setting of Data Frames,
Extending Data Frames, Sorting Data Frames.
Lists: Introduction, creating a List: Creating a Named List, Accessing List Elements, Manipulating
List Elements, Merging Lists, Converting Lists to Vectors
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT-IV
Conditionals and Control Flow: Relational Operators, Relational Operators and Vectors, Logical
Operators, Logical Operators and Vectors, Conditional Statements.
Iterative Programming in R: Introduction, While Loop, For Loop, Looping Over List.

Functions in R: Introduction, writing a Function in R, Nested Functions, Function Scoping,

Recursion, Loading an R Package, Mathematical Functions in R.

UNIT-V:
Data Reduction: Overview of Data Reduction Strategies, Wavelet Transforms, Principal
Components Analysis, Attribute Subset Selection, Regression and Log-Linear Models: Parametric
Data Reduction, Histograms, Clustering, Sampling, Data Cube Aggregation.
Data Visualization: Pixel-Oriented Visualization Techniques, Geometric Projection Visualization
Techniques, Icon-Based Visualization Techniques, Hierarchical Visualization Techniques,
Visualizing Complex Data and Relations.

TEXT BOOKS:
1. Doing Data Science, Straight Talk from The Frontline. Cathy O’Neil and Rachel Schutt,
O’Reilly, 2014
2. Jiawei Han, Micheline Kamber and Jian Pei. Data Mining: Concepts and Techniques, 3rd ed.
The Morgan Kaufmann Series in Data Management Systems.
3. K G Srinivas, G M Siddesh, “Statistical programming in R”, Oxford Publications.

REFERENCE BOOKS:
1. Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael Steinbanch, Pearson
Education.
2. Brain S. Everitt, “A Handbook of Statistical Analysis Using R”, Second Edition, 4 LLC,
2014.
3. Dalgaard, Peter, “Introductory statistics with R”, Springer Science & Business Media, 2008.
4. Paul Teetor, “R Cookbook”, O’Reilly, 2011.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

CYBER SECURITY
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites

1. A Course on “Network Security and Cryptography”

Objectives
1. The purpose of the course is to educate on cyber security and the legal perspectives of cyber
crimes and cyber offenses.
2. Introduce tools and methods for enhancing cyber security.
3. Topics include- cyber crimes, cyber offenses, cyber crimes on mobile and wireless devices,
tools and methods to prevent cyber crimes, legal perspectives of cyber crimes and cyber
security, computer forensics, Intellectual Property Rights and cyber terrorism

Outcomes
1. Demonstrate the knowledge of cyber security and understand the Indian and Global Act
concerning cyber crimes
2. Employ security and privacy methods in the development of modern applications such that
personal data is protected; and provide safe Internet usage.

UNIT-I
Introduction to Cybercrime:
Introduction, Cybercrime and Information security, who are cyber criminals, Classification of
Cyber crimes, Cybercrime: The legal Perspectives and Indian Perspective, Cybercrime and the
Indian ITA 2000, A Global Perspective on Cyber crimes. Cyber offenses : How Criminals Plan
Them. Introduction, How Criminals plan the Attacks, Social Engineering, Cyber stalking,
Cyber cafe and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack Vector, Cloud
Computing.

UNIT-II
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.

Tools and Methods Used in Cyber Crime: Introduction, Proxy services and Anonymizers,
Phishing, Password Cracking, Keyloggers and Spywares, Virus and Worms, Trojan Horses
and Backdoors, Steganography, DoS and DDoS Attacks, SQL Injection, Buffer Overflow,
Attacks on Wireless Networks.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT III
Cyber crimes and Cyber Security: the Legal Perspectives Introduction Cyber Crime and Legal
Landscape around the world, Why Do We Need Cyber laws: The Indian Context, The
Indian IT Act, Challenges to Indian Law and Cybercrime Scenario In India, Digital
signatures and the Indian IT Act, Amendments to the Indian IT Act, Cybercrime and
Punishment Cyber law, Technology and Students: Indian Scenario. Understanding Computer
Forensics 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, Chain of Custody concept, Network
Forensics, Approaching a computer, Forensics Investigation, Challenges in Computer
Forensics, Special Tools and Techniques Forensics Auditing

UNIT IV
Cyber Security: Organizational Implications
Introduction, cost of cyber crimes 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 cyber crimes the psychology, mindset and skills of hackers and other
cyber criminals

UNIT V

Cybercrime: Illustrations, 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, Illustrations of Financial Frauds in Cyber Domain, Digital
SignatureRelated Crime Scenarios.

Text book:

1. Cyber Security: Understanding Cyber Crimes, Computer Forensics and Legal

Perspectives, Nina Godbole and Sunil Belapure, Wiley INDIA.

Reference book:
1. Cyber Security Essentials, James Graham, Richard Howard and Ryan Otson, CRC Press.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ADVANCED DATA STRUCTURES AND ALGORITHMS

IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites

1. A course on “Data Structures”

Objectives

1. Introduces the heap data structures such as leftist heaps, binomial heaps, fibonacci and min-
max heaps
2. Introduces a variety of data structures such as disjoint sets, hash tables, search structures and
digital search structures
Outcomes
1. Ability to select the data structures that efficiently model the information in a problem
2. Ability to understand how the choice of data structures impact the performance of programs
3. Can Design programs using a variety of data structures, including hash tables, search structures
and digital search structures

UNIT - I
Heap Structures
Introduction, Min-Max Heaps, Leftist trees, Binomial Heaps, Fibonacci heaps.

UNIT - II
Hashing and Collisions
Introduction, Hash Tables, Hash Functions, different Hash Functions:- Division Method,

Multiplication Method, Mid-Square Method, Folding Method, Collisions

UNIT - III
Search Structures
OBST, AVL trees, Red-Black trees, Splay trees,

Multiway Search Trees

B-trees., 2-3 trees

UNIT - IV

Digital Search Structures

Digital Search trees, Binary tries and Patricia, Multiway Tries, Suffix trees, Standard Tries,
Compressed Tries

Pattern matching
Introduction, Brute force, the Boyer –Moore algorithm, Knuth-Morris-Pratt algorithm, Naïve String
Harspool, Rabin Karp
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT - V
Dynamic programming, graph algorithms: DFS, BFS, topological sorting, shortest path algorithms,
network flow problems. String algorithms, suffix trees, geometric algorithms.

Textbooks:
1. Fundamentals of data structures in C++ Sahni, Horowitz, Mehatha, Universities Press.
2. Introduction to Algorithms, TH Cormen, PHI

References:

1. Design methods and analysis of Algorithms, SK Basu, PHI.

2. Data Structures & Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education.
Fundamentals of Computer Algorithms, Ellis Horowitz, SartajSahni, Sanguthevar Rajasekaran, 2 nd
Edition, Universities Press.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

REINFORCEMENT LEARNING
(Professional Elective-IV)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Unit I
Basics of probability and linear algebra, Definition of a stochastic multi-armed bandit, Definition
of regret, Achieving sublinear regret, UCB algorithm, KL-UCB, Thompson Sampling.

Unit II
Markov Decision Problem, policy, and value function, Reward models (infinite discounted, total,
finite horizon, and average), Episodic & continuing tasks, Bellman's optimality operator, and Value
iteration & policy iteration

Unit III
The Reinforcement Learning problem, prediction and control problems, Model-based algorithm,
Monte Carlo methods for prediction, and Online implementation of Monte Carlo policy evaluation

Unit IV
Bootstrapping; TD(0) algorithm; Convergence of Monte Carlo and batch TD(0) algorithms; Model-
free control: Q-learning, Sarsa, Expected Sarsa.

Unit V
n-step returns; TD(λ) algorithm; Need for generalization in practice; Linear function
approximation and geometric view; Linear TD(λ).
Tile coding; Control with function approximation; Policy search; Policy gradient methods;
Experience replay; Fitted Q Iteration; Case studies.

Textbooks:

1. “Reinforcement learning: An introduction,” First Edition, Sutton, Richard S., and Andrew G.
Barto, MIT press 2020
2. “Statistical reinforcement learning: modern machine learning approaches,” First Edition,
Sugiyama, Masashi. CRC Press
2015

References:
1. “Bandit algorithms,” First Edition, Lattimore, T. and C. Szepesvári.Cambridge University Press.
2020
2. “Reinforcement Learning Algorithms: Analysis and Applications,” Boris Belousov, Hany
Abdulsamad, Pascal Klink, Simone Parisi, and Jan Peters First Edition, Springer 2021
3. Alexander Zai and Brandon Brown “Deep Reinforcement Learning in Action,” First Edition,
Manning Publications 2020
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

EMBEDDED SYSTEMS
(Professional Elective-IV)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites
1. A course on “Digital Logic Design and Microprocessors”
2. A course on “Computer Organization and Architecture”
Objectives
1. To provide an overview of principles of Embedded System
2. To provide a clear understanding of role of firmware, operating systems in correlation with
hardware systems.
Outcomes
1. Expected to understand the selection procedure of processors in the embedded domain.
2. Design procedure of embedded firm ware.
3. Expected to visualize the role of realtime operating systems in embedded systems.
4. Expected to evaluate the correlation between task synchronization and latency issues

UNIT - I
Introduction to Embedded Systems:
Definition of Embedded System, Embedded Systems Vs General Computing Systems, History of
Embedded Systems, Classification of Embedded Systems, Major application areas, Purpose of E
bedded Systems, Characteristics and Quality attributes of Embedded Systems.

UNIT - II
The Typical Embedded System:
Core of the Embedded System, Memory, Sensors and Actuators, Communication Interface,
Embedded Firmware, Other System components.

UNIT - III
Embedded Firmware Design and Development:
Embedded Firmware Design, Embedded Firmware Development Languages, Programming in
Embedded C.

UNIT - IV
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 - V
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.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Text Books
1. Shibu K V, “Introduction to Embedded Systems”, Second Edition, Mc Graw Hill
References
1. Rajkamal, Embedded Systems Architecture, Programming and Design, TATA McGraw-
Hill
2. Frank Vahid and Tony Givargis, “Embedded Systems Design” - A Unified
Hardware/Software Introduction, John Wiley
3. Lyla, “Embedded Systems” –Pearson David E.Simon, An Embedded Software Primer,
Pearson Education Asia, First Indian Reprint 2000.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SEMANTIC WEB
(Professional Elective-IV)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Objectives

1. To learn Web Intelligence

2. To learn Knowledge Representation for the Semantic Web
3. To learn Ontology Engineering
4. To learn Semantic Web Applications, Services and Technology
Outcomes

1. Ability to understand Semantic Web

2. Ability to learn SOAP, UDDI
3. Ability to handle multiple web services using Orchestration
4. Ability to experiment with XML Technologies
5. Ability to construct and use Ontologies
UNIT - I
Introduction to Semantic Web, the Business Case for the Semantic Web, XML and Its Impact on the
Enterprise.

UNIT - II
Web Services: Uses, Basics of Web Services, SOAP, UDDI, Orchestrating Web Services, Securing
Web Services, Grid Enabled and Semantic Web of Web Services.

UNIT - III
Resource Description Framework: Features, Capturing Knowledge with RDF.

XML Technologies: XPath , The Style Sheet Family: XSL, XSLT, and XSLFO, XQuery, XLink ,
XPointer . XInclude, XMLBase, XHTML, XForms, SVG.

UNIT - IV
Taxonomies and Ontologies: Overview of Taxonomies, Defining the Ontology Spectrum, Topic
Maps, Overview of Ontologies, Syntax, Structure, Semantics, and Pragmatics, Expressing
Ontologies Logically, Knowledge Representation.

UNIT - V
Semantic Web Application: Semantic Web Services, e-Learning, Semantic Bioinformatics,
Enterprise Application Integration, Knowledge Base.

Semantic Search Technology: Search Engines, Semantic Search, Semantic Search Technology,
Web Search Agents, Semantic Methods, Latent Semantic Index Search, TAP, Swoogle

Text Books

1. The Semantic Web: A Guide to the Future of XML, Web Services, and Knowledge Management
by Michael C. Daconta, Leo J. Obrst , Kevin T. Smith, Wiley Publishing, Inc.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

2. Thinking on the Web - Berners Lee, Godel and Turing, Wiley Interscience
Reference Books

1. Semantic Web Technologies , Trends and Research in Ontology Based Systems, J.Davies,
R.Studer, P.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 Web,T.Segaran,C.Evans,J.Taylor,O’Reilly,SPD.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

GAME THEORY
(Professional Elective-IV)
IV Year B.Tech. I Semester L T P C
3 0 0 3

UNIT – I: Introduction: Game Theory, Games and Solutions Game Theory and the Theory of
Competitive Equilibrium, Rational Behavior, The Steady State and Deductive Interpretations,
Bounded Rationality Terminology and Notation Nash Equilibrium- Strategic Games, Nash
Equilibrium Examples Existence of a Nash Equilibrium, Strictly Competitive Games, Bayesian
Games: Strategic Games with Imperfect Information

UNIT – II: Mixed, Correlated, and Evolutionary Equilibrium -Mixed Strategy Nash Equilibrium
Interpretations of Mixed Strategy Nash Equilibrium Correlated Equilibrium Evolutionary
Equilibrium Rationalizability and Iterated Elimination of Dominated Actions-Rationalizability
Iterated Elimination of Strictly Dominated Actions, Iterated Elimination of Weakly Dominated
Actions

UNIT – III: Knowledge and Equilibrium –A Model of Knowledge Common Knowledge, Can
People Agree to Disagree? , Knowledge and Solution Concepts, The Electronic Mail Game

UNIT – IV: Extensive Games with Perfect Information –Extensive Games with Perfect
Information Subgame Perfect Equilibrium Two Extensions of the Definition of a Game The
Interpretation of a Strategy , Two Notable Finite Horizon Games , Iterated Elimination of Weakly
Dominated Strategies Bargaining Games -Bargaining and Game Theory , A Bargaining Game of
Alternating Offers Subgame Perfect Equilibrium Variations and Extensions

UNIT – V: Repeated Games – The Basic Idea Infinitely Repeated Games vs.\ Finitely Repeated
Games Infinitely Repeated Games: Definitions Strategies as Machines Trigger Strategies: Nash Folk
Theorems Punishing for a Limited Length of Time: A Perfect Folk Theorem for the Limit of Means
Criterion Punishing the Punisher: A Perfect Folk Theorem for the Overtaking Criterion Rewarding
Players Who Punish: A Perfect Folk Theorem for the Discounting Criterion The Structure of
Subgame Perfect Equilibria Under the Discounting Criterion Finitely Repeated Game

TEXT BOOKS:

1. M. J. Osborne and A. Rubinstein, A course in Game Theory, MIT Press

2. Roger Myerson, Game Theory, Harvard University Press
3. D. Fudenberg and J. Tirole, Game Theory, MIT Press

REFERENCES:

1. J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, New
York:n John Wiley and Sons.
2. R.D. Luce and H. Raiffa, Games and Decisions, New York: John Wiley and Sons.,
3. G. Owen, Game Theory, (Second Edition), New York: Academic Press,
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

AD HOC & SENSOR NETWORKS

(Professional Elective-IV)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites
1. A course on “Computer Networks”
2. A course on “Mobile Computing”

Objectives
1. To understand the concepts of sensor networks
2. To understand the MAC and transport protocols for ad hoc networks
3. To understand the security of sensor networks
4. To understand the applications of adhoc and sensor networks
Outcomes
1. Ability to understand the state of the art research in the emerging subject of Ad Hoc and
Wireless Sensor Networks
2. Ability to solve the issues in real-time application development based on ASN.
3. Ability to conduct further research in the domain of ASN

UNIT - I
Introduction to Ad Hoc Networks - Characteristics of MANETs, Applications of MANETs and
Challenges of MANETs.
Routing in MANETs - Criteria for classification, Taxonomy of MANET routing algorithms,
Topology-based routing algorithms-Proactive: DSDV; Reactive: DSR, AODV; Hybrid: ZRP;
Position-based routing algorithms-Location Services-DREAM, Quorum-based; Forwarding
Strategies: Greedy Packet, Restricted Directional Flooding-DREAM, LAR.

UNIT - II
Data Transmission - Broadcast Storm Problem, Rebroadcasting Schemes-Simple-flooding,
Probability-based Methods, Area-based Methods, Neighbor Knowledge-based: SBA, Multipoint
Relaying, AHBP. Multicasting: Tree-based: AMRIS, MAODV; Mesh-based: ODMRP, CAMP;
Hybrid: AMRoute, MCEDAR.

UNIT - III
Geocasting: Data-transmission Oriented-LBM; Route Creation Oriented-GeoTORA, MGR.
TCP over Ad Hoc TCP protocol overview, TCP and MANETs, Solutions for TCP over Ad hoc

UNIT - IV
Basics of Wireless, Sensors and Lower Layer Issues

Applications, Classification of sensor networks, Architecture of sensor network, Physical layer,

MAC layer, Link layer, Routing Layer.

UNIT - V
Upper Layer Issues of WSN
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Transport layer, High-level application layer support, Adapting to the inherent dynamic nature of
WSNs, Sensor Networks and mobile robots.

Text Books

1. Ad Hoc and Sensor Networks – Theory and Applications, Carlos Corderio Dharma P.Aggarwal,
World Scientific Publications, March 2006, ISBN – 981–256–681–3.
2. Wireless Sensor Networks: An Information Processing Approach, Feng Zhao, Leonidas Guibas,
Elsevier Science, ISBN – 978-1-55860-914-3 ( Morgan Kauffman).
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ROBOTIC PROCESS ATOMATION

(Professional Elective-V)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Unit I
Introduction to Robotic Process Automation & Bot Creation
Introduction to RPA and Use cases – Automation Anywhere Enterprise
Platform – Advanced features and capabilities – Ways to create Bots

Unit II
Web Control Room and Client
Introduction - Features Panel - Dashboard (Home, Bots, Devices, Audit,
Workload, Insights) - Features Panel – Activity (View Tasks in Progress and
Scheduled Tasks) - Bots (View Bots Uploaded and Credentials)

Unit III
Devices (View Development and Runtime Clients and Device Pools) - Workload (Queues and SLA
Calculator) - Audit Log (View Activities Logged which are associated with Web CR)
- Administration (Configure Settings, Users, Roles, License and Migration) - Demo
of Exposed API’s – Conclusion – Client introduction and Conclusion.

Unit IV
Bot Creator
Introduction – Recorders – Smart Recorders – Web Recorders – Screen
Recorders - Task Editor – Variables - Command Library – Loop Command – Excel
Command – Database Command - String Operation Command - XML Command

Unit V
Terminal Emulator Command - PDF Integration Command - FTP Command - PGP
Command - Object Cloning Command - Error Handling Command - Manage
Windows Control Command - Workflow Designer - Report Designer

Textbooks:
1. Learning Robotic Process Automation: Create Software robots and automate business processes
with the leading RPA tool - UiPath: Create Software robots. with the leading RPA tool – UiPath
Kindle Edition

References:
1. Robotic Process Automation A Complete Guide - 2020 Edition Kindle Edition
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

MOBILE COMPUTING
(Professional Elective-V)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites
1. A course on “Computer Networks”

Objectives
1. To make the student understand the concept of mobile computing paradigm, its novel applications
and limitations.
2. To understand the typical mobile networking infrastructure through a popular GSM protocol
3. To understand the issues and solutions of various layers of mobile networks, namely MAC layer,
Network Layer & Transport Layer
4. To understand the database issues in mobile environments & data delivery models.
5. To understand the ad hoc networks and related concepts.
6. To understand the platforms and protocols used in the mobile environment.

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

UNIT I
Introduction
Mobile Communications, Mobile Computing – Paradigm, Promises/Novel Applications and
Impediments and Architecture; Mobile and Handheld Devices, Limitations of Mobile and Handheld
Devices.
GSM – Services, System Architecture, Radio Interfaces, Protocols, Localization, Calling, Handover,
Security, New Data Services, GPRS.

UNIT -II
(Wireless) Medium Access Control (MAC)
Motivation for a specialized MAC (Hidden and exposed terminals), SDMA, FDMA, TDMA,
CDMA, Wireless LAN/(IEEE 802.11)

Mobile Network Layer

IP and Mobile IP Network Layers, Packet Delivery and Handover Management, Location
Management, Registration, Tunneling and Encapsulation, Route Optimization, DHCP.

UNIT -III
Mobile Transport Layer
Conventional TCP/IP Protocols, Indirect TCP, Snooping TCP, Mobile TCP, Other Transport Layer
Protocols for Mobile Networks.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Database Issues
Database Hoarding & Caching Techniques, Client-Server Computing & Adaptation, Transactional
Models.

UNIT IV
Data Dissemination and Synchronization
Communications Asymmetry, Classification of Data Delivery Mechanisms, Data Dissemination,
Broadcast Models, Selective Tuning and Indexing Methods.

UNIT V
Mobile Ad hoc Networks (MANETs)
Introduction, Applications & Challenges of a MANET, Routing, Classification of
Routing Algorithms, Algorithms such as DSR, AODV, DSDV, Mobile Agents, Service Discovery.

Text Books

Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second Edition, 2009. Raj Kamal,
“Mobile Computing”, Oxford University Press, 2007, ISBN: 0195686772
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

CLOUD COMPUTING
(Professional Elective-V)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites

1. A course on “Computer Networks”

2. A course on “Operating Systems”
3. A course on “Distributed Systems”
Objectives
1. This course provides an insight into cloud computing
2. Topics covered include- distributed system models, different cloud service models, service
oriented architectures, cloud programming and software environments, resource
management.
Outcomes
1. Ability to understand various service delivery models of a cloud computing architecture.
2. Ability to understand the ways in which the cloud can be programmed and deployed.
3. 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
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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.
Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance, Tim Mather, Subra
Kumaraswamy, Shahed Latif, O’Reilly, SPD, rp2011.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SOFTWARE PROCESS & PROJECT MANAGEMENT

(Professional Elective - V)

IV Year B.Tech. CSE I-Semester L T P C

3 0 0 3
Objectives
1. To acquire knowledge on software process management
2. To acquire managerial skills for software project development
3. To understand software economics

Outcomes

1. Gain knowledge of software economics, phases in the life cycle of software development, project
organization, project control and process instrumentation
2. Analyze the major and minor milestones, artifacts and metrics from management and technical
perspective
3. Design and develop software product using conventional and modern principles of software project
management

UNIT - I
Software Process Maturity

Software maturity Framework, Principles of Software Process Change, Software Process Assessment, The
Initial Process, The Repeatable Process, The Defined Process, The Managed Process, The Optimizing
Process.

Process Reference Models

Capability Maturity Model (CMM), CMMI, PCMM, PSP, TSP).

UNIT - II
Software Project Management Renaissance

Conventional Software Management, Evolution of Software Economics, Improving Software Economics,

The old way and the new way.

Life-Cycle Phases and Process artifacts

Engineering and Production stages, inception phase, elaboration phase, construction phase, transition
phase, artifact sets, management artifacts, engineering artifacts and pragmatic artifacts, model based
software architectures.

UNIT - III
Workflows and Checkpoints of process

Software process workflows, Iteration workflows, Major milestones, minor milestones, periodic status
assessments.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Process Planning

Work breakdown structures, Planning guidelines, cost and schedule estimating process, iteration planning
process, Pragmatic planning.

UNIT - IV
Project Organizations

Line-of- business organizations, project organizations, evolution of organizations, process automation.

Project Control and process instrumentation

The seven core metrics, management indicators, quality indicators, life-cycle expectations, Pragmatic
software metrics, metrics automation.

UNIT - V
CCPDS-R Case Study and Future Software Project Management Practices

Modern Project Profiles, Next-Generation software Economics, Modern Process Transitions .

Textbooks:
1. Managing the Software Process, Watts S. Humphrey, Pearson Education
2. Software Project Management, Walker Royce, Pearson Education

References:

1. An Introduction to the Team Software Process, Watts S. Humphrey, Pearson Education, 2000
2. Process Improvement essentials, James R. Persse, O’Reilly,2006
3. Software Project Management, Bob Hughes & Mike Cotterell, fourth edition,TMH,2006
4. Applied Software Project Management, Andrew Stellman & Jennifer Greene, O’Reilly,
2006.

5. Head First PMP, Jennifer Greene & Andrew Stellman, O’Reilly,2007

6. Software Engineering Project Managent, Richard H. Thayer & Edward Yourdon, 2 nd Edition, Wiley
India, 2004.
7. Agile Project Management, Jim Highsmith, Pearson education, 2004
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

NATURAL LANGUAGE PROCESSING

(Professional Elective-V)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites
1. Data structures, finite automata and probability theory

Objectives
1. Introduce to some of the problems and solutions of NLP and their relation to linguistics and
statistics.

Outcomes
1. Show sensitivity to linguistic phenomena and an ability to model them with formal grammars.
2. Understand and carry out proper experimental methodology for training and evaluating
empirical NLP systems
3. Able to manipulate probabilities, construct statistical models over strings and trees, and
estimate parameters using supervised and unsupervised training methods.
4. Able to design, implement, and analyze NLP algorithms
5. 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, Treebanks: 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: Cohension, Reference Resolution, Discourse Cohension and Structure
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Language Modeling: Introduction, N-Gram Models, Language Model Evaluation, Parameter

Estimation, Language Model Adaptation, Types of Language Models, Language-Specific Modeling
Problems, Multilingual and Crosslingual 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

1. Speech and Natural Language Processing - Daniel Jurafsky & James H Martin, Pearson
Publications
 Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

COMPUTER VISION AND ROBOTICS

(Professional Elective-VI)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Pre Requisites: Linear Algebra and Probability.

Course Objectives:
1. To understand the Fundamental Concepts Related To sources, shadows and shading
2. To understand the The Geometry of Multiple Views
Course Outcomes:
1. Implement fundamental image processing techniques required for computer vision
2. Implement boundary tracking techniques
3. Apply chain codes and other region descriptors, Hough Transform for line, circle, and
ellipse detections.
4. Apply 3D vision techniques and Implement motion related techniques.
5. Develop applications using computer vision techniques.

UNIT -I
CAMERAS: Pinhole Cameras

Radiometry – Measuring Light: Light in Space, Light Surfaces, Important Special Cases

Sources, Shadows, And Shading: Qualitative Radiometry, Sources and Their Effects, Local
Shading Models, Application: Photometric Stereo, Interreflections: Global Shading Models

Color: The Physics of Color, Human Color Perception, Representing Color, A Model for Image
Color, Surface Color from Image Color.

UNIT-II
Linear Filters:Linear Filters and Convolution, Shift Invariant Linear Systems, Spatial Frequency
and Fourier Transforms, Sampling and Aliasing, Filters as Templates,

Edge Detection:Noise, Estimating Derivatives, Detecting Edges

Texture:Representing Texture, Analysis (and Synthesis) Using Oriented Pyramids, Application:

Synthesis by Sampling Local Models, Shape from Texture.

UNIT-III

The Geometry of Multiple Views: Two Views

Stereopsis: Reconstruction, Human Stereposis, Binocular Fusion, Using More Cameras

Segmentation by Clustering: What Is Segmentation?, Human Vision: Grouping and Getstalt,

Applications: Shot Boundary Detection and Background Subtraction, Image Segmentation by
Clustering Pixels, Segmentation by Graph-Theoretic Clustering,
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT-IV
Segmentation by Fitting a Model:

The Hough Transform, Fitting Lines, Fitting Curves, Fitting as a Probabilistic Inference Problem,
Robustness

Segmentation and Fitting Using Probabilistic Methods:

Missing Data Problems, Fitting, and Segmentation, The EM Algorithm in Practice,

Tracking With Linear Dynamic Models:

Tracking as an Abstract Inference Problem, Linear Dynamic Models, Kalman Filtering, Data
Association, Applications and Examples

UNIT- V
Geometric Camera Models:Elements of Analytical Euclidean Geometry, Camera Parameters and
the Perspective Projection, Affine Cameras and Affine Projection Equations

Geometric Camera Calibration:Least-Squares Parameter Estimation, A Linear Approach to

Camera Calibration, Taking Radial Distortion into Account, Analytical Photogrammetry, An
Application: Mobile Robot Localization

Model- Based Vision:Initial Assumptions, Obtaining Hypotheses by Pose Consistency, Obtaining

Hypotheses by pose Clustering, Obtaining Hypotheses Using Invariants, Verification,
Application: Registration In Medical Imaging Systems, Curved Surfaces and Alignment.

Text Books:
1. 1. David A. Forsyth and Jean Ponce: Computer Vision – A Modern Approach, PHI
Learning (Indian Edition), 2009.
References

1. E. R. Davies: Computer and Machine Vision – Theory, Algorithms and Practicalities,

Elsevier (Academic Press), 4th edition, 2013.
2. R. C. Gonzalez and R. E. Woods “Digital Image Processing” Addison Wesley 2008.
3. Richard Szeliski “Computer Vision: Algorithms and Applications” Springer-Verlag London
Limited 2011.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

INFORMATION RETRIEVAL SYSTEMS

(Professional Elective-VI)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites
1. A Course on “Data Structures”

Objectives
1. To learn the important concepts and algorithms in IRS
2. To understand the data/file structures that are necessary to design, and implement information
retrieval (IR) systems.

Outcomes
1. Ability to apply IR principles to locate relevant information large collections of data 2.
Ability to design different document clustering algorithms

3. Implement retrieval systems for web search tasks.

4. 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
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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

Textbook:

1. Information Storage and Retrieval Systems – Theory and Implementation, Gerald J. Kowalski, Mark T.
Maybury, 2nd Edition, Springer.

References:

1. Information Retrieval Data Structures and Algorithms, Frakes, W.B., Ricardo Baeza-Yates, Prentice Hall,
1992.
2. Information Storage & Retrieval, Robert Korfhage, John Wiley & Sons.
3. Modern Information Retrieval, Yates and Neto, Pearson Education.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

BLOCKCHAIN TECHNOLOGIES
(Professional Elective-VI)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites
1. Knowledge in information security and applied cryptography.
2. Knowledge in distributed databases.

Objectives
1. To learn the fundamentals of Block Chain and various types of block chain and consensus
mechanism.
2. To understand public block chain system, Private block chain system and consortium block
chain.
3. Able to know the security issues of blockchain technology.

Outcomes
1. Able to work in the field of block chain technologies.

UNIT-I
Fundamentals of Blockchain: Introduction, Origin of Blockchain, Blockchain Solution,
Components of Blockchain, Block in a Blockchain,The Technology and the Future.
Blockchain Types and Consensus Mechanism: Introduction, Decentralization and Distribution,
Types of Blockchain, Consensus Protocol.
Cryptocurrency – Bitcoin, Altcoin and Token: Introduction, Bitcoin and the Cryptocurrency,
Cryptocurrency Basics, Types of Cryptocurrencies, Cryptocurrency Usage.

UNIT-II
Public Blockchain System: Introduction, Public Blockchain, Popular Public Blockchains, The
Bitcoin Blockchain, Ethereum Blockchain.
Smart Contracts: Introduction, Smart Contract, Characteristics of a Smart Contract, Types of
Smart Contracts, Types of Oracles, Smart Contracts in Ethereum, Smart Contracts in Industry.

UNIT-III
Private Blockchain System: Introduction, Key Characteristics of Private Blockchain, Why We
Need Private Blockchain, Private Blockchain Examples, Private Blockchain and Open Source, E-
commerce Site Example, Various Commands (Instructions) in E-commerce Blockchain, Smart
Contract in Private Environment, State Machine, Different Algorithms of Permissioned
Blockchain, ByzantineFault, Multichain.
Consortium Blockchain: Introduction, Key Characteristics of Consortium Blockchain, Why We
Need Consortium Blockchain, Hyperledger Platform, Overview of Ripple, Overview of Corda.
Initial Coin Offering: Introduction, Blockchain Fundraising Methods, Launching an ICO,
Investing in an ICO, Pros and Cons of Initial Coin Offering, Successful Initial Coin Offerings,
Evolution of ICO,
ICO Platforms.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT-IV
Security in Blockchain: Introduction, Security Aspects in Bitcoin, Security and Privacy
Challenges of Blockchain in General, Performance and Scalability, Identity Management and
Authentication, Regulatory Compliance and Assurance, Safeguarding Blockchain Smart Contract
(DApp), Security Aspects in Hyperledger Fabric.
Applications of Blockchain: Introduction, Blockchain in Banking and Finance, Blockchain in
Education, Blockchain in Energy, Blockchain in Healthcare, Blockchain in Real-estate,
Blockchain in Supply Chain, The Blockchain and IoT.Limitations and Challenges of Blockchain.

UNIT-V
Blockchain Case Studies: Case Study 1 – Retail, Case Study 2 – Banking and Financial Services,
Case Study 3 – Healthcare, Case Study 4 – Energy and Utilities.
Blockchain Platform using Python: Introduction, Learn How to Use Python Online Editor, Basic
Programming Using Python, Python Packages for Blockchain.
Blockchain platform using Hyperledger Fabric: Introduction, Components of Hyperledger
Fabric Network, Chain codes from Developer.ibm.com, Blockchain Application Using Fabric Java
SDK.

Text book:
1. “Block chain Technology”, Chandramouli Subramanian, Asha A.George, Abhilasj K A and
Meena Karthikeyan , Universities Press.

References:
1. Blockchain Blue print for Economy, Melanie Swan, SPD Oreilly.
Blockchain for Business, Jai Singh Arun, Jerry Cuomo, Nitin Gauar, Pearson Addition Wesley.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SOFTWARE METRICS
(Professional Elective-V)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Course Objectives
1. Understand the basic techniques of data collection and how to apply them
2. Learn software metrics that define relevant metrics in a rigorous way.
Course Outcomes
1. Perform some simple statistical analysis relevant to software measurement data.
2. Use from practical examples both the benefits and limitations of software metrics for quality
control and assurance
3. Understand internal product attributes and its structures
4. Understand and analyze software quality metrics
UNIT - I
Measurement Theory
Fundamentals of measurement – Measurements in Software Engineering – Scope of Software
metrics – Measurement theory – Goal based framework – Software measurement
validation.
UNIT - II
Data Collection And Analysis
Empirical investigation – Planning experiments – Software metrics data collection – Analysis
methods – Statistical methods.
UNIT - III
Product Metrics
Measurement of internal product attributes – Size and structure – External product attributes –
Measurement of quality.
UNIT - IV
Quality Metrics
Software quality metrics – Product quality – Process quality – Metrics for software maintenance
– Case studies of Metrics Program – Motorola – HP and IBM.
UNIT - V
Management Metrics
Quality management models – Rayleigh Model – Problem Tracking report (PTR) model –
Reliability growth model – Model evaluation – Orthogonal defect classification.

Text Books
1. Software Metrics, Normal. E – Fentor Shari Lawrence Pfllegar, International
Thomson Computer Press, 1997.
2. Software Metrics ; A Rigorous approach Fenter Norman, E., Chapmen & Hall, London.

References
1. Metric and Models in Software Quality Engineering, Stephen H.Kin, Addison Wesley, 1995.
2. Measuring Software Process, William. A. Florac and Aretitor D Carletow, Addison –Wesley,
1995.
 Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

COGNITIVE COMPUTING
(Professional Elective-V)
IV Year B.Tech. I Semester L T P C
3 0 0 3
Prerequisites: Probability theory

Course Objectives:
1. To provide an understanding of the central challenges in realizing aspects of
human cognition.
2. To provide a basic exposition to the goals and methods of human cognition.
3. To develop algorithms that use AI and machine learning along with human
interaction and feedback to help humans make choices/decisions.
4. To support human reasoning by evaluating data in context and presenting relevant
findings along with the evidence that justifies the answers.
Course Outcomes:
1. Understand what cognitive computing is, and how it differs from traditional approaches.
2. Plan and use the primary tools associated with cognitive computing.
3. Plan and execute a project that leverages cognitive computing.
4. Understand and develop the business implications of cognitive computing.

UNIT - I
Introduction to Cognitive Science: Understanding Cognition, IBM’s Watson, Design for Human
Cognition, Augmented Intelligence, Cognition Modeling Paradigms: Declarative/ logic-based
computational cognitive modeling, connectionist models of cognition , Bayesian models of
cognition, a dynamical systems approach to cognition

UNIT - II
Cognitive Models of memory and language, computational models of episodic and semantic
memory, modeling psycholinguistics

UNIT - III
Cognitive Modeling: modeling the interaction of language, memory and learning, Modeling select
aspects of cognition classical models of rationality, symbolic reasoning and decision making

UNIT - IV
Formal models of inductive generalization, causality, categorization and similarity, the role of
analogy in problem solving, Cognitive Development Child concept acquisition. Cognition and
Artificial cognitive architectures such as ACT-R, SOAR, OpenCog, CopyCat, Memory
Networks
 Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT - V
DeepQA Architecture, Unstructured Information Management Architecture (UIMA), Structured
Knowledge, Business Implications, Building Cognitive Applications, Application of Cognitive
Computing and Systems

Text Books:
1. The Cambridge Handbook of Computational Psychology by Ron Sun (ed.), Cambridge
University Press.
2. Formal Approaches in Categorization by Emmanuel M. Pothos, Andy J. Wills,
Cambridge University Press.
References:
1. Judith S. Hurwitz, Marcia Kaufman, Adrian Bowles Cognitive Computing and Big
Data Analytics, Wiley
2. Vijay V Raghavan, Venkat N. Gudivada, Venu Govindaraju, Cognitive Computing: Theory
and Applications: Volume 35 (Handbook of Statistics), North Holland
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

ADVANCED DATA STRUCTURES AND ALGORITHMS LAB

IV Year B.Tech. CSE I-Semester L T P C

0 0 4 2
Prerequisites
1. A course on Computer Programming & Data Structures”
Objectives
1. Introduces the basic concepts of Abstract Data Types.
2. Reviews basic data structures such as stacks and queues.
3. Introduces a variety of data structures such as hash tables, search trees, tries, heaps,
graphs, and B-trees.
4. Introduces sorting and pattern matching algorithms
Outcomes
1. Ability to select the data structures that efficiently model the information in a problem.
2. Ability to assess efficiency trade-offs among different data structure implementations
or combinations.
3. Implement and know the application of algorithms for sorting and pattern matching.
4. Design programs using a variety of data structures, including hash tables, binary and
general tree structures, search trees, tries, heaps, graphs, and B-trees.

List of Programs :
1. Write a program to perform the following operations:
a) Insert an element into a binary search tree.
b) Delete an element from a binary search tree.
c) Search for a key element in a binary search tree.

2. Write a program for implementing the following sorting methods:

a) Merge sort b) Heap sort c) Quick sort

3. Write a program to perform the following operations:

a) Insert an element into a B- tree.
b) Delete an element from a B- tree.
c) Search for a key element in a B- tree.

4. Write a program to perform the following operations:

a) Insert an element into a Min-Max heap
b) Delete an element from a Min-Max heap
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

c) Search for a key element in a Min-Max heap

5. Write a program to perform the following operations:

a) Insert an element into a AVL tree.
b) Delete an element from a AVL search tree.
c) Search for a key element in a AVL search tree.

6. Write a program to perform the following operations:

a) Insert an element into a Red-Black tree.
b) Delete an element from a Red-Black tree.
c) Search for a key element in a Red-Black tree.

7. Write a program to implement all the functions of a dictionary using hashing.

8. Write a program for implementing Knuth-Morris-Pratt pattern matching algorithm.

9. Write a program for implementing Brute Force pattern matching algorithm.

10. Write a program for implementing Boyer pattern matching algorithm

11. Write a program for implementing Shortest path algorithm

12. Write a program for implementing graph traversal DFS and BFS

13. Write a program for implementing String algorithms

14. Write a program for implementing geometric algorithms.

Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

CYBER SECURITY LAB

IV Year B.Tech. CSE I-Semester L T P C

0 0 2 1
Prerequisites
1. A course on “Network Security and Cryptography”

Objective:
1. To get practical exposure of Cyber security threats and Forensics tools
Outcome:
1. Get the skill to identify the cyber threats/attacks.
2. Get the knowledge to solve security issues in day to day life.

List of Experiments

1. Perform an Experiment for port scanning with nmap

2. Setup a honeypot and monitor the honeypot on the network
3. Install Jcrpt/Cryptool tool (or any other equivalent) and demonstrate Asymmetric, Symmetric crypto
algorithm, Hash and Digital/PKI signatures.
4. Generate minimum 10 passwords of length 12 characters using open SSL command
5. Perform practical approach to implement Footprinting-Gathering target information using Dmitry-
Dmagic, UAtester
6. Working with sniffers for monitoring network communication (Wireshark).
7. Using Snort, perform real time traffic analysis and packet logging.
8. Perform email analysis using Autopsy tool.
9. Perform Registry analysis and get boottime logging using process monitor tool
10. Perform File type detection using Autopsy tool
11. Perform Memory capture and analysis using FTK imager tool
12. Perform Network analysis using the Network Miner tool

Textbooks
1. Real Digital Forensics for Handheld Devices , E. P. Dorothy, Auerback Publications, 2013.
2. The Basics of Digital Forensics: The Primer for Getting Started in Digital Forensics, J. Sammons, Syngress
Publishing, 2012.
3. Handbook of Digital Forensics and Investigation, E. Casey, Academic Press, 2010
4. Malware Forensics Field Guide for Windows Systems: Digital Forensics Field Guides, C. H. Malin, E.
Casey and J. M. Aquilina, Syngress, 2012
5. The Best Damn Cybercrime and Digital Forensics Book Period, J. Wiles and A.Reyes, Syngress, 2007
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

BIG DATA ANALYTICS

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Prerequisites

1. Data Mining
Objectives

1. The purpose of this course is to provide the students with the knowledge of Big data
Analytics principles and techniques.
2. This course is also designed to give an exposure of the frontiers of Big data
Analytics

Outcomes
1. Ability to explain the foundations, definitions, and challenges of Big Data and various
Analytical tools.
2. Ability to program using HADOOP and Map reduce, NOSQL
3. Ability to understand importance of Big Data in Social Media and Mining.

UNIT - I
INTRODUCTION TO BIG DATA: Big Data and its Importance – Four V’s of Big Data –
Drivers for Big Data – Introduction to Big Data Analytics – Big Data Analytics applications.

UNIT - II
BIG DATA TECHNOLOGIES :Hadoop’s Parallel World – Data discovery – Open source
technology for Big Data Analytics – cloud and Big Data –Predictive Analytics – Mobile Business
Intelligence and Big Data

UNIT - III
INTRODUCTION HADOOP : Big Data – Apache Hadoop&HadoopEcoSystem – Moving Data
in and out of Hadoop – Understanding inputs and outputs of MapReduce - Data Serialization.

UNIT - IV
HADOOP ARCHITECTURE :Hadoop: RDBMS VsHadoop,Hadoop Overview, Hadoop
distributors, HDFS, HDFS Daemons, Anatomy of File Write and Read., NameNode, Secondary
NameNode, and DataNode, HDFS Architecture,Hadoop Configuration, Map Reduce
Framework,Role of HBase in Big Data processing, HIVE, PIG.

UNIT - V
Data Analytics with R Machine Learning : Introduction, Supervised Learning, Unsupervised
Learning, Collaborative Filtering, Social Media Analytics, Mobile Analytics, Big Data Analytics
with BigR.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Text Books
1. SeemaAcharya, SubhasiniChellappan, "Big Data Analytics" Wiley 2015.
2. Michael Minelli, Michehe Chambers, “Big Data, Big Analytics: Emerging Business
Intelligence and Analytic Trends for Today’s Business”, 1st Edition, AmbigaDhiraj, Wiely
CIO Series, 2013.
3. Tom White, Hadoop: The Definitive Guide, O‟Reilly Media, Third Edition, 2012.
4. ArvindSathi, “Big Data Analytics: Disruptive Technologies for Changing the Game”, 1st
Edition, IBM Corporation, 2012.

References
1. Jay Liebowitz, “Big Data and Business Analytics” Auerbach Publications, CRC press
(2013)
2. Tom Plunkett, Mark Hornick, “Using R to Unlock the Value of Big Data: Big Data
Analytics with Oracle R Enterprise and Oracle R Connector for Hadoop”, McGraw-
Hill/Osborne Media (2013), Oracle press.
3. Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, “Professional Hadoop Solutions”,
Wiley, ISBN: 9788126551071, 2015.
4. Chris Eaton, Dirk deroos et al. , “Understanding Big data ”, McGraw Hill, 2012.
5. Michael Berthold, David J. Hand, "Intelligent Data Analysis”, Springer, 2007.
6. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics”, 1st Edition, Wiley and SAS Business Series, 2012.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DIGITAL FORENSICS
(Program Elective – I)

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3

Objectives
1. Know the history and evaluation of digital forensics
2. Describe various types of cyber crime
3. Understand benefits of forensics
4. Implement forensics readiness plan
Outcomes
1. Interpret and appropriately apply the laws and procedures associated with identifying,
acquiring, examining and presenting digital evidence.
2. Create a method for gathering, assessing and applying new and existing legislation and
industry trends specific to the practice of digital forensics

UNIT - I
Computer Forensics Fundamentals
Introduction to Computer Forensics, Use of Computer Forensics in Law Enforcement,
Computer Forensics Assistance to Human Resources/Employment Proceedings, Computer
Forensics Services, Benefits of Professional Forensics Methodology, Steps taken by Computer
Forensics Specialists Types of Computer Forensics Technology: Types of Military Computer
Forensic Technology, Types of Law Enforcement — Computer Forensic Technology — Types
of Business Computer Forensic Technology Computer Forensics Evidence and Capture: Data
Recovery Defined — Data Back-up and Recovery — The Role of Back-up in Data Recovery
— The Data-Recovery Solution.

UNIT - II
Evidence Collection and Data Seizure
Why Collect Evidence? Collection Options — Obstacles — Types of Evidence — The Rules
of Evidence — Volatile Evidence — General Procedure — Collection and Archiving —
Methods of Collection — Artifacts — Collection Steps — Controlling Contamination: The
Chain of Custody Duplication and Preservation of Digital Evidence: Preserving the Digital
Crime Scene — Computer Evidence Processing Steps — Legal Aspects of Collecting and
Preserving Computer Forensic Evidence Computer Image Verification and Authentication:
Special Needs of Evidential Authentication — Practical Consideration —Practical
Implementation.

UNIT - III
Computer 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.
Processing Crime and Incident Scenes
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Identifying digital evidence, collecting evidence in private-sector incident scenes, processing

law enforcement crime scenes, preparing for a search, securing a computer incident or crime scene,
seizing digital evidence at the scene, storing digital evidence, obtaining a digital hash,
reviewing a case
UNIT - IV
Current Computer 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.

Textbooks:
1. Computer Forensics, Computer Crime Investigation by John R. Vacca, Firewall Media,
New Delhi.
2. Computer Forensics and Investigations by Nelson, Phillips Enfinger, Steuart,
CENGAGE Learning

References:
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. Computer Evidence Collection & Presentation by Christopher L.T. Brown, Firewall
Media.
4. Homeland Security, Techniques & Technologies by Jesus Mena, Firewall Media.
5. Software Forensics Collecting Evidence from the Scene of a Digital Crime by Robert
M. Slade, TMH 2005
6. Windows Forensics by Chad Steel, Wiley India Edition
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

WEB SECURTIY
(Program Elective – I)

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Course Objectives
1. Give an Overview of information security
2. Give an overview of web secuity
Course Outcomes: Students should be able to
1. Understand the Web architecture and applications
2. Understand client side and server side programming
3. Understand how common mistakes can be bypassed and exploit the application
4. Identify common application vulnerabilities

UNIT I

The Web Security Landscape, The Architecture of the World Wide Web, Cryptography Basics,
Cryptography and the Web, Understanding SSL and TLS, Digital Identification I: Passwords,
Biometrics, and Digital Signatures, Digital Identification II: Digital Certificates, CAs, and PKI

UNIT II

Privacy and Security for Users, Privacy-Protecting Techniques, Privacy-Protecting Technologies,

Backups and Antitheft, Mobile Code I: Plug-Ins, ActiveX, and Visual Basic, Mobile Code II: Java,
JavaScript, Flash, and Shockwave

UNIT III

Web Server Security, Physical Security for Servers, Host Security for Servers, Securing Web
Applications, Deploying SSL Server Certificates

UNIT IV

Securing Your Web Service, Computer Crime, Controlling Access to Your Web Content, Client-
Side Digital Certificates, Code Signing and Microsoft’s Authenticode, Pornography, Filtering
Software, and Censorship

UNIT V

Privacy Policies, Legislation, and P3P, Policies That Protect Privacy and Privacy Policies, Children’s
Online Privacy Protection Act, Digital Payments, Intellectual Property and Actionable Content

Textbook
1.Web Security ,Privacy and Commerce Simson GArfinkel, Gene Spafford,O’Reilly .
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

INTRODUCTION TO DATA SCIENCE

(Program Elective – I)

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Course Objectives:
• Learn concepts, techniques and tools they need to deal with various facets of data science
practice, including data collection and integration
• Understand the basic types of data and basic statistics
• Identify the importance of data reduction and data visualization techniques

Course Outcomes: After completion of the course, the student should be able to
• CO-1: Understand basic terms what Statistical Inference means. Identify probability
distributions commonly used as foundations for statistical modeling. Fit a model to data
• CO-2: describe the data using various statistical measures
• CO-3: utilize R elements for data handling
• CO-4: perform data reduction and apply visualization techniques.

UNIT-I: Introduction
What is Data Science? - Big Data and Data Science hype – and getting past the hype - Datafication
- Current landscape of perspectives - Statistical Inference - Populations and samples - Statistical
modeling, probability distributions, fitting a model – Over fitting.
Basics of R: Introduction, R-Environment Setup, Programming with R, Basic Data Types.

UNIT-II: Data Types & Statistical Description

Types of Data: Attributes and Measurement, What is an Attribute? The Type of an Attribute, The
Different Types of Attributes, Describing Attributes by the Number of Values, Asymmetric
Attributes, Binary Attribute, Nominal Attributes, Ordinal Attributes, Numeric Attributes, Discrete
versus Continuous Attributes.
Basic Statistical Descriptions of Data: Measuring the Central Tendency: Mean, Median, and Mode,
Measuring the Dispersion of Data: Range, Quartiles, Variance, Standard Deviation, and Inter-
quartile Range, Graphic Displays of Basic Statistical Descriptions of Data.

UNIT-III
Vectors: Creating and Naming Vectors, Vector Arithmetic, Vector sub setting, Matrices:
Creating and Naming Matrices, Matrix Sub setting, Arrays, Class.
Factors and Data Frames: Introduction to Factors: Factor Levels, Summarizing a Factor, Ordered
Factors, Comparing Ordered Factors, Introduction to Data Frame, sub setting of Data Frames,
Extending Data Frames, Sorting Data Frames.
Lists: Introduction, creating a List: Creating a Named List, Accessing List Elements, Manipulating
List Elements, Merging Lists, Converting Lists to Vectors
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

UNIT-IV
Conditionals and Control Flow: Relational Operators, Relational Operators and Vectors, Logical
Operators, Logical Operators and Vectors, Conditional Statements.
Iterative Programming in R: Introduction, While Loop, For Loop, Looping Over List.

Functions in R: Introduction, writing a Function in R, Nested Functions, Function Scoping,

Recursion, Loading an R Package, Mathematical Functions in R.

UNIT-V:
Data Reduction: Overview of Data Reduction Strategies, Wavelet Transforms, Principal
Components Analysis, Attribute Subset Selection, Regression and Log-Linear Models: Parametric
Data Reduction, Histograms, Clustering, Sampling, Data Cube Aggregation.
Data Visualization: Pixel-Oriented Visualization Techniques, Geometric Projection Visualization
Techniques, Icon-Based Visualization Techniques, Hierarchical Visualization Techniques,
Visualizing Complex Data and Relations.

TEXT BOOKS:
1. Doing Data Science, Straight Talk from The Frontline. Cathy O’Neil and Rachel Schutt,
O’Reilly, 2014
2. Jiawei Han, Micheline Kamber and Jian Pei. Data Mining: Concepts and Techniques, 3 rd ed.
The Morgan Kaufmann Series in Data Management Systems.
3. K G Srinivas, G M Siddesh, “Statistical programming in R”, Oxford Publications.

REFERENCE BOOKS:
1. Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael Steinbanch, Pearson
Education.
2. Brain S. Everitt, “A Handbook of Statistical Analysis Using R”, Second Edition, 4 LLC,
2014.
3. Dalgaard, Peter, “Introductory statistics with R”, Springer Science & Business Media, 2008.
Paul Teetor, “R Cookbook”, O’Reilly, 2011.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

DISTRIBUTED SYSTEMS

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Prerequisites

1. A course on “ Operating Systems”

2. A course on “Computer Organization & Architecture”
Objectives

1. This course provides an insight into Distributed systems.

2. Topics include- Peer to Peer Systems, Transactions and Concurrency control, Security and
Distributed shared memory
Outcomes

1. Ability to understand Transactions and Concurrency control.

2. Ability to understand Security issues.
3. Understanding Distributed shared memory.
4. 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, OceanStore.

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
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

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, Fourth
Edition, 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,
Pearson Education.

2. Distributed Computing,Principles,Algorithms and Systems,Ajay D.Kshemakalyani

and Mukesh Singhal,Cambridge,rp 2010.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

FEDERATED MACHINE LEARNING

(Program Elective – II)

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Prerequisites
The prerequisite knowledge for this course includes machine learning, basic computer systems and
basic programming skills.

Course Objectives
• Understand the key concepts and issues behind Federated Learning
• Get familiar with key theoretical results of Federated Learning

Course Outcomes
Students will attain the following on completion of the course:
• Knowledge of the basic concepts, architecture and applications of FL.
• Understanding of new research and application trends in FL.

Unit - I
Introduction: Motivation, Federated Learning as a Solution, The Definition of Federated Learning,
Categories of Federated Learning, Current Development in Federated Learning, Research Issues in
Federated Learning, Open-Source Projects, Standardization Efforts, The Federated AI Ecosystem
Background: Privacy-Preserving Machine Learning, PPML and Secure ML, Threat and Security
Models, Privacy Threat Models, Adversary and Security Models, Privacy Preservation Techniques,
Secure Multi-Party Computation, Homomorphic Encryption, Differential Privacy

Unit - II
Distributed Machine Learning: Introduction to DML, The Definition of DML, DML Platforms,
Scalability-Motivated DML, Large-Scale Machine Learning, Scalability-Oriented DML Schemes,
Privacy-Motivated DML, Privacy-Preserving Decision Trees, Privacy-Preserving Techniques,
Privacy-Preserving DML Schemes, Privacy-Preserving Gradient Descent, Vanilla Federated
Learning, Privacy-Preserving Methods

Unit - III
Horizontal Federated Learning: The Definition of HFL, Architecture of HFL, The Client-Server
Architecture, The Peer-to-Peer Architecture, Global Model Evaluation, The Federated Averaging
Algorithm, Federated Optimization, The FedAvg Algorithm, The Secured FedAvg Algorithm,
Improvement of the FedAvg Algorithm, Communication Efficiency, Client Selection
Vertical Federated Learning: The Definition of VFL, Architecture of VFL, Algorithms of VFL,
Secure Federated Linear Regression, Secure Federated Tree-Boosting

Unit - IV
Federated Transfer Learning: Heterogeneous Federated Learning, Federated Transfer Learning,
The FTL Framework, Additively Homomorphic Encryption, The FTL Training Process, The FTL
Prediction Process, Security Analysis, Secret Sharing-Based FTL
Incentive Mechanism Design for Federated Learning: Paying for Contributions, Profit-Sharing
Games, Reverse Auctions, A Fairness-Aware Profit Sharing Framework,Modeling Contribution,
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Modeling Cost, Modeling Regret, Modeling Temporal Regret, The Policy Orchestrator, Computing
Payoff Weightage
Unit - V
Federated Learning for Vision, Language, and Recommendation: Federated Learning for
Computer Vision, Federated CV, Federated Learning for NLP, Federated NLP, Federated Learning
for Recommendation Systems, Recommendation Model, Federated Recommendation System

Federated Reinforcement Learning:

Introduction to Reinforcement Learning, Policy, Reward, Value Function, Model of the
Environment, RL Background Example, Reinforcement Learning Algorithms, Distributed
Reinforcement Learning, Asynchronous Distributed Reinforcement Learning, Synchronous
Distributed Reinforcement Learning, Federated Reinforcement Learning, Background and
Categorization

Textbooks:
1. Federated Learning, Qiang Yang, Yang Liu, Yong Cheng, Yan Kang, Tianjian Chen, and Han
Yu Synthesis Lectures on Artificial Intelligence and Machine Learning 2019
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

HIGH PERFORMANCE COMPUTING

(Program Elective – II)

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Prerequisites
1. A Course on “Computer Organization & Architecture”
2. Operating Systems and Basic Programming
Objectives
1. To understand the Grid, Cluster computing platforms
2. To learn various distributed and parallel computing architecture
3. To learn different computing technologies
Outcomes
1. Understanding the concepts in grid, cluster and pervasive computing
2. Ability to set up cluster and run parallel applications
3. Ability to understand the cluster projects and cluster OS
4. Understanding the core concepts of pervasive computing
UNIT - I
Grid Computing: Data & Computational Grids, The concept of Virtual Organizations, Grid
Architecture, Grid Architecture and Its Relations to Various Distributed Technologies. The
Grid Computing Road Map. The Grid Computing Toolkit: GLOBUS GT3 Toolkit.
UNIT - II

Introduction to Parallel Computing - Programming Using the Message-Passing

Paradigm - Programming Shared - Address Space Platforms

UNIT – III

Cluster Computing at a Glance: Introduction, Scalable Parallel Computer Architectures, A

Cluster Computer and its Architecture, Towards Low Cost Parallel Computing and
Motivations, A Cluster Computer and its Architecture, Cluster Classifications, Commodity
Components for clusters, Network Services/Communication SW, Cluster Middleware and SSI,
Resource Management and Scheduling (RMS), Programming Environments and Tools, Cluster
Applications
Cluster Setup & Its Administration: Introduction, Setting up the cluster, Example Cluster
System – Beowulf;

UNIT – IV
Lightweight Messaging Systems: Introduction, Latency Bandwidth Evaluation of
Communication performance, Traditional Communication Mechanisms for clusters,
Lightweight Communication Mechanisms
Job and Resource Management Systems: Need of Job management, Components and
Architecture.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Scheduling Parallel Jobs on Clusters: Introduction, Rigid Jobs with process migration,
Malleable Jobs with Dynamic Parallelism, Communication-Based Co-scheduling, Batch
Scheduling. Cluster Operating Systems: COMPaS

UNIT – V
Pervasive Computing Concepts & Scenarios: Pervasive Computing, Pervasive Computing
Infrastructure, Device Technology: Hardware, Human – Machine Interfaces, Biometrics,
Operating Systems. Java for Pervasive Devices.
Device Connectivity: Protocols, Security, Device Management.

Textbooks:
1. Grid Computing, J. Joseph & C. Fellenstien, Pearson Education
2. Introduction to Parallel Computing, Second Edition, Ananth Grama, Anshul Gupta, George Karypis,
Vipin Kumar Publisher: Addison Wesley
3. High Performance Cluster Computing, Raj kumar Buyya, pearson Education.
4. Pervasive Computing, J. Burkhardt et.al, Pearson Education

References:
1. The Grid 2: Blue Print for a New Computing Infrastructure, Ian Foster and Carl
Kesselman, 2nd Edition, The Elsevier Series.
A networking approach to Grid Computing, Minoli , Wiley
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

OPTIMIZATION TECHNIQUES
(Program Elective – II)

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Prerequisites
1. A course on “Mathematics”

Objectives
1. This course explains various optimization problems and the techniques to address those problems.
2. To study Linear Programming, dynamic programming and optimization Techniques etc.
3. To understand the theory of games.
Outcomes
1. Gain the knowledge of optimization techniques
2. Get the skill to apply Optimization techniques to address the real time problems .

UNIT – I
Development – Definition– Characteristics and Phases – Types of models – Operations Research models –
applications.
Allocation: Linear Programming Problem - Formulation – Graphical solution – Simplex method – Artificial
variables techniques: Two–phase method, Big-M method; Duality Principle.

UNIT – II
Transportation Problem – Formulation – Optimal solution, unbalanced transportation problem –
Degeneracy.
Assignment problem – Formulation – Optimal solution - Variants of Assignment Problem; Traveling
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 –m x 2 & 2 x n games - graphical method – m x n games - dominance principle.
Inventory: Introduction – Single item, Deterministic models – Types - Purchase inventory models with one
price break and multiple price breaks –Stochastic models – demand discrete variable or continuous variable –
Single Period model with no setup cost.

UNIT - V
Waiting Lines: Introduction – Terminology-Single Channel – Poisson arrivals and Exponential Service times
– with infinite population and finite population models– Multichannel – 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
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

1. Operation Research, J.K.Sharma, MacMilan.

2. Introduction to O.R , Taha, PHI

References
1. Operations Research: Methods and Problems, Maurice Saseini, Arhur Yaspan and Lawrence Friedman
2. Operations Research, A.M.Natarajan, P.Balasubramaniam, A. Tamilarasi, Pearson Education.
3. Operations Research, Wagner, PHI Publications.
4. Introduction to O.R, Hillier & Libermann, TMH
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

AUGMENTED REALITY AND VIRTUAL REALITY

(Program Elective – III)

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Unit I
Introduction of Virtual Reality: Fundamental Concept and Components of Virtual
Reality. Primary Features and Present Development on Virtual Reality.
Multiple Models of Input and Output Interface in Virtual Reality: Input -- Tracker,
Sensor, Digital Glove, Movement Capture, Video-based Input, 3D Menus & 3DScanner etc.
Output -- Visual /Auditory / Haptic Devices.
Unit II
Visual Computation in Virtual Reality: Fundamentals of Computer Graphics.
Software and Hardware Technology on Stereoscopic Display. Advanced Techniques in CG:
Management of Large Scale Environments & Real Time Rendering.
Unit III
Interactive Techniques in Virtual Reality: Body Track, Hand Gesture, 3D Manus,
Object Grasp.
Development Tools and Frameworks in Virtual Reality: Frameworks of Software
Development Tools in VR. X3D Standard; Vega, MultiGen, Virtools etc.
Unit IV
Application of VR in Digital Entertainment: VR Technology in Film & TV
Production. VR Technology in Physical Exercises and Games. Demonstration of Digital
Entertainment by VR.
Unit V
Augmented and Mixed 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, wireless displays
in educational augmented reality applications, mobile projection interfaces, marker-less
tracking for augmented reality, enhancing interactivity in AR environments, evaluating AR
systems.

Textbooks:
1) Burdea, G. C. and P. Coffet. Virtual Reality Technology, Second Edition. Wiley-IEEE
Press, 2003/2006.
2) Alan B. Craig, Understanding Augmented Reality, Concepts and Applications, Morgan
Kaufmann, 2013.

References:
1) Alan Craig, William Sherman and Jeffrey Will, Developing Virtual Reality Applications,
Foundations of Effective Design, Morgan Kaufmann, 2009.
 Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SMART TECHNOLOGIES
(Program Elective – III)

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Course Objectives
Obtain knowledge on sensors, sensors with microcontrollers and their applications
Course Outcomes
1. Analyze the sensors available in IoT based on application requirements and the Sensing method
2. Create a Real-time application by choosing appropriate sensors for temperature monitoring.
3. Interfacing different types of Sensors with MCU
4. Infer Wireless Sensing, RF Sensing and RF MEMS
5. Design a real-time application for landslide monitoring and hazard mitigation

Unit 1: BASICS OF SENSORS

Introduction- Sensor Vs Transducer, Nature of Sensors, Sensor Output Characteristics, Sensing
Technologies, Digital Output Sensors.
Unit 2: APPLICATION SPECIFIC SENSORS
Occupancy and motion detectors: ultrasonic – microwave – capacitive detectors- optical presence
sensor, Light Detectors: Photo diodes – phototransistor – photoresistor- CCD and CMOS image
sensors, Temperature Sensors: thermos-resistive sensors – thermoelectric contact sensor
Unit 3: SENSOR WITH MICROCONTROLLER
Introduction, Amplification and Signal Conditioning, Integrated Signal Conditioning, Digital
Conversion, MCU Control, MCUs for Sensor Interface, Techniques and Systems Considerations,
Sensor Integration
Unit 4: WIRELESS SENSING
Wireless Data and Communications, Wireless Sensing Networks, Industrial Wireless Sensing
Networks, RF Sensing, Telemetry, RF MEMS, Complete System Consideration.
Unit 5: SMART APPLICATIONS AND SYSTEM REQUIREMENTS
Automotive Applications, Industrial (Robotic) Applications, Consumer Applications, Future Sensor
Plus Semiconductor Capabilities, Future System Requirements.

Text Books:
1. Frank, Randy, “Understanding smart sensors”, Artech House integrated microsystems series,
3rd Edition, 2013.
2. Jacob Fraden, “Handbook of Modern Sensors: Physics, Designs, and Applications”, 5th Edition,
Springer, 2016

References:
1. Vlasios Tsiatsis, Stamatis Karnouskos, Jan Holler, David Boyle, Catherine Mulligan, "Internet of
Things: Technologies and Applications for a New Age of Intelligence", Academic Press
2. Henry Leung, Subhas Chandra Mukhopadhyay, "Intelligent Environmental Sensing", Springer,
22-Jan-2015.

E BOOKS
1. https://www.sciencedirect.com/topics/engineering/smart-sensors
2. https://www.azosensors.com/article.aspx?ArticleID=1289
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

QUANTUM COMPUTING
(Program Elective – III)

IV Year B.Tech. CSE II-Semester L T P C

3 0 0 3
Unit I
History of Quantum Computing : Importance of Mathematics, Physics and Biology.
Introduction to Quantum Computing : Bits Vs Qubits, Classical Vs Quantum logical operations

Unit II
Background Mathematics : Basics of Linear Algebra, Hilbert space, Probabilities and
measurements.
Background Physics : Paul's exclusion Principle, Superposition, Entanglement and super-
symmetry, density operators and correlation, basics of quantum mechanics, Measurements in bases
other than computational basis.
Background Biology : Basic concepts of Genomics and Proteomics (Central Dogma)

Unit III
Qubit : Physical implementations of Qubit.
Qubit as a quantum unit of information. The Bloch sphere

Quantum Circuits : single qubit gates, multiple qubit gates, designing the quantum circuits. Bell
states.

Unit IV
Quantum Algorithms: Classical computation on quantum computers. Relationship between
quantum and classical complexity classes. Deutsch’s algorithm, Deutsch’s-Jozsa algorithm, Shor’s
factorization algorithm, Grover’s search algorithm.

Unit V
Noise and error correction : Graph states and codes, Quantum error correction, fault-tolerant
computation.
Quantum Information and Cryptography : Comparison between classical and quantum information
theory. Quantum Cryptography, Quantum teleportation

Textbooks:
1. Quantum Computing for Computer Scientists by Noson S. Yanofsky and Mirco A. Mannucci
2. Nielsen M. A., Quantum Computation and Quantum Information, Cambridge

References :
1. Benenti G., Casati G. and Strini G., Principles of Quantum Computation and Information, Vol. I:
Basic Concepts, Vol II: Basic Tools and Special Topics, World Scientific.
2. Pittenger A. O., An Introduction to Quantum Computing Algorithms
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

BIG DATA ANALYTICS LAB

IV Year B.Tech. CSE II-Semester L T P C

0 0 4 2
Objectives

1. The purpose of this course is to provide the students with the knowledge of Big data Analytics
principles and techniques.
2. This course is also designed to give an exposure of the frontiers of Big data Analytics

Outcomes
1. Ability to explain the foundations, definitions, and challenges of Big Data and various
Analytical tools.
2. Ability to program using HADOOP and Map reduce, NOSQL
3. Ability to understand importance of Big Data in Social Media and Mining.

List of Experiments

1. Implement a simple map-reduce job that builds an inverted index on the set of input documents
(Hadoop)
2. Perform Social media analysis using cassandra
3. Buyer event analytics using Cassandra on suitable product sales data.
4. Using Power Pivot (Excel) Perform the following on any dataset
a) Big Data Analysis
b) Big Data Charting
5. Use R-Project to carry out statistical analysis of big data
6. Use R-Project for data visualization of social media data
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

RESEARCH METHODOLOGY AND IPR

IV Year B.Tech. CSE II-Semester L T P

C
2 0 0 2
Course Objectives:
• To understand the research problem
• To know the literature studies, plagiarism and ethics
• To get the knowledge about technical writing
• To analyze the nature of intellectual property rights and new developments
• To know the patent rights

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

• Understand research problem formulation.
• Analyze research related information
• Follow research ethics
• Understand that today’s world is controlled by Computer, Information Technology, but
tomorrow world will be ruled by ideas, concept, and creativity.
• Understanding that when IPR would take such important place in growth of individuals &
nation, it is needless to emphasis the need of information about Intellectual Property Right to
be promoted among students in general & engineering in particular.
• Understand that IPR protection provides an incentive to inventors for further research work
and investment in R & D, which leads to creation of new and better products, and in turn
brings about, economic growth and social benefits.

UNIT-I:
Meaning of research problem, Sources of research problem, Criteria Characteristics of a good
research problem, Errors in selecting a research problem, Scope and objectives of research problem.
Approaches of investigation of solutions for research problem, data collection, analysis,
interpretation, Necessary instrumentations

UNIT-II:
Effective literature studies approaches, analysis, Plagiarism, Research ethics

UNIT-III:
Effective technical writing, how to write report, Paper Developing a Research Proposal, Format of
research proposal, a presentation and assessment by a review committee

UNIT-IV:
Nature of Intellectual Property: Patents, Designs, Trade and Copyright. Copyleft and Creative
Commons Licensing. Process of Patenting and Development: technological research, innovation,
patenting, development. International Scenario: International cooperation on Intellectual Property.
Procedure for grants of patents, Patenting under PCT.

UNIT-V:
Patent Rights: Scope of Patent Rights. Licensing and transfer of technology. Patent information
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

and databases. Geographical Indications. New Developments in IPR: Administration of Patent

System. New developments in IPR; IPR of Biological Systems, Computer Software etc. Traditional
knowledge Case Studies, IPR and IITs.
TEXT BOOKS:
1. Stuart Melville and Wayne Goddard, “Research methodology: an introduction for science &
engineering students’”
2. Wayne Goddard and Stuart Melville, “Research Methodology: An Introduction”
REFERENCES:
1. Ranjit Kumar, 2nd Edition , “Research Methodology: A Step by Step Guide for beginners”
2. Halbert, “Resisting Intellectual Property”, Taylor & Francis Ltd ,2007.
3. Mayall , “Industrial Design”, McGraw Hill, 1992.
4. Niebel , “Product Design”, McGraw Hill, 1974.
5. Asimov , “Introduction to Design”, Prentice Hall, 1962.
6. Robert P. Merges, Peter S. Menell, Mark A. Lemley, “ Intellectual Property in New
Technological Age”, 2016.
7. T. Ramappa, “Intellectual Property Rights Under WTO”, S. Chand, 2008
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

FOG COMPUTING
(Program Elective – IV)

V Year B.Tech. CSE I-Semester L T P C

3 0 0 3
Objectives:
• Learn principles and paradigms of fog computing, edge computing
• Optimization problems in fog and edge computing
• Know data management, security and privacy issues in fog computing
• Explore various applications of fog computing.
Course Outcomes:
1. Understand the basics of fog computing
2. Compare fog with cloud, edge computing
3. Discuss the significance of middleware for fog computing
4. Understand optimization problems.
5. Handle data management, security and privacy issues in fog computing

UNIT-I
Fog Computing: Concepts, Principles and Related Paradigms:- Introduction, Fog Computing
and its related technologies, Fog Computing Issues-Security and Privacy, Fog Network Topology
and Location Awareness of Nodes, Interoperability and Other Issues. Cloud Paradigm Versus Fog
Computing, Fog Computing Versus Edge Computing, Fog Computing Reference Architecture, Fog
Computing Application Scenarios, Future of Fog Computing.
Dichotomy of Fog Computing in the Realm of Cloud Computing: Exploring the Emerging
Dimensions:- Key Tenets of Cloud Computing, Cloud Versus Fog Computing, Promise of Cloud
and Fog Computing, Platform Design in Cloud and Fog Computing, Issues in Cloud and Fog
Computing, Legal Dimensions of Cloud and Fog Computing

UNIT-II
Fog Computing in a Developing World Context - How Fog Computing works, Characteristics of
Fog Computing, Factors Affecting the Adoption of Fog Computing, Technology Adoption Theories,
Technological Factors.
Edge and Fog: A Survey, Use Cases, and Future Challenges – Edge computing architecture, fog
computing architecture, Illustrative use cases, future challenges

UNIT-III
Middleware for Fog and Edge Computing - Need for Fog and Edge Computing Middleware,
Design Goals, State-of-the-Art Middleware Infrastructures, System Model, Proposed
Architecture, Case Study Example, Future Research Directions.
Optimization Problems in Fog and Edge Computing - The Case for Optimization in Fog
Computing, Formal Modeling Framework for Fog Computing, Optimization Opportunities along
the Fog Architecture, optimization techniques

UNIT-IV
Data Management in Fog Computing:- Introduction-Structure of Data Management in fog
computing, Background- data management in fog computing, Fog Data Management, Future
Research and Direction-Security, Defining the Level of Data Computation and Storage
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

Security and Privacy Issues in Fog Computing :-Trust in IoT, Authentication,

Authorization, Privacy ,Web Semantics and Trust Management for Fog Computing,
Discussion-Authentication ,Authorization.

UNIT-V
Applications and Issues:
Exploiting Fog Computing in Health Monitoring, Smart Surveillance Video Stream Processing at
the Edge for Real-Time Human Objects Tracking, Fog Computing Model for Evolving Smart
Transportation Applications

Text Books:
1. Zaigham Mahmood, Fog Computing- Concepts, Frameworks and Technologies, Springer,2015

2. Fog and Edge Computing: Principles and Paradigms,Rajkumar Buyya, Satish Narayana
Srirama, January 2019
3. Fog Computing: Theory and Practice, Assad Abbas (Editor), Samee U. Khan (Editor), Albert
Y. Zomaya-Wiley Series-April 2020
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

WEB SERVICES & SOA

(Program Elective – IV)

V Year B.Tech. CSE I-Semester L T P C

3 0 0 3
OBJECTIVES:
1. To gain understanding of the basic principles of service orientation
2. To learn service oriented analysis techniques
3. To learn technology underlying the service design
4. To learn the concepts such as SOAP, registering and discovering services.

Outcomes:
At the end of this course, students are expected to gain the following learning:
1. Get the foundations and concepts of service based computing
2. Advocate the importance and means of technology alignment with business
3. Understanding the basic operational model of web services,
4. Gain the knowledge of key technologies in the service oriented computing arena
5. Apply and practice the learning through a real or illustrative project/case study.

UNIT- I
Evolution and Emergence of Web Services – Evolution of distributed computing. Core distributed
computing technologies – client/server, CORBA, JAVA RMI, Micro Soft DCOM, MOM, Challenges
in Distributed Computing, role of J2EE and XML in distributed computing, emergence of Web
Services and Service Oriented Architecture (SOA). Introduction to Web Services – The definition of
web services, basic operational model of web services, tools and technologies enabling web
services, benefits and challenges of using web services.

UNIT -II
Web Service Architecture – Web services Architecture and its characteristics, core building blocks
of web services, standards and technologies available for implementing web services, web services
communication, basic steps of implementing web services. Describing Web Services – WSDL
introduction, non functional service description, WSDL1.1 Vs WSDL 2.0, WSDL document, WSDL
elements, WSDL binding, WSDL tools, WSDL port type, limitations of WSDL.

UNIT III
Brief Over View of XML – XML Document structure, XML namespaces, Defining structure in XML
documents, Reuse of XML schemes, Document navigation and transformation. SOAP : Simple
Object Access Protocol, Inter-application communication and wire protocols, SOAP as a messaging
protocol, Structure of a SOAP message, SOAP envelope, Encoding, Service Oriented Architectures,
SOA revisited, Service roles in a SOA, Reliable messaging, The enterprise Service Bus, SOA
Development Lifecycle, SOAP HTTP binding, SOAP communication model, Error handling in SOAP.

UNIT – IV
Registering and Discovering Services : The role of service registries, Service discovery, Universal
Description, Discovery, and Integration, UDDI Architecture, UDDI Data Model, Interfaces, UDDI
Implementation, UDDI with WSDL, UDDI specification, Service Addressing and Notification,
Referencing and addressing Web Services, Web Services Notification.

UNIT - V
SOA and web services security considerations, Network-level security mechanisms, Application-
level security topologies, XML security standards, Semantics and Web Services, The semantic
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

interoperability problem, The role of metadata, Service metadata, Overview of .NET and J2EE, SOA
and Web Service Management, Managing Distributed System, Enterprise management Framework,
Standard distributed management frameworks, Web service management, Richer schema
languages, WS-Metadata Exchange.

Text Books:
1. Web Services & SOA Principles and Technology, Second Edition, Michael P. Papazoglou.
2. Developing Java Web Services, R. Nagappan, R. Skoczylas, R.P. Sriganesh, Wiley India.
3. Developing Enterprise Web Services, S. Chatterjee, J. Webber, Pearson Education.

Reference Books:
1. XML, Web Services, and the Data Revolution, F.P.Coyle, Pearson Education.
2. Building web Services with Java, 2nd Edition, S. Graham and others, Pearson Education.
3. Java Web Services, D.A. Chappell & T. Jewell, O’Reilly, SPD.
4. McGovern, et al., “Java web Services Architecture”, Morgan Kaufmann Publishers, 2005.
J2EE Wer Services, Richard Monson-Haefel, Pearson Education.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

RANDOMIZED ALGORITHMS
(Program Elective – IV)

V Year B.Tech. CSE I-Semester L T P C

3 0 0 3
UNIT I
Review of Basic Probability, Polynomial Identity Testing, Schwartz-Zippel Lemma ,
Reduction from Perfect Bipartite Matching to PIT, Randomized Quick sort, Markov, Chebyshev,
and Chernoff bounds
Tossing coins, coupon collector problem, birthday paradox, Balls and bins, Two-point sampling,
Randomized rounding: Multi-commodity flow

UNIT II
Introduction to Markov chain, randomized algorithm for 2SAT, stationary distribution, Irreducible
and aperiodic Markov chain, fundamental theorem of Markov chain (statement only), coupling,
Random walk, Metropolis Algorithm, Mixing time of Random Walk on Cycles, Proof of the
fundamental Theorem of Markov chains

UNIT III
Finishing proof of the fundamental Theorem of Markov chains, hitting time, commute time, cover
time, Monte Carlo Method, FPRAS for DNF Counting, FPRAS for Independent Set Counting
using Monte Carlo Method, Overview of Path Coupling, Introduction to Probabilistic Methods

UNIT IV
Probabilistic method -- method of expectation, alteration; Lovasz Local Lemma and its application,
Method of Conditional Expectation for De-randomization, Introduction to Universal Hash Family,
Perfect Hashing, Cuckoo Hashing, Bloom Filter, Count Min Sketch, Construction of Universal
Hash Family, Nearest Neighbor Search (NNS), Point Location in Equal Balls (PLEB), Locality
Sensitive Hashing (LSH), Johnson Linden Strauss Lemma

UNIT V
Sub-Gaussian Random Variables, Introduction to Probabilistic Tree Embedding, Probabilistic Tree
Embedding, buy at Bulk Network Design, Martingale: Definition, Doob's Martingale, Stopping
Time Theorem (without proof), Wald's equation, Azuma-Hoeffding Inequality, McDiarmid's
Inequality, Applications, Problem Solving Session.

Textbooks:
1. Randomized Algorithms: Rajeev Motwani, Prabhakar Raghavan
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data
Analysis by Eli Upfal and Michael Mitzenmacher.
Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SOCIAL NETWORK ANALYSIS

V Year B.Tech. CSE I-Semester L T P C

3 0 0 3
Prerequisites
1. A course on “Web Technologies”
2. A course on “Computer Networks”
3. A course on “Data Warehousing and Data Mining”

Course Objectives
1. It introduces the concepts of social media
2. It provides the mechanisms for social network analysis
3. Includes the concepts that allow for better visualisation and analysis of widely used services
such as email, Wikis, Twitter, flickr, YouTube, etc.

Course Outcomes
1. Ability to construct social network maps easily
2. Gain skills in tracking the content flow through the social media
3. Use NodeXL to perform social network analysis

UNIT I:
Introduction: Social Media and Social Networks
Social Media: New Technologies of Collaboration
Social Network Analysis: Measuring, Mapping, and Modelling collections of Connections.

UNIT-II:
NodeXL, Layout, Visual Design, and Labelling, Calculating and Visualising Network Metrics,
Preparing Data and Filtering, Clustering and Grouping.

UNIT-III:
CASE STUDIES-I: Email: The lifeblood of Modern Communication. Thread Networks:
Mapping Message Boards and Email Lists Twitter: Conversation, Entertainment and Information

UNIT-IV:
CASE STUDIES-II: Visualising and Interpreting Facebook Networks, WWW Hyperlink Networks

UNIT-V:
CASE STUDIES-III: You Tube: Contrasting Patterns of Content Interaction, and Prominence.
Wiki Networks: Connections of Creativity and Collaboration

Text Books:
1. Hansen, Derek, Ben Sheiderman, Marc Smith, Analysing Social Media Networks with NodeXL:
Insights from a Connected World, Morgan Kaufmann, 2011.
2. Avinash Kaushik, Web Analytics 2.0: The Art of Online Accountability, Sybex, 2009.

References:

1. Marshall Sponder, Social Media Analytics: Effective Tools for Building, Interpreting and
Using Metrics, 1stEdition, MGH, 2011
 Dept. of CSE/JNTUHUCEH B.Tech. (IDP) w.e.f. 2021-22 Academic Year

SOCIAL NETWORK ANALYSIS LAB

V Year B.Tech. CSE I-Semester L T P C

0 0 4 2

Course Objectives
1. Exposure to various web and social media analytic techniques.
Course Outcomes
1. Knowledge on decision support systems
2. Apply natural language processing concepts on text analytics
3. Understand sentiment analysis
4. Knowledge on search engine optimization and web analytics
List of Experiments
1. Preprocessing text document using NLTK of Python
a. Stopword elimination
b. Stemming
c. Lemmatization
d. POS tagging
e. Lexical analysis
2. Sentiment analysis on customer review on products
3. Web analytics
a. Web usage data(web server log data, clickstream analysis)
b. Hyperlink data
4. Search engine optimization- implement spamdexing
5. Use Google analytics tools to implement the following
a. Conversion Statistics
b. Visitor Profiles
6. Use Google analytics tools to implement the Traffic Sources.

Resources:
1. Stanford core NLP package
2. GOOGLE.COM/ANALYTICS

Text Books
1. Ramesh Sharda, Dursun Delen, Efraim Turban, BUSINESS INTELLIGENCE AND
ANALYTICS: SYSTEMS FOR DECISION SUPPORT, Pearson Education

Reference books:
1. Rajiv Sabherwal, Irma Becerra- Fernandez,” Business Intelligence –Practice,
Technologies and Management”, John Wiley 2011.
2. Lariss T. Moss,ShakuAtre, “ Business Intelligence Roadmap”, Addison-Wesley It Service.
3. Yuli Vasiliev, “ Oracle Business Intelligence : The Condensed Guide to Analysis and
Reporting”, SPD Shroff, 2012.