Question 34 MCQ · 0.0 marks
Printed graph sheets were provided to me.
Printed graph sheets were not provided to me.
I did not use graph sheets.
A published solution is not available for this question yet.
AI: Search Methods for Problem Solving · Quiz 1 · Sep 2024
AI: Search Methods for Problem Solving · Quiz 1 · Sep 2024
← Course papers · Start practice / exam
This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 21 published solutions
Question 35 MSQ · 1.0 marks
**STATE SPACE**
Which of these algorithms are complete?
Depth-First Search
Breadth-First Search
Best-First Search
Hill Climbing
A published solution is not available for this question yet.
Question 36 MSQ · 2.0 marks
**STATE SPACE**
102/453
130/425
023/145
201/354
A published solution is not available for this question yet.
Question 37 MSQ · 1.0 marks
**STATE SPACE**
Which of the following is true about the 5-Puzzle state space that is reachable from **123/450**?
Every move is reversible.
There is at least one move that is not reversible.
There is a path from every state to every other state.
Every state has at most three neighbours.
A published solution is not available for this question yet.
Question 38 SHORT_TEXT · 1.0 marks
Based on the above data, answer the given subquestions.
List the first 4 nodes inspected by Depth First Search. List the nodes in the order they were
inspected. If the algorithm terminates early then list the nodes inspected up until termination.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,Z**
A published solution is not available for this question yet.
Question 39 SHORT_TEXT · 1.0 marks
Based on the above data, answer the given subquestions.
What is the path found by Depth First Search?
Enter the path as a comma separated list of node labels.
Enter NIL if there is no path.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,G**
A published solution is not available for this question yet.
Question 40 SHORT_TEXT · 1.0 marks
Based on the above data, answer the given subquestions.
List the first 4 nodes inspected by Breadth First Search. List the nodes in the order they were
inspected. If the algorithm terminates early then list the nodes inspected up until termination.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,Z**
A published solution is not available for this question yet.
Question 41 SHORT_TEXT · 2.0 marks
Based on the above data, answer the given subquestions.
What is the path found by Breadth First Search?
Enter the path as a comma separated list of node labels.
Enter NIL if there is no path.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,G**
A published solution is not available for this question yet.
Question 42 SHORT_TEXT · 1.0 marks
Based on the above data, answer the given subquestions.
List the first 4 nodes inspected by Best First Search. List the nodes in the order they were
inspected. If the algorithm terminates early then list the nodes inspected up until termination.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,Z**
A published solution is not available for this question yet.
Question 43 SHORT_TEXT · 2.0 marks
Based on the above data, answer the given subquestions.
What is the path found by Best First Search?
Enter the path as a comma separated list of node labels.
Enter NIL if there is no path.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,G**
A published solution is not available for this question yet.
Question 44 SHORT_TEXT · 1.0 marks
Based on the above data, answer the given subquestions.
List the first 4 nodes inspected by Hill Climbing. List the nodes in the order they were inspected. If
the algorithm terminates early then list the nodes inspected up until termination.
Enter a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,Z**
A published solution is not available for this question yet.
Question 45 SHORT_TEXT · 1.0 marks
Based on the above data, answer the given subquestions.
What is the path found by Hill Climbing?
Enter the path as a comma separated list of node labels.
Enter NIL if there is no path.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
**Answer Format: S,X,Y,G**
A published solution is not available for this question yet.
Question 46 MSQ · 1.0 marks
Based on the above data, answer the given subquestions.
Select the valid path representations of the tour.
J,F,K,H,E,L,D,I,M,G
J,F,K,H,E,L,D,I,M,G,J
D,I,M,G,J,F,K,H,E,L
D,I,M,G,J,F,K,H,E,L,D
A published solution is not available for this question yet.
Question 47 MSQ · 1.0 marks
Based on the above data, answer the given subquestions.
Select the valid adjacency representations of the tour.
E,L,K,J,M,H,F,D,I,G
I,L,K,J,E,M,F,H,D,G
K,D,J,M,I,L,G,F,E,H
L,H,J,M,K,D,G,F,E,I
A published solution is not available for this question yet.
Question 48 MCQ · 2.0 marks
Based on the above data, answer the given subquestions.
Convert the path representation **E,J,L,K,F,H,I,M,G,D** to ordinal representation.
2,6,7,6,2,4,1,2,2,1
2,6,7,6,2,3,3,3,2,1
7,3,6,4,2,4,1,2,2,1
7,3,6,4,2,3,3,3,2,1
A published solution is not available for this question yet.
Question 49 SHORT_TEXT · 2.0 marks
Based on the above data, answer the given subquestions.
Two tours in path representation are given below. Generate offspring using Cycle Crossover. Enter
one of the child tours in the textbox.
Enter a comma separated list of cities.
DO NOT ENTER SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
A published solution is not available for this question yet.
Question 50 SHORT_TEXT · 1.0 marks
Based on the above data, answer the given subquestions.
Start from city B and construct a tour using Nearest Neighbour Heuristic. Enter the path
representation of the tour starting from city B. Use the same order in which cities were added to
the tour.
Enter a comma separated list of city names.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: B,X,Y,Z
A published solution is not available for this question yet.
Question 51 NAT · 1.0 marks
Based on the above data, answer the given subquestions.
What is the cost of the tour generated by Nearest Neighbour Heuristic?
Enter a number.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: 17
A published solution is not available for this question yet.
Question 52 SHORT_TEXT · 1.0 marks
Based on the above data, answer the given subquestions.
Construct a tour using Greedy Heuristic. Enter the path representation of the tour starting from
city B.
Enter a comma separated list of city names.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: B,X,Y,Z
A published solution is not available for this question yet.
Question 53 NAT · 1.0 marks
Based on the above data, answer the given subquestions.
What is the cost of the tour generated by Greedy Heuristic?
Enter a number.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: 17
A published solution is not available for this question yet.
Question 54 SHORT_TEXT · 1.0 marks
Based on the above data, answer the given subquestions.
Take B as the fulcrum node and compute the **two** missing values in the savings list (full list) given
below. Construct the savings tour. Enter the path representation of the tour starting from city B.
Enter a comma separated list of city names.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: B,X,Y,Z
A published solution is not available for this question yet.