2.3.1 Graph Traversal & Path Finding Algorithms

2.3.1 Graph Traversal & Path Finding Algorithms

12th Grade - University

20 Qs

quiz-placeholder

Similar activities

special exam in BINARY TREE

special exam in BINARY TREE

University

15 Qs

Data Structure

Data Structure

University

15 Qs

TREES

TREES

University

20 Qs

Data Structures

Data Structures

University - Professional Development

20 Qs

Graph Traversal

Graph Traversal

12th Grade

25 Qs

Y13 Graph Traversal

Y13 Graph Traversal

9th Grade - University

16 Qs

MS 101 - Week 16 - Graph

MS 101 - Week 16 - Graph

University

20 Qs

DATA STRUCTURES

DATA STRUCTURES

University

20 Qs

2.3.1 Graph Traversal & Path Finding Algorithms

2.3.1 Graph Traversal & Path Finding Algorithms

Assessment

Quiz

Computers

12th Grade - University

Hard

Created by

Robin Smith

Used 46+ times

FREE Resource

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What supporting data structure is used for traversing a graph based on the depth-first traversal technique?

Stack

Queue

Circular Queue

2D Array

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What supporting data structure is used for traversing a graph based on the breadth-first traversal technique?

Stack

Queue

Circular Queue

2D Array

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Depth-first traversal is equivalent to which of the following traversal of trees?

Pre-order

Post-order

In-order

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

An approach to problem-solving in which different sequences are considered until the best suitable solution is found is called

Traversal

Heuristics

Backtracking

Data Mining

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Media Image

If visitedNodes = [A], what is the value of visitedNodes in the next step?

visitedNodes = [B]

visitedNodes = [B, C]

visitedNodes = [B, C, D]

visitedNodes = [A, B]

6.

MULTIPLE SELECT QUESTION

1 min • 1 pt

Media Image

If node C has been visited in the current step, what is the value of visitedNodes?

Select All That Apply.

visitedNodes = [A, B, E, I, C]

visitedNodes = [A, B, E, I, F, C]

visitedNodes = [A, B, E, I, F, J, G, C]

visitedNodes = [A, B, E, I, F, J, D, C]

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Media Image

If node D is visited in the current step, what is the value of the supporting data structure?

[A]

[A, B, C]

[A, B, C, D]

[D, B, C, A]

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?