Bellari,V.V.

Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi ,Karnataka & Recognized by AICTE ,New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE
LEARNING

Course syllabus

Name of Staff : Dr. Vasanthamma. H

Subject/Course : Artificial Intelligence
Course Code : BAD402
Total Number of
Lecture Hours : 40
Class : IV Semester
Commencement of Semester : 10/02/2025 Last Working Day :31/5/2025

Course objectives:
The objectives of the course are to enable students to:

1. Gain a historical perspective of AI and its foundations.

2. Become familiar with basic principles of AI toward problem solving
3. Get to know approaches of inference, perception, knowledge representation, and learning

Module# Topics RBT Level

What is AI? Foundations and History of AI Intelligent Agents:
Module 1 Agents and environment, Concept of Rationality, The nature of
environment, The structure of agents. L1, L2,L3
Problem‐solving agents, Example problems, Searching for Solutions
Module 2 Uninformed Search Strategies: Breadth First search, Depth First
L1,L2,L3
Search, Iterative deepening depth first search;
Informed Search Strategies: Heuristic functions, Greedy best first
search, A*search. Heuristic Functions Logical Agents: Knowledge– L1,L2,L3
Module 3
based agents, The Wumpus world, Logic, Propositional logic,
Reasoningpatterns in Propositional Logic
First Order Logic: Representation Revisited, Syntax and Semantics
of First Order logic, Using First Order logic. Inference in First L1,L2,L3
Module 4
Order Logic :Propositional Versus First Order Inference,
Unification, Forward Chaining, Backward Chaining, Resolution
Uncertain Knowledge and Reasoning: Quantifying Uncertainty: L1,L2,L3
Acting under Uncertainty, Basic Probability Notation, Inference
Module 5 using Full Joint Distributions, Independence, Baye’s Rule and its
use. Wumpus World Revisited Expert Systems: Representing and
using domain knowledge, ES shells. Explanation, knowledge
acquisition
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi ,Karnataka & Recognized by AICTE ,New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE
LEARNING

Course Outcomes:
After studying this course, students will be able to:
Apply knowledge of agent architecture, searching and reasoning techniques for
22CSE214.1 different
applications.
Compare various searching and Inferencing Techniques.
22CSE214.2
22CSE214.3 Develop knowledge base sentences using propositional logic and first order logic
Describe the concepts of quantifying uncertainty.
22CSE214.4
Use the concepts of Expert Systems to build applications.
22CSE214.5

Textbook & Reference Books:

Text Book:

1. Stuart J. Russell and Peter Norvig , Artificial Intelligence, 3rd Edition, Pearson,2015
2. Elaine Rich, Kevin Knight, Artificial Intelligence, 3rd edition,Tata McGraw Hill,2013

Reference Books:

1. George F Lugar, Artificial Intelligence Structure and strategies for complex, Pearson Education, 5th
Edition, 2011

2. Nils J. Nilsson, Principles of Artificial Intelligence, Elsevier, 1980

3. Saroj Kaushik, Artificial Intelligence, Cengage learning, 2014

 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi ,Karnataka & Recognized by AICTE ,New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE
LEARNING

RBT and Learning Levels

RevisedBloom’s
LevelofLearning ActionVerbs
Taxonomy
Choose, Describe, Define, Identify, Label, List, Locate,
Level 1 Match, Memorize, Name, Omit, Recite, Select, State, Remember
Count, Draw, Outline, Point, Quote, Read, Recall,
Recognize, Repeat, Reproduce
Classify, Defend, Demonstrate, Distinguish, Explain,
Express, Extend, Give, Examples, Illustrate, Indicate,
Level 2 Interrelate, Interpret, Infer, Judge, Match, Paraphrase, Understand
Represent, Restate, Rewrite,Select, Show, Summarize,
Tell, Translate, Associate, Compute, Convert, Discuss,
Estimate, Extrapolate, Generalize, Predict
Apply, Choose, Dramatize, Explain, Generalize,
Judge, Organize, Paint, Prepare, Produce, Select,
Level 3 Show, Sketch, Solve, Use, Add, Calculate, Change, Apply
Classify, Complete, Compute, Discover, Divide,
Examine, Graph, Interpolate, Manipulate, Modify,
Operate, Subtract, Use
Analyze, Categorize, Classify, Compare, Differentiate,
Distinguish, Identify, Infer, Select, Subdivide, Survey,
Level 4 Arrange, Breakdown, Combine, Design, Detect, Analyse
Diagram, Develop, Discriminate, Illustrate, Outline,
Relate, Pointout, Separate,Utilize
Appraise, Judge, Criticize, Defend, Compare, Assess,
Level 5 Conclude, Contrast, Critique, Determine, Grade, Evaluate
Justify, Measure, Rank, Rate, Support, Test
Choose, Combine, Compose, Construct, Create,
Design, Develop, Do, Formulate, Hypothesize, Invent,
Level 6 Make, Originate, Organize, Plan, Produce, Role Play, Create
Tell, Compile, Drive, Devise, Explain, Generate,
Group, Integrate, Presc ribe, Propose, Rearrange,
Reconstruct, Reorganize, Revise, Rewrite, Transform
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi ,Karnataka & Recognized by AICTE ,New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE
LEARNING

LESSON PLAN
Department: Computer Science and Engineering-Artificial
Intelligence & Machine Learning Academic Year: 2024-2025

Semester : IV semester
Branch : CSE-AI&ML
Course : Artificial Intelligence

Course Code : BAD402

Faculty Name : Dr. Vasanthamma. H
Designation : Asso.Professor

Faculty HOD
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Periodic Lesson Plan

Date of Tools Used
Sl. Handling Acti Reso
Time Topics to be covered Video COs
No. Class BB PPT vity urces

✓ Text
1. What is AI? Foundations and 22CSE21.1 Book
History of AI
Text
2. What is AI? Foundations and 22CSE214.1
Book
History of AI
Intelligent Agents: Agents and Text
3. environment, ✓ 22CSE214.1 Book

Intelligent Agents: Agents and Text

4. environment, 22CSE214.1 Book

Concept of Rationality, The Text

5. nature of environment, The ✓ 22CSE214.1 Book
structure of agents.
Concept of Rationality, The Text
6. nature of environment, The 22CSE214.1 Book
structure of agents.
Problem‐solving agents, ✓ Text
7. 22CSE214.1 Book
Problem‐solving agents, Text
8. 22CSE214.1
Book
Text
Example problems, Searching ✓
9. 22CSE214.2 Book
for Solutions
Text
Example problems, Searching
10. 22CSE214.2 Book
for Solutions
Text
Uninformed Search Strategies: ✓
11. 22CSE214.2 Book
Breadth First search, Depth
First Search, Iterative
deepening depth first search;
Text
Uninformed Search Strategies:
12. 22CSE214.2 Book
Breadth First search, Depth
First Search, Iterative
deepening depth first search;
Text
Heuristic functions, Greedy best ✓
13. 22CSE214.2 Book
first search,
Text
Heuristic functions, Greedy best
14. 22CSE214.2 Book
first search,
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Text
A*search. Heuristic Functions ✓
15. 22CSE214.2 Book

Text
A*search. Heuristic Functions
16. 22CSE214.2 Book

Logical Agents: Knowledge– ✓ Text

17. based agents, The Wumpus 22CSE214.3 Book
world, Logic, Propositional
logic, Reasoning
patterns in Propositional Logic
Logical Agents: Knowledge– Text
18. based agents, The Wumpus 22CSE214.3
Book
world, Logic, Propositional
logic, Reasoning
patterns in Propositional Logic
Text
Representation Revisited, ✓
19. 22CSE214.3 Book

Text
Representation Revisited,
20. 22CSE214.3 Book

Syntax and Semantics of First Text

21. Order logic, ✓ 22CSE214.3 Book

Syntax and Semantics of First Text

22. Order logic, 22CSE214.3 Book

Using First Order ✓ ✓ Text

23. logic. 22CSE214.3 Book
Using First Order Text
24. logic. 22CSE214.3
Book
25 Text
Inference in First Order ✓ ✓ 22CSE214.3 Book
Logic :Propositional Versus First
Order Inference, Unification,
Forward
Chaining, Backward Chaining,
Resolution
26 22CSE214.3 Text
Inference in First Order Book
Logic :Propositional Versus First
Order Inference, Unification,
Forward
Chaining, Backward Chaining,
Resolution
✓ ✓ Text
27 Uncertain Knowledge and 22CSE214.3
Book
Reasoning: Quantifying
Uncertainty:
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Text
28 Uncertain Knowledge and 22CSE214.1
Book
Reasoning: Quantifying
Uncertainty:
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Acting under Uncertainty, Basic ✓ ✓ Text

29 Probability Notation, 22CSE214.1
Book
Acting under Uncertainty, Basic Text
28 Probability Notation, 22CSE214.1
Book
Inference using Full Joint ✓ Text
29 Distributions, 22CSE214.1 Book
Inference using Full Joint Text
30 Distributions, 22CSE214.1
Book
Independence, Baye’s Rule and its Text
31 use. 22CSE214.1
Book
Text
32 Independence, Baye’s Rule and its ✓ 22CSE214.1
Book
use.
Text
33 Wumpus World Revisited 22CSE214.1
Boo
k
✓ Text
34 Wumpus World Revisited 22CSE214.1
Book
Experts System: Representing and Text
35 22CSE214.1
using Demo Knowledge. Book
22CSE214.1 Text
Experts System: Representing ✓
36 Book
and using Demo Knowledge.
22CSE214.1 Text
Experts System: Representing
37 Book
and using Demo Knowledge.
38 ES shells. Explanation, knowledge 22CSE214.1 Text
acquisition ✓ ✓ Book
39 ES shells. Explanation, knowledge 22CSE214.1 Text
acquisition Book
ES shells. Explanation, knowledge 22CSE214.1 Text
40 acquisition ✓ Book

Signature of faculty Signature of HOD

 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

BallariV.V.Sangha’s CSEANDAIM
Proudhadevaraya InstituteofTechnology, Hosapete. L
(AffiliatedtoVTU,Belagavi,Karnataka&RecognizedbyAICTE, Exam
NewDelhi) InternalAssess
ment
Even Sem(2023-
24)
FIRSTINTERNALASSESSMENT
Sem: IV Sub: Artificial Intelligence SubCode: BAD402
Date: 20.06.2024 Time: 3.00PM to 04.00PM Max.Marks: 30

Define AI. Discuss the importance of AI with examples. 7 22CI211.1 L2

a
1
Define Total Turing test, logical positivism, tractable problems, 8 L2
b 22CI211.1
decision theory,
neurons
OR
Explain the significant contributions of various branches in the 22CI211.1 L2
7
2 a foundations of AI
Define five components of a problem. Write a complete state space 8 22CI211.1 L2
b for a vacuum cleaner to clean 2 squares P and Q. Q is to the right of
P

a For an automatic taxi driver application, explain Goal and utility 7 22CI211.2 L2
agents with appropriate block diagrams.
3 8 22CI211.2 L2
b With an algorithm explain BFS by considering a suitable example.

OR

a With a suitable graph, explain A* search algorithm write all the 7 22CI211.2 L2
4 steps
to find solution path.
b Explain DFS, considering a suitable graph. 8 L2
22CI211.2

Course co-ordinator HOD

 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

BallariV.V.Sangha’s CSE AND

Proudhadevaraya InstituteofTechnology, Hosapete. AIML
(AffiliatedtoVTU,Belagavi,Karnataka&RecognizedbyAICTE, Exam
NewDelhi) InternalAssessm
ent
EvenSem(2023
- 24)
S
ECOND INTERNALASSESSMENT

Sem: IV Sub: Artificial Intelligence SubCode: BAD402

Date: 20.06.2024 Time: 3.00PM to 04.00PM Max.Marks: 30

Q. Mark RBT
Description of Question CO
No s Level

a Explain knowledge based agents. Write a generic knowledge 7 22CI211.3 L2

1 based agent.
b Explain Forward chaining algorithm with example. 8 22CI211.4 L2

OR

a Discuss Wumpus world.Give PEAS description 7 22CI211.3 L2

2
8 L2
b Define First Order Logic(FOL) and explain its significance in 22CI211.4
representing knowledge in artificial intelligence
a Explain Baye’s rule and its rule in detail. 7 22CI211.5 L2
3
b Define Expert Systems? Explain the components of the Expert 8 22CI211.5 L2
system with a diagram.
OR
Explain Universal Quantification, Existential Quantification, 7 L2
a Nested Quantification with example. 22CI211.5
4
b Explain Inference using Full Joint Distribution. 8 22CI211.5 L2

Course co-ordinator HOD

 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

IV SEM
Scheme of Valuation
IA TEST -1
Q.No Description Marks
1.a Definition of AI: Clear definition of Artificial Intelligence: 7
machines mimicking human intelligence (e.g., learning,
reasoning).(2 marks)
Importance of AI: Explanation of AI's significance in:
Enhancing efficiency and accuracy.(1 marks)
- Improving decision-making and innovation.(1 marks)
- Transforming industries and daily life.(1 marks)
Examples of AI Applications: At least 2 real-world examples,
such as: Healthcare: AI diagnosing diseases (e.g., IBM Watson).(1
marks)
- Transportation: Self-driving cars (e.g., Tesla).(1 marks)
Other examples may include finance, entertainment, education,
etc.
1.b Total Turing Test: Definition and concept: A test that evaluates a 8
machine’s ability to exhibit intelligent behavior including vision
and robotics along with language.(1 marks)
Logical Positivism: Explanation: A philosophical theory
emphasizing that knowledge is based on empirically verifiable
facts and logical reasoning.(1.5 marks)
Tractable Problems: Definition: Problems that can be solved in
polynomial time, making them computationally feasible.
Examples are optional but add value.(1.5 marks)
Decision Theory: Explanation: The study of decision-making
processes under conditions of uncertainty, including utility and
risk considerations.(2 marks)
Neurons: Definition: Basic building blocks of the nervous system
that transmit information via electrical and chemical signals.
Relating to AI as artificial neurons in neural networks is a bonus.
(2 marks)
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Q.No Description Marks

2.a Introduction: Briefly introduce the interdisciplinary nature of AI 7
and its reliance on various foundational branches.(1 marks)
Contributions of Branches: Detailed explanation of
contributions from the following branches.(1 marks)
1. Philosophy: Concepts of logic, reasoning, and ethics in AI
development.(1 marks)
2. Mathematics: Contributions like formal algorithms,
probability, and statistics for AI models and predictions.(1 marks)
3. Computer Science: Development of programming languages,
algorithms, and computational power essential for AI.(1 marks)
4. Psychology: Insights into human cognition, learning, and
behavior for modeling intelligent systems.(1 marks)
5. Neuroscience: Inspiration for neural networks and
understanding of biological processes for AI systems.(1 marks)

2. b Definition of Problem Components: Clearly define the five 8

components of a problem:(5 marks)
- Initial State : The starting point or configuration of the problem.
(1 marks)
- Goal Test: Condition(s) that define when the problem is solved.
(1 marks)
- Actions:
Possible actions/moves to transition between states.
(1 marks)
- Transition Model: Description of how actions change the
current state to a new state.(1 marks)
- Path Cost: Measure of cost associated with a sequence of
actions, e.g., number of steps or energy usage.(1 marks)
State Space for Vacuum Cleaner: Write a complete state space
for cleaning squares P and Q (e.g., states, transitions, and goal).(3
marks)
- States: Include all possible combinations of vacuum position
and cleanliness of squares (e.g., (P, Dirty, Clean)).(1 marks)
- Transitions: Actions and their effects (e.g., "Move Right,"
"Clean").(1 marks)
- Goal: All squares are clean.(1 marks)
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Q.No Description Marks

3.a Introduction: Briefly explain the concept of agents in AI, 7
focusing on goal and utility-based agents.(1 marks)
Goal-Based Agent: (2.5 marks)
- Definition: Describe how goal-based agents operate by selecting
actions to achieve specific goals.(1 marks)
- Application Example: Explain its use in an automatic taxi
driver, e.g., reaching a destination as the goal.(1 marks)
- Block Diagram: Provide a diagram showing components:
perception, goal formulation, action selection, etc.(0.5 marks)
Utility-Based Agent: (2.5 marks)
- Definition: Describe how utility-based agents evaluate and
select actions based on a utility function.(1 marks)
- Application Example: Explain its use in an automatic taxi
driver, e.g., minimizing travel time, fuel usage, or maximizing
passenger comfort.(1 marks)
- Block Diagram: Provide a diagram showing components:
perception, utility function evaluation, action selection.(0.5 marks)
Comparison and Conclusion: Highlight the difference between
goal and utility agents briefly and their relevance.(1 marks)
3.b Definition of BFS: Provide a clear definition of BFS: BFS 8
explores all nodes at the current depth level before moving to the
next.(1 marks)
Algorithm of BFS: (3 marks)
- Step-by-step explanation: Write the BFS algorithm steps
clearly, including:
- Starting from the root node.(1 marks)
- Using a queue for traversal.(1 marks)
- Exploring neighbors of the current node before moving deeper.(1
marks)
Example of BFS: (3 marks)
- Graph Representation: Describe the graph or tree used for BFS
(e.g., adjacency list, adjacency matrix, or diagram).(1 marks)
- Step-by-step Execution: Illustrate the BFS process, showing the
contents of the queue and the order of visited nodes.(2 marks)
Conclusion:
Summarize the result of BFS, such as the traversal order of the
nodes.(1 marks)

Q.No Description Marks

4.a Introduction to A*: Briefly define the A* search algorithm, 7
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

mentioning its use of f(n)=g(n)+h(n)f(n) = g(n) + h(n)f(n)=g(n)

+h(n)(1 marks)
- g(n)g(n)g(n): Cost from the start node to the current node.
- h(n)h(n)h(n): Heuristic estimate of the cost from the current node
to the goal.
Graph Representation: Provide a suitable graph with nodes,
edges, edge costs, and heuristic values (hhh).(1 marks)
Steps of A Search*:
Write all steps to solve the graph, explaining the calculation of
f(n)f(n)f(n)(4 marks)
- Step 1: Initialization: Start with the initial node, set g(n)=0g(n)
= 0g(n)=0, and calculate f(n)f(n)f(n).(1 marks)
- Step 2: Node Expansion: Expand the node with the smallest
f(n)f(n)f(n) value and update the costs for its neighbors.(1 marks)
- Step 3: Update and Iterate: Repeat the process until the goal
node is reached, showing the open and closed lists at each step.(1
marks)
- Step 4: Solution Path: Trace the solution path from the start
node to the goal using the parent pointers.(1 marks)
Conclusion: Summarize the optimal path and its cost.(1 marks)
4.b Definition of DFS: Provide a clear definition of DFS: DFS 8
explores as far as possible along a branch before backtracking.(1
marks)
Graph Representation: Provide a suitable graph with nodes and
edges (either as a diagram, adjacency list, or adjacency matrix).(1
marks)
Algorithm of DFS: Write the steps of the DFS algorithm
clearly(3 marks)
- Initialization: Start from the initial node, marking it as visited.(1
marks)
- Exploration: Recursively explore unvisited neighbors of the
current node.(1 marks)
- Backtracking: Return to the previous node if no unvisited
neighbors are left.(1 marks)
DFS Execution Example(3 marks)
- Step-by-step Execution: Illustrate the DFS process using the
graph, showing the traversal order and marking visited nodes.(2
marks)
- Output: Write the final traversal order (e.g., A → B → D → E
→ C).(1 marks)
Conclusion: Summarize how DFS works for the graph,
highlighting its advantages (e.g., low memory usage).(1 marks)

IV SEM
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Scheme of Valuation
IA TEST -II
Q.No Description Marks
1.a Definition of Knowledge-Based Agents: Provide a clear 7
definition: Agents that use knowledge representation and
reasoning to make decisions and take actions.(1.5 marks)
Components of Knowledge-Based Agents: Explain the
components(2 marks)
- Knowledge Base (KB): Storage of facts and rules about the
environment.(1 marks)
- Inference Mechanism: Logic and reasoning to derive new
knowledge or make decisions based on the KB.(1 marks)
Generic Knowledge-Based Agent: Write the structure of a
generic knowledge-based agent(3 marks)
- Initialization: Define the knowledge base and initialize the
agent.(0.5 marks)
- Perceive: Describe how the agent perceives inputs from the
environment.(0.5 marks)
- Update Knowledge Base: Explain how the agent updates its
knowledge base using new percepts.(0.5 marks)
- Reason and Act: Explain how the agent reasons using inference
and performs actions based on the conclusions.(0.5 marks)
- Algorithm/Code: Provide a simple pseudocode or algorithm for
the generic knowledge-based agent.(1 marks)
Conclusion: Summarize the advantages of knowledge-based
agents, such as flexibility and reasoning capabilities.(0.5 marks)
1.b Definition of Forward Chaining: Explain forward chaining as a 8
data-driven reasoning approach starting from known facts to
derive conclusions.(1 marks)
Algorithm Steps: Describe the steps of the forward chaining
algorithm(3 marks)
- Step 1: Initialization: Begin with a set of known facts and a
knowledge base of rules.(1 marks)
- Step 2: Matching Rules: Identify rules where the premises
match known facts.(1 marks)
- Step 3: Firing Rules: Apply the matched rule, add the resulting
conclusions to the fact base, and repeat until the goal is achieved
or no new rules are applicable.(1 marks)
Example: Provide a suitable example to illustrate forward
chaining(3 marks)
- Knowledge Base: Define a set of rules (e.g., IF-THEN
statements) and initial facts.(1 marks)
- Step-by-step Execution: Show how facts are matched to rules
and new facts are inferred at each step.(2 marks)
Conclusion: Summarize the result and highlight forward
chaining’s suitability for data-driven scenarios like diagnostics or
expert systems.(1 marks)
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Q.No Description Marks

2.a Introduction to Wumpus World: Briefly describe the Wumpus 7
World as a grid-based environment in which an agent must
navigate to find gold while avoiding hazards like the Wumpus and
pits.(1 marks)
Key Features of Wumpus World: Discuss the key elements,
such as(2 marks)
- Environment: Grid with hazards (Wumpus, pits) and percepts
(stench, breeze, glitter).(1 marks)
- Agent’s Goal: Locate and grab gold while avoiding hazards.(1
marks)
PEAS Description: Provide the PEAS (Performance,
Environment, Actuators, Sensors) description for the Wumpus
World agent(3 marks)
- Performance Measure: Describe success criteria (e.g., grabbing
gold, avoiding hazards, minimizing steps).(0.75 marks)
- Environment: Outline the Wumpus World grid environment
(partially observable, stochastic).(0.75 marks)
- Actuators: Mention actions the agent can perform (e.g., move
forward, turn, grab, shoot).(0.75 marks)
- Sensors: Highlight the agent’s sensors (e.g., perceiving stench,
breeze, glitter, bump)(0.75 marks)
Conclusion: Summarize the importance of Wumpus World in
studying logical agents and decision-making in uncertain
environments.(0.5 marks)
2.b Definition of FOL:
Provide a clear definition: FOL is a formal system used to
express knowledge using objects, relations, and quantifiers.(2
marks)
Components of FOL: Explain the components of FOL(2
marks)
- Constants: Represent specific objects in the domain.(0.5 marks)
- Predicates: Describe relationships or properties of objects.(0.5
marks)
- Functions: Map objects to other objects (if applicable).(0.5
marks)
- Quantifiers: Include universal (∀\forall∀) and existential (∃\
exists∃) quantifiers.(0.5 marks)
Significance of FOL: Discuss its role in AI knowledge
representation(3 marks)
- Expressiveness
:
Ability to represent complex relationships and generalizations.(1
marks)
- Reasoning: Enables inference and deduction based on
knowledge (e.g., modus ponens).(1 marks)
- Applications: Examples such as expert systems, natural
language understanding, and automated theorem proving.(1
marks)
Conclusion: Summarize FOL’s importance as a foundation for
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

logical reasoning in AI.(1 marks)

Q.No Description Marks

3.a Definition of Bayes’ Rule: Provide a clear definition of Bayes' 7
Rule: A mathematical formula to calculate conditional
probabilities.(1.5 marks)
Bayes’ Rule Formula:
Write the formula: ( P(A B) = \frac{P(B
- ( P(A B) ): Posterior Probability Probability of AAA given BBB.
- ( P(B A) ): Likelihood Probability of BBB given AAA.
- P(A)P(A)P(A): Prior Probability: Initial belief about A.(0.25
marks)
- P(B)P(B)P(B): Marginal Probability: Total probability of BBB.
(0.25 marks)
Explanation of Bayes’ Rule: Explain how the rule updates
beliefs based on new evidence.(1.5 marks)
Role in AI: Discuss the significance of Bayes' Rule in AI and
applications:(2 marks)
- Uncertainty Management: Helps in making decisions under
uncertain conditions.(0.5 marks)
- Applications:
Examples like spam filtering, medical diagnosis, and Bayesian
networks.
(1 marks)
- Probabilistic Reasoning: Enables reasoning with incomplete or
probabilistic knowledge.(0.5 marks)
Conclusion: Summarize its importance as a foundational tool in
probabilistic reasoning and decision-making in AI.(0.5 marks)
3.b Definition of Expert System: A clear and concise definition of an 8
Expert System, explaining its purpose and functionality.(2 marks)
Components Explanation: Detailed explanation of key
components: Knowledge Base, Inference Engine, User Interface,
Explanation Module, and Knowledge Acquisition Module.(4
marks)
Diagram Representation: A well-labeled and structured diagram
depicting the working of an Expert System.(2 marks)

Q.No Description Marks

4.a Definition of Universal Quantification: Explanation of universal 7
quantifier (∀) and its meaning in predicate logic with an example.
(2 marks)
Definition of Existential Quantification: Explanation of
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

existential quantifier (∃) and its application in predicate logic with

an example.(2 marks)
Definition of Nested Quantification: Explanation of using
multiple quantifiers together (nested) with an example.(2 marks)
Clarity and Proper Representation: Complete and structured
response.(1 marks)
4.b Definition of Full Joint Distribution: Clear explanation of what 8
a full joint distribution represents in probabilistic models.(2
marks)
Explanation of Inference: Description of how inference works
using the full joint distribution(2 marks)
Steps in Inference Process: Step-by-step explanation of the
process with mathematical representation.(3 marks)
Example: Relevant example to illustrate inference using full joint
distribution.(1 marks)
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

4thSEMESTERCSE&CSE-AIML
Sub: Artificial Intelligence Internal marks
 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(Affiliated to VTU, Belagavi, Karnataka & Recognized by AICTE, New Delhi)
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

TH PR TOTAL SIGN
SL NO USN Name
1. Aishwarya SidagondaPatil 22 24 46
3PG22CI001
2. AmbujaYallappa Kavalur 20 24 44
3PG22CI002
3. 3PG22CI003 B Muktha 16 24 40

4. 3PG22CI005 EjajAhamed 18 20 38

5. 3PG22CI006 SadiyaI M 22 24 46

6. 3PG22CI007 K Bhoomika 15 23 38

7. 17 22 39
3PG22CI008 Kartik S
8. 3PG22CI009 S Khaja Moinuddin 18 22 40

9. 3PG22CI010 LekhaSahiti P 17 24 41

10. 3PG22CI011 M N Tejashwini 17 23 30

11. 3PG22CI012 Manoj Bhavikatti 13 20 33

12. 3PG22CI013 MeethKawad 20 24 44

13. 3PG22CI014 MohammedHaneef 19 25 44

14. Mohammed 15 22 37
3PG22CI015
Shahezan
15. 3PG22CI016 MuskanBegum 22 24 46

16. 3PG22CI017 Muskan G 22 23 45

17. 3PG22CI018 NaveenM Unkal 18 22 30

18. PasumarthiHari 15 20 35
3PG22CI019
Kiran
19. 3PG22CI021 Rayudu Nikhitha 19 24 43

20. 3PG22CI022 Sahana B 16 22 38

 Bellari,V.V.Sangha’s
PROUDHADEVARAYAINSTITUTEOFTECHNOLOGY
T.B.DAM,HOSAPETE–583225
(AffiliatedtoVTU,Belagavi,Karnataka&RecognizedbyAICTE,NewDelhi)
DEPARTMENTOFCOMPUTERSCIENCEANDENGINEERING

21. 3PG22CI023 Sahana M 18 24 42

22. 3PG22CI024 Shriraj M Gaonkar 14 22 36

23. 3PG22CI025 Srivatsa S Narayan 15 20 35

24. 3PG22CI026 Suhana 23 22 45

25. SyedaRabiya 22 24 46
3PG22CI027
Hashmi
26. 3PG22CI028 T KarthikVarma 22 25 47

27. 3PG22CI029 Tarun S 22 22 44

28. 3PG22CI030 Varsha H 18 23 41

29. 3PG22CI031 Gurukiran 13 13 26

30. 3PG23CI400 Anusha B 15 20 35

31. 3PG23CI401 Mohan M 13 13 26