Problem Solving Questions

MCQ bookmark_border

51.

Which search is complete and optimal when h(n) is consistent?

A

Best-first search

B

Depth-first search

C

Both Best-first & Depth-first search

D

A* search

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

52.

Which is used to improve the performance of heuristic search?

A

Quality of nodes

B

Quality of heuristic function

C

Simple form of nodes

D

None of the mentioned

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

53.

Which search method will expand the node that is closest to the goal?

A

Best-first search

B

Greedy best-first search

C

A* search

D

None of the mentioned

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

54.

A heuristic is a way of trying ___________

A

To discover something or an idea embedded in a program

B

To search and measure how far a node in a search tree seems to be from a goal

C

To compare two nodes in a search tree to see if one is better than another

D

All of the mentioned

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

55.

A* algorithm is based on ___________

A

Breadth-First-Search

B

Depth-First

C

Best-First-Search

D

Hill climbing

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

56.

The search strategy the uses a problem specific knowledge is known as ___________

A

Informed Search

B

Best First Search

C

Heuristic Search

D

All of the mentioned

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

57.

Uninformed search strategies are better than informed search strategies.

A

True

B

False

C

n>

Explanation :

D

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

Explanation :

Correct Answer: B