THENI KAMMAVAR SANGAM COLLEGE OF TECHNOLOGY

KODUVILARPATTI, THENI – 625 534

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING)
INTERNAL ASSESSMENT TEST 1 ANSWER KEY
Branch/Year/Sem : CSE(AIML)/II/IV Date: 10.02.2026
Subject Code/Name : AL3391 Artificial Intelligence
Time : 1.50 Hrs Max. Marks : 60
Answer All Questions BT Level
PART – A (10×2=20)

1. Define an Intelligent Agent with an example.

An Intelligent Agent is an entity that perceives its environment through sensors and acts
upon that environment through actuators to achieve goals.
Example: A self-driving car that senses traffic and controls steering and speed.

2. What is meant by a Rational Agent?

A Rational Agent is an agent that chooses the action that maximizes its performance
measure based on its percept sequence and knowledge.

3. List any two Performance Measures of an agent.

● Accuracy

● Speed
(Others: Safety, Energy consumption, Cost efficiency)

4. What is an Environment in AI? Mention any two types.

The Environment is everything external to the agent with which the agent interacts.
Types:

● Fully observable environment

● Partially observable environment

5. Differentiate between Simple Reflex Agent and Model-Based Agent.

Simple Reflex Agent Model-Based Agent

Acts only on current percept Uses internal model

No memory Maintains state

Suitable for simple environments Suitable for complex environments

6. Define Problem Solving Agent.

A Problem Solving Agent is an agent that decides what actions to take by formulating a
problem and searching for a sequence of actions that leads to a goal.

7. What is a State Space?

A State Space is the set of all possible states that can be reached from the initial state by
applying actions.

8. What is meant by Heuristic Function?

A Heuristic Function h(n) estimates the cost from a node n to the goal, helping to guide
informed search.

9. Write any two differences between BFS and DFS.

BFS DFS

Explores level by level Explores depth first

Uses Queue Uses Stack

Complete May not be complete

10. What is Uniform Cost Search?

Uniform Cost Search (UCS) is a search algorithm that expands the node with the lowest
path cost, ensuring an optimal solution.

PART – B (4 × 10 = 40)

11. (a) Explain in detail about the structure of different agents.

An agent consists of sensors, actuators, and an agent program.

Types of Agents:

1. Simple Reflex Agent

● Acts based on current percept

● Uses condition–action rules

● No memory

2. Model-Based Agent

● Maintains internal state

● Handles partially observable environments

3. Goal-Based Agent

● Chooses actions to achieve a goal

 ● Uses search and planning

4. Utility-Based Agent

● Uses utility function

● Chooses actions that maximize utility

5. Learning Agent

● Improves performance over time

● Components: learning element, critic, performance element

Draw Diagram and agent function (Ref notes)

11. (b) Discuss the concept of rationality and different types of environments with
examples.

Rationality

An agent is rational if it performs actions that maximize expected performance measure.

Types of Environments:

● Fully observable: Chess

● Partially observable: Medical diagnosis

● Deterministic: Crossword puzzle

● Stochastic: Taxi driving

● Episodic: Image classification

● Sequential: Game playing

(Ref notes)

12. (a) Explain Uniform Cost Search and Depth Limited Search algorithm.

Uniform Cost Search (UCS):

● Expands lowest cost node first

● Uses priority queue

● Complete and optimal

Algorithm:
 1. Insert initial node with cost 0

2. Expand node with least cost

3. Stop when goal is reached

Draw any graph as example and write algorithm (Ref notes)

Depth Limited Search (DLS):

● DFS with depth limit l

● Avoids infinite loops

Properties:

● Not complete if limit < depth

● Space efficient

Draw any graph as example and write algorithm (Ref notes)

12. (b) Explain BFS, DFS with algorithms and comparison.

Breadth First Search (BFS):

● Explores nodes level by level

● Uses Queue

Depth First Search (DFS):

● Explores deepest node first

● Uses Stack

Draw any graph as example and write algorithm (Ref notes)

Comparison:
BFS DFS

Complete Not always complete

High memory Low memory

Optimal Not optimal

13. (a) Explain Hill Climbing Tree Search with its properties.

Hill Climbing is a local search algorithm that moves to the neighbor with better heuristic
value.
Properties:

● Uses only local information

● Fast and memory efficient

● Can get stuck in local maxima

Explain 8-queen problem as example and write algorithm (Ref notes)

13. (b) Describe search in non-deterministic and partially observable environments.

Non-Deterministic Environment:

● Action outcomes are unpredictable

● Uses AND-OR search trees

Partially Observable Environment:

● Agent does not know full state

● Maintains belief state

Explain Erratic vacuum world problem as example and write algorithm (Ref notes)

14. (a) Explain the A* search with examples.

A* Search is an informed search algorithm using:

f(n)=g(n)+h(n)

Where:

● g(n) = cost from start to n

● h(n) = heuristic estimate

Properties:

● Complete

● Optimal (with admissible heuristic)

Example: Path finding in maps

14. (b) Explain local search and optimization problems in detail.

Local Search:

● Focuses on improving current solution

● Uses small changes

Optimization Problems:

● Find best solution among many

● Examples:

○ 8-Queen problem

○ Travelling Salesman Problem

Algorithms:

● Hill climbing

● Simulated annealing

● Genetic algorithms

Draw any graph as example and write algorithm (Ref notes)