Problem Solving Questions

MCQ bookmark_border

35.

uniform-cost search expands the node n with the __________

A

Lowest path cost

B

Heuristic cost

C

Highest path cost

D

Average path cost

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

36.

Depth-first search always expands the ______ node in the current fringe of the search tree.

A

Shallowest

B

Child node

C

Deepest

D

Minimum cost

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

37.

Breadth-first search always expands the ______ node in the current fringe of the search tree.

A

Shallowest

B

Child node

C

Deepest

D

Minimum cost

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

38.

Optimality of BFS is ___________

A

When there is less number of nodes

B

When all step costs are equal

C

When all step costs are unequal

D

None of the mentioned

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

39.

LIFO is ______ where as FIFO is ________

A

Stack, Queue

B

Queue, Stack

C

Priority Queue, Stack

D

Stack. Priority Queue

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

40.

When the environment of an agent is partially observable in search space following problem/problems could occur.

A

Sensorless problems: If the agent has no sensors at all, then (as far as it knows) it could be in one of several possible initial states, and each action might therefore lead to one of several possible successor states

B

Contingency problems: If the environment is partially observable or if actions are uncertain, then the agent

C

Exploration problems: When the states and actions of the environment are unknown, the agent must act to discover them. Exploration problems can be viewed as an extreme case of contingency problems

D

All of the mentioned

Correct Answer: D

Check Answer report_problem Report forum Discussion