Mastering Algorithms for Problem Solving in C++/

...

/

Quiz: Basic Graph Algorithms

Quiz: Basic Graph Algorithms

Reinforce your understanding of basic graph algorithms.

We'll cover the following...
Technical Quiz
1.

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

A.

Only two-dimensional hypercubes (or squares)

B.

Only four-dimensional hypercubes

C.

Only six-dimensional hypercubes

D.

Hypercubes of all even dimensions

1 / 5