M.Sc. AI Syllabus As Per NEP 2020
M.Sc. AI Syllabus As Per NEP 2020
In association with
This program is designed to offer an in-depth curriculum covering key areas of artificial
intelligence such as machine learning, deep learning, natural language processing, robotics,
computer vision, and ethical considerations in AI. Our aim is to equip you with both the
theoretical and practical skills required to excel in the rapidly evolving field of AI.
Throughout the course, students will engage with various methodologies, frameworks, and
tools essential for AI research and applications. Practical labs and workshops will focus on
popular programming languages and frameworks such as Python, TensorFlow, and PyTorch,
along with machine learning libraries and cloud computing platforms. Students will also gain
experience working on real-world projects, often in collaboration with industry partners, that
will provide hands-on experience in applying AI algorithms to solve complex problems.
In addition to technical skills, the program is committed to nurturing critical thinking, problem-
solving abilities, and excellent communication skills. Students will be trained to approach AI
challenges ethically and responsibly, keeping in mind the societal and individual impacts. The
ability to articulate complex AI concepts to non-experts and to integrate feedback from various
stakeholders will be emphasized, preparing graduates to lead multidisciplinary teams.
Case studies, research papers, and guest lectures from industry experts will further deepen your
understanding of how AI is applied in contexts such as healthcare, automated vehicles, fintech,
and more. Optional internships will provide additional opportunities for practical application
of the skills and concepts learned.
Upon successful completion of this program, students will have the skills and expertise to
pursue a variety of career paths in the field of artificial intelligence. We look forward to
embarking on this exciting journey in the world of Artificial Intelligence with you. Get ready
to engage with complex algorithms, create intelligent solutions, and make a significant impact
in this transformative field.
Eligibility:
To secure entry into the MSc AI program at B. K. Birla College, one needs to meet the
following criteria:
▪ Candidate should have B. Sc. ( IT / CS / Mathematics / Statistics) or B. E. ( IT / CSE /
EXTC) or B. Tech ( IT / CSE ) or BCA or its equivalent should have secured not less
than fifty percent of marks in aggregate for all categories
▪ MSc AI admission will be based on merit score and Personal Interview.
Duration:
Credit Requirement
Qualification Title Semester Year
Minimum Maximum
PG Diploma 40 44 2 1
PG Degree 40 44 4 2
Program Outcome:
Course -III
Machine Learning
SEMESTER 1
Course Code L T P C
Computational Statistics with R 2 - 2 4
UNIT-1 CO 1
Calculation using R, Numbers, words, and logic, Handling missing values, Vectors and
their attributes, System- and user-defined objects, Accessing data - within the system and
outside the system, Basics of R syntax and R workspace, Matrices and lists, System-
defined functions, Errors, and warnings, Writing scripts using R, Good programming
practice in R, R syntax - further steps, Use of parentheses, brackets, =, == and <–
UNIT-2 CO 2, CO 3
Range, Mean, Variance, Median, Standard Deviation, Histogram, Box Plot, Scatterplot,
Random number generation, Distributions, The practice of simulation
UNIT-3 CO 3, CO 4
Conditional statements, Loops and Iterations, Statistical inference, Contingency tables,
Chi-square goodness of fit, Regression, Generalized linear models, Advanced modeling
methods
UNIT-4 CO 3, CO 5
Graphics and tables, Working with larger datasets, Dataframes in R, Customising
User's environment
UNIT-5 CO 4, CO 6
EM algorithm, Monte Carlo Simulations, The Bootstrap, Permutation methods, Density
Estimation, Cross-validation
Reference Books:
Practical List:
UNIT-1 CO 1
Introduction to Artificial Intelligence (AI): History of AI, Tools to be used for AI
programming and its overview, what is cognitive science and the problem of perception,
Applications of AI
UNIT-2 CO 2
Search: Intelligent agents, Uninformed Search Techniques: Breadth-First Search,
Uniform cost search, Depth-first search, Depth-limited search, Iterative deepening search,
Bidirectional search. Informed Search Techniques: Best-First Search, Greedy Search, A*,
Heuristic Function, Hill Climbing, Simulated Annealing, game playing
UNIT-3 CO 3
Machine Learning: Basic concepts, Linear models, perceptron, Introduction to
supervised learning and k-nearest neighbors (KNN), decision trees, Advanced models -
support vector machine (SVM), ensemble classifiers, Introduction to unsupervised
learning and clustering methods
UNIT-4 CO 4
Deep Learning: Introduction to neural networks, Backpropagation, training neural nets
using keras, Regularization, batch normalization, dropout, Introduction to convolutional
neural networks (CNN), Introduction to natural language processing (NLP) and toolkits
UNIT-5 CO 5, CO 6
Time Series Analysis: Introduction to time series, Stationary time series, Smoothing
time series, Autocorrelation functions, Autoregressive integrated moving average
(ARIMA) models, Signal transformations
Real-Time Project using basic Machine Learning, Deep Learning and Time Series
Analysis
Reference Books:
Practical List:
UNIT-1 CO 1, CO 2
Introduction to Analytics Techniques: Data Analytics and Business Intelligence,
Fundamentals of Excel - how to run calculations on numbers, sort and filter your
data. Data Cleaning and working with Conditions using Excel
UNIT-2 CO 2, CO 3
Data Manipulation using Advanced Excel - how data needs to be fetched, matched,
and compared – across datasets and sheets.
Data Analysis & Visualization using Advanced Excel - reverse calculations, sensitivity
analysis and comparing scenarios, how to summarize data and use it to generate reports,
how to create your charts directly from your pivot tables reports.
Introduction to Statistics & Application in Excel - Descriptive Statistics, Inferential
Statistics, Regression, ANOVA, Correlation, Covariance, Histogram
UNIT-3 CO 3
Introduction to Python Programming: Variables, branching statements, looping
statements, user-defined functions.
Data Manipulation in Python: The various steps involved in Data Cleaning, functions
used in Data Inspection, and tackling the problems faced during Data Cleaning.
Data Import Techniques in Python: Import data from spreadsheets and text files into
Python, import data from other statistical formats like sas7bdat and spss, packages
installation used for database import, connect to RDBMS from Python and basic SQL
queries in Python, basics of Web Scraping.
UNIT-4 CO 4
Exploratory Data Analysis: Understanding the Exploratory Data Analysis (EDA),
implementation of EDA on various datasets, Boxplots, and whiskers of Boxplots.
understanding the cor() in Python, EDA functions like summarize(), and list(), multiple
packages for data analysis, the Fancy plots like the Segment plot, and HC plot in
Python.
Data Visualization in Python: Understanding Data Visualization, graphical functions
present in Python, plotting various graphs like tableplot, histogram, and Boxplot,
customizing Graphical Parameters to improvise plots, understanding GUIs, and
introduction to Spatial Analysis
UNIT-5 CO 5, CO 6
Linear and Logistic Regression: Linear Regression, Logistic Regression. ANOVA
and Sentiment Analysis.
Decision Trees and Random Forest: Decision Tree, the 3 elements for classification
of a Decision Tree, Entropy, Gini Index, Pruning and Information Gain, bagging of
Regression and Classification Trees, concepts of Random Forest, working of Random
Forest, features of Random Forest, among others
Reference Books:
1. Winston, Wayne L., "Microsoft Excel 2019 Data Analysis and Business Modeling,"
Microsoft Press, 2019.
2. McKinney, Wes, "Python for Data Analysis: Data Wrangling with Pandas, NumPy, and
IPython," O'Reilly Media, 2018.
3. Raschka, Sebastian and Mirjalili, Vahid, "Python Machine Learning," Packt
Publishing, 3rd edition, 2019.
4. Pardoe, Iain, "Applied Regression Modeling," Wiley, 2nd edition, 2012.
Practical List:
1. Data Cleaning in Excel: You are given a dataset with missing values and duplicates.
How would you go about cleaning this dataset using Excel's built-in functions?
2. Conditional Calculations in Excel: Using Excel, how would you filter a dataset to
show only entries where sales exceed $1,000? Furthermore, can you create a new
column that classifies these sales as 'High'?
3. Statistical Analysis in Excel: Use Excel to calculate the mean, median, and standard
deviation of a given dataset. How would you go about running a simple linear
regression?
4. Excel Pivot Table: Given a dataset of a store's sales including columns for date,
product, and revenue, create a Pivot Table that summarizes the data by month and
product type.
5. Python Basics and Data Import: Write a Python script that reads a CSV file and prints
the first 10 rows. Use the Pandas library.
6. Data Manipulation in Python: Using Pandas, filter out rows where a specified column
has a value less than a given threshold and create a new dataframe with the filtered data.
7. Data Visualization in Python: Create a histogram and a box plot of a given numerical
data column using Matplotlib or Seaborn. Explain the insights you can derive from
these plots.
8. Exploratory Data Analysis (EDA) in Python: Given a dataset, perform EDA to find
out the relationships between variables. Use correlation matrices, pair plots, or other
visualization tools to present your findings.
9. Linear Regression in Python: Implement a simple linear regression model using
Python's scikit-learn library on a dataset with two variables. Evaluate the model using
R-squared and RMSE (Root Mean Square Error).
10. Decision Tree in Python: Create a decision tree model to predict a categorical variable
based on other variables in the dataset. Use Python's scikit-learn library and evaluate
the model's accuracy
Course Code L T P C
Entrepreneurial Skills and Scientific Writing 2 - 2 4
UNIT-1 CO 1, CO 2
Basic Aspects of Entrepreneurship: The Entrepreneur – Meaning and Importance,
Nature of Entrepreneur & Entrepreneurship, Characteristics of an Entrepreneur,
Classification of Entrepreneurs (based on Type of Business), Distinction between
Entrepreneur and Manager. Use of Technology, Motivation, Growth, New Generation of
Entrepreneurs. Factors influencing Entrepreneurship: Psychological, Social, Economic,
and Environmental Factors. Developing Entrepreneurial and effective business plans and
their environmental assessment in the political, legal, economic, social, Technological,
and global context. Medium, Small and Tiny Business: Definition, Role in the economy
and significance.
UNIT-2 CO 3
Entrepreneurial Venture Initiation, growth, and development: Assessment of
business opportunities, Entrepreneurial Motivation, Government initiatives and private
sector opportunities. Strategic planning for emerging ventures, Managing entrepreneurial
growth, Role of venture capital and their problems. Meaning and Concept of
Entrepreneurial Competency - Developing Entrepreneurial Competencies,
Entrepreneurial Mobility - Factors Affecting Entrepreneurial Mobility-Types of
Entrepreneurial Mobility-Barriers to Entrepreneurship
UNIT-3 CO 4
Overview of Scientific Writing: Introduction- Overview of scientific writing, how is
scientific writing different from general writing, knowing your audience, writing for the
general public, science/ technical reporting and news, explanatory writing, lengthy
magazine articles, popular articles, and popular lectures. Writing for the scientific
community, types of paper (short communication, original research article, review), the
various components for each type, and the content of each component (title, author
affiliation, abstract, keywords, introduction, material, and methods, results and discussion,
conclusion, references and bibliography, citation.
UNIT-4 CO 5, CO 6
Ethics in writing: plagiarism, plagiarism checker online. Writing research grant
proposals, Book reviews, writing mini-profiles of prominent scientists, letters to editor,
opinion writing, interviews of a scientist, and career in scientific writing.
UNIT-5 CO 6
Technical writing and tools for Scientific Writing: Technical Writing for Scientific
and technical subjects; formal and informal writings; formal writings/reports, preparing
handbooks, manuals, letters, memorandum, notices, agenda, minutes; common errors to
be avoided. Document formats – hard and soft copy versions designs. Principles of
technical writing; styles in technical writing; clarity, precision, coherence and logical
sequence in writing. Using web-based search engines, authenticating the information,
Overview and Use of generative AI tools for writing. Use of editing softwares and tools
Reference Books
1. Wickham, Phillip A (1998); Strategic Entrepreneurship, Pitman, UK.
2. Shukla, MB, (2011), Entrepreneurship and Small Business Management, KitabMahal,
Allahabad
3. Hill, Michal A., Inland Durama R et al; Strategic Entrepreneurship: Creating a New
Mindset, Blackwell Publishers, Oxford.
4. Zenas Block and Ian C Macmillan, Corporate Venturing, Harvard Business School Press,
Boston
5. Sahay A., V. Sharma (2008), Entrepreneurship and New Venture Creation, Excel Books,
New Delhi.
6. Lall, Sahai (2006), Entrepreneurship, Excel Books, New Delhi.
7. Technical writing style by – Dan Jones , Sam Dragga
8. Handbook of Technical writing by- Walter.E.ollu -1976
9. Technical Writing by- Serena Henning
10. Technical writing process by – Kieran Morgan and Sanja Spejic -2015
A guide to Technical writing by – T.A. Rickard
Course Code L T P C
Design Thinking 2 - 2 4
UNIT-1 CO 1
Onboarding process: Welcome and Course Resources, what is Design Thinking:
Introduction, Process, Modes, Importance in socio-economic context: WHY - Challenges,
Awareness and Impact, Design thinking broader business picture: Broader aspects and
impact, Multiple points of Interactions, The Product Form and the content
UNIT-2 CO 2, CO 3
Need Analysis, Business Goals, Design Vision & Stakeholder mapping, what is
hypothesis: Business Context and market analysis, Archetype Creation: Persona and
Customer Journey mapping questionnaire, Market research vs. Design research, Types of
research, Research scenario (Business Hypothesis Mapping)
Identifying Customer need: Empathizing, what is Empathy, Difference between
Sympathy & Empathy, Customer Perspectives, Recruitment process, Research
(Ethnographic) methods: Observe. Immerse.
Interact, Research Synthesis/Field work: observation & interview techniques,
Archetype Creation: Persona, Customer Journey Mapping preparation, Various
observation & empathy frameworks, Supporting conceptual Models. User Models
UNIT-3 CO 4
Analysis & Synthesis: Research data prioritization/mapping, Data mapping (root cause)
tools & techniques, Data interpretation. Developing insights, reframe challenge based on
customer need and hypothesis validation, Design Challenge Summary: Final challenge,
SCOPE and HMW, developing contextual conclusions, developing design response.
Ideation: Creativity, Invention, Innovation, Various Thinking approaches for enhancing
creativity, Ideation tools, Transformation, Brainwriting Methods,
Conceptualization: Prioritising ideas, Product Goals and Profile. User Experience Goals.
Parameters and Weightage Perceptual Appropriation of Design Solution. Relevance and
Validity, Design implications, product positioning, Sustainable design solution, standards,
heuristics, affordance, principles
UNIT-4 CO 5
Prototyping: Introduction, Iteration - Mindset for prototyping, Types of prototyping,
Prototyping tools and techniques, Information architecture and design, Low and high-
fidelity prototypes, handling complexity with simplicity
Testing methods, Testing mindset: Planning and conducting User Testing, Heuristic
evaluation, Expert usability testing, Feedback analysis and iteration, Revisiting Design
Criterion, Preparing Guidelines, Recommendations
UNIT-5 CO 6
Impact Delivery: Revisiting the entire process and project, Business goals and impact
delivery, KPIs and Risk Prediction, Change Management, devising a preliminary
Implementation Plan, What and How are we Delivering: Product, Service, Experience
UNIT-1 CO 1
Introduction to Database Systems: Introduction to databases and DBMS, Role of
databases in AI, Relational databases, SQL and NoSQL databases, Data Models and
Schemas
UNIT-2 CO 2, CO 3
Distributed Databases and Data Storage: Horizontal vs. Vertical Scaling, Sharding,
Partitioning, and Replication, Distributed File Systems (e.g., HDFS), Cloud-based
Database Solutions (e.g., AWS RDS, Google Cloud SQL)
UNIT-3 CO 4
Big Data Technologies: Introduction to MapReduce, Spark, Hive and Hadoop Ecosystem,
Real-time processing frameworks (Kafka, Storm)
UNIT-4 CO 5
Big Data Databases: Columnar Databases (e.g., Cassandra, HBase), Graph Databases
(e.g., Neo4j, ArangoDB)
UNIT-5 CO 6
Security, Compliance, and Optimization: Data Privacy and GDPR, Database Security
Mechanisms, Indexing and Query Optimization, Database tuning for Big Data
Reference Books
1. Garcia-Molina, H., Ullman, J. D., & Widom, J. (2020). "Database Systems: The
Complete Book," 2nd Edition. Pearson Education, Inc.
2. Shoshani, A., & Rotem, D. (2011). "Scientific Data Management: Challenges,
Technology, and Deployment." CRC Press.
3. White, T. (2015). "Hadoop: The Definitive Guide," 4th Edition. O'Reilly Media.
4. Chapple, M., & Seidl, D. (2020). "Cybersecurity: A Comprehensive Guide to Planning
and Implementing a Cyber Defense Strategy." McGraw-Hill Education.
Practical List
1. Create a relational database schema for a library system that manages books, users, and
checkouts. Write SQL queries to create tables and insert sample data.
2. How would you design a sharding scheme for a distributed database that has to store a
large number of user profiles? Discuss key considerations.
3. Using AWS RDS or Google Cloud SQL, create a cloud-based database. Insert some
sample records and query them.
4. Implement a basic MapReduce function to count the occurrence of words in a text file.
5. Write a Kafka producer and consumer to stream a series of numbers, and then write
another consumer to find the average of these numbers in real-time.
6. Use a columnar database like Cassandra to create a table for storing sensor data. Write
queries to insert and retrieve data.
7. Implement a small graph database using Neo4j to model a social network. Demonstrate
how to find mutual friends between two people.
8. Enumerate different Database Security Mechanisms that could be implemented to
secure a database. Implement at least one such mechanism.
9. Given a set of SQL queries, optimize them by altering the database schema, adding
indexes, or rewriting the queries.
10. Conduct a mock GDPR audit on a database system. Identify any non-compliance and
propose measures to correct them.
Course Code L T P C
Research Methodology 2 - 2 4
UNIT-1 CO 1
Introduction to Research in Computing: The 6 Ps of Research, purpose and product of
research, Research Domains from Information Systems and recent Computing disciplines,
Study of research carried out in different disciplines through the Research Papers, Finding
and choosing research topics, Evaluating the purpose and products of research, Participants
and research ethics, Research Ethics, Practical Work
UNIT-2 CO 2
Research Process: Literature Review, Open-Source Literature Review, Search Tools to
find open-source articles. Research Question and conceptual framework, Formulating a
Research Question / Problem Statement, Tools and Strategies for answering the Research,
Questions (Research Design), Practical work
UNIT-3 CO 3
Use of Data Analysis for Research: Quantitative Data Analysis: Types of quantitative
data, sources of quantitative data, Tools for data analysis, Qualitative Data Analysis:
Analyzing textual data, Analyzing non-textual qualitative data, Grounded theory,
Computer-aided qualitative analysis., Evaluating qualitative data analysis, Practical Work.
UNIT-4 CO 4
Writing and Presentation of Research: Importance of publishing the research, Types of
Research Publications and writing up the Research, Different formats of writing research,
Conference paper presentation, Posters and exhibitions, Software demonstrations,
Presenting yourself. Facing Vivas, Evaluating presentations for written and oral
Presentations, Creating Your profile as a researcher Practical Work
UNIT-5 CO 5, CO 6
Use of tools/techniques for Research: Methods to search required information
effectively, Reference Management Software like Zotero. Research Ethics Meaning,
Approaches to Research Ethics, Ethical Issues in Research, Measures to make research
more ethical, Legal Aspects.
Reference Books:
Practical List:
UNIT-1 CO 1
The Role of Algorithms in Computing: Algorithms, Algorithms as a technology,
Insertion sort, Analyzing algorithms, Designing algorithms
Growth of Functions: Asymptotic notation, Standard notations and common functions
Recurrences: The substitution method, The recursion-tree method, The master method
UNIT-2 CO 2, CO 3
Sorting in Linear Time: Lower bounds for sorting, Counting sort, Radix sort, Bucket sort
Binary Search Trees: What is a binary search tree?, Querying a binary search tree,
Insertion and deletion, Randomly built binary search trees
Red-Black Trees: Properties of red-black trees, Rotations, Insertion, Deletion
UNIT-3 CO 4
Dynamic Programming: Assembly-line scheduling, Matrix-chain multiplication,
Elements of dynamic programming, Longest common subsequence, Optimal binary search
trees
Greedy Algorithms: An activity-selection problem, Elements of the greedy strategy,
Huffman codes, Theoretical foundations for greedy methods, A task-scheduling problem
Elementary Graph Algorithms: Representations of graphs, Breadth-first search, Depth-
first search, Topological sort, Strongly connected components
UNIT-4 CO 5
Minimum Spanning Trees: Growing a minimum spanning tree, The algorithms of
Kruskal and Prim
Single-Source Shortest Paths: The Bellman-Ford algorithm, Single-source shortest paths
in directed acyclic graphs, Dijkstra’s algorithm, Difference constraints and shortest paths
All-Pairs Shortest Paths: Shortest paths and matrix multiplication, The Floyd-Warshall
algorithm, Johnson’s algorithm for sparse graphs
UNIT-5 CO 6
Number-Theoretic Algorithms: Elementary number-theoretic notions, Greatest common
divisor, Modular arithmetic, Solving modular linear equations, The Chinese remainder
theorem, Powers of an element, The RSA public-key cryptosystem
NP-Completeness: Polynomial time, Polynomial-time verification, NP-completeness and
reducibility, NP-completeness proofs, NP-complete problems
Approximation Algorithms: The vertex-cover problem, The traveling-salesman problem,
The set-covering problem, Randomization and linear programming, The subset-sum
problem
Reference Books:
1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. "Introduction to Algorithms,"
3rd ed. MIT Press, 2009.
2. Sedgewick, R., & Wayne, K. "Algorithms," 4th ed. Addison-Wesley, 2011.
3. Dasgupta, S., Papadimitriou, C. H., & Vazirani, U. "Algorithms," McGraw-Hill, 2006.
4. Kleinberg, J., & Tardos, É. "Algorithm Design," Addison-Wesley, 2005.
Practical List:
1. Write a program to implement Insertion Sort. Measure its time complexity empirically
and compare it with the theoretical time complexity.
2. Implement the Counting Sort algorithm and test it on an array of integers. How does it
perform on a set of already sorted integers?
3. Implement a Red-Black Tree with insert and delete operations. Demonstrate rotations
visually.
4. Given two sequences, write a program to find the length of the longest common
subsequence.
5. Implement Kruskal’s algorithm to find the Minimum Spanning Tree of a graph
represented as an adjacency list.
6. Given a weighted graph, implement Dijkstra’s algorithm to find the shortest path from
a source vertex to all other vertices.
7. Implement an algorithm to solve a set of simultaneous congruences using the Chinese
Remainder Theorem.
8. Write a program that determines if there exists a subset of a given set of integers that
sums up to a given target, using dynamic programming.
9. Prove that the Clique problem is NP-complete.
Course Code L T P C
Decision Modeling 2 - 2 4
UNIT-1 CO 1
Markov Decision Processes: Introduction, Markov decision problems, Value functions,
Markov policies, Characterization of optimal policies, Optimization algorithms for MDPs
Reinforcement Learning: Introduction, Reinforcement learning: a global view, Monte
Carlo methods, From Monte Carlo to temporal difference methods, Temporal difference
methods, Model-based methods: learning a model
UNIT-2 CO 2, CO 3
Approximate Dynamic Programming: Introduction, Approximate value iteration (AVI),
Approximate policy iteration (API), Direct minimization of the Bellman residual, Towards
an analysis of dynamic programming in Lp-norm
Factored Markov Decision Processes: Introduction, Modeling a problem with an FMDP,
Planning with FMDPs
UNIT-3 CO 4
Policy-Gradient Algorithms: Reminder about the notion of gradient, Optimizing a
parameterized policy with a gradient algorithm, Actor-critic methods, Complements
Online Resolution Techniques: Introduction, Online algorithms for solving an MDP,
Controlling the search
UNIT-4 CO 5
Partially Observable Markov Decision Processes: Formal definitions for POMDPs,
Non-Markovian problems: incomplete information, Computation of an exact policy on
information states, Exact value iteration algorithms, Policy iteration algorithms
Stochastic Games: Introduction, Background on game theory, Stochastic games
UNIT-5 CO 6
DEC-MDP/POMDP: Introduction, Preliminaries, Multi agent Markov decision
processes, Decentralized control and local observability, Sub-classes of DEC-POMDPs,
Algorithms for solving DEC-POMDPs, Applicative scenario: multi robot exploration
Non-Standard Criteria: Introduction, Multi criteria approaches, Robustness in MDPs,
Possibilistic MDPs, Algebraic MDPs
Reference Books:
1. Sutton, R. S., and Barto, A. G., "Reinforcement Learning: An Introduction," MIT Press,
2018.
2. Powell, W. B., "Approximate Dynamic Programming: Solving the Curses of
Dimensionality," Wiley, 2011.
3. Kaelbling, L. P., Littman, M. L., and Cassandra, A. R., "Planning and Acting in
Partially Observable Stochastic Domains," MIT Press, 1998.
4. Shoham, Y., and Leyton-Brown, K., "Multiagent Systems: Algorithmic, Game-
Theoretic, and Logical Foundations," Cambridge University Press, 2009.
Practical List:
1. Given a simple grid world as your environment, implement the Value Iteration
algorithm to find the optimal policy.
2. Simulate a simple game like tic-tac-toe using Monte Carlo methods to learn the value
of each state.
3. Adapt your Value Iteration implementation to use function approximation. Compare
the performance with and without approximation.
4. Model a traffic signal problem as a Factored Markov Decision Process. Describe how
the state and action spaces are factored.
5. Implement the actor-critic method for solving a problem of your choice. Discuss the
advantages and disadvantages of using actor-critic methods.
6. Simulate an online shopping recommendation system where the model has to
recommend products on-the-fly based on user interactions.
7. Implement a Partially Observable Markov Decision Process for a simple robotic
navigation task where the robot’s sensors are imperfect.
8. Model and simulate a multi-agent environment like a simple poker game using the
concepts of stochastic games.
9. Implement a decentralized control system for multiple robots to explore a grid world.
Use DEC-MDP or DEC-POMDP as appropriate.
10. Implement a Markov Decision Process that incorporates some measure of robustness
against uncertainty in state transitions or rewards. Compare its performance against a
non-robust MDP.
Course Code L T P C
Machine Learning 2 - 2 4
UNIT-1 CO 1
Introduction to Machine Learning: Definition, types of learning, applications.
Supervised Learning: Classification, regression, overfitting, bias-variance trade-off.
Unsupervised Learning: Clustering, dimensionality reduction.
Evaluation Metrics: Accuracy, precision, recall, F1-score, ROC curves.
UNIT-2 CO 2
Data Cleaning: Handling missing values, and outliers.
Feature Selection: Filter, wrapper, and embedded methods.
Feature Transformation: Scaling, normalization, encoding categorical variables.
Handling Imbalanced Data: Techniques for handling imbalanced datasets.
UNIT-3 CO 3
Linear Regression: Simple and multiple linear regressions, regularization.
Logistic Regression: Binary and multi-class classification.
K-Nearest Neighbors (k-NN): Distance metrics, choosing k.
Decision Trees and Random Forests: Entropy, Gini impurity, ensemble methods.
Support Vector Machines (SVM): Linear and non-linear kernels, hyperparameters.
Naive Bayes: Probability theory, Bayes' theorem, text classification.
UNIT-4 CO 4
K-Means Clustering: Distance metrics, initialization methods.
Hierarchical Clustering: Agglomerative and divisive methods.
Principal Component Analysis (PCA): Dimensionality reduction, eigenvectors.
Recommender Systems: Collaborative filtering, content-based filtering.
UNIT-5 CO 4, CO 5, CO 6
Neural Networks and Deep Learning: Feed forward networks, backpropagation.
Convolutional Neural Networks (CNN): Image classification, convolution layers.
Recurrent Neural Networks (RNN): Sequence modeling, LSTM, GRU.
Ensemble Learning: Bagging, boosting, stacking.
Model Selection and Hyperparameter Tuning: Cross-validation, grid search.
Reference Books:
1. Bishop, C. M., "Pattern Recognition and Machine Learning," Springer, 2006.
2. James, G., Witten, D., Hastie, T., and Tibshirani, R., "An Introduction to Statistical
Learning: with Applications in R," Springer, 2013.
3. Goodfellow, I., Bengio, Y., Courville, A., "Deep Learning," MIT Press, 2016.
4. Duda, R. O., Hart, P. E., and Stork, D. G., "Pattern Classification," Wiley, 2nd
Edition, 2000.
Practical List:
1. Given a dataset, determine whether the problem it poses is a classification problem or
a regression problem. Justify your answer.
2. Write a Python script to handle missing values in a dataset using mean imputation.
3. Apply a filter-based feature selection method to a given dataset and explain the features
that are most relevant.
4. Implement simple linear regression on a dataset and evaluate its performance using
RMSE (Root Mean Square Error).
5. Write a program to implement the k-NN algorithm for a classification task. Test its
performance with different distance metrics like Euclidean and Manhattan.
6. Apply K-means clustering to cluster customers into different segments based on their
buying habits.
7. Implement Principal Component Analysis on a high-dimensional dataset and explain
the variance captured by the principal components.
8. Design a simple feed-forward neural network for a binary classification problem and
train it using backpropagation.
9. Use grid search to find the optimal hyperparameters for a Support Vector Machine on
a given dataset.
10. Build a logistic regression model and evaluate its performance using various metrics
like accuracy, precision, recall, and F1-score. Plot the ROC curve for the model.
Course Code L T P C
RPA Foundation 2 - 2 4
UNIT-1 CO 1
Basics of Programming and Frameworks: Evolution of Programming languages, OOP
Fundamentals, Data Structures, Algorithm, Compiler, Execution, Scripting, Macros,
Frameworks, Information Sharing Mechanism, Files and File Types, Access Control
UNIT-2 CO 2, CO 3
Introduction to RPA: Automation and Robotic Process Automation (RPA), Best Practices
in RPA, Development Lifecycle of RPA, RPA Journey
UNIT-3 CO 3, CO 4
UiPath Introduction and Basics: Installation of UiPath, Variable and Arguments
Concepts, Decision statements, Iterative execution of statements, Sequence, and Flowchart
UNIT-4 CO 4, CO 5
RPA Basics and Functioning: Data manipulation and gathering, Selectors, Recording
and Advanced UI Interaction: Basic and Desktop Recording, Web Recording, Screen
Scraping, Data Scraping, DataTable
UNIT-5 CO 6
RPA Components: Excel Automation, Data Debugging, Debugging Panel and
Components, Orchestrator, Tenant, Folders, Types of Robots, Process, Job, Deploy UiPath
robots on Orchestrator
UNIT-1 CO 1
An Introduction to Generative AI: Applications of AI, The rules of probability, Why use
generative models? Style transfer and image transformation, Unique challenges of
generative models
UNIT-2 CO 2
Teaching Networks to Generate Digits: The MNIST database, Restricted Boltzmann
Machines: generating pixels with statistical mechanics, Stacking Restricted Boltzmann
Machines to generate images: the Deep Belief Network, Creating an RBM using the
TensorFlow Keras layers API, Creating a DBN with the Keras Model API
Painting Pictures with Neural Networks Using VAEs: Creating separable encodings of
images, The variational objective, Inverse Autoregressive Flow, Importing CIFAR,
Creating the network from TensorFlow
UNIT-3 CO 3, CO 4
Image Generation with GANs: The taxonomy of generative models, Generative
adversarial networks, Vanilla GAN, Improved GANs, Progressive GAN, Challenges
Style Transfer with GANs: Paired style transfer using pix2pix GAN, Unpaired style transfer using
CycleGAN
UNIT-4 CO 5
Using Transformers to Generate Text: Attention, Contextual embeddings, Self-
attention, Transformers, Generative pre-training: GPT, GPT-2, Hands-on with GPT-2,
Mammoth GPT-3
UNIT-5 CO 6
Composing Music with Generative Models: Getting started with music generation,
Music generation using LSTMs, Music generation using GANs, MuseGAN – polyphonic
music generation
Reference Books:
1. Goodfellow, I., Bengio, Y., Courville, A., "Deep Learning," MIT Press, 2016.
2. Kingma, D. P., Welling, M., "Auto-Encoding Variational Bayes," 2014.
3. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., ... &
Polosukhin, I., "Attention Is All You Need," 2017.
4. Tokui, S., Oono, K., Hido, S., Clayton, J., "Chainer: A Next-Generation Open Source
Framework for Deep Learning," Proceedings of Workshop on Machine Learning
Systems (LearningSys) in The Twenty-ninth Annual Conference on Neural Information
Processing Systems (NIPS), 2015.
Practical List:
1. Implement a basic style transfer algorithm using a pre-trained CNN. Discuss the unique
challenges you faced during the implementation process.
2. Use Restricted Boltzmann Machines to generate handwritten digits based on the
MNIST dataset. What adjustments did you make to improve the quality of the generated
digits?
3. Use a Variational Autoencoder to encode and decode images from the CIFAR-10
dataset. How well does the VAE reconstruct these images?
4. Build a simple Generative Adversarial Network to generate images resembling a subset
of the Fashion-MNIST dataset.
5. Implement a pix2pix GAN model for paired image-to-image translation. How does it
differ from a Vanilla GAN?
6. Implement a basic Transformer model and use it for text generation on a dataset of your
choice. Evaluate its performance compared to traditional RNN-based approaches.
7. Use a pre-trained GPT-2 model to generate a piece of creative writing. Discuss its
quality and any limitations you observe.
8. Implement an LSTM-based model to generate a short sequence of music. Evaluate the
quality and discuss the limitations.
9. Use MuseGAN or a similar model for polyphonic music generation. How does it
compare to LSTM-based approaches?
10. Choose one image generation technique (RBM, VAE, GAN) and one text generation
technique (RNN, Transformer, GPT-2). Compare and contrast their effectiveness, ease
of implementation, and potential applications.
Course Code L T P C
Internship with Project
The syllabus proposes an internship for about 10 weeks to 12 weeks to be done by a student.
It is expected that a student chooses an IT or IT-related industry providing Internship in the
field of Artificial Intelligence and formally works as a part-time intern during the period. The
student should subject oneself with an internship evaluation with proper documentation of the
attendance and the type of work he or she has done in the chosen organization. Proper
certification by the organisation to whom the student was reporting, with Organization’s seal
should be attached as part of the documentation.