Menu

Question Discussion & Solution

MCQ

Q.

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

How many successors are generated in backtracking search?

A

1

B

2

C

3

D

4

Discussion

MCQ

2.

What is the major component/components for measuring the performance of problem solving?

A

Completeness

B

Optimality

C

Time and Space complexity

D

All of the mentioned

Discussion

MCQ

3.

Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.

A

True

B

False

C

n>

Discussion

MCQ

4.

A problem in a search space is defined by one of these state.

A

Initial state

B

Last state

C

Intermediate state

D

All of the mentioned

Discussion

MCQ

5.

Language/Languages used for programming Constraint Programming includes ____________

A

Prolog

B

C#

C

C

D

Fortrun

Discussion

More Artificial Intelligence Topics

Basic Artificial Intelligence

116 MCQs

Intelligent Agents

55 MCQs

Problem Solving

96 MCQs

Logical Agents

49 MCQs

Adversarial Search

32 MCQs

Fuzzy Logic

14 MCQs

Knowledge and Reasoning

87 MCQs

Expert Systems

10 MCQs

Robotics

22 MCQs

Inductive Logic Programming

15 MCQs

LISP Programming

42 MCQs

Communicating, Perceiving and Acting

68 MCQs

Introduction

0 MCQs