Artificial Intelligence - Study Mode
[#321] Which algorithm places two actions into a plan without specifying which should come first?
Correct Answer
(D) Partial-order planner
[#322] The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________
Correct Answer
(C) O(n!)
[#323] To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s.
Correct Answer
(D) Planning Graphs
[#324] What is meant by quasi-logical form?
Correct Answer
(A) Sits between syntactic and logical form
[#325] How many successors are generated in backtracking search?
Correct Answer
(A) 1