Scribd
Upload
3 views1 page

AI Asignment

The document is an assignment for the MCA II course at GLA University, focusing on Artificial Intelligence with Python. It includes questions on informed search, heuristics, intelligent agents, expert systems, search algorithms, and problem-solving techniques in AI. The assignment covers various concepts such as the Turing test, adversarial search, A* search, and the MIN-MAX algorithm.

Uploaded by

saxenavaishnavi60
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

AI Asignment

The document is an assignment for the MCA II course at GLA University, focusing on Artificial Intelligence with Python. It includes questions on informed search, heuristics, intelligent agents, expert systems, search algorithms, and problem-solving techniques in AI. The assignment covers various concepts such as the Turing test, adversarial search, A* search, and the MIN-MAX algorithm.

Uploaded by

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

GLA University

Department of Computer Engineering & Applications


Course & Sem: MCA, II

Subject: Artificial Intelligence with Python (MCAC: 0025)


Assignemnt-1

1) Define informed search and heuristics. How do heuristic contribute to improve the efficiency of search
algorithms? Also explain the Best First search algorithm.
2) Explain the role of sensors and effectors in the functioning of intelligent agents.
3) Explain the basic principle of uninformed search strategies. Provide examples of algorithms falling under this
category.
4) Explain the role of Intelligent Agent in AI. List all types of Intelligent Agent.
5) Explain expert system with diagram. How does the inference engine contribute to learning?
6) Explain DFS with algorithm with suitable example.
7) Describe the Turing test with example.
8) Apply DFS and BFS search algorithms on the given graph answer the following questions:
a. Show the path to reach the goal P using both DFS and BFS
b. Show the path to reach the goal j using both DFS and BFS
c. Which algorithm reaches the goal P first?
d. Which algorithm reaches the goal J first?

9) What are the steps to define a problem? Explain and also discuss various components of a problem.
10) What is adversarial search? Write the steps for game problem formulation. State and explain min-max
algorithm diagram.
11) Discuss A* search techniques. Prove that A* is complete and optimal. Justify with Example.
12) Discuss the water jug problem in heuristic search techniques. You have a 4-gallon jug and a 3-gallon jug. You
need to measure out exactly 2–gallon of water. Write the steps.
13) What is Alpha-beta pruning? How alpha-beta pruning can improve MIN-MAX algorithms?
14) Solve this tree by using MIN-MAX algorithm.

You might also like