R22 B.Tech.

CSE (AI & ML) SDES

Syllabus

Scheme of Instructions/Syllabi
of
B.Tech- Regular -Four Year Degree Program
(For batches admitted from A.Y. 2022-23)
&
B.Tech Lateral Entry Scheme
(For batches admitted from A.Y. 2023-24)

COMPUTER SCIENCE AND ENGINEERING (ARTIFICIAL INTELLEGENCE &

MACHINE LEARNING)

SREE DATTHA INSTITUTE OF ENGINEERING AND SCIENCE

(An Autonomous Institution)
(Accredited by NBA, NAAC A+, Approved by AICTE & Affiliated to JNTU, Hyderabad)
Sheriguda, Ibrahimpatnam, RangareddyDist., Greater Hyderabad– 501510.

1
R22 B.Tech. CSE (AI & ML) SDES
Syllabus

2
 R22 B.Tech. CSE (AI & ML) SDES
Syllabus

SREE DATTHA INSTITUTE OF ENGINEERING AND SCIENCE

AUTONOMOUS
B.Tech. in COMPUTER SCIENCE AND ENGINEERING (ARTIFICIAL
INTELLEGENCE & MACHINE LEARNING)

COURSE STRUCTURE (SDES-R22 Regulations)

Applicable from AY 2022-23 Batch

I YEAR I SEMESTER

Course Cour Hrs/ Credi

S.No. L T P S
Code se week ts
1. A10001 Matrices and Calculus 3 1 0 0 4 4
2. A10002 Applied Physics 3 1 0 0 4 4
3. A10506 Programming for Problem Solving 3 0 0 0 4 3
4. A10301 Engineering Workshop 0 1 3 0 4 2.5
5. A10003 English for Skill Enhancement 2 0 0 0 2 2
6. A10501 Elements of Computer Science & 0 0 2 0 2 1
Engineering
7. A10004 Applied Physics Laboratory 0 0 3 0 3 1.5
8. A10507 Programming for Problem Solving 0 0 2 0 2 1
Laboratory
9. A10005 English Language and Communication 0 0 2 0 2 1
SkillsLaboratory
Total 11 3 12 0 27 20

I YEAR II SEMESTER

S. Course Cours LT P S Hrs/ Cre

No Code e week dits
.
1. A10009 Ordinary Differential Equations and 3 1 0 0 4 4
Vector Calculus
2. A10007 Engineering Chemistry 3 1 0 0 4 4
3. A10302 Computer Aided Engineering Graphics 1 0 4 0 5 3
4. A10203 Basic Electrical Engineering 2 0 0 0 2 2
3
R22 B.Tech. CSE (AI & ML) SDES
Syllabus
5. A10402 Electronic Devices and Circuits 2 0 0 0 3 2
6. A10008 Engineering Chemistry Laboratory 0 0 2 0 2 1
7. A10204 Basic Electrical Engineering 0 0 2 0 2 1
Laboratory
8. A10508 Python Programming Laboratory 0 1 2 0 3 2
9. A10510 IT Workshop 0 0 2 0 2 1
Total 1 3 12 0 27 20
1

II YEAR I SEMESTER
Course
S. Course Title L T P S Hrs/ Cred
No. Code week its
1 A16601 Discrete Mathematics 3 0 0 0 3 3
2 A10511 Data Structures 3 1 0 0 4 3
3 A10512 Computer Organization and 3 0 0 0 3 3
Architecture
4 A16602 Software Engineering 3 0 0 0 3 3
5 A16603 Operating Systems 3 0 0 0 3 3
6 A10514 Data Structures Lab 0 0 2 0 2 1.5
7 A16604 Operating Systems Lab 0 0 2 0 2 1.5
8 A16605 Software Engineering Lab 0 0 2 0 2 1
9 A10012 Constitution of India 3 0 0 0 3 0
10 A16606 Skill Development Course (Node 0 0 0 2 2 1
JS/ React JS/ Django)
Total 18 1 6 2 27 20

II YEAR II SEMESTER

Course
S. No. Course Title L T P S Hrs/ Cre
Code week dits
1 A16607 Mathematical and Statistical Foundations 3 0 0 0 3 3
2 A16608 Automata Theory and Compiler Design 3 0 0 0 3 3
3 A10518 Database Management Systems 3 0 0 0 3 3
4 A16609 Introduction to Artificial Intelligence 3 0 0 0 3 3
5 A10513 Object Oriented Programming through 3 0 0 0 3 3
Java
6 A10519 Database Management Systems Lab 0 0 2 0 2 1
7 A16610 Java Programming Lab 0 0 2 0 2 1
4
 R22 B.Tech. CSE (AI & ML) SDES
Syllabus
8 A17601 Real-time Research Project/Field-Based 0 0 4 0 4 2
Research Project
9 A10013 Gender Sensitization Lab 0 0 2 0 2 0
10 A16611 Skill Development Course (Prolog/ Lisp/ 0 0 0 2 2 1
Pyswip)
Seminar, Document Preparation 0 0 0 1 1 0
Total 15 0 12 3 28 20

III YEAR I SEMESTER

Course
S. No. Course Title L T P S Hrs/ Cre
Code week dits
1. A10520 Design and Analysis of Algorithms 3 1 0 0 4 4
2. A16612 Machine Learning 3 0 0 0 3 3
3. A10521 Computer Networks 3 0 0 0 3 3
4. Business Economics & Financial Analysis 3 0 0 0 3 3
5. Professional Elective-I 3 0 0 0 3 3
6. A16617 Machine Learning Lab 0 0 2 0 2 1
7. A10528 Computer Networks Lab 0 0 2 0 2 1
Advanced English Communication Skills
8. A10017 0 0 2 0 2 1
lab
9. A10530 Skill development course (UI design-Flutter) 0 0 0 2 2 1
10. A10018 Intellectual Property Rights 3 0 0 0 3 0
11 Seminar, Document Preparation 0 0 0 1 1 0
Total 18 1 6 3 28 20

III YEAR II SEMESTER

Course
S. Course Title L T P S H Cre
No. Code rs dits
/
w
ee
k
1. A16619 Knowledge Representation and 3 0 0 0 3 3
Reasoning
2. A13308 Data Analytics 3 0 0 0 3 3
3. A10527 Natural Language Processing 3 1 0 0 4 4
4. Professional Elective–II 3 0 0 0 3 3
5. Open Elective-I 3 0 0 0 3 3
5
R22 B.Tech. CSE (AI & ML) SDES
Syllabus
6. A10538 NaturalLanguage Processing Lab 0 0 2 0 2 1
7. A13313 Data Analytics Lab 0 0 2 0 2 1
8. A10540 Industrial Oriented Mini Project/ 0 4
0 0 4 2
Internship/Skill Development Course
(DevOps)
9. Environmental Science 3 0 0 0 3 0
10 Seminar, Document Preparation 0 0 0 1 1 0
Total 18 1 8 1 28 20

Environmental Science in III Yr II Sem Should be Registered by Lateral Entry

Students Only.

IVYEAR I SEMESTER
Course
S. No. Cour L T P S Hrs Cr
Code se / edi
Title wee ts
k
1 A16620 Deep Learning 3 0 0 0 3 3
2 A16621 Nature Inspired Computing 2 0 0 0 2 2
3 Professional Elective-III 3 0 0 0 3 3
4 A16622 Professional Elective-IV 3 0 0 0 3 3
5 A16623 Open Elective-II 3 0 0 0 3 3
6 A16624 Professional Practice, Law& Ethics 0 0 4 0 4 2
7 A10532 Professional Elective-III Lab 0 0 2 0 2 1
8 A13318 Project Stage-I 0 0 6 0 6 3
9 Seminar, Document Preparation 0 0 0 1 1 0
10 Total Credits 14 0 12 1 27 20

IV YEAR II SEMESTER

6
 R22 B.Tech. CSE (AI & ML) SDES
Syllabus Course
S. No. Cours L T P S H Credit
Code e Title rs/ s
we
ek
1 Professional Elective-V 3 0 0 3 3
2 A16634 Professional Elective–VI 3 0 0 3 3
3 A16635 Open Elective –III 3 0 0 3 3
4 A16636 Project Stage–II including Seminar 0 0 22 22 9+2
Total Credits 9 0 22 31 20

*MC – Satisfactory/Unsatisfactory
Professional Elective-I
A16614 Graph Theory
A16615 Introduction to Data Science
A16616 Web Programming
A10523 Image Processing
A16613 Computer Graphics

Professional Elective – II

A10533 Software Testing Methodologies

A10525 Information Retrieval Systems
A13311 Pattern Recognition
A16620 Computer Vision and Robotics
A16621 Data Warehousing and Business Intelligence

Professional Elective – III

A16622 Internet of Things

A16623 Data Mining
A16624 Scripting Languages
A10532 Mobile Application Development
7
R22 B.Tech. CSE (AI & ML) SDES
Syllabus
A13318 Cloud Computing
#
Courses in PE - III and PE - III Lab must be in 1-1 correspondence.
Professional Elective -IV
A16625 Quantum Computing
A16626 Expert Systems
A16627 Semantic Web
A16628 Game Theory
A16629 Mobile Computing

Professional Elective - V
A16634 Social Network Analysis
A16635 Federated Machine Learning
A16636 Augmented Reality & Virtual Reality
A16637 Web Security
A10546 Ad-hoc & Sensor Networks

Professional Elective – VI
A16638 Speech and Video Processing
A10540 Robotic Process Automation
A16639 Randomized Algorithms
A16643 Cognitive Computing
A16641 Conversational AI

Open Elective I:
1. OE : Fundamentals of AI
2. OE : Machine Learning Basics

Open Elective II:

1. OE : Introduction to Natural Language Processing
2. OE : AI applications

Open Elective III:

1. OE : Chatbots
2. OE : Evolutionary Computing

8
R22 B.Tech. CSE SDES
Syllabus

DESIGN AND ANALYSIS OF ALGORITHMS

Course Code: A10520 Subject

Code:

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

3 1 0 4
Prerequisites:
1. A course on “Computer Programming and Data Structures”.
2. A course on “Advanced Data Structures”.

Course Objectives:
 Introduces the notations for analysis of the performance of algorithms and
the data structure of disjoint sets.
 Describes major algorithmic techniques (divide-and-conquer, backtracking,
dynamic programming, greedy, branch and bound methods) and mention
problems for which each technique is appropriate
 Describes how to evaluate and compare different algorithms using worst-,
average-, and best case analysis.
 Explains the difference between tractable and intractable problems, and
introduces the problems that are P, NP and NP complete.

Course Outcomes:
 Analyze the performance of algorithms
 Choose appropriate data structures and algorithm design methods for a specified
application
 Understand the choice of data structures and the algorithm design methods
 Illustrate Dynamic programming strategies and Greedy strategies.
 Examine various graph algorithms and their complexities.

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, Priority Queue-
Heaps, Heap sort Backtracking: General method, applications, n-queen’s problem,
R22 B.Tech. CSE SDES
Syllabus
sum of subsets problem, graph Coloring, Hamiltonian cycles.

UNIT - III
Dynamic Programming: General method, applications- Optimal binary search
tree, 0/1 knapsack problem, All pairs shortest path problem, Traveling salesperson
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.
Basic Traversal and Search Techniques: Techniques for Binary Trees, Techniques for
Graphs, Connected components, Biconnected components.

UNIT - V
Branch and Bound: General method, applications - Traveling salesperson
problem, 0/1 knapsack problem - LC Branch and Bound solution, FIFO Branch
and Bound solution.
NP-Hard and NP-Complete problems: Basic concepts, non-deterministic
algorithms, NP-Hard and NP-Complete classes, Cook’s theorem.
TEXT BOOK:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and
Rajasekharan, University press, 1998.

REFERENCE BOOKS:
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
2. Introduction to Algorithms, second edition, T. H. Cormen, C.E. Leiserson,
R. L. Rivest, and C. Stein, PHI Pvt. Ltd./ Pearson Education.
3. Algorithm Design: Foundations, Analysis and Internet Examples, M.T.
Goodrich and R. Tamassia, John Wiley and sons.
R22 B.Tech. CSE (AI & ML)
Syllabus

MACHINE LEARNING

Course Code: A16612 Subject

Code:

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

3 0 0 3
Course Objectives:
 To introduce students to the basic concepts and techniques of Machine Learning.
 To have a thorough understanding of the Supervised and Unsupervised learning
techniques
 To study the various probability-based learning techniques

Course Outcomes:
 Distinguish between, supervised, unsupervised and semi-supervised learning
 Understand algorithms for building classifiers applied on datasets of non-
linearly separable classes
 Understand the principles of evolutionary computing algorithms
 Design an ensemble to increase the classification accuracy
 Gain the knowledge of Reinforcement Learning.

UNIT - I
Learning – Types of Machine Learning – Supervised Learning –– Design a
Learning System – Perspectives and Issues in Machine Learning – Concept
Learning Task – Concept Learning as Search – Finding a Maximally Specific
Hypothesis – Version Spaces and the Candidate Elimination Algorithm –
Linear– Linear Separability – Linear Regression.

UNIT - II
The Brain and the Neuron , Discriminates: – Perceptron ,Multi-layer Perceptron–
Going Forwards – Going Backwards: Back Propagation Error – Multi-layer
Perceptron in Practice – Examples of using the MLP – Overview – Deriving Back-
Propagation – Radial Basis Functions and Splines – Concepts – RBF Network –
Curse of Dimensionality – Interpolations and Basis Functions – Support Vector
Machines

UNIT - III
Learning with Trees – Decision Trees – Constructing Decision Trees –
Classification and Regression Trees – Ensemble Learning – Boosting – Bagging
– Different ways to Combine Classifiers – Basic Statistics – Gaussian Mixture
Models – Nearest Neighbor Methods –

Page 71 of 17
R22 B.Tech. CSE (AI & ML)
Unsupervised
Syllabus Learning – K means Algorithms

UNIT - IV
Dimensionality Reduction – Linear Discriminant Analysis – Principal
Component Analysis – Factor Analysis – Independent Component Analysis –
Locally Linear Embedding – Isomap – Least Squares Optimization
Evolutionary Learning – Genetic algorithms – Genetic Offspring: - Genetic
Operators – Using Genetic Algorithms

UNIT - V
Reinforcement Learning – Overview – Getting Lost Example
Markov Chain Monte Carlo Methods – Sampling – Proposal Distribution – Markov
Chain Monte Carlo
– Graphical Models – Bayesian Networks – Markov Random Fields – Hidden
Markov Models – Tracking Methods

TEXT BOOKS:
1. Stephen Marsland, ―Machine Learning – An Algorithmic
Perspective, Second Edition, Chapman and Hall/CRC Machine Learning
and Pattern Recognition Series, 2014.
2. Tom M Mitchell, ―Machine Learning, First Edition, McGraw Hill Education,
2013.
REFERENCE BOOKS:
1. Peter Flach, ―Machine Learning: The Art and Science of Algorithms that
Make Sense of Data‖, First Edition, Cambridge University Press, 2012.
2. Jason Bell, ―Machine learning – Hands on for Developers and Technical
Professionals‖, First Edition, Wiley, 2014
3. Ethem Alpaydin, ―Introduction to Machine Learning 3e (Adaptive
Computation and Machine Learning Series), Third Edition, MIT Press, 2014

Page 72 of 17
R22 B.Tech. CSE (AI & ML)
Syllabus

COMPUTER NETWORKS
Course Code: A10521

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

3 0 0
3
Prerequisites
1. A course on “Programming for problem solving”
2. A course on “Data Structures”
Course Objectives
 The objective of the course is to equip the students with a general overview
of the concepts and fundamentals of computer networks.
 Familiarize the students with the standard models for the layered approach to
communication between machines in a network and the protocols of the
various layers.
Course Outcomes
 Gain the knowledge of the basic computer network technology.
 Gain the knowledge of the functions of each layer in the OSI and TCP/IP reference
model.
 Gain the knowledge of Data Link Layer and its Protocols.
 Obtain the skills of subnetting ,routing mechanisms and essential protocols
of computer networks,and learn how they can be applied in network design
and implementation.
 Gain the knowledge of Transport Layer and Application Protocols.

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.
Data link layer: Design issues, framing, Error detection and correction.

UNIT - II
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 sublayer: The channel allocation problem, Multiple access
protocols: ALOHA, Carrier sense multiple access protocols, collision free
protocols. Wireless LANs, Data link layer switching.

Page 73 of 17
R22 B.Tech. CSE (AI & ML)
UNIT - III
Syllabus
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.:IPV4,IV6 Protocols.

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.

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

REFERENCE BOOKS:
1. An Engineering Approach to Computer Networks-S. Keshav, 2nd Edition, Pearson
Education
2. Data Communications and Networking – Behrouz A. Forouzan. Third Edition TMH.

Page 74 of 17
R22 B.Tech. CSE (AI & ML)
Syllabus

BUSINESS ECONOMICS AND FINANCIAL ANALYSIS

Course Code: Subject Code:

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

3 0 0 3

Course Objective: To learn the basic Business types, impact of the Economy on
Business and Firms specifically. To analyze the Business from the Financial
Perspective.

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

UNIT – I
Introduction to Business and Economics:
Business: Structure of Business Firm, Theory of Firm, Types of Business Entities,
Limited Liability Companies, Sources of Capital for a Company, Non-
Conventional Sources of Finance.
Economics: Significance of Economics, Micro and Macro Economic Concepts,
Concepts and Importance of National Income, Inflation, Money Supply in Inflation,
Business Cycle, Features and Phases of Business Cycle. Nature and Scope of
Business Economics, Role of Business Economist, Multidisciplinary nature of
Business Economics.

UNIT - II
Demand and Supply Analysis:
Elasticity of Demand: Elasticity, Types of Elasticity, Law of Demand,
Measurement and Significance of Elasticity of Demand, Factors affecting Elasticity of
Demand, Elasticity of Demand in decision making, Demand Forecasting:
Characteristics of Good Demand Forecasting, Steps in Demand Forecasting,
Methods of Demand Forecasting.
Supply Analysis: Determinants of Supply, Supply Function & Law of Supply.

UNIT - III
Production, Cost, Market Structures & Pricing:

Page 75 of 17
R22 B.Tech. CSE (AI & ML)
Production
Syllabus Analysis: Factorsof Production, Production Function, Production
Function with one variable input, two variable inputs, Returns to Scale, Different
Types of Production Functions.
Cost analysis: Types of Costs, Short run and Long run Cost Functions.
Market Structures: Nature of Competition, Features of Perfect competition, Monopoly,
Oligopoly, Monopolistic Competition.
Pricing: Types of Pricing, Product Life Cycle based Pricing, Break Even Analysis,
Cost Volume Profit Analysis.

UNIT - IV
Financial Accounting: Accounting concepts and Conventions, Accounting
Equation, Double-Entry system of Accounting, Rules for maintaining Books of
Accounts, Journal, Posting to Ledger, Preparation of Trial Balance, Elements of
Financial Statements, Preparation of Final Accounts.

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

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

REFERENCE BOOKS:
1. Paresh Shah, Financial Accounting for Management 2e, Oxford Press, 2015.
2. S.N. Maheshwari, Sunil K Maheshwari, Sharad K Maheshwari, Financial
Accounting, 5e, Vikas Publications, 2013.

Page 76 of 17
R22 B.Tech. CSE (AI & ML)
Syllabus
GRAPH THEORY (Professional Elective – I)

Course Code: A16614 Subject

Code:

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

3 0 0 3
Course Objectives:
 Understanding graphs, trees, connected paths, applications of trees and graphs.

Course Outcomes:
 Know some important classes of graph theoretic problems;
 Prove central theorems about trees, matching, connectivity, coloring and planar
graphs;
 Describe and apply some basic algorithms for graphs;
 Use graph theory as a modeling tool.

UNIT - I
Introduction-Discovery of graphs, Definitions, Subgraphs, Isomorphic graphs,
Matrix representations of graphs, Degree of a vertex, Directed walks, paths and
cycles, Connectivity in digraphs, Eulerian and Hamilton digraphs, Eulerian digraphs,
Hamilton digraphs, Special graphs, Complements, Larger graphs from smaller graphs,
Union, Sum, Cartesian Product, Composition, Graphic sequences, Graph theoretic
model of the LAN problem, Havel-Hakimi criterion, Realization of a graphic
sequence.

UNIT - II
Connected graphs and shortest paths - Walks, trails, paths, cycles, Connected
graphs, Distance, Cut-vertices and cut-edges, Blocks, Connectivity, Weighted
graphs and shortest paths, Weighted graphs, Dijkstra‟s shortest path algorithm,
Floyd-Warshall shortest path algorithm.

UNIT - III
Trees- Definitions and characterizations, Number of trees, Cayley‟s formula,
Kircho↵-matrix-tree theorem, Minimum spanning trees, Kruskal‟s algorithm,
Prim‟s algorithm, Special classes of graphs, Bipartite Graphs, Line Graphs, Chordal
Graphs, Eulerian Graphs, Fleury‟s algorithm, Chinese Postman problem, Hamilton
Graphs, Introduction, Necessary conditions and sufficient conditions.

Page 77 of 17
R22 B.Tech. CSE (AI & ML)
Syllabus

UNIT - IV
Independent sets coverings and matchings– Introduction, Independent sets and
coverings: basic equations, Matchings in bipartite graphs, Hall‟s Theorem,
K¨onig‟s Theorem, Perfect matchings in graphs, Greedy and approximation
algorithms.

UNIT - V
Vertex Colorings- Basic definitions, Cliques and chromatic number, Mycielski‟s
theorem, Greedy coloring algorithm, Coloring of chordal graphs, Brooks theorem,
Edge Colorings, Introduction and Basics, Gupta-Vizing theorem, Class-1 and
Class-2 graphs, Edge-coloring of bipartite graphs, Class-2 graphs, Hajos union and
Class-2 graphs, A scheduling problem and equitable edge-coloring.

TEXT BOOKS:
1. J. A. Bondy and U. S. R. Murty. Graph Theory, volume 244 of Graduate

Texts in Mathematics. Springer, 1st edition, 2008.

2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications.

REFERENCE BOOKS:
1. Lecture Videos: http://nptel.ac.in/courses/111106050/13
2. Introduction to Graph Theory, Douglas B. West, Pearson.

Page 78 of 17
R22 B.Tech. CSE (AI & ML)
Syllabus

INTRODUCTION TO DATA SCIENCE (Professional Elective – I)

Course Code:A16615 Subject

Code:

B.Tech. III Year I Sem. L TP 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:
 Understand basic terms of statistical modeling and data science
 Implementation of R programming concepts
 utilize R elements for data visualization and prediction

UNIT- I
Introduction
Definition of 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 – Under fiting ,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, 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 Interquartile 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.

Page 79 of 17
R22 B.Tech. CSE (AI & ML)
Syllabus and Data Frames:
Factors Introduction to Factors: Factor Levels, Summarizing a
Factor, Ordered Factors, Comparing Ordered Factors, Introduction to Data Frame,
subsetting 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

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
Charts and Graphs: Introduction, Pie Chart: Chart Legend, Bar Chart, Box Plot,
Histogram, Line Graph: Multiple Lines in Line Graph, Scatter Plot.
Regression: Linear Regression Analysis, Multiple Linear regression
TEXT BOOKS:
1. Doing Data Science, Straight Talk from The Frontline. Cathy O’Neil and Rachel
Schutt, O’Reilly, 2014.
2. K G Srinivas, G M Siddesh, “Statistical programming in R”, Oxford Publications.

REFERENCE BOOKS:
1. Jiawei Han, Micheline Kamber and Jian Pei. Data Mining: Concepts and
Techniques, 3rd ed. The Morgan Kaufmann Series in Data Management
Systems.
2. Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael
Steinbanch, Pearson Education.
3. Brain S. Everitt, “A Handbook of Statistical Analysis Using R”, Second Edition, 4
LLC, 2014.
4. Dalgaard, Peter, “Introductory statistics with R”, Springer Science & Business
Media, 2008.
5. Paul Teetor, “R Cookbook”, O’Reilly, 2011.

Page 710 of
R22 B.Tech. CSE (AI & ML)
Syllabus

WEB PROGRAMMING (Professional Elective – I)

Course Code: A16616 Subject

Code:

B.Tech. III Year I Sem. LT P C

3 0 0 3
Course Objectives:
 Understand the technologies used in Web Programming.
 Know the importance of object-oriented aspects of Scripting.
 Understand creating database connectivity using JDBC.
 Learn the concepts of web-based application using sockets.
Course Outcomes:
 Design web pages.
 Use technologies of Web Programming.
 Apply object-oriented aspects to Scripting.
 Create databases with connectivity using JDBC.
 Build web-based application using sockets.

UNIT – I Client side Programming

HTML- Basic Tags- List, Tables, Images, Forms, Frames, CSS
JAVA Script -
Web page Designing using HTML, Scripting basics- Client side and server side
scripting. Java ScriptObject, names, literals, operators and expressions- statements
and features- events - windows - documents - frames - data types - built-in
functions- Browser object model - Verifying forms.-HTML5- CSS3- HTML 5
canvas - Web site creation using tools.

UNIT – II JAVA
Introduction to object-oriented programming-Features of Java – Data types,
variables and arrays – Operators – Control statements – Classes and Methods –
Inheritance. Packages and Interfaces – Exception Handling – Multithreaded
Programming – Input/Output – Files – Utility Classes – String Handling.

UNIT – III JDBC

JDBC Overview – JDBC implementation – Connection class – Statements -
Catching Database Results, handling database Queries. Networking– InetAddress
class – URL class- TCP sockets – UDP sockets, Java Beans –RMI.

UNIT – IV APPLETS
Java applets- Life cycle of an applet – Adding images to an applet – Adding
sound to an applet. Passing parameters to an applet. Event Handling. Introducing
AWT: Working with Windows Graphics and Text. Using AWT Controls, Layout

Page 711 of
R22 B.Tech. CSE (AI & ML)
Managers
Syllabus and Menus. Servlet
– life cycle of a servlet. The Servlet API,
Handling HTTP Request and Response, using Cookies, Session Tracking.
Introduction to JSP.

UNIT – V XML AND WEB SERVICES

Xml – Introduction-Form Navigation-XML Documents- XSL – XSLT- Web
services-UDDI-WSDL-Java web services – Web resources.

TEXT BOOKS:
1. Harvey Deitel, Abbey Deitel, Internet and World Wide Web: How To Program 5th
Edition.
2. Herbert Schildt, Java - The Complete Reference, 7th Edition. Tata McGraw- Hill
Edition.
3. Michael Morrison XML Unleashed Tech media SAMS.

REFERENCE BOOKS:
1. John Pollock, Javascript - A Beginners Guide, 3rd Edition –- Tata McGraw-Hill
Edition.
2. Keyur Shah, Gateway to Java Programmer Sun Certification, Tata McGraw Hill,
2002.

Page 712 of
R22 B.Tech. CSE (AI & ML)
Syllabus
IMAGE PROCESSING (Professional Elective – I)

Course Code: A10523 Subject

Code:

B.Tech. III Year I Sem. LT 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”

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

Course Outcomes
 Demonstrate the knowledge of the basic concepts of two-dimensional
signal acquisition, sampling, and quantization.
 Demonstrate the knowledge of filtering techniques.
 Demonstrate the knowledge of 2D transformation techniques.
 Demonstrate the knowledge of image enhancement, segmentation,
restoration and compression techniques.

UNIT - I
Digital Image Fundamentals: Digital Image through Scanner, Digital Camera.
Concept of Gray Levels. Gray Level to Binary Image Conversion. Sampling and
Quantization. Relationship between Pixels. Imaging Geometry. 2D
Transformations-DFT, DCT, KLT and SVD.

UNIT - II
Image Enhancement in Spatial Domain Point Processing, Histogram Processing, Spatial
Filtering, Enhancement in Frequency Domain, Image Smoothing, Image Sharpening.

UNIT - III
Image Restoration Degradation Model, Algebraic Approach to Restoration,
Inverse Filtering, Least Mean Square Filters, Constrained Least Squares
Restoration, Interactive Restoration.

Page 713 of
R22 B.Tech. CSE (AI & ML)
UNIT - IV
Syllabus
Image Segmentation Detection of Discontinuities, Edge Linking and Boundary
Detection, Thresholding, Region Oriented Segmentation.

UNIT - V
Image Compression Redundancies and their Removal Methods, Fidelity Criteria,
Image Compression Models, Source Encoder and Decoder, Error Free
Compression, Lossy Compression.

TEXT BOOK:
1. Digital Image Processing: R.C. Gonzalez & R. E. Woods, Addison Wesley/
Pearson Education, 2nd Ed, 2004.
2.
REFERENCE BOOKS:
1. Fundamentals of Digital Image Processing: A. K. Jain, PHI.
2. Digital Image Processing using MAT LAB: Rafael C. Gonzalez, Richard E.
Woods, Steven L. Eddins: Pearson Education India, 2004.
3. Digital Image Processing: William K. Pratt, John Wiley, 3rd Edition, 2004.

Page 714 of
R22 B.Tech. CSE (AI & ML)
Syllabus

COMPUTER GRAPHICS (Professional Elective – I)

Course Code: A16613 Subject

Code:

B.Tech. III Year I Sem. L

T P C
3 0 0 3
Prerequisites
1. Programming for problem solving and Data Structures
Course Objectives
 Provide the basics of graphics systems including Points and lines, line
drawing algorithms, 2D, 3D objective transformations

Course Outcomes
 Explore applications of computer graphics
 Understand 2D, 3D geometric transformations and clipping algorithms
 Understand 3D object representations, curves, surfaces, polygon rendering
methods, color models
 Analyze animation sequence and visible surface detection methods

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 (DDA and
Bresenham’s Algorithm) circle- generating algorithms and ellipse - generating
algorithms
Polygon Filling: Scan-line algorithm, boundary-fill and flood-fill algorithms

UNIT - II
2-D geometric transformations: 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, clipping operations, point
clipping, Line clipping-Cohen Sutherland algorithms, Polygon clipping-Sutherland
Hodgeman polygon clipping algorithm.

UNIT - III
R22 B.Tech. CSE (AI & ML)
3-D object representation:
Syllabus Polygon surfaces, quadric surfaces, spline
representation, Hermite curve, Bezier curve and B-Spline curves, Bezier and B-
Spline surfaces, Polygon rendering methods, color models and color applications.

UNIT - IV
3-D Geometric transformations: Translation, rotation, scaling, reflection and
shear transformations, composite transformations.
3-D viewing: Viewing pipeline, viewing coordinates, projections, view volume and
general projection transforms and clipping.

UNIT - V
Computer animation: Design of animation sequence, general computer animation
functions, raster animations, computer animation languages, key frame systems,
motion specifications.
Visible surface detection methods: Classification, back-face detection, depth-
buffer method, BSP- tree method, area sub-division method and octree method.

TEXT BOOKS:
1. “Computer Graphics C version”, Donald Hearn and M. Pauline Baker, Pearson
Education

REFERENCE BOOKS:
1. Procedural elements for Computer Graphics, David F Rogers, Tata Mc Graw hill,
2nd edition.
2. Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH.
3. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.
4. “Computer Graphics Principles & practice”, second edition in C, Foley, Van
Dam, Feiner and Hughes, Pearson Education.
5. Computer Graphics, Steven Harrington, TMH.
R22 B.Tech. CSE (AI & ML)
Syllabus

QUANTUM COMPUTING

Course Code: A16625 Subject

Code:

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

3 0 0 3

Course Outcomes

 Understand basics of quantum computing

 Understand physical implementation of Qubit
 Understand Quantum algorithms and their implementation
 Understand The Impact of Quantum Computing on Cryptography

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.
R22 B.Tech. CSE (AI & ML)
Syllabus
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

TEXT BOOKS:
1. Nielsen M. A., Quantum Computation and Quantum Information, Cambridge

REFERENCE BOOKS:
1. Quantum Computing for Computer Scientists by Noson S. Yanofsky and Mirco A.
Mannucci
2. Benenti G., Casati G. and Strini G., Principles of Quantum Computation and
Information, Vol. I: Basic Concepts, Vol II
3. Basic Tools and Special Topics, World Scientific. Pittenger A. O., An
Introduction to Quantum Computing Algorithms
R22 B.Tech. CSE (AI & ML)
Syllabus

MACHINE LEARNING LAB

Course Code:A16617 Subject Code:

B.Tech. III Year I Sem. L TP C

0 0 2 1
Course Objective:
 The objective of this lab is to get an overview of the various machine
learning techniques and can demonstrate them using python.

Course Outcomes:
 Understand modern notions in predictive data analysis
 Select data, model selection, model complexity and identify the trends
 Understand a range of machine learning algorithms along with
their strengths and weaknesses
 Build predictive models from data and analyze their performance

List of Experiments
1. Write a python program to compute Central Tendency Measures:
Mean, Median, Mode Measure of Dispersion: Variance, Standard
Deviation
2. Study of Python Basic Libraries such as Statistics, Math, Numpy and Scipy
3. Study of Python Libraries for ML application such as Pandas and Matplotlib
4. Write a Python program to implement Simple Linear Regression
5. Implementation of Multiple Linear Regression for House Price Prediction using
sklearn
6. Implementation of Decision tree using sklearn and its parameter tuning
7. Implementation of KNN using sklearn
8. Implementation of Logistic Regression using sklearn
9. Implementation of K-Means Clustering
10. Performance analysis of Classification Algorithms on a specific dataset (Mini
Project)

TEXT BOOK:
1. Machine Learning – Tom M. Mitchell, - MGH.
REFERENCE BOOK:
1. Machine Learning: An Algorithmic Perspective, Stephen Marshland, Taylor &
Francis.
R22 B.Tech. CSE (AI & ML)
Syllabus

COMPUTER NETWORKS LAB

Course Code: A10528 Subject
Code:

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

0 0 2 1
Course Objectives
 To understand the working principle of various communication protocols.
 To understand the network simulator environment and visualize a
network topology and observe its performance
 To analyze the traffic flow and the contents of protocol frames

Course Outcomes
 Implement data link layer farming methods
 Analyze error detection and error correction codes.
 Implement and analyze routing and congestion issues in network design.
 Implement Encoding and Decoding techniques used in presentation layer
 To be able to work with different network tools

List of Experiments
1. Implement the data link layer framing methods such as character,
character-stuffing and 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 techniques used in buffers.
10. Wireshark
i. Packet Capture Using Wire shark
ii. Starting Wire shark
iii. Viewing Captured Traffic
iv. Analysis and Statistics &
Filters. How to run Nmap scan
Operating System Detection
using Nmap Do the following
R22 B.Tech. CSE (AI & ML)
using NS2 Simulator
Syllabus
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

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

REFERENCE BOOKS:
1. An Engineering Approach to Computer Networks, S. Keshav, 2nd Edition, Pearson
Education.
2. Data Communications and Networking – Behrouz A. Forouzan. 3rd Edition, TMH.
R22 B.Tech. CSE (AI & ML)
Syllabus

ADVANCED ENGLISH COMMUNICATION SKILLS

LAB

Course Code: A10017 Subject

Code:

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

0 0 2 1
1. Introduction
The introduction of the Advanced English Communication Skills Lab is considered
essential at the B.Tech 3rd year level. At this stage, the students need to prepare
themselves for their career 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
appropriate English and perform the following:
1. Gathering ideas and information to organise ideas relevantly and coherently.
2. Making oral presentations.
3. Writing formal letters.
4. Transferring information from non-verbal to verbal texts and vice-versa.
5. Writing project/research reports/technical reports.
6. Participating in group discussions.
7. Engaging in debates.
8. Facing interviews.
9. 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:
 To improve the students’ fluency in English, with a focus on vocabulary
 To enable them to listen to English spoken at normal conversational speed by
educated English speakers
 To respond appropriately in different socio-cultural and professional contexts
 To communicate their ideas relevantly and coherently in writing
 To prepare the students for placements.

3. Syllabus:
The following course content to conduct the activities is prescribed for the
Advanced English Communication Skills (AECS) Lab:
1. Activities on Listening and Reading Comprehension: Active Listening –
R22 B.Tech. CSE (AI & ML)
Development of Listening
Syllabus Skills Through Audio clips - Benefits of Reading –
Methods and Techniques of Reading
– Basic Steps to Effective Reading – Common Obstacles – Discourse
Markers or Linkers - Sub- skills of reading - Reading for facts, negative facts
and Specific Details- Guessing Meanings from Context, Inferring Meaning -
Critical Reading –– Reading Comprehension – Exercises for Practice.
2. Activities on Writing Skills: Vocabulary for Competitive Examinations -
Planning for Writing – Improving Writing Skills - Structure and presentation of
different types of writing – Free Writing and Structured Writing - Letter
Writing –Writing a Letter of Application –Resume vs. Curriculum Vitae
– Writing a Résumé – Styles of Résumé - e-Correspondence – Emails – Blog Writing -
(N)etiquette
– Report Writing – Importance of Reports – Types and Formats of Reports–
Technical Report Writing– Exercises for Practice.
3. Activities on Presentation Skills - Starting a conversation – responding
appropriately and relevantly – using the right language and body language –
Role Play in different situations including Seeking Clarification, Making a
Request, Asking for and Refusing Permission, Participating in a Small Talk –
Oral presentations (individual and group) through JAM sessions- PPTs –
Importance of Presentation Skills – Planning, Preparing, Rehearsing and
Making a Presentation – Dealing with Glossophobia or Stage Fear –
Understanding Nuances of Delivery - Presentations through
Posters/Projects/Reports – Checklist for Making a Presentation and Rubrics of
Evaluation

4. Activities on Group Discussion (GD): Types of GD and GD as a part of a

Selection Procedure - Dynamics of Group Discussion- Myths of GD -
Intervention, Summarizing - Modulation of Voice, Body Language, Relevance,
Fluency and Organization of Ideas – Do’s and Don’ts - GD Strategies
– Exercises for Practice.
5. Interview Skills: Concept and Process - Interview Preparation Techniques -
Types of Interview Questions – Pre-interview Planning, Opening Strategies,
Answering Strategies - Interview Through Tele-conference & Video-
conference - 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
R22 B.Tech. CSE (AI & ML)
 LCD Projector
Syllabus

 Public Address system

 One PC with latest configuration for the teacher
 T. V, a digital stereo & Camcorder
 Headphones of High quality

5.Suggested Software: The software consisting of the prescribed topics elaborated

above should be procured and used.
 TOEFL & GRE (KAPLAN, AARCO & BARRONS, USA, Cracking GRE by
CLIFFS)
 Oxford Advanced Learner’s Dictionary, 10th Edition
 Cambridge Advanced Learner’s Dictionary
 DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice.
 Lingua TOEFL CBT Insider, by Dreamtech

6. Books Recommended:
1. Rizvi, M. Ashraf (2018). Effective Technical Communication. (2nd ed.).
McGraw Hill Education (India) Pvt. Ltd.
2. Suresh Kumar, E. (2015). Engineering English. Orient BlackSwan Pvt. Ltd.
3. Bailey, Stephen. (2018). Academic Writing: A Handbook for International
Students. (5th Edition). Routledge.
4. Koneru, Aruna. (2016). Professional Communication. McGraw Hill Education
(India) Pvt. Ltd.
5. Raman, Meenakshi & Sharma, Sangeeta. (2022). Technical
Communication, Principles and Practice. (4TH Edition) Oxford University
Press.
6. Anderson, Paul V. (2007). Technical Communication. Cengage Learning Pvt. Ltd.
New Delhi.
7. McCarthy, Michael; O’Dell, Felicity & Redman, Stuart. (2017). English
Vocabulary in Use
Series. Cambridge University Press
8. Sen, Leela. (2009). Communication Skills. PHI Learning Pvt Ltd., New Delhi.
9. Elbow, Peter. (1998). Writing with Power. Oxford University Press.
10. Goleman, Daniel. (2013). Emotional Intelligence: Why it can matter more
than IQ. Bloomsbury Publishing.
 R22 B.Tech. CSE (AI & ML)
Syllabus

UI DESIGN FLUTTER LAB

Course Code: A10530 Subject

Code:

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

0 0 2 1
Course Objectives:
 Learns to Implement Flutter Widgets and Layouts
 Understands Responsive UI Design and with Navigation in Flutter
 Knowledge on Widges and customize widgets for specific UI elements, Themes
 Understand to include animation apart from fetching data

Course Outcomes:
 Implements Flutter Widgets and Layouts
 Responsive UI Design and with Navigation in Flutter
 Create custom widgets for specific UI elements and also Apply styling using
themes and custom styles.
 Design a form with various input fields, along with validation and error handling
 Fetches data and write code for unit Test for UI components and also animation

List of Experiments: Students need to implement the following experiments

1. a) Install Flutter and Dart SDK.
b) Write a simple Dart program to understand the language basics.

2. a) Explore various Flutter widgets (Text, Image, Container, etc.).

b) Implement different layout structures using Row, Column, and Stack widgets.

3. a) Design a responsive UI that adapts to different screen sizes.

b) Implement media queries and breakpoints for responsiveness.

4. a) Set up navigation between different screens using Navigator.

b) Implement navigation with named routes.

5. a) Learn about stateful and stateless widgets.

b) Implement state management using set State and Provider.

6. a) Create custom widgets for specific UI

elements.
b) Apply styling using themes and custom
styles.

7. a) Design a form with various input fields.

b) Implement form validation and error handling.
R22 B.Tech. CSE (AI & ML)
Syllabus
8. a) Add animations to UI elements using Flutter's animation framework.
b) Experiment with different types of animations (fade, slide, etc.).

9. a) Fetch data from a REST API.

b) Display the fetched data in a meaningful way in the UI.

10. a) Write unit tests for UI components.

b) Use Flutter's debugging tools to identify and fix issues.

TEXT BOOK:
1. Marco L. Napoli, Beginning Flutter: A Hands-on Guide to App Development.
R22 B.Tech. CSE (AI & ML)
Syllabus

INTELLECTUAL PROPERTY RIGHTS

Course Code: A10018 Subject

Code:

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

3 0 0 0
Course Objectives:
 Significance of intellectual property and its protection
 Introduce various forms of intellectual property

Course Outcomes:
 Distinguish and Explain various forms of IPRs.
 Identify criteria to fit one's own intellectual work in particular form of IPRs.
 Apply statutory provisions to protect particular form of IPRs.
 Appraise new developments in IPR laws at national and international level

UNIT – I
Introduction to Intellectual property: Introduction, types of intellectual property,
international organizations, agencies and treaties, importance of intellectual
property rights.

UNIT – II
Trade Marks: Purpose and function of trademarks, acquisition of trade mark
rights, protectable matter, selecting, and evaluating trade mark, trade mark
registration processes.

UNIT – III
Law of copyrights: Fundamental of copyright law, originality of material, rights of
reproduction, rights to perform the work publicly, copyright ownership issues,
copyright registration, notice of copyright, International copyright law.
Law of patents: Foundation of patent law, patent searching process, ownership rights and
transfer

UNIT – IV
Trade Secrets: Trade secret law, determination of trade secret status, liability for
misappropriations of trade secrets, protection for submission, trade secret litigation.
Unfair competition: Misappropriation right of publicity, false advertising.

UNIT – V
New development of intellectual property: new developments in trade mark law;
copyright law, patent law, intellectual property audits.
R22 B.Tech. CSE (AI & ML)
International
Syllabus overview on intellectual property, international – trade mark law,
copyright law, international patent law, and international development in trade
secrets law.

TEXT BOOK:
1. Intellectual property right, Deborah. E. Bouchoux, Cengage learning.

REFERENCE BOOK:
1. Intellectual property right – Unleashing the knowledge economy, prabuddha
ganguli, Tata McGraw Hill Publishing company ltd.
R22 B.Tech. CSE (AI & ML)
Syllabus
KNOWLEDGE REPRESENTATION AND REASONING

Course Code:A16619 Subject

Code:

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

3 0 0 3
Course Objectives:
 To investigate the key concepts of Knowledge Representation (KR)
techniques and different notations.
 To integrate the KR view as a knowledge engineering approach to model
organizational knowledge.
 To introduce the study of ontologies as a KR paradigm and applications of
ontologies.
 To understand various KR techniques and process, knowledge acquisition
and sharing of ontology.

Course Outcomes:
 Analyze and design knowledge-based systems intended for computer
implementation.
 Acquire theoretical knowledge about principles for logic-based representation and
reasoning.
 Ability to understand knowledge-engineering process
 Ability to implement production systems, frames, inheritance systems and
approaches to handle uncertain or incomplete knowledge.

UNIT - I
The Key Concepts: Knowledge, Representation, Reasoning, Why knowledge
representation and reasoning, Role of logic
Logic: Historical background, Representing knowledge in logic, Varieties of logic,
Name, Type, Measures, Unity Amidst diversity

UNIT - II
Ontology: Ontological categories, Philosophical background, Top-level categories,
Describing physical entities, Defining abstractions, Sets, Collections, Types and
Categories, Space and Time

UNIT - III
Knowledge Representations: Knowledge Engineering, Representing structure in
frames, Rules and data, Object-oriented systems, Natural language Semantics,
Levels of representation
R22 B.Tech. CSE (AI & ML)
UNIT - IV
Syllabus

Processes: Times, Events and Situations, Classification of processes, Procedures,

Processes and Histories, Concurrent processes, Computation, Constraint
satisfaction, Change Contexts: Syntax of contexts, Semantics of contexts, First-
order reasoning in contexts, Modal reasoning in contexts, Encapsulating objects in
contexts.

UNIT - V
Knowledge Soup: Vagueness, Uncertainty, Randomness and Ignorance,
Limitations of logic, Fuzzy logic, Nonmonotonic Logic, Theories, Models and the
world, Semiotics Knowledge Acquisition and Sharing: Sharing Ontologies,
Conceptual schema, Accommodating multiple paradigms, Relating different
knowledge representations, Language patterns, Tools for knowledge acquisition

TEXT BOOKS:
1. Knowledge Representation logical, Philosophical, and Computational
Foundations by John F. Sowa, Thomson Learning.
2. Knowledge Representation and Reasoning by Ronald J. Brachman,
Hector J. Levesque, Elsevier.
R22 B.Tech. CSE (AI & ML)
Syllabus

DATA ANALYTICS

Course Code: A13313 Subject

Code:

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

3 0 0 3
Prerequisites
1. A course on “Database Management Systems”.
2. Knowledge of probability and statistics.
Course Objectives:
 To explore the fundamental concepts of data analytics.
 To learn the principles and methods of statistical analysis
 Discover interesting patterns, analyze supervised and unsupervised models
and estimate the accuracy of the algorithms.
 To understand the various search methods and visualization techniques.
Course Outcomes: After completion of this course students will be able to
 Understand the impact of data analytics for business decisions and strategy
 Carry out data analysis/statistical analysis
 To carry out standard data visualization and formal inference procedures
 Design Data Architecture
 Understand various Data Sources

UNIT - I
Data Management: Design Data Architecture and manage the data for analysis,
understand various sources of Data like Sensors/Signals/GPS etc. Data Management,
Data Quality(noise, outliers, missing values, duplicate data) and Data Processing &
Processing.

UNIT - II
Data Analytics: Introduction to Analytics, Introduction to Tools and Environment,
Application of Modeling in Business, Databases & Types of Data and Variables,
Data Modeling Techniques, Missing Imputations etc. Need for Business Modeling.

UNIT - III
Regression – Concepts, Blue property assumptions, Least Square Estimation,
Variable Rationalization, and Model Building etc.
Logistic Regression: Model Theory, Model fit Statistics, Model Construction,
Analytics applications to various Business Domains etc.

UNIT - IV
Object Segmentation: Regression Vs Segmentation – Supervised and
Unsupervised Learning, Tree Building – Regression, Classification, Overfitting,
Pruning and Complexity, Multiple Decision Trees etc. Time Series Methods:
R22 B.Tech. CSE (AI & ML)
Syllabus Measures of Forecast
Arima, Accuracy, STL approach, Extract features from
generated model as Height, Average Energy etc and Analyze for prediction

UNIT - V
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. Student’s Handbook for Associate Analytics – II, III.
2. Data Mining Concepts and Techniques, Han, Kamber, 3rd Edition, Morgan
Kaufmann Publishers.
REFERENCE BOOKS:
1. Introduction to Data Mining, Tan, Steinbach and Kumar, Addision Wisley, 2006.
2. Data Mining Analysis and Concepts, M. Zaki and W. Meira
3. Mining of Massive Datasets, Jure Leskovec Stanford Univ. Anand
Rajaraman Milliway Labs Jeffrey D Ullman Stanford Univ.
R22 B.Tech. CSE (AI & ML)
Syllabus
NATURAL LANGUAGE PROCESSING

Course Code: A10527 Subject Code:

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

3 1 0 4
Prerequisites:
1. Data structures and compiler design
Course Objectives:
 Introduction to some of the problems and solutions of NLP and their relation
to linguistics and statistics.

Course Outcomes:
 Show sensitivity to linguistic phenomena and an ability to model them with formal
grammars.
 Understand and carry out proper experimental methodology for training and
evaluating empirical NLP systems
 Manipulate probabilities, construct statistical models over strings and
trees, and estimate parameters using supervised and unsupervised training
methods.
 Design, implement, and analyze NLP algorithms; and 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, Features

UNIT - II
Syntax I: Parsing Natural Language, Treebanks: A Data-Driven Approach to
Syntax, Representation of Syntactic Structure, Parsing Algorithms

UNIT – III
Syntax II: Models for Ambiguity Resolution in Parsing, Multilingual Issues
Semantic Parsing I: Introduction, Semantic Interpretation, System Paradigms, Word
Sense

UNIT - IV
Semantic Parsing II: Predicate-Argument Structure, Meaning Representation Systems
R22 B.Tech. CSE (AI & ML)
Syllabus

UNIT - V
Language Modeling: Introduction, N-Gram Models, Language Model Evaluation,
Bayesian parameter estimation, Language Model Adaptation, Language Models-
class based, variable length, Bayesian topic based, Multilingual and Cross Lingual
Language Modeling

TEXT BOOKS:
1. Multilingual natural Language Processing Applications: From Theory to
Practice – Daniel M. Bikel and Imed Zitouni, Pearson Publication.
REFERENCE BOOK:
1. Speech and Natural Language Processing - Daniel Jurafsky & James H
Martin, Pearson Publications.
2. Natural Language Processing and Information Retrieval: Tanvier Siddiqui, U.S.
Tiwary.
R22 B.Tech. CSE (AI& ML) Syllabus
SOFTWARE TESTING METHODOLOGIES (Professional Elective – II)

Course Code: A10533 Subject

Code:

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

3 0 0 3
Prerequisites
1. Software Engineering
Course Objectives
 To provide knowledge of the concepts in software testing such as testing
process, criteria, strategies, and methodologies.
 To develop skills in software test automation and management using the latest tools.
Course Outcomes:
 Understand purpose of testing and path testing
 Understand strategies in data flow testing and domain testing
 Develop logic-based test strategies
 Understand graph matrices and its applications
 Implement test cases using any testing automation tool

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.
Data Flow testing: Basics of data flow testing, strategies in data flow testing,
application of data flow 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.
R22 B.Tech. CSE (AI& ML) Syllabus

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/selenium/soapUI/Catalon).

TEXT BOOKS:
1. Software Testing techniques - Baris Beizer, Dreamtech, second edition.
2. Software Testing Tools – Dr. K. V. K. K. Prasad, Dreamtech.

REFERENCE BOOKS:
1. The craft of software testing - Brian Marick, Pearson Education.
2. Software Testing Techniques – SPD(Oreille)
3. Software Testing in the Real World – Edward Kit, Pearson.
4. Effective methods of Software Testing, Perry, John Wiley.
5. Art of Software Testing – Meyers, John Wiley.
R22 B.Tech. CSE (AI& ML) Syllabus

INFORMATION RETRIEVAL SYSTEMS (Professional Elective – II)

Course Code: A10525 Subject

Code:

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

3 0 0 3
Prerequisites:
1. Data Structures
Course Objectives:
 To learn the concepts and algorithms in Information Retrieval Systems
 To understand the data/file structures that are necessary to design, and
implement information retrieval (IR) systems.

Course Outcomes:
 Ability to apply IR principles to locate relevant information large collections of data
 Ability to design different document clustering algorithms
 Implement retrieval systems for web search tasks.
 Design an Information Retrieval System for web search tasks.

UNIT - I
Introduction to Information Retrieval Systems: Definition of Information Retrieval
System, Objectives of Information Retrieval Systems, Functional Overview,
Relationship to Database Management Systems, Digital Libraries and Data
Warehouses Information Retrieval System Capabilities: Search Capabilities,
Browse Capabilities, Miscellaneous Capabilities

UNIT - II
Cataloging and Indexing: History and Objectives of Indexing, Indexing Process,
Automatic Indexing, Information Extraction Data Structure: Introduction to Data
Structure, Stemming Algorithms, Inverted File Structure, N-Gram Data Structures,
PAT Data Structure, Signature File Structure, Hypertext and XML Data Structures,
Hidden Markov Models.

UNIT - III
Automatic Indexing: Classes of Automatic Indexing, Statistical Indexing, Natural
Language, Concept Indexing, Hypertext Linkages
Document and Term Clustering: Introduction to Clustering, Thesaurus Generation,
Item Clustering, Hierarchy of Clusters

UNIT - IV
User Search Techniques: Search Statements and Binding, Similarity Measures and
Ranking, Relevance Feedback, Selective Dissemination of Information Search,
Weighted Searches of Boolean Systems, Searching the INTERNET and Hypertext
R22 B.Tech. CSE (AI& ML) Syllabus
Information Visualization: Introduction to Information Visualization, Cognition
and Perception, Information Visualization Technologies

UNIT - V
Text Search Algorithms: Introduction to Text Search Techniques, Software Text Search
Algorithms, Hardware Text Search Systems
Multimedia Information Retrieval: Spoken Language Audio Retrieval, Non-
Speech Audio Retrieval, Graph Retrieval, Imagery Retrieval, Video Retrieval

TEXT BOOK:
1. Information Storage and Retrieval Systems – Theory and
Implementation, Second Edition, Gerald J. Kowalski, Mark T. Maybury,
Springer

REFERENCE BOOKS:
1. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures
and Algorithms, Prentice Hall, 1992.
2. Information Storage & Retrieval by Robert Korfhage – John Wiley & Sons.
3. Modern Information Retrieval by Yates and Neto Pearson Education.
.
R22 B.Tech. CSE (AI& ML) Syllabus

PATTERN RECOGNITION (Professional Elective – II)

Course Code: A13311 Subject

Code:

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

3 0 0 3
Prerequisites:
 Programming for problem solving
 Computer Oriented Statistical Methods

Course Objectives:
 Introducing fundamental concepts, theories, and algorithms for pattern
recognition and machine learning.
Course Outcomes:
 Understand the importance of pattern recognition and its representation
 Analyza the variants of NN algorithm
 Understand the necessity of Hidden markov models, decision tree and SVM for
classification
 Understand different types of clustering algorithms

UNIT - I
Introduction: Pattern Recognition, Data Sets for Pattern Recognition, Different
Paradigms for Pattern Recognition. Representation: Data Structures for Pattern
Representation, Representation of Clusters, Proximity Measures, Size of Patterns,
Abstractions of the Data Set, Feature Extraction, Feature Selection, Evaluation of
Classifier, Evaluation of Clustering.

UNIT - II
Nearest Neighbor Based Classifier: Nearest Neighbor Algorithm, Variants of the
NN Algorithm, use of the Nearest Neighbor Algorithm for Transaction Databases,
Efficient Algorithms, Data Reduction, Prototype Selection. Bayes Classifier: Bayes
Theorem, Minimum Error Rate Classifier, Estimation of Probabilities, Comparison
with the NNC, Naïve Bayes Classifier, Bayesian Belief Network.

UNIT - III
Hidden Markov Models: Markov Models for Classification, Hidden Morkov
Models, Classification using HMMs. Decision Trees: Introduction, Decision Tree
for Pattern Classification, Construction of Decision Trees, Splitting at the Nodes,
Overfitting and Pruning, Examples of Decision Tree Induction.

UNIT - IV
R22 B.Tech. CSE (AI& ML) Syllabus
Support Vector Machines: Introduction, Learning the Linear Discriminant
Functions, Neural Networks, SVM for Classification. Combination of Classifiers:
Introduction, Methods for Constructing Ensembles of Classifiers, Methods for
Combining Classifiers.

UNIT - V
Clustering: Importance of clustering, Hierarchical Algorithms, Partitional
Clustering, Clustering Large Data Sets. An Application-Hand Written Digit
Recognition: Description of the Digit Data, Preprocessing of Data, Classification
Algorithms, Selection of Representative Patterns, Results.

TEXT BOOK:
1. Pattern Recognition: An Algorithmic Approach: Murty, M. Narasimha,
Devi, V. Susheela, Spinger Pub, 1st Ed.

REFERENCE BOOKS:
1. Machine Learning - Mc Graw Hill, Tom M. Mitchell.
2. Fundamentals Of Speech Recognition: Lawrence Rabiner and Biing-
Hwang Juang. PrenticeHall Pub.
R22 B.Tech. CSE (AI& ML) Syllabus

COMPUTER VISION AND ROBOTICS (Professional Elective – II)

Course Code: A16620 Subject

Code:

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

3 0 0 3
Pre-Requisites: Linear Algebra and Probability.
Course Objectives:
 To understand the Fundamental Concepts Related To sources, shadows and shading
 To understand the The Geometry of Multiple Views

Course Outcomes:
 Implement fundamental image processing techniques required for computer vision
 Implement boundary tracking techniques
 Apply chain codes and other region descriptors, Hough Transform for line,
circle, and ellipse detections.
 Apply 3D vision techniques and Implement motion related techniques.
 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: Segmentation, Human Vision: Grouping and
Getstalt, Applications: Shot Boundary Detection and Background Subtraction,
R22 B.Tech. CSE (AI& ML) Syllabus
Image Segmentation by Clustering Pixels, Segmentation by Graph-Theoretic
Clustering,
UNIT - IV
Segmentation by Fitting a Model: The Hough Transform, Fitting Lines, Fitting
Curves, Fitting as a Probabilistic Inference Problem, Robustness
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

UNIT - V
Introduction to Robotics: Social Implications of Robotics, Brief history of
Robotics, Attributes of hierarchical paradigm, Closed world assumption and frame
problem, Representative Architectures, Attributes of Reactive Paradigm,
Subsumption Architecture, Potential fields and Perception

Common sensing techniques for Reactive Robots: Logical sensors, Behavioural

Sensor Fusion, Pro- prioceptive sensors, Proximity Sensors, Topological Planning
and Metric Path Planning

TEXT BOOKS:
1. David A. Forsyth and Jean Ponce: Computer Vision – A Modern
Approach, PHI Learning (Indian Edition), 2009.
2. Robin Murphy, Introduction to AI Robotics, MIT Press

REFERENCE BOOKS:
1. E. R. Davies: Computer and Machine Vision – Theory, Algorithms and
Practicalities, Elsevier (Academic Press), 4th edition, 2013.
2. The Robotics premier, Maja J Matari, MIT Press
3. Richard Szeliski “Computer Vision: Algorithms and Applications”
Springer-Verlag London Limited 2011.
R22 B.Tech. CSE (AI& ML) Syllabus

DATA WAREHOUSING AND BUSINESS

INTELLIGENCE
(Professional Elective – II)

Course Code: A16621 Subject Code:

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

3 0 0 3
Course Objectives:
 This course is concerned with extracting data from the information systems
that deal with the day-to-day operations and transforming it into data that can
be used by businesses to drive high-level decision making
 Students will learn how to design and create a data warehouse, and how to
utilize the process of extracting, transforming, and loading (ETL) data into
data warehouses.

Course Outcomes:
 Understand architecture of data warehouse and OLAP operations.
 Understand Fundamental concepts of BI
 Application of BI Key Performance indicators
 Understand Utilization of Advanced BI Tools and their Implementation.
 Implementation of BI Techniques and BI Ethics.

UNIT - I
Data Warehouse, Data Warehouse Modelling, OLAP operations, Data Qube Computation
methods

UNIT - II
Business Intelligence Introduction – Definition, Leveraging Data and Knowledge
for BI, BI Components, BI Dimensions, Information Hierarchy, Business Intelligence
and Business Analytics. BI Life Cycle. Data for BI - Data Issues and Data Quality
for BI.

UNIT - III
BI Implementation - Key Drivers, Key Performance Indicators and Performance
Metrics, BI Architecture/Framework, Best Practices, Business Decision Making,
Styles of BI-vent-Driven alerts-A cyclic process of Intelligence Creation. The value
of Business Intelligence-Value driven and Information use.

UNIT - IV
Advanced BI – Big Data and BI, Social Networks, Mobile BI, emerging trends,
Description of different BI-Tools (Pentaho, KNIME)
R22 B.Tech. CSE (AI& ML) Syllabus

UNIT - V
Business Intelligence and integration implementation-connecting in BI systems-
Issues of legality- Privacy and ethics- Social networking and BI.

TEXT BOOKS:
1. Data Mining – Concepts and Techniques - JIAWEI HAN &

MICHELINE KAMBER, Elsevier, 4th Edition.

2. Rajiv Sabherwal “Business Intelligence” Wiley Publications, 2012.

REFERENCE BOOKS:
1. Efraim Turban, Ramesh Sharda, Jay Aronson, David King, Decision
Support and Business Intelligence Systems, 9th Edition, Pearson Education,
2009.
2. David Loshin, Business Intelligence - The Savy Manager's Guide Getting
Onboard with Emerging IT, Morgan Kaufmann Publishers, 2009.
3. Philo Janus, Stacia Misner, Building Integrated Business Intelligence.
Solutions with SQL Server, 2008 R2 & Office 2010, TMH, 2011.

4. Business Intelligence Data Mining and Optimization for decision making

[Author: Carlo-Verellis] [Publication: (Wiley)]
5. Data Warehousing, Data Mining & OLAP- Alex Berson and Stephen J.
Smith- Tata McGraw- Hill Edition, Tenth reprint 2007
6. Building the Data Warehouse- W. H. Inmon, Wiley Dreamtech India Pvt. Ltd.
7. Data Mining Introductory and Advanced topics – Margaret H Dunham, PEA.
R22 B.Tech. CSE (AI& ML) Syllabus

FUNDAMENTALS OF AI (Open Elective – I)

Course Code: Subject Code:

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

3 0 0 3
Course Objective:
 To learn the difference between optimal reasoning Vs human like reasoning
 To understand the notions of state space representation, exhaustive search,
heuristic search along with the time and space complexities
 To learn different knowledge representation techniques
 To understand the applications of AI namely, Game Playing, Theorem
Proving, Expert Systems, Machine Learning and Natural Language
Processing

Course Outcomes:
 Gain the knowledge of what is AI, risks and benefits of AI, limits of AI and
the ethics involved in building an AI application.
 Understand the nature of environments and the structure of agents.
 Possess the ability to select a search algorithm for a problem and
characterize its time and space complexities.
 Possess the skill for representing knowledge using the appropriate technique
 Gain an understanding of the applications of AI

UNIT – I
Foundations of AI: Introduction to AI, History of AI, Strong and Weak AI, The
State of the Art, Risks and Benefits of AI
Philosophy, Ethics and Safety of AI: The Limits of AI, Machine thinking
capability, The Ethics of AI Intelligent Agents: Agents and Environments, Good
Behavior: The Concept of Rationality, The Nature of Environments, The Structure
of Agents.

UNIT – II
Solving Problems by Searching: Problem – Solving Agents
Uninformed Search Strategies: Best-First Search, Breadth-First Search, Uniform-
Cost Search, Depth-First Search, Iterative Deepening Search and Bidirectional
Search
Informed Search Strategies: Greedy Best-First Search, A* Search

UNIT – III
R22 B.Tech. CSE (AI& ML) Syllabus
Logical Agents: Knowledge-based agents, Propositional Logic, Propositional Theorem
Proving
First-Order Logic: Syntax and Semantics of First-Order Logic
Inference in First-Order Logic: Propositional Vs. First-Order Inference, Unification and
First-Order Inference, Forward Chaining, Backward Chaining
Knowledge Representation: Ontological Engineering, Categories and Objects, Events

UNIT – IV
Quantifying Uncertainty: Basic Probability Notation, Inference Using Full-Joint
Distributions, Independence, Bayes’ Rule and its Use, Naive Bayes Models
Probabilistic Reasoning: Representing Knowledge in an Uncertain Domain, The
semantics of Bayesian Networks, Exact Inference in Bayesian Networks

UNIT – V
Learning from Examples: Forms of Learning, Supervised Learning, Learning Decision
Trees, Model Selection, Linear Regression and Classification, Ensemble Learning
Natural Language Processing: Language Models, Grammar, Parsing, Complications of
Real Natural Language, Natural Language Tasks

Robotics: Robots, Robot Hardware, Kind of Problems solved, Application Domains

Computer Vision: Simple Image Features, Using Computer Vision

TEXT BOOKS:
1. “Artificial Intelligence a Modern Approach”, Fourth Edition, Stuart J.
Russell & Peter Norvig – Pearson.

REFERENCE BOOKS:
1. “Artificial Intelligence”, Elaine Rich, Kevin Knight & Shivashankar B
Nair – McGraw Hill Education.
2. Artificial Intelligence, 3rd Edn, E. Rich and K. Knight (TMH)
3. Artificial Intelligence, 3rd Edn., Patrick Henny Winston, Pearson Education.
4. Artificial Intelligence, Shivani Goel, Pearson Education.
5. Artificial Intelligence and Expert systems – Patterson, Pearson Education
R22 B.Tech. CSE (AI & ML)
Syllabus
MACHINE LEARNING BASICS (Open Elective – I)

Course Code: Subject Code:

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

3 0 0 3
Course Objectives:
 To introduce students to the basic concepts and techniques of Machine Learning.
 To have a thorough understanding of the Supervised and Unsupervised learning
techniques
 To study the various probability-based learning techniques

Course Outcomes:
 Distinguish between, supervised, unsupervised and semi-supervised learning
 Understand algorithms for building classifiers applied on datasets of non-
linearly separable classes
 Understand the principles of evolutionary computing algorithms
 Design an ensembler to increase the classification accuracy

UNIT - I
Learning – Types of Machine Learning – Supervised Learning – The Brain and the
Neuron – Design a Learning System – Perspectives and Issues in Machine Learning
– Concept Learning Task – Concept Learning as Search – Finding a Maximally
Specific Hypothesis – Version Spaces and the Candidate Elimination Algorithm
– Linear Discriminants: – Perceptron – Linear Separability – Linear Regression.

UNIT - II
Multi-layer Perceptron– Going Forwards – Going Backwards: Back
Propagation Error – Multi-layer Perceptron in Practice – Examples of using the
MLP – Overview – Deriving Back-Propagation

UNIT - III
Learning with Trees – Decision Trees – Constructing Decision Trees –
Classification and Regression Trees – Ensemble Learning – Boosting – Bagging
– Different ways to Combine Classifiers – Nearest Neighbor Methods –
Unsupervised Learning – K means Algorithms

UNIT - IV
Support Vector Machines
Evolutionary Learning – Genetic algorithms – Genetic Offspring: - Genetic
Operators – Using Genetic Algorithms
R22 B.Tech. CSE (AI & ML)
UNIT -V
Syllabus
Reinforcement Learning – Overview – Getting Lost Example
Markov Chain Monte Carlo Methods – Sampling – Proposal Distribution – Markov
Chain Monte Carlo
– Hidden Markov Models

TEXT BOOKS:
1. Stephen Marsland, ―Machine Learning – An Algorithmic
Perspective, Second Edition, Chapman and Hall/CRC Machine Learning
and Pattern Recognition Series, 2014.

REFERENCE BOOKS:
1. Tom M Mitchell, ―Machine Learning, First Edition, McGraw Hill Education,
2013.
2. Peter Flach, ―Machine Learning: The Art and Science of Algorithms that
Make Sense of Data‖, First Edition, Cambridge University Press, 2012.
3. Jason Bell, ―Machine learning – Hands on for Developers and Technical
Professionals‖, First Edition, Wiley, 2014
4. Ethem Alpaydin, ―Introduction to Machine Learning 3e (Adaptive
Computation and Machine Learning Series), Third Edition, MIT Press,
2014.
R22 B.Tech. CSE (AI & ML)
Syllabus

NATURAL LANGUAGE PROCESSING LAB

Course Code: A10538 Subject

Code:

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

0 0 2 1
Prerequisites:
1. Data structures, finite automata and probability theory.

Course Objectives:
 To Develop and explore the problems and solutions of NLP

Course Outcomes:
 Show sensitivity to linguistic phenomena and an ability to model them with formal
grammars.
 Knowledge on NLTK Library implementaion
 Work on strings and trees, and estimate parameters using supervised and
unsupervised training methods.

List of Experiments
1. Write a Python Program to perform following tasks on text
a) Tokenization b) Stop word Removal
2. Write a Python program to implement Porter stemmer algorithm for stemming
3. Write Python Program for a) Word Analysis b) Word Generation
4. Create a Sample list for at least 5 words with ambiguous sense and Write a
Python program to implement WSD
5. Install NLTK tool kit and perform stemming
6. Create Sample list of at least 10 words POS tagging and find the POS for any given
word
7. Write a Python program to
a) Perform Morphological Analysis using NLTK library
b) Generate n-grams using NLTK N-Grams library
c) Implement N-Grams Smoothing
8. Using NLTK package to convert audio file to text and text file to audio files.

TEXT BOOKS:
1. Multilingual natural Language Processing Applications: From Theory to
Practice – Daniel M. Bikel and Imed Zitouni, Pearson Publication.
2. Oreilly Practical natural Language Processing, A Comprehensive Guide to
R22 B.Tech. CSE (AI & ML)
Building Real World
Syllabus NLP Systems.
3. Daniel Jurafsky, James H. Martin―Speech and Language Processing: An
Introduction to Natural Language Processing, Computational Linguistics and
Speech, Pearson Publication, 2014.

REFERENCE BOOKS:
1. Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processing
with Python, First Edition, O‘Reilly Media, 2009.
 R22 B.Tech. CSE (AI & ML)
Syllabus

DATA ANALYTICS LAB

Course Code: A13313 Subject

Code:

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

0 0 2 1
Course Objectives:
 To explore the fundamental concepts of data analytics.
 To learn the principles and methods of statistical analysis
 Discover interesting patterns, analyze supervised and unsupervised models
and estimate the accuracy of the algorithms.
 To understand the various search methods and visualization techniques.

Course Outcomes:
 Understand linear regression and logistic regression
 Understand the functionality of different classifiers
 Implement visualization techniques using different graphs
 Apply descriptive and predictive analytics for different types of data

List of Experiments:
1. Data Preprocessing
a. Handling missing values
b. Noise detection removal
c. Identifying data redundancy and elimination
2. Implement any one imputation model
3. Implement Linear Regression
4. Implement Logistic Regression
5. Implement Decision Tree Induction for classification
6. Implement Random Forest Classifier
7. Implement ARIMA on Time Series data
8. Object segmentation using hierarchical based methods
9. Perform Visualization techniques (types of maps - Bar, Colum, Line, Scatter, 3D
Cubes etc)
10. Perform Descriptive analytics on healthcare data
11. Perform Predictive analytics on Product Sales data
12. Apply Predictive analytics for Weather forecasting.

TEXT BOOKS:
1. Student’s Handbook for Associate Analytics – II, III.
2. Data Mining Concepts and Techniques, Han, Kamber, 3rd Edition,
R22 B.Tech. CSE (AI & ML)
Morgan Kaufmann
Syllabus Publishers.

REFERENCE BOOKS:
1. Introduction to Data Mining, Tan, Steinbach and Kumar, Addison Wesley, 2006.
2. Data Mining Analysis and Concepts, M. Zaki and W. Meira
3. Mining of Massive Datasets, Jure Leskovec Stanford Univ. Anand
Rajaraman Milliway Labs Jeffrey D Ullman Stanford Univ.
 R22 B.Tech. CSE (AI & ML)
Syllabus

DEVOPS

Course Code: A10540 Subject

Code:

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

0 0 4 2
Course Objectives:
 Develop a sustainable infrastructure for applications and ensure high
scalability. DevOps aims to shorten the software development lifecycle to
provide continuous delivery with high-quality.

Course Outcomes:
 Understand the need of DevOps tools
 Understand the environment for a software application development
 Apply different project management, integration and development tools
 Use Selenium tool for automated testing of application

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 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 for 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.

TEXT BOOKS:
1. Joakim Verona., Practical DevOps, Packt Publishing, 2016.

REFERENCE BOOKS:
1. Deepak Gaikwad, Viral Thakkar. DevOps Tools from Practitioner's
Viewpoint. Wiley publications.
2. Len Bass, Ingo Weber, Liming Zhu. DevOps: A Software Architect's
Perspective. Addison Wesley.
R22 B.Tech. CSE (AI &ML) Syllabus

ENVIRONMENTAL SCIENCE

Course Code: Subject Code:

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

3 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, 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.

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:
R22 B.Tech. CSE (AI &ML) Syllabus
Sources and types of pollution, drinking water quality standards. Soil Pollution:
Sources and types, Impacts of modern agriculture, degradation of soil. Noise Pollution:
Sources and Health hazards, standards, Solid waste: Municipal Solid Waste
management, composition and characteristics of e-Waste and its management.
Pollution control technologies: Wastewater Treatment methods: Primary,
secondary and Tertiary.
Overview of air pollution control technologies, Concepts of bioremediation. Global
Environmental Problems and Global Efforts: Climate change and impacts on
human environment. Ozone depletion and Ozone depleting substances (ODS).
Deforestation and desertification. International conventions / Protocols: Earth
summit, Kyoto protocol, and Montréal Protocol.

UNIT - V
Environmental Policy, Legislation & EIA: Environmental Protection act, Legal
aspects Air Act- 1981, Water Act, Forest Act, Wild life Act, Municipal solid waste
management and handling rules, biomedical waste management and handling rules,
hazardous waste management and handling rules. EIA: EIA structure, methods of
baseline data acquisition. Overview on Impacts of air, water, biological and Socio-
economical aspects. Strategies for risk assessment, Concepts of Environmental
Management Plan

(EMP). Towards Sustainable Future: Concept of Sustainable Development,

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

TEXT BOOKS:
1. Textbook of Environmental Studies for Undergraduate Courses by Erach
Bharucha for University Grants Commission.
2. Environmental Studies by 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
R22 B.Tech. CSE (AI &ML) Syllabus
Publications.
R22 B.Tech. CSE (AI & ML)
Syllabus

DEEP LEARNING

Course Code: A16620 Subject

Code:

B.Tech. IV Year I Sem. L TP C

3 0 0 3
Course Objectives:
 To understand deep Learning algorithms and their applications in real-world data
Course Outcomes:
 Understand machine learning basics and neural networks
 Understand optimal usage of data for training deep models
 Apply CNN and RNN models for real-world data
 Evaluate deep models
 Develop deep models for real-world problems

UNIT -I
Machine Learning Basics
Learning Algorithms, Capacity, Overfitting and Underfitting, Hyperparameters and
Validation Sets, Estimators, Bias and Variance, Maximum Likelihood Estimation,
Bayesian Statistics, Supervised Learning Algorithms, Unsupervised Learning
Algorithms, Stochastic Gradient Descent, Building a Machine Learning Algorithm,
Challenges Motivating Deep Learning
Deep Feedforward Networks Learning XOR, Gradient-Based Learning, Hidden
Units, Architecture Design, Back-Propagation and Other Differentiation
Algorithms

UNIT -II
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 Tying and Parameter Sharing, Sparse Representations, Bagging and
Other Ensemble Methods, Dropout, Adversarial Training, Tangent Distance,
Tangent Prop, and Manifold Tangent Classifier, Optimization for Training Deep
Models, Learning vs Pure Optimization, Challenges in Neural Network
Optimization, Basic Algorithms, Parameter Initialization Strategies, Algorithms
with Adaptive Learning Rates
R22 B.Tech. CSE (AI & ML)
UNIT-III
Syllabus

Convolutional Networks
The Convolution Operation, Motivation, Pooling, Convolution and Pooling as an
Infinitely Strong Prior, Variants of the Basic Convolution Function, Structured
Outputs, Data Types, Efficient Convolution Algorithms, Random or Unsupervised
Features

UNIT -IV
Recurrent and Recursive Nets
Unfolding Computational Graphs, Recurrent Neural Networks, Bidirectional
RNNs, Encoder-Decoder Sequence-to-Sequence Architectures, Deep Recurrent
Networks, Recursive Neural Networks, The Challenge of Long-Term
Dependencies, Echo State Networks, Leaky Units and Other Strategies for Multiple
Time Scales, The Long Short-Term Memory and Other Gated RNNs, Optimization
for Long- Term Dependencies, Explicit Memory

UNIT -V
Practical Methodology: Performance Metrics, Default Baseline Models,
Determining Whether to Gather More Data, Selecting Hyperparameters, Debugging
Strategies, Example: Multi-Digit Number Recognition
Applications: Large-Scale Deep Learning, Computer Vision, Speech Recognition,
Natural Language Processing, Other Applications.
TEXT BOOK:
1. Deep Learning by Ian Goodfellow, Yoshua Bengio and Aaron Courville, MIT Press.

REFERENCE BOOKS:
1. The Elements of Statistical Learning. Hastie, R. Tibshirani, and J. Friedman,
Springer.
2. Probabilistic Graphical Models. Koller, and N. Friedman, MIT Press.
3. Bishop, C., M., Pattern Recognition and Machine Learning, Springer, 2006.
4. Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
5. Golub, G., H., and Van Loan, C.,F., Matrix Computations, JHU Press, 2013.
6. Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill
Education, 2004.
R22 B.Tech. CSE (AI & ML)
Syllabus

NATURE INSPIRED COMPUTING

Course Code: A16621 Subject Code:

B.Tech. IV Year I Sem. L TP C

2 0 0 2
Course Objectives:
 Knowledge on significance of evolutionary computing, neuro
computing and swarm intelligence

Course Outcomes:
 Familiar with Evolutionary Computing algorithms
 Understand scope of neurocomputing
 Compare different Ant Colony Optimization algorithmic models.
 Understand the scope of artificial immune systems
 Tackle different real world problems

UNIT - I
Evolutionary Computing
Problem Solving as a Search Task, Hill Climbing and Simulated Annealing,
Evolutionary Biology, Evolutionary Computing, The Other Main Evolutionary
Algorithms, From Evolutionary Biology to Computing, Scope of Evolutionary
Computing

UNIT - II
Neuro computing
The Nervous System, Artificial Neural Networks, Typical ANNS and Learning
Algorithms, From Natural to Artificial Neural Networks, Scope of
Neurocomputing

UNIT - III
Swarm Intelligence
Ant Colonies, PSO Algorithm,Swarm Robotics, Social Adaptation of Knowledge

UNIT - IV
Immuno computing
The Immune System, Artificial Immune Systems, Bone Marrow Models, Negative
Selection Algorithms, Clonal Selection and Affinity Maturation, Artificial Immune
Networks, From Natural to Artificial Immune Systems, Scope of Artificial Immune
Systems
R22 B.Tech. CSE (AI & ML)
Syllabus
UNIT - V
Case Studies- Bioinformatics, Information Display

TEXT BOOKS:
1. Leandro Nunes de Castro - " Fundamentals of Natural Computing,
Basic Concepts, Algorithms and Applications", Chapman & Hall/
CRC, Taylor and Francis Group, 2007
2. Albert Y.Zomaya - "Handbook of Nature-Inspired and Innovative Computing",
Springer, 2006
REFERENCE BOOKS:
1. Floreano, D. and C. Mattiussi -"Bio-Inspired Artificial Intelligence:
The oriesethods, and Technologies" IT Press, 2008
2. Marco Dorrigo, Thomas Stutzle -” Ant Colony Optimization”, Prentice Hall
of India, New Delhi, 2005
3. Vinod Chandra S S, Anand H S - “Machine Learning: A Practitioner's
Approach”, Prentice Hall of India, New Delhi, 2020
R22 B.Tech. CSE (AI & ML)
Syllabus

INTERNET OF THINGS (Professional Elective – III)

Course Code:A16625
Subject Code:
B.Tech. IV Year I Sem. L T P C
3 0 0 3
Pre-Requisites: Computer organization, Computer Networks
Course Objectives:
 To introduce the terminology, technology and its applications
 To introduce the concept of M2M (machine to machine) with necessary protocols
 To introduce the Python Scripting Language which is used in many IoT devices
 To introduce the Raspberry PI platform, that is widely used in IoT applications
 To introduce the implementation of web-based services on IoT devices
Course Outcomes:
 Interpret the impact and challenges posed by IoT networks leading to
new architectural models.
 Compare and contrast the deployment of smart objects and the technologies
to connect them to network.
 Appraise the role of IoT protocols for efficient network communication.
 Identify the applications of IoT in Industry.

UNIT - I
Introduction to Internet of Things –Definition and Characteristics of IoT,
Physical Design of IoT, Logical Design of IoT, IoT Enabling Technologies, IoT
Levels and Deployment Templates
Domain Specific IoTs – Home automation, Environment, Agriculture, Health and
Lifestyle

UNIT - II
IoT and M2M – M2M, Difference between IoT and M2M, SDN and NFV for IoT,
IoT System Management with NETCOZF, YANG- Need for IoT system
Management, Simple Network management protocol, Network operator
requirements, NETCONF, YANG, IoT Systems Management with NETCONF-
YANG

UNIT - III
IoT Systems – Logical design using Python-Introduction to Python – Python
Data types & Data structures, Control flow, Functions, Modules, Packaging, File
handling, Data/Time operations, Classes, Exception, Python packages of Interest
for IoT

UNIT - IV
R22 B.Tech. CSE (AI & ML)
IoT Physical Devices and
Syllabus Endpoints - Raspberry Pi, Linux on Raspberry Pi,
Raspberry Pi Interfaces, Programming Raspberry PI with Python, Other IoT
devices.

IoT Physical Servers and Cloud Offerings – Introduction to Cloud Storage

models and communication APIs, WAMP-AutoBahn for IoT, Xively Cloud for IoT,
Python web application framework
–Django, Designing a RESTful web API

UNIT V
Case studies- Home Automation, Environment-weather monitoring-weather
reporting- air pollution monitoring, Agriculture.

TEXT BOOK:
1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay
Madisetti, Universities Press, 2015, ISBN: 9788173719547.
REFERENCE BOOK:
1. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace,
O'Reilly (SPD), 2014, ISBN: 9789350239759.
R22 B.Tech. CSE (AI & ML)
Syllabus

DATA MINING (Professional Elective – III)

Course Code: A16626 Subject

Code:
B.Tech. IV Year I Sem. L T P C
3 0 0 3
Pre-Requisites:
1. Database Management System
2. Probability and Statistics

Course Objectives:
 Students will become acquainted with both the strengths and limitations of
various data mining techniques like Association, Classification, Cluster and
Outlier analysis.

Course Outcomes:
 Understand the need of data mining and pre-processing techniques.
 Perform market basket analysis using association rule mining.
 Utilize classification techniques for analysis and interpretation of data.
 Identify appropriate clustering and outlier detection techniques to handle complex
data.
 Understand the mining of data from web, text and time series data.
UNIT - I
Introduction to Data Mining:
What Data mining? Kinds of Data, Knowledge Discovery process, Data Mining
Functionalities, Kinds of Patterns, Major Issues in Data Mining. Data Objects and
Attribute Types, Basic Statistical Descriptions of Data, Data Visualization,
Measuring Data Similarity and Dissimilarity, Data Pre-processing: Major Tasks in
Data Pre-processing, Data Cleaning, Data Integration, Data Reduction, Data
Transformation and Data Discretization.

UNIT - II
Association Analysis: Basic Concepts, Market Basket Analysis, Apriori
Algorithm, FP-growth, From Association Analysis to Correlation Analysis, Pattern
Mining in Multilevel Associations and Multidimensional Associations.

UNIT - III
Classification: Basic Concepts, Decision Tree Induction, Bayes Classification
Methods, Rule-Based Classification, Metrics for Evaluating Classifier Performance,
Ensemble Methods, Multilayer Feed- Forward Neural Network, Support Vector
Machines, k-Nearest-Neighbor Classifiers.

UNIT - IV
Cluster Analysis: Requirements for Cluster Analysis, Overview of Basic
Clustering Methods, Partitioning Methods-k-Means, k-Medoids, Hierarchical
R22 B.Tech. CSE (AI & ML)
Methods-AGENES,
Syllabus DIANA, BIRCH, Density- Based Method-DBSCAN, Outlier
Analysis: Types of Outliers, Challenges of Outlier Detection, and Overview of
Outlier Detection Methods

UNIT - V
Advanced Concepts: Web Mining- Web Content Mining, Web Structure Mining,
Web Usage Mining, Spatial Mining- Spatial Data Overview, Spatial Data Mining
Primitives, Spatial Rules, Spatial Classification Algorithm, Spatial Clustering
Algorithms, Temporal Mining- Modeling Temporal Events, Time Series, Pattern
Detection, Sequences, Temporal Association Rules.

TEXT BOOKS:
1. Jiawei Han, Micheline Kamber, Jian Pei., Data Mining: Concepts and

Techniques, 3rd Edition, Morgan Kaufmann/Elsevier, 2012.

2. Margaret H Dunham, Data Mining Introductory and Advanced Topics,
2nd Edition, Pearson Education, India, 2006.

REFERENCE BOOKS:
1. Data Mining Techniques, Arun K Pujari, 3rd Edition, Universities Press.
2. Pang-Ning Tan, Michael Steinbach, Anuj Karpatne and Vipin Kumar,
Introduction to Data Mining, 2nd Edition, Pearson Education India, 2021.
3. Amitesh Sinha, Data Warehousing, Thomson Learning, India, 2007.
R22 B.Tech. CSE
SDES
Syllabus

SCRIPTING LANGUAGES (Professional Elective – III)

Course Code: A16627 Subject

Code:

B.Tech. IV Year I Sem. 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”.

Course Objectives:
 This course introduces the script programming paradigm
 Introduces scripting languages such as Perl, Ruby and TCL.
 Learning TCL

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

UNIT - I
Introduction: Ruby, Rails, The structure and Execution of Ruby Programs, Package
Management with RUBYGEMS, Ruby and web: Writing CGI scripts, cookies,
Choice of Webservers, SOAP and web services
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
Interpreter

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.
R22 B.Tech. CSE
SDES
Syllabus
UNIT - IV
Advanced perl
Finer points of looping, pack and unpack, filesystem, eval, data structures, packages,
modules, objects, interfacing to the operating system, Creating Internet ware
applications, Dirty Hands Internet Programming, security Issues.

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.
TEXT BOOKS:
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 Progammers guide by Dabve Thomas Second
edition

REFERENCE BOOKS:
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.
R22 B.Tech. CSE SDES
Syllabus

MOBILE APPLICATION DEVELOPMENT (Professional Elective – III)

Course Code: A16628 Subject

Code:

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

3 0 0 3
Prerequisites
1. Acquaintance with JAVA programming
2. A Course on DBMS

Course Objectives
 To demonstrate their understanding of the fundamentals of Android operating
systems
 To improves their skills of using Android software development tools
 To demonstrate their ability to develop software with reasonable
complexity on mobile platform
 To demonstrate their ability to deploy software to mobile devices
 To demonstrate their ability to debug programs running on mobile devices

Course Outcomes
 Understand the working of Android OS Practically.
 Develop Android user interfaces
 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
R22 B.Tech. CSE SDES
Fragments
Syllabus – 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
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)

TEXT BOOK:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox),
2012

REFERENCE BOOKS:
1. Android Application Development for Java Programmers, James C Sheusi,
Cengage Learning, 2013
2. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India
(Wrox), 2013
R22 B.Tech. CSE SDES
Syllabus
CLOUD COMPUTING (Professional Elective – III)

Course Code: A16629 Subject

Code:

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

3 0 0 3
Pre-requisites:
1. A course on “Computer Networks”.
2. A course on “Operating System”.
Course Objectives:
 This course provides an insight into cloud computing
 Topics covered include- Cloud Computing Architecture, Deployment
Models, Service Models, Technological Drivers for Cloud Computing,
Networking for Cloud Computing and Security in Cloud Computing

Course Outcomes:
 Understand different computing paradigms and potential of the paradigms
and specifically cloud computing
 Understand cloud service types, cloud deployment models and technologies
supporting and driving the cloud
 Acquire the knowledge of programming models for cloud and development
of software application that runs the cloud and various services available
from major cloud providers
 Understand the security concerns and issues in cloud computing
 Acquire the knowledge of advances in cloud computing.

UNIT - I
Computing Paradigms, Cloud Computing Fundamentals, Cloud Computing
Architecture and Management

UNIT - II
Cloud Deployment Models, Cloud Service Models, Technological Drivers for
Cloud Computing: SOA and Cloud, Multicore Technology, Web 2.0 and Web 3.0,
Pervasive Computing, Operating System, Application Environment

UNIT - III
Virtualization, Programming Models for Cloud Computing: MapReduce, Cloud
Haskell, Software Development in Cloud

UNIT - IV
R22 B.Tech. CSE SDES
Networking
Syllabus forCloud Computing: Introduction, Overview of Data Center
Environment, Networking Issues in Data Centers, Transport Layer Issues in DCNs,
Cloud Service Providers

UNIT - V
Security in Cloud Computing, and Advanced Concepts in Cloud Computing

TEXT BOOK:
1. Chandrasekaran, K. Essentials of cloud computing. CRC Press, 2014
REFERENCE BOOKS:
1. Cloud Computing: Principles and Paradigms, Editors: Rajkumar Buyya,
James Broberg, Andrzej M. Goscinski, Wiley, 2011
2. Enterprise Cloud Computing - Technology, Architecture, Applications,
Gautam Shroff, Cambridge University Press, 2010
3. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010
R22 B.Tech. CSE SDES
Syllabus

QUANTUM COMPUTING (Professional Elective – IV)

Course Code: A16625 Subject Code:

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

3 0 0 3
Course Outcomes
 Understand basics of quantum computing
 Understand physical implementation of Qubit
 Understand Quantum algorithms and their implementation
 Understand The Impact of Quantum Computing on Cryptography

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,
R22 B.Tech. CSE SDES
Syllabus teleportation
Quantum

TEXT BOOKS:
1. Nielsen M. A., Quantum Computation and Quantum Information, Cambridge

REFERENCE BOOKS:
4. Quantum Computing for Computer Scientists by Noson S. Yanofsky and Mirco A.
Mannucci
5. Benenti G., Casati G. and Strini G., Principles of Quantum Computation and
Information, Vol. I: Basic Concepts, Vol II
6. Basic Tools and Special Topics, World Scientific. Pittenger A. O., An
Introduction to Quantum Computing Algorithms
R22 B.Tech. CSE SDES
Syllabus

EXPERT SYSTEMS (Professional Elective – IV)

Course Code: A16626 Subject

Code:

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

3 0 0 3
Course Objectives:
 Understand the basic techniques of artificial intelligence.
 Understand the Non-monotonic reasoning and statistical reasoning.

Course Outcomes:
 Apply the basic techniques of artificial intelligence.
 Discuss the architecture of an expert system and its tools.
 Understand the importance of building an expert systems
 Understand various problems with an expert systems

UNIT- I
Introduction to AI programming languages, Blind search strategies, Breadth-
first – Depth-first – Heuristic search techniques Hill Climbing – Best first – A
Algorithms AO* algorithm – game trees, Min- max algorithms, game playing –
Alpha-beta pruning.

UNIT- II
Knowledge representation issues predicate logic – logic programming Semantic
nets- frames and inheritance, constraint propagation; Representing Knowledge
using rules, Rules-based deduction systems.

UNIT- III
Introduction to Expert Systems, Architecture of expert systems, Representation and
organization of knowledge, Basics characteristics, and types of problems handled
by expert systems.

UNIT- IV
Expert System Tools: Techniques of knowledge representations in expert systems,
knowledge engineering, system-building aids, support facilities, stages in the
development of expert systems.

UNIT- V
Building an Expert System: Expert system development, Selection of the tool,
Acquiring Knowledge, Building process.
R22 B.Tech. CSE SDES
Problems
Syllabus with Expert Systems: Difficulties, common pitfalls in planning, dealing
with domain experts, difficulties during development.

TEXT BOOKS:
1. Elain Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw-Hill, New
Delhi.
2. Waterman D.A., “A Guide to Expert Systems”, Addison Wesley Longman.

REFERENCE BOOKS:
1. Stuart Russel and other Peter Norvig, “Artificial Intelligence – A Modern
Approach”, Prentice- Hall,
2. Patrick Henry Winston, “Artificial Intelligence”, Addison Wesley,
3. Patterson, Artificial Intelligence & Expert System, Prentice Hall India, 1999.
4. Hayes-Roth, Lenat, and Waterman: Building Expert Systems, Addison Wesley,
5. Weiss S.M. and Kulikowski C.A., “A Practical Guide to Designing Expert
Systems”, Rowman &Allanheld, New Jersey.
R22 B.Tech. CSE SDES
Syllabus

SEMANTIC WEB (Professional Elective – IV)

Course Code: A16627 Subject

Code:

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

3 0 0 3
Course Objectives:
 Introduce Semantic Web Vision and learn Web intelligence
 Understanding about XML, RDF, RDFS, OWL
 Querying Ontology and Ontology Reasoning
 To learn Semantic Web Applications, Services and Technology
 To learn Knowledge Representation for the Semantic Web

Course Outcomes:
 Understand the characteristics of the semantic web technology
 Understand the concepts of Web Science, semantics of knowledge resource and
ontology
 Describe logic semantics and inference with OWL.
 Use ontology engineering approaches in semantic applications
 Learn about web graph processing for various applications such as search
engine, community detection

UNIT - I
Introduction: 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 XSL FO,
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.
R22 B.Tech. CSE SDES
Syllabus
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.
2. Peter Mika, Social Networks and the Semantic Web, Springer

REFERENCE BOOKS:
1. Thinking on the Web - Berners Lee, Godel and Turing, Wiley Interscience
2. 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.

3. Semantic Web Technologies, Trends and Research in Ontology

Based Systems, J. Davies, R. Studer, P. Warren, John Wiley & Sons.
4. Semantic Web and Semantic Web Services - Liyang Lu Chapman and
Hall/CRC Publishers, (Taylor & Francis Group)
5. Information Sharing on the semantic Web - Heiner Stuckenschmidt;
Frank Van Harmelen, Springer Publications.
6. Programming the Semantic Web, T. Segaran, C. Evans, J. Taylor, O’Reilly, SPD.
R22 B.Tech. CSE SDES
Syllabus

GAME THEORY (Professional Elective – IV)

Course Code: A16628 Subject Code:

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

3 0 0 3
Course Objectives
The course will explain in depth the standard equilibrium concepts (such as Nash
equilibrium, Subgame-Perfect Nash Equilibrium, and others) in Game Theory.

Course Outcomes
 Understand the basic concepts of game theory and solutions
 Understand different types of equilibrium interpretations
 Understand and analyze knowledge and solution concepts
 Analyze extensive games with perfect information
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
R22 B.Tech. CSE SDES
Bargaining
Syllabus 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. A course in Game Theory, M. J. Osborne and A. Rubinstein, MIT Press.

REFERENCE BOOKS:
1. Game Theory, Roger Myerson, Harvard University Press.
2. Game Theory, D. Fudenberg and J. Tirole, MIT Press.
3. Theory of Games and Economic Behavior, J. von Neumann and O.
Morgenstern, New York: John Wiley and Sons.
4. Games and Decisions, R.D. Luce and H. Raiffa, New York: John Wiley and Sons.
5. Game Theory, G. Owen, 2nd Edition, New York: Academic Press.
R22 B.Tech. CSE SDES
Syllabus

MOBILE COMPUTING (Professional Elective – IV)

Course Code: A16629 Subject

Code:

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

3 0 0 3
Prerequisites:
 Computer Networks
 Distributed Systems / Distributed Operating Systems

Course Objectives:
 To make the student understand the concept of mobile computing paradigm,
its novel applications and limitations, typical mobile networking
infrastructure through a popular GSM protocol, the issues of various layers
of mobile networks and their solutions.

Course Outcomes:
 Understand the concept of mobile computing paradigm, its novel applications and
limitations.
 Analyze and develop new mobile applications
 Understand the issues of various layers of mobile networks and their solutions.
 Classify data delivery mechanisms

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, CSHSD, DECT.

UNIT - II
(Wireless) Medium Access Control (MAC)
Motivation for a specialized MAC (Hidden and exposed terminals, Near and far
terminals), SDMA, FDMA, TDMA, CDMA, Wireless 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
R22 B.Tech. CSE SDES
Syllabus Transport
Mobile Layer
Conventional TCP/IP Protocols, Indirect TCP, Snooping TCP, Mobile TCP, Other
Transport Layer Protocols for Mobile Networks.
Database Issues
Database Hoarding & Caching Techniques, Client-Server Computing &
Adaptation, Transactional Models, Query processing, Data Recovery Process &
QoS Issues.

UNIT - IV
Data Dissemination and Synchronization
Communications Asymmetry, Classification of Data Delivery Mechanisms, Data
Dissemination, Broadcast Models, Selective Tuning and Indexing Methods, Data
Synchronization – Introduction, Software, and Protocols

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:
1. Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second Edition,
2009.
2. Raj Kamal, “Mobile Computing”, Oxford University Press, 2007, ISBN:
0195686772

REFERENCE BOOK:
1. Asoke K Talukder, Hasan Ahmed, Roopa Yavagal Mobile Computing:
Technology, Applications and Service Creation, McGraw Hill Education.
R22 B.Tech. CSE SDES
Syllabus

INTRODUCTION TO NATURAL LANGUAGE

PROCESSING
(Open Elective – II)

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

3 0 0 3

Prerequisites:
 Datastructuresandcompilerdesign

CourseObjectives:
 Introductionto some of the problems and solutions of NLP andtheirrelationto
linguistics and statistics.

CourseOutcomes:
1. Showsensitivitytolinguisticphenomenaandanabilitytomodelthemwithformalgrammar
s.
2. Understandandcarryoutproperexperimentalmethodologyfortrainingandevalua
ting empirical NLP systems
3. Abletomanipulateprobabilities,constructstatisticalmodelsoverstringsandtrees,
and estimate parameters using supervised and unsupervised training
methods.
4. Abletodesign,implement,andanalyzeNLPalgorithms;anddesigndifferentlangu
age 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, Features

UNIT- II
Syntax I: Parsing Natural Language, Treebanks: A Data-Driven Approach to
Syntax, Representation of Syntactic Structure, Parsing Algorithms

UNIT–III
SyntaxII:ModelsforAmbiguityResolutioninParsing,MultilingualIssues
SemanticParsingI:Introduction,SemanticInterpretation,SystemParadigms,WordSense

UNIT-IV
SemanticParsingII:Predicate-ArgumentStructure,MeaningRepresentationSystems
R22 B.Tech. CSE SDES
Syllabus
UNIT-V
LanguageModeling:Introduction,N-
GramModels,LanguageModelEvaluation,Bayesianparameter estimation, Language
Model Adaptation, Language Models- class based, variable length, Bayesian topic
based, Multilingual and Cross Lingual Language Modeling

TEXTBOOKS:
1. MultilingualnaturalLanguageProcessingApplications:FromTheorytoPractice–
DanielM. FBikelandImedZitouni,PearsonPublication

REFERENCEBOOK:
1. SpeechandNaturalLanguageProcessing-
DanielJurafsky&JamesHMartin,Pearson Publications.
2. NaturalLanguageProcessingandInformationRetrieval:TanvierSiddiqui,U.S.Tiwary.
R22 B.Tech. CSE SDES
Syllabus

AI APPLICATIONS (Open Elective – II)

Course Code: Subject Code:

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

3 0 0 3
Prerequisites: Fundamentals of AI

Course Objectives:
 To give deep knowledge of AI and how AI can be applied in various fields to make
life easy.

Course Outcomes:
 Correlate AI and solutions to modern problems.
 Use of AI in business applications
 Application of AI in manufacturing automation
 Use of AI in streaming of data and Network applications

UNIT - I
Alibaba: Using Artificial Intelligence To Power The Retail And Business-To-
Business Services Of The Future
Amazon: Using Deep Learning To Drive Business Performance

UNIT - II
McDonald’s: Using Robots And Artificial Intelligence To Automate
Processes Walmart: Using Artificial Intelligence To Keep Shelves
Stacked And Customers Happy

UNIT - III
LinkedIn: Using Artificial Intelligence To Solve The Skills Crisis
Netflix: Using Artificial Intelligence To Give Us A Better TV Experience

UNIT - IV
Salesforce: How Artificial Intelligence Helps Businesses Understand
Their Customers Uber: Using Artificial Intelligence To Do Everything

UNIT - V
Siemens: Using Artificial Intelligence And Analytics To Build The
Internet Of Trains Tesla: Using Artificial Intelligence To Build
Intelligent Cars

TEXT BOOK:
1. Artificial Intelligence in Practice: How 50 Successful Companies Used AI and
R22 B.Tech. CSE SDES
Machine Learning
Syllabus to Solve Problems, Bernard Marr, Matt Ward, Wiley.

PROFESSIONAL PRACTICE, LAW & ETHICS

Course Code: Subject Code:

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

0 0 4 2
Course Objectives:
 Understand the types of roles they are expected to play in the society as
practitioners of the engineering profession.
 To develop some ideas of the legal and practical aspects of their profession.

Course Outcome:
 Practice ethics and rule of the land in their profession
 Follow the principles and elements of legal contracts
 Able to resolve disputes pertaining to arbitration, reconciliation
 Aware of intellectual property loss

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 -
R22 B.Tech. CSE SDES
1930: General Principles,
Syllabus 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;

UNIT - IV
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 - 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
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. Wadhera (2004), Intellectual Property Rights, Universal Law Publishing Co.
2. T. Ramappa (2010), Intellectual Property Rights Law in India, Asia Law House.
3. O.P. Malhotra, Law of Industrial Disputes, N.M. Tripathi Publishers.
 R22 B.Tech. CSE SDES
Syllabus

INTERNET OF THINGS LAB (Professional Elective –

III)

Course Code:A16625 Subject

Code:

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

0 0 2 1
Course Objectives
 To introduce the raspberry PI platform, that is widely used in IoT applications
 To introduce the implementation of distance sensor on IoT devices

Course Outcomes
1. Ability to introduce the concept of M2M (machine to machine) with
necessary protocols and get awareness in implementation of distance
sensor
2. Get the skill to program using python scripting language which is used in many IoT
devices

List of Experiments
1. Using Raspberry pi
a. Calculate the distance using a distance sensor.
b. Interface an LED and switch with Raspberry pi.
c. Interface an LDR with Raspberrry Pi.

2. Using Arduino
a. Calculate the distance using a distance sensor.
b. Interface an LED and switch with Aurdino.
c. Interface an LDR with Aurdino
d. Calculate temperature using a temperature sensor.

3. Using Node MCU

a. Calculate the distance using a distance sensor.
b. Interface an LED and switch with Raspberry pi.
c. Interface an LDR with Node MCU
d. Calculate temperature using a temperature sensor.

4. Installing OS on Raspberry Pi
a) Installation using PiImager
b) Installation using image file
 Downloading an Image
 Writing the image to an SD card
R22 B.Tech. CSE SDES
Syllabus  using Linux
 using Windows
 Booting up Follow the instructions given in the URL
https://www.raspberrypi.com/documentation/computers/getting-
started.html

5. Accessing GPIO pins using Python

a) Installing GPIO Zero
library. update your
repositories list:
install the package for Python 3:
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.

6. Create a DJANGO project and an app.

7. Create a DJANGO view for weather station REST API
8. Create DJANGO template

9. Configure MYSQL with DJANGO framework

TEXT BOOKS:
1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay
Madisetti, Universities Press, 2015, ISBN: 9788173719547.
2. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace,
O'Reilly (SPD), 2014, ISBN: 9789350239759.
REFERENCE BOOKS:
1. Bernd Scholz-Reiter, Florian Michahelles, “Architecting the Internet of
Things”, ISBN 978-3- 642-19156-5 e-ISBN 978-3-642-19157-2, Springer,
2016
2. N. Ida, Sensors, Actuators and Their Interfaces, Scitech Publishers, 2014.
 R22 B.Tech. CSE SDES
Syllabus

DATA MINING LAB (Professional Elective – III)

Course Code: A16626 Subject

Code:

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

0 0 2 1
Prerequisites
 A course on “Database Management System

Course Objectives:
 The course is intended to obtain hands-on experience using data mining software.
 Intended to provide practical exposure of the concepts in data mining algorithms

Course Outcomes:
1. Apply preprocessing statistical methods for any given raw data.
2. Gain practical experience of constructing a data warehouse.
3. Implement various algorithms for data mining in order to discover
interesting patterns from large amounts of data.
4. Apply OLAP operations on data cube construction

LIST OF EXPERIMENTS: Experiments using Weka/ Pentaho/Python

1. Data Processing Techniques:
(i) Data cleaning (ii) Data transformation – Normalization (iii) Data integration
2. Partitioning - Horizontal, Vertical, Round Robin, Hash based
3. Data Warehouse schemas – star, snowflake, fact constellation
4. Data cube construction – OLAP operations
5. Data Extraction, Transformations & Loading operations
6. Implementation of Attribute oriented induction algorithm
7. Implementation of apriori algorithm
8. Implementation of FP – Growth algorithm
9. Implementation of Decision Tree Induction
10. Calculating Information gain measures
11. Classification of data using Bayesian approach
12. Classification of data using K – nearest neighbour approach
13. Implementation of K – means algorithm
14. Implementation of BIRCH algorithm
15. Implementation of PAM algorithm
16. Implementation of DBSCAN algorithm
R22 B.Tech. CSE SDES
SyllabusBOOKS:
TEXT
1. Data Mining – Concepts and Techniques - JIAWEI HAN &MICHELINE
KAMBER, Elsevier.
2. Data Warehousing, Data Mining &OLAP- Alex Berson and Stephen J. Smith-
Tata McGraw-Hill Edition, Tenth reprint 2007

REFERENCE BOOK:
1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Anuj Karpatne,
Introduction to Data Mining, Pearson Education
 R22 B.Tech. CSE SDES
Syllabus

SCRIPTING LANGUAGES LAB (Professional Elective–

III)

Course Code: A16627 Subject

Code:

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

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

Course Objectives
 To Understand the concepts of scripting languages for developing web based
projects
 To understand the applications the of Ruby, TCL, Perl scripting languages

Course Outcomes
 Ability to understand the differences between Scripting languages and programming
languages
 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 users 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 script 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
R22 B.Tech. CSE SDES
Write a TCL
Syllabus
14. 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

TEXT BOOKS:
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 Progammers guide by Dabve Thomas Second
edition

REFERENCE BOOKS:
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.
 R22 B.Tech. CSE SDES
Syllabus

MOBILE APPLICATION DEVELOPMENT LAB (Professional Elective – III)

Course Code: A16628 Subject

Code:

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

0 0 2 1
Course Objectives:
 To learn how to develop Applications in an android environment.
 To learn how to develop user interface applications.
 To learn how to develop URL related applications.
Course Outcomes:
 Understand the working of Android OS Practically.
 Develop user interfaces.
 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 the 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 (Datepicker),
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 the right fragment instead
of the second screen with the back button. Use Fragment transactions and
Rotation event listeners.
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 usernames and passwords (tab
separated fields and one record per line). When the user submits a login name
R22 B.Tech. CSE SDES
and password
Syllabus 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 a Login Failed message.
7. Create a user registration application that stores the user details in a database table.
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.

TEXT BOOKS:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox),
2012.
2. Android Application Development for Java Programmers, James C Sheusi,
Cengage, 2013.

REFERENCE BOOK:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India
(Wrox), 2013.
 R22 B.Tech. CSE SDES
Syllabus

CLOUD COMPUTING LAB (Professional Elective –

III)

Course Code: A16629

Subject Code:

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

0 0 2 1
Course 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.

Course Outcomes:
1. Understand various service types, delivery models and technologies of a
cloud computing environment.
2. Understand the ways in which the cloud can be programmed and deployed.
3. Understand cloud service providers like Cloudsim, Globus Toolkit etc.
4. Examine various programming paradigms suitable to solve real world and
scientific problems using cloud services.

List of Experiments:
1. Install Virtualbox/VMware Workstation with different flavors of Linux or
windows OS on top of windows7 or 8.
2. Install a C compiler in the virtual machine created using virtual box and
execute Simple Programs
3. Create an Amazon EC2 instance and set up a web-server on the instance and
associate an IP address with the instance.
4. Install Google App Engine. Create a hello world app and other simple web
applications using python/java.
5. Simulate a cloud scenario using CloudSim and run a scheduling algorithm
that is not present in CloudSim.
6. Find a procedure to transfer the files from one virtual machine to another virtual
machine.
7. Find a procedure to launch virtual machine using trystack (Online Openstack Demo
Version)
8. Install Hadoop single node cluster and run simple applications like word count.
9. Create a database instance in the cloud using Amazon RDS.
10. Create a database instance in the cloud using Google Cloud SQL
R22 B.Tech. CSE SDES
SyllabusBOOK:
TEXT
1. Essentials of cloud Computing: K. Chandrasekhran, CRC press, 2014

REFERENCE BOOKS:
1. Cloud Computing: Principles and Paradigms by Rajkumar Buyya, James Broberg
and Andrzej
M. Goscinski, Wiley, 2011.
2. Distributed and Cloud Computing, Kai Hwang, Geoffery C. Fox, Jack J.
Dongarra, Elsevier, 2012.
3. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010
R22 B.Tech. CSE SDES
Syllabus

SOCIAL NETWORK ANALYSIS (Professional Elective – V)

Course Code: A16634 Subject

Code:

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

3 0 0 3
Prerequisites
 Web Technologies
 Computer Networks
 Data Warehousing and Data Mining

Course Objectives
 Understand the concepts of social media
 Learn the mechanisms for social network analysis
 Analysis of widely used services such as email, Wikis, Twitter, flickr, YouTube, etc.

Course Outcomes
 Ability to construct social network maps easily
 Gain skills in tracking the content flow through the social media
 Understand NodeXL use 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:
Email: The lifeblood of Modern Communication.
Thread Networks: Mapping Message Boards and Email Lists
Twitter: Conversation, Entertainment and Information

UNIT - IV
CASE STUDIES:
Visualizing and Interpreting Facebook Networks, WWW Hyperlink Networks
R22 B.Tech. CSE SDES
UNIT -V
Syllabus

CASE STUDIES:
You Tube: Contrasting Patterns of Content Interaction, and
Prominence. Wiki Networks: Connections of Creativity and
Collaboration

TEXT BOOK:
1. Hansen, Derek, Ben Sheiderman, Marc Smith, Analyzing Social Media
Networks with NodeXL: Insights from a Connected World, Morgan
Kaufmann, 2011.

REFERENCE BOOKS:
1. Avinash Kaushik, Web Analytics 2.0: The Art of Online Accountability, Sybex,
2009.
2. Marshall Sponder, Social Media Analytics: Effective Tools for Building,

Interpreting and Using Metrics, 1st Edition, MGH, 2011.

R22 B.Tech. CSE SDES
Syllabus

FEDERATED MACHINE LEARNING (Professional Elective – V)

Course Code: A16635 Subject

Code:

B.Tech. IV Year II Sem. 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
 Understand the basics on privacy-preserving ML
 Analyze the key concepts of Distributed ML and FL
 Understand the key concepts and applications of Horizontal FL and Vertical FL
 Motivates the intensive mechanism design for FL
 Analyze the concepts of federated reinforcement learning

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
R22 B.Tech. CSE SDES
Horizontal
Syllabus 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, 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

TEXT BOOK:
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.
R22 B.Tech. CSE SDES
Syllabus

AUGMENTED REALITY & VIRTUAL REALITY (Professional Elective –V)

Course Code: A16636 Subject

Code:

B.Tech. IV Year II Sem. L TP C

3 0 0 3
Course Objectives:
 Provide a foundation to the fast growing field of AR and make the
students aware of the various AR concepts.
 To give historical and modern overviews and perspectives on virtual
reality. It describes the fundamentals of sensation, perception, technical
and engineering aspects of virtual reality systems.

Course Outcomes:
 Describe how AR systems work and list the applications of AR.
 Understand the software architectures of AR.
 Understand the Visual perception and rendering in VR
 Understand the interaction, auditory perception and rendering in VR

UNIT - I
Introduction to Augmented Reality: Augmented Reality - Defining augmented reality,
history of augmented reality, Examples, Related fields
Displays: Multimodal Displays, Visual Perception, Requirements and
Characteristics, Spatial Display Model, Visual Displays
Tracking: Tracking, Calibration, and Registration, Coordinate Systems, Characteristics
of Tracking Technology, Stationary Tracking Systems, Mobile Sensors

UNIT - II
Computer Vision for Augmented Reality: Marker Tracking, Multiple-Camera
Infrared Tracking, Natural Feature Tracking by Detection, Outdoor Tracking.
Interaction: Output Modalities, Input Modalities, Tangible Interfaces, Virtual
User Interfaces on Real Surfaces, Augmented Paper, Multi-view Interfaces, Haptic
Interaction
Software Architectures: AR Application Requirements, Software Engineering
Requirements, Distributed Object Systems, Dataflow, Scene Graphs

UNIT - III
Introduction to Virtual Reality: Defining Virtual Reality, History of VR, Human
Physiology and Perception
R22 B.Tech. CSE SDES
The Geometry of
Syllabus Virtual Worlds: Geometric Models, Axis-Angle Representations of
Rotation, Viewing Transformations
Light and Optics: Basic Behavior of Light, Lenses, Optical Aberrations, The
Human Eye, Cameras, Displays

UNIT - IV
The Physiology of Human Vision: From the Cornea to Photoreceptors, From
Photoreceptors to the Visual Cortex, Eye Movements, Implications for VR
Visual Perception: Visual Perception - Perception of Depth, Perception of Motion,
Perception of

Color Visual Rendering: Visual Rendering -Ray Tracing and Shading Models,
Rasterization, Correcting Optical Distortions, Improving Latency and Frame Rates,
Immersive Photos and Videos

UNIT - V
Motion in Real and Virtual Worlds: Velocities and Accelerations, The Vestibular
System, Physics in the Virtual World, Mismatched Motion and Vection
Interaction: Motor Programs and Remapping, Locomotion, Social Interaction
Audio: The Physics of Sound, The Physiology of Human Hearing, Auditory
Perception, Auditory Rendering

TEXT BOOKS:
1. Augmented Reality: Principles & Practice by Schmalstieg / Hollerer,
Pearson Education India;First edition (12 October 2016),ISBN-10:
9332578494
2. Virtual Reality, Steven M. LaValle, Cambridge University Press, 2016

REFERENCE BOOKS:
1. Allan Fowler-AR Game Development‖, 1st Edition, A press Publications,
2018, ISBN 978- 1484236178
2. Understanding Virtual Reality: Interface, Application and Design, William R
Sherman and Alan B Craig, (The Morgan Kaufmann Series in Computer
Graphics)”. Morgan Kaufmann Publishers, San Francisco, CA, 2002
3. Developing Virtual Reality Applications: Foundations of Effective Design,
Alan B Craig, William R Sherman and Jeffrey D Will, Morgan Kaufmann,
2009
4. Designing for Mixed Reality, Kharis O'Connell Published by O'Reilly
Media, Inc., 2016, ISBN: 9781491962381
5. Sanni Siltanen- Theory and applications of marker-based augmented
R22 B.Tech. CSE SDES
reality. Julkaisija
Syllabus – Utgivare Publisher. 2012. ISBN 978-951-38-7449-0
6. Gerard Jounghyun Kim, “Designing Virtual Systems: The Structured Approach”,
2005.
R22 B.Tech. CSE SDES
Syllabus

WEB SECURITY (Professional Elective –V)

Course Code: A16637 Subject

Code:

B.Tech. IV Year II Sem. L TP C

3 0 0 3
Course Objectives:
 Give an Overview of information security
 Give an overview of Access control of relational databases

Course Outcomes: Students should be able to

 Understand the Web architecture and applications
 Understand client side and service side programming
 Understand how common mistakes can be bypassed and exploit the application
 Identify common application vulnerabilities

UNIT - I
The Web Security, The Web Security Problem, Risk Analysis and Best Practices
Cryptography and the Web: Cryptography and Web Security, Working
Cryptographic Systems and Protocols, Legal Restrictions on Cryptography, Digital
Identification

UNIT - II
The Web’s War on Your Privacy, Privacy-Protecting Techniques, Backups and
Antitheft, Web Server Security, Physical Security for Servers, Host Security for
Servers, Securing Web Applications

UNIT - III
Database Security: Recent Advances in Access Control, Access Control Models for
XML, Database Issues in Trust Management and Trust Negotiation, Security in
Data Warehouses and OLAP Systems

UNIT - IV
Security Re-engineering for Databases: Concepts and Techniques, Database
Watermarking for Copyright Protection, Trustworthy Records Retention, Damage
Quarantine and Recovery in Data Processing Systems, Hippocratic Databases:
Current Capabilities and
R22 B.Tech. CSE SDES
UNIT -V
Syllabus

Future Trends Privacy in Database Publishing: A Bayesian Perspective, Privacy-

enhanced Location Based Access Control, Efficiently Enforcing the Security and
Privacy Policies in a Mobile Environment

TEXT BOOKS:
1. Web Security, Privacy and Commerce Simson G Arfinkel, Gene Spafford, O’Reilly.
2. Handbook on Database security applications and trends Michael Gertz, Sushil
Jajodia
R22 B.Tech. CSE SDES
Syllabus

AD-HOC & SENSOR NETWORKS (Professional Elective – V)

Course Code: A10546 Subject

Code:

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

3 0 0 3
3 0 0 3
Prerequisites
1. Computer Networks
2. Distributed Systems
3. Mobile Computing

Course Objectives
 To understand the challenges of routing in ad-hoc and sensor networks
 To understand various broadcast, mutlicast and geocasting protocols in ad
hoc and sensor networks
 To understand basics of Wireless sensors, and Lower Layer Issues and Upper Layer
Issues of WSN

Course Outcomes
 Understand the concepts of sensor networks and applications
 Understand and compare the MAC and routing protocols for adhoc networks
 Understand the transport protocols of sensor networks

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, WRP; Reactive: DSR, AODV, TORA; Hybrid:
ZRP; Position- based routing algorithms- Location Services-DREAM, Quorum-based,
GLS; Forwarding Strategies, Greedy Packet, Restricted Directional Flooding-DREAM,
LAR; Other routing algorithms-QoS Routing, CEDAR.

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

UNIT - III
Geocasting
R22 B.Tech. CSE SDES
Data-transmission
Syllabus 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
Transport layer, High-level application layer support, Adapting to the inherent dynamic
nature of WSNs.

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)
REFERENCE BOOKS:
1. C. Siva Ram Murthy, B.S. Manoj Ad Hoc Wireless Networks: Architectures and
Protocols.
2. Taieb Znati Kazem Sohraby, Daniel Minoli, Wireless Sensor Networks:
Technology, Protocols and Applications, Wiley.
R22 B.Tech. CSE SDES
Syllabus

SPEECH AND VIDEO PROCESSING (Professional Elective – VI)

Course Code: A16638

Subject Code:

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

3 0 0 3
Course Objectives:
 To make students understand speech and video processing techniques

Course Outcomes:
 Describe the mechanisms of human speech production systems and
methods for speech feature extraction.
 Understand basic algorithms of speech analysis and speech recognition.
 Explain basic techniques in digital video processing, including
imaging characteristics and sensors.
 Apply motion estimation and object tracking algorithms on video.

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
Feature extraction for speech, static and dynamic feature for speech
recognition, MFCC, LPCC, Distance measures, vector quantization models,
Gaussian Mixture model, HMM.

UNIT - III
Multi-Dimensional Signals and Systems
Multi-Dimensional Signals, Multi-Dimensional Transforms, Multi-Dimensional
Systems, Multi- Dimensional Sampling Theory, Sampling Structure Conversion
Digital Images and Video: Human Visual System and Color, Digital Video

UNIT - IV
Motion Estimation
Image Formation, Motion Models, 2D Apparent-Motion Estimation, Differential
R22 B.Tech. CSE SDES
Syllabus Matching
Methods, Methods, Nonlinear Optimization Methods, Transform-Domain
Methods, 3D Motion and Structure Estimation

UNIT - V
Video Segmentation and Tracking
Image Segmentation, Change Detection, Motion Segmentation, Motion Tracking,
Image and Video Matting, Performance Evaluation

TEXT BOOKS:
1. Fundamentals of Speech recognition – L. Rabiner and B. Juang, Prentice Hall
signal processing series
2. Digital Video processing, A Murat Tekalp, 2nd edition,Prentice Hall.

REFERENCE BOOKS:
1. Discrete-time speech signal processing: principles and practice, Thomas F. Quatieri,
Coth.
2. Video Processing and Communications, Yao Wang, J. Osternann and Qin
Zhang, Pearson Education
3. “Speech and Audio Signal Processing”, B.Gold and N. Morgan, Wiley.
4. “Digital image sequence processing, Compression, and analysis”, Todd R. Reed,
CRC Press
5. “Handbook of Image and Video processing”, Al Bovik, Academic press, second
Edition.
R22 B.Tech. CSE (AI & ML)
Syllabus

ROBOTIC PROCESS AUTOMATION (Professional Elective – VI)

Course Code: A10549 Subject

Code:

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

3 0 0 3
3 0 0 3
Prerequisites
4. Computer Networks
5. Distributed Systems
6. Mobile Computing

Course Objectives
 To understand the challenges of routing in ad-hoc and sensor networks
 To understand various broadcast, mutlicast and geocasting protocols in ad
hoc and sensor networks
 To understand basics of Wireless sensors, and Lower Layer Issues and Upper Layer
Issues of WSN

Course Outcomes
 Understand the concepts of sensor networks and applications
 Understand and compare the MAC and routing protocols for adhoc networks
 Understand the transport protocols of sensor networks

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, WRP; Reactive: DSR, AODV, TORA; Hybrid:
ZRP; Position- based routing algorithms- Location Services-DREAM, Quorum-based,
GLS; Forwarding Strategies, Greedy Packet, Restricted Directional Flooding-DREAM,
LAR; Other routing algorithms-QoS Routing, CEDAR.

UNIT - II
Data Transmission
Broadcast Storm Problem, Rebroadcasting Schemes-Simple-flooding, Probability-based
Methods, Area- based Methods, Neighbour Knowledge-based: SBA, Multipoint
Relaying, AHBP. Multicasting: Tree-based: AMRIS, MAODV; Mesh-based: ODMRP,
R22 B.Tech. CSE (AI & ML)
Syllabus

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
Transport layer, High-level application layer support, Adapting to the inherent dynamic
nature of WSNs.

TEXT BOOKS
3. Ad Hoc and Sensor Networks – Theory and Applications, Carlos Corderio
Dharma P.Aggarwal, World Scientific Publications, March 2006, ISBN –
981-256-681-3
4. Wireless Sensor Networks: An Information Processing Approach, Feng Zhao,
Leonidas Guibas, Elsevier Science, ISBN – 978-1-55860-914-3 (Morgan
Kauffman)
REFERENCE BOOKS:
3. C. Siva Ram Murthy, B.S. Manoj Ad Hoc Wireless Networks: Architectures and
Protocols.
4. Taieb Znati Kazem Sohraby, Daniel Minoli, Wireless Sensor Networks:
Technology, Protocols and Applications, Wiley.
R22 B.Tech. CSE (AI & ML)
Syllabus

RANDOMIZED ALGORITHMS (Professional Elective – VI)

Course Code: A16639 Subject

Code:

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

3 0 0 3
Course Objective:
 To introduce the power of randomization in the design of algorithms.

Course Outcomes:
 Appreciate the fundamentals of randomized algorithm design.
 Understand the fundamentals of Markov chains and the Monte Carlo method.
 Apply high probability analysis to selected randomized algorithms.
 Understand the Fingerprint and Pattern Matching techniques

UNIT- I
Introduction, A Min – Cut algorithm, Las Vegas and Monte Carlo, Binary
Planar Partitions, A Probabilistic Recurrence
Game-Theoretic Techniques: Game Tree Evaluation, The Minimax Principle

UNIT- II
Moments and Deviations: Occupancy Problems, The Markov and Chebyshev
Inequalities, Randomized Selection, Two Point sampling, The Coupon Collector’s
problem.
Markov Chains and Random Walks: A 2-SAT example, Markov Chains, Random
Walks on Graphs, Graph Connectivity

UNIT – III
Algebraic Techniques: Fingerprinting and Freivald’s Technique, Verifying Polynomial
Identities, Perfect Matching in Graphs, Verifying Equality of Strings, A Comparison
of Fingerprinting Techniques, Pattern Matching

UNIT- IV
Data Structures: The Fundamental of Data-structures, Random Treaps, Skip
R22 B.Tech. CSE (AI & ML)
Syllabus

Lists, Hash Tables Graph Algorithms: All Pairs Shortest Path, The Min- Cut
Problem, Minimum Spanning Trees

UNIT – V
Geometric Algorithms: Randomized Incremental Construction, Convex Hulls in the
Plane, Duality, Half- Space Intersections, Dalaunay Triangulations, Trapezoidal
Decompositions, Parallel and Distributed Algorithms: The PRAM Model, Sorting
on a PRAM, Maximal Independent Sets, Perfect Matchings

TEXT BOOKS:
1. Randomized Algorithms: Rajeev Motwani, Prabhakar Raghavan, Cambridge
University Press
2. Probability and Computing: Randomization and Probabilistic Techniques in
Algorithms and
3. Data Analysis by Eli Upfal and Michael Mitzenmacher.
R22 B.Tech. CSE (AI & ML) Syllabus

COGNITIVE COMPUTING (Professional Elective – VI)

Course Code: A16643 Subject

Code:

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

3 0 0 3
Prerequisites: Probability theory
Course Objectives:
 To provide an understanding of the central challenges in
realizing aspects of human cognition.
 To provide a basic exposition to the goals and methods of human cognition.
 To develop algorithms that use AI and machine learning along with
human interaction and feedback to help humans make
choices/decisions.
 To support human reasoning by evaluating data in context and
presenting relevant findings along with the evidence that justifies the
answers.

Course Outcomes:
 Understand cognitive computing
 Plan and use the primary tools associated with cognitive computing.
 Plan and execute a project that leverages cognitive computing.
 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.

UNIT - V
DeepQA Architecture, Unstructured Information Management Architecture
(UIMA), Structured Knowledge, Business Implications, Building Cognitive
Applications, Application of Cognitive Computing and Systems.

TEXT BOOK:
1. The Cambridge Handbook of Computational Psychology by Ron Sun
(ed.), Cambridge University Press.
REFERENCE BOOKS:
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 Hollan.
R22 B.Tech. CSE (AI & ML) SDES
Syllabus

CONVERSATIONAL AI (Professional Elective – VI)

Course Code: A16641 Subject Code:

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

3 0 0 3
Course Objectives:
 To be familiar with the basic knowledge about conversational systems.
 To understand the different techniques of natural language processing
 Study the fundamental role of machine learning in building conversational systems.
 To know the various applications of conversational systems and its future
development

Course Outcomes:
 Understand the basic technologies required for building a conversational system.
 Learn the rule-based dialogue system
 Involve AI in building conversational system and build advanced systems
that are cognitively inclined towards human behaviour.
 Develop a real time working conversational system for social domain that
can intelligently process inputs and generate relevant replies.

UNIT- I Introducing Dialogue Systems

Introduction of Dialogue System, History of Dialogue Systems, Present-Day
Dialogue Systems, Modeling Conversation Dialogue Systems, Designing and
Developing Dialogue Systems

UNIT- II Rule-Based Dialogue Systems: Architecture, Methods, and Tools

Dialogue Systems Architecture, designing a Dialogue System, Tools for Developing
Dialogue Systems, Rule-Based Techniques in Dialogue Systems Participating in the
Alexa Prize

UNIT- III Statistical Data-Driven Dialogue Systems

Motivating the Statistical Data-Driven Approach, Dialogue Components in the
Statistical Data-Driven Approach, Reinforcement Learning (RL), Representing
Dialogue as a Markov Decision Process, From MDPs to POMDPs, Dialogue State
Tracking, Dialogue Policy, Problems and Issues with Reinforcement Learning in
POMDPs

UNIT- IV Evaluating Dialogue Systems

Process of Evaluation, Evaluating Task-Oriented Dialogue Systems, Evaluating
R22 B.Tech. CSE (AI & ML) SDES
Open-Domain
Syllabus Dialogue Systems, Evaluation Frameworks- PARADISE, Quality of
Experience (QoE), Interaction Quality, Best Way to Evaluate Dialogue Systems.

UNIT- V End-to-End Neural Dialogue Systems

Neural Network Approaches to Dialogue Modeling, A Neural Conversational
Model, Introduction to the Technology of Neural Dialogue, Retrieval-Based Response
Generation, Task-Oriented Neural Dialogue Systems, Open-Domain Neural Dialogue
Systems, Some Issues and Current Solutions, Dialogue Systems: Datasets,
Competitions, Tasks, and Challenges.

TEXT BOOKS:
1. Michael McTear, “Conversational AI: Dialogue Systems, Conversational
Agents, and Chatbots”, Second Edition, Moran and Claypool Publishers,
2020.

REFERENCE BOOK:
1. Cathy Pearl, “Designing Voice User Interfaces: Principles of
Conversational Experiences”, O’REILLY, 2016.
R22 B.Tech. CSE (AI & ML) SDES
Syllabus

CHAT BOTS (Open Elective – III)

Course Code: Subject Code:

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

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

Course Outcomes:
 Understand basic concepts of chatbots
 Analyze different entities in building bots
 Understand the concepts of advanced bot building
 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

TEXT BOOK:
1. Rashid Khan, Anik Das, Build Better Chatbots: A Complete Guide to
Getting Started with Chatbots, Apress
R22 B.Tech. CSE (AI & ML) SDES
Syllabus

REFERENCE BOOKS:
1. Drexen Braxley, Chat GPT #1 Bible - 10 Books in 1: A Comprehensive
Guide to AI: Elevate Your Daily Life, Increase Work Output, Secure
Financial Gains, Foster Career Growth, and Cultivate Modern Talents
Paperback
2. D. Nardo Publications, ChatGPT Made Simple How Anyone Can Harness
AI To Streamline Their Work, Study & Everyday Tasks To Boost
Productivity & Maintain Competitive Edge By Mastering Prompt
Engineering
3. Robert E. Miller,Prompt Engineering Bible Join and Master the AI Revolutions
Profit Online with GPT-4 & Plugins for Effortless Money Making!
4. Lucas Foster, Chat GPT Bible Developer and Coder Special Edition:
Enhancing Coding Productivity with AI-Assisted Conversations.
R22 B.Tech. CSE (AI & ML) SDES
Syllabus

EVOLUTIONARY COMPUTING (Open Elective – III)

Course Code: Subject Code

B.Tech. IV Year II Sem. L

T P C
3 0 0 3
Prerequisites: Knowledge on algorithms

Course Objectives:
 Introduce the concepts of evolutionary computing and various evolution algorithms

Course Outcomes:
1. Appraise the significance of evolutionary computing
2. Apply genetic operators and genetic programming for classification problems
3. Hybridization of genetic algorithms with other techniques
4. Understand multi objective, interactive evolutionary algorithms

UNIT - I
Optimization, Modelling, and Simulation Problems
Search Problems, Optimization Versus Constraint Satisfaction, The Famous NP
Problems Evolutionary Computing: The Origins: The Main Evolutionary
Computing Metaphor, Brief History, The Inspiration from Biology, Evolutionary
Computing
Evolutionary Algorithm: Definition, Components of Evolutionary Algorithms, An
Evolutionary Cycle by Hand, Example Applications, The Operation of an
Evolutionary Algorithm, Natural Versus Artificial Evolution, Evolutionary
Computing, Global Optimization, and Other Search Algorithms

UNIT - II
Representation, Mutation, and Recombination
Representation and the Roles of Variation Operators, Binary Representation,
Integer Representation, Real-Valued or Floating-Point Representation, Permutation
Representation, Tree Representation Fitness, Selection, and Population
Management: Population Management Models, Parent Selection, Survivor
Selection, Selection Pressure, Multimodal Problems, Selection, and the Need for
Diversity
Popular Evolutionary Algorithm Variants: Genetic Algorithms, Evolution
Strategies, Evolutionary Programming, Genetic Programming, Learning Classifier
Systems, Differential Evolution, Particle Swarm Optimization, Estimation of
R22 B.Tech. CSE (AI & ML) SDES
Distribution
Syllabus Algorithms

UNIT - III
Parameters and Parameter Tuning: Evolutionary Algorithm Parameters, EAs
and EA Instances, Designing Evolutionary Algorithms, The Tuning Problem,
Algorithm Quality: Performance and Robustness, Tuning Methods.
Parameter Control: Introduction, Examples of Changing Parameters,
Classification of Control Techniques, Examples of Varying EA Parameters

UNIT - IV
Working with Evolutionary Algorithms: Working of EA, Performance
Measures, Test Problems
for Experimental Comparisons, Example Applications

Hybridization with Other Techniques: Memetic Algorithms: Motivation for

Hybridizing EAs, A Brief Introduction to Local Search, Structure of a Memetic
Algorithm, Adaptive Memetic Algorithms, Design Issues for Memetic Algorithms,
Example Application: Multistage Memetic Timetabling

UNIT – V
Multiobjective Evolutionary Algorithms

Multiobjective Optimization Problems, Dominance and Pareto Optimality, EA

Approaches to Multiobjective Optimization, Example Application: Distributed
Coevolution of Job Shop Schedules Constraint Handling: Two Main Types of
Constraint Handling, Approaches to Handling Constraints, Example Application:
Graph Three-Colouring
Interactive Evolutionary Algorithms: Characteristics of Interactive Evolution,
Algorithmic Approaches to the Challenges of IEAs, Interactive Evolution as Design
vs. Optimization, Example Application: Automatic Elicitation of User Preferences

TEXT BOOK:
1. A. E. Eiben, J. E. Smith, Introduction to Evolutionary Computing, Second Edition,
Springer.

REFERENCE BOOKS:
1. David E. Goldberg, "Genetic Algorithms in search, Optimization & Machine
Learning".
R22 B.Tech. CSE (AI & ML) SDES
2. Neural Networks and
Syllabus Fuzzy Logic System by Bart Kosko, PHI Publications.