R25 M.

Tech AI & DS JNTU Hyderabad

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

M. Tech. in ARTIFICIAL INTELLIGENCE & DATA SCIENCE
COURSE STRUCTURE AND SYLLABUS (R25)

EFFECTIVE FROM ACADEMIC YEAR 2025-26 ADMITTED BATCH

I YEAR I SEMESTER
Course Code Course Title L T P Credits
Professional Core – I Artificial Intelligence and Intelligent Systems 3 0 0 3
Professional Core – II Statistical Foundations for Data Science 3 0 0 3
Professional Elective – I 1. Data Analytics 3 0 0 3
2. Natural Language Processing
3. Database Programming with PL/SQL
Professional Elective – 1. Mining of Massive Datasets 3 0 0 3
II 2. Generative AI
3. Prompt Engineering
Lab – I Artificial Intelligence and Intelligent Systems 0 0 4 2
Lab
Lab – II Professional Elective – I Lab 0 0 4 2
Research Methodology & IPR 2 0 0 2
Audit – I Audit Course – I 2 0 0 0
Total 16 0 8 18

I YEAR II SEMESTER
Course Code Course Title L T P Credits
Professional Core – III Neural Networks & Deep Learning 3 0 0 3
Professional Core – IV Predictive Analytics 3 0 0 3
Professional Elective – 1. Big Data Technologies 3 0 0 3
III 2. Data Stream Processing
3. Enterprise Cloud Concepts
Professional Elective – 1. Reinforcement Learning 3 0 0 3
IV 2. Machine Translation
3. Nature Inspired Computing
Lab – III Neural Networks & Deep Learning Lab 0 0 4 2
Lab – IV Professional Elective – III Lab 0 0 4 2
Mini Project with Seminar 0 0 4 2
Audit – II Audit Course – II 2 0 0 0
Total 14 0 12 18

II YEAR I SEMESTER
Course Code Course Title L T P Credits
Professional Elective – V 1. Computer Vision and Robotics 3 0 0 3
2. Social Media Mining
3. Quantum Computing
Open Elective Open Elective 3 0 0 3
Dissertation Dissertation Work Review – II* 0 0 18 6
Total 6 0 18 12

II YEAR II SEMESTER
Course Code Course Title L T P Credits
Dissertation Dissertation Work Review – III* 0 0 18 6
Dissertation Dissertation Viva-Voce 0 0 42 14
Total 0 0 60 20
R25 M.Tech AI & DS JNTU Hyderabad

Note: For Dissertation Work Review - I, please refer R25 Academic Regulations.

Audit Course I & II:

1. English for Research Paper Writing
2. Disaster Management
3. Sanskrit for Technical Knowledge
4. Value Education
5. Constitution of India
6. Pedagogy Studies
7. Stress Management by yoga
8. Personality Development Through Life Enlightenment Skills

Open Electives for other Departments:

1. Fundamentals of Data Science
2. Data Visualization Techniques
3. Fundamentals of AI
R25 M.Tech AI & DS JNTU Hyderabad

ARTIFICIAL INTELLIGENCE AND INTELLIGENT SYSTEMS (PC - I)

M.Tech AI & DS I Year I Sem. L T P C

3 0 0 3
Pre-Requisites: UG level course in Mathematics, Data Structures

Course Objectives:
1. To impart knowledge about Artificial Intelligence.
2. To give understanding of the main abstractions and reasoning for intelligent systems.
3. To enable the students to understand the basic principles of Artificial Intelligence in various
applications.

Course Outcomes: After completion of course, students would be able to:

1. Solve basic AI based problems.
2. Define the concept of Artificial Intelligence.
3. Apply AI techniques to real-world problems to develop intelligent systems.
4. Select appropriately from a range of techniques when implementing intelligent systems.

UNIT - I
Introduction: Overview of AI problems, AI problems as NP, NP-Complete and NP Hard problems.
Strong and weak, neat and scruffy, symbolic and sub-symbolic, knowledge-based and data-driven AI.

UNIT -II
Search Strategies: Problem spaces (states, goals and operators), problem solving by search,
Heuristics and informed search, Min-max Search, Alpha-beta pruning. Constraint satisfaction
(backtracking and local search methods).

UNIT - III
Knowledge representation and reasoning: propositional and predicate logic, Resolution and
theorem proving, Temporal and spatial reasoning. Probabilistic reasoning, Bayes theorem. Totally-
ordered and partially-ordered Planning. Goal stack planning, Nonlinear planning, Hierarchical
planning.

UNIT - IV
Learning: Learning from example, Learning by advice, Explanation based learning, Learning in
problem solving, Classification, Inductive learning, Naive Bayesian Classifier, decision trees.
Natural Language Processing: Language models, n-grams, Vector space models, Bag of words,
Text classification. Information retrieval.

UNIT - V
Agents: Definition of agents, Agent architectures (e.g., reactive, layered, cognitive), Multi-agent
systems- Collaborating agents, Competitive agents, Swarm systems and biologically inspired models.
Intelligent Systems: Representing and Using Domain Knowledge, Expert System Shells,
Explanation, Knowledge Acquisition.
Key Application Areas: Expert system, decision support systems, Speech and vision, Natural
language processing, Information Retrieval, Semantic Web.

TEXT BOOKS:
1. Artificial Intelligence: A Modern Approach by S. Russell and P. Norvig, Prentice Hall

REFERENCE BOOKS:
1. Artificial Intelligence by Elaine Rich, Kevin Knight and Shivashankar B Nair, Tata McGraw Hill.
2. Introduction to Artificial Intelligence and Expert Systems by Dan W. Patterson, Pearson
Education.
R25 M.Tech AI & DS JNTU Hyderabad

STATISTICAL FOUNDATIONS FOR DATA SCIENCE (PC - II)

M.Tech AI & DS I Year I Sem. L T P C

3 0 0 3
Prerequisites: Mathematics courses of first year of study.
Course Objectives:
1. The Number Theory basic concepts useful for cryptography etc
2. The theory of Probability, and probability distributions of single and multiple random variables
3. The sampling theory and testing of hypothesis and making inferences
4. Stochastic process and Markov chains.

Course Outcomes: After learning the contents of this course, the student must be able to
1. Apply the number theory concepts to cryptography domain
2. Apply the concepts of probability and distributions to some case studies
3. Correlate the material of one unit to the material in other units
4. Resolve the potential misconceptions and hazards in each topic of study.

UNIT - I
Greatest Common Divisors and Prime Factorization: Greatest common divisors, The Euclidean
algorithm, The fundamental theorem of arithmetic, Factorization of integers and the Fermat numbers
Congruences: Introduction to congruences, Linear congruences, The Chinese remainder theorem,
Systems of linear congruences

UNIT - II
Simple Linear Regression and Correlation: Introduction to Linear Regression, The Simple Linear
Regression Model, Least Squares and the Fitted Model, Properties of the Least Squares Estimators,
Inferences Concerning the Regression Coefficients, Prediction, Simple Linear Regression Case Study
Random Variables and Probability Distributions: Concept of a Random Variable, Discrete Probability
Distributions, Continuous Probability Distributions, Statistical Independence. Discrete Probability
Distributions: Binomial Distribution, Poisson distribution.

UNIT - III
Continuous Probability Distributions: Normal Distribution, Areas under the Normal Curve,
Applications of the Normal Distribution, Normal Approximation to the Binomial,Fundamental Sampling
Distributions: Random Sampling, Sampling Distributions, Sampling, Distribution of Means and the
Central Limit Theorem, Sampling Distribution of S2, t–Distribution, FDistribution.

UNIT - IV
Estimation & Tests of Hypotheses: Introduction, Statistical Inference, Classical Methods of
Estimation. Estimating the Mean, Standard Error of a Point Estimate, Prediction Intervals, Tolerance
Limits, Estimating the Variance, Estimating a Proportion for single mean, Difference between Two
Means, between Two Proportions for Two Samples and Maximum Likelihood Estimation.

UNIT - V
Stochastic Processes and Markov Chains: Introduction to Stochastic processes- Markov process.
Transition Probability, Transition Probability Matrix, First order and Higher order Markov process,n
step transition probabilities, Markov chain, Steady state condition, Markov analysis.

TEXT BOOKS:
1. Kenneth H. Rosen, Elementary number theory & its applications, sixth edition,
AddisonWesley, ISBN 978 0-321-50031-1
2. Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers, Keying Ye, Probability & Statistics
for Engineers & Scientists, 9th Ed. Pearson Publishers.
3. S. D. Sharma, Operations Research, Kedarnath and Ramnath Publishers, Meerut, Delhi

REFERENCE BOOKS:
1. S C Gupta and V K Kapoor, Fundamentals of Mathematical statistics, Khanna publications
2. T.T. Soong, Fundamentals of Probability And Statistics For Engineers, John Wiley & Sons
Ltd, 2004.
3. Sheldon M Ross, Probability and statistics for Engineers and scientists, Academic Press.
R25 M.Tech AI & DS JNTU Hyderabad

DATA ANALYTICS (PROFESSIONAL ELECTIVE - I)

M.Tech AI & DS I Year I 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:
1. To explore the fundamental concepts of data analytics.
2. To learn the principles and methods of statistical analysis
3. Discover interesting patterns, analyze supervised and unsupervised models and estimate the
accuracy of the algorithms.
4. To understand the various search methods and visualization techniques.

Course Outcomes: After completion of this course students will be able to

1. Understand the impact of data analytics for business decisions and strategy
2. Carry out data analysis/statistical analysis
3. To carry out standard data visualization and formal inference procedures
4. Design Data Architecture
5. 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,
TreeBuilding – Regression, Classification, Overfitting, Pruning and Complexity, Multiple Decision
Trees etc.
Time Series Methods: Arima, Measures of Forecast 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.
R25 M.Tech AI & DS JNTU Hyderabad

NATURAL LANGUAGE PROCESSING (PROFESSIONAL ELECTIVE - I)

M.Tech AI & DS I Year I Sem. L T P C

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

Course Objectives:
1. Introduction to some of the problems and solutions of NLP and their relation to linguistics and
statistics.

Course Outcomes:
1. Show sensitivity to linguistic phenomena and an ability to model them with formal grammars.
2. Understand and carry out proper experimental methodology for training and evaluating
empirical NLP systems
3. Able to manipulate probabilities, construct statistical models over strings and trees, and
estimate parameters using supervised and unsupervised training methods.
4. Able to design, implement, and analyze NLP algorithms Able to design different language
modeling Techniques.
5. Able to design different language modeling Techniques.

UNIT - I
Finding the Structure of Words: Words and Their Components, Issues and Challenges,
Morphological Models
Finding the Structure of Documents: Introduction, Methods, Complexity of the Approaches,
Performances of the Approaches

UNIT - II
Syntax Analysis: Parsing Natural Language, Treebanks: A Data-Driven Approach to Syntax,
Representation of Syntactic Structure, Parsing Algorithms, Models for Ambiguity Resolution in
Parsing, Multilingual Issues

UNIT - III
Semantic Parsing: Introduction, Semantic Interpretation, System Paradigms, Word Sense Systems,
Software.

UNIT - IV
Predicate-Argument Structure, Meaning Representation Systems, Software.

UNIT - V
Discourse Processing: Cohesion, Reference Resolution, Discourse Cohesion and Structure
Language Modeling: Introduction, N-Gram Models, Language Model Evaluation, Parameter
Estimation, Language Model Adaptation, Types of Language Models, Language-Specific Modeling
Problems, Multilingual and Cross Lingual Language Modeling

TEXT BOOKS:
1. Multilingual natural Language Processing Applications: From Theory to Practice – Daniel M.
Bikel and Imed Zitouni, Pearson Publication.
2. Natural Language Processing and Information Retrieval: Tanvier Siddiqui, U.S. Tiwary.

REFERENCES:
1. Speech and Natural Language Processing - Daniel Jurafsky & James H Martin, Pearson
Publications.
R25 M.Tech AI & DS JNTU Hyderabad

DATABASE PROGRAMMING WITH PL/SQL (PROFESSIONAL ELECTIVE - I)

M.Tech AI & DS I Year I Sem. L T P C

3 0 0 3

Course Objectives:
1. Knowledge on significance of SQL fundamentals.
2. Evaluate functions and triggers of PL/SQL
3. Knowledge on control structures, packages in PL/SQL and its applications

Course Outcomes:
1. Understand importance of PL/SQL basics
2. Implement functions and procedures using PL/SQL
3. Understand the importance of triggers in database

Unit I
PL/SQL Basics
Block Structure, Behavior of Variables in Blocks, Basic Scalar and Composite Data Types, Control
Structures, Exceptions, Bulk Operations, Functions, Procedures, and Packages, Transaction Scope

Unit II
Language Fundamentals & Control Structures
Lexical Units, Variables and Data Types, Conditional Statements, Iterative Statements, Cursor
Structures, Bulk Statements, Introduction to Collections, Object Types: Varray and Table Collections,
Associative Arrays, Oracle Collection API

Unit III
Functions and Procedures
Function and Procedure Architecture, Transaction Scope, Calling Subroutines, Positional Notation,
Named Notation, Mixed Notation, Exclusionary Notation, SQL Call Notation, Functions, Function
Model Choices, Creation Options, Pass-by-Value Functions, Pass-by-Reference Functions,
Procedures, Pass-by-Value Procedures, Pass-by-Reference Procedures, Supporting Scripts.

Unit IV
Packages
Package Architecture, Package Specification, Prototype Features, Serially Reusable Precompiler
Directive, Variables, Types, Components: Functions and Procedures, Package Body, Prototype
Features, Variables, Types, Components: Functions and Procedures, Definer vs. Invoker Rights
Mechanics, Managing Packages in the Database Catalog, Finding, Validating, and Describing
Packages, Checking Dependencies, Comparing Validation Methods: Timestamp vs. Signature.

Unit V
Triggers
Introduction to Triggers, Database Trigger Architecture, Data Definition Language Triggers, Event
Attribute Functions, Building DDL Triggers, Data Manipulation Language Triggers, Statement-Level
Triggers, Row-Level Triggers, Compound Triggers, INSTEAD OF Triggers, System and Database
Event Triggers, Trigger Restrictions, Maximum Trigger Size, SQL Statements, LONG and LONG
RAW Data Types.

TEXT BOOKS:
1. Oracle Database 12c PL/SQL Programming Michael McLaughlin, McGraw Hill Education.

REFERENCES:
1. Benjamin Rosenzweig, Elena Silvestrova Rakhimov, Oracle PL/SQL by example Fifth Edition.
2. Dr. P. S. Deshpande, SQL & PL / SQL for Oracle 11g Black Book.
R25 M.Tech AI & DS JNTU Hyderabad

MINING MASSIVE DATASETS (PROFESSIONAL ELECTIVE - II)

M.Tech AI & DS I Year I Sem. L T P C
3 0 0 3
Prerequisites:
1. Students should be familiar with Data mining, algorithms, basic probability theory and
Discrete math.

Course Objectives:
1. This course will cover practical algorithms for solving key problems in mining of massive
datasets.
2. This course focuses on parallel algorithmic techniques that are used for large datasets.
3. This course will cover stream processing algorithms for data streams that arrive constantly,
page ranking algorithms for web search, and online advertisement systems that are studied in
detail.

Course Outcomes:
1. Handle massive data using MapReduce.
2. Develop and implement algorithms for massive data sets and methodologies in the context
of data mining.
3. Understand the algorithms for extracting models and information from large datasets
4. Develop recommendation systems.
5. Gain experience in matching various algorithms for particular classes of problems.

UNIT I
Data Mining-Introduction-Definition of Data Mining-Statistical Limits on Data Mining,
MapReduce and the New Software Stack-Distributed File Systems, MapReduce, Algorithms Using
MapReduce.

UNIT II
Similarity Search: Finding Similar Items-Applications of Near-Neighbor Search, Shingling of
Documents, Similarity-Preserving Summaries of Sets, Distance Measures.
Streaming Data: Mining Data Streams-The Stream Data Model, Sampling Data in a Stream, Filtering
Streams

UNIT III
Link Analysis-PageRank, Efficient Computation of PageRank, Link Spam
Frequent Itemsets-Handling Larger Datasets in Main Memory, Limited-Pass Algorithms, Counting
Frequent Items in a Stream.
Clustering-The CURE Algorithm, Clustering in Non-Euclidean Spaces, Clustering for Streams and
Parallelism

UNIT IV
Advertising on the Web-Issues in On-Line Advertising, On-Line Algorithms, The Matching Problem,
The Adwords Problem, Adwords Implementation.
Recommendation Systems-A Model for Recommendation Systems, Content-Based
Recommendations, Collaborative Filtering, Dimensionality Reduction, The NetFlix Challenge.

UNIT V
Mining Social-Network Graphs-Social Networks as Graphs, Clustering of Social-Network Graphs,
Partitioning of Graphs, Simrank, Counting Triangles

TEXT BOOKS:
1. Jure Leskovec, Anand Rajaraman, Jeff Ullman, Mining of Massive Datasets, 3rd Edition.

REFERENCE BOOKS:
1. Jiawei Han & Micheline Kamber , Data Mining – Concepts and Techniques 3rd Edition
Elsevier.
2. Margaret H Dunham, Data Mining Introductory and Advanced topics, PEA.
3. Ian H. Witten and Eibe Frank, Data Mining: Practical Machine Learning Tools and
Techniques, Morgan Kaufmann.
R25 M.Tech AI & DS JNTU Hyderabad

GENERATIVE AI (PROFESSIONAL ELECTIVE - II)

M.Tech AI & DS I Year I Sem. L T P C

3 0 0 3
Course Objectives
1. To introduce the foundations, evolution, and core concepts of AI, ML, DL, NLP, and
Generative AI.
2. To develop understanding of advanced neural architectures and generative models such as
GANs, VAEs, and Transformers.
3. To explore Large Language Models, prompt engineering, and their real-world applications.
4. To familiarize learners with frameworks, multimodal applications, and ethical considerations in
Generative AI.

Course Outcomes
1. Demonstrate knowledge of AI foundations, generative models, and advanced neural
architectures.
2. Apply generative AI techniques to create solutions for text, image, video, and multimodal
tasks.
3. Design, fine-tune, and optimize Large Language Models for specific applications.
4. Evaluate ethical, social, and legal implications of Generative AI deployments and propose
mitigation strategies.

UNIT 1
Foundations of AI and Generative Models
Introduction and historical evolution to Artificial Intelligence (AI), Machine Learning (ML), Natural
Language Processing (NLP)and Deep Learning (DL), Structure of Artificial Neural Networks (ANNs),
Mathematical and computational foundations of generative modeling, Overview of generative models
and their applications across various domains; Importance of Generative AI in modern applications,
Transfer learning and in advancing Generative AI

UNIT 2
Advanced Neural Architectures for Generative AI
Variational Autoencoders (VAEs): principles and applications, Generative Adversarial Networks
(GANs): architecture and working principles; Transformer architecture and attention mechanisms (in
detail); Long Short-Term Memory Networks (LSTMs) and the limitations of traditional RNNs/LSTMs,
Advanced Transformer architectures and techniques, Pre-training and transfer learning strategies for
generative models

UNIT 3
Large Language Models and Prompt Engineering
Overview of Large Language Models (LLMs), GPT architecture, variants, and working principles, Pré-
training and fine-tuning GPT models for applications (e.g., chatbots, text generation), Case study:
GPT-based customer support chatbot, BERT architecture, pre-training objectives, and fine-tuning,
Prompt Engineering: Designing effective prompts, controlling model behavior, and improving output
quality, Fine-tuning language models for creative writing and chatbot development

UNIT 4
Multi-Agent Systems and Generative AI Applications
Introduction to Multi-Agent Systems (MAS),Types of agents: reactive, deliberative, hybrid, and
learning agents, Multi-agent collaboration and orchestration for generative tasks, Use cases:
autonomous research assistants, cooperative creative generation, distributed problem-solving,
Frameworks and tools: AutoGen, CrewAI, Hugging GPT for LLM-powered multi-agent systems,
Generative AI applications: Art, Creativity, Image/Video generation, Music composition, Healthcare,
Finance, Real-world case studies and deployment challenges

UNIT 5
Frameworks, Multimodal Applications, and Ethics
LangChain framework: components and LLM application development, Retrieval-Augmented
Generation (RAG), Embeddings, Indexing networks, and Vector databases, Generative AI across
modalities: Text, Code, Image, and Video generation, Image and Video generation using GANs and
R25 M.Tech AI & DS JNTU Hyderabad

VAEs, Multimodal Generative AI: integration and training strategies, Ethical considerations: bias,
fairness, trust, and responsible AI deployment, Social and legal implications of Generative AI, Risk
mitigation strategies and real-world ethical case studies

TEXT BOOKS
1. Altaf Rehmani, Generative AI for Everyone: Understanding the Essentials and Applications of
This Breakthrough Technology.
2. Charu C. Aggarwal, Neural Networks and Deep Learning: A Textbook. Joseph Babcock,
Raghav Bali, Generative AI with Python and TensorFlow 2, 2024.

REFERENCE BOOKS
1. Josh Kalin, Generative Adversarial Networks Cookbook.
2. Jesse Sprinter, Generative AI in Software Development: Beyond the Limitations of Traditional
Coding, 2024.

ONLINE REFERENCES
1. Fabian Gloeckle et al., Better & Faster Large Language Models via Multi-token Prediction,
arXiv:2404.19737v1, 2024.Vaswani et al., Attention Is All You Need, NeurIPS 2017.
R25 M.Tech AI & DS JNTU Hyderabad

PROMPT ENGINEERING (PROFESSIONAL ELECTIVE - II)

M.Tech AI & DS I Year I Sem. L T P C

3 0 0 3
Course Objectives:
1. To introduce the principles and techniques of effective prompt engineering for generative AI
models.
2. To understand the architecture, capabilities, and evolution of large language models such as
GPT-3.5, GPT-4, Gemini, and LLaMA.
3. To explore standard practices in structured and unstructured text generation using tools like
ChatGPT.
4. To apply chunking, tokenization, and formatting techniques for improving text generation and
manipulation.
5. To understand the role of embeddings, vector databases (FAISS, Pinecone), and Retrieval-
Augmented Generation (RAG) in modern NLP systems.

Course Outcomes:
1. Explain and apply the core principles of prompt engineering for guiding generative AI outputs
effectively.
2. Describe the underlying architecture and functionality of state-of-the-art large language
models (LLMs).
3. Generate and manipulate structured outputs (JSON, YAML, CSV) using ChatGPT with
advanced prompting techniques.
4. Implement text chunking, tokenization, and format control using tools like SpaCy, Tiktoken,
and Python.
5. Utilize vector databases such as FAISS and Pinecone in Retrieval-Augmented Generation
(RAG) pipelines for efficient information retrieval.

UNIT – I
Fundamentals and Principles of Prompting
Overview of the Five Principles of Prompting: Give Direction, Specify Format, Provide Examples,
Evaluate Quality, Divide Labor.

UNIT – II
Introduction to Large Language Models for Text Generation
What Are Text Generation Models, Vector Representations: The Numerical Essence of Language,
Transformer Architecture: Orchestrating Contextual Relationships, Probabilistic Text Generation: The
Decision Mechanism, Historical Underpinnings: The Rise of Transformer Architectures, OpenAI’s
Generative Pretrained Transformers, GPT-3.5-turbo and ChatGPT, GPT-4, Google’s Gemini, Meta’s
Llama and Open Source.

UNIT – III
Standard Practices for Text Generation with ChatGPT- Part-A
Generating Lists, Hierarchical List Generation, When to Avoid Using Regular Expressions, Generating
JSON, YAML Filtering YAML Payloads, Handling Invalid Payloads in YAML, Diverse Format
Generation with ChatGPT, Mock CSV Data, Universal Translation Through LLMs, Ask for Context,
Text Style Unbundling, Identifying the Desired Textual Features, Generating New Content with the
Extracted Features, Extracting Specific Textual Features with LLMs.

UNIT – IV
Standard Practices for Text Generation with ChatGPT- Part-B
Chunking Text, Benefits of Chunking Text, Scenarios for Chunking Text, Poor Chunking Example,
Chunking Strategies, Sentence Detection Using SpaCy, building a Simple Chunking Algorithm in
Python, Sliding Window Chunking, Text Chunking Packages, Text Chunking with Tiktoken,
Encodings, Understanding the Tokenization of Strings.

UNIT – V
Vector Databases with FAISS and Pinecone
Retrieval Augmented Generation (RAG), Introducing Embeddings, Document Loading
R25 M.Tech AI & DS JNTU Hyderabad

Memory Retrieval with FAISS, RAG with Lang Chain, Hosted Vector Databases with Pinecone, Self-
Querying, Alternative Retrieval Mechanisms.

TEXT BOOK:
1. Phoenix J, Taylor M. Prompt engineering for generative AI. " O'Reilly Media, Inc."; 2024 May
16.

REFERENCES:
1. Tunstall L, Von Werra L, Wolf T. Natural language processing with transformers. " O'Reilly
Media, Inc."; 2022 Jan 26.
2. Foster D. Generative deep learning. " O'Reilly Media, Inc."; 2022 Jun 28.
R25 M.Tech AI & DS JNTU Hyderabad

ARTIFICIAL INTELLIGENCE AND INTELLIGENT SYSTEMS LAB (LAB - I)

M.Tech AI & DS I Year I Sem. L T P C

0 0 4 2
Course Objectives:
1. To provide skills for designing and analyzing AI based algorithms.
2. To enable students to work on various AI tools.
3. To provide skills to work towards solution of real-life problems

Course Outcomes:
1. Elicit, analyze and specify software requirements.
2. Simulate a given problem scenario and analyze its performance.
3. Develop programming solutions for given problem scenario.

List of Programs
1. Installation and working on various AI tools viz. Python, R tool, GATE, NLTK, MATLAB, etc.
2. Data preprocessing and annotation and creation of datasets.
3. Learn existing datasets and Treebanks
4. Implementation of searching techniques in AI.
5. Implementation of Knowledge representation schemes.
6. Natural language processing tool development.
7. Application of Machine learning algorithms.
8. Application of Classification and clustering problem.
9. Working on parallel algorithms.
10. Scientific distributions used in python for Data Science - Numpy, scifi, pandas, scikit learn,
statsmodels, nltk.
R25 M.Tech AI & DS JNTU Hyderabad

DATA ANALYTICS LAB (LAB - II)

M.Tech AI & DS I Year I Sem. L T P C

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

Course Outcomes:
1. Understand linear regression and logistic regression
2. Understand the functionality of different classifiers
3. Implement visualization techniques using different graphs
4. 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, Morgan Kaufmann
Publishers.

REFERENCES:
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
LabsJeffrey D Ullman Stanford Univ.
R25 M.Tech AI & DS JNTU Hyderabad

NATURAL LANGUAGE PROCESSING LAB (LAB - II)

M.Tech AI & DS I Year I Sem. L T P C

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

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

Course Outcomes:
1. Show sensitivity to linguistic phenomena and an ability to model them with formal grammars.
2. Able to manipulate probabilities, construct statistical models over strings and trees, and
estimate parameters using supervised and unsupervised training methods.
3. Able to design, implement, and analyze NLP algorithms

List of Experiments
Implement the following using Python
1. Tokenization
2. Stemming
3. Stop word removal (a, the, are,.)
4. Word Analysis
5. Word Generation
6. Pos tagging
7. Morphology
8. chunking
9. N-Grams
10. N-Grams Smoothing

TEXT BOOKS:
1. Multilingual natural Language Processing Applications: From Theory to Practice – Daniel M.
Bikel and Imed Zitouni, Pearson Publication
2. Natural Language Processing and Information Retrieval: Tanvier Siddiqui, U.S. Tiwary

REFERENCES:
1. Speech and Natural Language Processing - Daniel Jurafsky & James H Martin, Pearson
Publications
R25 M.Tech AI & DS JNTU Hyderabad

DATABASE PROGRAMMING WITH PL/SQL LAB (LAB - II)

M.Tech AI & DS I Year I Sem. L T P C

0 0 4 2
Course Objectives:
1. Knowledge on significance of SQL fundamentals.
2. Evaluate functions and triggers of PL/SQL
3. Knowledge on control structures, packages in PL/SQL and its applications

Course Outcomes:
1. Understand importance of PL/SQL basics
2. Implement functions and procedures using PL/SQL
3. Understand the importance of triggers in database

List of Experiments:
1. Write a Pl/SQL program using FOR loop to insert ten rows into a database table.
2. Given the table EMPLOYEE (EmpNo, Name, Salary, Designation, DeptID), write a cursor to
select the five highest paid employees from the table.
3. Illustrate how you can embed PL/SQL in a high-level host language such as C/Java And
demonstrates how a banking debit transaction might be done.
4. Given an integer i, write a PL/SQL procedure to insert the tuple (i, 'xxx') into a given relation.
5. Write a PL/SQL program to demonstrate Exceptions.
6. Write a PL/SQL program to demonstrate Cursors.
7. Write a PL/SQL program to demonstrate Functions.
8. Write a PL/SQL program to demonstrate Packages.
9. Write PL/SQL queries to create Procedures.
10. Write PL/SQL queries to create Triggers.
R25 M.Tech AI & DS JNTU Hyderabad

RESEARCH METHODOLOGY & IPR

M.Tech AI & DS I Year I Sem. L T P C

2 0 0 2
Course Objectives:
1. To understand the research problem
2. To know the literature studies, plagiarism and ethics
3. To get the knowledge about technical writing
4. To analyze the nature of intellectual property rights and new developments
5. To know the patent rights

Course Outcomes: At the end of this course, students will be able to

1. Understand research problem formulation.
2. Analyze research related information
3. Follow research ethics
4. Understand that today’s world is controlled by Computer, Information Technology, but
tomorrow world will be ruled by ideas, concept, and creativity.
5. Understanding that when IPR would take such important place in growth of individuals &
nation, it is needless to emphasis the need of information about Intellectual Property Right to
be promoted among students in general & engineering in particular.
6. Understand that IPR protection provides an incentive to inventors for further research work
and investment in R & D, which leads to creation of new and better products, and in turn
brings about, economic growth and social benefits.

UNIT-I
Meaning of research problem, Sources of research problem, Criteria Characteristics of a good
research problem, Errors in selecting a research problem, Scope and objectives of research problem.
Approaches of investigation of solutions for research problem, data collection, analysis, interpretation,
Necessary instrumentations

UNIT-II
Effective literature studies approaches, analysis, Plagiarism, Research ethics

UNIT-III
Effective technical writing, how to write report, Paper Developing a Research Proposal, Format of
research proposal, a presentation and assessment by a review committee

UNIT-IV
Nature of Intellectual Property: Patents, Designs, Trade and Copyright. Process of Patenting and
Development: technological research, innovation, patenting, development. International Scenario:
International cooperation on Intellectual Property. Procedure for grants of patents, Patenting under
PCT.

UNIT-V
Patent Rights: Scope of Patent Rights. Licensing and transfer of technology. Patent information
and databases. Geographical Indications. New Developments in IPR: Administration of Patent
System. New developments in IPR; IPR of Biological Systems, Computer Software etc. Traditional
knowledge Case Studies, IPR and IITs.

TEXT BOOKS:
1. Stuart Melville and Wayne Goddard, “Research methodology: an introduction for science &
engineering students”
2. C.R. Kothari, Research Methodology, methods & techniques, 2nd edition, New age
International publishers

REFERENCES:
1. Ranjit Kumar, 2nd Edition, “Research Methodology: A Step by Step Guide for beginners”
2. Halbert, “Resisting Intellectual Property”, Taylor & Francis Ltd ,2007.
3. Mayall, “Industrial Design”, McGraw Hill, 1992.
4. Niebel, “Product Design”, McGraw Hill, 1974.
R25 M.Tech AI & DS JNTU Hyderabad

5. Asimov, “Introduction to Design”, Prentice Hall, 1962.

6. Robert P. Merges, Peter S. Menell, Mark A. Lemley, “Intellectual Property in New
Technological Age”, 2016.
7. T. Ramappa, “Intellectual Property Rights Under WTO”, S. Chand, 2008
R25 M.Tech AI & DS JNTU Hyderabad

NEURAL NETWORKS & DEEP LEARNING (PC - III)

M.Tech AI & DS I Year II Sem. L T P C

3 0 0 3
Course Objectives:
1. To introduce the foundations of Artificial Neural Networks
2. To acquire the knowledge on Deep Learning Concepts
3. To learn various types of ANN architectures
4. To gain knowledge to apply optimization strategies

Course Outcomes:
1. Understand the concepts of Neural Networks
2. Apply optimization strategies for large scale applications
3. Use an efficient algorithm for Deep Models
4. Select the right ANN architecture for the real world problems

UNIT-I
Artificial Neural Networks Introduction, Basic models of ANN, important terminologies, Supervised
Learning Networks, Perceptron Networks, Adaptive Linear Neuron, Back-propagation Network.
Associative Memory Networks. Training Algorithms for pattern association, BAM and Hopfield
Networks.

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

UNIT-III
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 BOOKS:
1. B. Yegnanarayana, Artificial Neural Networks,PHI
2. Deep Learning: An MIT Press Book By Ian Goodfellow and Yoshua Bengio and Aaron
Courville
R25 M.Tech AI & DS JNTU Hyderabad

PREDICTIVE ANALYTICS (PC - IV)

M.Tech AI & DS I Year II Sem. L T P C

3 0 0 3
Course Objectives
The course serves to advance and refine expertise on theories, approaches and techniques related to
prediction and forecasting

Course Outcomes
1. Understand prediction-related principles, theories and approaches.
2. Learn model assessment and validation.
3. Understand the basics of predictive techniques and statistical approaches.
4. Analyze supervised and unsupervised algorithms

Unit I
Linear Methods for Regression and Classification: Overview of supervised learning, Linear regression
models and least squares, Multiple regression, Multiple outputs, Subset selection, Ridge regression,
Lasso regression, Linear Discriminant Analysis, Logistic regression, Perceptron learning algorithm.

Unit II
Model Assessment and Selection: Bias, Variance, and model complexity, Bias-variance trade off,
Optimism of the training error rate, Estimate of In-sample prediction error, Effective number of
parameters, Bayesian approach and BIC, Cross- validation, Bootstrap methods, conditional or
expected test error.

Unit III
Additive Models, Trees, and Boosting: Generalized additive models, Regression and classification
trees, Boosting methods-exponential loss and AdaBoost, Numerical Optimization via gradient
boosting, Examples (Spam data, California housing, New Zealand fish, Demographic data)

Unit IV
Neural Networks (NN) , Support Vector Machines(SVM),and K-nearest Neighbor: Fitting neural
networks, Back propagation, Issues in training NN, SVM for classification, Reproducing Kernels, SVM
for regression, K-nearest – Neighbour classifiers( Image Scene Classification)

Unit V
Unsupervised Learning and Random forests: Association rules, Cluster analysis, Principal
Components, Random forests and analysis.

TEXT BOOK:
1. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning-
Data Mining, Inference, and Prediction, Second Edition, Springer Verlag, 2009

REFERENCES:
1. C.M. Bishop –Pattern Recognition and Machine Learning, Springer,2006
2. L. Wasserman-All of statistics
3. Gareth James. Daniela Witten. Trevor Hastie Robert Tibshirani. An Introduction to Statistical
Learning with Applications in R
R25 M.Tech AI & DS JNTU Hyderabad

BIG DATA TECHNOLOGIES (PROFESSIONAL ELECTIVE - III)

M.Tech AI & DS I Year II Sem. L T P C

3 0 0 3
Course Objectives
1. The purpose of this course is to provide the students with knowledge of Big data Analytics
principles and techniques.
2. This course is also designed to give an exposure of the frontiers of Big data Analytics

Courses Outcomes
1. Ability to explain the foundations, definitions, and challenges of Big Data and various
Analytical tools.
2. Ability to program using HADOOP and Map reduce, NOSQL
3. Ability to understand the importance of Big Data in Social Media and Mining.

Unit I
Getting an Overview of Big Data
Big Data, History of Data Management – Evolution of Big Data, Structuring Big Data, Elements of Big
Data, Big Data Analytics, Careers in Big Data, Future of Big Data
Technologies for Handling Big Data
Distributed and Parallel Computing for Big Data, Introducing Hadoop, Cloud Computing and Big Data,
In‐Memory Computing Technology for Big Data.

Unit II
Understanding Hadoop Ecosystem
Hadoop Ecosystem, Hadoop Distributed File System, MapReduce, Hadoop YARN, Hbase, Hive, Pig
and Pig Latin, Sqoop, ZooKeeper, Flume, Oozie
Understanding MapReduce Fundamentals and HBase
The MapReduce Framework, Techniques to Optimize MapReduce Jobs, Uses of MapReduce, Role
of HBase in Big Data Processing

Unit III
Exploring Hive
Introducing Hive, Getting Started with Hive, Data Types in Hive, Built‐In Functions in Hive, Hive DDL,
Data Manipulation in Hive, Data Retrieval Queries, Using JOINS in Hive
Analyzing Data with Pig
Introducing Pig, Running Pig, Getting Started with Pig Latin, Working with Operators in Pig, Working
with Functions in Pig

Unit IV
Using Oozie
Introducing Oozie, Installing and Configuring Oozie, Understanding the Oozie Workflow, Oozie
Coordinator, Oozie Bundle, Oozie Parameterization with EL, Oozie Job Execution Model, Accessing
Oozie, Oozie SLA
NoSQL Data Management
Introduction to NoSQL, Aggregate Data Models, Key Value Data Model, Document Databases,
Relationships, Graph Databases, Schema‐Less Databases, Materialized Views, Distribution Models,
Sharding, MapReduce Partitioning and Combining, Composing MapReduce Calculations

Unit V
Zookeeper: Installing and Running ZooKeeper, An Example, Group Membership in ZooKeeper,
Creating the Group, Joining a Group, Listing Members in a Group, The ZooKeeper Service, Data
Model, Operations, Implementation, Consistency, Sessions, Building Applications with ZooKeeper, A
Configuration, Service, The Resilient ZooKeeper Application, A Lock Service, More Distributed Data
Structures and Protocols, ZooKeeper in Production
Sqoop: Getting Sqoop, Sqoop Connectors, A Sample Import, Generated Code, Imports: A Deeper
Look, Working with Imported Data, Importing Large Objects, Performing an Export, Exports: A Deeper
Look

TEXT BOOKS:
R25 M.Tech AI & DS JNTU Hyderabad

1. Big data, blackbook, Dream Tech Press, 2015

2. Hadoop: The Definitive Guide, Tom White, 3rd Edition, O'Reilly Media, 2012.

REFERENCES:
1. Big Data Analytics, Seema Acharya, Subhashini Chellappan, Wiley 2015.
2. Simon Walkowiak, Big Data Analytics with R, Packt Publishing, ISBN: 9781786466457
3. Big Data, Big Analytics: Emerging Business Intelligence and Analytic Trends for Today’s
Business, Michael Minelli, Michehe Chambers, 1st Edition, Ambiga Dhiraj, Wiley CIO
Series, 2013.
4. Big Data Analytics: Disruptive Technologies for Changing the Game, Arvind Sathi,
1st Edition, IBM Corporation, 2012.
R25 M.Tech AI & DS JNTU Hyderabad

DATA STREAM PROCESSING (PROFESSIONAL ELECTIVE-III)

M.Tech AI & DS I Year II Sem. L T P C

3 0 0 3

Course Objectives
1. Introduce the student to use cases of stream processing, the data stream model
2. Present algorithmic techniques for stream processing, including map-and-reduce.
3. Present current techniques on monitoring parallel and distributed streams.
4. Implement streams in the continuous distributed monitoring model, and the parallel
streaming model.
5. Provide practical perspective on building software for stream processing

Course Outcomes
1. Explain the need for stream processing
2. Comprehend the architectures of stream processing.
3. Explain and run Distributed Processing and Resilience Model
4. Design effective streaming solutions using Structured Streaming
5. Design effective streaming solutions using Spark Streaming

UNIT-I
Introduction To Stream Processing Model
Fundamentals of Stream Processing: What Is Stream Processing? Examples of Stream Processing-
Scaling Up Data Processing- Distributed Stream Processing- Introducing Apache Spark. Stream-
Processing Model: Sources and Sinks- Immutable Streams Defined from One Another
Transformations and Aggregations- Window Aggregations - Stateless and Stateful Processing- The
Effect of Time.

UNIT-II
Streaming Architectures
Components of a Data Platform- Architectural Models- The Use of a Batch-Processing Component in
a Streaming Application- Referential Streaming Architectures- Streaming Versus Batch Algorithms.
Apache Spark as a Stream-Processing Engine: Spark’s Memory Usage- Understanding Latency-
Throughput Oriented Processing- Fast Implementation of Data Analysis

UNIT-III
Distributed Processing And Resilience Model
Spark’s Distributed Processing Model: Running Apache Spark with a Cluster Manager- Spark’s Own
Cluster Manager - Resilience and Fault Tolerance in a Distributed System- Data Delivery Semantics-
Micro Batching and One-Element-at-a-Time - Bringing Micro batch and One-Record-at a- Time Closer
Together- Dynamic Batch Interval- Structured Streaming Processing Model. Spark’s Resilience
Model: Resilient Distributed Datasets in Spark - Spark Components - Spark’s Fault-Tolerance
Guarantees.

UNIT-IV
Structured Streaming
Introducing Structured Streaming- The Structured Streaming Programming Model – Structured
Streaming in Action – Structured Streaming Sources – Structured Streaming Sinks - Event Time–
Based Stream Processing.

UNIT-V
Spark Streaming
Introducing Spark Streaming - The Spark Streaming Programming Model - The Spark Streaming
Execution Model - Spark Streaming Sources - Spark Streaming Sinks - Time-Based Stream
Processing- Working with Spark SQL – Checkpointing - Monitoring Spark Streaming- Performance
Tuning.

TEXT BOOKS:
1. Gerard Maas and François Garillot , “Stream Processing with Apache Spark: Mastering
Structured Streaming and Spark Streaming”, O’Reilly, 2019.
R25 M.Tech AI & DS JNTU Hyderabad

REFERENCE BOOKS:
1. Henrique C. M. Andrade, Buǧra Gedik and Deepak S. Turaga, “Fundamentals of Stream
Processing: Application Design, Systems, and Analytics”, Cambridge University Press, 2014.
2. Bryon Ellis, “Real-Time Analytics: Techniques to Analyze and Visualize Streaming Data”,
Wiley, 1st edition, 2014.
3. Anindita Basak, Krishna Venkataraman, Ryan Murphy, Manpreet Singh, “Stream Analytics
with Microsoft Azure”, Packt Publishing, December 2017.

WEB REFERENCES:
1. https://github.com/stream-processing-with-spark

E -TEXT BOOKS:
1. https://www.edx.org/course/processing-real-time-data-streams-in-azure
2. https://www.coursera.org/learn/big-data-integration-processing
R25 M.Tech AI & DS JNTU Hyderabad

ENTERPRISE CLOUD CONCEPTS (PROFESSIONAL ELECTIVE - III)

M.Tech AI & DS I Year II Sem. L T P C

3 0 0 3
Course Objectives: Knowledge on significance of cloud computing and its fundamental concepts
and models.

Course Outcomes:
1. Understand importance of cloud architecture
2. Illustrating the fundamental concepts of cloud security
3. Analyze various cloud computing mechanisms
4. Understanding the architecture and working of cloud computing.

Unit - I
Understanding Cloud Computing:
Origins and influences, Basic Concepts and Terminology, Goals and Benefits, Risks and Challenges.
Fundamental Concepts and Models:
Roles and Boundaries, Cloud Characteristics, Cloud Delivery Models, Cloud Deployment Models.

Unit - II
Cloud-Enabling Technology:
Broadband Networks and Internet Architecture, Data Center Technology, Virtualization Technology
CLOUD COMPUTING MECHANISMS:
Cloud Infrastructure Mechanisms: Logical Network Perimeter, Virtual Server, Cloud Storage
Device, Cloud Usage Monitor, Resource Replication

Unit - III
Cloud Management Mechanisms: Remote Administration System, Resource Management System,
SLA Management System, Billing Management System, Case Study Example
Cloud Computing Architecture
Fundamental Cloud Architectures: Workload Distribution Architecture, Resource Pooling
Architecture, Dynamic Scalability Architecture, Elastic Resource Capacity Architecture, Service Load
Balancing Architecture, Cloud Bursting Architecture, Elastic Disk Provisioning Architecture,
Redundant Storage Architecture, Case Study Example

Unit - IV
Cloud-Enabled Smart Enterprises
Introduction, Revisiting the Enterprise Journey, Service-Oriented Enterprises, Cloud Enterprises,
Smart Enterprises, The Enabling Mechanisms of Smart Enterprises
Cloud-Inspired Enterprise Transformations
Introduction, The Cloud Scheme for Enterprise Success, Elucidating the Evolving Cloud Idea,
Implications of the Cloud on Enterprise Strategy, Establishing a Cloud-Incorporated Business
Strategy

UNIT-V Transitioning to Cloud-Centric Enterprises

The Tuning Methodology, Contract Management in the Cloud

Cloud-Instigated IT Transformations
Introduction, Explaining Cloud Infrastructures, A Briefing on Next-Generation Services, Service
Infrastructures, Cloud Infrastructures, Cloud Infrastructure Solutions, Clouds for Business Continuity,
The Relevance of Private Clouds, The Emergence of Enterprise Clouds

TEXT BOOKS:
1. Erl Thomas, Puttini Ricardo, Mahmood Zaigham, Cloud Computing: Concepts, Technology &
Architecture 1st Edition,
2. Pethuru Raj, Cloud Enterprise Architecture, CRC Press

REFERENCE:
1. James Bond, The Enterprise Cloud, O'Reilly Media, Inc.
R25 M.Tech AI & DS JNTU Hyderabad

REINFORCEMENT LEARNING (PROFESSIONAL ELECTIVE - IV)

M.Tech AI & DS I Year II Sem. L T P C

3 0 0 3
Course Objectives
Knowledge on fundamentals of reinforcement learning and the methods used to create agents that
can solve a variety of complex tasks.

Course Outcomes
1. Understand basics of RL
2. Understand RL Framework and Markov Decision Process
3. Analyzing ning through the use of Dynamic Programming and Monte Carlo
4. Understand TD(0) algorithm, TD(λ) algorithm

Unit I
Basics of probability and linear algebra, Definition of a stochastic multi-armed bandit, Definition of
regret, Achieving sublinear regret, UCB algorithm, KL-UCB, Thompson Sampling.

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

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

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

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

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

REFERENCES:
1. “Bandit algorithms,” First Edition, Lattimore, T. and C. Szepesvári. Cambridge University
Press. 2020
2. “Reinforcement Learning Algorithms: Analysis and Applications,” Boris Belousov, Hany
Abdulsamad, Pascal Klink, Simone Parisi, and Jan Peters First Edition, Springer 2021
3. Alexander Zai and Brandon Brown “Deep Reinforcement Learning in Action,” First Edition,
Manning Publications 2020
R25 M.Tech AI & DS JNTU Hyderabad

MACHINE TRANSLATION (PROFESSIONAL ELECTIVE - IV)

M.Tech AI & DS I Year II Sem. L T P C

3 0 0 3
Course Objectives:
1. To teach students machine translation approaches.
2. To evaluate the performance of machine translation Systems.
3. To develop translation models for Indian Languages.

Course Outcomes: Upon the Successful Completion of the Course, the Students would be able to:
1. Understand machine translation approaches.
2. Apply and assess manual and automatic evaluation methods for machine translation.
3. Build machine translation model using existing tools for machine translation.

Unit I
Introduction to Machine Translation, MT Approaches: vauquois Triangle, Three major paradigms of
Machine Translation, MT Evaluation

Unit II Learning Bilingual word Mappings

A Combinatorial Argument, Deeper look at one- one alignment, Heuristic based Computation of the
VE *VF Table, Iterative Computation of the VE *VF Table, EM: Study of progress in Parameter values

Unit III Phrase based Machine Translation

Need for phrase alignment, An example to illustrate phrase alignment technique, Phrase table,
Mathematics of Phrase based SMT, Decoding, Moses.

Unit IV Rule based Machine Translation (RBMT)

Two kinds of RBMT: Interlingua and Transfer, Universal networking Language (UNL), UNL
expressions as binary predicates, Interlingua and Word Knowledge, Translation using Interlingua,
Details of english to UNL Conversion: with illustration, Transfer based MT.

Unit V Example based Machine Translation

Essential steps of EBMT, EBMTs working, EBMT and case based reasoning, Text similarity
computation, EBMT and Translation Memory, EBMT and SMT.

TEXT BOOKS:
1. Pushpak Bhattacharyya, Machine Translation, CRC Press

REFERENCES:
1. Statistical Machine Translation by Philipp Koehn, Cambridge University Press.
2. Deep Learning by Ian Goodfellow, Yoshua Bengio and Aaron Courville, MIT Press.
3. Linguistic Fundamentals for Natural Language Processing by Emily Bender, Morgan &
Claypool.
R25 M.Tech AI & DS JNTU Hyderabad

NATURE INSPIRED COMPUTING (PROFESSIONAL ELECTIVE - IV)

M.Tech AI & DS I Year II Sem. L T P C

3 0 0 3

Course Objectives:
Knowledge on significance of intelligence, genetic algorithms Ant Colony algorithms

Course Outcomes:
1. Familiar with Genetic algorithm and its applications.
2. Compare different Ant Colony Optimization algorithmic models.
3. Compare different Artificial Bee Colony Optimization algorithmic models.
4. Illustrate Particle swam optimization algorithm with an example.

Unit I: Models of Life and Intelligence - Fundamentals of bio-inspired models and bio-inspired
computing. Evolutionary models and techniques, Swarm models and its self-organization, swarm and
evolutionary algorithms. Optimization problems – single and multi-objective optimization, heuristic,
meta-heuristic and hyper heuristic functions.

Unit II: Genetic algorithms - Mathematical foundation, Genetic problem solving, crossover and
mutation. genetic algorithms and Markov process, applications of genetic algorithms

Unit III: Ant Colony Algorithms - Ant colony basics, hybrid ant system, ACO in combinatorial
optimization, variations of ACO, case studies.

Unit IV: Particle Swarm algorithms - particles moves, particle swarm optimization, variable length
PSO, applications of PSO, case studies. Artificial Bee Colony algorithms - ABC basics, ABC in
optimization, multi-dimensional bee colony algorithms, applications of bee algorithms, case studies.

Unit V: Selected nature inspired techniques - Hill climbing, simulated annealing, Gaussian adaptation,
Cuckoo search, Firey algorithm, SDA algorithm, bat algorithm, case studies. Other nature inspired
techniques - Social spider algorithm, Cultural algorithms, Harmony search algorithm, Intelligent water
drops algorithm, Artificial immune system, Flower pollination algorithm, case studies.

TEXT BOOKS:
1. Albert Y. Zomaya - "Handbook of Nature-Inspired and Innovative Computing", Springer, 2006
2. Floreano, D. and C. Mattiussi -"Bio-Inspired Artificial Intelligence: Theories methods, and
Technologies" IT Press, 2008.

REFERENCES:
1. Leandro Nunes de Castro - " Fundamentals of Natural Computing, Basic Concepts,
Algorithms and Applications", Chapman & Hall/ CRC, Taylor and Francis Group, 2007
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
R25 M.Tech AI & DS JNTU Hyderabad

NEURAL NETWORKS & DEEP LEARNING (LAB - III)

M.Tech AI & DS I Year II Sem. L T P C

0 0 4 2
Course Objectives:
1. Introduce the foundations and principles of Artificial Neural Networks (ANNs) and their role in
machine learning.
2. Develop understanding of Deep Learning paradigms and modern neural network
architectures.
3. To learn various ANN architectures, including feed-forward, convolutional, recurrent, and
associative networks.
4. Impart knowledge of optimization and regularization strategies for effective training of deep
neural networks.
5. To apply ANN and deep learning techniques to real-world problems in computer vision,
speech, and natural language processing.

Course Outcomes:
1. Understand the fundamental concepts of neural networks and deep learning models.
2. Design and implement various ANN architectures such as Perceptrons, Multi-Layer Networks,
CNNs, and RNNs for different tasks.
3. Apply optimization and regularization techniques (e.g., SGD, adaptive learning rates, L1/L2
penalties, dropout, early stopping) to train deep models effectively.
4. Evaluate and analyze neural network models using relevant performance metrics to ensure
accuracy and reliability.
5. Select and deploy appropriate architectures for solving complex real-world problems in
computer vision, NLP, speech recognition, and large-scale data processing.

LIST OF PROGRAMS
1. Write a program to create and train a single-layer perceptron to separate linearly separable
data.
2. Build a multi-layer neural network from scratch to solve the XOR problem using
backpropagation.
3. Implement a 2-layer MLP (input-hidden-output) for MNIST digit classification.
4. Train a Multi-Layer Perceptron (MLP) on the CIFAR-10 dataset using the following
configurations:
a. L1/L2 regularization
b. Dropout
c. Early stopping
5. Build and train a simple CNN (e.g., on fashion-MNIST or CIFAR-10 dataset).
6. Implement an RNN to predict the next character in a string sequence.
7. Compare performances of RNN and LSTM on sequential data such as stock prices or word
sequences.
8. Build a bidirectional RNN for sentiment analysis.
9. Train an encoder-decoder RNN for sequence translation
10. Build a deep CNN model to recognize multi-digit numbers from images similar to SVHN
dataset.
11. Write a program to implement RNN/LSTM for simple speech-to-text conversion.
12. Build a deep learning model to classify sentiment from movie reviews or tweets.

REFERENCE BOOKS:
1. Géron A. Hands-on machine learning with Scikit-Learn, Keras, and TensorFlow. " O'Reilly
Media, Inc."; 2022 Oct 4.
2. Zhang, A., Lipton, Z. C., Li, M., & Smola, A. J. (2023). Dive into deep learning. Cambridge
University Press.
3. Chollet, Francois. Deep learning with Python. simon and schuster, 2021.

ADDITIONAL RESOURCES
1. https://nptel.ac.in/courses/106106184
2. https://github.com/Gaurav0502/deep-learning-lab
3. https://github.com/roatienza/Deep-Learning-Experiments
R25 M.Tech AI & DS JNTU Hyderabad

BIG DATA TECHNOLOGIES LAB (LAB - IV)

M.Tech AI & DS I Year II Sem. L T P C

0 0 4 2
Course Objectives
 The purpose of this course is to provide the students with the knowledge of Big data
Analytics principles and techniques.
 This course is also designed to give an exposure of the frontiers of Big data Analytics

Course Outcomes
1. Use Excel as an Analytical tool and visualization tool.
2. program using HADOOP and Map reduce
3. perform data analytics using ML in R.
4. Use cassandra to perform social media analytics

List of Experiments
1. Implement a simple map-reduce job that builds an inverted index on the set of
input documents (Hadoop)
2. Process big data in HBase
3. Store and retrieve data in Pig
4. Perform Social media analysis using cassandra
5. Buyer event analytics using Cassandra on suitable product sales data.
6. Using Power Pivot (Excel) Perform the following on any dataset
a. Big Data Analytics
b. Big Data Charting
7. Use R-Project to carry out statistical analysis of big data
8. Use R-Project for data visualization of social media data

Textbooks:
1. Big Data Analytics, SeemaAcharya, Subhashini Chellappan, Wiley 2015.
2. Big Data, Big Analytics: Emerging Business Intelligence and Analytic Trends for Today’s
Business, Michael Minelli, Michehe Chambers, 1st Edition, AmbigaDhiraj, Wiely CIO
Series, 2013.
3. Hadoop: The Definitive Guide, Tom White, 3rd Edition, O‟Reilly Media, 2012.
4. Big Data Analytics: Disruptive Technologies for Changing the Game, Arvind Sathi, 1st
Edition, IBM Corporation, 2012.

References:
1. Big Data and Business Analytics, Jay Liebowitz, Auerbach Publications, CRC press (2013)
2. Using R to Unlock the Value of Big Data: Big Data Analytics with Oracle R Enterprise and
Oracle R Connector for Hadoop, Tom Plunkett, Mark Hornick, McGraw-Hill/Osborne
Media (2013), Oracle press.
3. Professional Hadoop Solutions, Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, Wiley,
ISBN: 9788126551071, 2015.
4. Understanding Big data, Chris Eaton, Dirk deroos et al. , McGraw Hill, 2012.
5. Intelligent Data Analysis, Michael Berthold, David J. Hand, Springer, 2007.
6. Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced
Analytics, Bill Franks, 1st Edition, Wiley and SAS Business Series, 2012.
R25 M.Tech AI & DS JNTU Hyderabad

DATA STREAM PROCESSING LAB (LAB - IV)

M.Tech AI & DS I Year II Sem. L T P C

0 0 4 2
Course Objectives
1. To teach the students basics of SPA programs and its execution
2. To teach the students the differences between Structured streaming and spark streaming.
3. To make the students learn concepts like data sources and data sinks.
4. To make the students understand pipeline Processing of a stream
5. To make the students understand the usage of Streaming application.
6. To teach the student, to develop real time application using spark.

Course Outcomes
1. Able to Install and Configure Apache Spark, Scala IDE, and JDK
2. Able to write Spark Streaming program to count words and print tweets
3. Able to use RDD and read .txt/.csv files into RDD
4. Develop a Stream Processing Application
5. Implement Stream Processing using Structured Streaming

List Of Experiments:
1.
a. Installing and configuring Apache Spark
b. Installing and configuring the Scala IDE
c. Installing and configuring JDK
2. Write your own Spark Streaming program, to count the number of words in text data received
from a data server listening on a TCP socket
3. Write a simple Spark Streaming program that prints a sample of the tweets it receives from
Twitter every second.
4. Create Spark RDD using parallelize with sparkContext.parallelize() method and using Spark
shell
5. Write a script in Spark to Read all text files from a directory into a single RDD
6. Write a spark program to load a CSV file into Spark RDD using a Scala
7. Write a Spark Streaming program for adding 1 to the stream of integers in a reliable, fault
tolerant manner, and then visualize them.
8. Develop a streaming application by- Connecting to a Stream, Preparing the Data in the
Stream, Performing Operations on Streaming Dataset, creating a Query, Starting the Stream
Processing and Exploring the data.
9. Create a Structured streaming job by Initializing Spark, acquiring streaming data from
sources, declaring the operations we want to apply to the streaming data and outputting the
resulting data using Sinks.
10. a. Create a small but complete Internet of Things (IoT)-inspired streaming program.
b. Define the schema in Structured Streaming to handle the data at different levels.

11. Create custom sinks to write data to systems not supported by the default implementations.
12. Develop any Spark Streaming application and do the following:
a. Create a Spark Streaming Context,
b. Define one or several DStreams from data sources or other DStreams
c. Define one or more output operations to materialize the results of these DStream
operations
d. Start the Spark Streaming Context to get the stream processing going

Text Books:
1. Stream Processing with Apache Spark: Mastering Structured Streaming and Spark
Streaming- Gerard Maas , Francois Garillot .
R25 M.Tech AI & DS JNTU Hyderabad

ENTERPRISE CLOUD CONCEPTS LAB (LAB - IV)

M.Tech AI & DS I Year II Sem. L T P C

0 0 4 2
Course Objectives:
Knowledge on significance of cloud computing and its fundamental concepts and models.

Course Outcomes:
1. Understand importance of cloud architecture
2. Illustrating the fundamental concepts of cloud security
3. Analyze various cloud computing mechanisms
4. Understanding the architecture and working of cloud computing.

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. Install Google App Engine. Create a hello world app and other simple web applications using
python/java..
4. Find a procedure to transfer the files from one virtual machine to another virtual machine.
5. Find a procedure to launch virtual machine using trystack (Online Openstack Demo Version)
6. Install Hadoop single node cluster and run simple applications like word count.

E-Resources:
1. https://www.iitk.ac.in/nt/faq/vbox.htm

2.https://www.google.com/urlsa=t&rct=j&q=&esrc=s&source=web&cd=&ved=2ahUKEwjqrNG0za73Ah
XZt1YBHZ21DWEQFnoECAMQAQ&url=https%3A%2F%2Fsiteproxy.ruqli.workers.dev%3A443%2Fhttp%2Fwww.cs.columbia.edu%2F~sedwards%2F
classes%2F2015%2F1102-fall%2Flinuxvm.pdf&usg=AOvVaw3xZPuF5xVgk-AQnBRsTtHz

3. https://www.cloudsimtutorials.online/cloudsim/

4.https://edwardsamuel.wordpress.com/2014/10/25/tutorial-creating-openstack-instance-in-trystack/

5. https://www.edureka.co/blog/install-hadoop-single-node-hadoop-cluster
R25 M.Tech AI & DS JNTU Hyderabad

COMPUTER VISION AND ROBOTICS (PROFESSIONAL ELECTIVE - V)

M.Tech AI & DS II Year I Sem. L T P C

3 0 0 3
Pre-Requisites: UG level Course in Linear Algebra and Probability.

Course Objectives:
1. To understand the Fundamental Concepts Related To sources, shadows and shading
2. To understand the The Geometry of Multiple Views

Course Outcomes:
1. Implement fundamental image processing techniques required for computer vision
2. Implement boundary tracking techniques
3. Apply chain codes and other region descriptors, Hough Transform for line, circle, and ellipse
detections.
4. Apply 3D vision techniques and Implement motion related techniques.
5. Develop applications using computer vision techniques.

UNIT -I
CAMERAS: Pinhole Cameras
Radiometry – Measuring Light: Light in Space, Light Surfaces, Important Special Cases
Sources, Shadows, And Shading: Qualitative Radiometry, Sources and Their Effects, Local
Shading Models, Application: Photometric Stereo, Interreflections: Global Shading Models
Color: The Physics of Color, Human Color Perception, Representing Color, A Model for Image Color,
Surface Color from Image Color.

UNIT-II
Linear Filters: Linear Filters and Convolution, Shift Invariant Linear Systems, Spatial Frequency and
Fourier Transforms, Sampling and Aliasing, Filters as Templates,
Edge Detection: Noise, Estimating Derivatives, Detecting Edges
Texture: Representing Texture, Analysis (and Synthesis) Using Oriented Pyramids, Application:
Synthesis by Sampling Local Models, Shape from Texture.

UNIT-III
The Geometry of Multiple Views: Two Views
Stereopsis: Reconstruction, Human Stereopsis, Binocular Fusion, Using More Cameras
Segmentation by Clustering: What Is Segmentation?, Human Vision: Grouping and Getstalt,
Applications: Shot Boundary Detection and Background Subtraction, Image Segmentation by
Clustering Pixels, Segmentation by Graph-Theoretic Clustering,

UNIT-IV
Segmentation by Fitting a Model: The Hough Transform, Fitting Lines, Fitting Curves, Fitting as a
Probabilistic Inference Problem, Robustness
Segmentation and Fitting Using Probabilistic Methods: Missing Data Problems, Fitting, and
Segmentation, The EM Algorithm in Practice,
Tracking With Linear Dynamic Models: Tracking as an Abstract Inference Problem, Linear Dynamic
Models, Kalman Filtering, Data Association, Applications and Examples

UNIT- V
Geometric Camera Models: Elements of Analytical Euclidean Geometry, Camera Parameters and
the Perspective Projection, Affine Cameras and Affine Projection Equations
Geometric Camera Calibration: Least-Squares Parameter Estimation, A Linear Approach to
Camera Calibration, Taking Radial Distortion into Account, Analytical Photogrammetry,
Case study: Mobile Robot Localization
Model- Based Vision: Initial Assumptions, Obtaining Hypotheses by Pose Consistency, Obtaining
Hypotheses by pose Clustering, Obtaining Hypotheses Using Invariants, Verification, Case study:
Registration In Medical Imaging Systems, Curved Surfaces and Alignment.

TEXT BOOKS:
1. David A. Forsyth and Jean Ponce: Computer Vision – A Modern Approach, PHI Learning
R25 M.Tech AI & DS JNTU Hyderabad

(Indian Edition), 2009.

REFERENCES:
1. E. R. Davies: Computer and Machine Vision – Theory, Algorithms and Practicalities, Elsevier
(Academic Press), 4th edition, 2013.
2. R. C. Gonzalez and R. E. Woods “Digital Image Processing” Addison Wesley 2008.
3. Richard Szeliski “Computer Vision: Algorithms and Applications” Springer-Verlag London
Limited 2011.
R25 M.Tech AI & DS JNTU Hyderabad

SOCIAL MEDIA MINING (PROFESSIONAL ELECTIVE - V)

M.Tech AI & DS II Year I Sem. L T P C

3 0 0 3
Course Objectives:
The objective of the course is to study the techniques to model, analyze, and understand large-scale
social media along with dynamic processes over social and information networks, and understand the
link between qualitative and quantitative methods of social media mining.

Course Outcomes:
1. Understand the social media mining and its challenges
2. Analyze how to detect communities and influencers
3. Understand Community analysis
4. Measuring Assortative, Influence, Homophily, Recommendation in Social Media

UNIT-I
Introduction: What is Social Media Mining, New Challenges for social media Mining
Graph Essentials: Graph Basics, Graph Representation, Types of Graphs, Connectivity in Graphs,
Special Graphs, Graph Algorithms

UNIT-II
Network Measures: Centrality, Transitivity and Reciprocity, Balance and Status, Similarity.
Network Models: Properties of Real-World Networks, Random Graphs, Small-World Model,
Preferential Attachment Model

UNIT-III
Data Mining Essentials: Data, Data Preprocessing, Data Mining Algorithms, Supervised Learning,
Unsupervised Learning
Community Analysis: Community Detection, Community Evaluation, Community Evaluation

UNIT-IV
Information Diffusion in Social Media: Herd Behavior, Information Cascades, Diffusion of
innovations, Epidemics
Influence and Homophily: Measuring Assortativity, Influence, Homophily, Distinguishing Influence
and Homophily

UNIT-V
Recommendation in Social Media: Challenges, Classical Recommendation Algorithms,
Recommendation Using Social Context, Evaluating Recommendations
Behavior Analytics: Individual Behavior, Collective Behavior.

TEXT BOOKS:
1. Social Media Mining (An Introduction), Reza Zafarani, Mohammad Ali Abbasi, Huan Liu,
Cambridge University Press, Draft Version: April 20, 2014

REFERENCES:
1. Mining the Social Web, 2nd Edition Data Mining Face book, Twitter, LinkedIn, Google+,
GitHub, and More, Matthew A. Russell Publisher: O' Reilly Media.
2. Social Media Mining with R [Kindle Edition] NATHAN DANNEMAN RICHARD HEIMANN
R25 M.Tech AI & DS JNTU Hyderabad

QUANTUM COMPUTING (PROFESSIONAL ELECTIVE - V)

M.Tech AI & DS II Year I Sem. L T P C

3 0 0 3
Course Objectives
1. To introduce the fundamentals of quantum computing
2. The problem-solving approach using finite dimensional mathematics

Course Outcomes
1. Understand basics of quantum computing
2. Understand physical implementation of Qubit
3. Understand Quantum algorithms and their implementation
4. Understand the Impact of Quantum Computing on Cryptography

Unit I
Introduction to Essential Linear Algebra
Some Basic Algebra, Matrix Math, Vectors and Vector Spaces, Set Theory
Complex Numbers
Definition of Complex Numbers, Algebra of Complex Numbers, Complex Numbers Graphically, Vector
Representations of Complex Numbers, Pauli Matrice, Transcendental Numbers

Unit II
Basic Physics for Quantum Computing
The Journey to Quantum, Quantum Physics Essentials, Basic Atomic Structure, Hilbert Spaces,
Uncertainty, Quantum States, Entanglement
Basic Quantum Theory
Further with Quantum Mechanics, Quantum Decoherence, Quantum Electrodynamics, Quantum
Chromodynamics, Feynman Diagram Quantum Entanglement and QKD, Quantum Entanglement,
Interpretation, QKE

Unit III
Quantum Architecture
Further with Qubits, Quantum Gates, More with Gates, Quantum Circuits, The D-Wave Quantum
Architecture
Quantum Hardware
Qubits, How Many Qubits Are Needed? Addressing Decoherence, Topological Quantum Computing,
Quantum Essentials

Unit IV
Quantum Algorithms
What Is an Algorithm? Deutsch’s Algorithm, Deutsch-Jozsa Algorithm, Bernstein-Vazirani Algorithm,
Simon’s Algorithm, Shor’s Algorithm, Grover’s Algorithm

Unit V
Current Asymmetric Algorithms: RSA, Diffie-Hellman, Elliptic Curve
The Impact of Quantum Computing on Cryptography: Asymmetric Cryptography, Specific
Algorithms, Specific Applications.

TEXT BOOKS:
1. Nielsen M. A., Quantum Computation and Quantum Information, Cambridge University Press
2. Dr. Chuck Easttom, Quantum Computing Fundamentals, Pearson

REFERENCES:
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.
Basic Concepts, Vol
3. Basic Tools and Special Topics, World Scientific. Pittenger A. O., An Introduction to Quantum
Computing Algorithms.
R25 M.Tech AI & DS JNTU Hyderabad

FUNDAMENTALS OF DATA SCIENCE (OPEN ELECTIVE)

M.Tech AI & DS II Year I Sem. L T P C

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

Course Outcomes:
1. Understand basic terms of statistical modeling and data science
2. Implementation of R programming concepts
3. 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

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.
R25 M.Tech AI & DS JNTU Hyderabad

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.
R25 M.Tech AI & DS JNTU Hyderabad

DATA VISUALIZATION TECHNIQUES (OPEN ELECTIVE)

M.Tech AI & DS II Year I Sem. L T P C

3 0 0 3
Course Objectives: To understand various data visualization techniques

Course Outcomes:
1. Know the historical development and evolution of data visualization techniques.
2. Analyze and visualize high-dimensional datasets using appropriate techniques.
3. Visualize large multidimensional datasets using appropriate methods.
4. Create insightful visual representations for diverse types of data.

UNIT I
Introduction, A Brief History of Data Visualization, Good Graphics, Static Graphics.

UNIT II
Data Visualization Through Their Graph Representations, Graph-theoretic Graphics, High-
dimensional Data Visualization, Multivariate Data Glyphs: Principles and Practice, Linked Views for
Visual Exploration, Linked Data Views, Visualizing Trees and Forests.

UNIT-III
Multidimensional Scaling, Huge Multidimensional Data Visualization, Multivariate Visualization by
Density Estimation, Structured Sets of Graphs, Structural Adaptive Smoothing by Propagation–
Separation Methods, Smoothing Techniques for Visualisation.

UNIT-IV
Data Visualization via Kernel Machines, Visualizing Cluster Analysis and Finite Mixture Models,
Visualizing Contingency Tables, Mosaic Plots and their Variants.

UNIT-V
Parallel Coordinates: Visualization, Exploration and Classification of High-Dimensional Data, Matrix
Visualization, Visualization in Bayesian Data Analysis.

TEXT BOOKS:
1. Handbook of Data Visualization by Chun-houh Chen, 2008.
2. Matthew Ward, Georges Grinstein and Daniel Keim, “Interactive Data Visualization
Foundations, Techniques, Applications”, 2010.
3. 3.Colin Ware, “Information Visualization Perception for Design”, 2nd edition, Margon
Kaufmann Publishers, 2004.

REFERENCES:
1. Robert Spence “Information visualization – Design for interaction”, Pearson Education, 2 nd
Edition, 2007.
2. Alexandru C. Telea, “Data Visualization: Principles and Practice,” A. K. Peters Ltd, 2008.
R25 M.Tech AI & DS JNTU Hyderabad

Fundamentals of AI (Open Elective)

M.Tech AI & DS II Year I Sem. L T P C
3 0 0 3
Course Objective:
1. To learn the difference between optimal reasoning Vs human like reasoning
2. To understand the notions of state space representation, exhaustive search, heuristic search
along with the time and space complexities
3. To learn different knowledge representation techniques
4. To understand the applications of AI namely, Game Playing, Theorem Proving, Expert
Systems, Machine Learning and Natural Language Processing

Course Outcomes:
1. Gain the knowledge of what is AI, risks and benefits of AI, limits of AI and the ethics involved
in building an AI application.
2. Understand the nature of environments and the structure of agents.
3. Possess the ability to select a search algorithm for a problem and characterize its time and
space complexities.
4. Possess the skill for representing knowledge using the appropriate technique
5. 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
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:
R25 M.Tech AI & DS JNTU Hyderabad

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