Menu

Question Discussion & Solution

MCQ

Q.

Which data structure conveniently used to implement BFS?

A

Stacks

B

Queues

C

Priority Queues

D

All 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.

What is the general term of Blind searching?

A

Informed Search

B

Uninformed Search

C

Informed & Unformed Search

D

Heuristic Search

Discussion

MCQ

2.

Which search method takes less memory?

A

Depth-First Search

B

Breadth-First search

C

Linear Search

D

Optimal search

Discussion

MCQ

3.

What is the space complexity of Greedy search?

A

O(b)

B

O(bl)

C

O(bl)

D

O(bm)

Discussion

MCQ

4.

___________ 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

Discussion

MCQ

5.

A problem in a search space is defined by one of these state.

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