Graph traversal: breadth-first and depth-first

AQA 75174.3 L1A-levelLesson packSubscription

Also online

This worksheet marks itself

Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.

11 questions
35 marks
about 35 minutes
marked instantly

Question types: short answer, matching, true or false, multiple choice.

Try it with a class, free How it works

Try one from this worksheet

Identify the task that a breadth-first search is best suited to.

Pick an answer: it's marked straight away, just as your pupils would see it.

About this resource

AQA A-level Computer Science (7517) 4.3.1.1 Simple graph-traversal algorithms: breadth-first and depth-first search. C# lesson 1 of 5 in 4.3 Fundamentals of algorithms: a trace-the-queue Do Now, a short key idea, a 10-challenge ladder in three sets with exact test data, two exam questions and a w…

17 slides.

Lesson outline

Do Now: trace the graph and the queue
Do Now: answers
Key idea: Breadth-first search: a queue
Key idea: Depth-first search: a stack
Key idea: Uses: fewest edges, and a maze
Key idea: Both in C#
Set 1: breadth-first: a queue
Set 2: depth-first: recursion and a stack
Exam question E1: which search?
Model answer E1
Exam question E2: trace both
Model answer E2

Unit bundle4.3 Algorithms · full C# lessons

Part of: 4.3 Algorithms · full C# lessons: the whole unitEvery resource in the unit in one zip.

Graph traversal: breadth-first and depth-first

This worksheet marks itself

About this resource

Lesson outline

More from 4.3 Algorithms · full C# lessons