Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

by python and C++ Q.1. [5+5] Consider the search problem shown in Figure 2, which requires us to find the best (shortest) route from city

image text in transcribed

by python and C++

Q.1. [5+5] Consider the search problem shown in Figure 2, which requires us to find the best (shortest) route from city 'A' to city 'F'. Assuming 'A' is the start city, answer the following: a) What path would the following search algorithms return for the problem: breadth first search, uniform cost search (Dijkstra's algorithm), depth first search, and A* Note: break ties alphabetically among nodes and ONLY output paths for the solution as a list of nodes. Use h(n)=0 for A* B LD 4 12 E Figure 2: Search problem for Q.1. b) If 'hi' and 'hz' are heuristics for this problem as shown in Table 1 below, state and justify whether the heuristics are admissible and monotone? State A B C D E F hl 12 8 10 5 9 h2 15 9 14 5 10 0 O Table 1: Heuristic estimates for the search problem in Q.1. Important Note: Submit your code files as well as descriptive responses as a zipped folder. Email your completed assignment to the course email. Be careful while writing the subject of your email. It MUST be your roll number followed by a hyphen and Assignmentl'. E.g. BITF19A500-Assignment1 Q.1. [5+5] Consider the search problem shown in Figure 2, which requires us to find the best (shortest) route from city 'A' to city 'F'. Assuming 'A' is the start city, answer the following: a) What path would the following search algorithms return for the problem: breadth first search, uniform cost search (Dijkstra's algorithm), depth first search, and A* Note: break ties alphabetically among nodes and ONLY output paths for the solution as a list of nodes. Use h(n)=0 for A* B LD 4 12 E Figure 2: Search problem for Q.1. b) If 'hi' and 'hz' are heuristics for this problem as shown in Table 1 below, state and justify whether the heuristics are admissible and monotone? State A B C D E F hl 12 8 10 5 9 h2 15 9 14 5 10 0 O Table 1: Heuristic estimates for the search problem in Q.1. Important Note: Submit your code files as well as descriptive responses as a zipped folder. Email your completed assignment to the course email. Be careful while writing the subject of your email. It MUST be your roll number followed by a hyphen and Assignmentl'. E.g. BITF19A500-Assignment1

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Time Series Databases New Ways To Store And Access Data

Authors: Ted Dunning, Ellen Friedman

1st Edition

1491914726, 978-1491914724

More Books

Students also viewed these Databases questions