Which of the following best describes Dijkstra's algorithm?

A shortest path algorithm for weighted graphs.

A graph traversal algorithm for trees.

A pathfinding algorithm for unweighted graphs.

A sorting algorithm for arrays.

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

Dijkstra's algorithm is uninformed and explores all paths, while A* uses heuristics to optimize the search towards the goal.

Dijkstra's algorithm is faster than A* search.

A* search only works on unweighted graphs.

Dijkstra's algorithm uses heuristics to find the shortest path.

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

A heuristic is an estimate of the cost to reach the goal from a node.

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 a method to find all possible paths in the search.

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.

Which of the following is true about A* search?

A* search is optimal and complete when the heuristic is admissible.

A* search is only optimal if the heuristic is consistent.

A* search can be incomplete if the search space is infinite.

A* search is faster than Dijkstra's algorithm in all cases.

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

The total estimated cost from the start node to the goal node.

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.

Which case would make A* search and Dijkstra's algorithm equally efficient?

Only some edge weights are equal.

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

A consistent heuristic guarantees optimality and efficiency in A* search.

A consistent heuristic reduces the number of nodes expanded in A* search.

A consistent heuristic can lead to suboptimal solutions in A* search.

A consistent heuristic is only necessary for graph search algorithms.

ONE 6th FORM A* & Dijkstras and complexities

Authored by Lorna Jarrett

Computers

12th Grade

Used 3+ times

ONE 6th FORM A* & Dijkstras and complexities

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

20 questions

Show all answers

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following graphs shows Constant Big-O notation?

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following graphs shows Linear Big-O notation?

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following graphs shows Polynomial Big-O notation?

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following graphs shows Exponential Big-O notation?

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following graphs shows Logarithmic Big-O notation?

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which Big-O notation is show with the equation below:
O(1)

Constant

Linear

Polynomial

Exponential

Logarithmic

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which Big-O notation is show with the equation below:
O(n)

Constant

Linear

Polynomial

Exponential

Logarithmic

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever

or continue with

Microsoft

Apple

Others

Already have an account?

Similar Resources on Wayground

15 questions

CIW

Quiz

•

9th - 12th Grade

16 questions

C-Programming Basics

Quiz

•

12th Grade

20 questions

Microsoft Excel

Quiz

•

KG - Professional Dev...

16 questions

A2 Computer Science 4.10 Databases

Quiz

•

10th - 12th Grade

15 questions

Digital Etiquette

Quiz

•

4th Grade - University

15 questions

python basics

Quiz

•

11th Grade - University

15 questions

KKHP Roblox Game Development Quiz

Quiz

•

4th - 12th Grade

17 questions

Week #7 - Time Machine

Quiz

•

8th Grade - University

Popular Resources on Wayground

15 questions

Fractions on a Number Line

Quiz

•

3rd Grade

20 questions

Equivalent Fractions

Quiz

•

3rd Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

54 questions

Analyzing Line Graphs & Tables

Quiz

•

4th Grade

$fractions$

22 questions

fractions

Quiz

•

3rd Grade

20 questions

Main Idea and Details

Quiz

•

5th Grade

20 questions

Context Clues

Quiz

•

6th Grade

15 questions

Equivalent Fractions

Quiz

•

4th Grade

Discover more resources for Computers

18 questions

[AP CSP] JavaScript Programming Lesson 2025-2026

Lesson

•

9th - 12th Grade

57 questions

[AP CSP] Unit 5 Review: Internet & Cybersecurity

Quiz

•

9th - 12th Grade

ONE 6th FORM A* & Dijkstras and complexities

Which of the following graphs shows Constant Big-O notation?

Which of the following graphs shows Linear Big-O notation?

Which of the following graphs shows Polynomial Big-O notation?

Which of the following graphs shows Exponential Big-O notation?

Which of the following graphs shows Logarithmic Big-O notation?

Which Big-O notation is show with the equation below:
O(1)

Which Big-O notation is show with the equation below:
O(n)

Which Big-O notation is show with the equation below:
O(n^2)

Which Big-O notation is show with the equation below:
O(log(n))

Which complexity is described below:
How long an algorithm will take to run for a given data set of size n.

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

ONE 6th FORM A* & Dijkstras and complexities

Which of the following graphs shows Constant Big-O notation?

Which of the following graphs shows Linear Big-O notation?

Which of the following graphs shows Polynomial Big-O notation?

Which of the following graphs shows Exponential Big-O notation?

Which of the following graphs shows Logarithmic Big-O notation?

Which Big-O notation is show with the equation below:O(1)

Which Big-O notation is show with the equation below:O(n)

Which Big-O notation is show with the equation below:O(n^2)

Which Big-O notation is show with the equation below:O(log(n))

Which complexity is described below:How long an algorithm will take to run for a given data set of size n.

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

Which Big-O notation is show with the equation below:
O(1)

Which Big-O notation is show with the equation below:
O(n)

Which Big-O notation is show with the equation below:
O(n^2)

Which Big-O notation is show with the equation below:
O(log(n))

Which complexity is described below:
How long an algorithm will take to run for a given data set of size n.