Menu

Question Discussion & Solution

MCQ

Q.

___________ algorithm keeps track of k states rather than just one.

A

Hill-Climbing search

B

Local Beam search

C

Stochastic hill-climbing search

D

Random restart hill-climbing 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.

Optimality of BFS is ___________

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

Discussion

MCQ

2.

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

3.

What is the other name of informed search strategy?

A

Simple search

B

Heuristic search

C

Online search

D

None of the mentioned

Discussion

MCQ

4.

Which of the Following problems can be modeled as CSP?

A

8-Puzzle problem

B

8-Queen problem

C

Map coloring problem

D

All of the mentioned

Discussion

MCQ

5.

Constraint satisfaction problems on finite domains are typically solved using a form of ___________

A

Search Algorithms

B

Heuristic Search Algorithms

C

Greedy Search Algorithms

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