Final Exam Review Fall 2006: Questions on Complexity


	Welcome to CS1315. Click on the python to add comments.

This page removed for FERPA compliance

Final Exam Review Fall 2006: Questions on Complexity

Post Questions REMOVED:

These are REMOVED advanced topics that we have de-emphasized this semester. It's good to know something about Turing, but we won't ask this. You should know the answer to Q3, though. Colin Potts

According to the book, the traveling salesman problem is currently unable to be solved a reasonable amount of time because even with only 30 cities, the possibilites are practically endless as to which way is truely the shortest.

Link to this Page

Fall 2006 Final Review last edited on 4 December 2006 at 6:45 pm by r33h37.res.gatech.edu