Scribd
Upload
42 views3 pages

Review Questions

Uploaded by

Vani Saran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
42 views3 pages

Review Questions

Uploaded by

Vani Saran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

DEPARTMENT OF ARTIFICIAL INTELLIGNCE AND DATA SCIENECE

B.E. / B.Tech. (Full Time) –Internal Assessment Test-I, March 2023


REGULATION – 2021
Review Questions

2 marks

1. Define a Rational agent.


2. Under what condition reflex agent is not used in AI.
3. What is meant by state space?
4. Illustrate search and search algorithm with example.
5. List out the various types of informed search algorithm.
6. State advantages and disadvantages of A* search algorithm.
7. What is meant by local search algorithm?
8. What are the components of well-defined problems?
9. Will you state or interpret in your own words PEAS description for a Vacuum cleaner?
10. Define the problem solving agent.
11. Differentiate between Uninformed Search and Informed Search strategies.
12. What is Heuristic function?
13. What if we have much larger search spaces?
14. Define Discrete variable.
15. Define Continuous variable.
16. Give the definition of game.
17. How many solutions are there for the map-coloring problem in Figure 6.1? How many solutions if four
colors are allowed? Two colors?

18. Define constraint satisfaction problem (CSP). How CSP is formulated as a search problem? Explain
with an example.
13 marks questions
1. Demonstrate the structure of different types of intelligent agents with suitable diagram.
2. Analyze the various types of environment in AI with examples.
3. Write short note on well define problem and solution.
4. Illustrate in detail about DFS algorithm for given example.

5. Evaluate BFS algorithm for given example.

6. Explain in detail with neat examples.


a. Iterative deepening DFS
b. Bidirectional search algorithm
7. Examine A* search algorithm for given graph with suitable algorithm.
8. Examine A* search algorithm for given 8 puzzle problem with suitable algorithm.

9. Simplify Hill climbing search algorithm with example.

10. Summarize AND-OR search tree for vacuum cleaner example.


11. Analyze alpha-beta pruning algorithm and the Min-max game playing algorithm for a given tree.

12. Explain CSP in detail.


13. Evaluate the structure of agent with neat diagram
14. Discuss the problem with hill climbing algorithm.
15. Write short notes on Pseudocode for problem solving agent.
16. Illustrate the Searching with observations with neat diagram.
17. Distinguish between DFS and BFS.

You might also like