Artificial Intelligence CT-2

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

• Best-first search

• Depth-first search

• Both Best-first & Depth-first search

• A* search

Which search uses only the linear space for searching?

• Best-first search

• Recursive best-first search

• Depth-first search

• None of the mentioned

What is the heuristic function of greedy best-first search?

What are the main cons of hill-climbing search?

• Terminates at global optimum & Does not find optimum solution

• Does not find optimum solution & Fail to find a solution

• Terminates at local optimum & Does not find optimum solution

• Fail to find a solution

i. Gathering knowledge
ii. Defining problem
iii. Applying problem solving technique
iv. Forming the state space
v. Analyze the problem
What is the correct order for solving an AI problem?

• i. ii. iii. iv. v.

• ii. v. i. iv. iii.

• i. v. ii. iv. iii.

• None of the above

Which of the mentioned point are not valid with respect to a Cryptarithmetic problem?

• If numbers are not sufficient, we can use special symbols like $#@% to encrypt the text

• Constraints should be taken care of while solving the problem

• The text is converted from readable format to non-readable format

• None of the above

An AI agent perceives and acts upon the environment using___.

• Actuators

• Perceiver

• Sensors

• Both a and c

What is the other name of informed search strategy?

• Online search

• Simple search

• Heuristic search

• None of the mentioned

Which search uses the problem specific knowledge beyond the definition of the problem?

• Depth-first search

• Informed search

• Breadth-first search

• Uninformed search

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

• DFS/BFS algorithm

• Heuristic Search Algorithm

• Min/Max algorithm

• Greedy Search Algorithm