Menu

Question Discussion & Solution

MCQ
Q.
The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.)

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Which is used to improve the performance of heuristic search?
forum Discussion
MCQ
2.
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.
forum Discussion
MCQ
3.
Which search method will expand the node that is closest to the goal?
forum Discussion
MCQ
4.
Depth-first search always expands the ______ node in the current fringe of the search tree.
forum Discussion
MCQ
5.
DFS is ______ efficient and BFS is __________ efficient.
forum Discussion

category More Artificial Intelligence Topics

article

Basic Artificial Intelligence

format_list_bulleted 116 MCQs
article

Intelligent Agents

format_list_bulleted 55 MCQs
article

Problem Solving

format_list_bulleted 96 MCQs
article

Logical Agents

format_list_bulleted 49 MCQs
article

Adversarial Search

format_list_bulleted 32 MCQs
article

Fuzzy Logic

format_list_bulleted 14 MCQs
article

Knowledge and Reasoning

format_list_bulleted 87 MCQs
article

Expert Systems

format_list_bulleted 10 MCQs
article

Robotics

format_list_bulleted 22 MCQs
article

Inductive Logic Programming

format_list_bulleted 15 MCQs
article

LISP Programming

format_list_bulleted 42 MCQs
article

Communicating, Perceiving and Acting

format_list_bulleted 68 MCQs
article

Introduction

format_list_bulleted 0 MCQs