Professional Documents
Culture Documents
Artificial Intelligence
(Course 2019)
Question bank for UT-II
19. Explain hill climbing algorithm with example, also analyse it for advantages and
disadvantages
20. Explain vacuum cleaner problem in detail
21. Discuss any two informed search methods
22. Analyse the difference between Informed search and uninformed search algorithms
23. What are various domains of AI?
24. Explain Depth limited DFS with an example, analyse important parameters
25. Prove that A* is optimally efficient for any given heuristic
26. Apply and analyse A* algorithm for 8-puzzle game
27. With an example explain A star algorithm, state the properties of A star algorithm
28. Compare and explain Breadth first search and Depth first search methods
29. Explain Iterative Deepening Depth first search (DFID) and justify its parameters based on
time complexity, space complexity
30. What is the difference between blind search and heuristic search? Explain with example
31. Explain utility based agent with block diagram
32. Explain Hill climbing algorithm, Explain Local maxima, Global maxima and Plateau for
an example
33. Write note on relaxed problems
34. Apply Uniform cost search algorithm for below graph, Enlist its benefits over other
uninformed search algorithms