K L Deemed to be University

Department of Electronics and Communication Engineering -- KLVZA

Course Handout
2023-2024, Odd Sem
Course Title :DATA DRIVEN ARTIFICIAL INTELLIGENT SYSTEMS
Course Code :22AD2001R
L-T-P-S Structure : 2-0-2-0
Pre-requisite :
Credits :3
Course Coordinator :Imran Rasheed
Team of Instructors :
Teaching Associates :
Syllabus :Module-1: Foundations of Artificial Intelligence, Intelligent agents, their environments, heuristic search techniques, including A* search
and other best-first search algorithms, Constraint Satisfaction and Reasoning, solve constraint satisfaction problems using backtracking, forward
checking, and other methods, knowledge representation techniques, such as propositional and first order logic. Module-2: Probabilistic reasoning for
AI, including Bayesian networks and inference algorithms, Machine Learning and Neural Networks: machine learning algorithms, such as supervised
and unsupervised learning techniques, and how to pre-process and analyse data, Find S, Concept learning search and Candidate Elimination
Algorithm (CEA), evaluating a hypothesis, probably learning approximately correct hypothesis, and function approximation. Module-3: Artificial
Neural Networks (ANN), including the structure and functionality of feedforward and recurrent networks. Architecture, learning and inference.
Performance measures. Convolutional Neural Networks (CNN) and Deep Learning techniques for tasks like image recognition, natural language
processing, and reinforcement learning. Module-4: Data Science and Analytics: This module focuses on the essentials of data science, including data
classification, analytics, visualization, and processing techniques. various data science algorithms, such as decision trees, k-means clustering, and
principal component analysis, Linear Regression, Logistic Regression, Decision Trees different types of data analytics, including descriptive,
diagnostic, predictive, and prescriptive analytics, and understand how they can be applied to real-world problems.
Text Books :Book 1: Artificial Intelligence Russel and Norvig 3rd Edition Pearson Education, PHI, (2015) Book 2: Artificial Intelligence Elaine Rich
& Kevin Knight 3rd Edition Tata McGraw-Hill Edition, Reprint (2008) Book 3 Data science Handbook Field cady Wiley
Reference Books :Book 1 Artificial Intelligence Patrick Henry Winston 3rd Edition Pearson Education (2003) Book 2 Introducing Data science Davy
Cielen 3rd Edition Manning (2016)
Web Links :https://www.javatpoint.com/artificial-intelligence-ai https://www.w3schools.com/ai/default.asp
https://www.tutorialspoint.com/artificial_intelligence/index.htm https://www.geeksforgeeks.org/introduction-to-data-science/
https://www.w3schools.com/datascience/ds_introduction.asp
MOOCS :MOOCs Resource 1: What is Data Science? https://www.coursera.org/programs/cse-faculty-courses-an6zm/data-science/machine-
learning?productId=r0GnHOZaEees-Q6jQMxlrg&productType=course&showMiniModal=true MOOCs Resource 2: Introduction to Machine
Learning https://www.coursera.org/programs/cse-faculty-courses-an6zm/skills/machine-learning?collectionId=skill~machine-
learning&productId=8BJHzZD_EeiKohJBs5wRGA&productType=course&showMiniModal=true&source=browse MOOCs Resource 3: Introduction
to Artificial Intelligence (AI) https://www.coursera.org/programs/cse-faculty-courses-an6zm/data-science/machine-learning?
productId=mR7MlUaTEemuHQ4HpHozrA&productType=course&showMiniModal=true MOOCs Resource 4: Introduction to Data Science in
Python https://www.coursera.org/programs/cse-faculty-courses-an6zm/browse?
collectionId=&productId=RZ1S0B0MEeacvQ6cODzg5Q&productType=course&query=data+science+course&showMiniModal=true&source=search
Course Rationale :AI for Data Science is about the discipline needed to analyze high quality software data that 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 Intelligence and Data Science discipline, introducing the fundamental principles and methods in AI and Data Science and highlights the
need for an engineering approach to analyze the problem by visualization. It provides an opportunity for the students to gain knowledge of industrial
approach to real- world projects and importance of team environment. The course covers various methods and models to train the student to learn the
process classification, partitioning and clustering and design models based on the analysis.
Course Objectives :The emphasis of this course is to learn about fundamentals of AI concepts including several search algorithms, Machine
Learning and Neural Networks, Deep learning techniques as well as data science algorithms, analytics techniques, and data visualization methods to
process, analyse and effectively communicate insights from complex datasets.

COURSE OUTCOMES (COs):

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

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-2 COI-3 COI-4 COI-5
No. BTL
Btl-2 Btl-3
Understand fundamental AI Apply various search
CO1 3
concepts including intelligent algorithms to solve real-world
agents. problems.
Btl-2 Btl-3 Btl-4
Describe constraint satisfaction Solve reasoning techniques to Analyze the local and
CO2 4
problems, represent knowledge make informed decisions in adversarial search for Optimal
using logic. uncertain environments. decisions.
Btl-2
Understand various machine Btl-3 Btl-4
CO3 4 learning algorithms, including Apply different ANN and deep Analyze data and make
artificial neural networks and learning techniques predictions
deep learning techniques
Btl-3 Btl-4
Btl-2
Illustrate various analytics Analyze the insights
CO4 4 Summarize various data
techniques and data effectively from complex
science algorithms
visualization methods datasets
Btl-5
CO5 5 Develop AI for Data Science
lab in the python environment.

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po
Program Outcome
No.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the
PO1
solution of complex engineering problems.
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering problems reaching substantiated
PO2
conclusions using first principles of mathematics, natural sciences and engineering sciences
Design/Development of Solutions: Design solutions for complex engineering problems and design system components or processes that meet
PO3 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
PO4 and interpretation of data, and synthesis of the information to 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 engineering and IT tools including prediction
PO5
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, health, safety, legal and cultural issues
PO6
and the consequent responsibilities relevant to the professional engineering practice.
Environment and Sustainability:Understand the impact of the professional engineering solutions in societal and environmental contexts, and
PO7
demonstrate the knowledge of, and need for sustainable development
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice
Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary
PO9
settings.
Communication:Communicate effectively on complex engineering activities with the engineering community and with society at large, such
PO10 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 management principles and apply these
PO11
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 independent and lifelong learning in the
PO12
broadest context of technological change.
An ability to solve Electronics engineering problems, using latest hardware and software tools, to obtain appropriate solutions in the domain
PSO1
of embedded systems and Internet of things.
PSO2 Ability to design web applications by applying the knowledge of cyber security.

Lecture Course DELIVERY Plan:

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

ALM,End Semester Exam,Home

COI- Assignment,Lab Weekly
1 CO1 Handout Discussion Text book 1 Chalk,PPT,Talk
2 exercise,MOOCs Review,SEM-
EXAM1

Introduction to AI and Data Science, Intelligent

ALM,End Semester Exam,Home
Agents, Overview of various AI, Data Science
COI- T BOOK[1],CH 2.1- Assignment,Lab Weekly
2 CO1 applications across domains (healthcare, Chalk,PPT,Talk
2 2.3, Pageno 30-49" exercise,MOOCs Review,SEM-
agriculture, robotics, automation, law, medicine,
EXAM1
pharmacy, and business management)
 Teaching-
Book No[CH No]
Sess.No. CO COI Topic Learning EvaluationComponents
[Page No]
Methods

ALM,End Semester Exam,Home

COI- T BOOK[1],CH 2.1- Assignment,Lab Weekly
3 CO1 Best-First Search, Introduction to Heuristics Chalk,PPT,Talk
2 2.3, Pageno 30-49 exercise,MOOCs Review,SEM-
EXAM1

ALM,End Semester Exam,Home

COI- Heuristic search techniques: A* Search, Hill T BOOK[1],CH2.1- Assignment,Lab Weekly
4 CO1 Chalk,PPT,Talk
3 Climbing 2.3, Pageno 30-49 exercise,MOOCs Review,SEM-
EXAM1

ALM,End Semester Exam,Home

Introduction to Constraint Satisfaction Problems T BOOK[1],
COI- Assignment,Lab Weekly
5 CO1 (CSP), Techniques for solving CSP (Backtracking, CH2.6,2.8,Page no56- Chalk,PPT,Talk
3 exercise,MOOCs Review,SEM-
Forward Checking) 61
EXAM1

ALM,End Semester Exam,Home

Knowledge representation techniques (Semantic
COI- T BOOK[1],CH29.6, Assignment,Lab Weekly
6 CO1 Networks, Frames, Propositional and First-Order Chalk,PPT,Talk
3 Pageno 772-776 exercise,MOOCs Review,SEM-
Logic)
EXAM1

ALM,End Semester Exam,Home

COI- Reasoning techniques (Forward and Backward T BOOK[1],CH29.6,
7 CO1 Chalk,PPT,Talk Assignment,MOOCs
2 Chaining, Resolution) (flipped learning) Pageno 772-776
Review,SEM-EXAM1

ALM,End Semester Exam,Home

COI- Probabilistic Reasoning for AI, Introduction to BOOK[1], CH1.3-1.6, Assignment,Lab Weekly
8 CO2 Chalk,PPT,Talk
2 Probability Theory Pageno 12-23" exercise,MOOCs Review,SEM-
EXAM1

ALM,End Semester Exam,Home

Introduction to Bayesian Networks,Inference in
COI- "T BOOK[1], CH2.1- Assignment,Lab Weekly
9 CO2 Bayesian Networks (Exact and Approximate Chalk,PPT,Talk
2 2.3,Page no30-49" exercise,MOOCs Review,SEM-
Inference)
EXAM1

ALM,End Semester Exam,Home

COI- Introduction to Machine Learning (ML), "T BOOK [1], CH Assignment,Lab Weekly
10 CO2 Chalk,PPT,Talk
3 preprocess and analyze data, 2.4,2.5, Page no 50-55" exercise,MOOCs Review,SEM-
EXAM1

ALM,End Semester Exam,Home

COI- Supervised, Unsupervised, and Reinforcement T BOOK[1],CH 2.1- Assignment,Lab Weekly
11 CO2 Chalk,PPT,Talk
2 Learning (flipped learning) 2.3, Pageno 30-49 exercise,MOOCs Review,SEM-
EXAM1

ALM,End Semester Exam,Home

COI- Find S Algorithm, Concept learning search, Assignment,Lab Weekly
12 CO2 T BOOK[1], CH1.3- Chalk,PPT,Talk
4 Candidate Elimination Algorithm (CEA) exercise,MOOCs Review,SEM-
EXAM1

ALM,End Semester Exam,Home

evaluating a hypothesis, probably learning
COI- "T BOOK[3],CH Assignment,Lab Weekly
13 CO2 approximately correct hypothesis, and function Chalk,PPT,Talk
4 8,Page no165-170" exercise,MOOCs Review,SEM-
approximation.
EXAM1

ALM,End Semester Exam,Home

COI- Introduction to ANN, Perceptron, Multi-layer "T BOOK [1],CH 29.6, Assignment,Lab Weekly
14 CO3 Chalk,PPT,Talk
4 Perceptron Page no 772-776" exercise,MOOCs Review,SEM-
EXAM2

ALM,End Semester Exam,Home

COI- T BOOK [1],CH 29.6, Assignment,Lab Weekly
15 CO3 Backpropagation Chalk,PPT,Talk
2 Page no 772- 776 exercise,MOOCs Review,SEM-
EXAM2

ALM,End Semester Exam,Home

COI- "T BOOK [1],CH 29.6, Assignment,Lab Weekly
16 CO3 Introduction to CNN and DL Chalk,PPT,Talk
4 Page no 772-776" exercise,MOOCs Review,SEM-
EXAM2

17 CO3 COI- Applications of CNN in Image Recognition and "T BOOK[1],CH29.6, Chalk,PPT,Talk ALM,End Semester Exam,Home
4 Processing Page no 772-776" Assignment,Lab Weekly
 Teaching- exercise,MOOCs Review,SEM-
Book No[CH No]
Sess.No. CO COI Topic Learning EXAM2
EvaluationComponents
[Page No]
Methods
ALM,End Semester Exam,Home
COI- Data Science, Types of data (Structured, "T BOOK [1], CH 5.1- Assignment,Lab Weekly
18 CO4 Chalk,PPT,Talk
2 Unstructured, and Semi-structured) 5.3, Page no120- 133" exercise,MOOCs Review,SEM-
EXAM2

ALM,End Semester Exam,Home

COI- Classification of Data Science (Descriptive, "T BOOK [1], CH 5.1- Assignment,Lab Weekly
19 CO4 Chalk,PPT,Talk
4 Diagnostic, Predictive, and Prescriptive Analytics) 5.3, Page no120- 133" exercise,MOOCs Review,SEM-
EXAM2

ALM,End Semester Exam,Home

COI- k-Nearest Neighbors, k-Means Clustering, "T BOOK[3],CH Assignment,Lab Weekly
20 CO4 Chalk,PPT,Talk
4 Principal Component Analysis 8,Page no165-170" exercise,MOOCs Review,SEM-
EXAM2

ALM,End Semester Exam,Home

COI- Introduction to Natural Language Processing and "T BOOK [1], CH 5.5- Assignment,Lab Weekly
21 CO4 Chalk,PPT,Talk
4 Text Analytics 5.7, Page no138- 144" exercise,MOOCs Review,SEM-
EXAM2

ALM,End Semester Exam,Home

COI- T BOOK[3],CH 8,Page Assignment,Lab Weekly
22 CO4 Regression techniques (flipped learning) Chalk,PPT,Talk
2 no165-170 exercise,MOOCs Review,SEM-
EXAM2

ALM,End Semester Exam,Home

Introduction to Data Visualization and its
COI- "T BOOK [1], CH 5.5- Assignment,Lab Weekly
23 CO4 importance,Popular data visualization tools and Chalk,PPT,Talk
4 5.7, Page no138- 144" exercise,MOOCs Review,SEM-
libraries
EXAM2

ALM,End Semester Exam,Home

COI- Data preprocessing techniques (Cleaning, "T BOOK [1], CH 5.5- Assignment,Lab Weekly
24 CO4 Chalk,PPT,Talk
4 Transformation, and Feature Scaling) 5.7, Page no138- 144" exercise,MOOCs Review,SEM-
EXAM2

ALM,End Semester Exam,Home

COI- T BOOK[1],CH 2.1- Assignment,Lab Weekly
25 CO4 Review of the entire course content Chalk,PPT,Talk
4 2.3, Pageno30-49" exercise,MOOCs Review,SEM-
EXAM2

ALM,End Semester Exam,Home

COI- T BOOK [1], CH Assignment,Lab Weekly
26 CO4 Presentation and evaluation of group projects. Chalk,PPT,Talk
4 2.6,2.8, Page no56-61 exercise,MOOCs Review,SEM-
EXAM2

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Handout Discussion

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 Attendance 1 PPT
APPLICABLE ---
--- NOT
30 Course Handout Discussion 1 PPT
APPLICABLE ---
--- NOT
10 Questions and review 1 PPT
APPLICABLE ---

SESSION NUMBER : 2

Session Outcome: 1 Understand the concept of AI&DS and it's Applications

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 Attendance 2 PPT
APPLICABLE ---
Introduction to AI and Data Science, Intelligent Agents, Overview of various AI,
--- NOT
30 Data Science applications across domains (healthcare, agriculture, robotics, 2 PPT
APPLICABLE ---
automation, law, medicine, pharmacy, and business management)
 --- NOT
10 Question and Answers 2 PPT
APPLICABLE ---

SESSION NUMBER : 3

Session Outcome: 1 Apply the concept of Search Techniques

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 3 PPT One minute paper
Classification of Data Science (Descriptive, Diagnostic, Predictive, and Prescriptive
30 3 PPT One minute paper
Analytics)
10 Question and Answers 3 PPT One minute paper

SESSION NUMBER : 4

Session Outcome: 1 Apply the concept of heuristic search algorithm

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 3 PPT One minute paper
30 Heuristic search techniques: Hill Climbing 3 PPT One minute paper
10 Question and Answers 3 PPT One minute paper

SESSION NUMBER : 5

Session Outcome: 1 Understand the concept of CSP and it's techniques

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 Attendance 3 PPT
APPLICABLE ---
Introduction to Constraint Satisfaction Problems (CSP), Techniques for solving CSP
30 3 PPT Quiz/Test Questions
(Backtracking, Forward Checking)
10 Question and Answers 3 PPT One minute paper

SESSION NUMBER : 6

Session Outcome: 1 Understand the concept of knowledge representation techniques

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 Attendance 3 PPT
APPLICABLE ---
Knowledge representation techniques (Semantic Networks, Frames, Propositional --- NOT
30 3 PPT
and First-Order Logic) APPLICABLE ---
--- NOT
10 Question And Answers 3 PPT
APPLICABLE ---

SESSION NUMBER : 7

Session Outcome: 1 Understand the concept of forward and Backward chaining

Teaching- Active Learning

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

SESSION NUMBER : 8

Session Outcome: 1 Apply the concept of Probability theory

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 ATTENDANCE 2 Talk
APPLICABLE ---
30 Probabilistic Reasoning for AI, Introduction to Probability Theory 3 PPT Leading question
10 Question and Answer 2 PPT Leading question

SESSION NUMBER : 9
Session Outcome: 1 Apply the concept of Bayesian Networks

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 ATTENDANCE 2 Talk
APPLICABLE ---
Introduction to Bayesian Networks,Inference in Bayesian Networks (Exact and
30 3 PPT Leading question
Approximate Inference)
10 Question and Answer 2 PPT Leading question

SESSION NUMBER : 10

Session Outcome: 1 Analyse the pre-processing stages of standard dataset

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 Attendance 3 PPT
APPLICABLE ---
Brain storming
30 Introduction to Machine Learning (ML), preprocess and analyze data, 3 PPT
session
--- NOT
10 Question and Answers 3 PPT
APPLICABLE ---

SESSION NUMBER : 11

Session Outcome: 1 Understand the concept of different types of ML

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
--- NOT
30 Supervised, Unsupervised, and Reinforcement Learning 2 PPT
APPLICABLE ---
--- NOT
10 Question and Answers 2 Talk
APPLICABLE ---

SESSION NUMBER : 12

Session Outcome: 1 Understand the concept of S algorithm and candidate elimination algorithm

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 ATTENDANCE 2 Talk
APPLICABLE ---
30 Find S Algorithm, Concept learning search, Candidate Elimination Algorithm (CEA) 3 PPT Leading question
10 Question and Answer 2 PPT Leading question

SESSION NUMBER : 13

Session Outcome: 1 Understand the concept of hypothesis testing

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 ATTENDANCE 2 Talk
APPLICABLE ---
evaluating a hypothesis, probably learning approximately correct hypothesis, and
30 3 PPT Leading question
function approximation.
10 Question and Answer 3 PPT Leading question

SESSION NUMBER : 14

Session Outcome: 1 Analyzing the behaviour of multi-layer perceptron

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 attendance 4 PPT One minute paper
30 Introduction to ANN, Perceptron, Multi-layer Perceptron 4 PPT One minute paper
10 Questions and Answers 4 PPT One minute paper

SESSION NUMBER : 15

Session Outcome: 1 Understand the concept of Backpropagation

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

SESSION NUMBER : 16

Session Outcome: 1 Analyze the behaviour of CNN and DL

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
30 Introduction to CNN and DL 4 PPT One minute paper

SESSION NUMBER : 17

Session Outcome: 1 Analyze the concept of image processing and its application

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
30 Applications of CNN in Image Recognition and Processing 4 PPT One minute paper
10 Questions and Answers 4 PPT One minute paper

SESSION NUMBER : 18

Session Outcome: 1 Analyse different data types

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
30 Data Science, Types of data (Structured, Unstructured, and Semi-structured) 4 PPT One minute paper
10 Questions and Answers 4 PPT One minute paper

SESSION NUMBER : 19

Session Outcome: 1 Understand the concept of different types of Data

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
Classification of Data Science (Descriptive, Diagnostic, Predictive, and Prescriptive
30 4 PPT One minute paper
Analytics)
10 Questions and Answers 4 PPT One minute paper

SESSION NUMBER : 20

Session Outcome: 1 Understand the concept of clustering algorithm

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
30 k-Nearest Neighbors, k-Means Clustering, Principal Component Analysis 4 PPT One minute paper
10 Questions and Answers 4 PPT One minute paper

SESSION NUMBER : 21

Session Outcome: 1 Understand the concept of NLP

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
30 Introduction to Natural Language Processing and Text Analytics 4 PPT One minute paper
10 Questions and Answers 4 PPT One minute paper

SESSION NUMBER : 22

Session Outcome: 1 Understand the concept of different Regression techniques

 Teaching- Active Learning
Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 Attendance 2 Talk
APPLICABLE ---
30 Regression techniques 2 PPT Fish Bowl
--- NOT
10 Question and Answers 2 Talk
APPLICABLE ---

SESSION NUMBER : 23

Session Outcome: 1 Understand the concept of Data Visualization

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
Introduction to Data Visualization and its importance,Popular data visualization tools
30 4 PPT One minute paper
and libraries
10 Questions and Answers 4 PPT One minute paper

SESSION NUMBER : 24

Session Outcome: 1 Understand the concept of data pre-processing techniques

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
30 Data preprocessing techniques (Cleaning, Transformation, and Feature Scaling) 4 PPT One minute paper
30 Questions and Answers 4 PPT One minute paper

SESSION NUMBER : 25

Session Outcome: 1 Review of the entire course content

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
30 Review of the entire course content 4 PPT One minute paper
10 Questions and Answers 4 PPT One minute paper

SESSION NUMBER : 26

Session Outcome: 1 Presentation and evaluation of group projects.

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 4 PPT One minute paper
30 Presentation and evaluation of group projects. 4 PPT One minute paper
10 Questions and Answers 4 PPT One minute paper

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
1 to clean a grid-based environment. The agent will perceive the status of the current cell and decide whether to CO5
clean, move, or do nothing.

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

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

4 Implement the Hill Climbing algorithm to solve the Traveling Salesman Problem (TSP). Description: CO5
Tutorial
Session Topics CO-Mapping
no
Students will implement the Hill Climbing 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 implement the backtracking algorithm to find a solution for the N-
5 CO5
Queens 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
6 knowledge base using first-order logic to represent facts about a family tree, such as parent, sibling, and CO5
grandparent relationships, and write a function to answer queries about these relationships.

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

Implement the k-Nearest Neighbors (kNN) algorithm for classification. Description: Students will implement
8 the kNN algorithm to classify a set of data points based on their features and labels and predict the label for a CO5
new data point.

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

Construct a Python Program to Show various Data Visulaization Techniques using Exsisting Well Known
10 CO5
Dataset

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

12 Construct a CNN Model for Medical Image Classification. Consider Breast Cancer dataset for Classification CO5

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

Implement the k-Means clustering algorithm. Description: Students will implement the k-Means clustering
14 CO5
algorithm to group a set of data points into k clusters based on their features.

Practical Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Implement a simple reflex agent for a vacuum cleaner.

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
10 Attendance 2 PPT Leading question
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 will
30 3 PPT Leading question
perceive the status of the current cell and decide whether to clean, move, or do
nothing.
60 Execution of the lab program 3 PPT Leading question

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.

Teaching- Active Learning

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

SESSION NUMBER : 3
Session Outcome: 1 Implement A* search algorithm 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 Learning

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

SESSION NUMBER : 4

Session Outcome: 1 Implement the Hill Climbing alStudents 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 Learning

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

SESSION NUMBER : 5

Session Outcome: 1 Students 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.

Teaching- Active Learning

Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 ATTENDANCE 2 Talk
APPLICABLE ---
Constraint Satisfaction Problems Lab Exercise: Implement the backtracking
algorithm to solve the N-Queens problem. Description: Students will implement the
30 3 PPT Leading question
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.
10 Question and Answer 2 PPT Leading question

SESSION NUMBER : 6

Session Outcome: 1 using first-order logic to represent facts about a family tree.

Teaching- Active Learning

Time(min) Topic BTL
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 using first-order logic to represent facts about
30 3 PPT Leading question
a family tree, such as parent, sibling, and grandparent relationships, and write a
function to answer queries about these relationships.
10 Question and Answer 2 PPT Leading question

SESSION NUMBER : 7

Session Outcome: 1 Students will implement the Bayesian network inference algorithm to compute the probability of a specific event, given a set of
evidence

Teaching- Active Learning

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

SESSION NUMBER : 8

Session Outcome: 1 ImplementStudents 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 Learning
Time(min) Topic BTL
Learning Methods Methods
--- NOT
10 ATTENDANCE 2 Talk
APPLICABLE ---
Implement the k-Nearest Neighbors (kNN) algorithm for classification. Description:
30 Students will implement the kNN algorithm to classify a set of data points based on 3 PPT Leading question
their features and labels and predict the label for a new data point.
10 Question and Answer 2 PPT Leading question

SESSION NUMBER : 9

Session Outcome: 1 Students 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 Learning

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

SESSION NUMBER : 10

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

Teaching- Active Learning

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

SESSION NUMBER : 11

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 Learning

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

SESSION NUMBER : 12

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

Teaching- Active Learning

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

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 Learning

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

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.

Teaching- Active Learning

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

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
Week Assignment Type Topic Details co
No

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
- - -
Theory -- -- -- -- -- --
- - -
- - -
Tutorial -- -- -- -- -- --
- - -
Mon
- - -
Lab -- -- -- -- -- --
- - -
- - -
Skilling -- -- -- -- -- --
- - -
V-S21,V- V-S21,V-
S22,V- S22,V-
- - - V-S31,V-S32,V- V-S31,V-S32,V-
S23,V- S23,V-
Theory - - --- --- - S33,V-S34,V- S33,V-S34,V-
S24,V- S24,V-
- - - S35,V-S36 S35,V-S36
S25,V- S25,V-
S26,V-S27 S26,V-S27
- - -
Tue Tutorial - - -- -- --- --- - -- --
- - -
- - -
V-S28,V- V-S28,V-
Lab - - --- --- - -- --
S28,V-S28 S28,V-S28
- - -
- - -
Skilling - - -- -- --- --- - -- --
- - -
- - V-S11,V-S12,V-S13,V- V-S11,V-S12,V-S13,V- -
Theory - - --- --- S14,V-S15,V-S16,V- S14,V-S15,V-S16,V- - --- ---
- - S17,V-S18 S17,V-S18 -
- - -
Tutorial - - --- --- -- -- - --- ---
- - -
Wed
- - -
Lab - - --- --- -- -- - --- ---
- - -
- - -
Skilling - - --- --- -- -- - --- ---
- - -
Thu - - -
Theory - - --- --- --- --- - --- ---
- - -
Tutorial - - --- --- --- --- - --- ---
- - -
 - - -
- - -
Lab - - --- --- --- --- - --- ---
- - -
- - -
Skilling - - --- --- --- --- - --- ---
- - -
- - -
Theory - - --- --- --- --- - -- --
- - -
- - -
Tutorial - - --- --- --- --- - -- --
- - -
V-S31,V-S31,V- V-S31,V-S31,V-
S31,V-S32,V- S31,V-S32,V-
Fri S32,V-S32,V- S32,V-S32,V-
- - - S33,V-S33,V- S33,V-S33,V-
Lab - - --- --- --- --- - S33,V-S34,V- S33,V-S34,V-
- - - S34,V-S34,V- S34,V-S34,V-
S35,V-S35,V- S35,V-S35,V-
S35,V-S36,V- S35,V-S36,V-
S36,V-S36 S36,V-S36
- - -
Skilling - - --- --- --- --- - -- --
- - -
- - -
Theory - - --- --- -- -- - --- ---
- - -
- - -
Tutorial - - --- --- -- -- - --- ---
- - -
V-S11,V-S11,V-S11,V- V-S11,V-S11,V-S11,V-
S12,V-S12,V-S12,V- S12,V-S12,V-S12,V-
Sat S13,V-S13,V-S13,V- S13,V-S13,V-S13,V-
- - -
S14,V-S14,V-S14,V- S14,V-S14,V-S14,V-
Lab - - --- --- - --- ---
S15,V-S15,V-S15,V- S15,V-S15,V-S15,V-
- - -
S16,V-S16,V-S16,V- S16,V-S16,V-S16,V-
S17,V-S17,V-S17,V- S17,V-S17,V-S17,V-
S18,V-S18,V-S18 S18,V-S18,V-S18
- - -
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.
S.no Advanced Topics, Additional Reading, Research papers and any CO ALM References/MOOCS

EVALUATION PLAN:

Evaluation Type Evaluation Component Weightage/Marks Assessment Dates Duration (Hours) CO1 CO2 CO3 CO4 CO5
End Semester Weightage 24 6 6 6 6
End Semester Exam 90
Summative Max Marks 100 25 25 25 25
Evaluation Weightage 16 16
Total= 40 % Lab End Semester Exam 90
Max Marks 50 50
Weightage 5 1.25 1.25 1.25 1.25
MOOCs Review 90
Max Marks 100 25 25 25 25
In Semester Weightage 5 1.25 1.25 1.25 1.25
ALM 90
Formative Max Marks 100 25 25 25 25
Evaluation Weightage 7 7
Total= 22 % Lab Weekly exercise 90
Max Marks 100 100
Weightage 5 1.25 1.25 1.25 1.25
Home Assignment and Textbook 90
Max Marks 100 25 25 25 25
Weightage 15 7.5 7.5
Semester in Exam-I 90
In Semester Max Marks 50 25 25
Summative Weightage 15 7.5 7.5
Semester in Exam-II 90
Evaluation Max Marks 50 25 25
Total= 38 %
Weightage 8 8
Lab In Semester Exam 90
Max Marks 50 50

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 :

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
Delivery Chamber Chamber
Sections of Chamber Consultation Signature of
Name of Faculty Component of Consultation Day Consultation Room
Faculty Timings for each day Course faculty:
Faculty (s) No:
Ramesh Kumar
L 18-MA - - - -
Sunkara
Ramesh Kumar
P 18-A - - - -
Sunkara
Kavitha Modepalli P 11-B - - - -
Mohammed Moulana P 28-B - - - -
17-B,28-
Maganti Syamala P - - - -
C,33-B
12-MA,31-
Arpita Roy L - - - -
MA
Arpita Roy P 12-A,31-A - - - -
36-MA,21-
Karthikeyan C L - - - -
MA
Karthikeyan C P 36-A,21-A - - - -
Srinivas P V V S L 25-MA - - - -
Srinivas P V V S P 25-A - - - -
Arvind Yadav L 22-MA - - - -
Arvind Yadav P 22-A - - - -
Smritilekha Das L 23-MA - - - -
Smritilekha Das P 18-B,23-A - - - -
P Rani P 35-B,13-C - - - -
Bikram Basaba P 14-C,21-B - - - -
Vinod Kumar P 15-C,21-C - - - -
Imran Rasheed L 24-MA - - - -
Imran Rasheed P 24-A - - - -
Akhilesh Dubey P 22-B,35-C - - - -
Swathi Kailasam P 22-C - - - -
Sandeep Sahratia P 23-B - - - -
Yamuna Devi M M P 18-C,23-C - - - -
Faraz Hasan P 12-C - - - -
N B Arunekumar
P 17-C - - - -
Balasubramanian
Vijayalakshmi 32-MA,13-
L - - - -
Ponnuswamy MA
Vijayalakshmi
P 32-A,13-A - - - -
Ponnuswamy
Jagjit Dhatterwal L 11-MA - - - -
Jagjit Dhatterwal P 11-A - - - -
K.R.R Rao P 24-B - - - -
33-MA,14-
Ashwin M L - - - -
MA
Ashwin M P 33-A,14-A - - - -
Bhaskar Marapelli L 28-MA - - - -
Bhaskar Marapelli P 28-A - - - -
Rafeeq Ahmed P 36-C - - - -
Priyadharshini A L 27-MA - - - -
Priyadharshini A P 11-C,27-A - - - -
Pranjit Das P 36-B - - - -
Vikram Dara L 26-MA - - - -
Vikram Dara P 26-A,33-C - - - -
Kapil Aggarwal P 34-B - - - -
34-MA,15-
Dyuti Banerjee L - - - -
MA
Dyuti Banerjee P 15-A,34-A - - - -
AMIT VERMA P 24-C - - - -
35-MA,16-
Joe Veguri L - - - -
MA
Joe Veguri P 35-A,16-A - - - -
Murali Puttagunta P 25-B,32-C - - - -
vuda sreenivasa rao P 32-B,25-C - - - -
Jasmine Vemula L 17-MA - - - -
Jasmine Vemula P 17-A - - - -
13-B,26-
DUPATY MOHAN P - - - -
C,31-C
12-B,26-
Naveen Mukkapati P - - - -
B,31-B
RUDRAMANI
P 27-B,14-B - - - -
BHUTIA
Narasimha Lavudiya P 27-C,15-B - - - -
Gnanadeepthi Bitra P 16-B - - - -
Lakshmi Ramani Burra P 16-C - - - -
PURNA
P 34-C - - - -
KASARANENI

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.

Signature of COURSE COORDINATOR

(Imran Rasheed)
Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of ECE

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]