Menu

Question Discussion & Solution

MCQ

Q.

What are the main cons of hill-climbing search?

A

Terminates at local optimum & Does not find optimum solution

B

Terminates at global optimum & Does not find optimum solution

C

Does not find optimum solution & Fail to find a solution

D

Fail to find a solution

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.

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

2.

Though local search algorithms are not systematic, key advantages would include __________

A

Less memory

B

More time

C

Finds a solution in large infinite space

D

Less memory & Finds a solution in large infinite space

Discussion

MCQ

3.

Strategies that know whether one non-goal state is

A

Informed & Unformed Search

B

Unformed Search

C

Heuristic & Unformed Search

D

Informed & Heuristic Search

Discussion

MCQ

4.

Which data structure conveniently used to implement DFS?

A

Stacks

B

Queues

C

Priority Queues

D

All of the mentioned

Discussion

MCQ

5.

The Set of actions for a problem in a state space is formulated by a ___________

A

Initial state

B

Last state

C

Intermediate state

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