(Established under the Presidency University Act, 2013 of the Karnataka Act 41 of 2013)

[2024-25 EVEN SEMESTER]

COURSE HAND OUT [Revision 01 - July 2024]

SCHOOL: s o c s DEPT: CSE DATE OF ISSUE: 09.01.2025

NAME OF THE PROGRAM : B. Tech in Computer Science & Engineering (General

& Allied )

P.R.C.APPROVAL REF. : PU/AC-21.X/SOCSE02/CSE//2020-2024

SEMESTER/YEAR : IV/2nd

COURSE TITLE & CODE : Artificial Intelligence and Machine Learning & CSE3157

COURSE CREDIT STRUCTURE : 3-0-2-4

CONTACT SESSIONS : 45 + 30 = 75

COURSE IC : Dr.Jacob Augustine , Dr. Manjunath K .V

COURSE INSTRUCTOR(S) : Dr. Praveena K N, S THABASSUM KHAN, Tintu Vijayan, Sreelatha PK ,

Asad Mohammed Khan, SAPTARSI SANYAL, Dr. Zafar Ali Khan N

COURSE URL : https://www.linways.com

PROGRAM OUTCOMES :

Graduates of the B. Tech. Program in Computer Science and Engineering will be able to:

PO1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and anengineering
specialization to the solution of complex engineering problems
PO2. Problem analysis: Identify, formulate, review research literature, and analyze complex engineering problems
reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences

PO3. Design/development of solutions: Design solutions for complex engineering problems and design 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.
PO4. 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 provide valid conclusions.
PO5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT
tools including prediction and modeling to complex engineering activities with an understanding of the limitations.

PO6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety,
legal and cultural issues and the consequent responsibilities relevant to the professional engineering practice.

PO7. Environment and sustainability: Understand the impact of the professional engineering solutions in societal and
environmental contexts, and 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.

PO9. Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and
in multidisciplinary settings.

PO10. Communication: Communicate effectively on complex engineering activities with the engineering 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.

PO11.Project management and finance: Demonstrate knowledge and understanding of the engineering and 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.

PO12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and
life-long learning in the broadest context of technological change.

PROGRAM SPECIFIC OUTCOMES:

PSO1: [Problem Analysis]: Identify, formulate, research literature, and analyze complex engineering problems related
to Software Engineering principles and practices, Programming and Computing technologies reaching substantiated
conclusions using first principles of mathematics, natural sciences, and engineering sciences.

PSO2: [Design/development of Solutions]: Design solutions for complex engineering problems related to Software
Engineering principles and practices, Programming and Computing technologies and design system components or
processes that meet the specified needs with appropriate consideration for the public health and safety, and thecultural,
societal, and environmental considerations.

PSO3: [Modern Tool usage]: Create, select, and apply appropriate techniques, resources, and modern engineeringand IT
tools including prediction and modelling to complex engineering activities related to Software Engineeringprinciples and
practices, Programming and Computing technologies with an understanding of the limitations.

COURSE PREREQUISITES:CSE1005 – Innovative Project – Python Programming

COURSE DESCRIPTION:

This course introduces the basic concepts of artificial intelligence. It introduces students to the basic concepts and
techniques of Machine Learning (ML), a subset of Artificial Intelligence (AI), is an important set of techniques and
algorithms used for solving several business and social problems. The objective of this course is to discuss machine
learning model development using Python.

Topics include: Working with Collections and Data Frames; Regression algorithms; Classification algorithms;
Optimization techniques – Gradient Descent algorithm, Gradient Descent for simple Linear Regression; Ensemble
Learning – Random Forest, Boosting techniques – AdaBoost and Gradient Boosting; Grid Search for optimal
parameters; Clustering algorithms; Forecasting with Time-Series data : Auto-Regressive Integrated Moving Average
Models, Recommender Systems : Association Rule Mining, Collaborative Filtering, Text Analytics – Sentiment
Classification using Naïve Bayesian model.

COURSE OBJECTIVES: The objective of the course is to familiarize the learners with the concepts of

ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING and attain Skill

Development through Experiential Learning techniques
COURSE OUTCOMES:
.
On successful completion of the course the students shall be able to:

TABLE 1: COURSE OUTCOMES

CO CO Expected BLOOMS
Number LEVEL
CO1 Describe the basic understanding of the AI and concepts of searching Understand
for AI problems.
CO2 Develop knowledge base for representing the given real world data Apply
using logic and reasoning methods.
CO3 Articulate Machine Learning model using Supervised and Apply
Unsupervised learning algorithms.
CO4 Apply concept learning and Artificial Neural Network techniques for Apply
the given problems.

MAPPING OF C.O. WITH P.O [H-HIGH, M- MODERATE, L-LOW]

CO.
No PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO 10 PO 11 PO 12
CO1 H M - - - L - - - L - M
CO2 H H H - H L - - H L - M
CO3 H H H - H L - - H L - H
CO4 H H H - H L - - H L - H

MAPPING OF C.O. WITH PSO [H-HIGH, M- MODERATE, L-LOW]

CO.
No PSO1 PSO2 PSO3
CO1 M - -
CO2 H H H
CO3 H H H
CO4 H H H
COURSE CONTENT (SYLLABUS):

Module 1: Introduction to Artificial Intelligence and Searching

[L-10 P-6 Total: 16 sessions] [Understand]
Introduction to Artificial Intelligence, Definitions, foundation, History and Applications; Agents:
Types of Agent, Structure of Intelligent agent and its functions, Agents and Environment; Indexing
and Heuristic functions -Hill Climbing-Depth first and Breath first; A* - SMA* algorithms.
Module 2: Knowledge Representation. [L-12, P-6 Total: 18 sessions] [Apply]

Introduction to Knowledge representation, approaches and issues in knowledge representation,

Knowledge-based agent and its Structure, Knowledge-Based Systems; Knowledge representation
using Propositional logic and Predicate Logic- First-Order Logic - Syntax and Semantics,
Knowledge Engineering - Unification and lifting, Forward chaining, Backward chaining.

Module: 3: Introduction to Machine Learning and Supervised & Unsupervised Learning

[L-12 P-10 Total: 22 sessions] [Apply]
Introduction to the Machine Learning (ML) Framework, types of ML, types of variables/features used
in ML algorithms, Concept Learning: Concept learning task, Concept learning as search, Find-S
algorithm, Candidate Elimination Algorithm.

Supervised Learning – Classification & Regression - Decision Tree Learning, Random Forest -
Support Vector Machines ; Simple Linear Regression Algorithm, Multivariate Regression Algorithm

Module 4: Machine Learning & Neural Network

[L-11 P-8 Total: 19 sessions][Apply]

Neural and Belief networks - Perceptron - Multi-layer feed forward networks - Bayesian belief
networks, Back propagation algorithm.

Unsupervised Learning – Clustering & Association - K-Means Clustering algorithm , Mean-shift

algorithm , Apriori Algorithm, FP-growth algorithm

SKILL SETS:
Graduate of the B. Tech Program in Computer Science & Engineering shall be able to:

1. An attitude of enquiry.
2. Confidence and ability to tackle new problems.
3. Ability to interpret events and results.
4. Ability to work as a leader and as a member of a team.
5. Assess errors in systems/processes/programs/computations and eliminate them.
6. Observe and measure physical phenomena.
7. Write reports.
8. Select suitable equipment, instrument, materials & software
9. Locate faults in system/Processes/software.
10. Manipulative skills for setting and handling systems/Process/ Issues
11. The ability to follow standard /legal procedures.
12. An awareness of the Professional Ethics.
13. Need to observe safety/General precautions.
14. To judge magnitudes/Results/issues without actual measurement/actual contacts
DELIVERY PROCEDURE (PEDAGOGY):

TABLE 3: SPECIAL DELIVERY METHOD/ PEDAGOGY PLANNED WITH TOPICS

S. No Lecture Subtopic as per Pedagogy title/ short ** At end of semester
Number lesson Plan explanation of adopted please update whether
pedagogy activity was done
L7 Hill Climbing Flipped Class
1
1. Supervised Self-Learning
2
Learning
L28
2. Unsupervised
Learning
Time series Blended Learning using
3 L41
Analysis in Python Videos

REFERENCE MATERIALS:

Textbook(s):
T1 Stuart J. Russell and Peter Norvig, Artificial intelligence: A Modern Approach, 3rd edition, Upper Saddle
River, Prentice Hall 2021.
T2 Tom Mitchell, “Machine Learning”, First Edition, Tata McGraw Hill India, 2017.
References
R1. Giuseppe Bonaccorso, “Machine Learning Algorithms: A reference guide to popular algorithms from data
science and machine learning”, Packt Publishing, 2017.
R2. Manaranjan Pradhan, U Dinesh Kumar, “Machine Learning Using Python”, Wiley, First Edition 2019.
R3. Andreas C Muller, Sarah Guido, “Introduction to Machine Learning with Python :A Guide for Data
Scientists”, Oreilly, First Edition, 2016
R4. Elaine Rich, Kevin K and S B Nair, “Artificial Intelligence”, 3rd Edition, McGraw Hill Education, 2017.
R5. Pattern Classification 2nd Edition by Richard O. Duda , Peter E. Hart , David G. StorkWeb Based Resources
and E-books

Digital Learning Resources (Library Resources)

W1: https://www.coursera.org/specializations/machine-learning-introduction
W2: https://onlinecourses.nptel.ac.in/ (NPTEL)
W3: https://www.youtube.com/watch?v=e8Yw4alG16Q

SPECIFIC GUIDELINES TO STUDENTS:

a) Students are required to maintain minimum 75% of attendance

b) Active participation in the various learning process – Self learning, participative and experimental learning.
c) Technology enabled learning through NPTEL and ML repository may help in clear understanding of topics
related to AI and ML course.
d) On time submission of assignments.

COURSE SCHEDULE:

TABLE 4: COURSE BROAD SCHEDULE

(* TB updated after academic calendar is
available)
 Sl. No. ACTIVITY PLANNED PLANNED TOTAL NUMBER
STARTING CONCLUDING OF PERIODS
DATE DATE
01 Program Integration 20-01-2025 24-01-2025 1
Over View of the course
02 Module : 01 21-01-2025 09-02-2025 15
03 Module: 02 11-02-2025 10-03-2025 18
04 Midterm 17-03-2025 21-03-2025
05 Module:03 11-03-2025 25-04-2025 22
06 Module:04 27-04-2025 23-05-2025 19
07 End-term Examination 26 th may to 6 th june 2025

COURSE SCHEDULE FOR LABORATORY COMPONENT:

Sl. Startin Concludin Total

Activity
No. g g Number
Date Date of Periods
01 Lab sheet 1 20-01-2025 24-01-2025 2
02 Lab sheet 2 28-01-2025 31-01-2025 2
03 Lab sheet 3 03-02-2025 07-02-2025 2
04 Lab sheet 4 10-02-2025 14-02-2025 2
05 Lab sheet 5 17-02-2025 21-02-2025 2
06 Lab sheet 6 24-02-2025 28-02-2025 2
07 Lab sheet 7 03-03-2025 07-03-2025 2
08 Lab sheet 8 10-03-2025 14-03-2025 2
09 MidTerm
10 Lab sheet 9 17-03-2025 21-03-2025 2
11 Lab sheet 10
12 Lab sheet 11 07-04-2025 11-04-2025 2
13 Lab sheet 12 14-04-2025 18-04-2025 2
14 Lab sheet 13 21-04-2025 25-04-2025 2
15 Summary of the Laboratory tasks-Quiz(Lab based) 28-04-2025 02-05-2025 2

TABLE 5: DETAILED SCHEDULE OF INSTRUCTION/LESSON PLAN(THEORY)

Topics & Learning Outcome RBT

Reference
S. Course Teaching
Sessio Lesson Title LOL HOL (Chapter
N Outco Pedagogi
n no (Lower (Higher & Page
O LO: Student shall be able to me es
Order Order No.)
Learning) Learning)
Introduction to Artificial
Intelligence, Definitions,
Module 1: foundation, History and LOL 1
Introduction to Applications CO1 T1: CH1
1 L1 Artificial LO1: To define - Chalk (Pg; 1-
Intelligence ArtificialIntelligence and Talk 33)
LO2: To Interpret the real time
applications of AI.
Agents: Types of Agent, Structure
of Intelligent agent and its LOL 1
functions, Agents and Environment
Module 1: LO1: To List out the different - Chalk T1: CH2
2 L2 CO1
Agents typesof Agents and Talk (Pg; 34-
LO2: To illustrate the 63)
workingprinciple of Agents
 Agents: Types of Agent, Structure LOL 1
of Intelligent agent and its
functions, Agents and Environment - T1: CH1
Module 1: LO1: To List out the different Chalk and
3 L3 CO1 (Pg; 1-33)
Agents typesof Agents Talk
LO2: To illustrate the working
principle of Agents

Structure of Intelligent agent and

its functions T1: CH1
LO1: To Outline the need of LOL 1 (Pg; 1-
Module 1: 33)
Structure of Intelligent agent in AI - Chalk
4 L4 Structure of CO1
Intelligent agent LO2: To demonstrate the and Talk
Structure of Intelligent agent in
Clinical decision-support system.

Agents and Environment LOL 1 T1: CH2

LO1: To Outline the need of (Pg; 1-33)
Structure of Intelligent agent in AI -
Module 1:
LO2: To demonstrate the CO1 Chalk and
5 L5 Agents and
Structure of Intelligent agent in Talk
Environment
Clinical decision-support system.

Introduction to Indexing and Heuristic

Module 1: functions LOL 1
T1 CH3
Indexing LO1: To define the types of CO1 Chalk (Pg; 64-
and Heuristic functions in AI.
6 L6 and Talk 108)
Heuristic LO2: To classify the
functions Heuristic functions into (Heuristic -
search) algorithms.
Pedagogy Hill Climbing Flipped
7 L7 LOL 1 CO1 Class
-1
Methods for Depth first and Breath Chalk
first Search LOL 1 and
T1 CH3
Module 1: LO1: To define Depth first and Talk
CO1 (Pg; 64-
Depth first and Breath first -
8 L8 108)
Breath first Search LO2: To Illustrate
Depth first and Breath
first search
LOL 1 Chalk and
Introduction to searching algorithm
Module 1:Searching Talk T1 CH3
in AI
Algorithms CO1 (Pg; 64-
9 L9
LO1: To define the types of 108)
Searching algorithms in AI. -
LOL 1 Chalk and
Introduction to searching algorithm
Module 1:Searching Talk
in AI
Algorithms CO1 T1 CH3(Pg;
10 L10 64-108)
LO1: To define the types of
Searching algorithms in AI.
-
CONTINUES Topic will be announced later
11 L11 ASSIGNMENT - 1

END OF MODULE 1
Introduction to Knowledge Chalk
representation, approaches and and Talk
T1
Module 2: issues in knowledge representation - CH7
Knowledge LO1: To Outline the need of CO2
12 L12
Knowledge Representation in AI
(Pg;
Representation LOL 1 234-
LO2: To demonstrate the
236)
Knowledge Based System in
Clinical decision-support system.
 Knowledge-based agent and its Chalk and
Structure Talk
Module 2: LO1: To Outline the need of -
Knowledge-based Knowledge-based agent and its CO2 T1 CH7
13 L13 agent and its Structure in AI LOL 1 (Pg; 234-
Structure LO2: To demonstrate the 236)
Knowledge-based agent and its
Structure in
Clinical decision-support system.
Introduction to Knowledge-Based Chalk and
Systems Talk
Module 2: LO1: To Outline the need of - T1 CH7
Knowledge-Based Systems in AI CO2
14 L14 Knowledge-Based LO2: To demonstrate the
LOL 1 (Pg; 234-
Systems 236)
Knowledge-Based Systems in
Clinical decision-support system.

Introduction to Propositional logic Chalk and

LO1: To Outline the need of Talk
Module 2: Propositional logic in AI - T1 CH7
LO2: To demonstrate the CO2
15 L15 Propositional logic Propositional logic in
LOL 1 (Pg; 220-
decision-support system. 265)

Introduction to Propositional logic Chalk and

LO1: To Outline the need of Talk
Module 2: Propositional logic in AI - T1 CH7
LO2: To demonstrate the CO2
16 L16 Propositional logic Propositional logic in
LOL 1 (Pg; 220-
decision-support system. 265)

Introduction to Predicate Logic Chalk and

LO1: To Outline the need of Talk
Module 2: Predicate Logic in AI -
LO2: To demonstrate the CO2 T1 CH8 (Pg;
17 L17 Predicate Logic Predicate Logic in
LOL 1
285-307)
decision-support system.

Introduction to Forward chaining Chalk and

LO1: To Outline the need of Talk
Module 2: Forward chaining in AI - T1 CH9
LO2: To demonstrate the CO2
18 L18 Forward chaining Forward chaining in
LOL 1 (Pg; 330-
Backward chaining 337)
decision-support system.

19 L19 Mid Term

20 L20 Mid Term

21 L21 Mid Term

L22 Introduction to Supervised Chalk
Learning and Talk
Module 3: LO1: To select dependent and T1
Supervised Independent features of SLR LOL 2 CH18
22
Learning LO2: To calculate Accuracy (Pg;
measures for Regression Models. 693-697)
- CO3
 Multiple Linear Regression – multi- Chalk
co linearity and handling multi- and Talk
collinearity, outlier detection in
regression analysis. - T1
Module 3:
Regression LO1: To Identify the dependent LOL 2 CO3 CH18
23 andIndependent features. (Pg;
L23 Algorithms
LO2: To Apply Multiple 693-697)
LinearRegression in Real Time
applications.

Decision Tree learning using Chalk

Entropy as node impurity. and Talk T1
Module 3: LO1: To Describe Decision CH18
24 Classification TreeLearning LOL 2 - CO3 (Pg;
L24 Models LO2: To Examine Impurity 693-
usingEntropy method. 697)

Decision Tree learning using Gini Chalk

Module 3: T1
Index as node impurity. and Talk
Classification CO3 CH18
25 LO1: To define Gini -
Models LOL 2 (Pg; 693-
L25 index
LO2: To Calculate Gini index 697)
Random Forest Techniques Chalk
Module 3: LO1: To define Random Forest T1
and Talk
Random Forest Techniques. - CO3 CH18
26 L26 LOL 2 (Pg; 693-
LO2: To Calculate real time
697)
Random Forest Techniques
Support Vector Machines. Chalk
L27 Module 3: LO1: To define Class and Talk
Imbalanceproblem Support CO3 T1
27 Support Vector
Vector Machines . LOL 2 - CH18
Machines
LO2: To Calculate Support Vector (Pg; 744)
Machines
Pedagogy - 2 SupervisedLearning CO3 Self-
28 UnsupervisedLearning LOL 2 Learning
L28
Clustering – K – means and Chalk and
Module 3: incremental k means - CO3 Talk
ClusteringMethods LO1: To define Clustering R3 CH3
29 L29 method LOL 2
(Pg; 168)
LO2: To classify clustering
methods.
Agglomerative Hierarchical Chalk and
Clustering – Single Linkage, Talk
Module 3: Complete Linkage and group
ClusteringMethods average. CO3 R3 CH3
30 L30 LO1: To define
LOL 2 - (Pg; 168)
Agglomerativeclustering
method.
LO2: To classify clusteringmethods.
Mean-shift algorithm Chalk and
LO1: To define Mean-shift Talk
R3 CH3
Module 3:Mean- algorithm.
31 L31 LO2: To classify Mean-shift
LOL 2 (Pg; 168-
shift algorithm CO3 207)
algorithm. -

Apriori Algorithm Chalk and

LO1: To define Apriori Algorithm Talk
R3 CH3
Module 3: LO2: To classify Apriori Algorithm
32 L32 LOL 2 (Pg; 168-
Apriori Algorithm CO3 207)
-
 FP-growth algorithm Chalk and
LO1: To define FP-growth algorithm Talk
R3 CH3
Module 3: LO2: To classify FP-growth
33 L33 LOL 2 (Pg; 168-
FP-growth algorithm algorithm -
CO3 207)

CONTINUES Topic will be announced

34 L34 ASSIGNMENT -2 later
35 L35
Machine Learning (ML) Framework. Chalk
LO1: To describe Machine and Talk
Module 4: Learning (ML) Framework
Machine LOL 2 - CO4 R3 CH1
35 L35 LO2: To classify Machine
Learning (ML) (Pg;5 - 22)
Learning (ML) Framework.
Framework

Introduction to the Machine Chalk

Module 4: Learning (ML) Framework, types of and
in types of ML, types of variables/features used Talk R3 CH1
variables/ in ML algorithms - CO4 (Pg;5 -
36 LOL 2
features LO1: To define Machine earning 22)
L36 LO2: To interpret machine
used ML
Learning Algorithms.
Concept learning task. Chalk
T2 CH2
LO1: To describe Concept and Talk
Module 4: (Pg; 21)
37 learning task LOL 2 CO4
Concept
LO2: To classify Concept -
L37 Learning
learning task.
Find-S algorithm. Chalk
Module 4: LO1: To describe Find-S algorithm and Talk T2 CH2
38 LO2: To classify Find-S algorithm. LOL 2
CO4
(Pg; 22)
L38 Find-S
-
algorithm
Candidate Elimination Algorithm. Chalk
LO1: To describe Candidate and Talk T2 CH2
Module 4:
39 Elimination Algorithm (Pg; 32)
Candidate CO4
L39 LOL 2 -
Elimination LO2: To classify Candidate
Algorithm Elimination Algorithm.
Introduction to Neural and Belief Chalk
T2 CH4
networks. and Talk
(Pg; 82)
Module 4: LO1: To describe Neural and LOL 2 - CO4
40
Neural and Belief Belief networks
L40 LO2: To classify Neural and
networks
Belief networks.
Pedagogy - 3 Time series CO4 Blended
Analysis in Python LOL 2 Learning
41 using
L41
Videos
Introduction to Perceptron. Chalk and
LO1: To describe Multi-layer feed Talk T2 CH4
forward networks - CO4 (Pg; 86)
42 L42 Module 4: LO2: To classify Multi-layer feed LOL 2
Perceptron forward networks.

Introduction to Bayesian belief Chalk and

networks. Talk T2 CH6
Module 4: LO1: To describe Bayesian belief - CO4 (Pg;
43 L43 networks
LOL 2
184)
Bayesian belief
networks LO2: To classify Bayesian belief
networks.
 Introduction to Back propagation Chalk and
algorithm. Talk
LO1: To describe Back T2 CH4
Module 4: - CO4
44 L44 propagation algorithm
LOL 2 (Pg; 97)
Back propagation
algorithm LO2: To classify Back propagation
algorithm.
45 L45 Revision

List of Experiments

TABLE 5. a COURSE CONTENT &TASK SCHEDULE FOR LABORATORY COMPONENT:

Numbe Skills to
Task RBT r of Course be
Sl. No Task & Learning Objectives Lab Outcome to developed
No Session be developed
s
require
LOL HOL
(Lower (Higher d to
LO: Student shall be able to complet
Order Order
Learning Learnin e the
) g) Task
CO1 SK1,SK2,
01 P1 Demonstrate about Python SK3,SK5,
programming - Anaconda SK7,SK11
platform and its installation, ,SK12,
Executing programs on Jupyter 2 SK13
IDE/ Colab.
LOL 2

Demonstrate about Basics of CO1 SK1,SK2,

02 P2 Python Programming, functions, SK3,SK5,
Operators, Conditional SK7,SK11
Programming ,SK12,
2
SK13

LOL 2

Demonstrate about Numpy, CO1 SK1,SK2,

03 Pandas, LOL 2 SK3,SK5,
P3
2
SK7,SK11
,SK12,
SK13

Dictionaries, dictionary, CO2 SK1,SK2,

04 Comprehension. SK3,SK5,
P4 LOL 2 SK7,SK11
2 ,SK12,
SK13
 Demonstrate about SK1,SK2,
05 P5 exercises on Tuples, CO2 SK3,SK5,
Nested data SK7,SK11
structures ,SK12,
2 SK13

LOL 2

CO2
P6
Demonstrate about Scikit-learn SK1,SK2,
06
and Visualization techniques SK3,SK5,
SK7,SK11
,SK12,
2 SK13
LOL 2

Demonstrate about Data Frames CO3 SK1,SK2,

using Pandas and working with SK3,SK5,
07 P7 frames SK7,SK11
,SK12,
SK13
2
LOL 2

08 P8 Implement and demonstrate the CO3 SK1,SK2,

Simple Linear Regression for SK3,SK5,
finding the most specific linear SK7,SK11
data that fits the model and also ,SK12,
perform outlier detection based LOL 3 SK13
2
on the given set of training data
samples. Read the training data
from a .CSV file.

CA Assessment - 1

9 P9
Implement and demonstrate the LOL 3 CO3 SK1,SK2,
Linear Regression Algorithm SK3,SK5,
10 P10 Read the training data from a SK7,SK11
.CSV file. 2 ,SK12,
SK13
P11 Implement and demonstrate the LOL 3 CO4 SK1,SK2,
11 Multivariate Regression SK3,SK5,
Algorithm Read the training data SK7,SK11
from a .CSV file. 2 ,SK12,
SK13
P12 Write a program to demonstrate CO4 SK1,SK2,
12 the working of Support Vector LOL 3 SK3,SK5,
Machines. Use an appropriate SK7,SK11
data set for building the decision 2 ,SK12,
tree and apply this knowledge to SK13
classify a new sample.
13 Write a program to build the model LOL 3 CO4 SK1,SK2,
for Candidate Elimination SK3,SK5,
Algorithm. 2 SK7,SK11
P13
,SK12,
 SK13

14 Write a program to build the model SK1,SK2,S

LOL 3 K3,SK5,SK
for Back Propagation Algorithm. CO4
7,SK11,SK1
2
P14 2, SK13

15 CA Assessment - 2 CO3,CO4 SK1,SK2,S

P15 K3,SK5,SK
2
7,SK11,SK1
2, SK13

Topics relevant to “SKILL DEVELOPMENT”: Real time data analysis for Skill Development through Experiential
Learning techniques. This is attained through the Lab Experiments as mentioned in the assessment component.

ASSESSMENT SCHEDULE FOR THEORY AND LAB COMPONENT:

TABLE 6 ASSESSMENT SCHEDULE

Sl Course Dur mar Wei Venue,
.n outcome atio ks ghta DATE
o Assessment type Contents Number n ge &TIME
In
Hou
rs
Module 1 & 2 – Complete & 1.5
Mid Term Exam CO1 & CO2 50 25% 17-21
1 Lab sheet 1 - 6 Hour March-
2025

3 26 th may
CO1, CO2,
2 End Term Exam MODULE 1 - 4 and Hour 100 50% to 6 th june
CO3 & CO4
Lab sheet 1 - 11 s 2025
(To be given by
CoE)
CA1 and Lab CA2 Before Midterm CO1 & CO2 25 12.5% 3-7-
3 Marc
3 Assessments Hour h-
s 2025
CA3, and Lab CA4 After Midterm CO3 & CO4 25 12.5% 21-
25-
April-
2025

Topics relevant to development of “Skill Development”:

1. Regression Models
2. Decision Tree Classifiers
3. Hyper parameter Tuning methods
4. Agglomerative Hierarchical clustering
5. Decision tree classifiers
for Skill Development through Experiential Learning techniques. This is attained through the Lab
Experiments as mentioned in the assessment component.

CONTACT TIMINGS IN THE CHAMBER FOR ANY DISCUSSIONS: (Here mention the fixed slots on any of
the week days for students to come and interact with you)

WEDNESDAY-3.00 PM TO 4.00 PM

COURSE CLEARANCE CRITERIA:

Students should secure >=45 in both Midterm and End term Examination also Students should secure >=80 in both
Assessments + Mid-term + End term. If students failed to attain the score, they will be under “fail” category

MAKEUP EXAM POLICY: (“AS PER ACADEMIC REGULATIONS OF THE UNIVERSITY”)

SAMPLE THOUGHT PROVOKING QUESTIONS:

TABLE 7: SAMPLE THOUGHT PROVOKING QUESTIONS

SL QUESTION MARKS COURSE BLOOM’S
NO OUTCOME NO. LEVEL
1 “We are in the age of Weak AI ”
Do you agree? Give reasons 5 CO1 Understand
Write a python program to create a dictionary for shopping
2 list from user. The dictionary contains item name as key and
cost of each item as value. Later, if a particular item input 10 CO2 Apply
from the keyboard is present in the shopping list, program
should print its cost, otherwise print “the item is not in the
shopping list”.
3 Given the distance matrix of 5 objects below, cluster them
using hierarchical agglomerative single linkage clustering.
Show the updated distance matrix in each iteration and
draw the final dendrogram.
Object A B C D E

A 0
10 CO3 Apply
B 2 0

C 6 3 0

D 11 9 7 0

E 9 8 5 4 0

TARGET SET FOR COURSE OUTCOME ATTAINMENT:

TABLE 8: TARGET SET FOR ATTAINMENT OF EACH CO and ATTAINMENT ANALYSIS AFTER
RESULTS
Sl.no C.O. Course Outcomes Threshold Target set Actual C.O. Remarks on
No. Set for the for Attainment attainment
CO attainment In &Measures
in Percentage to enhance
percentage the
attainment

* *
To develop a basic
understanding of the building
01 CO1 60 65%
blocks of AI as presented in
terms of intelligent agents
Produce machine learning
02 CO2 55 60%
models for predictive analytics
Apply ensemble learning,
optimization and hyper
03 CO3 parameter tuning techniques 50 55%
for machine learning
algorithms.
Demonstrate different types of
04 CO4
clustering techniques
Neural and Belief networks 50 55%
05 CO4 for realworld problems.
* LAST TWO COLUMNS ARE TO BE FILLED AFTER END TERM EXAM WITH ACTUAL ATTAINMENT
VALUES

(Dr.JACOB AUGUSTINE) (Dr. MANJUNATH K. V)

Signature of the course Instructor In-Charge (s)

APPROVAL:

This course has been duly verified Approved by the D.A.C.

Signature of the Chairperson D.A.C.

Name and signature of the Instructor In-Charge (s) AFTER completing entries in Table number 3 and 8 at end
ofsemester:

Name and signature of the DAC Chairperson AFTER completing entries in Table number 3 and 8 at end of semester:

BLOOM'S TAXONOMYSAMPLE VERBS

Learning Outcomes Verbs at Each Bloom Taxonomy Level to be used for writing the course Outcomes.

TABLE 9: REFERENCE SAMPLES OF BLOOMS TAXONOMY VERBS

Cognitive Level Illustrative Verbs Definitions
arrange, define, describe, duplicate, identify, label, remembering previously learned
Knowledge
list, match, memorize, name, order, outline, information
 recognize, relate, recall, repeat, reproduce, select,
state
classify, convert, defend, discuss, distinguish,
estimate, explain, express, extend, generalize, give
Comprehension example(s), identify, indicate, infer, locate, grasping the meaning of information
paraphrase, predict, recognize, rewrite, report,
restate, review, select, summarize, translate
apply, change, choose, compute, demonstrate,
discover, dramatize, employ, illustrate, interpret,
Application manipulate, modify, operate, practice, predict, applying knowledge to actual situations
prepare, produce, relate schedule, show, sketch,
solve, use write
analyze, appraise, breakdown, calculate,
categorize, classify, compare, contrast, criticize,
breaking down objects or ideas into
derive, diagram, differentiate, discriminate,
Analysis simpler parts and seeing how the parts
distinguish, examine, experiment, identify,
relate and are organized
illustrate, infer, interpret, model, outline, point out,
question, relate, select, separate, subdivide, test
arrange, assemble, categorize, collect, combine,
comply, compose, construct, create, design,
develop, devise, explain, formulate, generate, plan, rearranging component ideas into a
Synthesis
prepare, propose, rearrange, reconstruct, relate, new whole
reorganize, revise, rewrite, set up, summarize,
synthesize, tell, write
appraise, argue, assess, attach, choose, compare,
conclude, contrast, defend, describe, discriminate,
making judgments based on internal
Evaluation estimate, evaluate, explain, judge, justify, interpret,
evidence or external criteria
relate, predict, rate, select, summarize, support,
value