AQR UNIT 7 REVIEW

AQR UNIT 7 REVIEW

Assessment

Flashcard

Mathematics

12th Grade

Hard

Created by

Wayground Content

FREE Resource

Student preview

quiz-placeholder

15 questions

Show all answers

1.

FLASHCARD QUESTION

Front

What is the first step of Kruskal's Algorithm?

Back

Put all weights in a list from smallest to largest.

2.

FLASHCARD QUESTION

Front

In a Euler's Circuit or Path, can you use a vertex twice?

Back

True

3.

FLASHCARD QUESTION

Front

What is a cycle in graph theory?

Back

A path that starts and ends at the same vertex and does not use any edge more than once.

4.

FLASHCARD QUESTION

Front

What does a Hamiltonian path touch?

Back

All vertices.

5.

FLASHCARD QUESTION

Front

What is the smallest number of colors needed to color a graph called?

Back

Chromatic number.

6.

FLASHCARD QUESTION

Front

What is Kruskal's Algorithm used for?

Back

Finding the minimum spanning tree of a graph.

7.

FLASHCARD QUESTION

Front

What is a vertex in graph theory?

Back

A point where two or more edges meet.

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?