Know what to study next.

1. Concept revision · 5 minutes

Assignment binds a name to a value. Check the type before combining text and numbers; indentation defines blocks rather than decoration.

Predict this teaching example before revealing its output. This is revision, not a graded task.

count = 3
label = "bugs"
print(count, label, type(count).__name__)

3 bugs int

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Calling a function before defining it
2. Missing indentation after if

3. Reflection · 5 minutes

Explain the difference between defining a name and using it. Save one corrected line in your own notes.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Trace multiplication before addition and distinguish floor division from ordinary division. Use parentheses when the intended grouping is unclear.

Predict this teaching example before revealing its output. This is revision, not a graded task.

print(9 // 4, 9 % 4, 2 + 3 * 4)

2 1 14

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Integer division and modulo
2. Operator precedence

3. Reflection · 5 minutes

Write a quotient/remainder check: dividend = divisor × quotient + remainder.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

A comparison produces a Boolean, while assignment changes a binding. Empty collections and numeric zero are falsy; compare deliberately rather than guessing.

Predict this teaching example before revealing its output. This is revision, not a graded task.

items = []
print(bool(items), 4 == 4, not 0)

False True True

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Using = instead of == in a condition
2. not operator with different types

3. Reflection · 5 minutes

List two falsy values and rewrite one condition in plain English.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Foundations · 25 questions · 30 minutes

Free paper

Treat this as a diagnostic, not a promise of marks. Some topics may be unfamiliar. Keep the full 30-minute slot free and finish the sitting on time.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

range includes its start but excludes its stop. Trace the actual generated integers before reasoning about the body of a for loop.

Predict this teaching example before revealing its output. This is revision, not a graded task.

print(list(range(2, 9, 2)))

[2, 4, 6, 8]

Read the concept guide →

2. Recorded practice · about 10 minutes

1. range() with wrong bounds
2. Loop range boundaries

3. Reflection · 5 minutes

Write the first value, last included value and first excluded value for each solved range.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

A while loop rechecks its condition before each iteration. Identify the variable that changes toward termination and trace it after each update.

Predict this teaching example before revealing its output. This is revision, not a graded task.

n = 3
out = []
while n > 0:
    out.append(n)
    n -= 1
print(out)

[3, 2, 1]

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Infinite while loop — forgot to update the counter
2. while loop with a condition update

3. Reflection · 5 minutes

Make a three-column trace: condition, body output, updated counter.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

break exits a loop; continue skips the remainder of one iteration. Loop else runs only when iteration ends without break.

Predict this teaching example before revealing its output. This is revision, not a graded task.

out = []
for n in range(5):
    if n == 2:
        continue
    out.append(n)
print(out)

[0, 1, 3, 4]

Read the concept guide →

2. Recorded practice · about 10 minutes

1. break vs continue
2. else clause on a for loop

3. Reflection · 5 minutes

Compare a loop that finds a match with one that exhausts its input.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Core Practice · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

Use your baseline weak topics for a short revision before starting, not during the sitting. Submit inside the unchanged server deadline.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

Strings are immutable. Methods such as upper and strip return a new string; calling a method without using its result does not change the original binding.

Predict this teaching example before revealing its output. This is revision, not a graded task.

word = "  debug  "
clean = word.strip().upper()
print(clean, len(word))

DEBUG 9

Read the concept guide →

2. Recorded practice · about 10 minutes

1. String is not converted to uppercase
2. String case methods

3. Reflection · 5 minutes

Show where the returned string is stored. Explain why the original string length did not change.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Negative indices count from the end. Slices exclude their stop and can use a step; trace index positions instead of reading a slice as a word.

Predict this teaching example before revealing its output. This is revision, not a graded task.

text = "coding"
print(text[-1], text[1:5:2])

g oi

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Off-by-one in string slicing
2. String multiplication and indexing

3. Reflection · 5 minutes

Draw the six index positions and mark exactly which positions a slice includes.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

A list index selects one element; membership asks whether an equal value is present. Index zero is the first element, and negative one is the last.

Predict this teaching example before revealing its output. This is revision, not a graded task.

values = [4, 7, 9]
print(values[-1], 7 in values)

9 True

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Wrong index to get the last item
2. Checking membership in a list

3. Reflection · 5 minutes

Separate the question “which position?” from “is this value present?”.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Tricky Edges · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

Trace mutation and boundaries on paper or in your head. Do not run the snippets while sitting the test; review the recorded result afterwards.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

Two names can point to one list. A shallow copy creates a new outer list. append adds one object; extend iterates over its argument.

Predict this teaching example before revealing its output. This is revision, not a graded task.

a = [5]
b = a.copy()
b.extend([6, 7])
print(a, b)

[5] [5, 6, 7]

Read the concept guide →

2. Recorded practice · about 10 minutes

1. List copy vs reference
2. List extend vs append

3. Reflection · 5 minutes

Sketch names pointing to objects, then describe which object each mutation changes.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Bracket lookup raises for a missing key. get can supply a fallback without inserting it. Verify whether a key exists before assuming a value is stored.

Predict this teaching example before revealing its output. This is revision, not a graded task.

counts = {"a": 2}
print(counts.get("b", 0), len(counts))

0 1

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Dictionary get with default
2. Wrong dictionary key

3. Reflection · 5 minutes

Contrast missing keys, stored None values and explicit defaults.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Updating an existing key replaces its value without moving its insertion position. Adding or removing keys during direct iteration changes the dictionary structure.

Predict this teaching example before revealing its output. This is revision, not a graded task.

d = {"first": 1, "second": 2}
d["first"] = 4
print(list(d.items()))

[('first', 4), ('second', 2)]

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Dictionary update() behavior
2. Modifying a dict while looping over it

3. Reflection · 5 minutes

Explain the difference between changing a value and changing dictionary size.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Full Mock · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

Check your topic breakdown rather than only the total score. Use the latest weak-topic suggestions to choose your next short revision.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

A function body runs when called. Reaching its end without return yields None; a printed value is not the same as a returned value.

Predict this teaching example before revealing its output. This is revision, not a graded task.

def triple(n):
    return n * 3
print(triple(5))

15

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Function returning nothing
2. Missing colon after function definition

3. Reflection · 5 minutes

Describe what the caller receives, not just what appeared in the output pane.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Default expressions run once when a function is defined. A mutable default can be reused across calls; use a None sentinel when you need a fresh container.

Predict this teaching example before revealing its output. This is revision, not a graded task.

def collect(n, values=None):
    if values is None:
        values = []
    values.append(n)
    return values
print(collect(3), collect(4))

[3] [4]

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Default parameter values
2. Mutable default argument trap

3. Reflection · 5 minutes

Trace definition time separately from call time. Explain which object a default stores.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Positional arguments bind by order and keywords by name. Comma-separated return values form a tuple, which must match the unpacking targets.

Predict this teaching example before revealing its output. This is revision, not a graded task.

def pair(a, b):
    return a + b, a - b
x, y = pair(b=2, a=8)
print(x, y)

10 6

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Positional arguments in the wrong order
2. Multiple return values

3. Reflection · 5 minutes

Map every argument to its parameter before tracing the function body.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Control Flow & Expressions · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

This new paper covers ranges, branches, short-circuiting and operator rules. It has authored explanations available only after the sitting is graded.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

Assignment inside a function normally creates a local binding. Reading that local before assigning it causes UnboundLocalError, even when a global name exists.

Predict this teaching example before revealing its output. This is revision, not a graded task.

value = 8
def read():
    local = 2
    return value + local
print(read(), value)

10 8

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Modifying a variable before it's assigned locally
2. Calling a variable like a function

3. Reflection · 5 minutes

Annotate each name as local, enclosing, global or built-in.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

A tuple fixes its element references, not the internal state of a referenced mutable object. Unpacking consumes values in order and must match the target pattern.

Predict this teaching example before revealing its output. This is revision, not a graded task.

left, right = (6, 9)
left, right = right, left
print(left, right)

9 6

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Trying to modify a tuple
2. Tuple unpacking with functions

3. Reflection · 5 minutes

Explain the difference between replacing a tuple slot and mutating a list stored in one.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

A handler matches exception classes and their subclasses. Specific handlers should normally precede broad ones. Recovery code should not silently hide unrelated programming errors.

Predict this teaching example before revealing its output. This is revision, not a graded task.

try:
    int("nope")
except ValueError:
    print("invalid number")

invalid number

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Dividing without checking for zero
2. Catching exceptions in the wrong order

3. Reflection · 5 minutes

Name the operation that fails and the first matching handler.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Collections & Mutation · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

Pay attention to aliases, shallow copies and dictionary order. After grading, compare each incorrect choice with the explicit explanation.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

The else block runs only if try finishes normally. A caught exception still skips else. finally is a separate cleanup step and is not conditional on success.

Predict this teaching example before revealing its output. This is revision, not a graded task.

out = []
try:
    n = int("12")
except ValueError:
    out.append("bad")
else:
    out.append(n)
print(out)

[12]

Read the concept guide →

2. Recorded practice · about 10 minutes

1. try-except-else flow
2. Multiple except with a shared exception

3. Reflection · 5 minutes

Trace success and failure paths separately instead of assuming every block executes.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Default split collapses whitespace. With an explicit separator it preserves empty fields. join inserts a separator between string items without adding one at the ends.

Predict this teaching example before revealing its output. This is revision, not a graded task.

parts = " red  blue ".split()
print("/".join(parts))

red/blue

Read the concept guide →

2. Recorded practice · about 10 minutes

1. join() and split()
2. Wrong method to remove whitespace

3. Reflection · 5 minutes

Write the intermediate list before joining it. Check whether any fields are empty.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Read a nested access one bracket at a time. Each intermediate value has its own type, and a valid outer key does not imply a valid inner index or key.

Predict this teaching example before revealing its output. This is revision, not a graded task.

data = {"row": [7, 8]}
print(data["row"][1])

8

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Nested dictionary access
2. Accessing the wrong index in a nested list

3. Reflection · 5 minutes

State the type of each intermediate value in the access chain.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Functions & Scope · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

This paper includes argument binding, defaults, closures and recursion. Use the explanations to separate local-name errors from incorrect returned values.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

Cleanup runs during normal exit and exception propagation. A return in finally can replace an earlier return, and a new exception in finally can mask the original one.

Predict this teaching example before revealing its output. This is revision, not a graded task.

steps = []
try:
    steps.append("work")
finally:
    steps.append("cleanup")
print(steps)

['work', 'cleanup']

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Finally block runs even after return
2. Average calculation crashes on empty input

3. Reflection · 5 minutes

Ask whether cleanup changes the returned object or replaces the pending result.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

A class attribute is shared lookup state. Assigning through an instance can create a shadowing attribute, while mutating a shared class container changes that common object.

Predict this teaching example before revealing its output. This is revision, not a graded task.

class Box:
    size = 2
a, b = Box(), Box()
a.size = 5
print(a.size, b.size)

5 2

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Class variable shared across instances
2. Using a variable before it exists

3. Reflection · 5 minutes

Draw the class dictionary and the instance dictionary separately. The name-lookup task is prerequisite practice, not another class-specific problem.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

A text stream has a cursor: reads advance it, seek repositions it, and closing ends access. StringIO provides a deterministic in-memory stream without a real file.

Predict this teaching example before revealing its output. This is revision, not a graded task.

from io import StringIO
f = StringIO("hello")
print(f.read(1), f.read(2))

h el

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Counting characters with the wrong method
2. String startswith and endswith

3. Reflection · 5 minutes

Write cursor positions before and after each read. The two recorded tasks practise string handling; stream mastery is checked by Paper 9.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Exceptions & Defensive Code · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

Identify the exception that escapes, not just the first one raised. Separate cleanup and handler ordering; late or abandoned attempts do not complete this day.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

Python built-ins call object protocols such as __len__. Methods accessed on an instance bind self automatically. Replacing a name with an incompatible object can fail at lookup or call time.

Predict this teaching example before revealing its output. This is revision, not a graded task.

class Queue:
    def __len__(self):
        return 4
print(len(Queue()))

4

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Wrong function to find list length
2. Calling a function with too few arguments

3. Reflection · 5 minutes

Compare calling a bound method with explicitly supplying the instance through the class. These tasks check length and argument prerequisites; Paper 10 checks protocols.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

sorted creates a new list; list.sort mutates and returns None. A key function receives one item at a time, and stable sorting preserves the input order of equal keys.

Predict this teaching example before revealing its output. This is revision, not a graded task.

names = ["four", "a", "six"]
print(sorted(names, key=len))

['a', 'six', 'four']

Read the concept guide →

2. Recorded practice · about 10 minutes

1. sorted() with a key function
2. Sorting a list with mixed types

3. Reflection · 5 minutes

Write the key for every item before ordering the results.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

An iterator remembers its position and can be exhausted. A list comprehension computes eagerly; a generator expression computes items only as they are requested.

Predict this teaching example before revealing its output. This is revision, not a graded task.

it = iter([4, 5, 6])
print(next(it), list(it), list(it))

4 [5, 6] []

Read the concept guide →

2. Recorded practice · about 10 minutes

1. List slicing with step
2. Dictionary comprehension with condition

3. Reflection · 5 minutes

Track what remains after each consuming operation. The catalogue tasks cover iteration prerequisites; Paper 11 checks generator behavior.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Strings & File-like Streams · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

Reserve 30 minutes. Trace cursor movement and string return values; the examples use in-memory streams, not local files or network resources.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

Every recursive call needs a smaller problem and a reachable base case. Trace the returning values in reverse call order rather than reading only the first call.

Predict this teaching example before revealing its output. This is revision, not a graded task.

def countdown(n):
    return [] if n == 0 else [n] + countdown(n - 1)
print(countdown(3))

[3, 2, 1]

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Comparison chains
2. abs() and type conversion

3. Reflection · 5 minutes

Draw the recursive call stack and identify the base case. The two tracked tasks reinforce conditions and value conversion; recursion itself is covered in Papers 7 and 12.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

A set keeps unique hashable values and has no guaranteed iteration order. Dictionary keys are also unique: later assignments replace earlier values for a repeated key. Sort a set if you need deterministic ordered output.

Predict this teaching example before revealing its output. This is revision, not a graded task.

counts = {}
for ch in "level":
    counts[ch] = counts.get(ch, 0) + 1
print(len(set("level")), counts)

3 {'l': 2, 'e': 2, 'v': 1}

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Dictionary keys must be unique
2. Set removes duplicates automatically

3. Reflection · 5 minutes

Explain why repeated characters change dictionary counts but not the set size. Never rely on a raw set printing in a fixed order.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Classes & Object Behaviour · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

Check instance state, inheritance and protocol contracts. This is objective Python practice, not a proctored credential or a full board-exam paper.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

Use a trace table when several rules interact. Keep track of the iterator value, the current collection and the string result separately.

Predict this teaching example before revealing its output. This is revision, not a graded task.

out = []
for n in range(1, 4):
    out.append("x" * n)
print(out)

['x', 'xx', 'xxx']

Read the concept guide →

2. Recorded practice · about 10 minutes

1. for loop with range and step
2. String multiplication in a loop

3. Reflection · 5 minutes

Explain every output item using an iteration number, not just the final result.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Use the latest full, on-time paper to identify weak topics. Keep the fixed core tasks below; targeted revision suggestions are supplemental and do not create extra completion checkboxes.

Predict this teaching example before revealing its output. This is revision, not a graded task.

items = [3, 8]
print(items[-1], {"ready": True}.get("missing", False))

8 False

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Looping one step too far
2. Accessing a missing dictionary key

3. Reflection · 5 minutes

Choose one server-derived weak-topic suggestion, revisit its rule and explain a wrong answer from your latest paper.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Iterators, Sorting & Comprehensions · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

Trace which operation consumes each iterator value. Do not assume reverse sorting reverses the order of equal-key records.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.

1. Concept revision · 5 minutes

Review the distinction between changing a loop variable and changing an iterator. Also distinguish rebinding a local name from mutating an object shared with the caller.

Predict this teaching example before revealing its output. This is revision, not a graded task.

values = []
for n in range(2):
    values.append(n + 10)
print(values)

[10, 11]

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Loop variable after the loop ends
2. Using a variable before it's defined

3. Reflection · 5 minutes

Write one boundary rule and one scope rule you can recall without opening the solution.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

1. Concept revision · 5 minutes

Predict before running. If a question is unclear, flag it and move on; reserve review time. A planned exam date changes warnings, not the length of this 45-day schedule.

Predict this teaching example before revealing its output. This is revision, not a graded task.

text = "check"
print(len(text), {"score": 6}.get("score"))

5 6

Read the concept guide →

2. Recorded practice · about 10 minutes

1. Mixing text and numbers in print
2. Wrong loop variable for dict values

3. Reflection · 5 minutes

Prepare a checklist: indices, stop exclusivity, return versus print, mutation, scope and exception type. Do not cram multiple 30-minute mocks into one short session.

What completes this day: Both assigned problems must have recorded solved results. Prior mastery counts and is labelled; reading and reflection are not tracked.

Cumulative Python Challenge · 25 questions · 30 minutes

Requires existing Pro access — not a free task or a separate Exam Pack purchase

Use this paper to measure your current Python tracing skills. Completion records the sitting, not guaranteed exam readiness or a guaranteed score. If you missed earlier days, keep catching up after the planned end.

Optional answer review · about 5 minutes after the sitting

After grading, inspect incorrect and unanswered choices. Write one rule you missed, then use your weak-topic suggestions before the next paper.

What completes this day: One full 25-question sitting of this paper, graded on time since your selected start date. A late or abandoned sitting does not complete the day.