Which algorithm is used in the Game tree to make decisions of Win$/$Lose$?$

A$)$ Heuristic Search Algorithm

B$)$ DFS$/$BFS algorithm

C$)$ Greedy Search Algorithm

D$)$ Min$/$Max algorithm

he available ways to solve a problem of state$-$space$-$search.

A$)1$

B$)2$

C$)3$

D$)4$

Among the given options, which is not the required property of Knowledge representation?

A$)$ Inferential Efficiency

B$)$ Inferential Adequacy

C$)$ Representational Verification

D$)$ Representational Adequacy

An AI agent perceives and acts upon the environment using $\_\_.$

A$)$ Sensors

B$)$ Perceiver

C$)$ Actuators

D$)$ Both a and c

Which rule is applied for the Simple reflex agent?

A$)$ Simple$-$action rule

B$)$ Simple &Condition$-$action rule

C$)$ Condition$-$action rule

D$)$ None of the above

Which agent deals with the happy and unhappy state?

A$)$ Utility$-$based agent

B$)$ Model$-$based agent

C$)$ Goal$-$based Agent

D$)$ Learning Agent

Rational agent always does the right things.

A$)$ True

B$)$ False

Which term describes the common$-$sense of the judgmental part of problem$-$solving?

A$)$ Values$-$based

B$)$ Critical

C$)$ Analytical

D$)$ Heuristic

Which AI technique enables the computers to understand the associations and relationships between objects and events?

A$)$ Heuristic Processing

B$)$ Cognitive Science

C$)$ Relative Symbolism

D$)$ Pattern Matching

The exploration problem is wher

A$)$ Agent contains the knowledge of State and actions.

B$)$ Agent does not contain the knowledge of State and actions.

C$)$ Only actions are known to the agent.

D$)$ None of the above

In the Wumpus World Problem, the reason for the uncertainty is that the agent's sensor gives only$\_$

A$)$ Full & Global information

B$)$ Partial & Global Information

C$)$ Full & local information

D$)$ Partial & local Information

The search algorithm which is similar to the minimax search, but removes the branches that don't affect the final output is known as $.$

A$)$ Depth$-$first search

B$)$ Breadth$-$first search

C$)$ Alpha$-$beta pruning

D$)$ None of the above

The maximum depth to which the alpha$-$beta pruning can be applied.