Artificial Intelligence MCQs

Page No. 21

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


aO(bd+1) and O(bd+1)


bO(b2) and O(d2)


c O(d2) and O(b2)


d O(d2) and O(d2)


View Answer O(bd+1) and O(bd+1)

Which data structure conveniently used to implement DFS?


aStacks


bQueues


cPriority Queues


dAll of the mentioned


View Answer Stacks

Which data structure conveniently used to implement BFS?


aStacks


bQueues


cPriority Queues


d All of the mentioned


View Answer Queues

Which of the following is/are Uninformed Search technique/techniques?


aBreadth First Search (BFS)


b Depth First Search (DFS)


c Bidirectional Search


dAll of the mentioned


View Answer All of the mentioned

Strategies that know whether one non-goal state is “more promising” than another are called ___________


aInformed & Unformed Search


bUnformed Search


cHeuristic & Unformed Search


d Informed & Heuristic Search



What is the general term of Blind searching?


anformed Search


bUninformed Search


cInformed & Unformed Search


dHeuristic Search


View Answer Uninformed Search

Which search method will expand the node that is closest to the goal?


a Best-first search


bGreedy best-first search


cA* search


dNone of the mentioned



Which is used to improve the performance of heuristic search?


aQuality of nodes


bQuality of heuristic function


cSimple form of nodes


dNone of the mentioned



Which search is complete and optimal when h(n) is consistent?


a Best-first search


bDepth-first search


cBoth Best-first & Depth-first search


dA* search


View Answer A* search

Which method is used to search better by learning?


aBest-first search


bDepth-first search


cMetalevel state space


dNone of the mentioned


View Answer Metalevel state space

Goto Page No.

Page 21 of 75

Alphabetical MCQs Categories

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan