1. Which search agent operates by interleaving computation and action?
a) Offline search
b) Online search
c) Breadth-first search
d) Depth-first search
2. What is called as exploration problem?
a) State and actions are unknown to the agent
b) State and actions are known to the agent
c) Only actions are known to agent
d) Both b & c
3. Which are necessary for an agent to solve an online search problem?
a) Actions
b) Step-cost function
c) Goal-test
d) All of the mentioned
4. When do we call the states are safely explorable?
a) A goal state is unreachable from any state
b) A goal state is denied access
c) A goal state is reachable from every state
d) None of the mentioned
5. In which state spaces does the online-dfs-agent will work?
a) Irreversible state spaces
b) Reversible state spaces
c) searchable state spaces
d) All of the mentioned
.
6. Which of the following algorithm is online search algorithm?
a) Breadth-first search algorithm
b) Depth-first search algorithm
c) Hill-climbing search algorithm
d) None of the mentioned
7. Which search algorithm will use limited amount of memory?
a) RBFS
b) SMA*
c) Hill-climbing search algorithm
d) Both a & b
8. What is meant by simulated annealing in artifical intelligence?
a) Returns an optimal solution when there is a proper cooling schedule
b) Returns an optimal solution when there is no proper cooling schedule
c) It will not return an optimal solution when there is a proper cooling
schedule
d) None of the mentioned
9. How the new states are generated in genetic algorithm?
a) Composition
b) Mutation
c) Cross-over
d) Both b & c
10. Which method is effective for escaping from local minima?
a) Updating heuristic estimate
b) Reducing heuristic estimate
c) Eliminating heuristic estimate
d) None of the mentioned
11. Which is created by using single propositional symbol?
a) Complex sentences
b) Atomic sentences
c) Composition sentences
d) None of the mentioned
12. Which is used to construct the complex sentences?
a) Symbols
b) Connectives
c) Logical connectives
d) All of the mentioned
13. How many proposition symbols are there in artificial intelligence?
a) 1
b) 2
c) 3
d) 4
14. How many logical connectives are there in artificial intelligence?
a) 2
b) 3
c) 4
d) 5
15. Which is used to compute the truth of any sentence?
a) Semantics of propositional logic
b) Alpha-beta pruning
c) First-order logic
d) Both a & b
16. Which are needed to compute the logical inference algorithm?
a) Logical equivalence
b) Validity
c) Satisfiability
d) All of the mentioned
17. What will happen if the hypothesis space contains the true function?
a) Relizable
b) Unrelizable
c) Both a & b
d) None of the mentioned
18. Which is also called single inference rule?
a) Reference
b) Resolution
c) Reform
d) None of the mentioned
19. Which form is called as conjunction of disjunction of literals?
a) Conjunctive normal form
b) Disjunctive normal form
c) Normal form
d) All of the mentioned
20. What can be viewed as single lateral of disjunction?
a) Multiple clauses
b) Combine clause
c) Unit clause
d) None of the mentioned
21. Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?
a) Depth-first search
b) Breadth-first search
c) Alpha-beta pruning
d) None of the mentioned
22. Which values are independant in minimax search algorithm?
a) Pruned leaves x and y
b) Every states are dependant
c) Root is independant
d) None of the mentioned
23. To which depth does the alpha-beta pruning can be applied?
a) 10 states
b) 8 States
c) 6 States
d) Any depth
24. Which search is similar to minimax search?
a) Hill-climbing search
b) Depth-first search
c) Breadth-first search
d) All of the mentioned
25. Which value is assigned to alpha and beta in the alpha-beta pruning?
a) Alpha = max
b) Beta = min
c) Beta = max
d) Both a & b
26. Where does the values of alpha-beta search get updated?
a) Along the path of search
b) Initial state itself
c) At the end
d) None of the mentioned
27. How the effectiveness of the alpha-beta pruning gets increased?
a) Depends on the nodes
b) Depends on the order in which they are executed
c) Both a & b
d) None of the mentioned
28. What is called as transposition table?
a) Hash table of next seen positions
b) Hash table of previously seen positions
c) Next value in the search
d) None of the mentioned
29. Which is identical to the closed list in Graph search?
a) Hill climbing search algorithm
b) Depth-first search
c) Transposition table
d) None of the mentioned
30. Which function is used to calculate the feasibility of whole game tree?
a) Evaluation function
b) Transposition
c) Alpha-beta pruning
d) All of the mentioned
Answers
| 1-b | 2-a | 3-d | 4-c | 5-b |
| 6-c | 7-d | 8-a | 9-d | 10-a |
| 11-b | 12-c | 13-b | 14-d | 15-a |
| 16-d | 17-b | 18-b | 19-a | 20-c |
| 21-c | 22-a | 23-d | 24-b | 25-d |
| 26-a | 27-a | 28-b | 29-c | 30-a |