# Quiz: Basic Graph Algorithms

Check your understanding of basic graph algorithms.

1

Which hypercubes have a Euler tour (a closed walk that traverses every edge exactly once)?

A)

Only 2-dimensional hypercubes (or squares).

B)

Only 4-dimensional hypercubes.

C)

Only 6-dimensional hypercubes.

D)

Hypercubes of all even dimensions.

Question 1 of 50 attempted

Create a free account to access the full course.

By signing up, you agree to Educative's Terms of Service and Privacy Policy