48161_2004final_sol

# 48161_2004final_sol - 6.034 Final Examination December...

This preview shows pages 1–7. Sign up to view the full content.

6.034 Final Examination December 15,2004 - - - -" - : Name , - -- - 1 ! EMail , - - There are many pages in this examination because we have reproduced many diagrams for your problem-solving convenience. We recommend you work the problems in order to maximize points per unit time. I Problem number ; Maximum Score Grader phw rcb lo sn vm 110 lpb js 15 . phw rcb lo sn vm 110 lpb js 22 phw rcb lo sn vm 110 1pb js phw rcb lo sn vm Ilo lpb js 5 14 phw rcb lo sn vm 110 lpb js i 6 phw rcb lo sn vm 110 Ipb js i , Total 100

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Problem 1: Search (17 Points) Consider the following graph. Note that each link is bidirectional and labeled with its cost, and each node contains a number in parenthesis that corresponds to a heuristic estimate of the cost remaining to reach the goal node. For the following questions you are to search from node A to node Z (start at node A and find a path to node Z), using the prescribed search algorithm. Break any ties that arise by alphabetical order (extend the node that comes first alphabetically first). For this problem, the words extended and expanded are interchangeable. Make sure to search from A to Z. Part A (112 point) What node should you start your search from? Yes, it's that easy. Part B (112 point) What node should you search to? Yes, it's that easy &---
Part C (3 points) You are to perform breadth-first-search. Do not use an enqueued list or an extended list. Do not extend any partial path to a node that it already contains. Use the convention that a path to the goal is only returned when the goal node is extended, not as soon as it appears in the queue. Write down all the nodes extended, in the order in which they are extended. Give the full path that is returned. For your convenience, the graph is redrawn:

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Part D (3 points) Perform depth-first-search (with backup). Do not use an enqueued list or an extended list. Do not extend any partial path to a node that it already contains. Use the convention that a path to the goal is only returned when the goal node is extended, not as soon as it appears in the queue. Write down all the nodes extended, in the order in which they are extended. Give the full path that is returned. - For your convenience, the graph is redrawn:
Part E (3 points) Perfonn A* search using the estimates shown. As always with A*, you are to use an extended list. Do not extend any partial path to a node that it already contains. Write down all the nodes extended, in the order in which they are extended. Give the full path that is returned. For your convenience, the graph is redrawn:

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Part F (2 points) Suppose you implemented depth-first-search, with backup, without an enqueued list or extended list but forget to disallow the extension of partial paths to nodes which they already contain. Would your depth-first-search implementation find a path from A to Z?
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 05/27/2010 for the course ELE 225 taught by Professor Amrnady during the Spring '10 term at American University in Cairo.

### Page1 / 26

48161_2004final_sol - 6.034 Final Examination December...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online