Artificial Intelligence MCQs

Page No. 20

The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node.


aTrue

✓


bFalse

✖


cA & B

✖


dNone of these

✖


View Answer True

DFS is ______ efficient and BFS is __________ efficient.


aSpace, Time

✓


bTime, Space

✖


cTime, Time

✖


dSpace, Space

✖


View Answer Space, Time

For general graph, how one can get rid of repeated states?


aBy maintaining a list of visited vertices

✓


bBy maintaining a list of traversed edges

✖


cBy maintaining a list of non-visited vertices

✖


dBy maintaining a list of non-traversed edges

✖



When the environment of an agent is partially observable in search space following problem/problems could occur.


a Sensorless problems: If the agent has no sensors at all, then (as far as it knows) it could be in one of several possible initial states, and each action might therefore lead to one of several possible successor states

✖


bContingency problems: If the environment is partially observable or if actions are uncertain, then the agent’s percepts provide new information after each action. Each possible percept defines a contingency that must be planned for. A problem is called adversarial if the uncertainty is caused by the actions of another agent

✖


cExploration problems: When the states and actions of the environment are unknown, the agent must act to discover them. Exploration problems can be viewed as an extreme case of contingency problems

✖


dAll of the mentioned

✓


View Answer All of the mentioned

LIFO is ______ where as FIFO is ________


aStack, Queue

✓


bQueue, Stack

✖


cPriority Queue, Stack

✖


dStack. Priority Queue

✖


View Answer Stack, Queue

Optimality of BFS is ___________


aWhen there is less number of nodes

✖


bWhen all step costs are equal

✓


cWhen all step costs are unequal

✖


dNone of the mentioned

✖



Breadth-first search always expands the ______ node in the current fringe of the search tree.


aShallowest

✓


bChild node

✖


cDeepest

✖


dMinimum cost

✖


View Answer Shallowest

Depth-first search always expands the ______ node in the current fringe of the search tree.


aShallowest

✖


bChild node

✖


cDeepest

✓


dMinimum cost

✖


View Answer Deepest

uniform-cost search expands the node n with the __________


aLowest path cost

✓


bHeuristic cost

✖


cHighest path cost

✖


dAverage path cost

✖


View Answer Lowest path cost

Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node.


aTrue

✖


bFalse

✓


cA & B

✖


dNone of these

✖


View Answer False

Goto Page No.

Page 20 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