quiz1

Question 1

Which one is NOT an item to define the problem formulation?
a) Path Cost
b) Initial State
c) Successor function
d) Goal test
e) Depth of tree

Answer 1

e) Depth of Tree

Question 2

The uniform-cost search is equivalent to a depth-first search if step costs are all equal.
True/False?

Answer 2

False

Question 3

Given two admissible heuristics hA and hB. Consider performing A* search. Which is generally best to use if we want to expand the fewest number of nodes?
a) max(hA, hB)
b) 0.5(hA+hB)
c) hA + hB

Answer 3

a) max(hA, hB)

Question 4

The problem of bfs is the space complexity since this algorithm needs to keep every node in memory.
True/False?

Answer 4

True

Question 5

Assuming a maximization problem, what is the primary role of “temperature” in Simulated Annealing?
a) Control how much memory the algorithm uses
b) Set the algorithm’s intial state
c) Adjust the probability of taking a “bad” (uphill) move
d) Adjust the probability of taking a “good” (uphill) move

Answer 5

c) Adjust the probability of taking a “bad” (uphill) move

Question 6

What is the problem type of a non-deterministic and partial observable environment?
a) Single-state problem
b) Policy problem
c) Conformant problem
d) Contingency problem
e) Exploration problem

Answer 6

d) Contingency problem

Question 7

Which statement is true?
a) If a heuristic is admissible, then it is also consistent
b) To guarantee the optimality of A* search, the heuristic function must never overstimate the actual cost to reach the goal state.
c) A* search is guaranteed to always expand no more nodes than depth-first search.

Answer 7

b) To guarantee the optimality of A* search, the heuristic function must never overstimate the actual cost to reach the goal state.

Question 8

What is Uniform Cost Search?

Answer 8

U-c.s. - an uninformed search algorithm that uses the lowest cumulative cost to find a path from the source to the destination.