Salam Academy
Sign inCreate account
Practise

Question bank

Original exam-style questions, mapped to your syllabus. Answers are checked for mathematical equivalence and every attempt updates your mastery.

Sign in to check answers. Your attempts build your mastery and error book.

12 questions

SA-DM-RI-0021 markL1 FoundationNon-calculatorRoute inspection
How many ways can six odd vertices be paired?

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-G011 markL1 FoundationNon-calculatorRoute inspection
Find the total weight of the network AB4AB4, AC3AC3, BC2BC2, BD5BD5, CD6CD6, CE7CE7, DE3DE3.

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-Q011 markL1 FoundationNon-calculatorTSP bounds
The nearest neighbour algorithm for the TSP gives
Choose one option

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-X011 markL1 FoundationNon-calculatorRoute inspection
How many ways can four odd vertices be paired?

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-X041 markL1 FoundationNon-calculatorTSP bounds
Nearest-neighbour tours from three different starts have lengths 2828, 2525 and 3131. Find the best upper bound.

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-X061 markL1 FoundationNon-calculatorTSP bounds
With a lower bound of 1919 and an upper bound of 2525, the optimal tour length TT satisfies
Choose one option

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-0012 marksL2 StandardNon-calculatorRoute inspection
Find the length of the shortest closed route that traverses every edge of that network.

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-0032 marksL2 StandardNon-calculatorTSP bounds
For a TSP, deleting vertex AA leaves an MST of weight 1010. The two shortest edges from AA are 33 and 44. Find the lower bound.

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-X022 marksL2 StandardNon-calculatorRoute inspection
A network has odd vertices A,B,C,DA,B,C,D with shortest paths AB=4AB=4, CD=5CD=5, AC=3AC=3, BD=6BD=6, AD=8AD=8, BC=2BC=2. Find the least pairing total.

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-X031 markL2 StandardNon-calculatorRoute inspection
If that network has total weight 5050, find the length of the shortest closed inspection route.

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-X052 marksL2 StandardNon-calculatorTSP bounds
Deleting one vertex leaves an MST of weight 1212; the two cheapest edges at that vertex are 22 and 55. Find the lower bound.

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme
SA-DM-RI-0042 marksL3 ExamNon-calculatorRoute inspection
In the same network, the route must traverse every edge but may start and finish at different vertices. Find the shortest length.

Sign in or create a free account to check answers, get hints and track your progress.

Salam Academy Original Practice · Proposed mark scheme