Paths, trails and circuits

Identify walks, trails, paths and circuits in networks and decide when an Eulerian trail or circuit exists.

⏱ 20 min❓ 9 questions

What you'll be able to do

✔I can tell the difference between a walk, trail, path, circuit and cycle
✔I can use vertex degrees to decide whether an Eulerian trail or circuit exists
✔I can find an Eulerian trail and apply the idea to route problems

How this works

1Read the short explanations first — they teach you what you need before each question.
2Answer each question, then tap Check. A right answer moves you on automatically; if it's wrong, you'll see a friendly explanation of why.
3Finish all 3 steps to see your score — sign in and subscribe to unlock the full lesson and save it.

What's inside

9 questions and 1 quick teaching card, including:

🔘Multiple choice — Tap the answer you think is best, then check it.
⚖️True or false — Read the statement and decide if it's true or false.

👪Grown-up tip: sit alongside younger learners for the first few lessons. Read the questions together and chat about the explanations — that's where the real learning sticks.

Curriculum: AC9M10SP02