IB COMPUTER SCIENCE | B1 ASSESSMENT

COMPUTATIONAL THINKING: END OF TOPIC REVIEW

Assess problem specifications, computational thinking concepts and applications, and accurate flowchart tracing through quick checks, applied tasks and developed written responses.

BEFORE YOU BEGIN

This review covers B1.1.1–B1.1.4, common SL/HL content. Attempt it independently before checking feedback. Use more than one session if needed, allowing time for the complete traces and written specifications.

Sections A and B award one point for each fully correct automatic item, with no partial credit within an item. Section C has separately suggested content marks. These are original practice questions, not an official IB paper, grade boundary or prediction.

Write working and Section C answers in your exercise book before revealing guidance. Answers last while the page remains open.

Automatic total: 32 points. Suggested written total: 72 marks, assessed separately.

A | QUICK CHECKS

Answer without notes. Select every correct choice in checkbox questions; other items ask for one answer. All questions in this review are common SL/HL.

A1 | Which belong in a problem statement?

Select all correct answers. One point requires the complete correct set.

A2 | Which distinguish a restriction from a capability boundary?

Select all correct answers. One point requires the complete correct set.

A3 | Which make specifications more useful?

Select all correct answers. One point requires the complete correct set.

A4 | Which are appropriate treatments of uncertainty?

Select all correct answers. One point requires the complete correct set.

A5 | Representing a workshop using IDs, capacities and bookings while omitting poster designs primarily demonstrates which concept?
A6 | Separating receiving, checking, saving and reporting primarily demonstrates which concept?
A7 | Which are justified uses of patterns?

Select all correct answers. One point requires the complete correct set.

A8 | Which characterise algorithmic design?

Select all correct answers. One point requires the complete correct set.

A9 | Which explain why decomposition helps software development?

Select all correct answers. One point requires the complete correct set.

A10 | Which improve a duration prediction task performed before departure?

Select all correct answers. One point requires the complete correct set.

A11 | Which help library database design?

Select all correct answers. One point requires the complete correct set.

A12 | Which claims about computational thinking are accurate?

Select all correct answers. One point requires the complete correct set.

A13 | Which flowchart symbol descriptions are accurate?

Select all correct answers. One point requires the complete correct set.

A14 | Count is 2 before Count ← Count + 1. Which statements follow?

Select all correct answers. One point requires the complete correct set.

A15 | Which distinguish the supplied loop structures?

Select all correct answers. One point requires the complete correct set.

A16 | Which are valid tracing practices?

Select all correct answers. One point requires the complete correct set.

B | APPLY YOUR KNOWLEDGE

B1–B8 use the scenarios stated in their questions. For B9–B16 use the five labelled charts below. Each question is a fresh run with the stated inputs; do not carry state between questions. Show a trace or explanation in your book before entering a final answer.

CHART 1 | DOUBLE AND ADD ONE
SEQUENCE | DOUBLE AND ADD ONE Follow arrows from START. Decision branches are labelled YES and NO. Loop return arrows run outside the symbols. START INPUT Number Double ← Number × 2 Result ← Double + 1 OUTPUT Result END
SEQUENCE | DOUBLE AND ADD ONE. Read the accompanying numbered method and trace for a text explanation.
CHART 2 | ADMISSION
SELECTION | ADMISSION CHECK Follow arrows from START. Decision branches are labelled YES and NO. Loop return arrows run outside the symbols. YES NO START INPUT Age Age ≥ 12? OUTPUT "Allowed" OUTPUT "Not yet" END
SELECTION | ADMISSION CHECK. Read the accompanying numbered method and trace for a text explanation.
CHART 3 | COUNT FROM 1 TO LIMIT
COUNTED REPETITION | OUTPUT 1 TO LIMIT Follow arrows from START. Decision branches are labelled YES and NO. Loop return arrows run outside the symbols. YES NO START INPUT Limit Count ← 1 Count ≤ Limit? OUTPUT Count Count ← Count + 1 END
COUNTED REPETITION | OUTPUT 1 TO LIMIT. Read the accompanying numbered method and trace for a text explanation.
CHART 4 | TOTAL UNTIL ZERO
PRE-CONDITION | TOTAL UNTIL ZERO Follow arrows from START. Decision branches are labelled YES and NO. Loop return arrows run outside the symbols. YES NO START Total ← 0 INPUT Number Number ≠ 0? Total ← Total + Number INPUT Number OUTPUT Total END
PRE-CONDITION | TOTAL UNTIL ZERO. Read the accompanying numbered method and trace for a text explanation.
CHART 5 | READ UNTIL POSITIVE
POST-CONDITION | ACCEPT A POSITIVE NUMBER Follow arrows from START. Decision branches are labelled YES and NO. Loop return arrows run outside the symbols. NO YES START INPUT Number Number > 0? OUTPUT Number END
POST-CONDITION | ACCEPT A POSITIVE NUMBER. Read the accompanying numbered method and trace for a text explanation.
B1 | A workshop has capacity 2 and currently one booking. Each student may book it once. Which criterion correctly tests the capacity boundary?
B2 | A loan report includes active loans due earlier than today. Today is 24 October. Loan P is active and due 23 October; Q active and due 24 October; R returned and due 22 October. How many qualify?
B3 | Which input specification is most useful for a staff loan operation?
B4 | A model keeps only each workshop capacity and count. It must reject duplicate student/workshop bookings. What necessary information is missing?
B5 | Workshop checks occur in order: known IDs, duplicate, capacity. A known student already booked into a full workshop requests it again. Which result occurs?
B6 | A trip allows one activity allocation per student across the whole trip. Which adapted duplicate rule is needed?
B7 | Same-time cumulative readings are 1275 kWh on 3 October and 1345 kWh on 5 October. What is the two-day interval average in kWh per day?
B8 | Flag sources with more than 20 failures per equivalent five-minute window. Counts are A:4, B:20, C:21, D:48. How many are flagged for review?
B9 | CHART 1: input 6. What single numerical value is output?
B10 | CHART 2: input Age=12. Which message is output?
B11 | CHART 3: input Limit=3. What is the final stored Count?
B12 | CHART 3: input Limit=0. How many numerical outputs occur?
B13 | CHART 4: inputs 3, −2, 0. What value is output?
B14 | CHART 4: inputs 0, 8, 9. How many inputs are consumed before END?
B15 | CHART 5: inputs −2, 0, 5, 7. Which describes the run?
B16 | CHART 3: input Limit=2. Which output sequence is correct?

CHECK SECTIONS A AND B

Unanswered items receive zero. Each checkbox item requires all correct choices and no incorrect extras. Written marks are separate. Changing an answer requires resubmission.

C | WRITTEN COMMUNICATION AND SUBJECT KNOWLEDGE

Write in your exercise book before revealing guidance. Use the IB command terms supplied in the guide. Main commands are highlighted in the questions. For explain, give the reason or mechanism, not merely a concept name. For trace, follow every relevant action, even where your final answer seems obvious.

IB command term What to provide Practical approach
Construct Display information in diagrammatic or logical form Supply the actual organised specification, not merely its headings.
Describe Give a detailed account State relevant features and a specific example.
Explain Give a detailed account including reasons or causes Connect the action to its effect using because, therefore, resulting in or leading to.
Trace Follow and record the actions of an algorithm Record decisions, current values, consumed inputs and outputs as requested.
Distinguish Make clear differences Refer to the concepts and explicitly state how their roles differ.

A connective earns no automatic mark by itself. For example, “retaining timestamps preserves the measurement interval, therefore a two-day total is not incorrectly presented as one day’s consumption” links accurate ideas. Suggested marks reward subject knowledge and the requested actions, not extra unofficial grammar marks.

C1 | SPECIFY A WORKSHOP BOOKING SERVICE

6 suggested marks | COMMON SL/HL

A school receives workshop sign-ups on paper. Entries can be unreadable and capacities are sometimes exceeded. Students may book different workshops but only once per workshop. Existing records contain StudentID, WorkshopID and capacities. The school must use its current computer and cannot pay for subscriptions. Construct a compact problem specification containing all six syllabus components. Treat unprovided policy details as questions or assumptions.

C2 | MAKE SUCCESS CHECKABLE

6 suggested marks | COMMON SL/HL

Explain how a vague requirement, “the lending system must work well”, can be improved into checkable requirements and evaluation evidence. Include one functional criterion, one performance criterion and the limits of the evidence.

C3 | DATA RULES AND REAL-WORLD TRUTH

6 suggested marks | COMMON SL/HL

Explain why a valid StudentID and a recorded return do not guarantee an accurate real-world equipment-loan service. Include input, output and staff responsibilities.

C4 | DISTINGUISH THE FOUR CONCEPTS

6 suggested marks | COMMON SL/HL

Describe the four fundamental computational thinking concepts using a school library example. Make clear what each contributes.

C5 | REPAIR AN OVER-SIMPLIFIED MODEL

6 suggested marks | COMMON SL/HL

A booking model stores only workshop capacities and current counts. Each student may book a workshop once. Explain the weakness and how the model and method should change. Include a contrasting one-activity-per-trip rule.

C6 | COMPUTATIONAL THINKING WITHOUT CODE

6 suggested marks | COMMON SL/HL

Explain how a teacher can use computational thinking to organise a sports event without programming. Include all four concepts and one reason to revisit the plan.

C7 | ANALYSE MISSING METER READINGS

6 suggested marks | COMMON SL/HL

Same-time cumulative readings are 1200 kWh on 1 October, 1230 on 2 October, 1275 on 3 October and 1345 on 5 October. Explain how computational thinking supports a reliable daily-use report and what cannot be concluded.

C8 | PREDICT A DELIVERY DURATION

6 suggested marks | COMMON SL/HL

Explain how computational thinking helps plan machine learning to predict journey duration before departure. Address features, decomposition, patterns and evaluation.

C9 | INVESTIGATE UNUSUAL NETWORK ACTIVITY

6 suggested marks | COMMON SL/HL

Explain how abstraction, decomposition, pattern recognition and algorithmic design support a review of failed network connections. Use the fictional rule “more than 20 failures per five-minute window”, and explain its limits.

C10 | TRACE A COUNTED LOOP

6 suggested marks | COMMON SL/HL

Use CHART 3 in Section B with Limit=3. Trace the changing Count, decisions and output sequence. Then explain why the final Count differs from the final output.

C11 | TRACE A RUNNING TOTAL

6 suggested marks | COMMON SL/HL

Use CHART 4 in Section B with inputs 4, 7, 0, 9. Trace the actions, Total, Number and output. Then explain what happens if the repeated INPUT inside the loop is removed.

C12 | TRACE A POST-CONDITION LOOP

6 suggested marks | COMMON SL/HL

Use CHART 5 with inputs −2, 0, 5, 7. Trace the run. Explain why the body executes at least once and why a true decision exits this loop.

CHECK THE QUALITY OF YOUR RESPONSE

Did you supply a scenario-specific specification for construct, a detailed account for describe, a valid reason or cause for explain, and a recorded route for trace? Check that arrows, comparison boundaries, variables and outputs agree.

Use the six marking points for each written question as guidance: one suggested mark per distinct point. Avoid double-counting repeated wording. Equivalent accurate methods can be valid. Keep the suggested 72 written marks separate from the 32 automatic points, then rewrite two weak responses after revising.

YOUR NEXT REVISION STEP

Submit the automatic sections for targeted revision links.

Record your own written marks using the suggested points. Choose two weaknesses and attempt new examples after revising. Use the B1 revision page for worked content and a personal flashcard list, or return to the IB course index.