Contents

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

c

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

b

Explanation: Online-DFS-Agent will work only state spaces where the actions are reversible.


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

c

Explanation: Hill-climbing search algorithm will have only current state in memory, So it is an online search algorithm.


Which search algorithm will use limited amount of memory?
a) RBFS                                
b) SMA*
c) Hill-climbing search algorithm
d) Both RBFS & SMA*

d

Explanation: RBFE and SMA* will solve any kind of problem that A* can’t by using limited amount of memory.


What is meant by simulated annealing in artificial 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

a

How the new states are generated in genetic algorithm?
a) Composition   
b) Mutation
c) Cross-over                       
d) Both b & c

d

Explanation: New states are generated by mutation and by crossover, which combines a pair of states from the population.