YOUR B1 REVISION ROUTE
B1 connects defining a problem, organising an approach and following an algorithm. Revise all four objectives here: B1.1.1–B1.1.4 are common SL/HL content.
Start with the summaries and worked examples. Cover the answers, reconstruct the reasoning in your book, then use the Flashcards tab to test recall and choose what to revisit. There are 96 cards, 24 for each objective, including applied questions as well as terminology.
Selections remain in your revision list even when a different section filter hides their cards. They last while this page remains open.
B1.1.1 | CONSTRUCT A PROBLEM SPECIFICATION
A problem specification describes the current problem, required outcomes and boundaries, relevant data and how success will be judged. Begin with the people affected and the difficulty they face, rather than assuming a particular app or framework is the answer.
To construct, supply the organised content for the scenario. Merely writing the headings “inputs” and “outputs” does not construct their specifications. Confirm important rules with stakeholders and distinguish known requirements from assumptions or unanswered questions.
THE SIX CONNECTED PARTS
| Part | Include | Example |
|---|---|---|
| Problem statement | Current process, difficulty, affected people and consequences | Paper loan records make equipment availability unreliable. |
| Objectives and goals | Broad purpose and specific required results | Improve reliability; record valid loans and returns. |
| Constraints and limitations | Restrictions and boundaries in capability | Existing desktop, no paid subscription; staff still check physical returns. |
| Input specifications | Data, sources, forms and acceptance rules | Required existing StudentID and EquipmentID; reject an item already on loan. |
| Output specifications | Contents, format, audience and trigger | Show staff a confirmation with LoanID and DueDate after acceptance. |
| Evaluation criteria | Observable results and evidence linked to objectives | A second active loan is rejected without changing the first. |
A constraint restricts choices; a limitation describes a boundary in capability or effectiveness. They can overlap, so explain the actual effect rather than relying on a label. Scope also states exclusions, such as no online reservations in the first version.
WORKED | TURN A GOAL INTO CHECKABLE SUCCESS
“Make lending better” is a broad aspiration. “Display the active-loan status when staff select an EquipmentID” specifies a capability. “An item lookup completes within two seconds on the agreed school desktop with 1,000 equipment records” adds a measurable performance target and conditions. The numbers require agreement; they are illustrative.
Link each objective to evidence. This traceability makes missing coverage visible. A full test case supplies specific starting data, actions and expected results; the criterion states what success means.
| Objective | Evaluation criterion | Example test |
|---|---|---|
| Record valid loans | Create exactly one loan for valid IDs and an available item. | Issue available E0017 to S0042; inspect saved IDs and confirmation. |
| Prevent simultaneous active loans per item | Reject a second active loan without changing the original. | Attempt another loan of E0017 before return; still exactly one active loan. |
| Identify overdue loans | Include active loans due earlier than today. | Today 24 October: active due 23 included; active due 24 excluded; returned due 23 excluded. |
INPUTS, OUTPUTS AND ASSUMPTIONS
A field name alone is incomplete. State where data comes from, its form and rules. The issue date may come from the computer clock, while a due date is calculated; neither automatically requires a user input box. Include rejection behaviour and empty-report outputs.
Validation can check whether an ID exists but cannot prove the chosen student is the person at the desk. Record necessary human responsibilities. Likewise, a computer cannot verify a physical return merely because someone clicked Return.
Requirement: staff can find the borrower for an item. Design decision: use a particular Python structure or button layout. A named platform can be a constraint if imposed, but avoid fixing implementation choices without a reason. Label uncertain policies instead of inventing confirmed facts.
B1.1.2 | FOUR FUNDAMENTAL CONCEPTS
| Concept | What it does | Workshop-booking example |
|---|---|---|
| Abstraction | Represents relevant features and omits unnecessary detail for a purpose. | Keep IDs, capacities and student/workshop associations; omit poster designs. |
| Decomposition | Divides the problem into coherent smaller parts. | Receive, check, record and report; break checking into smaller checks. |
| Pattern recognition | Identifies useful similarities, repetitions or regularities. | Different workshops share duplicate and capacity checks. |
| Algorithmic design | Develops precise ordered steps and decisions. | Check IDs, duplicate and capacity before saving and confirming. |
Abstraction selects what to represent; decomposition divides what needs doing. Pattern recognition notices a shared structure; algorithmic design specifies how a method applies it. They can be revisited in any useful order.
WORKED | A BOOKING MODEL THAT IS TOO SIMPLE
Keeping only each workshop’s capacity and booking count allows a capacity comparison but loses which students hold places. A repeated request cannot be recognised, so the model cannot enforce one booking per student per workshop.
Retain the student/workshop associations. The representation is still simpler than a complete real-world description but preserves the distinctions the rules require. Abstraction is useful only while the model remains fit for its purpose.
If a school trip instead permits one activity per student for the entire trip, the duplicate check must look for any allocation by that student, not just the selected student/activity pair. Reusing a similar method requires checking differences in the rules.
DECOMPOSITION AND REUSABLE PATTERNS
Decompose booking into receiving a request, checking it, recording acceptance and communicating the result. Each part has a responsibility; interfaces specify what information passes between them. Separately tested parts still need integration tests.
Recognising the same capacity rule across workshops suggests one shared procedure supplied with a selected WorkshopID and its capacity. This avoids duplicated logic and inconsistent changes. A specialist workshop may still need an induction check.
A pattern is not a guarantee. Repeated observations can suggest a hypothesis without proving cause or universal applicability. Generalisation should preserve meaningful exceptions.
ALGORITHMIC DESIGN WITHOUT CODE
An algorithm is a finite ordered sequence of precise steps. It can be expressed in structured language, pseudocode or a flowchart. Programming implements a method; computational thinking is also possible on paper.
For one booking: read IDs; reject unknown values; reject a duplicate; reject count ≥ capacity; otherwise save one booking, then confirm. Stop after a rejection and leave records unchanged.
Order changes behaviour. Checking duplicates before capacity reports Already booked for a duplicate in a full workshop. Saving first could violate capacity. A multi-user service needs coordinated check-and-save operations; a sequential teaching example does not supply that protection.
B1.1.3 | EXPLAIN THE EFFECT OF A TECHNIQUE
Use concept → specific action → reason or effect. “Use decomposition” names an idea. “Separate checking from saving so invalid requests can be tested without changing records” explains an application. Connectives help when the causal link is valid.
Computational thinking does not necessarily involve programming. A table of relevant data, a sketch of entities or a precise manual review procedure can all be useful. Choose an adequate approach for the requirements rather than automatically choosing machine learning or a complex framework.
FIVE APPLICATION AREAS
| Area | Application and why it helps | Important limit |
|---|---|---|
| Software development | Retain IDs and state; separate checks and updates; reuse common rules; order validation before saving. | Concurrent requests require appropriate coordination. |
| Data analysis | Keep units/timestamps; separate preparation, calculation and reporting; compare equivalent intervals. | A missing reading can prevent individual daily conclusions. |
| Machine learning | Choose prediction-time features; organise fitting/evaluation; learn relationships; specify a valid workflow. | Leakage, unrepresentative data and changed conditions can mislead. |
| Database design | Represent entities and relationships; separate repeated facts; define linked operations. | Identifiers, constraints and transactions must support actual rules. |
| Network security | Keep relevant events and windows; separate detection from investigation and response. | An anomaly is a review candidate, not proof of an attack. |
WORKED | MISSING DATA AND LEAKAGE
| Meter reading date, same time | Cumulative kWh | Known difference |
|---|---|---|
| 1 October | 1200 | No earlier reading |
| 2 October | 1230 | 30 kWh over one day |
| 3 October | 1275 | 45 kWh over one day |
| 5 October | 1345 | 70 kWh over two days |
The two-day interval average is 35 kWh per day, but neither individual day is established. Retaining timestamps and interval lengths prevents all 70 kWh being falsely assigned to 5 October.
For a model predicting delivery duration before departure, planned distance may be legitimate input. Actual arrival time is unavailable then and leaks the answer. Define the target, retain appropriate features and separate evaluation data before fitting preprocessing. Apparent performance is useful only if the evaluation reflects the intended task.
WORKED | NETWORK FLAGS AND DATABASE RECORDS
Under the fictional rule “flag more than 20 failures per five-minute window”, 20 is not flagged and 21 is flagged. Lowering the threshold may increase review work; without verified labels you cannot calculate accuracy or conclude a source is malicious. Equivalent windows and contextual investigation matter.
For library loans, Member, BookCopy and Loan are distinct entities. A title may have multiple physical copies; CopyID preserves the distinction needed for availability. Separating member contact details from repeated loan events reduces inconsistent updates. Appropriate linked operations still need enforcement.
A precise method can still solve the wrong problem. Revisit assumptions and requirements when tests reveal a missing timestamp, a concurrency issue or an important exception.
B1.1.4 | FOLLOW AND RECORD THE ACTIONS
Trace means follow and record the actions of an algorithm. Begin at START and follow arrowheads. At a decision, evaluate the condition using current values and follow exactly one labelled branch. A return arrow does not reset variables.
Record assignments after reading the old values on their right-hand side. Total ← Total + Number preserves the accumulated amount and adds a new contribution. Keep a separate ordered output list; calculations are not automatically printed.
SYMBOLS AND TRACING ROUTINE
| Symbol | Role |
|---|---|
| Rounded terminal | START or END |
| Rectangle | Process or operation |
| Parallelogram | INPUT or OUTPUT |
| Diamond | Decision |
| Arrow | Direction of control flow |
| Labelled circle | Connector: continue from the matching label without changing values |
List inputs in order. Mark variables not yet assigned as not set rather than assuming zero. Execute one symbol; update state; record any decision or output; follow its arrow. At INPUT consume the next supplied value. At OUTPUT record the current value or literal message.
An output prompt asks for data but does not read it. A connector moves the visual route without calculating. If input runs out, do not invent a value. Use the trace-table headings provided by the question.
WORKED FLOWCHART | COUNT FROM 1 TO LIMIT
| For Limit = 3 | Count | Output so far |
|---|---|---|
| Initialise | 1 | None |
| True test; output; increment | 2 | 1 |
| True test; output; increment | 3 | 1, 2 |
| True test; output; increment | 4 | 1, 2, 3 |
| 4 ≤ 3 is false; exit | 4 | 1, 2, 3 |
The loop body is OUTPUT Count followed by the increment. The final stored Count is 4, while the last output is 3. With Limit = 0, the first comparison is false, no body actions occur and Count remains 1.
WORKED FLOWCHART | TOTAL UNTIL ZERO
| Event with inputs 4, 7, 0 | Number | Total | Output |
|---|---|---|---|
| Initialise | Not set | 0 | None |
| Read 4; true test; add | 4 | 4 | None |
| Read 7; true test; add | 7 | 11 | None |
| Read 0; false test | 0 | 11 | None |
| Output and end | 0 | 11 | 11 |
The sentinel is consumed but the false branch exits before the addition. If the first input is zero, the body is skipped and output is 0. Removing the repeated input after a nonzero first value leaves the condition unchanged and produces a non-terminating run.
WORKED FLOWCHART | READ UNTIL POSITIVE
For −2, 0, 5: read −2, false test, return to input; read 0, false test, return; read 5, true test, exit and output 5 once. The body reads at least once because the test comes afterwards.
This stopping condition is the opposite role from the continuation condition in the total chart. YES exits here. Follow the actual arrows rather than assuming that true always repeats. Values supplied after the accepted positive input are unused.
BOUNDARY AND OUTPUT CHECKS
| Run | Correct result | Why |
|---|---|---|
| Sequence: Double ← Number × 2; Result ← Double + 1; input 6 | Output 13 | Assignments occur in order: 12 then 13. |
| Admission Age ≥ 12; input 12 | Allowed | Equality belongs to the true branch. |
| Counting with Limit 3 and test changed to Count < Limit | Outputs 1, 2; final Count 3 | The modified test exits when Count equals 3. |
| Total with 3, −2, 0 | Output 1 | Negative nonzero values still enter the body. |
| Count values > 5 until zero: 4, 8, 5, 9, 0 | Output 2 | Eight and nine qualify; five and the sentinel do not. |
For the counting row, the original ≤ version outputs 1, 2, 3 and ends with Count 4. The strict < version outputs only 1, 2 and ends with Count 3.
COMMAND WORDS | CHOOSE THE RIGHT RESPONSE
| Command | Response required here |
|---|---|
| Construct | Provide an organised specification for the actual scenario, not only headings. |
| Describe | Give a detailed account of a concept and its relevant features. |
| Explain | Connect an action or representation to its reason or effect. |
| Trace | Follow and record actions, values, decisions and outputs as requested. |
Use examples to support your response, but answer the requested command. A general definition does not replace a trace, and a final number alone does not show the actions when the question requests them.
COMMON MISTAKES
| Avoid | Replace with |
|---|---|
| The app is the problem statement. | Describe the underlying difficulty and affected people. |
| Works well is a sufficient evaluation criterion. | State observable results and test conditions. |
| Abstraction deletes all detail. | Retain the distinctions needed by the purpose. |
| Decomposition and abstraction are interchangeable. | Divide the work versus select the representation. |
| A pattern proves cause or removes exceptions. | Investigate evidence and meaningful differences. |
| Computational thinking always needs code. | Use models and systematic methods with or without programming. |
| YES always repeats; loops reset variables. | Follow the labelled routes and executed assignments. |
| Final value equals final output. | Track storage and printed output separately. |
FINAL SELF-CHECK
Can you construct a scenario-specific specification, distinguish the four concepts, explain applications with reasons and trace decisions and loops using current values?
Mark uncertain cards, revisit their linked lessons and use the separate end-of-topic review for assessment practice. The workbook is a distinct resource and is coming soon.