A true b false exam b 3 time complexity of a search

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a) True, b) False Exam A: 3. Memory requirements of A* search is always polynomial in the the depth (d) of the soluEon. a) True, b) False Exam B: 3. Time complexity of A* search is always polynomial in the depth (d) of the soluEon. a) True, b) False Exam A: 4. Time complexity of IteraEve Deepening Search is polynomial in...
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.

Ask a homework question - tutors are online