Algorithm Study Guide

Algorithm Study Guide

Assessment

Flashcard

Computers

9th - 11th Grade

Medium

Created by

Lays V

Used 1+ times

FREE Resource

Student preview

quiz-placeholder

25 questions

Show all answers

1.

FLASHCARD QUESTION

Front

What are the two main graph traversal algorithms?

Back

Breadth-First Search (BFS) and Depth-First Search (DFS).

2.

FLASHCARD QUESTION

Front

What data structure does BFS use?

Back

A queue (FIFO - First-In, First-Out).

3.

FLASHCARD QUESTION

Front

What data structure does DFS use?

Back

A stack (LIFO - Last-In, First-Out).

4.

FLASHCARD QUESTION

Front

What is the key difference between BFS and DFS?

Back

BFS explores all neighbours at the present depth before moving to the next level, while DFS explores as far as possible along each branch before backtracking.

5.

FLASHCARD QUESTION

Front

What are the three types of tree traversal algorithms?

Back

Pre-order, in-order, and post-order traversal.

6.

FLASHCARD QUESTION

Front

What is the order of nodes in pre-order traversal?

Back

Node, Left, Right.

7.

FLASHCARD QUESTION

Front

What is the order of nodes in in-order traversal?

Back

Left, Node, Right.

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?