R22 B.Tech.

CSE (AI and ML) Syllabus JNTU Hyderabad

AM501PC: DESIGN AND ANALYSIS OF ALGORITHMS

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

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, Heapsort
Backtracking: General method, applications, n-queen’s problem, sum of subsets problem, graph
Coloring, hamitonian 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.

Page 68 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

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.

Page 69 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM502PC: MACHINE LEARNING

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 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 – 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 – Unsupervised 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.

Page 70 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

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

Page 71 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM503PC: COMPUTER NETWORKS

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.
 Obtain the skills of subnetting and routing mechanisms.
 Familiarity with the essential protocols of computer networks, and how they can be applied in
network design and implementation.

UNIT - I
Network hardware, Network software, OSI, TCP/IP Reference models, Example Networks: ARPANET,
Internet.
Physical Layer: Guided Transmission media: twisted pairs, coaxial cable, fiber optics, Wireless
Transmission.
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.

UNIT - III
Network Layer: Design issues, Routing algorithms: shortest path routing, Flooding, Hierarchical routing,
Broadcast, Multicast, distance vector routing, Congestion Control Algorithms, Quality of Service,
Internetworking, The Network layer in the internet.

UNIT - IV
Transport Layer: Transport Services, Elements of Transport protocols, Connection management,
TCP and UDP protocols.

UNIT - V
Application Layer –Domain name system, SNMP, Electronic Mail; the World WEB, HTTP, Streaming
audio and video.

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 72 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

SM504MS: BUSINESS ECONOMICS AND FINANCIAL ANALYSIS

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

3 0 0 3

Prerequisites: None

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

Course Outcome: The students will understand 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:
Production Analysis: Factors of Production, Production Function, Production Function with one
variable input, two variable inputs, Returns to Scale, Different Types of Production Functions.
Cost analysis: Types of Costs, Short run and Long run Cost Functions.
Market Structures: Nature of Competition, Features of Perfect competition, Monopoly, Oligopoly,
Monopolistic Competition.
Pricing: Types of Pricing, Product Life Cycle based Pricing, Break Even Analysis, Cost Volume Profit
Analysis.

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

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

Page 73 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

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 74 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM511PE: GRAPH THEORY (Professional Elective – I)

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.

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 75 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM512PE: INTRODUCTION TO DATA SCIENCE (Professional Elective – I)

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

3 0 0 3
Course Objectives:
 Learn concepts, techniques and tools they need to deal with various facets of data science
practice, including data collection and integration
 Understand the basic types of data and basic statistics
 Identify the importance of data reduction and data visualization techniques

Course Outcomes:
 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 – 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.
Factors and Data Frames: 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

Page 76 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

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 77 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM513PE: WEB PROGRAMMING (Professional Elective – I)

B.Tech. III Year I Sem. L T 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 Managers 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 78 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM514PE: IMAGE PROCESSING (Professional Elective – I)

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

3 0 0 3
Prerequisites
1. Students are expected to have knowledge in linear signals and systems, Fourier Transform,
basic linear algebra, basic probability theory and basic programming techniques; knowledge of
digital signal processing is desirable.
2. A course on “Computational Mathematics”
3. A course on “Computer Oriented Statistical Methods”

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

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

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

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

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

UNIT - IV
Image Segmentation Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding,
Region Oriented Segmentation.

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

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

Page 79 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM515PE: COMPUTER GRAPHICS (Professional Elective – I)

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
3-D object representation: 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

Page 80 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

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.

Page 81 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM505PC: MACHINE LEARNING LAB

B.Tech. III Year I Sem. L T P 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.

Page 82 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM506PC: COMPUTER NETWORKS LAB

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 using NS2 Simulator
i. NS2 Simulator-Introduction
ii. Simulate to Find the Number of Packets Dropped
iii. Simulate to Find the Number of Packets Dropped by TCP/UDP
iv. Simulate to Find the Number of Packets Dropped due to Congestion
v. Simulate to Compare Data Rate & Throughput.
vi. Simulate to Plot Congestion for Different Source/Destination
vii. Simulate to Determine the Performance with respect to Transmission of Packets

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.

Page 83 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

EN508HS: ADVANCED ENGLISH COMMUNICATION SKILLS LAB

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 – Development of
Listening 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

Page 84 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

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
 LCD Projector
 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.

Page 85 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

AM507PC: UI DESIGN-FLUTTER

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.

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.

Page 86 of 147
R22 B.Tech. CSE (AI and ML) Syllabus JNTU Hyderabad

*MC510: INTELLECTUAL PROPERTY RIGHTS

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

Page 87 of 147