DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

NATIONAL INSTITUTE OF TECHNOLOGY, TIRUCHIRAPPALLI

COURSE PLAN – PART I
Name of the
programme and B.Tech Computer Science and Engineering
specialization
Course Title Introduction to Artificial Intelligence and Machine learning

Course Code CSPC54 No. of Credits 4 - (3 – 0 - 2)

Course Code of Pre-
CSPC11
requisite subject(s)
Section
Session July 2022 A/B
(if, applicable)
Rajeswari Sridhar Computer Science
Name of Faculty Department
and Engineering

Email [email protected] Telephone No.

Name of Course
Coordinator(s) ----
(if, applicable)
E-mail Telephone No.
Course Type √ Core course Elective course

Syllabus (approved in BoS)

2019
COURSE OBJECTIVES
 To learn the concepts of searching for AI problems
 To learn about agents and knowledge representation
 To understand the various factors involved in inferences
 To get introduced to fundamentals of machine learning
 To learn about the possibilities of Supervised and Unsupervised learning
COURSE OUTCOMES (CO)
Aligned Programme
Course Outcomes
Outcomes (PO)
Upon completion of the course, the students will be able to
PO1, PO2, PO3, PO5,
1. Suggest appropriate search strategies for any AI problem PO9

PO1, PO3, PO4, PO6

2. Design agents for any given problem

3. Represent real world knowledge using first order or

PO1, PO3, PO4
propositional logic
4. Solve problems by appropriated using the supervised or
PO1, PO3
unsupervised machine learning algorithms
5. Suggest appropriate clustering algorithm for solving real-
PO1, PO2, PO3, PO12
world problems

Page 1 of 7
 COURSE PLAN – PART II
COURSE OVERVIEW
This course introduces the basics of Artificial Intelligence. AI is a branch of
Computer science that deals with the algorithms and reasoning to make the
machines think. AI deals with knowledge representation, reasoning and
inferencing. To reason and infer, machine learning algorithms are used. This
course introduces the fundamental concepts of AI with reference to knowledge
representation, search strategies, inferencing. Basics of Supervised and
unsupervised machine learning algorithms are also discussed to support
inferencing.
COURSE TEACHING AND LEARNING ACTIVITIES
S.No. Week/Contact Topic Mode of Delivery
Hours
10/08/2022 to AI – Need, Use, Applications, PPT/CHALK AND TALK
1 12/08/2022 Live examples, History of AI
1 hour
10/08/2022 to
2 12/08/2022 LAB – Prolog exercise leading to LAB
2 hours search
15/08/2022 to Agents, AI and cognition, AI and PPT/CHALK AND TALK
3 19/08/2022 Rationality, Agents introduction
2 hours
15/08/2022 to LAB – Search strategies in
4 19/08/2022 Prolog Lab
2 hours

22/08/2022 to Structure of Intelligent agents, PPT/CHALK AND TALK

26/08/2022 Vacuum cleaner example,
5 1 hour Environments, problem solving
methods, Problem solving
agents, Formulating problems.
22/08/2022 to Search strategies, Breadth-first, PPT/CHALK AND TALK
26/08/2022 Uniform cost, Depth-first,
2 hours Depth limited, Bidirectional,
6 Informed Search, and Best-first
Heuristic Functions.
PPT/CHALK AND
TALK/CHALK AND TALK
22/08/2022 to LAB – N-Queens problem, TSP LAB
7 26/08/2022 problem
2 hours

29/08/2022 to Memory bounded search - A* - PPT/CHALK AND TALK

02/09/2022 SMA*. Iterative Improvement
2 hours algorithms - Hill Climbing and
8
Simulated annealing. Measure
of performance and analysis of
search algorithms
Page 2 of 7
 29/08/2022 to Game playing, Perfect PPT/CHALK AND TALK
9 02/09/2022 Decisions, Imperfect Decisions,
1 hour State space tree

29/08/2022 to LAB – Tic tac toe game – LISP, LAB

10 02/09/2022 Prolog
2 hours

05/09/2022 to Alpha-beta pruning, Knowledge PPT/CHALK AND TALK

11 09/09/2022 based agent, Wumpus World
2 hours Environment

05/09/2022 to Propositional logic, agent for PPT/CHALK AND TALK

09/09/2022 wumpus world, First order
12
1 hour logic, syntax, semantics,
extensions
05/09/2022 to LAB – Logic based problem LAB
09/09/2022 solving. 3-SAT and 3-CNF
13
2 hours based problem

12/09/2022 to Using First order logic. PPT/CHALK AND TALK

14 16/09/2022 Problems and use.
1 hour

12/09/2022 to Representation change in the PPT/CHALK AND TALK

16/09/2022 world, Goal based agents
15
1 hour

12/09/2022 to Knowledge Base, Knowledge PPT/CHALK AND TALK

16/09/2022 representation
16
1 hour

12/09/2022 to LAB – Sudoku problem solving Lab

16/09/2022
17
2 hours

19/09/2022 to Cycle Test 1 Written

23/09/2022
18
1 hours

19/09/2022 to Production based system - PPT/CHALK AND TALK

23/09/2022 Frame based system
19
2 hours

26/09/2022 to LAB – Sorting algorithms using Lab

20 30/09/2022 forward chaining
2 hours

26/09/2022 to Inference, Backward chaining, PPT/CHALK AND TALK

30/09/2022 Forward chaining.
21
2 hour

Page 3 of 7
 26/09/2022 to Knowledge Representation PPT/CHALK AND TALK
30/09/2022 using Ontology
22
1 hour

03/10/2022 to LAB – Ontology construction Lab

07/10/2022 tools
23
2 hours

03/10/2022 to Problems PPT/CHALK AND TALK

24 07/10/2022
1 hour

10/10/2022 to Reasoning using Ontology, PPT/CHALK AND TALK

14/10/2022 Construction
25
2 hours

10/10/2022 to Lab Project Coding

14/10/2022
26
2 hours

10/10/2022 to Learning from agents, inductive PPT/CHALK AND TALK

14/10/2022 learning
27
1 hour

17/10/2022 to LAB – LISP for solving agents Lab

21/10/2022
28
2 hours

17/10/2022 to Types of Machine learning - PPT/CHALK AND TALK

21/10/2022 Supervised learning - learning
29
2 hours decision trees

17/10/2022 to Support vector machines PPT/CHALK AND TALK

30 21/10/2022
1 hour

24/10/2022 to LAB – WEKA tool study Lab

28/10/2022
31
2 hours

24/10/2022 to Neural and Belief networks, PPT/CHALK AND TALK

32 28/10/2022 Perceptron
1 hour

24/10/2022 to Multi-layer feed forward PPT/CHALK AND TALK

28/10/2022 networks
33
1 hour

31/10/2022 to LAB – SVM, Decision trees Lab

04/11/2022 implementation in WEKA
34
2 hours

Page 4 of 7
 31/10/2022 to Bayesian belief networks. PPT/CHALK AND TALK
04/11/2022
35
2 hours

31/10/2022 to Bayesian belief networks – PPT/CHALK AND TALK

04/11/2022 inferencing
36
1 hours

07/11/2022 to LAB – ANN , BBN Study in Lab

11/11/2022 WEKA
37
2 hours

07/11/2022 to Unsupervised learning - PPT/CHALK AND TALK

11/11/2022 introduction
38
2 hours

07/11/2022 to Top down clustering – k-means PPT/CHALK AND TALK

11/11/2022 clustering
39
1 hours

14/11/2022 to K-means clustering, problems PPT/CHALK AND TALK

18/11/2022
40
2 hours

14/11/2022 to Hierarchical Clustering PPT/CHALK AND TALK

18/11/2022
41
1 hour

14/11/2022 to LAB – Implementation of Top Lab

18/11/2022 down and bottom up clustering
42
2 hours

21/11/2022 to Cycle Test 2 Written

25/11/2022
43
1 hour

28/11/2022 to Agglomerative clustering – PPT/CHALK AND TALK

30/11/2022 Single link, complete link,
44
2 hours average link, centroid based

22/11/2021 to LAB – Demo of project Lab

45 26/11/2021
2 hours

Text Books
1. Stuart Russel, Peter Norvig, “AI – A Modern Approach”, Second Edition, Pearson
Education, 2007.
2. Kevin Night, Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, McGraw Hill, 2008.
Reference books
1. Vinod Chandra SS, Anand Hareendran S, “Artificial and Machine Learning”, First
Edition, PHI Learning, 2014.
2. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007
Page 5 of 7
3. G. Luger, W. A. Sttubblefield, “Artificial Intelligence”, Third Edition, Addison-Wesley
Longman, 1998.
4. N. J. Nilson, “Principles of Artificial Intelligence”, Narosa Publishing House, 1980.
5. Tom Mitchell, “Machine Learning”, First Edition, Tata McGraw Hill India, 2017.
COURSE ASSESSMENT METHODS (shall range from 4 to 6)
S.No. Mode of Assessment Week/Date Duration % Weightage
19/09/2022
1 Cycle Test 1 to 1 hour 15
23/09/2022
21/11/2022
to
2 Cycle Test 2 1 hour 15
25/11/2022

Lab Continuous Full Semester Weekly

3 15
Assessment assignment
October,
5 Project November, 12 hours 15
2022
As per
Compensation
CPA academic 1 hour 15
Assessment*
schedule
As per As per
6 Final Assessment * academic institute 40
schedule norms

*mandatory; refer to guidelines on page 4

COURSE EXIT SURVEY (mention the ways in which the feedback about the course shall
be assessed)
1. Students’ feedback through class committee meetings
2. Feedbacks are collected before final examination through MIS or any
other standard format followed by the institute
3. Students, through their Class Representatives, may give their feedback at
any time to the course faculty which will be duly addressed.

COURSE POLICY (preferred mode of correspondence with students, compensation

assessment policy to be specified)

MODE OF CORRESPONDENCE (email/ phone etc)

Email, In-person between 4 pm and 5 pm on weekdays.

COMPENSATION ASSESSMENT POLICY

1. One compensation assessment will be given after completion of Cycle

Test 1 and 2 for the students those who are absent for any assessment
Page 6 of 7