Unformatted text preview: b) False Exam A: 3. Algorithm “X” has O(bd) Pme complexity while algorithm “Y” has O(bd) Pme complexity. This means that algorithm “Y” will solve every problem faster than algorithm “X”. a) True, b) False Exam B: 3. Graph
search will expand every node that can be...
View
Full
Document
This note was uploaded on 01/21/2014 for the course COMPSCI 171 taught by Professor Welling during the Fall '10 term at UC Irvine.
 Fall '10
 welling
 Artificial Intelligence

Click to edit the document details