Exam One Flashcards _ Quizlet

pdf

School

University of Southern California *

*We aren’t endorsed by this school

Course

561

Subject

Computer Science

Date

Feb 20, 2024

Type

pdf

Pages

Uploaded by MegaRam3541

27/09/2023, 07:38 Exam One Flashcards | Quizlet https://quizlet.com/267818698/exam-one-ﬂash-cards/ 1/7 Exam One Science Computer Science Artificial Intelligence Terms in this set (57) DFS always expands at least as many nodes as A* search with an admissible heuristic? False, A* largely dominates any graph-search algorithm in finding optimal solutions. h(n) = 0 is an admissible heuristic for the 8-puzzle? True; h(n) = 0 is always an admissible heuristic Breadth First Search is complete even if zero steps costs are allowed? True; depth of the solutions matters for breadth first search, not cost The turing test defines the conditions under which a machine can be said to be 'intelligent' False A* is an admissible algorithm? False DFS is faster than Breadth First? False DFS has lower asymptotic space complexity than BFS? True When using the correct temperature decrease schedule, simulated annealing is guaranteed to find the global optimum? False AB Pruning accelerates game playing at the cost of being an approximation to full minimax? False Try Magic Notes and save time. Try it free

27/09/2023, 07:38 Exam One Flashcards | Quizlet https://quizlet.com/267818698/exam-one-ﬂash-cards/ 2/7 Hill-climbing is an entirely deterministic algorithm? False The exact evaluation function values do not affect minimax decision as long as the ordering of these values is maintained? True A perfect rational backgammon- playing agent never loses? False When using the correct temperature decrease schedule, simulated annealing is guaranteed to find the global optimum in finite time? False The turing test defines the conditions under which a machine can be said to be intelligent? False My office is not an accessible/observable environment? True A contingency problem involves a nondeterministic and accessible/observable environment? False During a search, one usually applies the goal test onto newly expanded children, before queuing up these children? False If the cost of applying an operator once is always 1, then BFS is optimal? True A* is an admissible algorithm? False

27/09/2023, 07:38 Exam One Flashcards | Quizlet https://quizlet.com/267818698/exam-one-ﬂash-cards/ 3/7 DFS is faster than BFS? False DFS has lower asymptotic space complexity than BFS? True When using the correct temperature decrease schedule, simulated annealing is guaranteed to find the global optimum in finite time? False Alpha-beta pruning accelerates game playing at the cost of being an approximation to full minimax? False Genetic algorithms use a step called "failover" false Hill-climbing is an entirely deterministic algorithm? False The exact evaluation function values do not affect minimax decision as long as the ordering of these values is maintained? True A perfectly rational backgammon- playing agent never loses? False Hill climbing search is best used for problem domains with densely packed goals? True In building a poker-playing agent, what is most important: A) Pass turing tuest B) Should be able to hold cards C) Should be able to reason in a dynamic, continuous environment D) All E) None E) None

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

27/09/2023, 07:38 Exam One Flashcards | Quizlet https://quizlet.com/267818698/exam-one-ﬂash-cards/ 4/7 An admissible heuristic for route planning in google maps could be? A) Straight line distance B) Manhattan distance C) h(n) = 1 D) All E)None A) Straight line distance T/F: A reflex agent that senses only partial information about the state cannot be rational? False T/F: There exists a deterministic task environment in which any agent is rational? True T/F: No agent is rational in an unobservable environment? False T/F: An agent function that specifies the agent print true when the percept is a Turing machine program that halts, and false otherwise, cannot be implemented? True T/F: Local beam search is an entirely deterministic algorithm? False T/F: Alpha-beta pruning may not find the optimal solution, because it prunes some branches? False T/F: Local beam search with one initial satate and no limit on the number of states retained is Depth First Search? False T/F: Simulated annealing with T= inf at all times is a random-walk search? True

27/09/2023, 07:38 Exam One Flashcards | Quizlet https://quizlet.com/267818698/exam-one-ﬂash-cards/ 5/7 T/F: Mutation and crossover are methods to handle local extrema in Genetic Algorithms? True T/F: Even if we use a beam width of 1 and the same time-breaking procedure, beam search and hill climbing are not complete? True T/F: If we have an admissible heuristic function, then when an ode is expanded and placed in CLOSED, we have always reached it via the shortest possible path? True T/F: If greedy search finds some goal node in finite time, then depth-frist search will also find a goal node in finite time? False T/F: If depth-first search finds some goal node in finite time, then beam search will also find a goal node in finite time? True T/F: The primary purpose of the CLOSED list in search is to produce the path from the goal node found back to the initial state? False T/F: Genetic algorithm with population size N = 1 is the same as local beam search with k = 1? False What are the seven ways to classify an AI environment and what is the acronym? D-SOAKED - Deterministicness, Staticness, Observability, Agency, Knowledge, Episodicness, Discreteness. What is deterministicness? An environment is deterministic if the next state is perfectly predictable given knowledge of the previous state and the agent's action.

27/09/2023, 07:38 Exam One Flashcards | Quizlet https://quizlet.com/267818698/exam-one-ﬂash-cards/ 6/7 What is staticness? Static environments do not change while the agent deliberates. What is observability? A fully observable environment is one in which the agent has access to all information in the environment relevant to its task? What is agency? If there is at least one other agent in the environment, it is a multi-agent environment. What is knowledge? An environment is considered to be "known" if the agent understands the laws that govern the environments behavior? What episodicness? Sequential environments require memory of past actions of past actions to determine the next best actions. Episodic environments are a series of one-shot actions, and only the current percept is relevant? What is discreteness? A discrete environment has fixed locations or time intervals. A continuous environment could be measured quantitatively to any level of precision. What is a model based agent? A model based agent takes properties from a reflex agent and adds information about how the environments evolves without agent impact, as well as how the agents actions affect the environment. Along with that and condition-to- action rules it selects and action to be produced through actuators. What is a goal based agent? A goal based agent mirrors a model based agent, but included a goal function to ensure the action select is one that leads to highest goal evaluation. What is a utility based agent? For a utility based agent, rather than having a goal function, the agent contains a utility function. The utility function contains information about the desired environment that results from an action. This will allow the agent to select an action that will produce the highest expected utility.

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

27/09/2023, 07:38 Exam One Flashcards | Quizlet https://quizlet.com/267818698/exam-one-ﬂash-cards/ 7/7 For alpha-beta pruning what are the checks performed when a new value is obtained within the max and min nodes? For max: if v >= b return v else v <= b alpha = max(a, v) For min: if v <= a return v else v >= a beta = min(a,v)

Related Documents

Using the techniques described in this chapter carefully read through the case study and determine t

CIS 101 1.2.docx

CIS 101 2.1.docx

AI Ch07-Ch09 Flashcards _ Quizlet.pdf

demo 2.PNG

Wk1_Guided Practice_Creating a Flowchart and C program Using If() statements.docx

Final Exam Fall 2022.docx

Exam-3 Practice Exam.pdf

Sadia Mehrose_INFO6066 Project One - Lifeboats F2023.docx

CS 320 Module Four Tutorial Using JUnit.pdf

Spreadsheet Industry Brand Evaluation.docx

Review Test Submission_ Pair RDD and Dataframes Quiz – .._.pdf

Recommended textbooks for you

Operations Research : Applications and Algorithms

Computer Science

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Brooks Cole

C++ Programming: From Problem Analysis to Program...

Computer Science

ISBN:9781337102087

Author:D. S. Malik

Publisher:Cengage Learning

Systems Architecture

Computer Science

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Cengage Learning

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

Np Ms Office 365/Excel 2016 I Ntermed

Computer Science

ISBN:9781337508841

Author:Carey

Publisher:Cengage

EBK JAVA PROGRAMMING

Computer Science

ISBN:9781337671385

Author:FARRELL

Publisher:CENGAGE LEARNING - CONSIGNMENT

SEE MORE TEXTBOOKS

Recommended textbooks for you

Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT