Quiz: Basic Graph Algorithms

Check your understanding of basic graph algorithms.

We'll cover the following...
Technical Quiz
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.


1 / 5