0% found this document useful (0 votes)
84 views41 pages

M.Sc. AI Syllabus As Per NEP 2020

The document outlines the syllabus for a Master's program in Artificial Intelligence. It provides details on the program structure, eligibility criteria, intended learning outcomes, and course descriptions. The 2-year program consists of core AI courses, electives, internship opportunities, and aims to equip students with both theoretical and practical skills for careers in AI.

Uploaded by

Ashish Navale
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
0% found this document useful (0 votes)
84 views41 pages

M.Sc. AI Syllabus As Per NEP 2020

The document outlines the syllabus for a Master's program in Artificial Intelligence. It provides details on the program structure, eligibility criteria, intended learning outcomes, and course descriptions. The 2-year program consists of core AI courses, electives, internship opportunities, and aims to equip students with both theoretical and practical skills for careers in AI.

Uploaded by

Ashish Navale
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 41

B. K.

Birla College of Arts, Science and


Commerce (Autonomous), Kalyan
(Affiliated to University of Mumbai)

Syllabus for M.Sc. Program as per

National Education Policy (NEP) 2020 framework:

M. Sc. Artificial Intelligence

In association with

Program Code: Information Technology

(Credit Based Semester and Grading System


Academic year 2023–2024)
Preamble:

Welcome to the Master of Science program in Artificial Intelligence, a cutting-edge course


designed to provide you with a thorough understanding of the theories, techniques, and
applications of AI. In a world where intelligent machines are becoming increasingly integrated
into various aspects of our lives—from healthcare and transportation to entertainment and
commerce—AI professionals are in high demand across sectors.

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:

• Proficiency in AI Algorithms and Techniques


Graduates will have a deep understanding of algorithms and techniques used in artificial
intelligence, including but not limited to machine learning, deep learning, and natural
language processing.
• Expertise in Data Visualization:
Graduates will demonstrate expertise in visualizing data effectively to communicate
insights and findings. They will be skilled in using data visualization tools and
techniques to present complex information in a clear and visually appealing manner.
• Expertise in Neural Networks and Deep Learning
Graduates will possess the ability to design and implement neural networks and deep
learning architectures. They will understand how to optimize these models for various
tasks, such as image recognition, language understanding, and autonomous navigation.
• Proficiency in Natural Language Processing and Computer Vision
Graduates will be proficient in applying natural language processing and computer
vision techniques to solve real-world problems, such as automated translation,
sentiment analysis, and object recognition.
• Understanding of Ethics and Responsible AI
Graduates will have a strong understanding of the ethical implications of AI
technologies. They will be capable of designing AI solutions that consider ethical,
social, and policy-related consequences.
• Mastery of AI Tools and Frameworks
Graduates will be adept at using AI-related tools and frameworks, such as TensorFlow,
PyTorch, and reinforcement learning libraries, to develop and deploy intelligent
systems.
• Proficiency in Programming and Data Manipulation
Graduates will be skilled in programming languages commonly used in AI research and
development, such as Python and C++. They will also be proficient in data
manipulation techniques necessary for feeding data into AI models.
• Effective Communication and Collaboration
Graduates will be skilled in communicating complex AI concepts clearly and
effectively to both technical and non-technical audiences. They will be effective
collaborators, able to work in multidisciplinary teams across various sectors.
• Problem-Solving and Critical Thinking
Graduates will possess exceptional problem-solving and critical thinking skills,
specifically in the realm of artificial intelligence. They will be capable of analyzing
complex AI challenges and proposing effective, innovative solutions.
• Lifelong Learning and Adaptability
Recognizing that AI is a rapidly evolving field, graduates will be committed to ongoing
learning and professional development. They will have the skills and mindset necessary
to adapt to new technologies, methodologies, and research paradigms in AI.
Syllabus as per NEP 2020

Sem Major Electives Minor OJT Total


(Credits-14) (Credits- 4) (Credits – 4) (Credits – 4)
Course- I
Computational
Statistics with R
Course -II
Foundations of Design
Artificial Thinking
Research
Intelligence
OR Methodology
I Course -III - 22
Data Analysis Database
using Excel and Systems for
Python Big Data
Course -IV
Entrepreneurial
Skills and
Scientific Writing
II Course -I
Modern RPA
Algorithm Foundation
Design
OR
Course -II - Internship with
22
Decision Project
Generative AI
Modeling

Course -III
Machine Learning
SEMESTER 1
Course Code L T P C
Computational Statistics with R 2 - 2 4

Pre-requisites Basic Statistics, Introduction to Semester I


Programming, Mathematics, Data
Handling and Analysis, Logical
Reasoning
Course Objectives:
• Understanding of R Programming Language: Students will become proficient in the
R programming language, including its syntax, workspace, and key functionalities. This
will enable them to undertake complex statistical analyses efficiently.
• Mastering Data Manipulation and Visualization: Students will learn how to
manipulate data sets using vectors, matrices, and data frames in R. They will also
acquire skills in data visualization techniques such as histograms, box plots, and
scatterplots to effectively communicate statistical findings.
• Advanced Statistical Analysis: The course aims to equip students with advanced
statistical techniques like EM algorithms, Monte Carlo Simulations, and statistical
inference methods. Students will become adept at building and evaluating models using
generalized linear models and other advanced modeling methods.
• Programming Best Practices: Students will be trained in good programming practices,
including script-writing, error-handling, and customizing their coding environment in
R. This will prepare them for larger data science projects and collaborations.
• Real-world Applications: Through the use of case studies and real-world examples,
students will apply their acquired skills to solve practical problems. They will learn how
to handle large data sets and make data-driven decisions using statistical evidence.

Course Outcomes (CO):


CO 1 Remember and Recognize R Syntax and Statistical Terminologies
CO 2 Understand Statistical Concepts and R Functionalities
CO 3 Apply Statistical Methods using R
CO 4 Analyze Statistical Models and R Scripts
CO 5 Evaluate Quality of Statistical Analysis
CO 6 Create and Conduct Statistical Experiments in R

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:

1. N. Matloff, "The Art of R Programming: A Tour of Statistical Software Design," 1st


ed. San Francisco, CA, USA: No Starch Press, 2011. ISBN-13: 978-1593273842.
2. C. Kleiber and A. Zeileis, "Applied Statistical Methods with R," 2nd ed. New York,
NY, USA: Springer, 2008. ISBN-13: 978-0387772370.
3. A. Bruce and P. Bruce, "Practical Statistics for Data Scientists: 50 Essential Concepts
Using R and Python," 2nd ed. Sebastopol, CA, USA: O'Reilly Media, 2020. ISBN-13:
978-1492072942.
4. C. P. Robert and G. Casella, "Monte Carlo Statistical Methods," 2nd ed. New York,
NY, USA: Springer, 2004. ISBN-13: 978-1441919397.

Practical List:

1. Generate two vectors of length 10 and a 3x3 matrix in R. Perform element-wise


addition, subtraction, and multiplication on these vectors. Also, compute the matrix
inverse and determinant for the 3x3 matrix.
2. Given a CSV file, use R to load the data and compute descriptive statistics like mean,
median, variance, and standard deviation for each numerical column.
3. Create histograms, box plots, and scatter plots to visualize different aspects of a dataset
using ggplot2 in R.
4. Use R to perform an independent samples t-test to compare the means of two groups in
a dataset. Interpret the p-value and confidence interval.
5. Fit a simple linear regression model to a dataset and interpret the coefficients, R-
squared values, and p-values.
6. Write an R script that takes an integer n as input and calculates its factorial using a for-
loop.
7. Given a dataframe with missing values, outliers, and categorical variables, write an R
script to clean and transform the data into a format suitable for modeling.
8. Demonstrate how to save and load the R workspace environment. Show the benefits of
using this feature for large datasets.
9. Given historical stock prices for two or more stocks, use Monte Carlo simulation to
simulate the portfolio returns and risk over a specified period.
10. Use k-fold cross-validation to find the best hyperparameters for a machine learning
model like k-NN or random forest in R. Discuss how the choice of k affects the results.
Course Code L T P C
Foundations of Artificial Intelligence 2 - 2 4

Pre-requisites Basic Programming Skills, Fundamental Semester I


Mathematics, Introductory Statistics,
Logical Reasoning, Computer Science
Fundamentals
Course Objectives:
• Introduction to AI Concepts: Students will gain a comprehensive understanding of
the historical background, tools, and various domains of AI, setting the stage for more
advanced topics.
• Mastery in Search Algorithms: Students will become proficient in both uninformed
and informed search techniques, equipping them with the problem-solving skills
required in AI.
• Understanding Machine Learning Models: Students will be introduced to the
fundamental theories and practical applications of machine learning, including
supervised and unsupervised learning methods.
• Foundational Knowledge in Deep Learning: Students will acquire basic
understanding and skills related to deep learning methods, including neural networks
and natural language processing.
• Skill Development in Time Series Analysis: Students will gain skills in analyzing time
series data, learning techniques like smoothing and ARIMA models that are commonly
used in AI applications for forecasting and signal processing.

Course Outcomes (CO):


CO 1 Understand and Recall the historical and foundational concepts of Artificial
Intelligence (AI).
CO 2 Apply and Demonstrate techniques related to AI search algorithms.
CO 3 Analyze and Apply basic machine learning algorithms in AI.
CO 4 Evaluate and Synthesize deep learning models and their applications.
CO 5 Analyze and Apply time series analysis in AI applications.
CO 6 Integrate and Create AI-based solutions using the acquired skills.

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:

1. S. J. Russell and P. Norvig, "Artificial Intelligence: A Modern Approach," 4th ed.


Harlow, England: Pearson, 2020. ISBN-13: 978-0134610993.
2. C. M. Bishop, "Pattern Recognition and Machine Learning," 1st ed. New York, NY,
USA: Springer, 2006. ISBN-13: 978-0387310732.
3. I. Goodfellow, Y. Bengio, and A. Courville, "Deep Learning," 1st ed. Cambridge, MA,
USA: MIT Press, 2016. ISBN-13: 978-0262035613.
4. G. E. Box, G. M. Jenkins, G. C. Reinsel, and G. M. Ljung, "Time Series Analysis:
Forecasting and Control," 5th ed. Hoboken, NJ, USA: Wiley, 2015. ISBN-13: 978-
1118675021.

Practical List:

1. Conduct a comparative analysis of different AI frameworks (TensorFlow, PyTorch,


Keras, etc.), evaluating their ease of use, flexibility, and community support. Present
your findings in a report.
2. Implement the Breadth-First Search algorithm to solve a simple maze problem.
Compare its efficiency with Depth-First Search.
3. Implement the A* search algorithm for a pathfinding problem. Experiment with
different heuristic functions and analyze their performance.
4. Implement a k-nearest neighbors (KNN) algorithm to classify a dataset into different
categories. Vary the value of k and observe how the classification accuracy changes.
5. Use a Decision Tree algorithm to predict whether a loan application will be approved
or not based on a set of features like income, credit score, and loan amount.
6. Train a simple neural network to recognize handwritten digits using the MNIST dataset.
Experiment with different numbers of layers and nodes.
7. Implement a basic Natural Language Processing (NLP) model to perform sentiment
analysis on customer reviews. Evaluate its accuracy.
8. Fit an ARIMA model to a time series of historical stock prices and make future price
predictions.
9. Implement a smoothing algorithm like exponential smoothing on a noisy signal and
evaluate its effectiveness in noise reduction.
10. Develop an AI-based solution that integrates machine learning, deep learning, and time
series analysis to solve a real-world problem, such as demand forecasting for a retail
store.
Course Code L T P C
Data Analysis Using Excel and Python 2 - 2 4

Pre-requisites Basic Computer Skills, Introduction to Semester I


Programming, Mathematical
Foundations, Spreadsheet Familiarity,
Basic SQL Knowledge
Course Objectives:
• Master the Fundamentals of Excel and Python: Gain a solid foundation in Excel for
data manipulation and an introduction to Python programming to expand your data
analytics capabilities.
• Data Manipulation and Cleaning: Learn the crucial techniques involved in cleaning
and preparing data for analysis in both Excel and Python environments. This includes
understanding how to handle missing or unstructured data and transforming raw data
into an analyzable format.
• Understanding and Implementing Data Analysis Techniques: Gain the skills
necessary to perform various forms of data analysis, including but not limited to,
descriptive statistics, inferential statistics, and regression analyses in both Excel and
Python.
• Data Visualization Skills: Acquire the ability to represent data in a visually informative
way, using various charting and plotting techniques in Excel and Python. This aids in
the better understanding of data and assists in drawing meaningful conclusions.
• Application of Machine Learning Algorithms: Understand and apply machine
learning techniques like linear and logistic regression, decision trees, and random forests
for predictive modeling and data classification.

Course Outcomes (CO):


CO 1 Recognize Basic Elements and Terminology
CO 2 Interpret Data Analysis Methods
CO 3 Conduct Basic Data Manipulation and Cleaning
CO 4 Implement Exploratory Data Analysis (EDA)
CO 5 Assess and Validate Statistical Models
CO 6 Synthesize Reports and Dashboards

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

Pre-requisites Basic Writing Skills, Introduction to Semester I


Entrepreneurship, Computer Literacy,
Internet Basics, Teamwork Skills
Course Objectives:
• Enhance Technical Communication Skills: To equip students with the skills needed
to create effective, clear, and professional technical documents that meet industry
standards.
• Understand Ethical and Legal Obligations: To familiarize students with the ethical
and legal considerations in technical and entrepreneurial communications, including
those related to social media and intercultural communication.
• Develop Content Writing and Organization Strategies: To enable students to craft
different types of content effectively, from blogs to newsletters, and to organize this
content coherently for various platforms.
• Master Research and Graphic Presentation: To educate students on how to conduct
both primary and secondary research, and how to effectively incorporate graphics into
their documents to make them more engaging and informative.
• Learn Innovation and Project Management in an Entrepreneurial Context: To
provide students with an understanding of innovation management within firms, the
management of R&D projects, and the application of these in an entrepreneurial setting.

Course Outcomes (CO):


CO 1 Remember and Understand Concepts of Technical Communication
CO 2 Apply Ethical and Legal Principles in Communication
CO 3 Analyze and Organize Content for Effective Communication
CO 4 Create and Evaluate Graphics and Research Components in Technical
Documents
CO 5 Synthesize Skills in Writing Proposals and Reports
CO 6 Evaluate and Manage Innovation and R&D Projects

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

Pre-requisites Basic Understanding of Business Semester I


Concepts, Introductory Concepts in
Psychology or Human Behavior,
Communication Skills, Problem-Solving
Skills, Basic Computer Skills
Course Objectives:
• Understand the Fundamentals of Design Thinking: By the end of this course,
students should be able to explain what design thinking is, its processes, modes, and its
importance in socio-economic contexts.
• Master Business Hypothesis and Customer Perspective: Students will learn how to
map business goals and stakeholder needs, create business hypotheses in context, and
understand customer perspectives through empathy.
• Tackle Design Challenges through Effective Ideation: The course aims to equip
students with the tools to effectively analyze research data, frame design challenges,
and employ various ideation methods for innovative solutions.
• Develop Prototyping and Testing Skills: Students will learn various prototyping
methods and how to conduct usability tests, iterate design based on feedback, and
analyze this feedback for effective design solutions.
• Implement Design Thinking in Real-world Business Contexts: The ultimate
objective is to prepare students to apply design thinking to deliver impact in a business
environment, complete with KPIs, risk predictions, and preliminary implementation
plans.

Course Outcomes (CO):


CO 1 Understand and Recall the Fundamentals of Design Thinking
CO 2 Analyze Business Goals and Stakeholder Needs
CO 3 Apply Empathy and Research Methods for Customer Understanding
CO 4 Synthesize Insights for Ideation and Design Challenges
CO 5 Evaluate and Implement Prototyping and Testing Methods
CO 6 Create and Execute a Preliminary Business Implementation Plan

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

**Reference Manuals and two Industrial Projects are given by TCS-iON


Course Code L T P C
Database Systems for Big Data 2 - 2 4

Pre-requisites Basic Understanding of Computer Semester I


Systems and Architecture, Programming
skills, basic data structures and
algorithms, Software Engineering
Principles, Basic Networking Concepts.
Course Objectives:
• Foundational Understanding of Database Systems: Equip students with a robust
foundational knowledge of both SQL and NoSQL database systems, as well as their
application in Artificial Intelligence.
• Distributed Databases Mastery: Train students in distributed database concepts,
including horizontal and vertical scaling and cloud-based database solutions.
• Big Data Technologies Proficiency: Familiarize students with Big Data technologies,
such as MapReduce, Spark, and real-time processing frameworks like Kafka.
• Specialized Big Data Databases: Introduce students to specialized databases tailored
for Big Data, such as columnar and graph databases.
• Database Security and Optimization: Educate students about the critical aspects of
database security, compliance, and performance optimization for Big Data
environments.

Course Outcomes (CO):


CO 1 Understand and Recall the basics of Database Systems including the Role of
Databases in AI.
CO 2 Apply and Demonstrate techniques for Distributed Databases and Data
Storage.
CO 3 Analyze and Implement Big Data Technologies like MapReduce, Spark, and
Kafka.
CO 4 Evaluate and Use specialized Big Data Databases like Columnar and Graph
databases.
CO 5 Assess and Implement Security and Compliance measures in Database
Systems.
CO 6 Optimize Database Systems specifically for Big Data use cases.

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

Pre-requisites Basic Understanding of Statistics, Semester I


Critical Thinking, Familiarity with
Academic Writing, Basic Computing
Skills, Introductory Concepts of
Computer Science
Course Objectives:
• Comprehensive Understanding of Research Foundations: To enable students to
understand the purpose, significance, and basic structures of research, including the use
of scientific methods.
• Mastering Research Design & Methods: To equip students with the knowledge to
design effective research studies, including an understanding of qualitative and
quantitative approaches.
• Proficiency in Data Measurement and Sampling: To teach students about various
measurement scales, validity, reliability, and sampling techniques.
• Data Analysis and Interpretation: To develop skills in data analysis using statistical
tools and the interpretation of the results.
• Research Ethics and Tools: To train students in the ethical considerations involved in
research and introduce them to various research tools like academic databases and
plagiarism detection software.

Course Outcomes (CO):


CO 1 Understand and Recall the Foundations of Scientific Research
CO 2 Apply and Demonstrate Principles of Research Design
CO 3 Analyze and Implement Measurement and Sampling Techniques
CO 4 Evaluate and Interpret Research Data
CO 5 Assess and Utilize Research Tools while Upholding Ethical Standards
CO 6 Integrate and Optimize Various Research Methods for Comprehensive
Studies

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:

1. Researching Information Systems and Computing by Briony J. Oates, Sage


Publications India Pvt. Ltd., New delhi, ISBN 1-4129-0224-X
2. Your research Project, A Step by step Guide for the first-time researcher by Nicholas
Walliman, Vistaar Publications (A division of Sage Publications), New Delhi ISBN 81-
7829-540-7
3. Research Methods by William M K Trochim Cornel University, biztantra, An imprint
of Dreamtech Press. WILEY-dreamtech India Pvt. Ltd., ISBN 81-7722-372-0.

Practical List:

1. Develop a research question and hypothesis based on a current trend in Artificial


Intelligence. Explain why you chose this question and outline your deductive reasoning
process.
2. Design an experimental setup to test your hypothesis from Question 1. Identify the
independent and dependent variables. Describe the control measures you would put in
place.
3. Explain how you would collect qualitative and quantitative data for your research.
Discuss the pros and cons of using interviews, surveys, and observations in your study.
4. Discuss the validity and reliability of the measurement scales you intend to use for your
research. Would you use nominal, ordinal, interval, or ratio scales? Justify your choice.
5. Describe the sampling method you would employ for your research. Explain how you
intend to determine the sample size and ensure the sample's representativeness.
6. Use a dataset of your choice to perform univariate and bivariate analyses. Present your
findings in the form of frequency tables, bar charts, or pie charts, and interpret the
results.
7. After conducting a Chi-square test on your data, explain how you would interpret the
results. Discuss the implications of your findings for the research question and
hypothesis.
8. Describe the ethical considerations you will take into account during your research.
How would you ensure the privacy and confidentiality of your participants?
9. Demonstrate the use of Reference Management Software like Zotero or Mendeley to
manage your citations. Show how you would integrate citations into your research
paper.
10. Based on your research findings, propose future research directions, draft a research
paper and publish in UGC-CARE/Scopus Indexed Journals.
SEMESTER 2
Course Code L T P C
Modern Algorithm Design 2 - 2 4

Pre-requisites Foundations of Computer Science, Semester II


Mathematical Maturity, Programming
Experience, Computational Thinking
Course Objectives:
• Understanding of Algorithm Fundamentals: To equip students with the theoretical
underpinnings of algorithms, including their role in computing, and basic design and
analysis techniques.
• Master Sorting and Tree Algorithms: To provide a deep understanding of sorting
algorithms and binary search trees, including their performance aspects and use-cases.
• Dynamic Programming and Greediness: To impart the foundational knowledge and
practical skills in applying dynamic programming and greedy algorithms to various
problems.
• Graph Theory and Optimization: To train students in graph-based algorithms,
focusing on optimization problems like shortest paths and minimum spanning trees.
• Computational Complexity: To introduce students to advanced topics like number-
theoretic algorithms, NP-completeness, and approximation algorithms, thus giving them
a comprehensive view of algorithmic challenges and solutions.

Course Outcomes (CO):


CO 1 Understand and analyze fundamental algorithms, their role in technology, and
growth functions.
CO 2 Apply sorting algorithms and understand the underlying principles and
performance metrics of binary search trees.
CO 3 Implement and analyze Red-Black Trees and their rotations, insertions, and
deletions.
CO 4 Solve complex problems using dynamic programming and greedy
algorithms; understand and apply elementary graph algorithms.
CO 5 Design and analyze algorithms for minimum spanning trees and shortest path
problems.
CO 6 Understand and apply number-theoretic algorithms; gain a fundamental
understanding of computational complexity, NP-Completeness, and
approximation algorithms.

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

Pre-requisites Probability and Statistics, Foundations of Semester II


Computer Science, Linear Algebra,
Optimization Techniques, Programming
Experience
Course Objectives:
• Foundational Understanding: To provide students with a foundational understanding
of decision-making models including Markov Decision Processes and Reinforcement
Learning.
• Advanced Techniques: To introduce students to advanced topics such as Approximate
Dynamic Programming, Policy-Gradient Algorithms, and Factored Markov Decision
Processes.
• Problem Solving: To equip students with the tools and methodologies for solving real-
world decision-making problems using these models.
• Multi-Agent Systems: To introduce the concepts of decentralized decision-making
processes and multi-agent systems.
• Critical Thinking: To foster the ability to critically evaluate different decision-making
models and their applicability to various problems.

Course Outcomes (CO):


CO 1 Understand and apply Markov Decision Processes and basic Reinforcement
Learning techniques.
CO 2 Implement and analyze Approximate Dynamic Programming methods and
understand the fundamentals of Factored Markov Decision Processes.
CO 3 Apply Policy-Gradient Algorithms and understand the essentials of Online
Resolution Techniques for decision making.
CO 4 Gain expertise in dealing with Partially Observable Markov Decision
Processes and Stochastic Games.
CO 5 Understand and implement decentralized control in multi-agent systems
using DEC-MDP/POMDP.
CO 6 Evaluate and apply non-standard criteria such as multi-criteria approaches,
robustness, and algebraic MDPs in decision-making.

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

Pre-requisites Probability and Statistics, Linear Semester II


Algebra, Calculus, Programming Skills,
Data Manipulation and Analysis
Course Objectives:
• Foundation and Types of ML: To provide students with a strong foundation in
machine learning, including supervised and unsupervised learning methods.
• Data Preprocessing: To equip students with the skills needed for data cleaning, feature
selection, and transformation.
• Classic Algorithms: To give in-depth knowledge of classic machine learning
algorithms like linear regression, logistic regression, k-NN, decision trees, and SVMs.
• Advanced Topics: To introduce more advanced topics like neural networks, ensemble
methods, and model selection techniques.
• Evaluation and Application: To teach students how to evaluate machine learning
models using metrics like accuracy, precision, and F1-score and to apply machine
learning algorithms to real-world problems.

Course Outcomes (CO):


CO 1 Understand the foundations of machine learning, including the types of
learning and evaluation metrics..
CO 2 Master the techniques for data cleaning, feature selection, and handling of
imbalanced datasets.
CO 3 Gain proficiency in implementing and interpreting classical machine learning
algorithms like linear regression, logistic regression, k-NN, decision trees,
and SVMs.
CO 4 Understand and apply advanced machine learning techniques like neural
networks, deep learning, and ensemble methods.
CO 5 Evaluate machine learning models effectively using various metrics and real-
world datasets.
CO 6 Apply the skills learned to solve real-world problems through projects and
case studies.

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

Pre-requisites Basic Programming Knowledge, OOP Semester II


Concepts, Data Structures, Basic
Software Development, Logical Thinking
Course Objectives:
• Foundational Understanding: To provide students with foundational knowledge in
programming, frameworks, and RPA principles.
• Hands-On Skills: To enable students to get hands-on experience in building simple
RPA bots using tools like UiPath.
• Process Automation Concepts: To familiarize students with the concept of
automation, best practices in RPA, and the RPA development lifecycle.
• Advanced Techniques: To teach advanced RPA functionalities like data scraping,
selectors, and orchestrators.
• Practical Applications: To prepare students for the practical application of RPA in
business and industry by focusing on real-world use cases.

Course Outcomes (CO):


CO 1 Acquire a foundational understanding of programming, frameworks, and best
practices in software development.
CO 2 Understand the key concepts, tools, and technologies associated with RPA,
with a focus on UiPath.
CO 3 Gain practical skills in building, debugging, and deploying simple RPA bots.
CO 4 Learn advanced RPA techniques such as data manipulation, advanced UI
interaction, and Orchestrator usage.
CO 5 Apply RPA principles to solve real-world problems, leveraging skills
acquired through hands-on exercises and projects.
CO 6 Demonstrate proficiency in debugging and optimizing RPA bots for different
operational environments.

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

**Reference Manuals and two Industrial Projects are given by TCS-iON


Course Code L T P C
Generative AI 2 - 2 4

Pre-requisites Fundamental Programming Skills, Basic Semester II


Machine Learning Knowledge,
Mathematics Background, Deep
Learning Basics, TensorFlow or Keras
Course Objectives:
• Understand Generative Models: To provide students with foundational understanding
and applications of generative models in AI, focusing on image, text, and music
generation.
• Hands-On Skills: To enable students to get practical experience with state-of-the-art
generative techniques, from basic Restricted Boltzmann Machines to advanced GANs
and Transformers.
• In-Depth Exploration: To take a deep dive into the mechanics, algorithms, and
mathematics that power generative models.
• Real-world Applications: To understand the practical applications and unique
challenges of using generative models in different domains.
• Exploration of Advanced Topics: To introduce and discuss cutting-edge
advancements and trends in generative AI, from GPT-3 to music composition with
MuseGAN.

Course Outcomes (CO):


CO 1 Acquire a comprehensive understanding of the fundamental principles and
applications of generative AI, including its role in image, text, and music
generation.
CO 2 Develop hands-on skills in creating and fine-tuning generative models using
Restricted Boltzmann Machines (RBM) and Deep Belief Networks (DBN).
CO 3 Master the design, implementation, and evaluation of Variational
Autoencoders (VAEs) for image generation and processing.
CO 4 Gain expertise in building and applying Generative Adversarial Networks
(GANs) for both image and style transfer applications.
CO 5 Acquire skills in implementing and using Transformer-based models for text
generation, including working with advanced models like GPT-2 and GPT-3.
CO 6 Learn the theory and practice of using generative models in music
composition, specifically using LSTMs and MuseGAN.

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

Pre-requisites Basic Machine Learning Course, Data Structures Semester II


and Algorithms, Programming Skills,
Framework Knowledge, Version Control,
Communication Skills, Teamwork, Problem-
Solving
Course Objectives:
• Skill Application: To enable students to apply academic knowledge and theories in a real-
world, professional setting, particularly focusing on the area of Artificial Intelligence.
• Professional Exposure & Networking: To familiarize students with industry standards and
work culture, while also providing them with opportunities to build a professional network
within the IT or AI industry.
• Project Management: To offer hands-on experience in managing and completing a real-
world project, enhancing both technical and project management skills.
• Soft Skill Development: To cultivate key soft skills, such as effective communication,
teamwork, and problem-solving, in a professional context.
• Career Readiness: To prepare students for future career opportunities by providing a well-
rounded, documented professional experience that can be included on their resumes.

Course Outcomes (CO):


CO 1 Gain factual knowledge (terminology, classifications, methods, trends) pertinent
to the Artificial Intelligence industry and demonstrate understanding through
summarization and explanation.
CO 2 Utilize appropriate methodologies, algorithms, and tools learned in the academic
setting to solve practical problems in a real-world, professional environment.
CO 3 Analyze real-world business or technical problems, dissect them into smaller
parts, and recommend appropriate machine learning or AI solutions.
CO 4 Critically assess and discuss the value of networking within the industry, and
make justified recommendations for the cultivation of professional relationships.
CO 5 Synthesize technical and non-technical insights gathered during the internship and
effectively communicate these through written reports, documentation, and oral
presentations.
CO 6 Critique ethical considerations and professional norms encountered during the
internship, and construct strategies for ethical decision-making in professional
settings.

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.

You might also like