A complete, original teaching unit for Unit 2 of the Pearson Edexcel International A Level Decision Mathematics 1 (WDM11) specification, following Pearson’s IAL D1 scheme of work. Four lessons cover the language of graphs (degree, paths, cycles, trees, complete and isomorphic graphs, the handshaking lemma, Eulerian graphs, adjacency matrices); Kruskal’s and Prim’s algorithms; Prim’s algorithm on a distance matrix; and Dijkstra’s shortest path algorithm with the exam labelling boxes. Each lesson opens with a starter that checks prior knowledge, then has an editable PowerPoint with networks drawn as native shapes, worked examples set out as the mark scheme expects, practice with answer slides, exam technique, speaker notes and an exit ticket, plus a worksheet with full answers. Also includes a 40-mark unit assessment with a detailed mark scheme and a teacher guide mapping every lesson to real WDM11 past-paper questions (referenced, not reproduced). All PDFs in A4 and US Letter.
Get this resource as part of a bundle and save up to 24%
A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have purchased this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£6.50