LEC SEVEN.

Which search method consists of two simultaneous searches?

• Iterative deepening search

• Hill Climbing Algorithm

• Bidirectional search

• Greedy Search

When does bidirectional search stop?

• When the two searches meet in the middle

• When the initial state is reached

• When the goal state is reached

• When the search space is fully explored

What is the name of the search algorithm that combines Breadth-first Search and Depth-first Search?

• Iterative deepening search

• Bidirectional search

• Greedy Search

• A* Search

When is Iterative Deepening the preferred uninformed search method?

• • Small search space

• • Known solution depth

• • Larger search space with unknown solution depth

• • Memory abundance

By using ITERATIVE search algorithm

the iteration 2:

• A

• ABC

• AABCABDECFG

• ABDHEICFGJ

Given the following state-space, use a uniform cost search algorithm to find the goal.

Here S and G represent the start and goal states.

Find PATH, COST

• Path: S>B>G

  Cost: 10

• Path:S>A>C>D>G

  Cost: 9

• Path: S>A>D>G

  Cost:8

Answer explanation

What is another name for Informed Search?

• Uninformed Search

• Blind Search

• Heuristic Search

• Lowest Cost First Search

Which type of search is called Cost-sensitive search?

• Uniform cost search

• DFS

• BFS

• IDS

Which type of search have this strategy : iteratively increase the search limit until the depth of the shallowest solution is reached

• IDS

• BFS

• DFS

• UCS

What strategy does the Uniform cost search algorithm use to expand nodes?

• Expand the frontier node with the highest path cost.

• Expand the frontier node with the lowest path cost.

• Expand the nodes in a random order.

• Expand the nodes in a breadth-first manner.