DP Mathematics HL Questionbank
10.10
Description
[N/A]Directly related questions
- 18M.3dm.hl.TZ0.1c.iii: Calculate the total weight of the solution.
- 18M.3dm.hl.TZ0.1c.ii: Starting and finishing at B, find a solution to the Chinese postman problem for G.
- 18M.3dm.hl.TZ0.1c.i: State the Chinese postman problem.
- 17N.3dm.hl.TZ0.1c: By first removing library C, use the deleted vertex algorithm, to find a lower bound for...
- 17N.3dm.hl.TZ0.1b: Starting at library D use the nearest-neighbour algorithm, to find an upper bound for Mathilde’s...
- 17N.3dm.hl.TZ0.1a: Draw the weighted graph \(H\).
- 17M.3dm.hl.TZ0.2b: By first deleting vertex A , use the deleted vertex algorithm together with Kruskal’s algorithm...
- 17M.3dm.hl.TZ0.2a: Starting at A , use the nearest neighbour algorithm to find an upper bound for the travelling...
- 12N.3dm.hl.TZ0.1c: The graph above is now to be considered with the edges representing roads in a town and with the...
- 08M.3dm.hl.TZ2.2a: The table below shows the distances between towns A, B, C, D and E. (i) Draw the...
- 11M.3dm.hl.TZ0.2a: By first finding a minimum spanning tree on the subgraph of H formed by deleting vertex A and all...
- 11M.3dm.hl.TZ0.2b: Find the total weight of the cycle ADCBEA.
- 11M.3dm.hl.TZ0.2c: What do you conclude from your results?
- 10M.3dm.hl.TZ0.2: A graph G with vertices A, B, C, D, E has the following cost adjacency...
- SPNone.3dm.hl.TZ0.4a: Starting at A, use the nearest neighbour algorithm to find an upper bound for the travelling...
- SPNone.3dm.hl.TZ0.4b: (i) Use Kruskal’s algorithm to find and draw a minimum spanning tree for the subgraph...
- 14M.3dm.hl.TZ0.1c: By removing customer A, use the method of vertex deletion, to determine a lower bound to the...
- 13N.3dm.hl.TZ0.4e: Show that the lower bound found in (d) cannot be the length of an optimal solution for the...
- 14M.3dm.hl.TZ0.1b: Starting from customer D, use the nearest-neighbour algorithm, to determine an upper bound to the...
- 13N.3dm.hl.TZ0.4b: State an upper bound for the travelling salesman problem for graph \(G\).
- 13N.3dm.hl.TZ0.4d: Hence find a lower bound for the travelling salesman problem for \(G\).
- 15M.3dm.hl.TZ0.1b: Consider the following weighted graph. (i) Write down a solution to the Chinese postman...
- 15M.3dm.hl.TZ0.1c: (i) State the travelling salesman problem. (ii) Explain why there is no solution to the...
- 14N.3dm.hl.TZ0.3b: For the remainder of the question you may find the cheapest route between any two towns by...
Sub sections and their related questions
Chinese postman problem.
- 12N.3dm.hl.TZ0.1c: The graph above is now to be considered with the edges representing roads in a town and with the...
- 08M.3dm.hl.TZ2.2a: The table below shows the distances between towns A, B, C, D and E. (i) Draw the...
- 14N.3dm.hl.TZ0.3b: For the remainder of the question you may find the cheapest route between any two towns by...
- 15M.3dm.hl.TZ0.1b: Consider the following weighted graph. (i) Write down a solution to the Chinese postman...
- 17N.3dm.hl.TZ0.1a: Draw the weighted graph \(H\).
- 17N.3dm.hl.TZ0.1b: Starting at library D use the nearest-neighbour algorithm, to find an upper bound for Mathilde’s...
- 17N.3dm.hl.TZ0.1c: By first removing library C, use the deleted vertex algorithm, to find a lower bound for...
- 18M.3dm.hl.TZ0.1c.i: State the Chinese postman problem.
- 18M.3dm.hl.TZ0.1c.ii: Starting and finishing at B, find a solution to the Chinese postman problem for G.
- 18M.3dm.hl.TZ0.1c.iii: Calculate the total weight of the solution.
Travelling salesman problem.
- 11M.3dm.hl.TZ0.2a: By first finding a minimum spanning tree on the subgraph of H formed by deleting vertex A and all...
- 11M.3dm.hl.TZ0.2b: Find the total weight of the cycle ADCBEA.
- 11M.3dm.hl.TZ0.2c: What do you conclude from your results?
- SPNone.3dm.hl.TZ0.4a: Starting at A, use the nearest neighbour algorithm to find an upper bound for the travelling...
- 10M.3dm.hl.TZ0.2: A graph G with vertices A, B, C, D, E has the following cost adjacency...
- 14M.3dm.hl.TZ0.1c: By removing customer A, use the method of vertex deletion, to determine a lower bound to the...
- 13N.3dm.hl.TZ0.4e: Show that the lower bound found in (d) cannot be the length of an optimal solution for the...
- 14M.3dm.hl.TZ0.1b: Starting from customer D, use the nearest-neighbour algorithm, to determine an upper bound to the...
- 13N.3dm.hl.TZ0.4b: State an upper bound for the travelling salesman problem for graph \(G\).
- 13N.3dm.hl.TZ0.4d: Hence find a lower bound for the travelling salesman problem for \(G\).
- 15M.3dm.hl.TZ0.1c: (i) State the travelling salesman problem. (ii) Explain why there is no solution to the...
- 17N.3dm.hl.TZ0.1a: Draw the weighted graph \(H\).
- 17N.3dm.hl.TZ0.1b: Starting at library D use the nearest-neighbour algorithm, to find an upper bound for Mathilde’s...
- 17N.3dm.hl.TZ0.1c: By first removing library C, use the deleted vertex algorithm, to find a lower bound for...
- 18M.3dm.hl.TZ0.1c.i: State the Chinese postman problem.
- 18M.3dm.hl.TZ0.1c.ii: Starting and finishing at B, find a solution to the Chinese postman problem for G.
- 18M.3dm.hl.TZ0.1c.iii: Calculate the total weight of the solution.
Nearest-neighbour algorithm for determining an upper bound.
- 17N.3dm.hl.TZ0.1a: Draw the weighted graph \(H\).
- 17N.3dm.hl.TZ0.1b: Starting at library D use the nearest-neighbour algorithm, to find an upper bound for Mathilde’s...
- 17N.3dm.hl.TZ0.1c: By first removing library C, use the deleted vertex algorithm, to find a lower bound for...
- 18M.3dm.hl.TZ0.1c.i: State the Chinese postman problem.
- 18M.3dm.hl.TZ0.1c.ii: Starting and finishing at B, find a solution to the Chinese postman problem for G.
- 18M.3dm.hl.TZ0.1c.iii: Calculate the total weight of the solution.
Deleted vertex algorithm for determining a lower bound.
- SPNone.3dm.hl.TZ0.4b: (i) Use Kruskal’s algorithm to find and draw a minimum spanning tree for the subgraph...
- 10M.3dm.hl.TZ0.2: A graph G with vertices A, B, C, D, E has the following cost adjacency...
- 17N.3dm.hl.TZ0.1a: Draw the weighted graph \(H\).
- 17N.3dm.hl.TZ0.1b: Starting at library D use the nearest-neighbour algorithm, to find an upper bound for Mathilde’s...
- 17N.3dm.hl.TZ0.1c: By first removing library C, use the deleted vertex algorithm, to find a lower bound for...
- 18M.3dm.hl.TZ0.1c.i: State the Chinese postman problem.
- 18M.3dm.hl.TZ0.1c.ii: Starting and finishing at B, find a solution to the Chinese postman problem for G.
- 18M.3dm.hl.TZ0.1c.iii: Calculate the total weight of the solution.
