Caselets – Advanced Study Notes
(Quantitative Aptitude – Ladakh PSC / Other Competitive Exams)
What is a “Caselet”?
A caselet is a self‑contained, scenario‑based problem that presents a narrative (often a real‑world situation) and then asks one or more quantitative questions about it. Unlike “direct” questions that give you a single equation or a set of numbers, a caselet forces you to extract the relevant data, model the situation, and then solve a series of inter‑dependent sub‑problems.
Why are they hard?
• Multiple layers of reasoning (reading comprehension + math).
• Implicit constraints (e.g., “only 5 types of fruits are available”).
• Hidden assumptions (e.g., “each student must receive at least one book”).
• Possibility of multiple interpretations that can lead to wrong modeling.
These notes give you a rigorous, MIT‑style framework to attack caselets efficiently and correctly.
1. First Principles: The Caselet Problem‑Solving Framework
| Step | Goal | How to Do It | Common Pitfalls |
|---|---|---|---|
| 1. Parse the Narrative | Identify entities, attributes, and relationships. | • Read once to spot nouns (people, objects). • Underline verbs that describe actions or constraints. |
• Over‑reading: assuming relationships that are not stated. |
| 2. Translate to Variables | Assign algebraic symbols to each relevant quantity. | • Use clear notation: (x) for unknowns, (a,b,c) for knowns; keep track of units. | • Re‑using the same symbol for different quantities in the same caselet. |
| 3. Enumerate Constraints | Write down all equations/inequalities that the scenario imposes. | • Look for “exactly”, “at least”, “at most”, “only”. • If the problem states “if X then Y”, note the conditional. |
• Missing a hidden constraint (e.g., “no fruit is left over”). |
| 4. Identify the Objective | Determine what the question asks (solve for (x), find a ratio, maximize/minimize). | • Highlight the request in the problem statement. | • Mixing up multiple sub‑questions. |
| 5. Solve | Use algebra, combinatorics, probability, or geometry as appropriate. | • Keep the system of equations linear (if possible). • If under‑determined, check if extra hidden constraints can be extracted. |
• Assuming a unique solution when the model admits a family of solutions. |
| 6. Validate | Plug back into constraints to ensure consistency. | • Check bounds (e.g., non‑negative, integer). | • Ignoring integer constraints leads to fractional “answers” that are not permissible. |
| 7. Answer & Format | Present the answer in the requested format (numeric, ratio, probability). | • Write the answer clearly, citing the derived value. | • Rounding incorrectly or giving a unit‑less value when a ratio is asked. |
2. Theoretical Foundations
2.1. Systems of Linear Equations
Often a caselet reduces to a linear system of the form
[ \begin{cases} a_1x_1 + a_2x_2 + \dots + a_nx_n = b_1\ c_1x_1 + c_2x_2 + \dots + c_nx_n = b_2\ \vdots\ \end{cases} ]
- Rank & Consistency: Use Rank–Nullity principle to ascertain whether a unique solution exists.
- Edge Cases:
- Inconsistent (no solution) → indicates mis‑interpretation or missing data.
- Dependent (infinitely many) → requires an additional constraint (e.g., “minimum total cost”).
2.2. Integer Programming
When the variables must be integers (most caselets), treat the system as an ILP (Integer Linear Program) with constraints:
[ x_i \in \mathbb{Z}_{\ge 0} ]
- Feasibility: Check if the linear relaxation (ignoring integrality) gives an integer solution; if not, use branch‑and‑bound or cutting planes (conceptually, not actually required for exam).
- Corner‑point Principle: For 2‑variable ILP, feasible solutions lie on lattice points of the polygon defined by constraints.
2.3. Probability & Conditional Reasoning
Caselets involving random selection or conditional events use:
- Bayes’ Theorem
- Law of Total Probability
- Combinatorial Counting (permutations, combinations).
Example Edge Case: “If an event occurs with probability (p), what is the probability that both events A and B occur?” – Must consider whether A and B are independent.
2.4. Optimization in Constraints
Some caselets ask for maximising or minimising a quantity:
- Linear Programming: Objective function (z = \sum d_i x_i), subject to linear constraints.
- Corner‑point Optimality: For linear optimisation, optimum occurs at a corner point of the feasible region.
- Edge Cases: Unbounded objective (e.g., you can always increase cost by adding more units) → indicates missing constraints.
2.5. Graph Theory & Network Flows
When the caselet involves “paths” or “routes” (e.g., delivery trucks, scheduling), model it as a graph:
- Vertices = Locations or events.
- Edges = Possible connections with weights (time, cost).
- Shortest Path / Minimum Spanning Tree algorithms conceptually help to check reasoning.
3. Common Edge Cases & How to Spot Them
| Edge Case | What it Looks Like | How to Detect | Fix |