1. : Which of the following is the process by which the brain orders actions desired to finish successfully a specific job?
(A) Planning problem
(B) Partial order planning
(C) Total order planning
(D) Both A and B
2. : Scheduling classes for a bunch of students or Railway cargo transport is the best example of which of the following?
(A) Total order planning
(B) The partial Order planning problem
(C) Planning problem
(D) None of these
3. : Suppose we want to eliminate the inaccuracy problem in partial-order planning problem or planning problem, then the best data structure to use is the?
(A) Stacks
(B) Planning Graphs
(C) BST (Binary Search Tree)
(D) Queue
4. : Planning graphs consists of ____
(A) A sequence of levels
(B) A sequence of actions which corresponds to the state of the system
(C) A sequence of levels which corresponds to time steps in the plan
(D) None of these
5. : Which of the following algorithm is used to obtain the plan directly from the planning graph, instead of using the graph to provide heuristic?
(A) Graph-Plan
(B) A*
(C) BFS/DFS
(D) Greedy
6. : Which of the following has the alternative name of every plan resulted in partial-order planning?
(A) Polarization
(B) Solarization
(C) Linearization
(D) None of these
7. : Which of the following are the two major characteristics which combine the AI Planning problem?
(A) FOL and Logic
(B) Logic and Knowledge Based Systems
(C) Search and Logic
(D) Knowledge Based Systems
8. : Which of the following algorithm translates a planning problem into propositional axioms?
(A) GraphPlan
(B) SatPlan
(C) Greedy
(D) None of these