Menu

Question Discussion & Solution

MCQ

Q.

uniform-cost search expands the node n with the __________

A

Lowest path cost

B

Heuristic cost

C

Highest path cost

D

Average path cost

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

Discussion

MCQ

3.

A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.

A

True

B

False

C

n>

Discussion

MCQ

4.

What is the main task of a problem-solving agent?

A

Solve the given problem and reach to goal

B

To find out which sequence of action will get it to the goal state

C

All of the mentioned

D

None of the mentioned

Discussion

MCQ

5.

Heuristic function h(n) is ________

A

Lowest path cost

B

Cheapest path from root to goal node

C

Estimated cost of cheapest path from root to goal node

D

Average path cost

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