1. : Which of the following search algorithm is an online search algorithm?
(A) Breadth-first
(B) Hill-climbing
(C) Depth-first
(D) None of these
2. : Which of the following search agent operates by interleaving computation and action?
(A) Offline search
(B) Online search
(C) Depth-first search
(D) Breadth-first search
3. : We can call the states as securely explorable if a goal state is:
(A) Reachable from every state
(B) Denied access
(C) Unreachable from any state
(D) None of these
4. : Which of the following search algorithm will use a limited amount of memory?
(A) RBFS
(B) SMA*
(C) Hill-climbing search algorithm
(D) Both A & B
5. : What defines an exploration problem?
(A) Only actions are known to the agent
(B) State and actions are known to the agent
(C) State and actions are unknown to the agent
(D) None of these
6. : Which of the following are important for an agent to solve an online search problem?
(A) Actions
(B) Step-cost function
(C) Goal-test
(D) All of these
7. : Which of the following method is useful for escaping from local minima?
(A) Eliminating heuristic estimate
(B) Reducing heuristic estimate
(C) Updating heuristic estimate
(D) None of these
8. : How can we generate new states in a genetic algorithm?
(A) Composition
(B) Mutation
(C) Cross-over
(D) Both B and C
9. : What is the meaning of simulated annealing in artificial intelligence?
(A) Returns an optimal solution if there is no appropriate schedule of the cooling
(B) Returns an optimal solution if there is an appropriate schedule of the cooling
(C) It will not return an optimal solution if there is an appropriate cooling schedule
(D) None of these