The document outlines a set of assignment questions for a course on artificial intelligence and data science, focusing on concepts like agents, algorithms, and various search techniques. It includes directives for analyzing and evaluating different algorithm types such as DFS, BFS, and A*, as well as practical examples like the 8 puzzle problem. Submission is required by November 20, 2023, and the document specifies the course outcomes and cognitive levels for assessment.

1. 1
DEPARTMENT OF ARTIFICIAL INTELLIGNCE AND DATA SCIENECE
B.E. / B.Tech. (Full Time), March 2023
REGULATION - 2021
AI3391 ARTIFICIAL INTELLIGENCE
ASSIGNMENT 1 QUESTIONS
Course Instructor : M.Gokilavani Max. Marks : 100
Year / Semester : II/III Submission Date : 20.11.2023
1. What is an Agent?
2. What is Rational Agent?
Knowledge
Level
K1: Remembering K2: Understanding K3: Applying K4: Analysing K5: Evaluating K6: Creating
Course
Outcomes
C201.1 Explain intelligent agent frameworks.
C201.2 Apply problem solving techniques.
C201.3 Apply game playing and CSP techniques.

2. 2
3. Draw the Possible states of Vacuum Cleaner (Toy Problem example).

3. 3
4. Illustrate in detail about DFS algorithm for given example.
a.
Definition of DFS:
Algorithm of DFS:

4. 4
Solved Solution for given Graph:
b.
Solved Solution for given Graph:

5. 5
Advantages:
Disadvantages:
5. Evaluate BFS algorithm for given example.
Definition of BFS:

6. 6
Algorithm of DFS:
Solved Solution for given Graph:
Advantages:
Disadvantages:

7. 7
6. Examine A* search algorithm for given graph with suitable algorithm.
Definition of A*:
Heuristic function:

8. 8
Algorithm of A*:
Solved Solution for given Graph:

9. 9
Advantages:
Disadvantages:

10. 10
7. Examine A* search algorithm for given 8 puzzle problem with suitable algorithm.
Heuristic function:
Algorithm of 8 Puzzle:

11. 11
Solved Solution for given Graph:

12. 12
8. Simplify Hill climbing search algorithm with example.
Definition of Hill Climbing search:
Algorithm for Hill Climbing Search:

13. 13
Solution:
Advantages:
Disadvantages:

14. 14
9. Explain in detail with neat examples.
a. Iterative deepening DFS
b. Bidirectional search algorithm

15. 15

16. 16