K5CS5 Numbers, coding, media and encryption personal learning checklist
AQA A-level Computer Science (VB.NET) · Papers 2
Name ____________________ Class __________ Date __________
Tick one box per statement. Red: need help. Amber: partly confident. Green: can do independently.
| I can | Red | Amber | Green |
|---|---|---|---|
| Number sets, counting and measurement | |||
| distinguish number sets, ordinal positions and finite representations of measured quantities | |||
| Positional bases and information units | |||
| convert binary, decimal and hexadecimal with explicit widths and place weights | |||
| calculate bit-byte and decimal-binary prefix quantities without mixing conventions | |||
| Unsigned arithmetic and two's-complement integers | |||
| perform unsigned binary arithmetic and detect fixed-width range failure | |||
| encode, decode, subtract and extend two's-complement integers with correct range and overflow reasoning | |||
| Fixed-point binary fractions | |||
| convert and evaluate signed fixed-point numbers under a declared point position | |||
| explain finite binary approximation and calculate absolute and relative errors | |||
| Floating point, normalisation and representable limits | |||
| encode and decode simplified floating values using signed mantissa and exponent fields | |||
| normalise positive and negative two's-complement mantissas while preserving value | |||
| derive format limits and evaluate range, precision, rounding and fixed-floating trade-offs | |||
| Character codes and error detection or correction | |||
| distinguish character encodings from numeric data and explain Unicode representation | |||
| apply and evaluate parity and majority-voting error methods | |||
| calculate stated checksum and check-digit rules and explain undetected-error limits | |||
| Bitmaps, vectors and analogue or digital conversion | |||
| explain analogue-digital representation and ADC-DAC stages without conflating time and amplitude resolution | |||
| interpret bitmap dimensions, resolution, colour formats, metadata and storage calculations | |||
| create and evaluate vector primitives and choose vector or bitmap representation by purpose | |||
| Sampled sound, Nyquist and MIDI | |||
| apply audio sampling, quantisation and Nyquist reasoning and calculate raw storage | |||
| explain MIDI event data and compare it with sampled audio for real tasks | |||
| Compression, repeated runs and dictionary methods | |||
| apply and evaluate lossless, lossy, run-length and dictionary compression | |||
| Caesar, Vernam and security assumptions | |||
| apply Caesar encryption and decryption under explicit alphabet and wrap conventions | |||
| apply Vernam XOR and distinguish one-time-pad perfect secrecy from computational security | |||
Next revision priority: __________________________________________________