Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Introduction to Artificial Intelligence Old Questions 2071

Introduction to Artificial Intelligence - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

3.  Consider the following graph, steps cost is given on the arrow: Assume that the successors of a state are generated in alphabetical order, and that there is no repeated state checking. A is the starting node and C is goal node.

                                    

a. Of the four algorithms breadth-first, depth-first and iterative-deepening, which find a solution in this case?

b. Write sequence of node expanding by algorithm if finds solution.


6 marks
Asked in 2071

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...

Official Answer

a. BFS finds the solution as DFS and iterative deepening enter the infinite loop due to no repeated state checking.

b. Using BFS: A --> C