Scribd
Upload
32 views4 pages

1 22csu601-Aiml Syllabus

The document outlines the course structure for 'Artificial Intelligence and Machine Learning' at Dr. Ambedkar Institute of Technology, detailing objectives, units of study, course outcomes, and assessment methods. It includes practical programming assignments and a mini project related to various application areas. The course aims to provide students with foundational knowledge in AI and machine learning, including algorithms and their applications.

Uploaded by

revanthvs04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views4 pages

1 22csu601-Aiml Syllabus

The document outlines the course structure for 'Artificial Intelligence and Machine Learning' at Dr. Ambedkar Institute of Technology, detailing objectives, units of study, course outcomes, and assessment methods. It includes practical programming assignments and a mini project related to various application areas. The course aims to provide students with foundational knowledge in AI and machine learning, including algorithms and their applications.

Uploaded by

revanthvs04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Dr.

Ambedkar Institute of Technology, Bengaluru-56


Department of Computer Science & Engineering
Scheme and Syllabus-NEP – 2024 -2025

Course Title ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING


Course Code 22CSU601
Category Integrated Professional Core Course (IPCC)
No. of Hours/Week Total Credits
Scheme and L T P SS Total Teaching
Credits hours
03 00 002 00 03 52 04
CIE Marks: 50 SEE Marks: 50 Total Max. Marks:100 Duration of SEE:03 Hours

Course Objectives:
1. Gain a historical perspective of AI and its foundations.
2. Become familiar with basic principles of AI towards problem solving.
3. Familiarize with the basics of Machine Learning & Machine Learning process, basics of
Decision Tree, and probability learning and implement the same.
4. Understand the working of Bayesian learning algorithms.

Unit-1 (10 Hrs.)


Introduction: What is AI, Problem‐solving: Problem‐solving agents, Example problems,
Searching for Solutions, Uninformed Search Strategies: Breadth First search, Depth First
Search.
Unit-2 (10 Hrs.)
Informed Search Strategies: Greedy best-first search, A*search.
Introduction to Machine Learning-Need for Machine Learning, Relation to other Fields,
Types, Challenges, Machine Learning Process, Applications.
Unit-3 (11 Hrs.)
Basics of Learning Theory-Introduction to Learning, Computation Learning Theory, Design
of a Learning System, Introduction to concept Learning.
Similarity Based Learning-Introduction, Nearest Neighbor Learning, Weighted KNN
algorithm, Nearest Centroid Classifier, Locally Weighted Regression.
Unit-4 (11 Hrs.)
Regression Analysis-Introduction, Introduction to Linearity, Correlation, and Causation,
Introduction to Linear Regression, Validation Methods
Decision Tree learning –Introduction, Decision Tree Induction Algorithms, Validating and
pruning of Decision Trees.
Unit-5 (10 Hrs.)
Bayesian Learning-Introduction, Bayes Theorem, Classification using Bayes Model, Naive
Bayes Algorithm for Continuous Attributes, Other popular types of Naïve Bayes Classifiers.

Course Outcomes
At the end of the course the student will be able to:
Course Blooms
Statements
Outcomes Level
Understanding of machine learning in relation to other fields and
CO1 L3
fundamental issues and challenges of machine learning.
Apply the knowledge of searching and reasoning techniques for
CO2 L3
different applications.
Apply the knowledge of classification algorithms in decision tree
CO3 L4
and compare results.
Apply Bayesian model, Naive Bayes Algorithm for
CO4 L4
Continuous Attributes and perform classification.

Part A

Students will be executing programs using python programming.

1. Develop a program to implement DFS and BFS Search Algorithm.

2. Develop a program to perform A Star (*) Search Algorithm

3. Develop a program to perform Candidate Elimination Algorithm to get Consistent Version


Space

4. Develop a program to implement K-Nearest Neighbor algorithm to classify the iris data set.
Print both correct and wrong predictions.

5. Develop a program to implement the non-parametric Locally Weighted Regression algorithm


in order to fit data points. Select appropriate data set for your experiment and draw graphs.

6. Develop a program to implement the naive Bayesian classifier for a sample training data set
stored as a .CSV file. Compute the accuracy of the classifier few test data sets.

Part B

Implementation of mini project.


A mini project should be implemented by the students in teams. The maximum size of a team can be
3 from the same batch. The students have to finalize a project topic by discussing with the faculty.
The mini project must be carried out in the college only.

The projects should be carried out in the listed areas:


1. Agriculture
2. Healthcare
3. Security
4. Smart city
5. Recommendation system
6. Behavioral Analysis
7. Games
The tasks when implementing mini project would be:

1. Understand the complete domain knowledge of the application and derive the complete data
requirement specification for the mini project.
2. Documentation & submission of report.
Note:

⮚ Students can pick one experiment from the questions lot of PART A with equal choice to all the
students in a batch.
⮚ PART B: Student should develop a mini project and it should be demonstrated in the laboratory
examination (with report and presentation).
⮚ Weightage of marks for PART A is 60% and for PART B is 40%.
⮚ Change of experiment is allowed only once (in part A) and marks allotted to the procedure part
to be made zero.

TEXTBOOKS
1. Stuart J. Russell and Peter Norvig, Artificial Intelligence, 3rd Edition, Pearson,2015
2. S. Sridhar, M Vijayalakshmi “Machine Learning”. Oxford ,2021
REFERENCES
1. Elaine Rich, Kevin Knight, Artificial Intelligence, 3rdedition, Tata McGraw Hill, 2013
2. George F Lugar, Artificial Intelligence Structure and strategies for complex, Pearson
Education, 5th Edition, 2011.
3. Tom Michel, Machine Learning, McGrawHill Publication.
WEB LINKS AND VIDEO LECTURES (E-RESOURCES)
1. https://www.kdnuggets.com/2019/11/10-free-must-read-books-ai.html
2. https://www.udacity.com/course/knowledge-based-ai-cognitive-systems--ud409
3. https://nptel.ac.in/courses/106/105/106105077/
4. https://www.javatpoint.com/history-of-artificial-intelligence
5. https://www.tutorialandexample.com/problem-solving-in-artificial-intelligence
6. https://techvidvan.com/tutorials/ai-heuristic-search/
7. https://www.analyticsvidhya.com/machine-learning/
8. https://www.javatpoint.com/decision-tree-induction
9. https://www.hackerearth.com/practice/machine-learning/machine-learning-
algorithms/ml-decision-tree/tutorial/
10. https://www.javatpoint.com/unsupervised-artificial-neural-networks

MAPPING of COs with POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2 3 2
CO2 3 3 3 2 3
CO3 3 3 3 2 3
CO4 3 3 3 2 3 2
Strength of correlation: Low-1, Medium-2, High-3

You might also like