Question 6
SEARCH
Based on the above data, answer the given subquestions.
What can you say about the heuristic function for the given graph?
Admissible.
Inadmissible.
Partly admissible and partly inadmissible.
Cannot be determined.
Question 6: What can you say about the heuristic function for the giv…
Show answer
Correct answer
Admissible.
Question 6 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 1 Sept 2024, in the May 2024 term (IIT M DEGREE FN EXAM QDB1 01 Sep 2024). It carries 1 mark.
More questions from this paper
- ASK FOR PRINTED GRAPH SHEETS 10 PAGES DOUBLE-SIDED
- What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.\ NO…
- What is the path found by A search algorithm? Enter the path as a comma separated list of node labels.\ NO SPACES, TABS…
- What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels.\ …
- For the given map, which algorithm finds the shortest path from S to G?
- TSP Branch-and-Bound Let S0 (ref. no. a1) be the first node to be refined, identify the next 4 nodes (2nd to 5th node) …
- TSP Branch-and-Bound Which node represents the optimal tour and what is the cost of the optimal tour? Enter the node re…
- TSP Branch-and-Bound Determine the number of cities in the TSP instance. Enter the number of cities in the text box, or…
- TSP Branch-and-Bound Start from city A, what is the path representation of the optimal tour? Enter the path\ representa…
- Which of the following is a strategy for the MAX player?
- List the leaf nodes in the best strategy for MAX. Enter the node labels in alphabetical order. Enter a comma separated …
- List the leaf nodes pruned by Alpha-Beta.\ Enter a comma separated list of node labels in alphabetical order.\ NO SPACE…
- List the leaf nodes solved (assigned SOLVED status) by SSS.\ Enter a comma separated list of node labels in alphabetica…
- PROBLEM DECOMPOSITION List the first three nodes (including S) expanded by AO algorithm. List the nodes in the order th…
- PROBLEM DECOMPOSITION Determine the value of the start node S after each node is expanded. What are the values of S aft…
- PROBLEM DECOMPOSITION What is the final value of the start node S?\ Enter a number.\ NO SPACES, TABS, DOTS, BRACKETS OR…
- RULE BASED EXPERT SYSTEMS Which of the following rule-data tuples are in the conflict-set?
- RULE BASED EXPERT SYSTEMS If the Inference Engine uses Specificity as the conflict resolution strategy then which of th…
- RULE BASED EXPERT SYSTEMS If the Inference Engine uses Recency as the conflict resolution strategy then which of the fo…
- AUTOMATED PLANNING Based on the above data, answer the given subquestions. Which of the following are applicable action…
- AUTOMATED PLANNING Based on the above data, answer the given subquestions. Which of the following are relevant actions …
- AUTOMATED PLANNING Based on the above data, answer the given subquestions. In the planning graph, which of the followin…
- AUTOMATED PLANNING Based on the above data, answer the given subquestions. In the planning graph, which of the followin…
- CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…
- CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…