(5 points)
1- What is the Hill Climbing Drawbacks?
Local maxima, Plateaus, and ridges
2- What are the main components of the genetic algorithm?
Population, evaluation fitness function, selection, crossover, and mutation.
3-describe potential advantages and disadvantages of A* search?
Finds the shortest path through the search space using the heuristic function, guaranteed to find
optimal solution if the heuristic is admissible for trees, this search algorithm expands less search tree
and provides optimal result faster.
Has some complexity issues, A* is memory requirement as it keeps all generated nodes in the memory.
4- describe potential advantages and disadvantages of depth-first search?
Low memory is required.
May not find the shortest path, and may get stuck in an infinite loop if the graph has cycles.
5- What is the definition of heuristic, and what is the main components?
is a function which is used in Informed Search, and it finds the most promising path. It takes the current
state of the agent as its input and produces the estimation of how close agent is from the goal.
Open and close list
True/False (5 points)
1- A reflex agent can be rational (True/False)
2- It is impossible to be rational in a partially observable environment (True/False)
3- Simulated annealing ensures that you will always reach a global optimum (True/False)
4- The local beam search algorithm keeps track of k states rather than just one (True/False)
5- Hill climbing algorithm keeps track of one current state and on each iteration moves to the
neighboring state with lowest value (True/False)
(5 points) choose the correct answer
1-Which of the following search algorithms finds an optimal solution?
a. Breadth first c. Depth first e. None of the above
b. Hill climbing d. Greedy search
2- A search algorithm is complete if it…
a. Always finds the optimal solution b. Finds all possible solutions
c. Always finds a solution if there is one d. Never finds a solution
3- Which of these techniques uses randomness to avoiding getting trapped in local
maxima?
a. Best first search b. Gradient descent
c. Local beam search d. None of the above
e. Simulated annealing
4- A greedy search uses a heuristic function to expand the node that
a. Appears to be closest to the goal b. Is the leftmost node in the search tree
c. Is closest to a goal d. None of the above e. Is closest to the start state
5- What is rational at any given time depends on four things?
a- The Performance measure that defines the criterion of success.
b- The actions that the agent can perform.
c- A performance measure that defines the criterion of failures.
d- The agent’s prior knowledge of the environment.
e- The agent’s percept sequence to date.
(5 Points)
Consider the search
space with this
graph, where S is the
start state and Gis the
goal. Assume a
heuristic is available
for the A* algorithm
that has the
following values:
{S:4, A:3, B:2, C:100, G:0}
For questions a-e
specify the path as a
sequence of nodes
starting at S and
ending at G that each
algorithm returns.
Assume the
successor functions
work so that nodes
are explored in
alphabetical order
whenever possible.
(a) Breadth-first search S → G
(b) Depth-first search S → A → G
(c) Uniform-cost search S → B → G
(d) A* search S→B→G
(e) Greedy search S → G
