← Explore the libraryPublic reading pack
UK A Level Computer Science · independent study · myAudience
Independent myAudience subject study using references for England. Published readings cover selected topics; full curriculum, assessment and practical coverage are not verified. No awarding-body affiliation, endorsement, qualification or grade guarantee is offered. Check the source specification and your centre for the requirements of your chosen course.
From a real problem to a precise program contract
Boolean policy, selection and exhaustive evidence
![Array [4,0,7,-1,9] with the consumed prefix highlighted. Completed-iteration trace is (0,0),(1,4),(2,4),(3,11); the sentinel is not added.](/assets/lesson-computing-advanced-loop-v1.webp)
Tracing loops and proving a prefix calculation
![Names a and b share [2,5]; c has a separate outer copy. In the nested example a[0] and c[0] reference the same inner [2], while c[1] references [9].](/assets/lesson-computing-advanced-alias-v2.webp)
Subroutine interfaces, scope and shared objects
Recursive calls, stack frames and induction
![Two-by-three readings matrix with rows [3,5,2] and [7,0,4], totals 10 and 11, and highlighted values[1][2]=4. Two text lines become signed-integer records.](/assets/lesson-computing-advanced-records-v1.webp)
Representing records, arrays and persistent text
Objects, encapsulation and defensible design
Stacks, postfix evaluation and circular queues
![Lower-bound trace over [2,6,6,6,9]: half-open bounds [0,5),[0,2),[0,1) with midpoints 2,1,0; final first match is index 1.](/assets/lesson-computing-advanced-search-v1.webp)
Searching sorted data: bounds, duplicates and proof
![Bubble passes and merge splitting retain [4,1,3,1] as [1,1,3,4]. Teal and amber equal-key records retain arrival order; bubble makes six comparisons.](/assets/lesson-computing-advanced-sorting-v1.webp)
Sorting: invariants, stability and divide-and-conquer
Graph models, BFS and weighted shortest paths
Growth, cost models and the limits of efficiency
Finite states, sets and regular expressions
Context-free grammar, syntax and nested structure
Turing-machine traces and computability limits
![Filter [-2,3,0,5] to [3,0,5], map to [7,1,11], fold to 19. Compositions send 4 to 14 versus 11 according to order.](/assets/lesson-computing-advanced-functional-v1.webp)
First-class functions, composition and folds
Number domains and positional bases
Information capacity and unambiguous storage units
Unsigned addition, multiplication and discarded carries
Two’s complement subtraction and signed boundaries
Fixed-point encoding, quantisation and error budgets
Simplified signed mantissa and exponent
Positive and negative normalisation without changing value
Range, precision, underflow and representation decisions
Read the operand: a value or an address?
Pause, preserve and resume: what an interrupt must protect
Why faster arithmetic can still wait for memory