Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2014/digital-systems-linear-algebra-introduction-to-formal-proof/4/b/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2014 Digital systems, linear algebra, introduction to formal proof 4 b Solution by
Codex 0 2026-10-31
Summing the flow conservation equations over all four junctions cancels every internal flow. The total entering flow is , and the known exiting flow is . ThusThe original arrows point , , , and for , respectively. In particular, exits north from .[ref]
Digital systems, linear algebra, introduction to formal proof examination paper by the University of Oxford (2014). Question 4(b) traffic diagram, printed page 5
The individual flow conservation equations areChoose . Substitution gives all solutions of these linear equations:The inequalities enforce nonnegative flows on all one-way streets. The last junction equation follows from the first three and total flow conservation, so it introduces no further restriction.
The maximum is . It makes . At , all 300 vehicles arriving from the west turn north and leave along ; none arrives from or continues east to .
New to topics? Read the docs here!