DP Mathematics: Applications and Interpretation Questionbank
Topic 3—Geometry and trigonometry
Description
[N/A]Directly related questions
-
21M.2.AHL.TZ1.6a:
Find the velocity vector at time .
-
21M.2.AHL.TZ1.6b:
Show that the magnitude of the velocity of the ice-skater at time is given by
.
-
21M.2.AHL.TZ1.6d:
Find the magnitude of the velocity of the ice-skater when .
-
21M.2.AHL.TZ1.6c:
Find the value of and the value of .
-
21M.2.AHL.TZ1.6e:
At a point , the ice-skater is skating parallel to the -axis for the first time.
Find .
-
21M.2.SL.TZ2.2a:
Find the size of .
-
21M.2.SL.TZ2.2b:
Find .
-
21M.2.SL.TZ2.2c:
Find the area of triangle .
-
21M.2.SL.TZ2.2d:
Estimate . You may assume the highway has a width of zero.
-
21M.2.SL.TZ2.5a:
Given that , show that the area of the base of the box is equal to .
-
21M.2.SL.TZ2.5b:
Given that the total external surface area of the box is , show that the volume of the box may be expressed as .
-
20N.1.AHL.TZ0.F_2a:
Verify that satisfies the handshaking lemma.
-
20N.1.AHL.TZ0.F_2b:
Show that cannot be redrawn as a planar graph.
-
20N.1.AHL.TZ0.F_2c:
State, giving a reason, whether contains an Eulerian circuit.
-
20N.1.AHL.TZ0.F_7a:
Describe, in words, the effect of the transformation .
-
20N.1.AHL.TZ0.F_7b.i:
Show that the points form a square.
-
20N.1.AHL.TZ0.F_7b.ii:
Determine the area of this square.
-
20N.1.AHL.TZ0.F_7b.iii:
Find the coordinates of , the points to which are transformed under .
-
20N.1.AHL.TZ0.F_7b.iv:
Show that is a parallelogram.
-
20N.1.AHL.TZ0.F_7b.v:
Determine the area of this parallelogram.
-
20N.3.AHL.TZ0.Hdm_2a.i:
Use Dijkstra’s algorithm to find the shortest time to travel from to , clearly showing how the algorithm has been applied.
-
20N.3.AHL.TZ0.Hdm_2a.ii:
Hence write down the shortest path from to .
-
20N.3.AHL.TZ0.Hdm_2b:
A new road is constructed that allows Christine to travel from to in minutes. If Christine starts from home and uses this new road her minimum travel time to is reduced, but her minimum travel time to remains the same.
Find the possible values of .
-
20N.3.AHL.TZ0.Hdm_5a:
Find the maximum possible value of .
-
20N.3.AHL.TZ0.Hdm_5b:
Find an expression for in terms of .
-
20N.3.AHL.TZ0.Hdm_5c:
Given that the complement of is also planar and connected, find the possible values of .
-
20N.3.AHL.TZ0.Hdm_5d:
is a simple graph with vertices and edges.
Given that both and its complement are planar and connected, find the maximum possible value of .
-
20N.1.SL.TZ0.S_2a:
Given that is acute, find .
-
20N.1.SL.TZ0.S_2b:
Find .
-
20N.1.SL.TZ0.S_7a:
Find an expression for the velocity of at time .
-
20N.1.SL.TZ0.S_7b:
Particle also moves in a straight line. The position of is given by .
The speed of is greater than the speed of when .
Find the value of .
-
20N.1.SL.TZ0.S_9a:
Express in terms of .
-
20N.1.SL.TZ0.S_9b:
Find the value of .
-
20N.1.SL.TZ0.S_9c:
Consider a unit vector , such that , where .
Point is such that .
Find the coordinates of .
-
20N.2.SL.TZ0.S_7a:
Show that .
-
20N.2.SL.TZ0.S_7b:
Find the value of when the area of the shaded region is equal to the area of sector .
-
20N.1.SL.TZ0.T_1a:
Write down the value of the iron in the form where .
-
20N.1.SL.TZ0.T_1b:
Calculate James’s estimate of its volume, in .
-
20N.1.SL.TZ0.T_1c:
The actual volume of the asteroid is found to be .
Find the percentage error in James’s estimate of the volume.
-
20N.2.SL.TZ0.T_3a:
Calculate the length of .
-
20N.2.SL.TZ0.T_3b:
Show that angle , correct to three significant figures.
-
20N.2.SL.TZ0.T_3c:
Calculate the area of triangle .
-
20N.2.SL.TZ0.T_3d:
Pedro draws a circle, with centre at point , passing through point . Part of the circle is shown in the diagram.
Show that point lies outside this circle. Justify your reasoning.
-
EXN.1.SL.TZ0.11a:
Find the area of the field.
-
EXN.1.SL.TZ0.11b:
The farmer would like to divide the field into two equal parts by constructing a straight fence from to a point on .
Find . Fully justify any assumptions you make.
-
EXN.1.AHL.TZ0.7a:
Find the speed of the helicopter.
-
EXN.1.AHL.TZ0.7b:
Find the distance of the helicopter from the communications tower at .
-
EXN.1.AHL.TZ0.7c:
Find the bearing on which the helicopter is travelling.
-
EXN.1.AHL.TZ0.11:
Nymphenburg Palace in Munich has extensive grounds with points of interest (stations) within them.
These nine points, along with the palace, are shown as the vertices in the graph below. The weights on the edges are the walking times in minutes between each of the stations and the total of all the weights is minutes.
Anders decides he would like to walk along all the paths shown beginning and ending at the Palace (vertex A).
Use the Chinese Postman algorithm, clearly showing all the stages, to find the shortest time to walk along all the paths.
-
EXN.2.SL.TZ0.5b:
Find the area of campus managed by office .
-
EXN.2.SL.TZ0.5d:
State a further assumption that must be made in order to use area covered as a measure of whether or not the manager of office is responsible for more students than the managers of offices and .
-
EXN.2.SL.TZ0.5e:
A new office is to be built within the triangle formed by , and , at a point as far as possible from the other three offices.
Find the distance of this office from each of the other offices.
-
EXN.2.SL.TZ0.5c:
Hence or otherwise find the areas managed by offices and .
-
EXN.2.AHL.TZ0.7c.i:
Find an expression for the acceleration of the ball at time .
-
EXN.2.AHL.TZ0.7a:
Show that the ball is moving in a circle with its centre at and state the radius of the circle.
-
EXN.2.AHL.TZ0.7b.ii:
Hence show that the velocity of the ball is always perpendicular to the position vector of the ball.
-
EXN.2.AHL.TZ0.7b.i:
Find an expression for the velocity of the ball at time .
-
EXN.2.AHL.TZ0.7c.ii:
Find the value of at the instant the string breaks.
-
EXN.2.AHL.TZ0.7c.iii:
How many complete revolutions has the ball completed from to the instant at which the string breaks?
-
EXN.3.AHL.TZ0.2c.ii:
Write down , in terms of .
-
EXN.3.AHL.TZ0.2c.i:
Write down .
-
21M.1.SL.TZ1.3b:
The total surface of the candy is coated in chocolate. It is known that gram of the chocolate covers an area of .
Calculate the weight of chocolate required to coat one piece of candy.
-
21M.1.SL.TZ1.3a:
Calculate the total surface area of one piece of candy.
-
21M.1.SL.TZ1.5b:
Write down the coordinates of tower .
-
21M.1.SL.TZ1.5c:
Tower has coordinates .
Find the gradient of the edge of the Voronoi diagram between towers and .
-
21M.1.SL.TZ1.9:
A triangular field is such that and , each measured correct to the nearest metre, and the angle at is equal to , measured correct to the nearest .
Calculate the maximum possible area of the field.
-
21M.1.SL.TZ1.5a:
Explain why Tim will receive the strongest signal from tower .
-
21M.1.AHL.TZ1.5c:
Hence find the area of the triangle .
-
21M.1.AHL.TZ1.5a.ii:
Find .
-
21M.1.AHL.TZ1.5b:
Find .
-
21M.1.AHL.TZ1.5a.i:
Find .
-
21M.1.AHL.TZ1.10a.i:
Use Prim’s algorithm to find the weight of the minimum spanning tree of the subgraph of obtained by deleting and starting at . List the order in which the edges are selected.
-
21M.1.AHL.TZ1.10a.ii:
Hence find a lower bound for the travelling time needed to visit all the oil rigs.
-
21M.1.AHL.TZ1.10b:
Describe how an improved lower bound might be found.
-
21M.1.AHL.TZ1.16a:
Write down the adjacency matrix, , for this graph.
-
21M.1.AHL.TZ1.16b:
Find the number of ways that the ant can start at the vertex , and walk along exactly edges to return to .
-
21M.1.AHL.TZ1.13a:
Assuming the submarine travels in a straight line, write down an equation for the line along which it travels.
-
21M.1.AHL.TZ1.13b.ii:
Find .
-
21M.1.AHL.TZ1.13b.i:
Find the coordinates of .
-
21M.1.SL.TZ2.3:
A storage container consists of a box of length , width and height , and a lid in the shape of a half-cylinder, as shown in the diagram. The lid fits the top of the box exactly. The total exterior surface of the storage container is to be painted.
Find the area to be painted.
-
21M.1.SL.TZ2.2b:
Find the coordinates of station .
-
21M.1.SL.TZ2.9a:
A footpath is to be laid around the curved side of the lawn. Find the length of the footpath.
-
21M.1.SL.TZ2.9b:
Find the area of the lawn.
-
21M.1.SL.TZ2.2a:
Find the distance between stations and .
-
21M.1.SL.TZ2.4b:
Find the distance from to .
-
21M.1.SL.TZ2.4d:
Find Minta’s speed, in metres per hour.
-
21M.1.SL.TZ2.6a:
Find the equation of the perpendicular bisector of . Give your equation in the form .
-
21M.1.SL.TZ2.4a:
Write down the size of the angle of depression from to .
-
21M.1.SL.TZ2.2c:
Write down the height of station , in metres, above the ground.
-
21M.1.SL.TZ2.4c:
Find the distance from to .
-
21M.1.AHL.TZ2.8b:
In the case that , determine whether the lines intersect.
-
21M.1.AHL.TZ2.8a:
Find the possible value(s) for .
-
21M.1.AHL.TZ2.11b:
Instead of having to catch the bus to the village, Musab’s sister offers to drop him off at any junction and pick him up at any other junction of his choice.
Explain which junctions Musab should choose as his starting and finishing points.
-
21M.1.AHL.TZ2.11a:
Musab starts and finishes from the village bus-stop at . Determine the total distance Musab will need to walk.
-
21M.1.AHL.TZ2.14a:
Find the coordinates of the image of the point .
-
21M.1.AHL.TZ2.14c:
A triangle with vertices lying on the plane is transformed by .
Explain why both and its image will have exactly the same area.
-
21M.1.AHL.TZ2.14b:
Given that , find the value of and the value of .
-
21M.2.SL.TZ1.2a:
Find the size of angle in degrees.
-
21M.2.SL.TZ1.2b:
Find the distance between points and .
-
21M.2.SL.TZ1.2d:
Calculate the length of arc .
-
21M.2.SL.TZ1.2f:
Write down the height of the endpoint of the minute hand above the bookshelf at am.
-
21M.2.SL.TZ1.2e:
Calculate the area of the shaded sector, .
-
21M.2.SL.TZ1.2c:
Find the size of angle in degrees.
-
21N.1.SL.TZ0.7a:
Show that the new station should be built at .
-
21N.1.SL.TZ0.2b:
Find the area of the Bermuda Triangle.
-
21N.1.SL.TZ0.8a.i:
Write down the perimeter of the base of the hat in terms of .
-
21N.1.SL.TZ0.2a:
Calculate the value of , the measure of angle .
-
21N.1.SL.TZ0.7b.ii:
Hence draw the missing boundaries of the region around on the following diagram.
-
21N.1.SL.TZ0.7b.i:
Write down the equation of the perpendicular bisector of .
-
21N.1.SL.TZ0.8a.ii:
Find the value of .
-
21N.1.SL.TZ0.8b:
Find the surface area of the outside of the hat.
-
21N.1.AHL.TZ0.11:
The following diagram shows a corner of a field bounded by two walls defined by lines and . The walls meet at a point , making an angle of .
Farmer Nate has of fencing to make a triangular enclosure for his sheep. One end of the fence is positioned at a point on , from . The other end of the fence will be positioned at some point on , as shown on the diagram.
He wants the enclosure to take up as little of the current field as possible.
Find the minimum possible area of the triangular enclosure .
-
21N.1.AHL.TZ0.15b.ii:
Find the expression .
-
21N.1.AHL.TZ0.16b:
Find the value of when the ship will be closest to the lighthouse.
-
21N.1.AHL.TZ0.15b.iii:
Solve algebraically to find the value of that will maximize the volume, .
-
21N.1.AHL.TZ0.16a:
Find the position vector of the ship at time hours.
-
21N.1.AHL.TZ0.15a:
Show that .
-
21N.1.AHL.TZ0.16c:
An alarm will sound if the ship travels within kilometres of the lighthouse.
State whether the alarm will sound. Give a reason for your answer.
-
21N.1.AHL.TZ0.15b.i:
Find an expression for in terms of .
-
21N.2.SL.TZ0.4a:
Find the angle of depression from to .
-
21N.2.SL.TZ0.4b.i:
Find .
-
21N.2.SL.TZ0.4b.ii:
Hence or otherwise, show that the volume of the reservoir is .
-
21N.2.SL.TZ0.4d:
To avoid water leaking into the ground, the five interior sides of the reservoir have been painted with a watertight material.
Find the area that was painted.
-
21N.2.SL.TZ0.4c:
By finding an appropriate value, determine whether Joshua is correct.
-
21N.2.AHL.TZ0.4a.ii:
Find a single matrix that defines a transformation that represents the overall change in position.
-
21N.2.AHL.TZ0.4a.i:
Write down each of the transformations in matrix form, clearly stating which matrix represents each transformation.
-
21N.2.AHL.TZ0.4b:
Three drones are initially positioned at the points , and . After performing the movements listed above, the drones are positioned at points , and respectively.
Show that the area of triangle is equal to the area of triangle .
-
21N.2.AHL.TZ0.4c:
Find a single transformation that is equivalent to the three transformations represented by matrix .
-
21N.2.AHL.TZ0.4a.iii:
Find .
-
21N.2.AHL.TZ0.4a.iv:
Hence state what the value of indicates for the possible movement of the drone.
-
21N.3.AHL.TZ0.1b.i:
Use Prim’s algorithm, starting at vertex , to find the weight of the minimum spanning tree of the remaining graph. You should indicate clearly the order in which the algorithm selects each edge.
-
21N.3.AHL.TZ0.1b.ii:
Hence, for the case where , find a lower bound for Daniel’s travel time, in terms of .
-
21N.3.AHL.TZ0.1a:
Write down a Hamiltonian cycle in .
-
21N.3.AHL.TZ0.1c.i:
.
-
21N.3.AHL.TZ0.1f:
The tourist office in the city has received complaints about the lack of cleanliness of some routes between the attractions. Corinne, the office manager, decides to inspect all the routes between all the attractions, starting and finishing at . The sum of the weights of all the edges in graph is .
Corinne inspects all the routes as quickly as possible and takes hours.
Find the value of during Corinne’s inspection.
-
21N.3.AHL.TZ0.1c.ii:
.
-
21N.3.AHL.TZ0.1e.i:
Find the least value of for which the edge will definitely not be used by Daniel.
-
21N.3.AHL.TZ0.1c.iii:
.
-
21N.3.AHL.TZ0.1d.i:
Use the nearest neighbour algorithm to find two possible cycles.
-
21N.3.AHL.TZ0.1d.ii:
Find the best upper bound for Daniel’s travel time.
-
21N.3.AHL.TZ0.1e.ii:
Hence state the value of the upper bound for Daniel’s travel time for the value of found in part (e)(i).
-
22M.1.SL.TZ1.1:
The front view of a doghouse is made up of a square with an isosceles triangle on top.
The doghouse is high and wide, and sits on a square base.
The top of the rectangular surfaces of the roof of the doghouse are to be painted.
Find the area to be painted.
-
22M.1.SL.TZ1.4b:
Town is due north of town and the road passes through town .
Find the -coordinate of town .
-
22M.1.SL.TZ1.2b:
Find , the angle the rope makes with the ground.
-
22M.1.SL.TZ1.2a:
Find the length of the rope connecting to .
-
22M.1.SL.TZ1.4a:
Find the equation of the line that the road follows.
-
22M.1.AHL.TZ1.6a:
Find .
-
22M.1.AHL.TZ1.6b:
Find the length of the rope.
-
22M.1.AHL.TZ1.6c:
Find , the angle the rope makes with the platform.
-
22M.1.AHL.TZ1.13a:
Write down an expression for the position vector of the ship, hours after .
-
22M.1.AHL.TZ1.13b:
Find the time at which the bearing of the ship from the harbour is .
-
22M.1.SL.TZ2.1a:
Calculate the length of the arc made by , the end of the rubber blade.
-
22M.1.SL.TZ2.1b:
Determine the area of the windscreen that is cleared by the rubber blade.
-
22M.1.SL.TZ2.3a:
Determine the angle of depression from Camera to the centre of the cash register. Give your answer in degrees.
-
22M.1.SL.TZ2.3b:
Calculate the distance from Camera to the centre of the cash register.
-
22M.1.SL.TZ2.3c:
Without further calculation, determine which camera has the largest angle of depression to the centre of the cash register. Justify your response.
-
22M.1.AHL.TZ2.6a:
Write down the adjacency matrix for this network.
-
22M.1.AHL.TZ2.6b:
Determine the number of different walks of length that start and end at the same vertex.
-
22M.1.AHL.TZ2.8a:
Use Sam’s measurements to calculate the area of the sector. Give your answer to four significant figures.
-
22M.1.AHL.TZ2.15c:
Show that the equation of the resulting line does not depend on or .
-
22M.1.AHL.TZ2.15a:
Find the vectors and in terms of and/or .
-
22M.1.AHL.TZ2.16a:
Find the velocity vector of .
-
22M.1.AHL.TZ2.16b:
Show that the acceleration vector of is never parallel to the position vector of .
-
22M.2.SL.TZ1.4a.ii:
Find the area of the shaded segment.
-
22M.2.SL.TZ1.4a.i:
Find the angle .
-
22M.2.SL.TZ1.4b.ii:
Find the area of the field that can be reached by the goat.
-
22M.2.AHL.TZ1.2a.i:
Find the angle .
-
22M.2.AHL.TZ1.2a.ii:
Find the area of the shaded segment.
-
22M.2.AHL.TZ1.2b:
Find the area of the field that can be reached by the goat.
-
22M.2.AHL.TZ1.6c.i:
Find an expression for.
-
22M.2.AHL.TZ1.6c.ii:
Find the value of .
-
EXM.2.AHL.TZ0.2a:
Briefly explain the two differences in the application of Prim’s and Kruskal’s algorithms for finding a minimum spanning tree in a weighted connected graph.
-
EXM.2.AHL.TZ0.2c.i:
State the total minimum length of the tracks that have to be tarmacked.
-
EXM.2.AHL.TZ0.2b.iii:
Using Prim’s algorithm starting at vertex F.
-
EXM.1.AHL.TZ0.1c:
Hence, state, with a reason, what can be deduced about the values of , , .
-
SPM.1.SL.TZ0.7b:
Find the equation of the line which would complete the Voronoi cell containing site E.
Give your answer in the form where , , .
-
EXM.1.AHL.TZ0.1a:
Find with a reason, the value of .
-
EXM.1.AHL.TZ0.1b:
If the total length of the minimal spanning tree is 14, find the value of .
-
22M.2.AHL.TZ1.6c.iii:
Find the value of .
-
22M.2.AHL.TZ1.7a.i:
By considering the image of , find .
-
22M.2.AHL.TZ1.7a.ii:
By considering the image of and , show that
.
-
22M.2.AHL.TZ1.7b:
Write down the matrix .
-
22M.2.AHL.TZ1.7c.i:
Use to find the matrix .
-
22M.2.AHL.TZ1.7d.i:
Write down an equation satisfied by .
-
SPM.1.SL.TZ0.7c:
In the context of the question, explain the significance of the Voronoi cell containing site E.
-
SPM.1.SL.TZ0.14a:
Find CÂB.
-
22M.2.AHL.TZ1.7c.ii:
Hence find the angle and direction of the rotation represented by .
-
22M.2.SL.TZ2.3a:
Find the midpoint of .
-
22M.2.SL.TZ2.3b:
Find the equation of .
-
EXM.2.AHL.TZ0.2b.ii:
Using Prim’s algorithm starting at vertex A.
-
EXM.2.AHL.TZ0.2c.ii:
Sketch the tracks that are to be tarmacked.
-
SPM.1.SL.TZ0.14b:
Point B on the ground is 5 m from point E at the entrance to Ollie’s house. He is 1.8 m tall and is standing at point D, below the sensor. He walks towards point B.
Find the distance Ollie is from the entrance to his house when he first activates the sensor.
-
EXM.2.AHL.TZ0.2b.i:
Using Kruskal’s algorithm.
-
22M.2.AHL.TZ1.7d.ii:
Find the value of and the value of .
-
22M.2.SL.TZ2.3d:
Determine the exact length of .
-
22M.2.SL.TZ2.3e:
Given that the exact length of is , find the size of in degrees.
-
SPM.1.SL.TZ0.7a:
Calculate the gradient of the line segment AE.
-
22M.2.SL.TZ2.3f:
Hence find the area of triangle .
-
SPM.1.AHL.TZ0.11a:
Given that v is perpendicular to B, find the value of .
-
SPM.1.AHL.TZ0.11b:
The force, F, produced by P moving in the magnetic field is given by the vector equation F = v × B, .
Given that | F | = 14, find the value of .
-
EXM.2.SL.TZ0.4b:
Sketch a new Voronoi diagram to represent this new situation.
-
EXM.1.SL.TZ0.4:
The diagram below is part of a Voronoi diagram.
Diagram not to scale
A and B are sites with B having the co-ordinates of (4, 6). L is an edge; the equation of this perpendicular bisector of the line segment from A to B is
Find the co-ordinates of the point A.
-
EXM.2.SL.TZ0.4a:
Sketch a Voronoi diagram to represent this information.
-
EXM.2.SL.TZ0.4f:
State, with a reason, if all five children now own an equal amount of land.
-
EXM.2.SL.TZ0.4e:
Find how much land an older child has lost.
-
EXM.2.SL.TZ0.4d:
Find the area of the youngest child’s land.
-
EXM.2.AHL.TZ0.15b:
Find the area of the image of P.
-
EXM.2.AHL.TZ0.16c.i:
Find the area of triangle X.
-
EXM.2.SL.TZ0.4c:
State what the shape of the land, owned by the youngest child, is.
-
EXM.2.AHL.TZ0.15d:
Describe fully the geometrical transformation represented by X.
-
EXM.2.AHL.TZ0.16a:
Describe fully the geometrical transformation represented by B.
-
EXM.2.AHL.TZ0.16c.ii:
Hence find the area of triangle Y.
-
EXM.2.AHL.TZ0.15c:
Find the matrix X.
-
EXM.2.AHL.TZ0.15a:
Describe fully the geometrical transformation represented by A.
-
EXM.2.AHL.TZ0.16b:
Find the coordinates of triangle X.
-
EXM.2.AHL.TZ0.16d:
Matrix A represents a combination of transformations:
A stretch, with scale factor 3 and y-axis invariant;
Followed by a stretch, with scale factor 4 and x-axis invariant;
Followed by a transformation represented by matrix C.Find matrix C.
-
22M.2.AHL.TZ2.6a.i:
Find the initial speed of the ball.
-
22M.2.AHL.TZ2.6a.ii:
Find the angle of elevation of the ball as it is launched.
-
22M.2.AHL.TZ2.6d:
For the path of the ball, find an expression for in terms of .
-
22M.3.AHL.TZ1.2c.i:
Find the equation of the perpendicular bisector of .
-
22M.3.AHL.TZ1.2c.iii:
Sketch this new Voronoi diagram showing the regions within the metropolitan area which are closest to each town.
-
22M.3.AHL.TZ1.2f.ii:
Write down the number of days it takes for the pollution to reach the last town.
-
22M.3.AHL.TZ1.2f.iii:
A sewer inspector needs to plan the shortest possible route through each of the connections between different locations. Determine an appropriate start point and an appropriate end point of the inspection route.
Note that the fact that each location is connected to itself does not correspond to a sewer that needs to be inspected.
-
22M.3.AHL.TZ1.2e.i:
Find the location of the toxic waste dump, given that this location is not on the edge of the metropolitan area.
-
22M.3.AHL.TZ1.2e.ii:
Make one possible criticism of the council’s choice of location.
-
22M.3.AHL.TZ2.2g:
By deleting , use the deleted vertex algorithm to find the lower bound for the installation cost of the cycle.
-
22M.3.AHL.TZ1.2c.ii:
Given that the coordinates of one vertex of the new Voronoi diagram are , find the coordinates of the other two vertices within the metropolitan area.
-
22M.3.AHL.TZ1.2d:
A car departs from a point due north of Hamilton. It travels due east at constant speed to a destination point due North of Gaussville. It passes through the Edison, Isaacopolis and Fermitown districts. The car spends of the travel time in the Isaacopolis district.
Find the distance between Gaussville and the car’s destination point.
-
22M.3.AHL.TZ1.2f.i:
Find which town is last to be polluted. Justify your answer.
-
22M.3.AHL.TZ2.2b:
Find the cost per metre of installing this cable.
-
22M.3.AHL.TZ2.2c:
State why the cost for installing the cable between and would be higher than between the other buildings.
-
22M.3.AHL.TZ2.2d.i:
By using Kruskal’s algorithm, find the minimum spanning tree for , showing clearly the order in which edges are added.
-
22M.3.AHL.TZ2.2d.ii:
Hence find the minimum installation cost for the cables that would allow all the buildings to be part of the computer network.
-
22M.3.AHL.TZ2.2e:
State why a path that forms a Hamiltonian cycle does not always form an Eulerian circuit.
-
22M.3.AHL.TZ2.2f:
Starting at , use the nearest neighbour algorithm to find the upper bound for the installation cost of a computer network in the form of a Hamiltonian cycle.
Note: Although the graph is not complete, in this instance it is not necessary to form a table of least distances.
-
22M.3.AHL.TZ1.2a:
The model assumes that each town is positioned at a single point. Describe possible circumstances in which this modelling assumption is reasonable.
-
22M.3.AHL.TZ1.2b:
Sketch a Voronoi diagram showing the regions within the metropolitan area that are closest to each town.
-
22M.3.AHL.TZ2.2a:
Find .
-
EXM.2.AHL.TZ0.19d:
Show that the lower bound you have obtained is not the best possible for the solution to the travelling salesman problem for G.
-
EXM.2.AHL.TZ0.19c:
Give an upper bound for the travelling salesman problem for the graph above.
-
EXM.2.AHL.TZ0.19b.ii:
Hence, find a lower bound for the travelling salesman problem for G.
-
EXM.2.AHL.TZ0.19a:
Find the total number of Hamiltonian cycles in G, starting at vertex A. Explain your answer.
-
EXM.2.AHL.TZ0.19b.i:
Find a minimum spanning tree for the subgraph obtained by deleting A from G.
-
EXM.1.AHL.TZ0.24a.ii:
Find the number of distinct walks of length 4 beginning and ending at A.
-
EXM.1.AHL.TZ0.23a:
Name an algorithm that will allow Sameer to find the lowest cost road system.
-
EXM.1.AHL.TZ0.23b:
Find the lowest cost road system and state the cost of building it. Show clearly the steps of the algorithm.
-
EXM.1.AHL.TZ0.24a.i:
Write down the adjacency matrix for G.
-
EXM.1.AHL.TZ0.39b:
What is the total weight of the tree?
-
EXM.1.AHL.TZ0.38:
The diagram below shows a weighted graph.
Use Prim’s algorithms to find a minimal spanning tree, starting at J. Draw the tree, and find its total weight.
-
EXM.1.AHL.TZ0.36:
Apply Prim’s algorithm to the weighted graph given below to obtain the minimal spanning tree starting with the vertex A.
Find the weight of the minimal spanning tree.
-
EXM.1.AHL.TZ0.37:
In this part, marks will only be awarded if you show the correct application of the required algorithms, and show all your working.
In an offshore drilling site for a large oil company, the distances between the planned wells are given below in metres.
It is intended to construct a network of paths to connect the different wells in a way that minimises the sum of the distances between them.
Use Prim’s algorithm, starting at vertex 3, to find a network of paths of minimum total length that can span the whole site.
-
EXM.1.AHL.TZ0.41:
The weights of the edges in a simple graph G are given in the following table.
Use Prim’s Algorithm, starting with vertex F, to find and draw the minimum spanning tree for G. Your solution should indicate the order in which the edges are introduced.
-
EXM.1.AHL.TZ0.40:
The weights of the edges of a complete graph G are shown in the following table.
Starting at B, use Prim’s algorithm to find and draw a minimum spanning tree for G. Your solution should indicate the order in which the vertices are added. State the total weight of your tree.
-
EXM.1.AHL.TZ0.39a:
Use Prim’s algorithm to draw a minimum spanning tree starting at M.
-
18M.2.SL.TZ2.T_5a.ii:
Use Giovanni's diagram to calculate the length of AX.
-
18M.2.SL.TZ2.T_5a.iii:
Use Giovanni's diagram to find the length of BX, the horizontal displacement of the Tower.
-
18M.2.SL.TZ2.T_5b:
Find the percentage error on Giovanni’s diagram.
-
18M.2.SL.TZ2.T_5c:
Giovanni adds a point D to his diagram, such that BD = 45 m, and another triangle is formed.
Find the angle of elevation of A from D.
-
17N.1.AHL.TZ0.H_9a.i:
Find, in terms of a and b .
-
17N.1.AHL.TZ0.H_9a.ii:
Find, in terms of a and b .
-
17N.1.AHL.TZ0.H_9b.i:
Find an expression for in terms of a, b and ;
-
17N.1.AHL.TZ0.H_9b.ii:
Find an expression for in terms of a, b and .
-
17N.1.AHL.TZ0.H_9c:
Show that , and find the value of .
-
17N.1.AHL.TZ0.H_9d:
Deduce an expression for in terms of a and b only.
-
17N.1.AHL.TZ0.H_9e:
Given that area , find the value of .
-
18M.1.SL.TZ2.S_1a:
Find a vector equation for L1.
-
18M.1.SL.TZ2.S_1b:
The vector is perpendicular to . Find the value of p.
-
19M.1.AHL.TZ1.H_4a:
Show that .
-
19M.1.AHL.TZ1.H_4b:
Find the two possible values for the length of the third side.
-
19M.2.SL.TZ2.S_7:
The vector equation of line is given by r .
Point P is the point on that is closest to the origin. Find the coordinates of P.
-
16N.1.SL.TZ0.S_4a:
Find a vector equation of the line that passes through P and Q.
-
16N.1.SL.TZ0.S_4b:
The line through P and Q is perpendicular to the vector 2i nk. Find the value of .
-
16N.1.AHL.TZ0.H_8a:
find the value of ;
-
16N.1.AHL.TZ0.H_8b:
determine the coordinates of the point of intersection P.
-
17M.1.AHL.TZ1.H_3:
Solve the equation .
-
19M.1.SL.TZ1.T_6a:
Find the volume of the money box.
-
19M.1.SL.TZ1.T_6b:
A second money box is in the shape of a sphere and has the same volume as the cylindrical money box.
Find the diameter of the second money box.
-
19M.2.SL.TZ2.T_3b:
Find the slant height of the cone-shaped container.
-
19M.2.SL.TZ2.T_3c:
Show that the total surface area of the cone-shaped container is 314 cm2, correct to three significant figures.
-
19M.2.SL.TZ2.T_3d:
Find the height, , of this cylinder-shaped container.
-
19M.2.SL.TZ2.T_3e:
The factory director wants to increase the volume of coconut water sold per container.
State whether or not they should replace the cone-shaped containers with cylinder‑shaped containers. Justify your conclusion.
-
19M.2.SL.TZ2.T_2b.ii:
Find the size of angle .
-
19M.2.SL.TZ2.T_2c:
Find the size of angle .
-
18M.1.SL.TZ1.T_14a:
Calculate the radius of the base of the cone which has been removed.
-
17N.1.SL.TZ0.T_10b:
Write down the angle of elevation of B from E.
-
17N.1.SL.TZ0.T_10c:
Find the vertical height of B above the ground.
-
16N.1.AHL.TZ0.H_13a:
Find the value of .
-
16N.1.AHL.TZ0.H_13b:
Show that where .
-
16N.1.AHL.TZ0.H_13c:
Use the principle of mathematical induction to prove that
where .
-
16N.1.AHL.TZ0.H_13d:
Hence or otherwise solve the equation in the interval .
-
18M.2.SL.TZ1.T_1a:
Calculate the area of triangle EAD.
-
18M.2.SL.TZ1.T_1b:
Calculate the total volume of the barn.
-
18M.2.SL.TZ1.T_1c:
Calculate the length of MN.
-
18M.2.SL.TZ1.T_1d:
Calculate the length of AE.
-
18M.2.SL.TZ1.T_1e:
Show that Farmer Brown is incorrect.
-
18M.2.SL.TZ1.T_1f:
Calculate the total length of metal required for one support.
-
18M.2.SL.TZ1.T_6a:
Write down the height of the cylinder.
-
18M.2.SL.TZ1.T_6b:
Find the total volume of the trash can.
-
18M.2.SL.TZ1.T_6c:
Find the height of the cylinder, h , of the new trash can, in terms of r.
-
18M.2.SL.TZ1.T_6d:
Show that the volume, V cm3 , of the new trash can is given by
.
-
18M.2.SL.TZ1.T_6e:
Using your graphic display calculator, find the value of r which maximizes the value of V.
-
18M.2.SL.TZ1.T_6f:
The designer claims that the new trash can has a capacity that is at least 40% greater than the capacity of the original trash can.
State whether the designer’s claim is correct. Justify your answer.
-
17M.2.AHL.TZ1.H_10a:
Use the cosine rule to show that .
-
17M.2.AHL.TZ1.H_10b:
Calculate the two corresponding values of PQ.
-
17M.2.AHL.TZ1.H_10c:
Hence, find the area of the smaller triangle.
-
17M.2.AHL.TZ1.H_10d:
Determine the range of values of for which it is possible to form two triangles.
-
17M.2.AHL.TZ2.H_4a:
Find the set of values of that satisfy the inequality .
-
17M.2.AHL.TZ2.H_4b:
The triangle ABC is shown in the following diagram. Given that , find the range of possible values for AB.
-
17M.2.SL.TZ1.T_4a:
Calculate the volume of this pan.
-
17M.2.SL.TZ1.T_4b:
Find the radius of the sphere in cm, correct to one decimal place.
-
17M.2.SL.TZ1.T_4c:
Find the value of .
-
17M.2.SL.TZ1.T_4d:
Find the temperature that the pizza will be 5 minutes after it is taken out of the oven.
-
17M.2.SL.TZ1.T_4e:
Calculate, to the nearest second, the time since the pizza was taken out of the oven until it can be eaten.
-
17M.2.SL.TZ1.T_4f:
In the context of this model, state what the value of 19 represents.
-
19M.1.SL.TZ1.T_15a:
Write down an equation for the area, , of the curved surface in terms of .
-
19M.1.SL.TZ1.T_15b:
Find .
-
19M.1.SL.TZ1.T_15c:
Find the value of when the area of the curved surface is maximized.
-
17N.2.SL.TZ0.T_6a:
Show that the volume of a cone shaped glass is , correct to 3 significant figures.
-
17N.2.SL.TZ0.T_6b:
Calculate the radius, , of a hemisphere shaped glass.
-
17N.2.SL.TZ0.T_6c:
Find the cost of of chocolate mousse.
-
17N.2.SL.TZ0.T_6d:
Show that there is of orange paste in each special dessert.
-
17N.2.SL.TZ0.T_6e:
Find the total cost of the ingredients of one special dessert.
-
17N.2.SL.TZ0.T_6f:
Find the value of .
-
17N.2.SL.TZ0.T_3a:
Show that correct to the nearest metre.
-
17N.2.SL.TZ0.T_3b:
Calculate angle .
-
17N.2.SL.TZ0.T_3c:
Find the area of ABCD.
-
17N.2.SL.TZ0.T_3d.i:
Calculate Abdallah’s estimate for the area.
-
17N.2.SL.TZ0.T_3d.ii:
Find the percentage error in Abdallah’s estimate.
-
18N.1.SL.TZ0.T_9a.i:
Write down the value of x.
-
18N.1.SL.TZ0.T_9a.ii:
Calculate the volume of the paperweight.
-
18N.1.SL.TZ0.T_9b:
1 cm3 of glass has a mass of 2.56 grams.
Calculate the mass, in grams, of the paperweight.
-
16N.2.SL.TZ0.T_6a:
Write down a formula for , the surface area to be coated.
-
16N.2.SL.TZ0.T_6b:
Express this volume in .
-
16N.2.SL.TZ0.T_6c:
Write down, in terms of and , an equation for the volume of this water container.
-
16N.2.SL.TZ0.T_6d:
Show that .
-
16N.2.SL.TZ0.T_6e:
Find .
-
16N.2.SL.TZ0.T_6f:
Using your answer to part (e), find the value of which minimizes .
-
16N.2.SL.TZ0.T_6g:
Find the value of this minimum area.
-
16N.2.SL.TZ0.T_6h:
Find the least number of cans of water-resistant material that will coat the area in part (g).
-
16N.2.SL.TZ0.T_5a:
the length of BD;
-
16N.2.SL.TZ0.T_5b:
the size of angle DAB;
-
16N.2.SL.TZ0.T_5c:
the area of triangle ABD;
-
16N.2.SL.TZ0.T_5d:
the area of quadrilateral ABCD;
-
16N.2.SL.TZ0.T_5e:
the length of AP;
-
16N.2.SL.TZ0.T_5f:
the length of the fence, BP.
-
19M.1.AHL.TZ1.H_1:
Let a = and b = , .
Given that a and b are perpendicular, find the possible values of .
-
16N.1.SL.TZ0.T_7a:
Calculate the volume of the balloon.
-
16N.1.SL.TZ0.T_7b:
Calculate the radius of the balloon following this increase.
-
17M.2.SL.TZ1.T_2a.i:
Write down an equation for the area of ABCDE using the above information.
-
17M.2.SL.TZ1.T_2a.ii:
Show that the equation in part (a)(i) simplifies to .
-
17M.2.SL.TZ1.T_2b:
Find the length of CD.
-
17M.2.SL.TZ1.T_2c:
Show that angle , correct to one decimal place.
-
17M.2.SL.TZ1.T_2d:
Find the length of the perimeter of ABCDE.
-
17M.2.SL.TZ1.T_2e:
Calculate the length of CF.
-
17M.3.AHL.TZ0.Hdm_2a:
Starting at A , use the nearest neighbour algorithm to find an upper bound for the travelling salesman problem for .
-
17M.3.AHL.TZ0.Hdm_2b:
By first deleting vertex A , use the deleted vertex algorithm together with Kruskal’s algorithm to find a lower bound for the travelling salesman problem for .
-
17M.2.AHL.TZ1.H_8a:
Find an expression for the volume of water in the trough in terms of .
-
18N.1.AHL.TZ0.H_5a:
Find and simplify an expression for a • b in terms of .
-
18N.1.AHL.TZ0.H_5b:
Hence or otherwise, find the values of for which the angle between a and b is obtuse .
-
19M.1.SL.TZ2.S_9a:
Find the value of .
-
19M.1.SL.TZ2.S_9b:
Line passes through the origin and has a gradient of . Find the equation of .
-
19M.1.SL.TZ2.S_9c:
Find the derivative of .
-
19M.1.SL.TZ2.S_9d:
The following diagram shows the graph of for 0 ≤ ≤ 3. Line is a tangent to the graph of at point P.
Given that is parallel to , find the -coordinate of P.
-
18N.3.AHL.TZ0.Hdm_4a:
State, with a reason, whether or not G has an Eulerian circuit.
-
18N.3.AHL.TZ0.Hdm_4b:
Use Kruskal’s algorithm to find a minimum spanning tree for G, stating its total weight. Indicate clearly the order in which the edges are added.
-
18N.3.AHL.TZ0.Hdm_4c:
Use a suitable algorithm to show that the minimum time in which Mr José can get from A to E is 13 minutes.
-
18N.3.AHL.TZ0.Hdm_4d:
Find the minimum time it takes Mr José to patrol the resort if he has to walk along every road at least once, starting and ending at A. State clearly which roads need to be repeated.
-
18M.3.AHL.TZ0.Hdm_1a.i:
State what feature of G ensures that G has an Eulerian trail.
-
18M.3.AHL.TZ0.Hdm_1a.ii:
State what feature of G ensures that G does not have an Eulerian circuit.
-
18M.3.AHL.TZ0.Hdm_1b:
Write down an Eulerian trail in G.
-
18M.3.AHL.TZ0.Hdm_1c.ii:
Starting and finishing at B, find a solution to the Chinese postman problem for G.
-
18M.3.AHL.TZ0.Hdm_1c.iii:
Calculate the total weight of the solution.
-
17M.2.AHL.TZ1.H_8b:
Calculate when .
-
17M.3.AHL.TZ0.Hdm_3a.i:
In the context of graph theory, explain briefly what is meant by a circuit;
-
17M.3.AHL.TZ0.Hdm_3a.ii:
In the context of graph theory, explain briefly what is meant by an Eulerian circuit.
-
17M.3.AHL.TZ0.Hdm_3b:
The graph has six vertices and an Eulerian circuit. Determine whether or not its complement can have an Eulerian circuit.
-
17M.3.AHL.TZ0.Hdm_3c:
Find an example of a graph , with five vertices, such that and its complement both have an Eulerian trail but neither has an Eulerian circuit. Draw and as your solution.
-
17N.3.AHL.TZ0.Hdm_1a:
Draw the weighted graph .
-
17N.3.AHL.TZ0.Hdm_1b:
Starting at library D use the nearest-neighbour algorithm, to find an upper bound for Mathilde’s minimum travelling distance. Indicate clearly the order in which the edges are selected.
-
17N.3.AHL.TZ0.Hdm_1c:
By first removing library C, use the deleted vertex algorithm, to find a lower bound for Mathilde’s minimum travelling distance.
-
16N.3.AHL.TZ0.Hdm_4a:
(i) Draw the graph including the weights of all the edges.
(ii) Use the nearest-neighbour algorithm, starting at vertex , to find a Hamiltonian cycle.
(iii) Hence, find an upper bound to the travelling salesman problem for this weighted graph.
-
16N.3.AHL.TZ0.Hdm_4b:
Consider the graph . Use the deleted vertex algorithm, with as the deleted vertex, to find a lower bound to the travelling salesman problem for this weighted graph.
-
16N.3.AHL.TZ0.Hdm_4c:
(i) Use the nearest-neighbour algorithm, starting at vertex , to find a Hamiltonian cycle.
(ii) Hence find and simplify an expression in , for an upper bound to the travelling salesman problem for this weighted graph.
-
16N.3.AHL.TZ0.Hdm_4d:
By splitting the weight of the edge into two parts or otherwise, show that all Hamiltonian cycles of have the same total weight, equal to the answer found in (c)(ii).
-
19M.2.SL.TZ2.T_3a:
Find the slant height of the cone-shaped container.
-
19N.3.AHL.TZ0.Hdm_1a:
By deleting , use the deleted vertex algorithm to find a lower bound for the length of a route that visits every shop, starting and finishing at .
-
19N.3.AHL.TZ0.Hdm_1b:
Starting from , use the nearest-neighbour algorithm to find a route which gives an upper bound for this problem and calculate its length.
-
19N.3.AHL.TZ0.Hdm_4a.i:
Write down the minimum number of edges in .
-
19N.3.AHL.TZ0.Hdm_4a.ii:
Find the maximum number of edges in .
-
19N.3.AHL.TZ0.Hdm_4a.iii:
Find the maximum number of edges in , given that contains an Eulerian circuit.
-
19N.3.AHL.TZ0.Hdm_4b.i:
Explain why .
-
19N.3.AHL.TZ0.Hdm_4b.ii:
Find the value of when and .
-
19N.3.AHL.TZ0.Hdm_4b.iii:
Find the possible values of when .
-
19N.1.SL.TZ0.T_5a:
Calculate the volume of oil drained from Yao’s motorbike.
-
19N.1.SL.TZ0.T_5b:
Yao then pours all the oil from the cuboids into an empty cylindrical container. The height of the oil in the container is cm.
Find the internal radius, , of the container.
-
19N.2.SL.TZ0.T_2a:
Find the gradient of .
-
19N.2.SL.TZ0.T_2b:
Find the coordinates of point .
-
19N.2.SL.TZ0.T_2c:
Find the equation of . Give your answer in the form , where .
-
19N.2.SL.TZ0.T_2d:
Find the value of .
-
19N.2.SL.TZ0.T_2e:
Find the distance between points and .
-
19N.2.SL.TZ0.T_2f:
Given that the length of is , find the area of triangle .
-
19N.2.SL.TZ0.T_5a:
Find the length of .
-
19N.2.SL.TZ0.T_5b:
Find the size of .
-
19N.2.SL.TZ0.T_5c:
Calculate the area of the triangular plot of land .
-
19N.2.SL.TZ0.T_5d:
Determine whether the rope can extend into the triangular plot of land, . Justify your answer.
-
19N.2.SL.TZ0.T_6a:
Write down an expression for , the volume (cm3) of the speaker, in terms of , and .
-
19N.2.SL.TZ0.T_6b:
Write down an equation for the surface area of the speaker in terms of , and .
-
19N.2.SL.TZ0.T_6c:
Given the design constraint that , show that .
-
19N.2.SL.TZ0.T_6d:
Find .
-
19N.2.SL.TZ0.T_6e:
Using your answer to part (d), show that is a maximum when is equal to .
-
19N.2.SL.TZ0.T_6f:
Find the length of the cylinder for which is a maximum.
-
19N.2.SL.TZ0.T_6g:
Calculate the maximum value of .
-
19N.2.SL.TZ0.T_6h:
Use your answer to part (f) to identify the shape of the speaker with the best quality of sound.
-
SPM.2.AHL.TZ0.4b.ii:
state the height of the aircraft at this point.
-
18M.2.SL.TZ2.S_2a:
Find DB.
-
19M.1.SL.TZ1.S_2a:
Find .
-
19M.2.SL.TZ1.S_9d.i:
Find .
-
18M.1.SL.TZ1.S_9d:
Point D is also on L and has coordinates (8, 4, −9).
Find the area of triangle OCD.
-
19M.1.AHL.TZ2.H_2b:
Hence or otherwise, find the area of the triangle ABC.
-
18M.2.AHL.TZ1.H_11a:
Show that the two submarines would collide at a point P and write down the coordinates of P.
-
EXM.1.AHL.TZ0.24b:
Starting at A, use Prim’s algorithm to find and draw the minimum spanning tree for G.
Your solution should indicate clearly the way in which the tree is constructed.
-
SPM.2.AHL.TZ0.4c.i:
Find the time at which the aircraft is 4 km above the ground.
-
18M.1.SL.TZ1.S_9a:
Show that
-
17N.1.SL.TZ0.S_9a.i:
Show that .
-
17N.2.SL.TZ0.S_3b:
Let . Find .
-
EXM.2.AHL.TZ0.17d.ii:
an Eulerian trail.
-
SPM.2.AHL.TZ0.4d:
Given that the velocity of the aircraft, after the adjustment of the angle of descent, is , find the value of .
-
18N.2.SL.TZ0.S_8d:
Find the area of triangle ABC.
-
18M.1.SL.TZ1.S_9c.ii:
Write down the value of angle OBA.
-
18M.2.SL.TZ2.S_8a.i:
Find .
-
18M.2.SL.TZ2.S_8d:
Hence or otherwise find the shortest distance from R to the line through P and Q.
-
18M.1.SL.TZ1.S_6:
Six equilateral triangles, each with side length 3 cm, are arranged to form a hexagon.
This is shown in the following diagram.The vectors p , q and r are shown on the diagram.
Find p•(p + q + r).
-
EXM.2.AHL.TZ0.17b:
Write down the adjacency matrix of the graph.
-
EXM.2.AHL.TZ0.17d.i:
an Eulerian circuit.
-
EXM.2.AHL.TZ0.18d.i:
Find the number of walks of length 5 from P to Q.
-
EXM.2.AHL.TZ0.18b.ii:
Write down an Eulerian circuit in G starting at P.
-
18N.2.SL.TZ0.S_8c:
Find the angle between and .
-
17N.1.SL.TZ0.S_9b:
Find the value of .
-
18N.2.SL.TZ0.S_7a:
Let SR = . Use the cosine rule to show that .
-
SPM.2.AHL.TZ0.4b.i:
verify that it would pass directly over the airport.
-
19M.2.SL.TZ1.S_9d.iii:
Hence or otherwise, find the obtuse angle formed by the tangent line to at and the tangent line to at .
-
18M.2.AHL.TZ1.H_11c.iii:
Find the distance between the two submarines at this time.
-
17N.1.SL.TZ0.S_9c:
The point D has coordinates . Given that is perpendicular to , find the possible values of .
-
EXM.2.AHL.TZ0.17a:
Draw a graph to represent this map.
-
19M.1.SL.TZ2.S_2a:
parallel.
-
19M.2.SL.TZ1.S_9a:
Find the gradient of .
-
18N.2.SL.TZ0.S_8b.i:
Find the value of .
-
EXM.2.AHL.TZ0.17e:
Find the number of walks of length 4 from E to F.
-
19M.2.SL.TZ1.S_9b:
Find u.
-
19M.1.AHL.TZ2.H_2a.ii:
Find the vector .
-
18M.1.SL.TZ1.S_9b.i:
Find a vector equation for L.
-
18M.2.SL.TZ2.S_8c:
Find the area of triangle PQR.
-
17N.1.SL.TZ0.S_9a.ii:
Find a vector equation for .
-
SPM.2.AHL.TZ0.5a:
Show the direct flights between the cities as a graph.
-
SPM.2.AHL.TZ0.5c:
Using your answer to part (b), find the number of different ways to travel from and return to city A in exactly 6 flights.
-
SPM.2.AHL.TZ0.5g:
By deleting vertex A, use the deleted vertex algorithm to find a lower bound for the cost of the trip.
-
EXM.2.AHL.TZ0.18b.i:
Define an Eulerian circuit.
-
18M.2.SL.TZ2.S_2b:
Find DC.
-
17M.2.SL.TZ1.S_5:
The following diagram shows the chord [AB] in a circle of radius 8 cm, where .
Find the area of the shaded segment.
-
19M.2.AHL.TZ2.H_1:
In triangle ABC, AB = 5, BC = 14 and AC = 11.
Find all the interior angles of the triangle. Give your answers in degrees to one decimal place.
-
SPM.2.AHL.TZ0.4b.iii:
find the time at which it would fly directly over the airport.
-
19M.1.SL.TZ1.S_2b:
A second line, , is parallel to and passes through (1, 2, 3).
Write down a vector equation for .
-
18M.2.AHL.TZ1.H_11c.ii:
Find the value of t when the two submarines are closest together.
-
19M.1.AHL.TZ2.H_2a.i:
Find the vector .
-
18M.2.AHL.TZ1.H_11b.ii:
Find the value of t when submarine B passes through P.
-
17M.2.SL.TZ2.S_9d:
When the ship reaches D, it changes direction and travels directly to the island at 50 km per hour. At the same time as the ship changes direction, a boat starts travelling to the island from a point B. This point B lies on (AC), between A and C, and is the closest point to the island. The ship and the boat arrive at the island at the same time. Find the speed of the boat.
-
SPM.2.AHL.TZ0.4c.ii:
Find the direct distance of the aircraft from the airport at this point.
-
SPM.2.AHL.TZ0.4a:
Write down a vector equation for the displacement, r of the aircraft in terms of .
-
19M.1.SL.TZ1.S_6:
The magnitudes of two vectors, u and v, are 4 and respectively. The angle between u and v is .
Let w = u − v. Find the magnitude of w.
-
19M.1.SL.TZ2.S_2b:
perpendicular.
-
19M.2.SL.TZ1.S_9c:
Find the acute angle between and .
-
19M.2.SL.TZ1.S_9d.ii:
Hence, write down .
-
18N.2.SL.TZ0.S_8a.ii:
Find .
-
18N.2.SL.TZ0.S_8b.ii:
Show that .
-
18M.1.SL.TZ1.S_9b.ii:
Point C (k , 12 , −k) is on L. Show that k = 14.
-
18M.1.SL.TZ1.S_9c.i:
Find .
-
18M.2.SL.TZ2.S_8a.ii:
Find .
-
18M.2.SL.TZ2.S_8b:
Find the angle between PQ and PR.
-
17N.2.SL.TZ0.S_3a:
Find .
-
EXM.2.AHL.TZ0.17c:
List the degrees of each of the vertices.
-
SPM.2.AHL.TZ0.5b:
Write down the adjacency matrix for this graph.
-
SPM.2.AHL.TZ0.5f:
Use the nearest neighbour algorithm to find an upper bound for the cost of the trip.
-
SPM.2.AHL.TZ0.5d:
State whether or not it is possible to travel from and return to city A in exactly 6 flights, having visited each of the other 5 cities exactly once. Justify your answer.
-
EXM.2.AHL.TZ0.18a:
Draw the graph of G.
-
EXM.2.AHL.TZ0.18c.ii:
Explain why it is not possible to have a Hamiltonian cycle in G.
-
EXM.2.AHL.TZ0.18d.ii:
Which pairs of distinct vertices have more than 15 walks of length 3 between them?
-
EXM.2.AHL.TZ0.18c.i:
Define a Hamiltonian cycle.
-
SPM.2.AHL.TZ0.5e:
Find the values of and .
-
SPM.1.AHL.TZ0.5b:
Find the volume of this log.
-
19M.1.SL.TZ1.T_8a:
Draw and label the angle of depression on the diagram.
-
18N.2.AHL.TZ0.H_7:
Boat A is situated 10km away from boat B, and each boat has a marine radio transmitter on board. The range of the transmitter on boat A is 7km, and the range of the transmitter on boat B is 5km. The region in which both transmitters can be detected is represented by the shaded region in the following diagram. Find the area of this region.
-
17N.1.SL.TZ0.S_4b:
The shape in the following diagram is formed by adding a semicircle with diameter [AC] to the triangle.
Find the exact perimeter of this shape.
-
17N.1.SL.TZ0.S_4a:
Show that .
-
18M.2.AHL.TZ2.H_4b:
Find the area of the shaded region.
-
16N.2.SL.TZ0.S_3c:
Find AB.
-
19M.1.AHL.TZ1.H_3:
A sector of a circle with radius cm , where > 0, is shown on the following diagram.
The sector has an angle of 1 radian at the centre.Let the area of the sector be cm2 and the perimeter be cm. Given that , find the value of .
-
SPM.1.SL.TZ0.11:
Helen is building a cabin using cylindrical logs of length 2.4 m and radius 8.4 cm. A wedge is cut from one log and the cross-section of this log is illustrated in the following diagram.
Find the volume of this log.
-
16N.2.AHL.TZ0.H_7a:
Use the cosine rule to find the two possible values for AC.
-
17N.1.SL.TZ0.T_10a:
Find the length of EB.
-
16N.2.SL.TZ0.S_3b:
Find the value of .
-
16N.2.AHL.TZ0.H_9b:
Show that .
-
18M.2.SL.TZ2.T_5a.i:
Use Giovanni’s diagram to show that angle ABC, the angle at which the Tower is leaning relative to the
horizontal, is 85° to the nearest degree. -
17M.2.SL.TZ2.S_1b:
Find the perimeter of sector OABC.
-
16N.2.AHL.TZ0.H_9c:
Hence find the value of given that the shaded area is equal to 4.
-
SPM.1.AHL.TZ0.5a:
Find 50° in radians.
-
16N.2.SL.TZ0.S_3a:
Write down the exact value of in radians.
-
18M.1.SL.TZ1.T_8a:
On the diagram, draw and label with an x the angle of depression of B from P.
-
19M.2.SL.TZ2.S_4b:
Find the area of triangle OBC in terms of and θ.
-
18M.2.AHL.TZ2.H_4a.i:
Find AM.
-
17M.2.SL.TZ2.S_1a:
Find the length of arc ABC.
-
17M.2.SL.TZ2.S_1c:
Find the area of sector OABC.
-
16N.2.AHL.TZ0.H_9a:
Find an expression for the shaded area in terms of , and .
-
16N.2.AHL.TZ0.H_7b:
Find the difference between the areas of the two possible triangles ABC.
Sub sections and their related questions
SL 3.1—3d space, volume, angles, midpoints
-
SPM.1.SL.TZ0.11:
Helen is building a cabin using cylindrical logs of length 2.4 m and radius 8.4 cm. A wedge is cut from one log and the cross-section of this log is illustrated in the following diagram.
Find the volume of this log.
-
18M.1.SL.TZ1.T_14a:
Calculate the radius of the base of the cone which has been removed.
-
17M.2.SL.TZ1.T_4a:
Calculate the volume of this pan.
-
17M.2.SL.TZ1.T_4b:
Find the radius of the sphere in cm, correct to one decimal place.
-
17M.2.SL.TZ1.T_4c:
Find the value of .
-
17M.2.SL.TZ1.T_4d:
Find the temperature that the pizza will be 5 minutes after it is taken out of the oven.
-
17M.2.SL.TZ1.T_4e:
Calculate, to the nearest second, the time since the pizza was taken out of the oven until it can be eaten.
-
17M.2.SL.TZ1.T_4f:
In the context of this model, state what the value of 19 represents.
-
16N.2.SL.TZ0.T_6a:
Write down a formula for , the surface area to be coated.
-
16N.2.SL.TZ0.T_6b:
Express this volume in .
-
16N.2.SL.TZ0.T_6c:
Write down, in terms of and , an equation for the volume of this water container.
-
16N.2.SL.TZ0.T_6d:
Show that .
-
16N.2.SL.TZ0.T_6e:
Find .
-
16N.2.SL.TZ0.T_6f:
Using your answer to part (e), find the value of which minimizes .
-
16N.2.SL.TZ0.T_6g:
Find the value of this minimum area.
-
16N.2.SL.TZ0.T_6h:
Find the least number of cans of water-resistant material that will coat the area in part (g).
-
19M.2.SL.TZ2.T_3b:
Find the slant height of the cone-shaped container.
-
19M.2.SL.TZ2.T_3c:
Show that the total surface area of the cone-shaped container is 314 cm2, correct to three significant figures.
-
19M.2.SL.TZ2.T_3d:
Find the height, , of this cylinder-shaped container.
-
19M.2.SL.TZ2.T_3e:
The factory director wants to increase the volume of coconut water sold per container.
State whether or not they should replace the cone-shaped containers with cylinder‑shaped containers. Justify your conclusion.
-
18N.1.SL.TZ0.T_9a.i:
Write down the value of x.
-
18N.1.SL.TZ0.T_9a.ii:
Calculate the volume of the paperweight.
-
18N.1.SL.TZ0.T_9b:
1 cm3 of glass has a mass of 2.56 grams.
Calculate the mass, in grams, of the paperweight.
-
18M.2.SL.TZ1.T_1a:
Calculate the area of triangle EAD.
-
18M.2.SL.TZ1.T_1b:
Calculate the total volume of the barn.
-
18M.2.SL.TZ1.T_1c:
Calculate the length of MN.
-
18M.2.SL.TZ1.T_1d:
Calculate the length of AE.
-
18M.2.SL.TZ1.T_1e:
Show that Farmer Brown is incorrect.
-
18M.2.SL.TZ1.T_1f:
Calculate the total length of metal required for one support.
-
18M.2.SL.TZ1.T_6a:
Write down the height of the cylinder.
-
18M.2.SL.TZ1.T_6b:
Find the total volume of the trash can.
-
18M.2.SL.TZ1.T_6c:
Find the height of the cylinder, h , of the new trash can, in terms of r.
-
18M.2.SL.TZ1.T_6d:
Show that the volume, V cm3 , of the new trash can is given by
.
-
18M.2.SL.TZ1.T_6e:
Using your graphic display calculator, find the value of r which maximizes the value of V.
-
18M.2.SL.TZ1.T_6f:
The designer claims that the new trash can has a capacity that is at least 40% greater than the capacity of the original trash can.
State whether the designer’s claim is correct. Justify your answer.
-
17N.2.SL.TZ0.T_6a:
Show that the volume of a cone shaped glass is , correct to 3 significant figures.
-
17N.2.SL.TZ0.T_6b:
Calculate the radius, , of a hemisphere shaped glass.
-
17N.2.SL.TZ0.T_6c:
Find the cost of of chocolate mousse.
-
17N.2.SL.TZ0.T_6d:
Show that there is of orange paste in each special dessert.
-
17N.2.SL.TZ0.T_6e:
Find the total cost of the ingredients of one special dessert.
-
17N.2.SL.TZ0.T_6f:
Find the value of .
-
19M.1.SL.TZ1.T_6a:
Find the volume of the money box.
-
19M.1.SL.TZ1.T_6b:
A second money box is in the shape of a sphere and has the same volume as the cylindrical money box.
Find the diameter of the second money box.
-
19M.1.SL.TZ1.T_15a:
Write down an equation for the area, , of the curved surface in terms of .
-
19M.1.SL.TZ1.T_15b:
Find .
-
19M.1.SL.TZ1.T_15c:
Find the value of when the area of the curved surface is maximized.
-
16N.1.SL.TZ0.T_7a:
Calculate the volume of the balloon.
-
16N.1.SL.TZ0.T_7b:
Calculate the radius of the balloon following this increase.
-
19M.2.SL.TZ2.T_3a:
Find the slant height of the cone-shaped container.
-
19N.1.SL.TZ0.T_5a:
Calculate the volume of oil drained from Yao’s motorbike.
-
19N.1.SL.TZ0.T_5b:
Yao then pours all the oil from the cuboids into an empty cylindrical container. The height of the oil in the container is cm.
Find the internal radius, , of the container.
-
19N.2.SL.TZ0.T_6a:
Write down an expression for , the volume (cm3) of the speaker, in terms of , and .
-
19N.2.SL.TZ0.T_6b:
Write down an equation for the surface area of the speaker in terms of , and .
-
19N.2.SL.TZ0.T_6c:
Given the design constraint that , show that .
-
19N.2.SL.TZ0.T_6d:
Find .
-
19N.2.SL.TZ0.T_6e:
Using your answer to part (d), show that is a maximum when is equal to .
-
19N.2.SL.TZ0.T_6f:
Find the length of the cylinder for which is a maximum.
-
19N.2.SL.TZ0.T_6g:
Calculate the maximum value of .
-
19N.2.SL.TZ0.T_6h:
Use your answer to part (f) to identify the shape of the speaker with the best quality of sound.
-
20N.1.SL.TZ0.T_1a:
Write down the value of the iron in the form where .
-
20N.1.SL.TZ0.T_1b:
Calculate James’s estimate of its volume, in .
-
20N.1.SL.TZ0.T_1c:
The actual volume of the asteroid is found to be .
Find the percentage error in James’s estimate of the volume.
-
21M.1.SL.TZ1.3a:
Calculate the total surface area of one piece of candy.
-
21M.1.SL.TZ1.3b:
The total surface of the candy is coated in chocolate. It is known that gram of the chocolate covers an area of .
Calculate the weight of chocolate required to coat one piece of candy.
-
21M.1.SL.TZ2.2a:
Find the distance between stations and .
-
21M.1.SL.TZ2.2b:
Find the coordinates of station .
-
21M.1.SL.TZ2.2c:
Write down the height of station , in metres, above the ground.
-
21M.1.SL.TZ2.3:
A storage container consists of a box of length , width and height , and a lid in the shape of a half-cylinder, as shown in the diagram. The lid fits the top of the box exactly. The total exterior surface of the storage container is to be painted.
Find the area to be painted.
-
21M.2.SL.TZ2.5b:
Given that the total external surface area of the box is , show that the volume of the box may be expressed as .
-
21N.1.SL.TZ0.8a.i:
Write down the perimeter of the base of the hat in terms of .
-
21N.1.SL.TZ0.8a.ii:
Find the value of .
-
21N.1.SL.TZ0.8b:
Find the surface area of the outside of the hat.
-
21N.1.AHL.TZ0.15a:
Show that .
-
21N.1.AHL.TZ0.15b.i:
Find an expression for in terms of .
-
21N.1.AHL.TZ0.15b.ii:
Find the expression .
-
21N.1.AHL.TZ0.15b.iii:
Solve algebraically to find the value of that will maximize the volume, .
-
21N.2.SL.TZ0.4a:
Find the angle of depression from to .
-
21N.2.SL.TZ0.4b.i:
Find .
-
21N.2.SL.TZ0.4b.ii:
Hence or otherwise, show that the volume of the reservoir is .
-
21N.2.SL.TZ0.4c:
By finding an appropriate value, determine whether Joshua is correct.
-
21N.2.SL.TZ0.4d:
To avoid water leaking into the ground, the five interior sides of the reservoir have been painted with a watertight material.
Find the area that was painted.
-
22M.3.AHL.TZ1.2d:
A car departs from a point due north of Hamilton. It travels due east at constant speed to a destination point due North of Gaussville. It passes through the Edison, Isaacopolis and Fermitown districts. The car spends of the travel time in the Isaacopolis district.
Find the distance between Gaussville and the car’s destination point.
-
22M.1.SL.TZ1.1:
The front view of a doghouse is made up of a square with an isosceles triangle on top.
The doghouse is high and wide, and sits on a square base.
The top of the rectangular surfaces of the roof of the doghouse are to be painted.
Find the area to be painted.
-
22M.1.SL.TZ1.2a:
Find the length of the rope connecting to .
-
22M.1.SL.TZ1.2b:
Find , the angle the rope makes with the ground.
-
22M.1.AHL.TZ1.6a:
Find .
-
22M.1.AHL.TZ1.6b:
Find the length of the rope.
-
22M.1.AHL.TZ1.6c:
Find , the angle the rope makes with the platform.
-
22M.2.SL.TZ2.3b:
Find the equation of .
-
22M.2.SL.TZ2.3d:
Determine the exact length of .
-
22M.2.SL.TZ2.3e:
Given that the exact length of is , find the size of in degrees.
SL 3.2—2d and 3d trig
-
SPM.1.SL.TZ0.14a:
Find CÂB.
-
SPM.1.SL.TZ0.14b:
Point B on the ground is 5 m from point E at the entrance to Ollie’s house. He is 1.8 m tall and is standing at point D, below the sensor. He walks towards point B.
Find the distance Ollie is from the entrance to his house when he first activates the sensor.
-
18M.2.SL.TZ2.T_5a.i:
Use Giovanni’s diagram to show that angle ABC, the angle at which the Tower is leaning relative to the
horizontal, is 85° to the nearest degree. -
18M.2.SL.TZ2.T_5a.ii:
Use Giovanni's diagram to calculate the length of AX.
-
18M.2.SL.TZ2.T_5a.iii:
Use Giovanni's diagram to find the length of BX, the horizontal displacement of the Tower.
-
18M.2.SL.TZ2.T_5b:
Find the percentage error on Giovanni’s diagram.
-
18M.2.SL.TZ2.T_5c:
Giovanni adds a point D to his diagram, such that BD = 45 m, and another triangle is formed.
Find the angle of elevation of A from D.
-
17N.2.SL.TZ0.T_3a:
Show that correct to the nearest metre.
-
17N.2.SL.TZ0.T_3b:
Calculate angle .
-
17N.2.SL.TZ0.T_3c:
Find the area of ABCD.
-
17N.2.SL.TZ0.T_3d.i:
Calculate Abdallah’s estimate for the area.
-
17N.2.SL.TZ0.T_3d.ii:
Find the percentage error in Abdallah’s estimate.
-
19M.2.SL.TZ2.T_2b.ii:
Find the size of angle .
-
19M.2.SL.TZ2.T_2c:
Find the size of angle .
-
17M.2.AHL.TZ1.H_10a:
Use the cosine rule to show that .
-
17M.2.AHL.TZ1.H_10b:
Calculate the two corresponding values of PQ.
-
17M.2.AHL.TZ1.H_10c:
Hence, find the area of the smaller triangle.
-
17M.2.AHL.TZ1.H_10d:
Determine the range of values of for which it is possible to form two triangles.
-
19M.2.AHL.TZ2.H_1:
In triangle ABC, AB = 5, BC = 14 and AC = 11.
Find all the interior angles of the triangle. Give your answers in degrees to one decimal place.
-
18N.2.AHL.TZ0.H_7:
Boat A is situated 10km away from boat B, and each boat has a marine radio transmitter on board. The range of the transmitter on boat A is 7km, and the range of the transmitter on boat B is 5km. The region in which both transmitters can be detected is represented by the shaded region in the following diagram. Find the area of this region.
-
19M.1.AHL.TZ1.H_4a:
Show that .
-
19M.1.AHL.TZ1.H_4b:
Find the two possible values for the length of the third side.
-
17M.2.AHL.TZ2.H_4a:
Find the set of values of that satisfy the inequality .
-
17M.2.AHL.TZ2.H_4b:
The triangle ABC is shown in the following diagram. Given that , find the range of possible values for AB.
-
17M.2.SL.TZ1.S_5:
The following diagram shows the chord [AB] in a circle of radius 8 cm, where .
Find the area of the shaded segment.
-
18M.2.SL.TZ2.S_2a:
Find DB.
-
18M.2.SL.TZ2.S_2b:
Find DC.
-
18N.2.SL.TZ0.S_7a:
Let SR = . Use the cosine rule to show that .
-
18M.2.SL.TZ1.T_1a:
Calculate the area of triangle EAD.
-
18M.2.SL.TZ1.T_1b:
Calculate the total volume of the barn.
-
18M.2.SL.TZ1.T_1c:
Calculate the length of MN.
-
18M.2.SL.TZ1.T_1d:
Calculate the length of AE.
-
18M.2.SL.TZ1.T_1e:
Show that Farmer Brown is incorrect.
-
18M.2.SL.TZ1.T_1f:
Calculate the total length of metal required for one support.
-
17N.1.SL.TZ0.T_10a:
Find the length of EB.
-
17N.1.SL.TZ0.T_10b:
Write down the angle of elevation of B from E.
-
17N.1.SL.TZ0.T_10c:
Find the vertical height of B above the ground.
-
17M.2.SL.TZ1.T_2a.i:
Write down an equation for the area of ABCDE using the above information.
-
17M.2.SL.TZ1.T_2a.ii:
Show that the equation in part (a)(i) simplifies to .
-
17M.2.SL.TZ1.T_2b:
Find the length of CD.
-
17M.2.SL.TZ1.T_2c:
Show that angle , correct to one decimal place.
-
17M.2.SL.TZ1.T_2d:
Find the length of the perimeter of ABCDE.
-
17M.2.SL.TZ1.T_2e:
Calculate the length of CF.
-
19M.1.SL.TZ1.T_8a:
Draw and label the angle of depression on the diagram.
-
16N.2.SL.TZ0.T_5a:
the length of BD;
-
16N.2.SL.TZ0.T_5b:
the size of angle DAB;
-
16N.2.SL.TZ0.T_5c:
the area of triangle ABD;
-
16N.2.SL.TZ0.T_5d:
the area of quadrilateral ABCD;
-
16N.2.SL.TZ0.T_5e:
the length of AP;
-
16N.2.SL.TZ0.T_5f:
the length of the fence, BP.
-
19N.2.SL.TZ0.T_2a:
Find the gradient of .
-
19N.2.SL.TZ0.T_2b:
Find the coordinates of point .
-
19N.2.SL.TZ0.T_2c:
Find the equation of . Give your answer in the form , where .
-
19N.2.SL.TZ0.T_2d:
Find the value of .
-
19N.2.SL.TZ0.T_2e:
Find the distance between points and .
-
19N.2.SL.TZ0.T_2f:
Given that the length of is , find the area of triangle .
-
19N.2.SL.TZ0.T_5a:
Find the length of .
-
19N.2.SL.TZ0.T_5b:
Find the size of .
-
19N.2.SL.TZ0.T_5c:
Calculate the area of the triangular plot of land .
-
19N.2.SL.TZ0.T_5d:
Determine whether the rope can extend into the triangular plot of land, . Justify your answer.
-
20N.1.SL.TZ0.S_2a:
Given that is acute, find .
-
20N.1.SL.TZ0.S_2b:
Find .
-
20N.2.SL.TZ0.T_3a:
Calculate the length of .
-
20N.2.SL.TZ0.T_3b:
Show that angle , correct to three significant figures.
-
20N.2.SL.TZ0.T_3c:
Calculate the area of triangle .
-
20N.2.SL.TZ0.T_3d:
Pedro draws a circle, with centre at point , passing through point . Part of the circle is shown in the diagram.
Show that point lies outside this circle. Justify your reasoning.
-
EXN.1.SL.TZ0.11a:
Find the area of the field.
-
EXN.1.SL.TZ0.11b:
The farmer would like to divide the field into two equal parts by constructing a straight fence from to a point on .
Find . Fully justify any assumptions you make.
-
21M.1.SL.TZ1.9:
A triangular field is such that and , each measured correct to the nearest metre, and the angle at is equal to , measured correct to the nearest .
Calculate the maximum possible area of the field.
-
21M.2.SL.TZ1.2a:
Find the size of angle in degrees.
-
21M.2.SL.TZ1.2b:
Find the distance between points and .
-
21M.1.SL.TZ2.9a:
A footpath is to be laid around the curved side of the lawn. Find the length of the footpath.
-
21M.1.SL.TZ2.9b:
Find the area of the lawn.
-
21M.2.SL.TZ2.2a:
Find the size of .
-
21M.2.SL.TZ2.2b:
Find .
-
21M.2.SL.TZ2.2c:
Find the area of triangle .
-
21M.2.SL.TZ2.2d:
Estimate . You may assume the highway has a width of zero.
-
21M.2.SL.TZ2.5a:
Given that , show that the area of the base of the box is equal to .
-
21N.1.SL.TZ0.2a:
Calculate the value of , the measure of angle .
-
21N.1.SL.TZ0.2b:
Find the area of the Bermuda Triangle.
-
21N.1.AHL.TZ0.11:
The following diagram shows a corner of a field bounded by two walls defined by lines and . The walls meet at a point , making an angle of .
Farmer Nate has of fencing to make a triangular enclosure for his sheep. One end of the fence is positioned at a point on , from . The other end of the fence will be positioned at some point on , as shown on the diagram.
He wants the enclosure to take up as little of the current field as possible.
Find the minimum possible area of the triangular enclosure .
-
21N.2.SL.TZ0.4a:
Find the angle of depression from to .
-
21N.2.SL.TZ0.4b.i:
Find .
-
21N.2.SL.TZ0.4b.ii:
Hence or otherwise, show that the volume of the reservoir is .
-
21N.2.SL.TZ0.4c:
By finding an appropriate value, determine whether Joshua is correct.
-
21N.2.SL.TZ0.4d:
To avoid water leaking into the ground, the five interior sides of the reservoir have been painted with a watertight material.
Find the area that was painted.
-
22M.3.AHL.TZ2.2a:
Find .
-
22M.3.AHL.TZ2.2b:
Find the cost per metre of installing this cable.
-
22M.3.AHL.TZ2.2c:
State why the cost for installing the cable between and would be higher than between the other buildings.
-
22M.1.SL.TZ1.1:
The front view of a doghouse is made up of a square with an isosceles triangle on top.
The doghouse is high and wide, and sits on a square base.
The top of the rectangular surfaces of the roof of the doghouse are to be painted.
Find the area to be painted.
-
22M.1.SL.TZ1.2a:
Find the length of the rope connecting to .
-
22M.1.SL.TZ1.2b:
Find , the angle the rope makes with the ground.
-
22M.1.SL.TZ2.3a:
Determine the angle of depression from Camera to the centre of the cash register. Give your answer in degrees.
-
22M.1.SL.TZ2.3b:
Calculate the distance from Camera to the centre of the cash register.
-
22M.1.SL.TZ2.3c:
Without further calculation, determine which camera has the largest angle of depression to the centre of the cash register. Justify your response.
-
22M.2.SL.TZ1.4a.i:
Find the angle .
-
22M.2.SL.TZ1.4a.ii:
Find the area of the shaded segment.
-
22M.2.AHL.TZ1.2a.i:
Find the angle .
-
22M.2.AHL.TZ1.2a.ii:
Find the area of the shaded segment.
-
22M.2.SL.TZ2.3f:
Hence find the area of triangle .
SL 3.3—Angles of elevation and depression
-
18M.2.SL.TZ2.T_5a.i:
Use Giovanni’s diagram to show that angle ABC, the angle at which the Tower is leaning relative to the
horizontal, is 85° to the nearest degree. -
17M.2.SL.TZ1.S_5:
The following diagram shows the chord [AB] in a circle of radius 8 cm, where .
Find the area of the shaded segment.
-
17M.2.SL.TZ2.S_9d:
When the ship reaches D, it changes direction and travels directly to the island at 50 km per hour. At the same time as the ship changes direction, a boat starts travelling to the island from a point B. This point B lies on (AC), between A and C, and is the closest point to the island. The ship and the boat arrive at the island at the same time. Find the speed of the boat.
-
18M.2.SL.TZ2.S_2a:
Find DB.
-
18M.2.SL.TZ2.S_2b:
Find DC.
-
18N.2.SL.TZ0.S_7a:
Let SR = . Use the cosine rule to show that .
-
17N.1.SL.TZ0.T_10a:
Find the length of EB.
-
19M.1.SL.TZ1.T_8a:
Draw and label the angle of depression on the diagram.
-
18M.1.SL.TZ1.T_8a:
On the diagram, draw and label with an x the angle of depression of B from P.
-
21M.1.SL.TZ2.4a:
Write down the size of the angle of depression from to .
-
21M.1.SL.TZ2.4b:
Find the distance from to .
-
21M.1.SL.TZ2.4c:
Find the distance from to .
-
21M.1.SL.TZ2.4d:
Find Minta’s speed, in metres per hour.
-
21N.2.SL.TZ0.4a:
Find the angle of depression from to .
-
21N.2.SL.TZ0.4b.i:
Find .
-
21N.2.SL.TZ0.4b.ii:
Hence or otherwise, show that the volume of the reservoir is .
-
21N.2.SL.TZ0.4c:
By finding an appropriate value, determine whether Joshua is correct.
-
21N.2.SL.TZ0.4d:
To avoid water leaking into the ground, the five interior sides of the reservoir have been painted with a watertight material.
Find the area that was painted.
-
22M.1.SL.TZ1.1:
The front view of a doghouse is made up of a square with an isosceles triangle on top.
The doghouse is high and wide, and sits on a square base.
The top of the rectangular surfaces of the roof of the doghouse are to be painted.
Find the area to be painted.
-
22M.1.SL.TZ1.2a:
Find the length of the rope connecting to .
-
22M.1.SL.TZ1.2b:
Find , the angle the rope makes with the ground.
-
22M.1.AHL.TZ1.6a:
Find .
-
22M.1.AHL.TZ1.6b:
Find the length of the rope.
-
22M.1.AHL.TZ1.6c:
Find , the angle the rope makes with the platform.
-
22M.1.SL.TZ2.3a:
Determine the angle of depression from Camera to the centre of the cash register. Give your answer in degrees.
-
22M.1.SL.TZ2.3b:
Calculate the distance from Camera to the centre of the cash register.
-
22M.1.SL.TZ2.3c:
Without further calculation, determine which camera has the largest angle of depression to the centre of the cash register. Justify your response.
-
22M.2.AHL.TZ1.2b:
Find the area of the field that can be reached by the goat.
SL 3.4—The circle, arc and area of sector, degrees only
-
SPM.1.SL.TZ0.11:
Helen is building a cabin using cylindrical logs of length 2.4 m and radius 8.4 cm. A wedge is cut from one log and the cross-section of this log is illustrated in the following diagram.
Find the volume of this log.
-
18N.2.AHL.TZ0.H_7:
Boat A is situated 10km away from boat B, and each boat has a marine radio transmitter on board. The range of the transmitter on boat A is 7km, and the range of the transmitter on boat B is 5km. The region in which both transmitters can be detected is represented by the shaded region in the following diagram. Find the area of this region.
-
17M.2.SL.TZ1.S_5:
The following diagram shows the chord [AB] in a circle of radius 8 cm, where .
Find the area of the shaded segment.
-
21M.2.SL.TZ1.2c:
Find the size of angle in degrees.
-
21M.2.SL.TZ1.2d:
Calculate the length of arc .
-
21M.2.SL.TZ1.2e:
Calculate the area of the shaded sector, .
-
21M.2.SL.TZ1.2f:
Write down the height of the endpoint of the minute hand above the bookshelf at am.
-
21M.1.SL.TZ2.9a:
A footpath is to be laid around the curved side of the lawn. Find the length of the footpath.
-
21M.1.SL.TZ2.9b:
Find the area of the lawn.
-
21N.1.SL.TZ0.8a.i:
Write down the perimeter of the base of the hat in terms of .
-
21N.1.SL.TZ0.8a.ii:
Find the value of .
-
21N.1.SL.TZ0.8b:
Find the surface area of the outside of the hat.
-
22M.1.SL.TZ2.1a:
Calculate the length of the arc made by , the end of the rubber blade.
-
22M.1.SL.TZ2.1b:
Determine the area of the windscreen that is cleared by the rubber blade.
-
22M.1.AHL.TZ2.8a:
Use Sam’s measurements to calculate the area of the sector. Give your answer to four significant figures.
-
22M.2.SL.TZ1.4a.i:
Find the angle .
-
22M.2.SL.TZ1.4a.ii:
Find the area of the shaded segment.
-
22M.2.SL.TZ1.4b.ii:
Find the area of the field that can be reached by the goat.
-
22M.2.AHL.TZ1.2a.i:
Find the angle .
-
22M.2.AHL.TZ1.2a.ii:
Find the area of the shaded segment.
SL 3.5—Intersection of lines, equations of perpendicular bisectors
-
SPM.1.SL.TZ0.7a:
Calculate the gradient of the line segment AE.
-
SPM.1.SL.TZ0.7b:
Find the equation of the line which would complete the Voronoi cell containing site E.
Give your answer in the form where , , .
-
SPM.1.SL.TZ0.7c:
In the context of the question, explain the significance of the Voronoi cell containing site E.
-
21M.1.SL.TZ2.6a:
Find the equation of the perpendicular bisector of . Give your equation in the form .
-
21N.1.SL.TZ0.7a:
Show that the new station should be built at .
-
21N.1.SL.TZ0.7b.i:
Write down the equation of the perpendicular bisector of .
-
21N.1.SL.TZ0.7b.ii:
Hence draw the missing boundaries of the region around on the following diagram.
-
22M.3.AHL.TZ1.2a:
The model assumes that each town is positioned at a single point. Describe possible circumstances in which this modelling assumption is reasonable.
-
22M.3.AHL.TZ1.2b:
Sketch a Voronoi diagram showing the regions within the metropolitan area that are closest to each town.
-
22M.3.AHL.TZ1.2c.i:
Find the equation of the perpendicular bisector of .
-
22M.3.AHL.TZ1.2c.ii:
Given that the coordinates of one vertex of the new Voronoi diagram are , find the coordinates of the other two vertices within the metropolitan area.
-
22M.3.AHL.TZ1.2c.iii:
Sketch this new Voronoi diagram showing the regions within the metropolitan area which are closest to each town.
-
22M.1.SL.TZ1.4a:
Find the equation of the line that the road follows.
-
22M.1.SL.TZ1.4b:
Town is due north of town and the road passes through town .
Find the -coordinate of town .
-
22M.2.SL.TZ2.3a:
Find the midpoint of .
SL 3.6—Voronoi diagrams
-
SPM.1.SL.TZ0.7a:
Calculate the gradient of the line segment AE.
-
SPM.1.SL.TZ0.7b:
Find the equation of the line which would complete the Voronoi cell containing site E.
Give your answer in the form where , , .
-
SPM.1.SL.TZ0.7c:
In the context of the question, explain the significance of the Voronoi cell containing site E.
-
EXM.1.SL.TZ0.4:
The diagram below is part of a Voronoi diagram.
Diagram not to scale
A and B are sites with B having the co-ordinates of (4, 6). L is an edge; the equation of this perpendicular bisector of the line segment from A to B is
Find the co-ordinates of the point A.
-
EXM.2.SL.TZ0.4a:
Sketch a Voronoi diagram to represent this information.
-
EXM.2.SL.TZ0.4b:
Sketch a new Voronoi diagram to represent this new situation.
-
EXM.2.SL.TZ0.4c:
State what the shape of the land, owned by the youngest child, is.
-
EXM.2.SL.TZ0.4d:
Find the area of the youngest child’s land.
-
EXM.2.SL.TZ0.4e:
Find how much land an older child has lost.
-
EXM.2.SL.TZ0.4f:
State, with a reason, if all five children now own an equal amount of land.
-
EXN.2.SL.TZ0.5b:
Find the area of campus managed by office .
-
EXN.2.SL.TZ0.5c:
Hence or otherwise find the areas managed by offices and .
-
EXN.2.SL.TZ0.5d:
State a further assumption that must be made in order to use area covered as a measure of whether or not the manager of office is responsible for more students than the managers of offices and .
-
EXN.2.SL.TZ0.5e:
A new office is to be built within the triangle formed by , and , at a point as far as possible from the other three offices.
Find the distance of this office from each of the other offices.
-
21M.1.SL.TZ1.5a:
Explain why Tim will receive the strongest signal from tower .
-
21M.1.SL.TZ1.5b:
Write down the coordinates of tower .
-
21M.1.SL.TZ1.5c:
Tower has coordinates .
Find the gradient of the edge of the Voronoi diagram between towers and .
-
21N.1.SL.TZ0.7a:
Show that the new station should be built at .
-
21N.1.SL.TZ0.7b.i:
Write down the equation of the perpendicular bisector of .
-
21N.1.SL.TZ0.7b.ii:
Hence draw the missing boundaries of the region around on the following diagram.
-
22M.3.AHL.TZ1.2a:
The model assumes that each town is positioned at a single point. Describe possible circumstances in which this modelling assumption is reasonable.
-
22M.3.AHL.TZ1.2b:
Sketch a Voronoi diagram showing the regions within the metropolitan area that are closest to each town.
-
22M.3.AHL.TZ1.2c.i:
Find the equation of the perpendicular bisector of .
-
22M.3.AHL.TZ1.2c.ii:
Given that the coordinates of one vertex of the new Voronoi diagram are , find the coordinates of the other two vertices within the metropolitan area.
-
22M.3.AHL.TZ1.2c.iii:
Sketch this new Voronoi diagram showing the regions within the metropolitan area which are closest to each town.
-
22M.3.AHL.TZ1.2e.i:
Find the location of the toxic waste dump, given that this location is not on the edge of the metropolitan area.
-
22M.3.AHL.TZ1.2e.ii:
Make one possible criticism of the council’s choice of location.
-
22M.2.SL.TZ2.3a:
Find the midpoint of .
AHL 3.7—Radians
-
SPM.1.AHL.TZ0.5b:
Find the volume of this log.
-
SPM.1.AHL.TZ0.5a:
Find 50° in radians.
-
18M.2.AHL.TZ2.H_4a.i:
Find AM.
-
18M.2.AHL.TZ2.H_4b:
Find the area of the shaded region.
-
16N.2.AHL.TZ0.H_9a:
Find an expression for the shaded area in terms of , and .
-
16N.2.AHL.TZ0.H_9b:
Show that .
-
16N.2.AHL.TZ0.H_9c:
Hence find the value of given that the shaded area is equal to 4.
-
19M.1.AHL.TZ1.H_3:
A sector of a circle with radius cm , where > 0, is shown on the following diagram.
The sector has an angle of 1 radian at the centre.Let the area of the sector be cm2 and the perimeter be cm. Given that , find the value of .
-
17M.2.AHL.TZ1.H_8a:
Find an expression for the volume of water in the trough in terms of .
-
17M.2.AHL.TZ1.H_8b:
Calculate when .
-
18N.2.AHL.TZ0.H_7:
Boat A is situated 10km away from boat B, and each boat has a marine radio transmitter on board. The range of the transmitter on boat A is 7km, and the range of the transmitter on boat B is 5km. The region in which both transmitters can be detected is represented by the shaded region in the following diagram. Find the area of this region.
-
16N.2.AHL.TZ0.H_7a:
Use the cosine rule to find the two possible values for AC.
-
16N.2.AHL.TZ0.H_7b:
Find the difference between the areas of the two possible triangles ABC.
-
17N.1.SL.TZ0.S_4a:
Show that .
-
17N.1.SL.TZ0.S_4b:
The shape in the following diagram is formed by adding a semicircle with diameter [AC] to the triangle.
Find the exact perimeter of this shape.
-
17M.2.SL.TZ1.S_5:
The following diagram shows the chord [AB] in a circle of radius 8 cm, where .
Find the area of the shaded segment.
-
17M.2.SL.TZ2.S_1a:
Find the length of arc ABC.
-
17M.2.SL.TZ2.S_1b:
Find the perimeter of sector OABC.
-
17M.2.SL.TZ2.S_1c:
Find the area of sector OABC.
-
16N.2.SL.TZ0.S_3a:
Write down the exact value of in radians.
-
16N.2.SL.TZ0.S_3b:
Find the value of .
-
16N.2.SL.TZ0.S_3c:
Find AB.
-
19M.2.SL.TZ2.S_4b:
Find the area of triangle OBC in terms of and θ.
-
20N.2.SL.TZ0.S_7a:
Show that .
-
20N.2.SL.TZ0.S_7b:
Find the value of when the area of the shaded region is equal to the area of sector .
-
21N.1.AHL.TZ0.15a:
Show that .
-
21N.1.AHL.TZ0.15b.i:
Find an expression for in terms of .
-
21N.1.AHL.TZ0.15b.ii:
Find the expression .
-
21N.1.AHL.TZ0.15b.iii:
Solve algebraically to find the value of that will maximize the volume, .
AHL 3.8—Unit circle, Pythag identity, solving trig equations graphically
-
17M.1.AHL.TZ1.H_3:
Solve the equation .
-
16N.1.AHL.TZ0.H_13a:
Find the value of .
-
16N.1.AHL.TZ0.H_13b:
Show that where .
-
16N.1.AHL.TZ0.H_13c:
Use the principle of mathematical induction to prove that
where .
-
16N.1.AHL.TZ0.H_13d:
Hence or otherwise solve the equation in the interval .
-
17M.2.AHL.TZ1.H_10a:
Use the cosine rule to show that .
-
17M.2.AHL.TZ1.H_10b:
Calculate the two corresponding values of PQ.
-
17M.2.AHL.TZ1.H_10c:
Hence, find the area of the smaller triangle.
-
17M.2.AHL.TZ1.H_10d:
Determine the range of values of for which it is possible to form two triangles.
-
16N.2.AHL.TZ0.H_7a:
Use the cosine rule to find the two possible values for AC.
-
16N.2.AHL.TZ0.H_7b:
Find the difference between the areas of the two possible triangles ABC.
-
19M.1.AHL.TZ1.H_4a:
Show that .
-
19M.1.AHL.TZ1.H_4b:
Find the two possible values for the length of the third side.
-
17M.2.AHL.TZ2.H_4a:
Find the set of values of that satisfy the inequality .
-
17M.2.AHL.TZ2.H_4b:
The triangle ABC is shown in the following diagram. Given that , find the range of possible values for AB.
-
19M.1.SL.TZ2.S_9a:
Find the value of .
-
19M.1.SL.TZ2.S_9b:
Line passes through the origin and has a gradient of . Find the equation of .
-
19M.1.SL.TZ2.S_9c:
Find the derivative of .
-
19M.1.SL.TZ2.S_9d:
The following diagram shows the graph of for 0 ≤ ≤ 3. Line is a tangent to the graph of at point P.
Given that is parallel to , find the -coordinate of P.
-
21N.1.AHL.TZ0.11:
The following diagram shows a corner of a field bounded by two walls defined by lines and . The walls meet at a point , making an angle of .
Farmer Nate has of fencing to make a triangular enclosure for his sheep. One end of the fence is positioned at a point on , from . The other end of the fence will be positioned at some point on , as shown on the diagram.
He wants the enclosure to take up as little of the current field as possible.
Find the minimum possible area of the triangular enclosure .
AHL 3.9—Matrix transformations
-
EXM.2.AHL.TZ0.15a:
Describe fully the geometrical transformation represented by A.
-
EXM.2.AHL.TZ0.15b:
Find the area of the image of P.
-
EXM.2.AHL.TZ0.15c:
Find the matrix X.
-
EXM.2.AHL.TZ0.15d:
Describe fully the geometrical transformation represented by X.
-
EXM.2.AHL.TZ0.16a:
Describe fully the geometrical transformation represented by B.
-
EXM.2.AHL.TZ0.16b:
Find the coordinates of triangle X.
-
EXM.2.AHL.TZ0.16c.i:
Find the area of triangle X.
-
EXM.2.AHL.TZ0.16c.ii:
Hence find the area of triangle Y.
-
EXM.2.AHL.TZ0.16d:
Matrix A represents a combination of transformations:
A stretch, with scale factor 3 and y-axis invariant;
Followed by a stretch, with scale factor 4 and x-axis invariant;
Followed by a transformation represented by matrix C.Find matrix C.
-
20N.1.AHL.TZ0.F_7a:
Describe, in words, the effect of the transformation .
-
20N.1.AHL.TZ0.F_7b.i:
Show that the points form a square.
-
20N.1.AHL.TZ0.F_7b.ii:
Determine the area of this square.
-
20N.1.AHL.TZ0.F_7b.iii:
Find the coordinates of , the points to which are transformed under .
-
20N.1.AHL.TZ0.F_7b.iv:
Show that is a parallelogram.
-
20N.1.AHL.TZ0.F_7b.v:
Determine the area of this parallelogram.
-
EXN.3.AHL.TZ0.2c.i:
Write down .
-
EXN.3.AHL.TZ0.2c.ii:
Write down , in terms of .
-
21M.1.AHL.TZ2.14a:
Find the coordinates of the image of the point .
-
21M.1.AHL.TZ2.14b:
Given that , find the value of and the value of .
-
21M.1.AHL.TZ2.14c:
A triangle with vertices lying on the plane is transformed by .
Explain why both and its image will have exactly the same area.
-
21N.2.AHL.TZ0.4a.i:
Write down each of the transformations in matrix form, clearly stating which matrix represents each transformation.
-
21N.2.AHL.TZ0.4a.ii:
Find a single matrix that defines a transformation that represents the overall change in position.
-
21N.2.AHL.TZ0.4a.iii:
Find .
-
21N.2.AHL.TZ0.4a.iv:
Hence state what the value of indicates for the possible movement of the drone.
-
21N.2.AHL.TZ0.4b:
Three drones are initially positioned at the points , and . After performing the movements listed above, the drones are positioned at points , and respectively.
Show that the area of triangle is equal to the area of triangle .
-
21N.2.AHL.TZ0.4c:
Find a single transformation that is equivalent to the three transformations represented by matrix .
-
22M.1.AHL.TZ2.15c:
Show that the equation of the resulting line does not depend on or .
-
22M.2.AHL.TZ1.6c.i:
Find an expression for.
-
22M.2.AHL.TZ1.6c.ii:
Find the value of .
-
22M.2.AHL.TZ1.6c.iii:
Find the value of .
-
22M.2.AHL.TZ1.7a.i:
By considering the image of , find .
-
22M.2.AHL.TZ1.7a.ii:
By considering the image of and , show that
.
-
22M.2.AHL.TZ1.7b:
Write down the matrix .
-
22M.2.AHL.TZ1.7c.i:
Use to find the matrix .
-
22M.2.AHL.TZ1.7c.ii:
Hence find the angle and direction of the rotation represented by .
-
22M.2.AHL.TZ1.7d.i:
Write down an equation satisfied by .
-
22M.2.AHL.TZ1.7d.ii:
Find the value of and the value of .
AHL 3.10—Vector definitions
-
17N.1.AHL.TZ0.H_9a.i:
Find, in terms of a and b .
-
17N.1.AHL.TZ0.H_9a.ii:
Find, in terms of a and b .
-
17N.1.AHL.TZ0.H_9b.i:
Find an expression for in terms of a, b and ;
-
17N.1.AHL.TZ0.H_9b.ii:
Find an expression for in terms of a, b and .
-
17N.1.AHL.TZ0.H_9c:
Show that , and find the value of .
-
17N.1.AHL.TZ0.H_9d:
Deduce an expression for in terms of a and b only.
-
17N.1.AHL.TZ0.H_9e:
Given that area , find the value of .
-
20N.1.SL.TZ0.S_9a:
Express in terms of .
-
20N.1.SL.TZ0.S_9b:
Find the value of .
-
20N.1.SL.TZ0.S_9c:
Consider a unit vector , such that , where .
Point is such that .
Find the coordinates of .
-
21M.1.AHL.TZ1.5a.i:
Find .
-
21M.1.AHL.TZ1.5a.ii:
Find .
-
21M.1.AHL.TZ1.5b:
Find .
-
21M.1.AHL.TZ1.5c:
Hence find the area of the triangle .
-
21N.1.AHL.TZ0.16a:
Find the position vector of the ship at time hours.
-
21N.1.AHL.TZ0.16b:
Find the value of when the ship will be closest to the lighthouse.
-
21N.1.AHL.TZ0.16c:
An alarm will sound if the ship travels within kilometres of the lighthouse.
State whether the alarm will sound. Give a reason for your answer.
-
22M.1.AHL.TZ1.6a:
Find .
-
22M.1.AHL.TZ1.6b:
Find the length of the rope.
-
22M.1.AHL.TZ1.6c:
Find , the angle the rope makes with the platform.
AHL 3.11—Vector equation of a line in 2d and 3d
-
SPM.2.AHL.TZ0.4a:
Write down a vector equation for the displacement, r of the aircraft in terms of .
-
SPM.2.AHL.TZ0.4b.i:
verify that it would pass directly over the airport.
-
SPM.2.AHL.TZ0.4b.ii:
state the height of the aircraft at this point.
-
SPM.2.AHL.TZ0.4b.iii:
find the time at which it would fly directly over the airport.
-
SPM.2.AHL.TZ0.4c.i:
Find the time at which the aircraft is 4 km above the ground.
-
SPM.2.AHL.TZ0.4c.ii:
Find the direct distance of the aircraft from the airport at this point.
-
SPM.2.AHL.TZ0.4d:
Given that the velocity of the aircraft, after the adjustment of the angle of descent, is , find the value of .
-
18M.2.AHL.TZ1.H_11a:
Show that the two submarines would collide at a point P and write down the coordinates of P.
-
18M.2.AHL.TZ1.H_11b.ii:
Find the value of t when submarine B passes through P.
-
18M.2.AHL.TZ1.H_11c.ii:
Find the value of t when the two submarines are closest together.
-
18M.2.AHL.TZ1.H_11c.iii:
Find the distance between the two submarines at this time.
-
16N.1.AHL.TZ0.H_8a:
find the value of ;
-
16N.1.AHL.TZ0.H_8b:
determine the coordinates of the point of intersection P.
-
19M.2.SL.TZ1.S_9a:
Find the gradient of .
-
19M.2.SL.TZ1.S_9b:
Find u.
-
19M.2.SL.TZ1.S_9c:
Find the acute angle between and .
-
19M.2.SL.TZ1.S_9d.i:
Find .
-
19M.2.SL.TZ1.S_9d.ii:
Hence, write down .
-
19M.2.SL.TZ1.S_9d.iii:
Hence or otherwise, find the obtuse angle formed by the tangent line to at and the tangent line to at .
-
18N.2.SL.TZ0.S_8a.ii:
Find .
-
18N.2.SL.TZ0.S_8b.i:
Find the value of .
-
18N.2.SL.TZ0.S_8b.ii:
Show that .
-
18N.2.SL.TZ0.S_8c:
Find the angle between and .
-
18N.2.SL.TZ0.S_8d:
Find the area of triangle ABC.
-
17N.1.SL.TZ0.S_9a.i:
Show that .
-
17N.1.SL.TZ0.S_9a.ii:
Find a vector equation for .
-
17N.1.SL.TZ0.S_9b:
Find the value of .
-
17N.1.SL.TZ0.S_9c:
The point D has coordinates . Given that is perpendicular to , find the possible values of .
-
18M.1.SL.TZ1.S_9a:
Show that
-
18M.1.SL.TZ1.S_9b.i:
Find a vector equation for L.
-
18M.1.SL.TZ1.S_9b.ii:
Point C (k , 12 , −k) is on L. Show that k = 14.
-
18M.1.SL.TZ1.S_9c.i:
Find .
-
18M.1.SL.TZ1.S_9c.ii:
Write down the value of angle OBA.
-
18M.1.SL.TZ1.S_9d:
Point D is also on L and has coordinates (8, 4, −9).
Find the area of triangle OCD.
-
19M.1.SL.TZ1.S_2a:
Find .
-
19M.1.SL.TZ1.S_2b:
A second line, , is parallel to and passes through (1, 2, 3).
Write down a vector equation for .
-
19M.2.SL.TZ2.S_7:
The vector equation of line is given by r .
Point P is the point on that is closest to the origin. Find the coordinates of P.
-
18M.1.SL.TZ2.S_1a:
Find a vector equation for L1.
-
18M.1.SL.TZ2.S_1b:
The vector is perpendicular to . Find the value of p.
-
16N.1.SL.TZ0.S_4a:
Find a vector equation of the line that passes through P and Q.
-
16N.1.SL.TZ0.S_4b:
The line through P and Q is perpendicular to the vector 2i nk. Find the value of .
-
20N.1.SL.TZ0.S_9a:
Express in terms of .
-
20N.1.SL.TZ0.S_9b:
Find the value of .
-
20N.1.SL.TZ0.S_9c:
Consider a unit vector , such that , where .
Point is such that .
Find the coordinates of .
-
21M.1.AHL.TZ2.8a:
Find the possible value(s) for .
-
21M.1.AHL.TZ2.8b:
In the case that , determine whether the lines intersect.
-
21N.1.AHL.TZ0.16a:
Find the position vector of the ship at time hours.
-
21N.1.AHL.TZ0.16b:
Find the value of when the ship will be closest to the lighthouse.
-
21N.1.AHL.TZ0.16c:
An alarm will sound if the ship travels within kilometres of the lighthouse.
State whether the alarm will sound. Give a reason for your answer.
-
22M.1.AHL.TZ1.13a:
Write down an expression for the position vector of the ship, hours after .
-
22M.1.AHL.TZ1.13b:
Find the time at which the bearing of the ship from the harbour is .
-
22M.1.AHL.TZ2.15a:
Find the vectors and in terms of and/or .
AHL 3.12—Vector applications to kinematics
-
16N.1.AHL.TZ0.H_8a:
find the value of ;
-
16N.1.AHL.TZ0.H_8b:
determine the coordinates of the point of intersection P.
-
20N.1.SL.TZ0.S_7a:
Find an expression for the velocity of at time .
-
20N.1.SL.TZ0.S_7b:
Particle also moves in a straight line. The position of is given by .
The speed of is greater than the speed of when .
Find the value of .
-
EXN.1.AHL.TZ0.7a:
Find the speed of the helicopter.
-
EXN.1.AHL.TZ0.7b:
Find the distance of the helicopter from the communications tower at .
-
EXN.1.AHL.TZ0.7c:
Find the bearing on which the helicopter is travelling.
-
EXN.2.AHL.TZ0.7a:
Show that the ball is moving in a circle with its centre at and state the radius of the circle.
-
EXN.2.AHL.TZ0.7b.i:
Find an expression for the velocity of the ball at time .
-
EXN.2.AHL.TZ0.7b.ii:
Hence show that the velocity of the ball is always perpendicular to the position vector of the ball.
-
EXN.2.AHL.TZ0.7c.i:
Find an expression for the acceleration of the ball at time .
-
EXN.2.AHL.TZ0.7c.ii:
Find the value of at the instant the string breaks.
-
EXN.2.AHL.TZ0.7c.iii:
How many complete revolutions has the ball completed from to the instant at which the string breaks?
-
21M.1.AHL.TZ1.13a:
Assuming the submarine travels in a straight line, write down an equation for the line along which it travels.
-
21M.1.AHL.TZ1.13b.i:
Find the coordinates of .
-
21M.1.AHL.TZ1.13b.ii:
Find .
-
21M.2.AHL.TZ1.6a:
Find the velocity vector at time .
-
21M.2.AHL.TZ1.6b:
Show that the magnitude of the velocity of the ice-skater at time is given by
.
-
21M.2.AHL.TZ1.6c:
Find the value of and the value of .
-
21M.2.AHL.TZ1.6d:
Find the magnitude of the velocity of the ice-skater when .
-
21M.2.AHL.TZ1.6e:
At a point , the ice-skater is skating parallel to the -axis for the first time.
Find .
-
21N.1.AHL.TZ0.16a:
Find the position vector of the ship at time hours.
-
21N.1.AHL.TZ0.16b:
Find the value of when the ship will be closest to the lighthouse.
-
21N.1.AHL.TZ0.16c:
An alarm will sound if the ship travels within kilometres of the lighthouse.
State whether the alarm will sound. Give a reason for your answer.
-
22M.1.AHL.TZ2.16a:
Find the velocity vector of .
-
22M.1.AHL.TZ2.16b:
Show that the acceleration vector of is never parallel to the position vector of .
-
22M.2.AHL.TZ2.6a.i:
Find the initial speed of the ball.
-
22M.2.AHL.TZ2.6a.ii:
Find the angle of elevation of the ball as it is launched.
-
22M.2.AHL.TZ2.6d:
For the path of the ball, find an expression for in terms of .
AHL 3.13—Scalar and vector products
-
SPM.1.AHL.TZ0.11a:
Given that v is perpendicular to B, find the value of .
-
SPM.1.AHL.TZ0.11b:
The force, F, produced by P moving in the magnetic field is given by the vector equation F = v × B, .
Given that | F | = 14, find the value of .
-
19M.1.AHL.TZ2.H_2a.i:
Find the vector .
-
19M.1.AHL.TZ2.H_2a.ii:
Find the vector .
-
19M.1.AHL.TZ2.H_2b:
Hence or otherwise, find the area of the triangle ABC.
-
18N.1.AHL.TZ0.H_5a:
Find and simplify an expression for a • b in terms of .
-
18N.1.AHL.TZ0.H_5b:
Hence or otherwise, find the values of for which the angle between a and b is obtuse .
-
19M.1.AHL.TZ1.H_1:
Let a = and b = , .
Given that a and b are perpendicular, find the possible values of .
-
18M.1.SL.TZ1.S_6:
Six equilateral triangles, each with side length 3 cm, are arranged to form a hexagon.
This is shown in the following diagram.The vectors p , q and r are shown on the diagram.
Find p•(p + q + r).
-
19M.1.SL.TZ1.S_6:
The magnitudes of two vectors, u and v, are 4 and respectively. The angle between u and v is .
Let w = u − v. Find the magnitude of w.
-
18M.2.SL.TZ2.S_8a.i:
Find .
-
18M.2.SL.TZ2.S_8a.ii:
Find .
-
18M.2.SL.TZ2.S_8b:
Find the angle between PQ and PR.
-
18M.2.SL.TZ2.S_8c:
Find the area of triangle PQR.
-
18M.2.SL.TZ2.S_8d:
Hence or otherwise find the shortest distance from R to the line through P and Q.
-
17N.2.SL.TZ0.S_3a:
Find .
-
17N.2.SL.TZ0.S_3b:
Let . Find .
-
19M.1.SL.TZ2.S_2a:
parallel.
-
19M.1.SL.TZ2.S_2b:
perpendicular.
-
19M.2.SL.TZ2.S_7:
The vector equation of line is given by r .
Point P is the point on that is closest to the origin. Find the coordinates of P.
-
18M.1.SL.TZ2.S_1a:
Find a vector equation for L1.
-
18M.1.SL.TZ2.S_1b:
The vector is perpendicular to . Find the value of p.
-
16N.1.SL.TZ0.S_4a:
Find a vector equation of the line that passes through P and Q.
-
16N.1.SL.TZ0.S_4b:
The line through P and Q is perpendicular to the vector 2i nk. Find the value of .
-
EXN.2.AHL.TZ0.7a:
Show that the ball is moving in a circle with its centre at and state the radius of the circle.
-
EXN.2.AHL.TZ0.7b.i:
Find an expression for the velocity of the ball at time .
-
EXN.2.AHL.TZ0.7b.ii:
Hence show that the velocity of the ball is always perpendicular to the position vector of the ball.
-
EXN.2.AHL.TZ0.7c.i:
Find an expression for the acceleration of the ball at time .
-
EXN.2.AHL.TZ0.7c.ii:
Find the value of at the instant the string breaks.
-
EXN.2.AHL.TZ0.7c.iii:
How many complete revolutions has the ball completed from to the instant at which the string breaks?
-
21M.1.AHL.TZ2.8a:
Find the possible value(s) for .
-
21M.1.AHL.TZ2.8b:
In the case that , determine whether the lines intersect.
-
21N.1.AHL.TZ0.16a:
Find the position vector of the ship at time hours.
-
21N.1.AHL.TZ0.16b:
Find the value of when the ship will be closest to the lighthouse.
-
21N.1.AHL.TZ0.16c:
An alarm will sound if the ship travels within kilometres of the lighthouse.
State whether the alarm will sound. Give a reason for your answer.
-
22M.1.AHL.TZ1.6c:
Find , the angle the rope makes with the platform.
-
22M.1.AHL.TZ2.16a:
Find the velocity vector of .
-
22M.1.AHL.TZ2.16b:
Show that the acceleration vector of is never parallel to the position vector of .
AHL 3.14—Graph theory
-
19N.3.AHL.TZ0.Hdm_4a.i:
Write down the minimum number of edges in .
-
19N.3.AHL.TZ0.Hdm_4a.ii:
Find the maximum number of edges in .
-
19N.3.AHL.TZ0.Hdm_4a.iii:
Find the maximum number of edges in , given that contains an Eulerian circuit.
-
19N.3.AHL.TZ0.Hdm_4b.i:
Explain why .
-
19N.3.AHL.TZ0.Hdm_4b.ii:
Find the value of when and .
-
19N.3.AHL.TZ0.Hdm_4b.iii:
Find the possible values of when .
-
20N.3.AHL.TZ0.Hdm_5a:
Find the maximum possible value of .
-
20N.3.AHL.TZ0.Hdm_5b:
Find an expression for in terms of .
-
20N.3.AHL.TZ0.Hdm_5c:
Given that the complement of is also planar and connected, find the possible values of .
-
20N.3.AHL.TZ0.Hdm_5d:
is a simple graph with vertices and edges.
Given that both and its complement are planar and connected, find the maximum possible value of .
-
21N.3.AHL.TZ0.1a:
Write down a Hamiltonian cycle in .
-
21N.3.AHL.TZ0.1b.i:
Use Prim’s algorithm, starting at vertex , to find the weight of the minimum spanning tree of the remaining graph. You should indicate clearly the order in which the algorithm selects each edge.
-
21N.3.AHL.TZ0.1b.ii:
Hence, for the case where , find a lower bound for Daniel’s travel time, in terms of .
-
21N.3.AHL.TZ0.1c.i:
.
-
21N.3.AHL.TZ0.1c.ii:
.
-
21N.3.AHL.TZ0.1c.iii:
.
-
21N.3.AHL.TZ0.1d.i:
Use the nearest neighbour algorithm to find two possible cycles.
-
21N.3.AHL.TZ0.1d.ii:
Find the best upper bound for Daniel’s travel time.
-
21N.3.AHL.TZ0.1e.i:
Find the least value of for which the edge will definitely not be used by Daniel.
-
21N.3.AHL.TZ0.1e.ii:
Hence state the value of the upper bound for Daniel’s travel time for the value of found in part (e)(i).
-
21N.3.AHL.TZ0.1f:
The tourist office in the city has received complaints about the lack of cleanliness of some routes between the attractions. Corinne, the office manager, decides to inspect all the routes between all the attractions, starting and finishing at . The sum of the weights of all the edges in graph is .
Corinne inspects all the routes as quickly as possible and takes hours.
Find the value of during Corinne’s inspection.
-
22M.3.AHL.TZ1.2f.i:
Find which town is last to be polluted. Justify your answer.
-
22M.3.AHL.TZ1.2f.ii:
Write down the number of days it takes for the pollution to reach the last town.
-
22M.3.AHL.TZ2.2d.i:
By using Kruskal’s algorithm, find the minimum spanning tree for , showing clearly the order in which edges are added.
-
22M.3.AHL.TZ2.2d.ii:
Hence find the minimum installation cost for the cables that would allow all the buildings to be part of the computer network.
-
22M.3.AHL.TZ2.2e:
State why a path that forms a Hamiltonian cycle does not always form an Eulerian circuit.
-
22M.1.AHL.TZ1.13a:
Write down an expression for the position vector of the ship, hours after .
-
22M.1.AHL.TZ1.13b:
Find the time at which the bearing of the ship from the harbour is .
AHL 3.15—Adjacency matrices and tables
-
EXM.1.AHL.TZ0.24a.i:
Write down the adjacency matrix for G.
-
EXM.1.AHL.TZ0.24a.ii:
Find the number of distinct walks of length 4 beginning and ending at A.
-
21M.1.AHL.TZ1.16a:
Write down the adjacency matrix, , for this graph.
-
21M.1.AHL.TZ1.16b:
Find the number of ways that the ant can start at the vertex , and walk along exactly edges to return to .
-
21N.3.AHL.TZ0.1a:
Write down a Hamiltonian cycle in .
-
21N.3.AHL.TZ0.1b.i:
Use Prim’s algorithm, starting at vertex , to find the weight of the minimum spanning tree of the remaining graph. You should indicate clearly the order in which the algorithm selects each edge.
-
21N.3.AHL.TZ0.1b.ii:
Hence, for the case where , find a lower bound for Daniel’s travel time, in terms of .
-
21N.3.AHL.TZ0.1c.i:
.
-
21N.3.AHL.TZ0.1c.ii:
.
-
21N.3.AHL.TZ0.1c.iii:
.
-
21N.3.AHL.TZ0.1d.i:
Use the nearest neighbour algorithm to find two possible cycles.
-
21N.3.AHL.TZ0.1d.ii:
Find the best upper bound for Daniel’s travel time.
-
21N.3.AHL.TZ0.1e.i:
Find the least value of for which the edge will definitely not be used by Daniel.
-
21N.3.AHL.TZ0.1e.ii:
Hence state the value of the upper bound for Daniel’s travel time for the value of found in part (e)(i).
-
21N.3.AHL.TZ0.1f:
The tourist office in the city has received complaints about the lack of cleanliness of some routes between the attractions. Corinne, the office manager, decides to inspect all the routes between all the attractions, starting and finishing at . The sum of the weights of all the edges in graph is .
Corinne inspects all the routes as quickly as possible and takes hours.
Find the value of during Corinne’s inspection.
-
22M.3.AHL.TZ1.2f.i:
Find which town is last to be polluted. Justify your answer.
-
22M.3.AHL.TZ1.2f.ii:
Write down the number of days it takes for the pollution to reach the last town.
-
22M.1.AHL.TZ2.6a:
Write down the adjacency matrix for this network.
-
22M.1.AHL.TZ2.6b:
Determine the number of different walks of length that start and end at the same vertex.
AHL 3.16—Tree and cycle algorithms, Chinese postman, travelling salesman
-
EXM.2.AHL.TZ0.2a:
Briefly explain the two differences in the application of Prim’s and Kruskal’s algorithms for finding a minimum spanning tree in a weighted connected graph.
-
EXM.2.AHL.TZ0.2b.i:
Using Kruskal’s algorithm.
-
EXM.2.AHL.TZ0.2b.ii:
Using Prim’s algorithm starting at vertex A.
-
EXM.2.AHL.TZ0.2b.iii:
Using Prim’s algorithm starting at vertex F.
-
EXM.2.AHL.TZ0.2c.i:
State the total minimum length of the tracks that have to be tarmacked.
-
EXM.2.AHL.TZ0.2c.ii:
Sketch the tracks that are to be tarmacked.
-
EXM.1.AHL.TZ0.1a:
Find with a reason, the value of .
-
EXM.1.AHL.TZ0.1b:
If the total length of the minimal spanning tree is 14, find the value of .
-
EXM.1.AHL.TZ0.1c:
Hence, state, with a reason, what can be deduced about the values of , , .
-
SPM.2.AHL.TZ0.5a:
Show the direct flights between the cities as a graph.
-
SPM.2.AHL.TZ0.5b:
Write down the adjacency matrix for this graph.
-
SPM.2.AHL.TZ0.5c:
Using your answer to part (b), find the number of different ways to travel from and return to city A in exactly 6 flights.
-
SPM.2.AHL.TZ0.5d:
State whether or not it is possible to travel from and return to city A in exactly 6 flights, having visited each of the other 5 cities exactly once. Justify your answer.
-
SPM.2.AHL.TZ0.5e:
Find the values of and .
-
SPM.2.AHL.TZ0.5f:
Use the nearest neighbour algorithm to find an upper bound for the cost of the trip.
-
SPM.2.AHL.TZ0.5g:
By deleting vertex A, use the deleted vertex algorithm to find a lower bound for the cost of the trip.
-
EXM.2.AHL.TZ0.17a:
Draw a graph to represent this map.
-
EXM.2.AHL.TZ0.17b:
Write down the adjacency matrix of the graph.
-
EXM.2.AHL.TZ0.17c:
List the degrees of each of the vertices.
-
EXM.2.AHL.TZ0.17d.i:
an Eulerian circuit.
-
EXM.2.AHL.TZ0.17d.ii:
an Eulerian trail.
-
EXM.2.AHL.TZ0.17e:
Find the number of walks of length 4 from E to F.
-
EXM.2.AHL.TZ0.18a:
Draw the graph of G.
-
EXM.2.AHL.TZ0.18b.i:
Define an Eulerian circuit.
-
EXM.2.AHL.TZ0.18b.ii:
Write down an Eulerian circuit in G starting at P.
-
EXM.2.AHL.TZ0.18c.i:
Define a Hamiltonian cycle.
-
EXM.2.AHL.TZ0.18c.ii:
Explain why it is not possible to have a Hamiltonian cycle in G.
-
EXM.2.AHL.TZ0.18d.i:
Find the number of walks of length 5 from P to Q.
-
EXM.2.AHL.TZ0.18d.ii:
Which pairs of distinct vertices have more than 15 walks of length 3 between them?
-
EXM.2.AHL.TZ0.19a:
Find the total number of Hamiltonian cycles in G, starting at vertex A. Explain your answer.
-
EXM.2.AHL.TZ0.19b.i:
Find a minimum spanning tree for the subgraph obtained by deleting A from G.
-
EXM.2.AHL.TZ0.19b.ii:
Hence, find a lower bound for the travelling salesman problem for G.
-
EXM.2.AHL.TZ0.19c:
Give an upper bound for the travelling salesman problem for the graph above.
-
EXM.2.AHL.TZ0.19d:
Show that the lower bound you have obtained is not the best possible for the solution to the travelling salesman problem for G.
-
EXM.1.AHL.TZ0.23a:
Name an algorithm that will allow Sameer to find the lowest cost road system.
-
EXM.1.AHL.TZ0.23b:
Find the lowest cost road system and state the cost of building it. Show clearly the steps of the algorithm.
-
EXM.1.AHL.TZ0.24a.i:
Write down the adjacency matrix for G.
-
EXM.1.AHL.TZ0.24a.ii:
Find the number of distinct walks of length 4 beginning and ending at A.
-
EXM.1.AHL.TZ0.24b:
Starting at A, use Prim’s algorithm to find and draw the minimum spanning tree for G.
Your solution should indicate clearly the way in which the tree is constructed.
-
EXM.1.AHL.TZ0.36:
Apply Prim’s algorithm to the weighted graph given below to obtain the minimal spanning tree starting with the vertex A.
Find the weight of the minimal spanning tree.
-
EXM.1.AHL.TZ0.37:
In this part, marks will only be awarded if you show the correct application of the required algorithms, and show all your working.
In an offshore drilling site for a large oil company, the distances between the planned wells are given below in metres.
It is intended to construct a network of paths to connect the different wells in a way that minimises the sum of the distances between them.
Use Prim’s algorithm, starting at vertex 3, to find a network of paths of minimum total length that can span the whole site.
-
EXM.1.AHL.TZ0.38:
The diagram below shows a weighted graph.
Use Prim’s algorithms to find a minimal spanning tree, starting at J. Draw the tree, and find its total weight.
-
EXM.1.AHL.TZ0.39a:
Use Prim’s algorithm to draw a minimum spanning tree starting at M.
-
EXM.1.AHL.TZ0.39b:
What is the total weight of the tree?
-
EXM.1.AHL.TZ0.40:
The weights of the edges of a complete graph G are shown in the following table.
Starting at B, use Prim’s algorithm to find and draw a minimum spanning tree for G. Your solution should indicate the order in which the vertices are added. State the total weight of your tree.
-
EXM.1.AHL.TZ0.41:
The weights of the edges in a simple graph G are given in the following table.
Use Prim’s Algorithm, starting with vertex F, to find and draw the minimum spanning tree for G. Your solution should indicate the order in which the edges are introduced.
-
18M.3.AHL.TZ0.Hdm_1a.i:
State what feature of G ensures that G has an Eulerian trail.
-
18M.3.AHL.TZ0.Hdm_1a.ii:
State what feature of G ensures that G does not have an Eulerian circuit.
-
18M.3.AHL.TZ0.Hdm_1b:
Write down an Eulerian trail in G.
-
18M.3.AHL.TZ0.Hdm_1c.ii:
Starting and finishing at B, find a solution to the Chinese postman problem for G.
-
18M.3.AHL.TZ0.Hdm_1c.iii:
Calculate the total weight of the solution.
-
17M.3.AHL.TZ0.Hdm_3a.i:
In the context of graph theory, explain briefly what is meant by a circuit;
-
17M.3.AHL.TZ0.Hdm_3a.ii:
In the context of graph theory, explain briefly what is meant by an Eulerian circuit.
-
17M.3.AHL.TZ0.Hdm_3b:
The graph has six vertices and an Eulerian circuit. Determine whether or not its complement can have an Eulerian circuit.
-
17M.3.AHL.TZ0.Hdm_3c:
Find an example of a graph , with five vertices, such that and its complement both have an Eulerian trail but neither has an Eulerian circuit. Draw and as your solution.
-
18N.3.AHL.TZ0.Hdm_4a:
State, with a reason, whether or not G has an Eulerian circuit.
-
18N.3.AHL.TZ0.Hdm_4b:
Use Kruskal’s algorithm to find a minimum spanning tree for G, stating its total weight. Indicate clearly the order in which the edges are added.
-
18N.3.AHL.TZ0.Hdm_4c:
Use a suitable algorithm to show that the minimum time in which Mr José can get from A to E is 13 minutes.
-
18N.3.AHL.TZ0.Hdm_4d:
Find the minimum time it takes Mr José to patrol the resort if he has to walk along every road at least once, starting and ending at A. State clearly which roads need to be repeated.
-
16N.3.AHL.TZ0.Hdm_4a:
(i) Draw the graph including the weights of all the edges.
(ii) Use the nearest-neighbour algorithm, starting at vertex , to find a Hamiltonian cycle.
(iii) Hence, find an upper bound to the travelling salesman problem for this weighted graph.
-
16N.3.AHL.TZ0.Hdm_4b:
Consider the graph . Use the deleted vertex algorithm, with as the deleted vertex, to find a lower bound to the travelling salesman problem for this weighted graph.
-
16N.3.AHL.TZ0.Hdm_4c:
(i) Use the nearest-neighbour algorithm, starting at vertex , to find a Hamiltonian cycle.
(ii) Hence find and simplify an expression in , for an upper bound to the travelling salesman problem for this weighted graph.
-
16N.3.AHL.TZ0.Hdm_4d:
By splitting the weight of the edge into two parts or otherwise, show that all Hamiltonian cycles of have the same total weight, equal to the answer found in (c)(ii).
-
17N.3.AHL.TZ0.Hdm_1a:
Draw the weighted graph .
-
17N.3.AHL.TZ0.Hdm_1b:
Starting at library D use the nearest-neighbour algorithm, to find an upper bound for Mathilde’s minimum travelling distance. Indicate clearly the order in which the edges are selected.
-
17N.3.AHL.TZ0.Hdm_1c:
By first removing library C, use the deleted vertex algorithm, to find a lower bound for Mathilde’s minimum travelling distance.
-
17M.3.AHL.TZ0.Hdm_2a:
Starting at A , use the nearest neighbour algorithm to find an upper bound for the travelling salesman problem for .
-
17M.3.AHL.TZ0.Hdm_2b:
By first deleting vertex A , use the deleted vertex algorithm together with Kruskal’s algorithm to find a lower bound for the travelling salesman problem for .
-
19N.3.AHL.TZ0.Hdm_1a:
By deleting , use the deleted vertex algorithm to find a lower bound for the length of a route that visits every shop, starting and finishing at .
-
19N.3.AHL.TZ0.Hdm_1b:
Starting from , use the nearest-neighbour algorithm to find a route which gives an upper bound for this problem and calculate its length.
-
20N.1.AHL.TZ0.F_2a:
Verify that satisfies the handshaking lemma.
-
20N.1.AHL.TZ0.F_2b:
Show that cannot be redrawn as a planar graph.
-
20N.1.AHL.TZ0.F_2c:
State, giving a reason, whether contains an Eulerian circuit.
-
20N.3.AHL.TZ0.Hdm_2a.i:
Use Dijkstra’s algorithm to find the shortest time to travel from to , clearly showing how the algorithm has been applied.
-
20N.3.AHL.TZ0.Hdm_2a.ii:
Hence write down the shortest path from to .
-
20N.3.AHL.TZ0.Hdm_2b:
A new road is constructed that allows Christine to travel from to in minutes. If Christine starts from home and uses this new road her minimum travel time to is reduced, but her minimum travel time to remains the same.
Find the possible values of .
-
EXN.1.AHL.TZ0.11:
Nymphenburg Palace in Munich has extensive grounds with points of interest (stations) within them.
These nine points, along with the palace, are shown as the vertices in the graph below. The weights on the edges are the walking times in minutes between each of the stations and the total of all the weights is minutes.
Anders decides he would like to walk along all the paths shown beginning and ending at the Palace (vertex A).
Use the Chinese Postman algorithm, clearly showing all the stages, to find the shortest time to walk along all the paths.
-
21M.1.AHL.TZ1.10a.i:
Use Prim’s algorithm to find the weight of the minimum spanning tree of the subgraph of obtained by deleting and starting at . List the order in which the edges are selected.
-
21M.1.AHL.TZ1.10a.ii:
Hence find a lower bound for the travelling time needed to visit all the oil rigs.
-
21M.1.AHL.TZ1.10b:
Describe how an improved lower bound might be found.
-
21M.1.AHL.TZ2.11a:
Musab starts and finishes from the village bus-stop at . Determine the total distance Musab will need to walk.
-
21M.1.AHL.TZ2.11b:
Instead of having to catch the bus to the village, Musab’s sister offers to drop him off at any junction and pick him up at any other junction of his choice.
Explain which junctions Musab should choose as his starting and finishing points.
-
22M.3.AHL.TZ1.2f.iii:
A sewer inspector needs to plan the shortest possible route through each of the connections between different locations. Determine an appropriate start point and an appropriate end point of the inspection route.
Note that the fact that each location is connected to itself does not correspond to a sewer that needs to be inspected.
-
22M.3.AHL.TZ2.2d.i:
By using Kruskal’s algorithm, find the minimum spanning tree for , showing clearly the order in which edges are added.
-
22M.3.AHL.TZ2.2d.ii:
Hence find the minimum installation cost for the cables that would allow all the buildings to be part of the computer network.
-
22M.3.AHL.TZ2.2e:
State why a path that forms a Hamiltonian cycle does not always form an Eulerian circuit.
-
22M.3.AHL.TZ2.2f:
Starting at , use the nearest neighbour algorithm to find the upper bound for the installation cost of a computer network in the form of a Hamiltonian cycle.
Note: Although the graph is not complete, in this instance it is not necessary to form a table of least distances.
-
22M.3.AHL.TZ2.2g:
By deleting , use the deleted vertex algorithm to find the lower bound for the installation cost of the cycle.