Artificial Intelligence MCQs

Page No. 26

Consider a problem of preparing a schedule for a class of student. What type of problem is this?


aSearch Problem

✖


bBacktrack Problem

✖


cCSP

✓


dPlanning Problem

✖


View Answer CSP

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure.


aTrue

✓


bFalse

✖


cA & B

✖


dNone of these

✖


View Answer True

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________


a Forward Searching

✓


b Constraint Propagation

✖


cBacktrack after a forward search

✖


dOmitting the constraints and focusing only on goals

✖


View Answer Forward Searching

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.


aForward search

✖


b Backtrack search

✓


cHill algorithm

✖


dReverse-Down-Hill search

✖


View Answer Backtrack search

What among the following constitutes to the incremental formulation of CSP?


aPath cost

✖


bGoal cost

✖


cSuccessor function

✖


dAll of the mentioned

✓


View Answer All of the mentioned

Which of the Following problems can be modeled as CSP?


a8-Puzzle problem

✖


b8-Queen problem

✖


cMap coloring problem

✖


d All of the mentioned

✓



_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.


aConstraints Satisfaction Problems

✓


bUninformed Search Problems

✖


cLocal Search Problems

✖


dAll of the mentioned

✖



What is the complexity of minimax algorithm?


aSame as of DFS

✓


bSpace – bm and time – bm

✖


cTime – bm and space – bm

✖


d Same as BFS

✖


View Answer Same as of DFS

The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.


a True

✓


bFalse

✖


cA & B

✖


dNone of these

✖


View Answer True

General algorithm applied on game tree for making decision of win/lose is ____________


aDFS/BFS Search Algorithms

✖


bHeuristic Search Algorithms

✖


cGreedy Search Algorithms

✖


dMIN/MAX Algorithms

✓


View Answer MIN/MAX Algorithms

Goto Page No.

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