LESSON PLAN
Name of the Faculty: Academic Year: 2025-2026
Subject Code & Name: ARTIFICIAL INTELLIGENCE Semester/Year: V-SEM (ODD)
Course objectives:
To learn various concepts of AI Techniques
To learn various Search Algorithm in AI
To learn probabilistic reasoning and models in AI.
To learn about Markov Decision Process
To learn various types of Reinforcement learning.
UNIT I (15 Hours)
Introduction
Introduction: Concept of AI, history, current status, scope, agents, environments, Problem
Formulations, Review of tree and graph structures, State space representation, Search graph and
Search tree
Remarks
S.N Proposed Actual Delivery Refere Pag (Assignmen
Topics to be covered t/
o. Date Date Method nce e No
Seminar
/Test)
1 Introduction C&T
2 Concept of AI C&T
3 History C&T
4 current status C&T
5 scope C&T
6 agents C&T
7 environments C&T
Problem C&T
8
Formulations
9 Review of tree C&T
10 graph structures C&T
State space C&T
11
representation
12 Search graph C&T
13 Search tree C&T
UNIT II (15 Hours)
Search Algorithms : Random search, Search with closed and open list, Depth first and
Breadth first search, Heuristic search, Best first search, A* algorithm, Game Search
Remarks
[Link] Proposed Actual Delivery Refere Pag (Assignmen
Topics to be covered t/
. Date Date Method nce e No
Seminar
/Test)
1 Search Algorithms C&T
2 Random search C&T
Search with closed C&T
3
and open list
4 Depth first search C&T
5 Breadth first search C&T
6 Method overriding C&T
7 Heuristic search C&T
8 Best first search C&T
9 A* algorithm C&T
10 Game Search C&T
UNIT III (15 hours)
Probabilistic Reasoning : Probability, conditional probability, Bayes Rule, Bayesian Networks-
representation, construction and inference, temporal model, hidden Markov model
Remarks
[Link] Proposed Actual Delivery Refere Pag (Assignmen
Topics to be covered t/
. Date Date Method nce e No
Seminar
/Test)
Probabilistic
1 C&T
Reasoning
2 Probability C&T
conditional C&T
3
probability
4 Bayes Rule C&T
5 Bayesian Networks C&T
6 representation C&T
7 construction C&T
8 inference C&T
9 temporal model C&T
10 hidden Markov C&T
model
UNIT IV (15 hours)
Markov Decision Process : MDP formulation, utility theory, utility functions, value iteration,
policy iteration and partially observable MDPs.
Remarks
[Link] Proposed Actual Delivery Refere Pag (Assignmen
Topics to be covered t/
. Date Date Method nce e No
Seminar
/Test)
Markov Decision
1 C&T
Process
2 MDP formulation C&T
3 utility theory C&T
4 utility functions C&T
5 value iteration C&T
6 policy iteration C&T
partially observable C&T
7
MDPs
UNIT V (15 hours)
Reinforcement Learning : Passive reinforcement learning, direct utility estimation, adaptive
dynamic programming, temporal difference learning, active reinforcement learning- Q learning
Remarks
[Link] Proposed Actual Delivery Refere Pag (Assignmen
Topics to be covered t/
. Date Date Method nce e No
Seminar
/Test)
Reinforcement
1 C&T
Learning
Passive C&T
2 reinforcement
learning
direct utility C&T
3
estimation
adaptive dynamic C&T
4
programming
temporal difference C&T
5
learning
active reinforcement C&T
6
learning
7 Q learning C&T