Scribd
Upload
51 views2 pages

Ai Unit 02 Questions

The document discusses search algorithms and artificial intelligence. It provides definitions and examples of uninformed and informed searches, including breadth-first search, depth-first search, uniform-cost search, A* search and heuristic search. It also lists multiple choice and descriptive questions about the algorithms.

Uploaded by

rakshithadahnu
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
51 views2 pages

Ai Unit 02 Questions

The document discusses search algorithms and artificial intelligence. It provides definitions and examples of uninformed and informed searches, including breadth-first search, depth-first search, uniform-cost search, A* search and heuristic search. It also lists multiple choice and descriptive questions about the algorithms.

Uploaded by

rakshithadahnu
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/ 2

ARTIFICIAL INTELLIGENCE AND ITS APPLICATION

Unit – 02
2 mark questions
1. Mention performance measure using problem solving agent.
2. What is searching?
3. Mention the different terminologies used in search algorithm.
4. Mention different types of search algorithm.
5. How to measure the efficiency of the algorithm.
6. What is an informed search (Blind Search)?
7. Mention different types of uninformed search.
8. What is informed search?
9. Mention different types of inform search.
10. What are the advantages and disadvantages of BFS?
11. What is the time complexity of BFS algorithm?
12. What are the advantages and disadvantages of DFS?
13. What is the time and space complexity of DFS?
14. What are the advantages and disadvantages of Depth-limited search?
15. What is the time and space complexity of Depth-limited search?
16. What are the advantages and disadvantages of Uniform-cost search?
17. What is the time and space complexity of Uniform-cost search?
18. What are the advantages and disadvantages of iterative deepening DFS?
19. What is the time and space complexity of iterative deepening DFS?
20. What are the advantages and disadvantages of Bidirectional search?
21. What is the time and space complexity of Bidirectional search?
22. What are the advantages and disadvantages of A* Search?
23. What is the time and space complexity of A* Search?
24. What are the advantages and disadvantages of AO* Search?
25. What is the time and space complexity of AO* Search?
26. What are the advantages and disadvantages of Heuristic search ?
27. What is the time and space complexity of Heuristic search ?
28. What is Heuristic function ?
29. Mention any two features of inform research?
30. Difference between informed and uninformed search.
31. Write the formula to find the minimum cost of A* search.
32. Write the DFS path for the following graph.
33. Write the BFS path for the following graph.
5 mark questions.
1. Explain all uninformed search algorithm with an example.
2. Explain all the inform search algorithm with an example.
3. Find out the minimum cost path using A* and AO* for the following graph.
4. Explain how greedy search (BFS) algorithm works with an example.
5. Explain the working of A* and AO* algorithm with an example.
6. Write the steps to find out the minimum cost path using the following data using A*
7. Explain the different factors used to measure the performance of the problem solving agent.
8. Explain the different components that are considered for a well defined problems and solutions.
9. Write the standard formulation for 8 puzzle problem.
10. Write the standard formulation for 8 queens problem.
11. Explain different terminologies used in search algorithm.
10 marks questions
1. Explain BFS algorithm and its performance measure for the following graph.
2. Explain DFS algorithm and its performance measure for the following graph.
3. Explain Uninformed search algorithm and its performance measure for the following graph.
4. Explain Depth limited search algorithm and its performance measure for the following graph.
5. Explain Iterative deepening DFS algorithm and its performance measure for the following graph.
6. Explain Bidirectional search algorithm and its performance measure for the following graph.
7. Explain Greedy BFS algorithm and its performance measure for the following graph.
8. Explain A* search algorithm and its performance measure for the following graph.
9. Explain AO* search algorithm and its performance measure for the following graph.
10. Explain Heuristic search algorithm and its performance measure for the following graph.

You might also like