Thursday, April 29, 2010

Assignment No. 02 Artificial Intelligence Course Code: CS607

Deadline date:
Your assignment must be uploaded/submitted before or on May 5, 2010.
Assignment Marks: 25
Uploading instructions
Please view the assignment submission process document provided to you by the
Virtual University to upload the assignment.
Rules for Marking
It should be clear that your assignment will not get any credit if:
o The assignment is submitted after due date
o The assignment is copied
o To learn and understand basic concepts of search techniques used in Artificial
Q 1) Explain how goal trees are useful in theorem proving. Marks 5
Q 2) What is the idea behind Generate and Test? Why is this method described as
being exhaustive? Marks 5
Q 3) Describe the meanings of the Complexity, Completeness, and Optimality in
relation to search methods. Marks 5
Q 4) What is the importance of Task Distribution, Load Balancing, and Tree
Ordering principles when running parallel search methods? Marks 5
Q 5) Explain why the alpha–beta procedure will always generate the same answer as
Mini-Max without pruning. Why is it useful? Marks 5

Find solution at

No comments: