🇬🇧 Thinking Skills Assessment (TSA) · subject

Thinking Skills Assessment (TSA) Problem Solving (Section 1) Syllabus

The Problem Solving (Section 1) syllabus for Thinking Skills Assessment (TSA) in full: 4 chapters, 19 topics and 45 sub-topics, every one listed below, plus 51 Problem Solving (Section 1) flashcards with answers.

4Chapters
19Topics
45Sub-topics
51Flashcards

Problem Solving (Section 1) syllabus: all 4 chapters

Expand any chapter to see its topics and sub-topics.

  1. Relevant Selection

    5 topics
    • Identifying necessary information
      • Distinguishing relevant from irrelevant data in a scenario
      • Stripping away distractor figures and superfluous detail
      • Recognising which quantities the question actually requires
    • Working with tables and price lists
      • Reading multi-column tables to extract target values
      • Comparing options across rows to find a best fit
      • Handling conditional pricing, discounts and surcharges
    • Selecting from textual scenarios
      • Parsing word problems for the operative constraint
      • Ignoring narrative padding that does not affect the answer
    • Timetable and schedule problems
      • Reading bus, train and flight timetables
      • Calculating durations across changeovers and time zones
      • Choosing the earliest, cheapest or shortest route
    • Multi-source selection
      • Combining information split across two or more displays
      • Cross-referencing a key with a chart
  2. Finding Procedures

    6 topics
    • Devising a method to reach a goal
      • Sequencing operations to satisfy all constraints
      • Identifying the minimum number of steps
    • Optimisation problems
      • Maximising output within a budget or resource limit
      • Minimising cost, time or waste
      • Greedy versus exhaustive trial strategies
    • Combination and packing problems
      • Bin-packing and fitting items into containers
      • Making exact totals from a set of denominations
    • Route and network procedures
      • Shortest-path reasoning on simple maps
      • Covering all nodes or edges efficiently
    • Scheduling and rota construction
      • Allocating tasks to time slots without clashes
      • Respecting precedence and dependency rules
    • Working backwards from a target
      • Reverse calculation to find a starting value
      • Reconstructing earlier states from a final outcome
  3. Identifying Similarity

    4 topics
    • Recognising shared structure
      • Matching the logical form of two problems
      • Spotting that two scenarios use the same underlying rule
    • Reasoning by analogy
      • Transferring a method from a worked case to a new case
      • Detecting where an analogy breaks down
    • Equivalent representations of data
      • Translating between tables, graphs and prose
      • Recognising the same information shown two ways
    • Pattern equivalence in figures
      • Matching diagrams that encode identical relationships
      • Identifying which option mirrors a given example
  4. Numerical and Spatial Reasoning Toolkit

    4 topics
    • Core arithmetic under time pressure
      • Mental estimation and rounding to eliminate options
      • Percentages, ratios and proportion
      • Rates, speed-distance-time and unit conversion
    • Interpreting charts and graphs
      • Bar charts, pie charts and line graphs
      • Reading scatter plots and trends
      • Misleading axes and scale traps
    • Spatial visualisation
      • Nets, cubes and 3D folding
      • Rotation, reflection and views from different angles
      • Tiling, overlap and area reasoning
    • Logical deduction puzzles
      • Grid logic and elimination tables
      • Ordering and ranking from clues

Thinking Skills Assessment (TSA) Problem Solving (Section 1) flashcards — 51 questions with answers

  1. In TSA Problem Solving, what is meant by "identifying necessary information"?

    The skill of determining exactly which pieces of given data are required to answer a question, while disregarding irrelevant or redundant information. A datum is necessary if removing it makes the question unanswerable.

  2. How do you test whether a given piece of information in a problem is actually necessary?

    Cover or ignore that piece and check whether the question can still be solved. If the answer becomes impossible to determine, the information was necessary; if it can still be found, it was redundant.

  3. What is the difference between "sufficient" and "necessary" information in problem solving?

    Necessary information is required to reach the answer; sufficient information is enough on its own to guarantee the answer. A set can be sufficient without every item being individually necessary, and a necessary item may not be sufficient alone.

  4. When working with a price list, how do you compute the total cost of a multi-item order?

    Multiply each item's unit price by its quantity, then sum the results: $\text{Total}=\sum_{i} p_{i}\,q_{i}$, where $p_{i}$ is unit price and $q_{i}$ is quantity of item $i$. Apply any discounts or surcharges afterward.

  5. In table/price-list problems, how is a percentage discount applied to a price $P$?

    Multiply by one minus the discount fraction: discounted price $=P\left(1-\dfrac{d}{100}\right)$, where $d$ is the discount percentage.

  6. How do you find the cheapest option when a price list offers both individual items and bundles?

    Compute the total cost under each purchasing combination (all singles, all bundles, and mixes), including any leftover items, then compare totals and select the minimum.

  7. What is the effective unit price of a "buy $n$ get 1 free" offer on an item costing $p$ each?

    You pay $np$ for $n+1$ items, so the effective unit price is $\dfrac{np}{n+1}$.

  8. In a "selecting from textual scenarios" question, what is the recommended first step?

    Extract the explicit constraints stated in the passage (rules, conditions, exclusions), then test each candidate option against every constraint, eliminating any that violate one.

  9. How do you handle conditional statements ("if X then Y") when selecting from a textual scenario?

    Treat them as filters: whenever the antecedent X holds, the consequent Y must hold. Eliminate options where X is true but Y is false. Note that "if X then Y" says nothing when X is false.

  10. For timetable problems, how do you compute a journey's duration that crosses times like 14:50 to 15:25?

    Convert to minutes from the hour boundary or to a 24-hour minute count. From 14:50 to 15:25: 10 minutes to 15:00 plus 25 minutes = $35$ minutes total.

  11. In a timetable, how do you determine whether a connection between two services is possible?

    Check that the arrival time of the first service is at or before the departure time of the second, allowing any required minimum transfer/interchange time: $t_{\text{arrive}}+t_{\text{transfer}}\le t_{\text{depart}}$.

  12. How do you find the latest train someone can catch to arrive by a deadline $D$, given journey time $J$?

    They must depart no later than $D-J$. Scan the timetable for the latest departure time that is $\le D-J$ and whose arrival is $\le D$.

  13. In schedule problems, what is "layover" or "dwell time" and why does it matter?

    It is the waiting time between arrival and the next departure (e.g., at an interchange or stop). It must be added to travel time when computing total journey duration and feasibility of connections.

  14. What is "multi-source selection" in TSA problem solving?

    Questions requiring you to combine information drawn from two or more sources (e.g., a table plus a paragraph plus a chart) to identify the option that satisfies all sources simultaneously.

  15. What is the key strategy for multi-source selection problems?

    Apply each source as an independent filter on the candidates, eliminating any option that fails any one source. The correct answer is the option (often unique) surviving all filters.

  16. What does "devising a method to reach a goal" require you to identify?

    A valid sequence of allowed operations or steps that transforms the given starting state into the target/goal state, respecting all stated rules and constraints at each step.

  17. In a "devise a method" puzzle with operations of given sizes, how do you reach a target amount?

    Find integers (counts of each operation) solving the equation, e.g. for jugs of $a$ and $b$ litres reaching $t$: solve $ax+by=t$ where $x,y$ are step counts (positive for adding, negative for pouring out). Solvable when $t$ is a multiple of $\gcd(a,b)$.

  18. What is the general form of an optimisation problem in TSA Problem Solving?

    Find the choice that maximises or minimises an objective (e.g., cost, time, profit, quantity) subject to one or more constraints (budget, capacity, time limits).

  19. What is a practical method for solving a small optimisation problem under a budget constraint?

    Enumerate feasible combinations within the constraint, compute the objective value for each, and select the best. For maximising value per cost, prioritise items with the highest value-to-cost ratio $\dfrac{v_{i}}{c_{i}}$.

  20. In a combination/packing problem, how do you find the minimum number of containers needed?

    At minimum you need $\left\lceil \dfrac{\text{total quantity}}{\text{container capacity}} \right\rceil$ containers; the actual number may be higher if items cannot be split across containers (a bin-packing constraint).

Show the other 31 Problem Solving (Section 1) flashcards
  1. Why can the minimum container count in a packing problem exceed $\lceil \text{total}/\text{capacity}\rceil$?

    Because indivisible items leave wasted space: if items don't combine to fill each container exactly, some capacity is unused, forcing extra containers. The lower bound assumes perfect packing.

  2. What is a good packing heuristic for fitting items of various sizes into bins of fixed capacity?

    First-Fit Decreasing: sort items largest to smallest, then place each into the first bin with room (opening a new bin if none fits). It tends to minimise the number of bins used.

  3. In route problems, how do you find the shortest path through a network of weighted edges?

    Sum the edge weights (distances/times) along each candidate route and choose the minimum total. For systematic search use a shortest-path approach examining cumulative distance to each node.

  4. What is the difference between a route that visits all nodes and one that uses all edges?

    Visiting every node once is a Hamiltonian-type/travelling-salesman route; traversing every edge is an Eulerian-type route. They require different conditions and have different solution methods.

  5. When is it possible to traverse every edge of a network exactly once (an Eulerian trail)?

    An Eulerian trail exists if and only if the network is connected and has either $0$ or exactly $2$ vertices of odd degree. With $0$ odd vertices it is a closed circuit; with $2$ it starts and ends at the odd-degree vertices.

  6. In scheduling/rota construction, what is the basic feasibility check for staffing?

    For every time slot, the number of available people assigned must meet or exceed the required coverage, and no person may be assigned to two overlapping slots or exceed their allowed hours.

  7. How do you build a rota that satisfies minimum coverage with the fewest workers?

    Identify peak-demand slots first (they set the lower bound on staff), assign workers to cover peaks, then fill remaining slots reusing those workers where shift-length and rest rules allow.

  8. What is the "working backwards from a target" technique?

    Start from the known final state/value and reverse each operation in turn to recover the earlier states or the unknown starting value. Each forward operation is undone by its inverse.

  9. If a number is doubled, then $5$ is added, giving $23$, how do you work backwards to the original?

    Reverse in opposite order: subtract $5$ ($23-5=18$), then halve ($18/2=9$). Original $=9$. In general undo $+5$ with $-5$ and undo $\times 2$ with $\div 2$.

  10. What does "recognising shared structure" mean in problem solving?

    Identifying that two superficially different problems have the same underlying logical or mathematical form, so the same solution method applies to both.

  11. How is "reasoning by analogy" used to solve a new TSA problem?

    Map the elements of the new problem onto a previously solved problem with the same relational structure, transfer the solution method, then translate the result back into the new problem's terms.

  12. What is a risk when reasoning by analogy, and how is it avoided?

    A false analogy: the surface similarity may hide a structural difference. Verify that every relevant relation/constraint corresponds between the two problems before transferring the method.

  13. What are "equivalent representations of data" in TSA?

    Different formats that encode the same information, e.g., a table, a bar chart, a pie chart, a list, or an equation. The skill is converting between them and recognising that they convey identical underlying values.

  14. How do you convert a fraction of a total into a pie-chart angle?

    Multiply the fraction by $360^{\circ}$: angle $=\dfrac{\text{part}}{\text{whole}}\times 360^{\circ}$. For example a category that is $\tfrac14$ of the total occupies $90^{\circ}$.

  15. How do you convert a category's value into its percentage of the whole for a chart?

    Percentage $=\dfrac{\text{category value}}{\text{total of all categories}}\times 100$.

  16. What is "pattern equivalence in figures"?

    Recognising that two figures represent the same pattern despite transformations such as rotation, reflection, or translation, i.e., they are congruent up to those operations.

  17. Which transformations preserve the equivalence (congruence) of a figure?

    Rotation, reflection (mirror), and translation preserve shape and size, so the figure remains equivalent. Scaling changes size (similar, not congruent); shearing distorts the shape.

  18. How do you distinguish a rotation from a reflection of a figure?

    A rotation preserves the handedness/orientation order of features (clockwise stays clockwise); a reflection reverses handedness, producing a mirror image that cannot be obtained by rotation alone in the plane.

  19. Give the order of operations to evaluate an arithmetic expression under time pressure.

    Use BIDMAS/BODMAS: Brackets, Indices (powers/roots), Division and Multiplication (left to right), then Addition and Subtraction (left to right).

  20. What is a fast mental method to find $15\%$ of a quantity?

    Find $10\%$ (divide by $10$) and $5\%$ (half of the $10\%$), then add them: $15\%=10\%+5\%$. E.g. $15\%$ of $80=8+4=12$.

  21. How do you quickly multiply a number by $25$ under time pressure?

    Multiply by $100$ and divide by $4$, since $25=\dfrac{100}{4}$. E.g. $36\times 25=\dfrac{3600}{4}=900$.

  22. How do you compute average speed for a journey?

    $\text{average speed}=\dfrac{\text{total distance}}{\text{total time}}$. It is not the simple mean of speeds unless equal times are spent at each speed.

  23. When interpreting a line graph, how do you read off the rate of change between two points?

    The rate of change equals the gradient: $\dfrac{\Delta y}{\Delta x}=\dfrac{y_{2}-y_{1}}{x_{2}-x_{1}}$, the change in the vertical quantity divided by the change in the horizontal quantity.

  24. What common chart features must you check before reading values, to avoid errors?

    The axis scales and units, whether an axis starts at zero (a truncated axis exaggerates differences), the legend/key, and whether values are cumulative or per-interval.

  25. On a cumulative frequency graph, how do you estimate the median?

    Find the value on the horizontal axis corresponding to the cumulative frequency equal to half the total, i.e., read across from $\dfrac{n}{2}$ on the vertical axis to the curve and down to the data axis.

  26. What is spatial visualisation in the context of TSA problem solving?

    Mentally manipulating 2D or 3D shapes—folding nets, rotating solids, stacking cubes—to predict the result without physically moving them.

  27. When a 2D net is folded into a cube, how do you find which faces end up opposite each other?

    On a cube, opposite faces are never adjacent in the net. Faces separated by exactly one face in a straight row of the net, or those that fold away from each other, become opposite; adjacent net faces become adjacent (sharing an edge).

  28. How many small cubes form the surface vs interior of an $n\times n\times n$ cube?

    Interior (no painted faces) $=(n-2)^{3}$; surface cubes $=n^{3}-(n-2)^{3}$. For example, with $n=3$: interior $=1$, surface $=26$.

  29. What is the general approach to a logical deduction puzzle (e.g., who-owns-what grids)?

    List all categories and possibilities, then apply each clue to a grid, marking forced eliminations and confirmations. Use the process of elimination iteratively until each item is uniquely determined.

  30. In logic puzzles, how do you use the rule that each category value maps one-to-one?

    Once an item is confirmed for one entity, eliminate that item for all other entities and eliminate other items for that entity (a single mark in a row/column clears the rest), propagating constraints.

  31. What is the difference between a valid deduction and a mere assumption in a logic puzzle?

    A valid deduction follows necessarily from the given clues with no alternatives; an assumption introduces information not entailed by the clues. Only deductions guarantee a correct, defensible answer.

Thinking Skills Assessment (TSA) Problem Solving (Section 1) FAQ

What is in the Thinking Skills Assessment (TSA) Problem Solving (Section 1) syllabus?

Thinking Skills Assessment (TSA) Problem Solving (Section 1) is split into 4 chapters: Relevant Selection, Finding Procedures, Identifying Similarity and Numerical and Spatial Reasoning Toolkit. Together they contain 19 topics and 45 sub-topics.

How many chapters are in Thinking Skills Assessment (TSA) Problem Solving (Section 1)?

4 chapters, containing 19 topics and 45 sub-topics. The largest chapter is Finding Procedures, with 6 topics.

Are there flashcards for Thinking Skills Assessment (TSA) Problem Solving (Section 1)?

Yes — a 51-card Problem Solving (Section 1) deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.