Problem Solving Questions

MCQ bookmark_border

61.

Heuristic function h(n) is ________

A

Lowest path cost

B

Cheapest path from root to goal node

C

Estimated cost of cheapest path from root to goal node

D

Average path cost

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

62.

Greedy search strategy chooses the node for expansion in ___________

A

Shallowest

B

Deepest

C

The one closest to the goal node

D

Minimum heuristic cost

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

63.

What is the evaluation function in greedy approach?

A

Heuristic function

B

Path cost from start node to current node

C

Path cost from start node to current node + Heuristic cost

D

Average of Path cost from start node to current node and Heuristic cost

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

64.

What is the space complexity of Greedy search?

A

O(b)

B

O(bl)

C

O(bl)

D

O(bm)

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

65.

What is the evaluation function in A* approach?

A

Heuristic function

B

Path cost from start node to current node

C

Path cost from start node to current node + Heuristic cost

D

Average of Path cost from start node to current node and Heuristic cost

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

66.

A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal.

A

True

B

False

C

n>

Explanation :

D

div class="v-slide-group__next v-slide-group__next--disabled">

Explanation :

Correct Answer: A