Menu

Question Discussion & Solution

MCQ

Q.

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

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.

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

Discussion

MCQ

2.

What is state space?

A

The whole problem

B

Your Definition to a problem

C

Problem you design

D

Representing your problem with variable and parameter

Discussion

MCQ

3.

Which search uses only the linear space for searching?

A

Best-first search

B

Recursive best-first search

C

Depth-first search

D

None of the mentioned

Discussion

MCQ

4.

Which algorithm is used to solve any kind of problem?

A

Breadth-first algorithm

B

Tree algorithm

C

Bidirectional search algorithm

D

None of the mentioned

Discussion

MCQ

5.

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

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