Menu

Question Discussion & Solution

MCQ

Q.

The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.

A

Finding shortest path between a source and a destination

B

Travelling Salesman problem

C

Map coloring problem

D

Depth first search traversal on a given map represented as a graph

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.

What is the general term of Blind searching?

A

Informed Search

B

Uninformed Search

C

Informed & Unformed Search

D

Heuristic Search

Discussion

MCQ

2.

A production rule consists of ____________

A

A set of Rule

B

A sequence of steps

C

Set of Rule & sequence of steps

D

Arbitrary representation to problem

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.

Flexible CSPs relax on _______

A

Constraints

B

Current State

C

Initial State

D

Goal State

Discussion

MCQ

5.

How many types are available in uninformed search method?

A

3

B

4

C

5

D

6

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