Menu

Question Discussion & Solution

MCQ

Q.

When is breadth-first search is optimal?

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

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.

Backtracking is based on ____________

A

Last in first out

B

First in first out

C

Recursion

D

Both Last in first out & Recursion

Discussion

MCQ

2.

Consider a problem of preparing a schedule for a class of student. What type of problem is this?

A

Search Problem

B

Backtrack Problem

C

CSP

D

Planning Problem

Discussion

MCQ

3.

The name

A

True

B

False

C

n>

Discussion

MCQ

4.

_______________ Is an algorithm, a loop that continually moves in the direction of increasing value

A

Up-Hill Search

B

Hill-Climbing

C

Hill algorithm

D

Reverse-Down-Hill search

Discussion

MCQ

5.

What among the following constitutes to the incremental formulation of CSP?

A

Path cost

B

Goal cost

C

Successor function

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