Scribd
Upload
21 views

Cs 607 Quiz 1 Solved

This document contains the answers to a quiz on artificial intelligence topics. It addresses questions about depth first search priority functions, branch-and-bound search techniques, introspection in psychological experiments, plateau problems in hill climbing algorithms, uninformed searches, progressive deepening in depth first search, the steps of a simple search algorithm, heuristics providing educated guesses but not always correct solutions, weak AI emulating functionality as a black box, and dynamic programming taking the minimum cost path between nodes reached through multiple paths. The document also provides advice to students to save the quiz questions and answers in an organized way to help study for exams.

Uploaded by

tayyabam930
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Cs 607 Quiz 1 Solved

This document contains the answers to a quiz on artificial intelligence topics. It addresses questions about depth first search priority functions, branch-and-bound search techniques, introspection in psychological experiments, plateau problems in hill climbing algorithms, uninformed searches, progressive deepening in depth first search, the steps of a simple search algorithm, heuristics providing educated guesses but not always correct solutions, weak AI emulating functionality as a black box, and dynamic programming taking the minimum cost path between nodes reached through multiple paths. The document also provides advice to students to save the quiz questions and answers in an organized way to help study for exams.

Uploaded by

tayyabam930
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

CS607 Artificial Intelligence

Quiz 1 solved

In depth first search we keep our priority function as given below and given give priority to
elements with ______ P(n) value where: P(n) = 1 / height(n).
• Minimum (page 25)
• Maximum
• Average
• Absolute

There are many techniques to solve our problem of optimal search without using a brute
force technique; one such procedure is called _______.
• Branch-and-bound method (Page 48)
• Depth first method
• Breadth first method
• Progressive deepening

Trying to catch out own thoughts as they go by

• Introspection (Page 8)
• Psychological Experiments
• Introspection and Psychological Experiments
• None of the given

"In context of Hill climbing algorithm, a person may reach the portion of a mountain which is
totally flat, whatever step he takes gives him no improvement in height hence he gets
stuck." The above statement refers to:

• Foothill problem
• Plateau problem (Page 40)
• Ridge problem
• Slope problem

[email protected] 1
Which of the following is/are example(s) of uninformed search?
• Breadth first search
• Depth first search
• Progressive deepening
• All of the given options (page 72 and 73 read carefully)

"If you find the goal, exit, otherwise repeat DFS to the next lower level". The statement
refers to:
• Depth first search
• Breadth first search
• Progressive depending (Page 32)
• None of the given options

Which of the following is NOT one of the steps of simple search algorithm?
• Initialize priority queue.
• Check if the priority queue is empty.
• If node picked from priority queue is goal node then return.
• Copy visited queue to priority queue. (Page 24)

Identify the TRUE statement egarding "Heuristics":

• Heuristics always give us good guess to reach to goal state.


• Heuristics don’t always give us good guess to reach to goal state. (Page 37)
• Heuristics never give us good guess to reach to goal state.
• Both “heuristic” and “algorithm” are same thing.

It must be noted that heuristics don’t always


give us the right guess, and hence the correct solutions. In other
words educated guesses are not always correct.

______ AI treats the brain as a black box and just emulates its functionality.

• Weak (Page 8)
• Strong
• Weak and Strong
• None of the given

[email protected] 2
The simple idea behind ________ is that if we can reach a specific node through more than
one different paths then we shall take the path with the minimum cost.

• Dynamic programming (Page 55)


• Estimates
• Progressive deepening
• Beam search

Please share quiz it will help in midterm and final


term exam

easy way to save quiz is


just save html page hit key
Ctrl+S in every question save with number
1 2 3 etc..
zip and share

[email protected] 3

You might also like