Graphs/networks as models, adjacency matrices, optimisation algorithms and project scheduling. *(New-spec Strand 2, no old-syllabus equivalent.)* Sub-topics: graph theory, adjacency matrices & matrix multiplication, directed graphs, minimum spanning trees (Prim, Kruskal), shortest path (Dijkstra), dynamic programming and Bellman's principle of optimality, critical path analysis / project scheduling (precedence, activity dependencies, floats, Gantt charts).
← All Applied Maths past papers
All PDFs open on the State Examinations Commission archive (examinations.ie). ExamAI links to them; we don't host or alter them.