Computational thinking, data types and variables, control structures, subroutines, validation, data structures, searching and sorting algorithms, programming paradigms, and web technologies — all ten Unit 1 topics in one gamified skill path. Earn XP, collect stars, and build your exam confidence topic by topic.
Work through each topic in order. Click any unlocked node to launch the quiz. Earn three stars to master a topic and unlock the next one.
Past paper mark scheme language, distilled into ten topic cards. Click Quick Quiz on any card to test yourself instantly.
The Unit 1 exam regularly tests your ability to write and analyse pseudocode, complete trace tables, and identify errors in algorithms. Use these tools to practise the calculations and skills directly.
Type or paste pseudocode and check it for common structural errors. The checker looks for missing THEN keywords, unclosed IF blocks, unclosed WHILE and FOR loops, and other common mistakes that appear in exam answers.
Generate a blank trace table ready for you to fill in by hand or on screen. Enter the variable names you want to track and the number of steps, and the table is created instantly. Perfect for practising past paper trace questions.
A quick-reference guide to the six validation checks that appear most frequently in BTEC Unit 1 mark schemes. These exact terms and definitions appear regularly in past papers.
| Check | Purpose | Example |
|---|---|---|
| Presence | Ensures data has been entered | Name field cannot be blank |
| Range | Checks data is within a min/max | Age must be between 0 and 120 |
| Type | Ensures data is the correct data type | Score must be an integer |
| Length | Checks number of characters | Password must be 7 to 15 characters |
| Format | Checks data matches a pattern | Date must be DD/MM/YYYY |
| Lookup | Checks data against a list of valid values | Status must be "on" or "off" |
A past-paper-aligned comparison of the data structures you need to know for Unit 1. Stacks, queues, arrays, records, lists, and sets all appear in exam questions.
| Structure | Key feature | Order |
|---|---|---|
| Stack | Last In, First Out (LIFO). Data added and removed from the top. | LIFO |
| Queue | First In, First Out (FIFO). Added at the back, removed from the front. | FIFO |
| Array | Fixed size. Stores one data type. Accessed by index. | Indexed |
| Record | Groups related data of different types together. | Named fields |
| List | Dynamic size. Can store mixed data types. | Indexed |
| Set | Stores unique elements only. Sorted automatically. | Sorted, unique |
Key Unit 1 terms and definitions drawn from past paper mark scheme language. Click the card to flip it, then mark whether you know it. Cards you mark as unknown cycle back around. Earn +5 XP for every card you know.
Trace through linear search, binary search, bubble sort, and a validation loop one step at a time. Earn 10 XP for completing each trace. These algorithm types appear repeatedly across all past papers.
Earn XP by completing quizzes and using the interactive tools. Your score updates live as you work through the topics.