162 questions · 29 question types identified
Questions that ask to show a root exists in a given interval by directly evaluating the function at the interval endpoints and demonstrating a sign change, without requiring any rearrangement or additional analysis.
Questions that require interval bisection followed by or combined with other numerical methods such as Newton-Raphson or linear interpolation.
A question is this type if and only if it requires sketching two curves on the same axes and using the sketch to show or explain how many real roots an equation has.
A question is this type if and only if it requires applying Floyd's algorithm to find shortest paths in a network and producing distance and route matrices.
A question is this type if and only if it asks to calculate estimates of derivatives using forward, backward, or central difference methods from tabulated data.
| \(x\) | 1.9 | 2 | 2.1 |
| \(\mathrm { f } ( x )\) | 0.5842 | 0.6309 | 0.6753 |
Questions that combine Newton-Raphson iteration with other numerical methods such as linear interpolation, interval bisection, or step-by-step methods in the same problem.
A question is this type if and only if it requires using Simpson's rule with a specified number of intervals to estimate a definite integral.
A question is this type if and only if it requires calculating absolute or relative errors when approximations are used, or analyzing error propagation through rounding or chopping.
Questions that state a root exists in the interval and only ask to apply linear interpolation without prior verification.
A question is this type if and only if it involves setting up an equation from geometric conditions (sectors, segments, triangles) that leads to a transcendental equation requiring numerical solution.
A question is this sub-type if and only if it asks to solve an equation primarily involving logarithmic functions (ln) to a specified accuracy without specifying the method.
A question is this type if and only if it asks to apply the binary search algorithm to locate a name or item in an ordered list.
A question is this type if and only if it asks to find a polynomial that passes through given data points using interpolation methods or difference tables.
| \(x\) | 1 | 2 | 5 |
| \(\mathrm { f } ( x )\) | 5 | 16.6 | 76.6 |
Questions that use the trapezium rule and additionally require analysis of accuracy, comparison of approximations with different strip numbers, or explanation of how to improve estimates.
A question is this type if and only if it involves completing or interpreting a dynamic programming table for optimization problems.
A question is this type if and only if it asks to formulate a real-world optimization problem as a linear programming problem with constraints and objective function.
Questions that only require applying the interval bisection method a specified number of times, without any additional methods like Newton-Raphson or linear interpolation.
A question is this type if and only if it asks to explain why the sign change method fails or cannot be used in a particular situation (e.g., discontinuity, multiple roots).
A question is this type if and only if it requires tracing through a given algorithm, flowchart, or pseudocode with specific input values.
A question is this type if and only if it requires applying the secant method or method of false position to find successive approximations to a root.
| I | J | K | L | M | |
| 2 | \(r\) | \(\mathrm { x } _ { \mathrm { r } }\) | f(x) | \(\mathrm { X } _ { \mathrm { r } + 1 }\) | \(\mathrm { f } \left( \mathrm { x } _ { \mathrm { r } + 1 } \right)\) |
| 3 | 0 | 1 | -0.0914 | 2 | -0.0476 |
| 4 | 1 | 2 | -0.0476 | 3.08529 | 0.95784 |
| 5 | 2 | 3.08529 | 0.95784 | 2.05134 | -0.0298 |
| 6 | 3 | 2.05134 | -0.0298 | 2.08259 | -0.0181 |
| 7 | 4 | 2.08259 | -0.0181 | 2.13042 | 0.00155 |
| 8 | 5 | 2.13042 | 0.00155 | 2.12664 | \(- 7 \mathrm { E } - 05\) |
Questions that present interval bisection data in spreadsheet format and require interpretation or continuation of the bisection process from given values.
| A | B | C | D | E | F | G | |
| 1 | a | \(\mathrm { f } ( a )\) | b | f(b) | \(( a + b ) / 2\) | \(\mathrm { f } ( ( a + b ) / 2 )\) | mpe |
| 2 | 1 | -0.28172 | 2 | 1.389056 | 1.5 | 0.231689 | 0.5 |
| 3 | 1 | -0.28172 | 1.5 | 0.231689 | 1.25 | -0.072157 | 0.25 |
| 4 | 1.25 | -0.07216 | 1.5 | 0.231689 | 1.375 | 0.064452 | 0.125 |
| 5 | 1.25 | -0.07216 | 1.375 | 0.064452 | 1.3125 | -0.007206 | 0.0625 |
| 6 | 1.3125 | -0.00721 | 1.375 | 0.064452 | 1.34375 | 0.027728 | 0.03125 |
Questions that require only applying the Newton-Raphson iteration formula one or more times to find successive approximations to a root, without requiring any other numerical methods.
Questions that apply the trapezium rule to estimate integrals arising from real-world scenarios such as velocity-time graphs, physical measurements, or geometric applications where the integral represents a practical quantity.
A question is this sub-type if and only if it asks to solve an equation primarily involving exponential functions (e^x) to a specified accuracy without specifying the method.
Questions that require straightforward application of the trapezium rule to estimate a definite integral with a specified number of strips, without additional context or follow-up analysis.
A question is this type if and only if it requires rearranging an equation into the form x = g(x) or similar for use in an iterative method.
A question is this sub-type if and only if it asks to solve an equation involving a combination of different transcendental functions (mixing exponentials, logarithms, trigonometric, and algebraic terms) to a specified accuracy without specifying the method.
Questions that ask to show two curves intersect (equivalently, that their difference has a root) in a given interval by demonstrating a sign change, typically requiring rearrangement into the form f(x) - g(x) = 0 or analysis of where curves meet.
Questions that require showing a root exists in the interval (via sign change) before applying linear interpolation.
Questions not yet assigned to a type.