Search Header Logo

ONE 6th FORM A*Search

Authored by Lorna Jarrett

Computers

12th Grade

Used 3+ times

ONE 6th FORM A*Search
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

17 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the main difference between Dijkstra's algorithm and A* search?

Dijkstra's algorithm is faster than A* search.
A* search only works on unweighted graphs.
Dijkstra's algorithm is uninformed and explores all paths, while A* uses heuristics to optimize the search towards the goal.
Dijkstra's algorithm uses heuristics to find the shortest path.

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a heuristic in the context of A* search?

A heuristic is the exact cost to reach the goal from a node.
A heuristic is a random guess about the goal.
A heuristic is an estimate of the cost to reach the goal from a node.
A heuristic is a method to find all possible paths in the search.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When does A* search behave exactly like Dijkstra's algorithm?

When the heuristic function h(n) is zero for all nodes.
When the algorithm is modified to use a random heuristic function.
When the search space is fully connected with equal edge weights.
When the heuristic function h(n) is equal to the actual cost for all nodes.

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is true about A* search?

A* search is only optimal if the heuristic is consistent.
A* search can be incomplete if the search space is infinite.
A* search is optimal and complete when the heuristic is admissible.
A* search is faster than Dijkstra's algorithm in all cases.

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does A* aim to minimize at each step of the algorithm?

The distance from the start node to the current node.
The heuristic estimate from the current node to the goal node.
The total number of nodes expanded so far.
The total estimated cost from the start node to the goal node.

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the significance of a consistent heuristic in A* search?

A consistent heuristic reduces the number of nodes expanded in A* search.
A consistent heuristic guarantees optimality and efficiency in A* search.
A consistent heuristic can lead to suboptimal solutions in A* search.
A consistent heuristic is only necessary for graph search algorithms.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Define what is meant by the term 'algorithm'

Step by step instructions or rules to solve a problem.
Code for a specific task.

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?