13/12/2023, 09:36 about:blank

K L Deemed to be University
Department of Computer Science and Engineering-Honors -- KLVZA
Course Handout
2023-2024, Odd Sem
Course Title :DATA DRIVEN ARTIFICIAL INTELLIGENT SYSTEMS
Course Code :22AD2001A
L-T-P-S Structure : 3-0-4-0
Pre-requisite :
Credits :5
Course Coordinator :Imran Rasheed
Team of Instructors :
Teaching Associates :
Syllabus :CO1: Introduction to AI and Data Science, Intelligent Agents, Overview of various AI and Data
Science applications across domains (Healthcare, agriculture, robotics, automation, law, medicine, pharmacy,
and business management) Introduction to Heuristics, Heuristic search techniques: A* Search, Best-First
Search Heuristic search techniques: Hill Climbing Introduction to Constraint Satisfaction Problems (CSP),
Techniques for solving CSP (Backtracking, Forward Checking) Knowledge representation techniques
(Semantic Networks, Frames, Propositional and First-Order Logic) Reasoning techniques (Forward and
Backward Chaining, Resolution) CO2: Probabilistic Reasoning for AI, Introduction to Probability Theory
Introduction to Bayesian Networks, Inference in Bayesian Networks (Exact and Approximate Inference)
Introduction to Machine Learning (ML), preprocess and analyze data Types of Machine Learning (Supervised,
Unsupervised, and Reinforcement Learning). Concept learning search Find S Algorithm, Candidate
Elimination Algorithm (CEA) evaluating a hypothesis probably learning approximately correct hypothesis, and
function approximation. CO3: Introduction to ANN, Perceptron Multi-layer Perceptron Backpropagation.
Introduction to CNN and DL. Applications of CNN in Image Recognition and Processing. Data Science, Types
of data (Structured, Unstructured, and Semi-structured)Applications of CNN in Image Recognition. CO4:
Classification of Data Science (Descriptive, Diagnostic, Predictive, and Prescriptive Analytics) k-Nearest
Neighbors, k-Means Clustering, Principal Component Analysis Introduction to Natural Language Processing
Text Analytics Regression techniques. Introduction to Data Visualization and its importance, Popular data
visualization tools and libraries Data preprocessing techniques (Cleaning, Transformation, and Feature
Scaling). CO5:Adversarial search (Minimax, Alpha-Beta pruning) ML algorithms: Classification
Techniques(ID3,CART) ML algorithms: Classification Techniques (ADABOOST) Introduction to RNN.
Text Books :Text Books :1. Russel and Norvig, ‘Artificial Intelligence’, third edition, Pearson Education, PHI,
(2015) 2.Elaine Rich & Kevin Knight, ‘Artificial Intelligence’, 3nd Edition, Tata McGrawHill Edition,
Reprint(2008) 3. Data science Handbook — Field cady- wiley
Reference Books :1. Patrick Henry Winston, ‘Artificial Intelligence’, Pearson Education (2003) 2. G.Luger,
W. A. Stubblefield, "Artificial Intelligence", Third Edition, Addison- Wesley,(2007) 3. William F.Clocksin,
Christopher S. Mellish-Programming in Prolog-Springer (2003) 4. Introducing Data science byDavy cielen,
Arno D.B.Meysmen, Mohamed Ali
Web Links :1. https://www.linkedin.com/learning/artificial-intelligencefoundations-machine-learning 2
.https://www.coursera.org/learn/python-for-datavisualization#"
Course Rationale :Al for Data Science is about the discipline needed to analyze high quality software datathat
can be understood, maintained and adapted over long period of time by many different people. In order,to
enable the student to analyze quality data, the course provides an overview of the Artificial Intelligenceand
Data Science discipline, introducing the fundamental principles and methods in AI and Data Scienceand
highlights the need for an engineering approach to analyze the problem by visualization. It provides
anopportunity for the students to gain knowledge of industrial approach to real- world projects and
importanceof team environment. The course covers various methods and models to train the student to learn
theprocess classification, partitioning and clustering and design models based on the analysis.
Course Objectives :The emphasis of the course is on study of Artificial Intelligence ,data and its
type,understanding the data comparisons by visualization techniques.
about:blank 1/33
13/12/2023, 09:36 about:blank
COURSE OUTCOMES (COs):

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
Make use of the concepts of intelligent agents and various search
CO1 PO1,PO2,PSO2 3
algorithms, to solve real-world problems.
Apply the satisfaction problems, discover knowledge using logic,
CO2 and analyse reasoning techniques to make informed decisions in PO2,PO3,PSO1 3
uncertain environments.
Classifiy various Machine Learning algorithms, Examine CNN
CO3 PSO2,PO1,PO3 4
and Deep Learning techniques
Contrast various Data Visualization Techniques, Analyse Data
CO4 PSO2,PO3,PO5 4
analytics techniques, Discover the insights from complex datasets.
Evaluate performance measures, different types of data analytics
CO5 including descriptive, diagnostic, predictive and prescriptive PSO1,PO2,PO3 5
analytics
CO6 Examine AI for Data science lab in the python environment. PO3,PO5,PSO2 5

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-2 COI-3 COI-4 COI-5
No. BTL
Btl-2
Btl-3
Understand
Apply various search
CO1 3 fundamental AI
algorithms to solve
concepts including
real-world problems
intelligent agents
Btl-3
Btl-2
Solve reasoning Btl-4
Describe constraint
techniques to make Analyze the local and
CO2 3 satisfaction problems,
informed decisions in adversarial search for
represent knowledge
uncertain Optimal decisions
using logic
environments
Btl-2
Understand various
Btl-3
machine learning Btl-4
Apply different ANN
CO3 4 algorithms, including Analyze data and
and deep learning
artificial neural make predictions
techniques
networks and deep
learning techniques
Btl-3
Btl-2 Btl-4
Illustrate various
Summarize various Analyze the insights
CO4 4 analytics techniques
data science effectively from
and data visualization
algorithms complex datasets.
methods
Btl-5
Btl-2 Btl-3 Btl-4
Real time
CO5 5 Understand Advance ML Analyse Recurrent
applications by using
Adverserial search concepts Neural network
complex datasets
Btl-5
Develop AI for Data
CO6 5
Science lab in the
python environment
about:blank 2/33
13/12/2023, 09:36 about:blank
PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po
Program Outcome
No.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals, and
PO1
an engineering specialization to the solution of complex engineering problems.
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural sciences and
engineering sciences
Design/Development of Solutions: Design solutions for complex engineering problems and design
PO3 system components or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental considerations
Conduct Investigations of Complex Problems:Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information to
PO4
provide valid conclusions for complex problems that cannot be solved by straightforward application of
knowledge, theories and techniques applicable to the engineering discipline.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modelling to complex engineering activities with an
understanding of the limitations.
The Engineer and Society:Apply reasoning informed by the contextual knowledge to assess societal,
PO6 health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.
Environment and Sustainability:Understand the impact of the professional engineering solutions in
PO7 societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
PO8
engineering practice
Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse
PO9
teams, and in multidisciplinary settings.
Communication:Communicate effectively on complex engineering activities with the engineering
PO10 community and with society at large, such as, being able to comprehend and write effective reports and
design documentation, make effective presentations, and give and receive clear instructions
Project Management and Finance: Demonstrate knowledge and understanding of the engineering and
PO11 management principles and apply these to one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments.
Life-long Learning: Recognize the need for, and have the preparation and ability to engage in
PO12
independent and lifelong learning in the broadest context of technological change.
PSO1 An ability to design and develop software projects as well as Analyze and test user requirements.
PSO2 An Ability to gain working Knowledge on emerging software tools and technologies.

Lecture Course DELIVERY Plan:

Teaching-
Book No[CH No]
Sess.No. CO COI Topic Learning EvaluationComponents
[Page No]
Methods

COI- End Semester

1 CO1 Handout Text Book 1 Chalk,PPT,Talk
2 Exam,SEM-EXAM1

COI- Introduction to AI and T BOOK[1],CH2.1- End Semester

2 CO1 Chalk,PPT,Talk
2 Data Science 2.3, Pageno 30-49 Exam,SEM-EXAM1

COI- T BOOK[1],CH2.1- End Semester

3 CO1 Intelligent Agents Chalk,PPT,Talk
3 2.3, Pageno 30-49 Exam,SEM-EXAM1

about:blank 3/33
13/12/2023, 09:36 about:blank

Teaching-
Book No[CH No]
Sess.No. CO COI Topic Learning EvaluationComponents
[Page No]
Methods

Overview of various AI
and Data Science
applications across
domains (Healthcare,
COI- T BOOK[1],CH2.1- End Semester
4 CO1 agriculture, robotics, Chalk,PPT,Talk
2 2.3, Pageno 30-49 Exam,SEM-EXAM1
automation, law,
medicine, pharmacy,
and business
management)

Introduction to
Heuristics, Heuristic
COI- T BOOK [1],CH 2.1- End Semester
5 CO1 search techniques: A* Chalk,PPT,Talk
2 2.3, Page no 30-49 Exam,SEM-EXAM1
Search, Best-First
Search

ALM,Continuous
Evaluation -Project,End
Semester Exam,Global
Heuristic search
COI- T BOOK [1],CH 2.1- Challenges,Leaderboard
6 CO1 techniques: Hill Chalk,PPT,Talk
2 2.3, Page no 30-49 ranking for Global
Climbing
Challenges,MOOCs
Certification,MOOCs
Review,SEM-EXAM1

Introduction to
Constraint Satisfaction
COI- Problems (CSP), "T BOOK [1], CH1.3- End Semester
7 CO1 Chalk,PPT,Talk
3 Techniques for solving 1.6, Page no 12-23" Exam,SEM-EXAM1
CSP (Backtracking,
Forward Checking)

Knowledge
representation
COI- techniques (Semantic T BOOK [1],CH 2.1- End Semester
8 CO1 Chalk,PPT,Talk
2 Networks, Frames, 2.3, Page no 30-49 Exam,SEM-EXAM1
Propositional and First-
Order Logic)

ALM,Continuous
Evaluation -Project,End
Reasoning techniques
Semester Exam,Lab
COI- (Forward and T BOOK [1], CH1.3-
9 CO1 Chalk,PPT,Talk Weekly
3 Backward Chaining, 1.6, Page no 12-23
exercise,MOOCs
Resolution)
Certification,MOOCs
Review,SEM-EXAM1

Probabilistic Reasoning
COI- T BOOK [1], CH1.3- End Semester
10 CO2 for AI, Introduction to Chalk,PPT,Talk
2 1.6, Page no 12-23 Exam,SEM-EXAM1
Probability Theory

11 CO2 COI- Introduction to T BOOK [1], CH1.3- Chalk,PPT,Talk End Semester

2 Bayesian Networks, 1.6, Page no 12-23 Exam,SEM-EXAM1
about:blank 4/33
13/12/2023, 09:36 about:blank

Teaching-
Book No[CH No]
Sess.No. CO COI Topic Learning EvaluationComponents
[Page No]
Methods
Inference in Bayesian
Networks (Exact and
Approximate
Inference)

Introduction to
COI- Machine Learning T BOOK [1], CH1.3- End Semester
12 CO2 Chalk,PPT,Talk
3 (ML), preprocess and 1.6, Page no 12-23 Exam,SEM-EXAM1
analyze data

Types of Machine
Learning (Supervised,
COI- T BOOK [1], CH1.3- End Semester
13 CO2 Unsupervised, and Chalk,PPT,Talk
4 1.6, Page no 12-23 Exam,SEM-EXAM1
Reinforcement
Learning)

"T BOOK [1], CH

COI- Concept learning End Semester
14 CO2 2.4,2.5, Page no 50- Chalk,PPT,Talk
2 search Exam,SEM-EXAM1
55"

ALM,Continuous
Evaluation -Project,End
Semester Exam,Global
Find S Algorithm, "T BOOK [1], CH
COI- Challenges,Leaderboard
15 CO2 Candidate Elimination 2.4,2.5, Page no 50- Chalk,PPT,Talk
3 ranking for Global
Algorithm (CEA) 55"
Challenges,MOOCs
Certification,MOOCs
Review,SEM-EXAM1

ALM,Continuous
"T BOOK [1], CH Evaluation -Project,End
COI-
16 CO2 evaluating a hypothesis 2.4,2.5, Page no 56- Chalk,PPT,Talk Semester Exam,MOOCs
3
61" Certification,MOOCs
Review,SEM-EXAM1

probably learning
"T BOOK [1], CH
COI- approximately correct End Semester
17 CO2 2.6,2.8, Page no 56- Chalk,PPT,Talk
4 hypothesis, and Exam,SEM-EXAM1
61"
function approximation

"T BOOK [1],

COI- Introduction to ANN, End Semester
18 CO3 CH3.5.1-3.5.3, Page Chalk,PPT,Talk
2 Perceptron Exam,SEM-EXAM2
no81-84

"T BOOK [1],

COI- End Semester
19 CO3 Multi-layer Perceptron CH3.5.1-3.5.3, Page Chalk,PPT,Talk
3 Exam,SEM-EXAM2
no81-84

"T BOOK [1],

COI- End Semester
20 CO3 Backpropagation CH3.5.1-3.5.3, Page Chalk,PPT,Talk
4 Exam,SEM-EXAM2
no81-84

21 CO3 COI- Backpropagation "T BOOK [1], Chalk,PPT,Talk End Semester

about:blank 5/33
13/12/2023, 09:36 about:blank

Teaching-
Book No[CH No]
Sess.No. CO COI Topic Learning EvaluationComponents
[Page No]
Methods
3 CH3.5.1-3.5.3, Page Exam,SEM-EXAM2
no81-84

ALM,Continuous
Evaluation -Project,End
Semester Exam,Global
COI- Introduction to CNN T BOOK [3],CH Challenges,Leaderboard
22 CO3 Chalk,PPT,Talk
4 and DL 8,Page no 165-170 ranking for Global
Challenges,MOOCs
Certification,MOOCs
Review,SEM-EXAM2

ALM,Continuous
Applications of CNN in Evaluation -Project,End
COI- T BOOK [3],CH
23 CO3 Image Recognition and Chalk,PPT,Talk Semester Exam,MOOCs
3 8,Page no 165-170
Processing Certification,MOOCs
Review,SEM-EXAM2

Applications of CNN in
COI- T BOOK [3],CH End Semester
24 CO3 Image Recognition and Chalk,PPT,Talk
3 8,Page no 165-170 Exam,SEM-EXAM2
Processing

Data Science, Types of

data (Structured,
Unstructured, and "T
COI- End Semester
25 CO4 Semi- BOOK[1],CH7.3,Page Chalk,PPT,Talk
4 Exam,SEM-EXAM2
structured)Applications no195-198
of CNN in Image
Recognition

Classification of Data
Science (Descriptive,
COI- T BOOK[1],CH End Semester
26 CO4 Diagnostic, Predictive, Chalk,PPT,Talk
4 7.3,Page no195-198 Exam,SEM-EXAM2
and Prescriptive
Analytics)

k-Nearest Neighbors,
COI- k-Means Clustering, "T BOOK [1], CH1.3- End Semester
27 CO4 Chalk,PPT,Talk
4 Principal Component 1.6, Page no 12-23" Exam,SEM-EXAM2
Analysis

COI- Introduction to Natural "T BOOK [1],CH End Semester

28 CO4 Chalk,PPT,Talk
2 Language Processing 7.3,Page no 195-198 Exam,SEM-EXAM2

COI- "T BOOK [1], CH End Semester

29 CO4 Text Analytics Chalk,PPT,Talk
3 7.3,Page no 195- 198" Exam,SEM-EXAM2

"T BOOK[1],
COI- End Semester
30 CO4 Regression techniques CH7.3,Pageno 195- Chalk,PPT,Talk
4 Exam,SEM-EXAM2
198"

31 CO4 COI- Introduction to Data "T BOOK[1], Chalk,PPT,Talk ALM,Continuous

3 Visualization and its Evaluation -Project,End

about:blank 6/33
13/12/2023, 09:36 about:blank

Teaching-
Book No[CH No]
Sess.No. CO COI Topic Learning EvaluationComponents
[Page No]
Methods
importance,Popular CH7.3,Pageno 195- Semester Exam,Global
data visualization tools 198" Challenges,Leaderboard
and libraries ranking for Global
Challenges,MOOCs
Certification,MOOCs
Review,SEM-EXAM2

ALM,Continuous
Evaluation -Project,End
Data preprocessing
Semester Exam,Lab
COI- techniques (Cleaning, T BOOK [1],CH 2.1-
32 CO4 Chalk,PPT,Talk Weekly
3 Transformation, and 2.3, Page no 30-49
exercise,MOOCs
Feature Scaling)
Certification,MOOCs
Review,SEM-EXAM2

Adversarial search
COI- T BOOK [1], CH2.1-
33 CO5 (Minimax, Alpha-Beta Chalk,PPT,Talk End Semester Exam
4 2.3, Page no30-49
pruning)

ML algorithms:
COI- T BOOK [1], CH2.1-
34 CO5 Classification Chalk,PPT,Talk End Semester Exam
5 2.3, Page no30-49
Techniques(ID3,CART)

ML algorithms:
"T BOOK [1], CH
COI- Classification
35 CO5 2.1-2.3, Page no 30- Chalk,PPT,Talk End Semester Exam
2 Techniques
49"
(ADABOOST)

"T BOOK [1], CH

COI-
36 CO5 Introduction to RNN 2.1-2.3, Page no 30- Chalk,PPT,Talk End Semester Exam
3
49"

ALM,Continuous
Evaluation -Project,End
Semester Exam,Global
"T BOOK [1], CH
COI- Challenges,Leaderboard
37 CO5 Introduction to RNN 2.1-2.3, Page no 30- Chalk,PPT,Talk
3 ranking for Global
49"
Challenges,MOOCs
Certification,MOOCs
Review

ALM,Continuous
Evaluation -Project,End
"T BOOK [1], CH Semester Exam,Lab
COI- Review of the entire
38 CO5 2.1-2.3, Page no 30- Chalk,PPT,Talk Weekly
4 course content
49" exercise,MOOCs
Certification,MOOCs
Review

Presentation and "T BOOK [1], CH

COI-
39 CO5 evaluation of group 2.1-2.3, Page no 30- Chalk,PPT,Talk End Semester Exam
4
projects 49"

about:blank 7/33
13/12/2023, 09:36 about:blank

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Handout discussion

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
--- NOT
30 Overview of Handouts 3 PPT APPLICABLE
---
--- NOT
10 Question and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 2

Session Outcome: 1 Introduction to AI and Data Science

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
--- NOT
30 Introduction to AI and Data Science 2 PPT APPLICABLE
---
--- NOT
Case Study: Robotics and Automation, Question and
10 2 PPT APPLICABLE
Answering
---

SESSION NUMBER : 3

Session Outcome: 1 Intelligent Agents

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
--- NOT
30 Intelligent Agents 3 PPT APPLICABLE
---
--- NOT
10 Question and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 4

Session Outcome: 1 Overview of various AI and Data Science applications across domains

about:blank 8/33
13/12/2023, 09:36 about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
--- NOT
Overview of various AI and Data Science applications
30 2 PPT APPLICABLE
across domains
---
--- NOT
10 Case Study: AI in Healthcare, Question and Answers 2 PPT APPLICABLE
---

SESSION NUMBER : 5

Session Outcome: 1 Introduction to Heuristics, Heuristic search techniques: A* Search, Best-First Search

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
--- NOT
Introduction to Heuristics, Heuristic search techniques: A*
30 2 PPT APPLICABLE
Search, Best-First Search
---
--- NOT
10 Questions and Answers 2 PPT APPLICABLE
---

SESSION NUMBER : 6

Session Outcome: 1 Heuristic search techniques: Hill Climbing

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
One minute
30 Heuristic search techniques: Hill Climbing 2 PPT
paper
--- NOT
10 Case Study: AI in Law, Questions and Answers 2 PPT APPLICABLE
---

SESSION NUMBER : 7

Session Outcome: 1 Introduction to Constraint Satisfaction Problems (CSP), Techniques for solving CSP
(Backtracking, Forward Checking)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
10 Attendance 3 PPT --- NOT
APPLICABLE

about:blank 9/33
13/12/2023, 09:36 about:blank

---
Introduction to Constraint Satisfaction Problems (CSP), --- NOT
30 Techniques for solving CSP (Backtracking, Forward 3 PPT APPLICABLE
Checking) ---
--- NOT
10 Questions and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 8

Session Outcome: 1 Knowledge representation techniques (Semantic Networks, Frames, Propositional and
First-Order Logic)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
--- NOT
Knowledge representation techniques (Semantic Networks,
30 2 PPT APPLICABLE
Frames, Propositional and First-Order Logic)
---
--- NOT
Case Study: AI in Business Management, Question and
10 2 PPT APPLICABLE
Answers
---

SESSION NUMBER : 9

Session Outcome: 1 Reasoning techniques (Forward and Backward Chaining, Resolution)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
Reasoning techniques (Forward and Backward Chaining, Brain storming
30 3 PPT
Resolution) session
--- NOT
10 Question and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 10

Session Outcome: 2 Probabilistic Reasoning for AI, Introduction to Probability Theory

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
--- NOT
Probabilistic Reasoning for AI, Introduction to Probability
30 2 PPT APPLICABLE
Theory
---

about:blank 10/33
13/12/2023, 09:36 about:blank

--- NOT
10 Case Study: AI in Medicine , Questions and Answers 2 PPT APPLICABLE
---

SESSION NUMBER : 11

Session Outcome: 2 Introduction to Bayesian Networks, Inference in Bayesian Networks (Exact and
Approximate Inference)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
--- NOT
Introduction to Bayesian Networks, Inference in Bayesian
30 2 PPT APPLICABLE
Networks
---
--- NOT
10 Question and Answers 2 PPT APPLICABLE
---

SESSION NUMBER : 12

Session Outcome: 2 Introduction to Machine Learning (ML), preprocess and analyze data

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
--- NOT
Introduction to Machine Learning (ML), preprocess and
30 3 PPT APPLICABLE
analyze data
---
--- NOT
10 Case Study: AI in Pharmacy, Question and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 13

Session Outcome: 2 Types of Machine Learning (Supervised, Unsupervised, and Reinforcement Learning)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
--- NOT
30 Types of Machine Learning 4 PPT APPLICABLE
---
--- NOT
10 Question and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 14
about:blank 11/33
13/12/2023, 09:36 about:blank

Session Outcome: 1 Concept learning search

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
--- NOT
Concept learning search, Case Study: AI in Agriculture
30 2 PPT APPLICABLE
(Part 2)
---
--- NOT
10 Questions and Answers 2 PPT APPLICABLE
---

SESSION NUMBER : 15

Session Outcome: 1 Find S Algorithm, Candidate Elimination Algorithm (CEA)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
Group
30 Find S Algorithm, Candidate Elimination Algorithm (CEA) 3 PPT
Discussion
--- NOT
10 Questions and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 16

Session Outcome: 1 evaluating a hypothesis

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 1 PPT APPLICABLE
---
Quiz/Test
30 evaluating a hypothesis 3 PPT
Questions
--- NOT
Case Study: Robotics and Automation (Part 2), Questions
10 3 PPT APPLICABLE
and Answers
---

SESSION NUMBER : 17

Session Outcome: 1 probably learning approximately correct hypothesis, and function approximation

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
10 Attendance 4 PPT --- NOT
APPLICABLE

about:blank 12/33
13/12/2023, 09:36 about:blank

---
--- NOT
probably learning approximately correct hypothesis, and
30 4 PPT APPLICABLE
function approximation
---
--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 18

Session Outcome: 1 Introduction to ANN, Perceptron

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
--- NOT
30 Introduction to ANN, Perceptron 2 PPT APPLICABLE
---
--- NOT
10 Case Study: AI in Law (Part 2), Question and Answers 2 PPT APPLICABLE
---

SESSION NUMBER : 19

Session Outcome: 1 Multi-layer Perceptron

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
--- NOT
30 Multi-layer Perceptron 3 PPT APPLICABLE
---
--- NOT
10 Question and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 20

Session Outcome: 1 Backpropagation

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
--- NOT
30 Backpropagation 4 PPT APPLICABLE
---

about:blank 13/33
13/12/2023, 09:36 about:blank

--- NOT
10 Case Study: AI in Medicine (Part 2), Question and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 21

Session Outcome: 1 Backpropagation

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
--- NOT
30 Backpropagation 3 PPT APPLICABLE
---
--- NOT
10 Question and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 22

Session Outcome: 1 Introduction to CNN and DL

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
30 Introduction to CNN and DL 4 PPT Case Study
--- NOT
Case Study: AI in Healthcare (Part 2), Question and
10 4 PPT APPLICABLE
Answers
---

SESSION NUMBER : 23

Session Outcome: 1 Applications of CNN in Image Recognition and Processing

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
30 Applications of CNN in Image Recognition and Processing 3 PPT Fish Bowl
--- NOT
10 Question and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 24

Session Outcome: 1 Applications of CNN in Image Recognition and Processing

Time(min) Topic BTL Teaching- Active

Learning Learning
about:blank 14/33
13/12/2023, 09:36 about:blank

Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
--- NOT
30 Applications of CNN in Image Recognition and Processing 3 PPT APPLICABLE
---
--- NOT
Case Study: AI in Pharmacy (Part 2) , Question and
10 3 PPT APPLICABLE
Answers
---

SESSION NUMBER : 25

Session Outcome: 1 Data Science, Types of data (Structured, Unstructured, and Semi-structured)Applications
of CNN in Image Recognition

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
Data Science, Types of data (Structured, Unstructured, and --- NOT
30 Semi-structured)Applications of CNN in Image 4 PPT APPLICABLE
Recognition ---
--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 26

Session Outcome: 1 Classification of Data Science (Descriptive, Diagnostic, Predictive, and Prescriptive
Analytics)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
--- NOT
Classification of Data Science (Descriptive, Diagnostic,
30 4 PPT APPLICABLE
Predictive, and Prescriptive Analytics)
---
--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 27

Session Outcome: 1 k-Nearest Neighbors, k-Means Clustering, Principal Component Analysis

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
10 Attendance 4 PPT --- NOT
APPLICABLE

about:blank 15/33
13/12/2023, 09:36 about:blank

---
--- NOT
k-Nearest Neighbors, k-Means Clustering, Principal
30 4 PPT APPLICABLE
Component Analysis
---
--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 28

Session Outcome: 1 Introduction to Natural Language Processing

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
--- NOT
30 Introduction to Natural Language Processing 4 PPT APPLICABLE
---
--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 29

Session Outcome: 1 Text Analytics

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
--- NOT
30 Text Analytics 4 PPT APPLICABLE
---
--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 30

Session Outcome: 1 Regression techniques

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
--- NOT
30 Regression techniques 4 PPT APPLICABLE
---

about:blank 16/33
13/12/2023, 09:36 about:blank

--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 31

Session Outcome: 1 Introduction to Data Visualization and its importance,Popular data visualization tools and
libraries

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
Introduction to Data Visualization and its
30 4 PPT Role playing
importance,Popular data visualization tools and libraries
--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 32

Session Outcome: 1 Data preprocessing techniques

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
30 Data preprocessing techniques 3 PPT Debate
--- NOT
10 Question and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 33

Session Outcome: 1 Adversarial search (Minimax, Alpha-Beta pruning)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
--- NOT
30 Adversarial search (Minimax, Alpha-Beta pruning) 4 PPT APPLICABLE
---
--- NOT
10 Question and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 34

Session Outcome: 1 ML algorithms: Classification Techniques(ID3,CART)

about:blank 17/33
13/12/2023, 09:36 about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 5 PPT APPLICABLE
---
--- NOT
30 ML algorithms: Classification Techniques(ID3,CART) 5 PPT APPLICABLE
---
--- NOT
10 Question And Answers 5 PPT APPLICABLE
---

SESSION NUMBER : 35

Session Outcome: 1 Adversarial search (Minimax, Alpha-Beta pruning)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 2 PPT APPLICABLE
---
--- NOT
30 Adversarial search (Minimax, Alpha-Beta pruning) 2 PPT APPLICABLE
---
--- NOT
10 Questions and Answers 2 PPT APPLICABLE
---

SESSION NUMBER : 36

Session Outcome: 1 ML algorithms: Classification Techniques(ID3,CART)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 3 PPT APPLICABLE
---
--- NOT
30 ML algorithms: Classification Techniques(ID3,CART) 3 PPT APPLICABLE
---
--- NOT
10 Questions and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 37

Session Outcome: 1 ML algorithms: Classification Techniques (ADABOOST)

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
10 Attendance 3 PPT --- NOT
APPLICABLE

about:blank 18/33
13/12/2023, 09:36 about:blank

---
30 ML algorithms: Classification Techniques (ADABOOST) 3 PPT Case Study
--- NOT
10 Questions and Answers 3 PPT APPLICABLE
---

SESSION NUMBER : 38

Session Outcome: 1 Introduction to RNN

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
Just in-time
30 Introduction to RNN 4 PPT
teaching
--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

SESSION NUMBER : 39

Session Outcome: 1 Introduction to RNN

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 Attendance 4 PPT APPLICABLE
---
--- NOT
30 Introduction to RNN 4 PPT APPLICABLE
---
--- NOT
10 Questions and Answers 4 PPT APPLICABLE
---

Tutorial Course DELIVERY Plan: NO Delivery Plan Exists

Tutorial Session wise Teaching – Learning Plan

No Session Plans Exists

Practical Course DELIVERY Plan:

Tutorial
Session Topics CO-Mapping
no

Implement a simple reflex agent for a vacuum cleaner. Description: Students

will create a simple reflex agent to clean a grid-based environment. The agent
1 CO6
will perceive the status of the current cell and decide whether to clean, move,
or do nothing.

about:blank 19/33
13/12/2023, 09:36 about:blank

Tutorial
Session Topics CO-Mapping
no

Implement Best-First Search (BFS) to solve a maze problem. Description:

2 Students will implement the BFS algorithm to find the shortest path from the CO6
start to the goal position in a grid-based maze.

Implement A* search algorithm to solve the 8-puzzle problem. Description:

3 Students will implement the A* search algorithm to solve the 8-puzzle problem CO6
by finding the shortest sequence of moves to reach the goal state.

Implement the Hill Climbing algorithm to solve the Traveling Salesman

Problem (TSP). Description: Students will implement the Hill Climbing
4 CO6
algorithm to find an approximately optimal solution to the TSP, visiting all
cities and returning to the starting point.

Constraint Satisfaction Problems Lab Exercise: Implement the backtracking

algorithm to solve the N-Queens problem. Description: Students will
5 implement the backtracking algorithm to find a solution for the N-Queens CO6
problem, where N queens are placed on an NxN chessboard so that no two
queens threaten each other.

Create a knowledge base using first-order logic for a family tree. Description:
Students will create a knowledge base using first-order logic to represent facts
6 CO6
about a family tree, such as parent, sibling, and grandparent relationships, and
write a function to answer queries about these relationships.

Implement the Bayesian network inference algorithm. Description: Students

will implement the Bayesian network inference algorithm to compute the
7 CO6
probability of a specific event, given a set of evidence, a Bayesian network
structure, and conditional probability tables.

Implement the k-Nearest Neighbors (kNN) algorithm for classification.

Description: Students will implement the kNN algorithm to classify a set of
8 CO6
data points based on their features and labels and predict the label for a new
data point.

Implement a simple feedforward neural network with one hidden layer for
classification. Description: Students will implement a simple feedforward
9 CO6
neural network with one hidden layer to classify a set of data points based on
their features and labels.

Construct a Python Program to Show various Data Visulaization Techniques

10 CO6
using Exsisting Well Known Dataset

Implement a simple CNN to classify images. Description: Students will

11 implement a simple CNN to classify a set of images based on their labels, using CO6
a small image dataset.

Construct a CNN Model for Medical Image Classification. Consider Breast

12 CO6
Cancer dataset for Classification

Implement the Decision Tree algorithm for classification. Description: Students

13 will implement the Decision Tree algorithm to classify a set of data points CO6
based on their features and labels.
about:blank 20/33
13/12/2023, 09:36 about:blank

Tutorial
Session Topics CO-Mapping
no

Implement the k-Means clustering algorithm. Description: Students will

14 implement the k-Means clustering algorithm to group a set of data points into k CO6
clusters based on their features.

15 Implementation of game trees using Alpha Beta prunig CO6

Implemention of ADABOOST, CART classification techniques using a real

16 CO6
datasets

17 Implementation of text classification using RNN. CO6

18 Implementation of Data Visualization Techniques using Tableau software. CO6

Implement a time series forecasting model. Description: Students will

19 implement a time series forecasting model (e.g., ARIMA) to predict future CO6
values of a given time series using a historical dataset.

Implement a data preprocessing pipeline. Description: Students will implement

a data preprocessing pipeline to clean, transform, and prepare a raw dataset for
20 CO6
machine learning. The pipeline should handle missing values, inconsistencies,
and other issues.

Practical Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Students will create a simple reflex agent to clean a grid-based environment. The agent
will perceive the status of the current cell and decide whether to clean, move, or do nothing.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement a simple reflex agent for a vacuum cleaner.
Description: Students will create a simple reflex agent to --- NOT
30 clean a grid-based environment. The agent will perceive the 3 PPT APPLICABLE
status of the current cell and decide whether to clean, move, ---
or do nothing.
--- NOT
10 Question and Answer 2 LTC APPLICABLE
---

SESSION NUMBER : 2

Session Outcome: 1 Implement Breadth-First Search (BFS) to solve a maze problem. Description: Students
will implement the BFS algorithm to find the shortest path from the start to the goal position in a grid-based
maze.

about:blank 21/33
13/12/2023, 09:36 about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement Breadth-First Search (BFS) to solve a maze
--- NOT
problem. Description: Students will implement the BFS
30 4 PPT APPLICABLE
algorithm to find the shortest path from the start to the goal
---
position in a grid-based maze.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 3

Session Outcome: 1 Students will implement the A* search algorithm to solve the 8-puzzle problem by finding
the shortest sequence of moves to reach the goal state.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement A* search algorithm to solve the 8-puzzle
--- NOT
problem. Description: Students will implement the A*
30 4 PPT APPLICABLE
search algorithm to solve the 8-puzzle problem by finding
---
the shortest sequence of moves to reach the goal state.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 4

Session Outcome: 1 Implement the Hill CliStudents will implement the Hill Climbing algorithm to find an
approximately optimal solution to the TSP, visiting all cities and returning to the starting point.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement the Hill Climbing algorithm to solve the
Traveling Salesman Problem (TSP). Description: Students --- NOT
30 will implement the Hill Climbing algorithm to find an 4 PPT APPLICABLE
approximately optimal solution to the TSP, visiting all ---
cities and returning to the starting point.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 5

Session Outcome: 1 ImplementStudents will implement the backtracking algorithm to find a solution for the N-
Queens problem, where N queens are placed on an NxN chessboard so that no two queens threaten each other.
about:blank 22/33
13/12/2023, 09:36 about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Constraint Satisfaction Problems Lab Exercise: Implement
the backtracking algorithm to solve the N-Queens problem.
--- NOT
Description: Students will implement the backtracking
30 4 PPT APPLICABLE
algorithm to find a solution for the N-Queens problem,
---
where N queens are placed on an NxN chessboard so that
no two queens threaten each other.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 6

Session Outcome: 1 Student will create a knowledge base using first-order logic to represent facts about a
family tree

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Create a knowledge base using first-order logic for a family
tree. Description: Students will create a knowledge base --- NOT
30 using first-order logic to represent facts about a family tree, 4 PPT APPLICABLE
such as parent, sibling, and grandparent relationships, and ---
write a function to answer queries about these relationships.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 7

Session Outcome: 1 Bayesian network inference algorithm to compute the probability of a specific event, given
a set of evidence, a Bayesian network structure, and conditional probability tables.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement the Bayesian network inference algorithm.
Description: Students will implement the Bayesian network --- NOT
30 inference algorithm to compute the probability of a specific 4 PPT APPLICABLE
event, given a set of evidence, a Bayesian network ---
structure, and conditional probability tables.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 8
about:blank 23/33
13/12/2023, 09:36 about:blank

Session Outcome: 1 kNN Students will implement the kNN algorithm to classify a set of data points based on
their features and labels and predict the label for a new data point.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement the k-Nearest Neighbors (kNN) algorithm for
classification. Description: Students will implement the --- NOT
30 kNN algorithm to classify a set of data points based on 4 PPT APPLICABLE
their features and labels and predict the label for a new data ---
point.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 9

Session Outcome: 1 Implement a simplStudents will implement a simple feedforward neural network with one
hidden layer to classify a set of data points based on their features and labels.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement a simple feedforward neural network with one
hidden layer for classification. Description: Students will --- NOT
30 implement a simple feedforward neural network with one 4 PPT APPLICABLE
hidden layer to classify a set of data points based on their ---
features and labels.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 10

Session Outcome: 1 Construct a Python Program to Show various Data Visulaization Techniques using
Exsisting Well Known Dataset

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Construct a Python Program to Show various Data --- NOT
30 Visulaization Techniques using Exsisting Well Known 4 PPT APPLICABLE
Dataset ---
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 11
about:blank 24/33
13/12/2023, 09:36 about:blank

Session Outcome: 1 Implement a simple CNN to classify images. Description: Students will implement a
simple CNN to classify a set of images based on their labels, using a small image dataset.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement a simple CNN to classify images. Description: --- NOT
30 Students will implement a simple CNN to classify a set of 4 PPT APPLICABLE
images based on their labels, using a small image dataset. ---
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 12

Session Outcome: 1 Construct a CNN Model for Medical Image Classification. Consider Breast Cancer dataset
for Classification

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
--- NOT
Construct a CNN Model for Medical Image Classification.
30 4 PPT APPLICABLE
Consider Breast Cancer dataset for Classification
---
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 13

Session Outcome: 1 Implement the Decision Tree algorithm for classification. Description: Students will
implement the Decision Tree algorithm to classify a set of data points based on their features and labels.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement the Decision Tree algorithm for classification.
--- NOT
Description: Students will implement the Decision Tree
30 4 PPT APPLICABLE
algorithm to classify a set of data points based on their
---
features and labels.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 14

Session Outcome: 1 Implement the k-Means clustering algorithm. Description: Students will implement the k-
Means clustering algorithm to group a set of data points into k clusters based on their features.
about:blank 25/33
13/12/2023, 09:36 about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement the k-Means clustering algorithm. Description:
--- NOT
Students will implement the k-Means clustering algorithm
30 4 PPT APPLICABLE
to group a set of data points into k clusters based on their
---
features.
--- NOT
10 Question and Answer 4 PPT APPLICABLE
---

SESSION NUMBER : 15

Session Outcome: 1 Implementation of game trees using Alpha Beta prunig

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
--- NOT
30 Implementation of game trees using Alpha Beta prunig 4 PPT APPLICABLE
---
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 16

Session Outcome: 1 Implemention of ADABOOST, CART classification techniques using a real datasets

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
--- NOT
Implemention of ADABOOST, CART classification
30 4 PPT APPLICABLE
techniques using a real datasets
---
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 17

Session Outcome: 1 Implementation of text classification using RNN.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods

about:blank 26/33
13/12/2023, 09:36 about:blank

--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
--- NOT
30 Implementation of text classification using RNN. 4 PPT APPLICABLE
---
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 18

Session Outcome: 1 Implementation of Data Visualization Techniques using Tableau software.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
--- NOT
Implementation of Data Visualization Techniques using
30 4 PPT APPLICABLE
Tableau software.
---
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 19

Session Outcome: 1 Students will implement a time series forecasting model (e.g., ARIMA) to predict future
values of a given time series using a historical dataset.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
10 ATTENDANCE 2 Talk APPLICABLE
---
Implement a time series forecasting model. Description:
--- NOT
Students will implement a time series forecasting model
30 4 PPT APPLICABLE
(e.g., ARIMA) to predict future values of a given time
---
series using a historical dataset.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

SESSION NUMBER : 20

Session Outcome: 1 Students will implement a data preprocessing pipeline to clean, transform, and prepare a
raw dataset for machine learning. The pipeline should handle missing values, inconsistencies, and other issues.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
10 ATTENDANCE 2 Talk --- NOT
APPLICABLE

about:blank 27/33
13/12/2023, 09:36 about:blank

---
Implement a data preprocessing pipeline. Description:
Students will implement a data preprocessing pipeline to --- NOT
30 clean, transform, and prepare a raw dataset for machine 4 PPT APPLICABLE
learning. The pipeline should handle missing values, ---
inconsistencies, and other issues.
--- NOT
10 Question and Answer 2 PPT APPLICABLE
---

Skilling Course DELIVERY Plan: NO Delivery Plan Exists

Skilling Session wise Teaching – Learning Plan

No Session Plans Exists

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES etc:

Assignment Assignment
Week Topic Details co
Type No

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Mon
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
V- V- V-
V-
S33,V- V- S23,V- S23,V-
Theory -- -- S33,V- --- ---
S34,V- S34 S24,V- S24,V-
S35
S35 S25 S25
Tutorial -- -- -- -- -- -- -- --- ---
V- V-
Tue S21,V- S21,V- V-S31,V- V-S31,V-
S21,V- S21,V- S31,V- S31,V-
Lab -- -- S21,V- S21,V- S31,V- S31,V- -- --- ---
S22,V- S22,V- S32,V- S32,V-
S22,V- S22,V- S32,V-S32 S32,V-S32
S22 S22
Skilling -- -- -- -- -- -- -- --- ---
Wed Theory --- --- --- --- V-S15 V-S15 --- --- ---
Tutorial --- --- --- --- -- -- --- --- ---
Lab --- --- --- --- V-S11,V- V-S11,V- --- --- ---
S11,V- S11,V-
S11,V- S11,V-
S12,V- S12,V-
S12,V- S12,V-
S12,V- S12,V-
S13,V- S13,V-
S13,V- S13,V-

about:blank 28/33
13/12/2023, 09:36 about:blank

S13,V- S13,V-
S14,V- S14,V-
S14,V-S14 S14,V-S14
Skilling --- --- --- --- -- -- --- --- ---
V-S21,V- V-S21,V- V-S31,V- V-S31,V-
Theory --- --- --- --- ---
S22 S22 S32 S32
Tutorial --- --- --- --- -- -- --- -- --
V-S33,V- V-S33,V-
V-S23,V- V-S23,V-
S33,V- S33,V-
S23,V- S23,V-
S33,V- S33,V-
Thu S23,V- S23,V-
S34,V- S34,V-
S24,V- S24,V-
Lab --- --- --- --- --- S34,V- S34,V-
S24,V- S24,V-
S34,V- S34,V-
S24,V- S24,V-
S35,V- S35,V-
S25,V- S25,V-
S35,V- S35,V-
S25,V-S25 S25,V-S25
S35 S35
Skilling --- --- --- --- -- -- --- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Fri
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
V-S11,V- V-S11,V-
S12,V- S12,V-
Theory --- --- --- --- --- --- ---
S13,V- S13,V-
S14 S14
Tutorial --- --- -- -- --- --- --- --- ---
Sat
V- V-
S15,V- S15,V-
Lab --- --- --- --- --- --- ---
S15,V- S15,V-
S15 S15
Skilling --- --- -- -- --- --- --- --- ---
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Sun
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --

REMEDIAL CLASSES:

Supplement course handout, which may perhaps include special lectures and discussions that would be planned,
and schedule notified according

SELF-LEARNING:

Assignments to promote self-learning, survey of contents from multiple sources.

S.no Topics CO ALM References/MOOCS

DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS:

Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and
schedule notified accordingly.

about:blank 29/33
13/12/2023, 09:36 about:blank

Advanced Topics, Additional Reading, Research

S.no CO ALM References/MOOCS
papers and any

EVALUATION PLAN:

Evaluation Evaluation Assessment Duration

Weightage/Marks CO1 CO2 CO3 CO4 CO5 CO6
Type Component Dates (Hours)
End End Semester Weightage 24 4.8 4.8 4.8 4.8 4.8
Semester 180
Exam Max Marks 100 20 20 20 20 20
Summative
Evaluation Lab End Weightage 16 16
Total= 40 Semester 120
% Exam Max Marks 50 50
MOOCs Weightage 4 0.8 0.8 0.8 0.8 0.8
90
Review Max Marks 50 10 10 10 10 10
Global Weightage 4 0.8 0.8 0.8 0.8 0.8
90
In Challenges Max Marks 50 10 10 10 10 10
Semester Weightage 5 1 1 1 1 1
Formative ALM Max Marks 50
90
10 10 10 10 10
Evaluation
Total= 22 Continuous Weightage 5 5
% Evaluation - 120
Lab Exercise Max Marks 50 50
Continuous Weightage 4 0.8 0.8 0.8 0.8 0.8
Evaluation - 90
Project Max Marks 50 10 10 10 10 10
Leaderboard
Weightage 6 1.2 1.2 1.2 1.2 1.2
ranking for
90
Global
Max Marks 50 10 10 10 10 10
Challenges
In Semester in Weightage 10 5 5
90
Semester Exam-I Max Marks 50 25 25
Summative Weightage 10 5 5
Semester in
Evaluation 90
Exam-II Max Marks 50 25 25
Total= 38
% Lab In Weightage 5 5
Semester 120
Exam Max Marks 50 50
MOOCs Weightage 7 1.4 1.4 1.4 1.4 1.4
90
Certification Max Marks 50 10 10 10 10 10

ATTENDANCE POLICY:

Every student is expected to be responsible for regularity of his/her attendance in class rooms and laboratories,
to appear in scheduled tests and examinations and fulfill all other tasks assigned to him/her in every course
In every course, student has to maintain a minimum of 85% attendance to be eligible for appearing in Semester
end examination of the course, for cases of medical issues and other unavoidable circumstances the students will
be condoned if their attendance is between 75% to 85% in every course, subjected to submission of medical
certificates, medical case file and other needful documental proof to the concerned departments

DETENTION POLICY :

about:blank 30/33
13/12/2023, 09:36 about:blank

In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be
eligible for appearing to the Semester End Examination, failing to fulfill these conditions will deem such student
to have been detained in that course.

PLAGIARISM POLICY :

Supplement course handout, which may perhaps include special lectures and discussions

COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:

Supplement course handout, which may perhaps include special lectures and discussions
Chamber
Delivery Sections Chamber Chamber Signature
Consultation
Name of Faculty Component of Consultation Consultation of Course
Timings for
of Faculty Faculty Day (s) Room No: faculty:
each day
Ramesh Kumar
L 34-MA - - - -
Sunkara
Ramesh Kumar 25-C,34-
P - - - -
Sunkara A
Swetha Kolachana P 21-B - - - -
Arumugham Roshini P 31-B - - - -
Tatavarthy Sri L 33-MA - - - -
Tatavarthy Sri P 33-A - - - -
Rai Teja Kanakala P 22-C - - - -
Smritilekha Das P 13-B - - - -
Imran Rasheed P 13-C - - - -
Akhilesh Dubey L 12-MA - - - -
Akhilesh Dubey P 12-A - - - -
Swathi Kailasam L 13-MA - - - -
Swathi Kailasam P 13-A - - - -
Yamuna Devi M M L 35-MA - - - -
Yamuna Devi M M P 35-A - - - -
Sai Durga Vinnakota P 32-C - - - -
21-C,31-
Pradeep Mani P - - - -
C
Venkata Satya Vivek
P 12-B - - - -
Tammineedi
Faraz Hasan P 14-B - - - -
Naresh Mameda P 34-C - - - -
23-
Rafeeq Ahmed L MA,11- - - - -
MA
11-A,23-
Rafeeq Ahmed P - - - -
A
Priyadharshini A P 14-C - - - -
Vikram Dara P 15-B - - - -
Kapil Aggarwal P 15-C - - - -
vuda sreenivasa rao P 13-C - - - -
Natha Deepthi P 14-C - - - -
padamata babu P 24-C - - - -

about:blank 31/33
13/12/2023, 09:36 about:blank

Jasmine Vemula P 32-B - - - -

Naveen Mukkapati P 35-C - - - -
RUDRAMANI 11-B,33-
P - - - -
BHUTIA C
Bala . P 11-C - - - -
32-
Gnanadeepthi Bitra L MA,22- - - - -
MA
12-B,22-
Gnanadeepthi Bitra P - - - -
A,32-A
VENKATA RAO 11-C,33-
P - - - -
MADDUMALA B
BOYAPATI RANI P 23-B - - - -
BALASUBRAMANI 24-B,34-
P - - - -
S B
23-C,33-
Anjaneyulu Gurram P - - - -
C,22-B
25-B,35-
Eswar Patnala P - - - -
B
34-C,24-
KAMBALA KUMAR P - - - -
C
25-
PURNA
L MA,15- - - - -
KASARANENI
MA
PURNA 15-A,25-
P - - - -
KASARANENI A
LAKSHMI
P 25-C - - - -
UPPULURI
24-
RAVISANKAR
L MA,14- - - - -
MALLADI
MA
RAVISANKAR 14-A,24-
P - - - -
MALLADI A
31-
V Rao L MA,21- - - - -
MA
21-A,31-
V Rao P - - - -
A
Chandolu Naga mani P 12-C - - - -

GENERAL INSTRUCTIONS

Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course
Faculty to the class.

NOTICES

Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.

All notices concerning the course will be displayed on the respective Notice Boards.

about:blank 32/33
13/12/2023, 09:36 about:blank

Signature of COURSE COORDINATOR

(Imran Rasheed)

Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of AI&DS

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]

about:blank 33/33